Non-defective degeneracy in non-Hermitian bipartite system and the realization in linear circuit

In terms of the random matrix theory, we simulate a non-Hermitian system in Gaussian orthogonal ensemble. Starting from a Hermitian operator with two distinct eigenvalues, we introduce the off-diagonal fluctuations through the random eigenkets, and realizing the bipartite nature through two $8\times 8$ subsystems, where one of them is full ranked, while the other is rank deficient. For the latter subsystem, we verify the non-defective degeneracy containing the non-linear symmetries, as well as the accumulation effect of the linear map in adjacent eigenvectors. Experimently, we observe such effect in a non-reciprocal non-Hermitian linear circuit

Image Completion Based on Edge Prediction and Improved Generator

The existing image completion algorithms may result in problems of poor completion in the missing parts, excessive smoothing or chaotic structure of the completed areas, and large training cycle when processing more complex images. Therefore, a two-stage adversarial image completion model based on edge prediction and improved generator structure has been put forward to solve the existing problems. Firstly, Canny edge detection is utilized to extract the damaged edge image, to predict and to complete the edge information of the missing area of the image in the edge prediction network. Secondly, the predicted edge image is taken as a priori information by the Image completion network to complete the damaged area of the image, so as to make the structure information of the completed area more accurate. A-JPU module is designed to ensure the completion result and speed up training for existing models due to the enormous number of computations caused by the large use of extended convolution in the self-coding structure. Finally, the experimental results on Places 2 dataset show that the PSNR and SSIM of the image using the image completion model are higher and the subjective visual effect is closer to the real image than some other image completion models

Semiconductor Nanowires for Thermoelectric Applications

Ph.DDOCTOR OF PHILOSOPH

Usability Testing for Web Browser: A Case Study of Comparing Chrome, Firefox and IE

This paper compared the performance of the three web browsers: Google Chrome, Mozilla Firefox and Microsoft Internet Explorer from three different aspects: menu display/history searching, bookmark function and downloading function. A usability test was conducted based on participants from University of North Carolina at Chapel Hill. During the test, the quantitative data was reflected by task execution time and mouse-click counts while qualitative data was analyzed using task load and comments from participants. The results indicated that people were most satisfied with Chrome while some function or design of Firefox and IE may dissatisfy the users to some extent.Master of Science in Information Scienc

Regional surname affinity: a spatial network approach

OBJECTIVE We investigate surname affinities among areas of modern‐day China, by constructing a spatial network, and making community detection. It reports a geographical genealogy of the Chinese population that is result of population origins, historical migrations, and societal evolutions. MATERIALS AND METHODS We acquire data from the census records supplied by China's National Citizen Identity Information System, including the surname and regional information of 1.28 billion registered Chinese citizens. We propose a multilayer minimum spanning tree (MMST) to construct a spatial network based on the matrix of isonymic distances, which is often used to characterize the dissimilarity of surname structure among areas. We use the fast unfolding algorithm to detect network communities. RESULTS We obtain a 10‐layer MMST network of 362 prefecture nodes and 3,610 edges derived from the matrix of the Euclidean distances among these areas. These prefectures are divided into eight groups in the spatial network via community detection. We measure the partition by comparing the inter‐distances and intra‐distances of the communities and obtain meaningful regional ethnicity classification. DISCUSSION The visualization of the resulting communities on the map indicates that the prefectures in the same community are usually geographically adjacent. The formation of this partition is influenced by geographical factors, historic migrations, trade and economic factors, as well as isolation of culture and language. The MMST algorithm proves to be effective in geo‐genealogy and ethnicity classification for it retains essential information about surname affinity and highlights the geographical consanguinity of the population.National Natural Science Foundation of China, Grant/Award Numbers: 61773069, 71731002; National Social Science Foundation of China, Grant/Award Number: 14BSH024; Foundation of China of China Scholarships Council, Grant/Award Numbers: 201606045048, 201706040188, 201706040015; DOE, Grant/Award Number: DE-AC07-05Id14517; DTRA, Grant/Award Number: HDTRA1-14-1-0017; NSF, Grant/Award Numbers: CHE-1213217, CMMI-1125290, PHY-1505000 (61773069 - National Natural Science Foundation of China; 71731002 - National Natural Science Foundation of China; 14BSH024 - National Social Science Foundation of China; 201606045048 - Foundation of China of China Scholarships Council; 201706040188 - Foundation of China of China Scholarships Council; 201706040015 - Foundation of China of China Scholarships Council; DE-AC07-05Id14517 - DOE; HDTRA1-14-1-0017 - DTRA; CHE-1213217 - NSF; CMMI-1125290 - NSF; PHY-1505000 - NSF)Published versio

Relative Pairwise Relationship Constrained Non-negative Matrix Factorisation

Non-negative Matrix Factorisation (NMF) has been extensively used in machine learning and data analytics applications. Most existing variations of NMF only consider how each row/column vector of factorised matrices should be shaped, and ignore the relationship among pairwise rows or columns. In many cases, such pairwise relationship enables better factorisation, for example, image clustering and recommender systems. In this paper, we propose an algorithm named, Relative Pairwise Relationship constrained Non-negative Matrix Factorisation (RPR-NMF), which places constraints over relative pairwise distances amongst features by imposing penalties in a triplet form. Two distance measures, squared Euclidean distance and Symmetric divergence, are used, and exponential and hinge loss penalties are adopted for the two measures respectively. It is well known that the so-called "multiplicative update rules" result in a much faster convergence than gradient descend for matrix factorisation. However, applying such update rules to RPR-NMF and also proving its convergence is not straightforward. Thus, we use reasonable approximations to relax the complexity brought by the penalties, which are practically verified. Experiments on both synthetic datasets and real datasets demonstrate that our algorithms have advantages on gaining close approximation, satisfying a high proportion of expected constraints, and achieving superior performance compared with other algorithms.Comment: 13 pages, 10 figure