arXiv subjects

Yang Xu

Publications and source records attributed to Yang Xu.

At least 379 records · Page 21Linked to original sources

arXiv2020

The darkweb: a social network anomaly

We analyse the darkweb and find its structure is unusual. For example, $ \sim 87 \%$ of darkweb sites \emph{never} link to another site. To call the darkweb a "web" is thus a misnomer -- it's better described as a set of largely isolated dark silos. As we show through a detailed comparison to the World Wide Web (www), this siloed structure is highly dissimilar to other social networks and indicates the social behavior of darkweb users is much different to that of www users. We show a generalized preferential attachment model can partially explain the strange topology of the darkweb, but an understanding of the anomalous behavior of its users remains out of reach. Our results are relevant to network scientists, social scientists, and other researchers interested in the social interactions of large numbers of agents.

physics.soc-ph↗

arXiv2020

The Typology of Polysemy: A Multilingual Distributional Framework

Lexical semantic typology has identified important cross-linguistic generalizations about the variation and commonalities in polysemy patterns---how languages package up meanings into words. Recent computational research has enabled investigation of lexical semantics at a much larger scale, but little work has explored lexical typology across semantic domains, nor the factors that influence cross-linguistic similarities. We present a novel computational framework that quantifies semantic affinity, the cross-linguistic similarity of lexical semantics for a concept. Our approach defines a common multilingual semantic space that enables a direct comparison of the lexical expression of concepts across languages. We validate our framework against empirical findings on lexical semantic typology at both the concept and domain levels. Our results reveal an intricate interaction between semantic domains and extra-linguistic factors, beyond language phylogeny, that co-shape the typology of polysemy across languages.

cs.CL↗

arXiv2020

Corpus of Chinese Dynastic Histories: Gender Analysis over Two Millennia

Chinese dynastic histories form a large continuous linguistic space of approximately 2000 years, from the 3rd century BCE to the 18th century CE. The histories are documented in Classical (Literary) Chinese in a corpus of over 20 million characters, suitable for the computational analysis of historical lexicon and semantic change. However, there is no freely available open-source corpus of these histories, making Classical Chinese low-resource. This project introduces a new open-source corpus of twenty-four dynastic histories covered by Creative Commons license. An original list of Classical Chinese gender-specific terms was developed as a case study for analyzing the historical linguistic use of male and female terms. The study demonstrates considerable stability in the usage of these terms, with dominance of male terms. Exploration of word meanings uses keyword analysis of focus corpora created for genderspecific terms. This method yields meaningful semantic representations that can be used for future studies of diachronic semantics.

cs.CL↗

arXiv2020

Multi-Feature Discrete Collaborative Filtering for Fast Cold-start Recommendation

Hashing is an effective technique to address the large-scale recommendation problem, due to its high computation and storage efficiency on calculating the user preferences on items. However, existing hashing-based recommendation methods still suffer from two important problems: 1) Their recommendation process mainly relies on the user-item interactions and single specific content feature. When the interaction history or the content feature is unavailable (the cold-start problem), their performance will be seriously deteriorated. 2) Existing methods learn the hash codes with relaxed optimization or adopt discrete coordinate descent to directly solve binary hash codes, which results in significant quantization loss or consumes considerable computation time. In this paper, we propose a fast cold-start recommendation method, called Multi-Feature Discrete Collaborative Filtering (MFDCF), to solve these problems. Specifically, a low-rank self-weighted multi-feature fusion module is designed to adaptively project the multiple content features into binary yet informative hash codes by fully exploiting their complementarity. Additionally, we develop a fast discrete optimization algorithm to directly compute the binary hash codes with simple operations. Experiments on two public recommendation datasets demonstrate that MFDCF outperforms the state-of-the-arts on various aspects.

cs.IR↗

arXiv2020

An algorithm of selection of meteor candidates in GWAC system

With its large field of view, GWAC can record hundreds of meteors every day. These meteors are valuable treasures for some meteor research groups. It is therefore very important to accurately find all of these meteors. To address the challenge of precisely distinguishing meteors from other elongated objects in a GWAC-like sky survey system, we design and implement a meteor candidate recognition algorithm, including the recognizing and morphology analysis of the light curves of the meteor candidates. Although the algorithm may filter out some real meteors, it can provide a sample of meteor with high confidence. After processing the images of Mini-GWAC taken in two months, we detect 109,000 elongated objects in which more than 90 percent of objects are not meteor. Among the elongated objects, about 5.9% objects are identified as meteors with high confidence, after the filters based upon an existence in a single frame, a single peak in the light curves, and a slow variation of the light curves.

astro-ph.IM↗

arXiv2020

A Real-time Automatic Validation System for Optical Transients detected by GWAC

The ground-based wide-angle camera array (GWAC) generates millions of single frame alerts per night. After the complicated and elaborate filters by multiple methods, a couple of dozens of candidates are still needed to be confirmed by follow-up observations in real-time. In order to free scientists from the complex and high-intensity follow-up tasks, we developed a Real-time Automatic transient Validation System (RAVS), and introduce here its system architecture, data processing flow, database schema, automatic follow-up control flow, and mobile message notification solution. This system is capable of automatically carrying out all operations in real-time without human intervention, including the validation of transient candidates, the adaptive light-curve sampling for identified targets in multi-band, and the pushing of observation results to the mobile client. The running of RAVS shows that an M-type stellar flare event can be well sampled by RAVS without a significant loss of the details, while the observing time is only less than one-third of the time coverage. Because the control logic of RAVS is designed to be independent of the telescope hardware, RAVS can be conveniently transplanted to other telescopes, especially the follow-up system of SVOM. Some future improvements are presented for the adaptive light-curve sampling, after taking into account both the brightness of sources and the evolution trends of the corresponding light-curves.

astro-ph.IM↗

arXiv2020

A Computational Investigation on Denominalization

Language has been a dynamic system and word meanings always have been changed over times. Every time a novel concept or sense is introduced, we need to assign it a word to express it. Also, some changes have happened because the result of a change can be more desirable for humans, or cognitively easier to be used by humans. Finding the patterns of these changes is interesting and can reveal some facts about human cognitive evolution. As we have enough resources for studying this problem, it is a good idea to work on the problem through computational modeling, and that can make the work easier and possible to be studied on large scale. In this work, we want to study the nouns which have been used as verbs after some years of their emergence as nouns and find some commonalities among these nouns. In other words, we are interested in finding what potential requirements are essential for this change.

cs.CL↗

arXiv2020

Application of Pre-training Models in Named Entity Recognition

Named Entity Recognition (NER) is a fundamental Natural Language Processing (NLP) task to extract entities from unstructured data. The previous methods for NER were based on machine learning or deep learning. Recently, pre-training models have significantly improved performance on multiple NLP tasks. In this paper, firstly, we introduce the architecture and pre-training tasks of four common pre-training models: BERT, ERNIE, ERNIE2.0-tiny, and RoBERTa. Then, we apply these pre-training models to a NER task by fine-tuning, and compare the effects of the different model architecture and pre-training tasks on the NER task. The experiment results showed that RoBERTa achieved state-of-the-art results on the MSRA-2006 dataset.

cs.CL↗

arXiv2020

To schedule or not to schedule: when no-scheduling can beat the best-known flow scheduling algorithm in datacenter networks

Conventional wisdom for minimizing the average flow completion time (AFCT) in the datacenter network (DCN), where flow sizes are highly variable, would suggest scheduling every individual flow. However, we show that considering scheduling delay (including scheduler's computational and communication delays), serving most of the flows without any scheduling and only in first-come-first-served (FCFS) manner significantly improves their performance even when it is compared to the shortest remaining processing time (SRPT)-known as optimum algorithm when scheduling delay is zero. To do so, we only require to have two coarse classes of flows categorized based on flows' sizes (1st-class including flows smaller than a threshold, H, and 2nd-class including others) and serve 1st-class flows always before serving 2nd-class ones. To show that, we take SRPT scheduling algorithm accompanied by the global knowledge of flows, formulate impact of scheduling delay on its performance, and prove that for any flow size distribution and network load (<1), there is always a threshold, H, which guarantees 1st-class flows achieve lower AFCT under FCFS compared to SRPT. Our numerically calculated results and extensive flow-level simulations show that on average, more than 90% of flows could be in 1st-class and consequently do not require any scheduling.

cs.NI↗

arXiv2020

Text-based inference of moral sentiment change

We present a text-based framework for investigating moral sentiment change of the public via longitudinal corpora. Our framework is based on the premise that language use can inform people's moral perception toward right or wrong, and we build our methodology by exploring moral biases learned from diachronic word embeddings. We demonstrate how a parameter-free model supports inference of historical shifts in moral sentiment toward concepts such as slavery and democracy over centuries at three incremental levels: moral relevance, moral polarity, and fine-grained moral dimensions. We apply this methodology to visualizing moral time courses of individual concepts and analyzing the relations between psycholinguistic variables and rates of moral sentiment change at scale. Our work offers opportunities for applying natural language processing toward characterizing moral sentiment change in society.

cs.CL↗

arXiv2019

Automated Essay Scoring based on Two-Stage Learning

Current state-of-art feature-engineered and end-to-end Automated Essay Score (AES) methods are proven to be unable to detect adversarial samples, e.g. the essays composed of permuted sentences and the prompt-irrelevant essays. Focusing on the problem, we develop a Two-Stage Learning Framework (TSLF) which integrates the advantages of both feature-engineered and end-to-end AES models. In experiments, we compare TSLF against a number of strong baselines, and the results demonstrate the effectiveness and robustness of our models. TSLF surpasses all the baselines on five-eighths of prompts and achieves new state-of-the-art average performance when without negative samples. After adding some adversarial essays to the original datasets, TSLF outperforms the feature-engineered and end-to-end baselines to a great extent, and shows great robustness.

cs.CL↗

arXiv2019

WSe2/WS2 moiré superlattices: a new Hubbard model simulator

The Hubbard model, first formulated by physicist John Hubbard in the 1960s, is a simple theoretical model of interacting quantum particles in a lattice. The model is thought to capture the essential physics of high-temperature superconductors, magnetic insulators, and other complex emergent quantum many-body ground states. Although the Hubbard model is greatly simplified as a representation of most real materials, it has nevertheless proved difficult to solve accurately except in the one-dimensional case. Physical realization of the Hubbard model in two or three dimensions, which can act as quantum simulators, therefore have a vital role to play in solving the strong-correlation puzzle. Here we obtain a quantum phase diagram of the two-dimensional triangular lattice Hubbard model by studying angle-aligned WSe2/WS2 bilayers, which form moiré superlattices because of the difference in lattice constant between the two two-dimensional materials. We probe both charge and magnetic properties of the system by measuring the dependence of optical response on out-of-plane magnetic field, and on gate-tuned carrier density. At half filling of the first hole moiré superlattice band, we observe a Mott insulating state with antiferromagnetic Curie-Weiss behavior as expected for a Hubbard model in the strong interaction regime. Past half filling, our experiment suggests an antiferromagnetic to paramagnetic quantum phase transition near 0.6 filling. Our results establish a new solid-state platform based on moiré superlattices which can be used to simulate outstanding problems in strong correlation physics that are manifested by triangular lattice Hubbard models.

cond-mat.mtrl-sci↗

arXiv2019

Joint Switch Upgrade and Controller Deployment in Hybrid Software-Defined Networks

To improve traffic management ability, Internet Service Providers (ISPs) are gradually upgrading legacy network devices to programmable devices that support Software-Defined Networking (SDN). The coexistence of legacy and SDN devices gives rise to a hybrid SDN. Existing hybrid SDNs do not consider the potential performance issues introduced by a centralized SDN controller: flow requests processed by a highly loaded controller may experience long tail processing delay; inappropriate multi-controller deployment could increase the propagation delay of flow requests. In this paper, we propose to jointly consider the deployment of SDN switches and their controllers for hybrid SDNs. We formulate the joint problem as an optimization problem that maximizes the number of flows that can be controlled and managed by the SDN and minimizes the propagation delay of flow requests between SDN controllers and switches under a given upgrade budget constraint. We show this problem is NP-hard. To efficiently solve the problem, we propose some techniques (e.g., strengthening the constraints and adding additional valid inequalities) to accelerate the global optimization solver for solving the problem for small networks and an efficient heuristic algorithm for solving it for large networks. The simulation results from real network topologies illustrate the effectiveness of the proposed techniques and show that our proposed heuristic algorithm uses a small number of controllers to manage a high amount of flows with good performance.

cs.NI↗

arXiv2019

High-performance silicon-graphene hybrid plasmonic waveguide photodetectors beyond 1.55 μm

A fast silicon-graphene hybrid plasmonic waveguide photodetectors beyond 1.55 μm is proposed and realized by introducing an ultra-thin wide silicon-on-insulator ridge core region with a narrow metal cap. With this novel design, the light absorption in graphene is enhanced while the metal absorption loss is reduced simultaneously, which helps greatly improve the responsivity as well as shorten the absorption region for achieving fast responses. Furthermore, metal-graphene-metal sandwiched electrodes are introduced to reduce the metal-graphene contact resistance, which is also helpful for improving the response speed. When the photodetector operates at 2 μm, the measured 3dB-bandwidth is >20 GHz (which is limited by the experimental setup) while the 3dB-bandwith calculated from the equivalent circuit with the parameters extracted from the measured S11 is as high as ~100 GHz. To the best of our knowledge, it is the first time to report the waveguide photodetector at 2 μm with a 3dB-bandwidth over 20 GHz. Besides, the present photodetectors also work very well at 1.55 μm. The measured responsivity is about 0.4 A/W under a bias voltage of -0.3 V for an optical power of 0.16 mW, while the measured 3dB-bandwidth is over 40 GHz (limited by the test setup) and the 3 dB-bandwidth estimated from the equivalent circuit is also as high as ~100 GHz, which is one of the best results reported for silicon-graphene photodetectors at 1.55 μm.

physics.app-ph↗

arXiv2019

In-network Congestion-aware Load Balancing at Transport Layer

Load balancing at transport layer is an important function in data centers, content delivery networks, and mobile networks, where per-connection consistency (PCC) has to be met for optimal performance. Cloud-native L4 load balancers are commonly deployed as virtual network functions (VNFs) and are a critical forwarding element in modern cloud infrastructure. We identify load imbalance among service instances as the main cause of additional processing delay caused by transport-layer load balancers. Existing transport-layer load balancers rely on one of two methods: host-level traffic redirection, which may add as much as 12.48% additional traffic to underlying networks, or connection tracking, which consumes a considerable amount of memory in load balancers. Both of these methods result in inefficient usage of network resources. We propose the in-network congestion-aware load Balancer (INCAB) to achieve even load distribution among service instances and optimal network resources usage in addition to meeting the PCC requirement. We show that INCAB is capable of identifying and monitoring each instance's most-utilized resource and can improve the load distribution among all service instances. INCAB utilizes a Bloom filter and an ultra-compact connection table for in-network flow distribution. Furthermore, it does not rely on end hosts for traffic redirection. Our flow level simulations show that INCAB improves flows' average completion time by 31.97% compared to stateless solutions.

cs.NI↗

arXiv2019

Fourier-based Rotation-invariant Feature Boosting: An Efficient Framework for Geospatial Object Detection

Geospatial object detection of remote sensing imagery has been attracting an increasing interest in recent years, due to the rapid development in spaceborne imaging. Most of previously proposed object detectors are very sensitive to object deformations, such as scaling and rotation. To this end, we propose a novel and efficient framework for geospatial object detection in this letter, called Fourier-based rotation-invariant feature boosting (FRIFB). A Fourier-based rotation-invariant feature is first generated in polar coordinate. Then, the extracted features can be further structurally refined using aggregate channel features. This leads to a faster feature computation and more robust feature representation, which is good fitting for the coming boosting learning. Finally, in the test phase, we achieve a fast pyramid feature extraction by estimating a scale factor instead of directly collecting all features from image pyramid. Extensive experiments are conducted on two subsets of NWPU VHR-10 dataset, demonstrating the superiority and effectiveness of the FRIFB compared to previous state-of-the-art methods.

cs.CV↗

arXiv2019

Pressure-controlled interlayer magnetism in atomically thin CrI3

Stacking order can significantly influence the physical properties of two-dimensional (2D) van der Waals materials. The recent isolation of atomically thin magnetic materials opens the door for control and design of magnetism via stacking order. Here we apply hydrostatic pressure up to 2 GPa to modify the stacking order in a prototype van der Waals magnetic insulator CrI3. We observe an irreversible interlayer antiferromagnetic (AF) to ferromagnetic (FM) transition in atomically thin CrI3 by magnetic circular dichroism and electron tunneling measurements. The effect is accompanied by a monoclinic to a rhombohedral stacking order change characterized by polarized Raman spectroscopy. Before the structural change, the interlayer AF coupling energy can be tuned up by nearly 100% by pressure. Our experiment reveals interlayer FM coupling, which is the established ground state in bulk CrI3, but never observed in native exfoliated thin films. The observed correlation between the magnetic ground state and the stacking order is in good agreement with first principles calculations and suggests a route towards nanoscale magnetic textures by moiré engineering.

cond-mat.mes-hall↗

arXiv2019

Toward Optimal Performance with Network Assisted TCP at Mobile Edge

In contrast to the classic fashion for designing distributed end-to-end (e2e) TCP schemes for cellular networks (CN), we explore another design space by having the CN assist the task of the transport control. We show that in the emerging cellular architectures such as mobile/multi-access edge computing (MEC), where the servers are located close to the radio access network (RAN), significant improvements can be achieved by leveraging the nature of the logically centralized network measurements at the RAN and passing information such as its minimum e2e delay and access link capacity to each server. Particularly, a Network Assistance module (located at the mobile edge) will pair up with wireless scheduler to provide feedback information to each server and facilitate the task of congestion control. To that end, we present two Network Assisted schemes called NATCP (a clean-slate design replacing TCP at end-hosts) and NACubic (a backward compatible design requiring no change for TCP at end-hosts). Our preliminary evaluations using real cellular traces show that both schemes dramatically outperform existing schemes both in single-flow and multi-flow scenarios.

cs.NI↗