arXiv subjects

Rui Zhou

Publications and source records attributed to Rui Zhou.

At least 145 records · Page 8Linked to original sources

arXiv2021

A General Framework for Revealing Human Mind with auto-encoding GANs

Addressing the question of visualising human mind could help us to find regions that are associated with observed cognition and responsible for expressing the elusive mental image, leading to a better understanding of cognitive function. The traditional approach treats brain decoding as a classification problem, reading the mind through statistical analysis of brain activity. However, human thought is rich and varied, that it is often influenced by more of a combination of object features than a specific type of category. For this reason, we propose an end-to-end brain decoding framework which translates brain activity into an image by latent space alignment. To find the correspondence from brain signal features to image features, we embedded them into two latent spaces with modality-specific encoders and then aligned the two spaces by minimising the distance between paired latent representations. The proposed framework was trained by simultaneous electroencephalogram and functional MRI data, which were recorded when the subjects were viewing or imagining a set of image stimuli. In this paper, we focused on implementing the fMRI experiment. Our experimental results demonstrated the feasibility of translating brain activity to an image. The reconstructed image matches image stimuli approximate in both shape and colour. Our framework provides a promising direction for building a direct visualisation to reveal human mind.

q-bio.NC↗

arXiv2021

Searching Personalized $k$-wing in Large and Dynamic Bipartite Graphs

There are extensive studies focusing on the application scenario that all the bipartite cohesive subgraphs need to be discovered in a bipartite graph. However, we observe that, for some applications, one is interested in finding bipartite cohesive subgraphs containing a specific vertex. In this paper, we study a new query dependent bipartite cohesive subgraph search problem based on $k$-wing model, named as the personalized $k$-wing search problem. We introduce a $k$-wing equivalence relationship to summarize the edges of a bipartite graph $G$ into groups. Therefore, all the edges of $G$ are segregated into different groups, i.e. $k$-wing equivalence class, forming an efficient and wing number conserving index called EquiWing. Further, we propose a more compact version of EquiWing, EquiWing-Comp, which is achieved by integrating our proposed $k$-butterfly loose approach and discovered hierarchy properties. These indices are used to expedite the personalized $k$-wing search with a non-repetitive access to $G$, which leads to linear algorithms for searching the personalized $k$-wing. Moreover, we conduct a thorough study on the maintenance of the proposed indices for evolving bipartite graphs. We discover novel properties that help us localize the scope of the maintenance at a low cost. By exploiting the discoveries, we propose novel algorithms for maintaining the two indices, which substantially reduces the cost of maintenance. We perform extensive experimental studies in real, large-scale graphs to validate the efficiency and effectiveness of EquiWing and EquiWing-Comp compared to the baseline.

cs.DB↗

arXiv2020

Efficiently Finding a Maximal Clique Summary via Effective Sampling

Maximal clique enumeration (MCE) is a fundamental problem in graph theory and is used in many applications, such as social network analysis, bioinformatics, intelligent agent systems, cyber security, etc. Most existing MCE algorithms focus on improving the efficiency rather than reducing the output size. The output unfortunately could consist of a large number of maximal cliques. In this paper, we study how to report a summary of less overlapping maximal cliques. The problem was studied before, however, after examining the pioneer approach, we consider it still not satisfactory. To advance the research along this line, our paper attempts to make four contributions: (a) we propose a more effective sampling strategy, which produces a much smaller summary but still ensures that the summary can somehow witness all the maximal cliques and the expectation of each maximal clique witnessed by the summary is above a predefined threshold; (b) we prove that the sampling strategy is optimal under certain optimality conditions; (c) we apply clique-size bounding and design new enumeration order to approach the optimality conditions; and (d) to verify experimentally, we test eight real benchmark datasets that have a variety of graph characteristics. The results show that our new sampling strategy consistently outperforms the state-of-the-art approach by producing smaller summaries and running faster on all the datasets.

cs.DB↗

arXiv2020

Solving High-Order Portfolios via Successive Convex Approximation Algorithms

The first moment and second central moments of the portfolio return, a.k.a. mean and variance, have been widely employed to assess the expected profit and risk of the portfolio. Investors pursue higher mean and lower variance when designing the portfolios. The two moments can well describe the distribution of the portfolio return when it follows the Gaussian distribution. However, the real world distribution of assets return is usually asymmetric and heavy-tailed, which is far from being a Gaussian distribution. The asymmetry and the heavy-tailedness are characterized by the third and fourth central moments, i.e., skewness and kurtosis, respectively. Higher skewness and lower kurtosis are preferred to reduce the probability of extreme losses. However, incorporating high-order moments in the portfolio design is very difficult due to their non-convexity and rapidly increasing computational cost with the dimension. In this paper, we propose a very efficient and convergence-provable algorithm framework based on the successive convex approximation (SCA) algorithm to solve high-order portfolios. The efficiency of the proposed algorithm framework is demonstrated by the numerical experiments.

q-fin.PM↗

arXiv2020

Index-based Solutions for Efficient Density Peak Clustering

Density Peak Clustering (DPC), a popular density-based clustering approach, has received considerable attention from the research community primarily due to its simplicity and fewer-parameter requirement. However, the resultant clusters obtained using DPC are influenced by the sensitive parameter $d_c$, which depends on data distribution and requirements of different users. Besides, the original DPC algorithm requires visiting a large number of objects, making it slow. To this end, this paper investigates index-based solutions for DPC. Specifically, we propose two list-based index methods viz. (i) a simple List Index, and (ii) an advanced Cumulative Histogram Index. Efficient query algorithms are proposed for these indices which significantly avoids irrelevant comparisons at the cost of space. For memory-constrained systems, we further introduce an approximate solution to the above indices which allows substantial reduction in the space cost, provided that slight inaccuracies are admissible. Furthermore, owing to considerably lower memory requirements of existing tree-based index structures, we also present effective pruning techniques and efficient query algorithms to support DPC using the popular Quadtree Index and R-tree Index. Finally, we practically evaluate all the above indices and present the findings and results, obtained from a set of extensive experiments on six synthetic and real datasets. The experimental insights obtained can help to guide in selecting a befitting index.

cs.DB↗

arXiv2020

Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs

Given a bipartite graph, the maximum balanced biclique (\textsf{MBB}) problem, discovering a mutually connected while equal-sized disjoint sets with the maximum cardinality, plays a significant role for mining the bipartite graph and has numerous applications. Despite the NP-hardness of the \textsf{MBB} problem, in this paper, we show that an exact \textsf{MBB} can be discovered extremely fast in bipartite graphs for real applications. We propose two exact algorithms dedicated for dense and sparse bipartite graphs respectively. For dense bipartite graphs, an $\mathcal{O}^{*}( 1.3803^{n})$ algorithm is proposed. This algorithm in fact can find an \textsf{MBB} in near polynomial time for dense bipartite graphs that are common for applications such as VLSI design. This is because, using our proposed novel techniques, the search can fast converge to sufficiently dense bipartite graphs which we prove to be polynomially solvable. For large sparse bipartite graphs typical for applications such as biological data analysis, an $\mathcal{O}^{*}( 1.3803^{\ddotδ})$ algorithm is proposed, where $\ddotδ$ is only a few hundreds for large sparse bipartite graphs with millions of vertices. The indispensible optimizations that lead to this time complexity are: we transform a large sparse bipartite graph into a limited number of dense subgraphs with size up to $\ddotδ$ and then apply our proposed algorithm for dense bipartite graphs on each of the subgraphs. To further speed up this algorithm, tighter upper bounds, faster heuristics and effective reductions are proposed, allowing an \textsf{MBB} to be discovered within a few seconds for bipartite graphs with millions of vertices. Extensive experiments are conducted on synthetic and real large bipartite graphs to demonstrate the efficiency and effectiveness of our proposed algorithms and techniques.

cs.DS↗

arXiv2020

Early Detection of Retinopathy of Prematurity (ROP) in Retinal Fundus Images Via Convolutional Neural Networks

Retinopathy of prematurity (ROP) is an abnormal blood vessel development in the retina of a prematurely-born infant or an infant with low birth weight. ROP is one of the leading causes for infant blindness globally. Early detection of ROP is critical to slow down and avert the progression to vision impairment caused by ROP. Yet there is limited awareness of ROP even among medical professionals. Consequently, dataset for ROP is limited if ever available, and is in general extremely imbalanced in terms of the ratio between negative images and positive ones. In this study, we formulate the problem of detecting ROP in retinal fundus images in an optimization framework, and apply state-of-art convolutional neural network techniques to solve this problem. Experimental results based on our models achieve 100 percent sensitivity, 96 percent specificity, 98 percent accuracy, and 96 percent precision. In addition, our study shows that as the network gets deeper, more significant features can be extracted for better understanding of ROP.

eess.IV↗

arXiv2020

NMR and NQR studies on transition-metal arsenide superconductors LaRu2As2, KCa2Fe4As4F2, and A2Cr3As3

We report 75As-nuclear magnetic resonance (NMR) and nuclear quadrupole resonance (NQR) measurements on transition-metal arsenides LaRu2As2, KCa2Fe4As4F2, and A2Cr3As3. In the superconducting state of LaRu2As2, a Hebel- Slichter coherence peak is found in the temperature dependence of the spin-lattice relaxation rate-1/T1 just below Tc, which indicates that LaRu2As2 is a full-gap superperconducor. For KCa2Fe4As4F2, antiferromagnetic spin fluctuations are observed in the normal state. We further find that the anisotropy rate RAF = Tc1/Tab1 is small and temperature independent, implying that the low energy spin fluctuations are isotropic in spin space. Our results indicate that KCa2Fe4As4F2 is a moderately overdoped iron-arsenide high-temperature superconductor with a stoichiometric composition. For A2Cr3As3, we calculate the electric field gradient by first-principle method and assign the 75As-NQR peaks with two crystallographically different As sites, paving the way for further NMR investigation.

cond-mat.supr-con↗

arXiv2020

Efficient Deep Representation Learning by Adaptive Latent Space Sampling

Supervised deep learning requires a large amount of training samples with annotations (e.g. label class for classification task, pixel- or voxel-wised label map for segmentation tasks), which are expensive and time-consuming to obtain. During the training of a deep neural network, the annotated samples are fed into the network in a mini-batch way, where they are often regarded of equal importance. However, some of the samples may become less informative during training, as the magnitude of the gradient start to vanish for these samples. In the meantime, other samples of higher utility or hardness may be more demanded for the training process to proceed and require more exploitation. To address the challenges of expensive annotations and loss of sample informativeness, here we propose a novel training framework which adaptively selects informative samples that are fed to the training process. The adaptive selection or sampling is performed based on a hardness-aware strategy in the latent space constructed by a generative model. To evaluate the proposed training framework, we perform experiments on three different datasets, including MNIST and CIFAR-10 for image classification task and a medical image dataset IVUS for biophysical simulation task. On all three datasets, the proposed framework outperforms a random sampling method, which demonstrates the effectiveness of proposed framework.

cs.CV↗

arXiv2019

Finding Effective Geo-Social Group for Impromptu Activity with Multiple Demands

Geo-social group search aims to find a group of people proximate to a location while socially related. One of the driven applications for geo-social group search is organizing an impromptu activity. This is because the social cohesiveness of a found geo-social group ensures a good communication atmosphere and the spatial closeness of the geo-social group reduces the preparation time for the activity. Most existing works treat geo-social group search as a problem that finds a group satisfying a single social constraint while optimizing the spatial proximity. However, when an impromptu activity has additional demands on attendees, e.g., the activity requires that the attendees have certain set of skills, the existing works cannot find an effective geo-social group efficiently. In this paper, we study how to find a group that is most proximate to a query location while satisfying multiple constraints. Specifically, the multiple constraints on which we focus include social constraint, size constraint and keyword constraint. We propose a novel search framework which first effectively narrows down the search space with theoretical guarantees and then efficiently finds the optimum result. Although our model considers multiple constraints, novel techniques devised in this paper ensure that search cost is equivalent to parameterized constant times of one time social constraint checking on a vastly restricted search space. We conduct extensive experiments on both real and semi-synthetic datasets for demonstrating the efficiency of the proposed search algorithm. To evaluate the effectiveness, we conduct two case studies on real datasets, demonstrating the superiority of our proposed model.

cs.DB↗

arXiv2019

Fine-Grained Emotion Classification of Chinese Microblogs Based on Graph Convolution Networks

Microblogs are widely used to express people's opinions and feelings in daily life. Sentiment analysis (SA) can timely detect personal sentiment polarities through analyzing text. Deep learning approaches have been broadly used in SA but still have not fully exploited syntax information. In this paper, we propose a syntax-based graph convolution network (GCN) model to enhance the understanding of diverse grammatical structures of Chinese microblogs. In addition, a pooling method based on percentile is proposed to improve the accuracy of the model. In experiments, for Chinese microblogs emotion classification categories including happiness, sadness, like, anger, disgust, fear, and surprise, the F-measure of our model reaches 82.32% and exceeds the state-of-the-art algorithm by 5.90%. The experimental results show that our model can effectively utilize the information of dependency parsing to improve the performance of emotion detection. What is more, we annotate a new dataset for Chinese emotion classification, which is open to other researchers.

cs.CL↗

arXiv2019

Robust Factor Analysis Parameter Estimation

This paper considers the problem of robustly estimating the parameters of a heavy-tailed multivariate distribution when the covariance matrix is known to have the structure of a low-rank matrix plus a diagonal matrix as considered in factor analysis (FA). By assuming the observed data to follow the multivariate Student's t distribution, we can robustly estimate the parameters via maximum likelihood estimation (MLE). However, the MLE of parameters becomes an intractable problem when the multivariate Student's t distribution and the FA structure are both introduced. In this paper, we propose an algorithm based on the generalized expectation maximization (GEM) method to obtain estimators. The robustness of our proposed method is further enhanced to cope with missing values. Finally, we show the performance of our proposed algorithm using both synthetic data and real financial data.

stat.CO↗

arXiv2019

Hidden magnetism at the pseudogap critical point of a high temperature superconductor

The mysterious pseudogap phase of cuprate superconductors ends at a critical hole doping level p* but the nature of the ground state below p* is still debated. Here, we show that the genuine nature of the magnetic ground state in La2-xSrxCuO4 is hidden by competing effects from superconductivity: applying intense magnetic fields to quench superconductivity, we uncover the presence of glassy antiferromagnetic order up to the pseudogap boundary p* ~ 0.19, and not above. There is thus a quantum phase transition at p*, which is likely to underlie highfield observations of a fundamental change in electronic properties across p*. Furthermore, the continuous presence of quasi-static moments from the insulator up to p* suggests that the physics of the doped Mott insulator is relevant through the entire pseudogap regime and might be more fundamentally driving the transition at p* than just spin or charge ordering.

cond-mat.supr-con↗

arXiv2018

Optimal Portfolio Design for Statistical Arbitrage in Finance

In this paper, the optimal mean-reverting portfolio (MRP) design problem is considered, which plays an important role for the statistical arbitrage (a.k.a. pairs trading) strategy in financial markets. The target of the optimal MRP design is to construct a portfolio from the underlying assets that can exhibit a satisfactory mean reversion property and a desirable variance property. A general problem formulation is proposed by considering these two targets and an investment leverage constraint. To solve this problem, a successive convex approximation method is used. The performance of the proposed model and algorithms are verified by numerical simulations.

q-fin.PM↗

arXiv2016

Mitigation of relative intensity noise of Quantum Dash mode-locked lasers for PAM4 based optical interconnects using encoding techniques

Quantum Dash (Q-Dash) Passively Mode-Locked Lasers (PMLLs) exhibit significant low frequency Relative Intensity Noise (RIN), due to the high Mode Partition Noise (MPN), which prevents the implementation of multilevel amplitude modulation formats such as PAM4. The authors demonstrate low frequency RIN mitigation by employing 8B/10B and Manchester encoding with PAM4 modulation format. These encoding techniques reduce the overlap between the modulation spectral content and the low-frequency RIN of the Q-Dash devices, at the expense of increased overhead. The RIN of the 33.6 GHz free spectral range Q-Dash PMLL was characterized, and the results obtained show very high levels of RIN from DC to 4 GHz, but low levels for higher frequencies. The performance improvement for 28 GBaud 8B/10B and Manchester encoded PAM4 signal has been demonstrated compared to the case when no encoding is used. Finally, the effect of RIN on the system performance was demonstrated by comparing the Bit Error Rate (BER) performance of the PAM4 signaling obtained with an External Cavity Laser (ECL) to those obtained with Q-Dash PMLL.

cs.NI↗

arXiv2015

Numerical investigation into the injection-locking phenomena of gain switched lasers for optical frequency comb generation

We present detailed numerical simulations of the laser dynamics that describe optical frequency comb formation by injection-locking a gain-switched laser. The typical rate equations for semiconductor lasers including stochastic carrier recombination and spontaneous emission suffice to show the injection-locking behavior of gain switched lasers, and we show how the optical frequency comb evolves starting from the free-running state, right through the final injection- locked state. Unlike the locking of continuous wave lasers, we show that the locking range for gain switched lasers is considerably greater because injection locking can be achieved by injecting at frequencies close to one of the comb lines. The quality of the comb lines are formally assessed by calculating the FM-noise spectral density and we show that under injection-locking conditions the FM-noise spectral density of the comb lines tend to that of the maser laser.

physics.optics↗

arXiv2014

Efficient Truss Maintenance in Evolving Networks

Truss was proposed to study social network data represented by graphs. A k-truss of a graph is a cohesive subgraph, in which each edge is contained in at least k-2 triangles within the subgraph. While truss has been demonstrated as superior to model the close relationship in social networks and efficient algorithms for finding trusses have been extensively studied, very little attention has been paid to truss maintenance. However, most social networks are evolving networks. It may be infeasible to recompute trusses from scratch from time to time in order to find the up-to-date $k$-trusses in the evolving networks. In this paper, we discuss how to maintain trusses in a graph with dynamic updates. We first discuss a set of properties on maintaining trusses, then propose algorithms on maintaining trusses on edge deletions and insertions, finally, we discuss truss index maintenance. We test the proposed techniques on real datasets. The experiment results show the promise of our work.

cs.DB↗

arXiv2013

Quasi-SLCA based Keyword Query Processing over Probabilistic XML Data

The probabilistic threshold query is one of the most common queries in uncertain databases, where a result satisfying the query must be also with probability meeting the threshold requirement. In this paper, we investigate probabilistic threshold keyword queries (PrTKQ) over XML data, which is not studied before. We first introduce the notion of quasi-SLCA and use it to represent results for a PrTKQ with the consideration of possible world semantics. Then we design a probabilistic inverted (PI) index that can be used to quickly return the qualified answers and filter out the unqualified ones based on our proposed lower/upper bounds. After that, we propose two efficient and comparable algorithms: Baseline Algorithm and PI index-based Algorithm. To accelerate the performance of algorithms, we also utilize probability density function. An empirical study using real and synthetic data sets has verified the effectiveness and the efficiency of our approaches.

cs.DB↗