arXiv subjects

Junjie Wang

Publications and source records attributed to Junjie Wang.

285 records · Page 16Linked to original sources

arXiv2020

Acoustic Word Embedding System for Code-Switching Query-by-example Spoken Term Detection

In this paper, we propose a deep convolutional neural network-based acoustic word embedding system on code-switching query by example spoken term detection. Different from previous configurations, we combine audio data in two languages for training instead of only using one single language. We transform the acoustic features of keyword templates and searching content to fixed-dimensional vectors and calculate the distances between keyword segments and searching content segments obtained in a sliding manner. An auxiliary variability-invariant loss is also applied to training data within the same word but different speakers. This strategy is used to prevent the extractor from encoding undesired speaker- or accent-related information into the acoustic word embeddings. Experimental results show that our proposed system produces promising searching results in the code-switching test scenario. With the increased number of templates and the employment of variability-invariant loss, the searching performance is further enhanced.

eess.AS↗

arXiv2020

DIHARD II is Still Hard: Experimental Results and Discussions from the DKU-LENOVO Team

In this paper, we present the submitted system for the second DIHARD Speech Diarization Challenge from the DKULENOVO team. Our diarization system includes multiple modules, namely voice activity detection (VAD), segmentation, speaker embedding extraction, similarity scoring, clustering, resegmentation and overlap detection. For each module, we explore different techniques to enhance performance. Our final submission employs the ResNet-LSTM based VAD, the Deep ResNet based speaker embedding, the LSTM based similarity scoring and spectral clustering. Variational Bayes (VB) diarization is applied in the resegmentation stage and overlap detection also brings slight improvement. Our proposed system achieves 18.84% DER in Track1 and 27.90% DER in Track2. Although our systems have reduced the DERs by 27.5% and 31.7% relatively against the official baselines, we believe that the diarization task is still very difficult.

eess.AS↗

arXiv2020

Dimensionalities and multiplicities determination of crystal nets

Low-dimensional materials have attracted significant attentions over the past decade. To discover new low-dimensional materials, high-throughout screening methods have been applied in different materials databases. For this purpose, the reliability of dimensionality identification is therefore highly important. In this work, we find that the existence of self-penetrating nets may lead to incorrect results by previous methods. In stead of this, we use the quotient graph to analysis the topologies of structures and compute their dimensionalities. Based on the quotient graph, we can calculate not only the dimensionality but also the multiplicity of self-penetrating structures. As a demonstration, we screened the Crystallography Open Database using our method and found hundreds of structures with different dimensionalities and high multiplicities up to eleven.

cond-mat.mtrl-sci↗

arXiv2019

Heterogeneous Graph-based Knowledge Transfer for Generalized Zero-shot Learning

Generalized zero-shot learning (GZSL) tackles the problem of learning to classify instances involving both seen classes and unseen ones. The key issue is how to effectively transfer the model learned from seen classes to unseen classes. Existing works in GZSL usually assume that some prior information about unseen classes are available. However, such an assumption is unrealistic when new unseen classes appear dynamically. To this end, we propose a novel heterogeneous graph-based knowledge transfer method (HGKT) for GZSL, agnostic to unseen classes and instances, by leveraging graph neural network. Specifically, a structured heterogeneous graph is constructed with high-level representative nodes for seen classes, which are chosen through Wasserstein barycenter in order to simultaneously capture inter-class and intra-class relationship. The aggregation and embedding functions can be learned through graph neural network, which can be used to compute the embeddings of unseen classes by transferring the knowledge from their neighbors. Extensive experiments on public benchmark datasets show that our method achieves state-of-the-art results.

cs.LG↗

arXiv2019

Novel MAB phases and insights into their exfoliation into 2D MBenes

Considering the recent breakthroughs in the synthesis of novel two-dimensional (2D) materials from layered bulk structures, ternary layered transition metal borides, known as MAB phases, have come under scrutiny as a means of obtaining novel 2D transition metal borides, so-called MBene. Here, based on a set of phonon calculations, we show the dynamic stability of many Al-containing MAB phases, MAlB (M = Ti, Hf, V, Nb, Ta, Cr, Mo, W, Mn, Tc), M$_2$AlB$_2$ (Sc, Ti, Zr, Hf, V, Cr, Mo, W, Mn, Tc, Fe, Rh, Ni), M$_3$Al$_2$B$_2$ (M = Sc, T, Zr, Hf, Cr, Mn, Tc, Fe, Ru, Ni), M$_3$AlB$_4$ (M = Sc, Ti, Zr, Hf, V, Nb, Ta, Cr, Mo, W, Mn, Fe), and M$_4$AlB$_6$ (M = Sc, Ti, Zr, Hf, V, Nb, Ta, Cr, Mo). By comparing the formation energies of these MAB phases with those of their available competing binary M$-$B and M$-$Al, and ternary M$-$Al$-$B phases, we find that some of the Sc-, Ti-, V-, Cr-, Mo-, W-, Mn-, Tc-, and Fe-based MAB phases could be favorably synthesized in an appropriate experimental condition. In addition, by examining the strengths of various bonds in MAB phases via crystal orbital Hamilton population and spring constant calculations, we find that the B$-$B and then M$-$B bonds are stiffer than the M$-$Al and Al$-$B bonds. The different strength between these bonds implies the etching possibility of Al atoms from MAB phases, consequently forming various 2D MB, M$_2$B$_3$, and M$_3$B$_4$ MBenes. Furthermore, we employ the nudged elastic band method to investigate the possibility of the structural phase transformation of the 2D MB MBenes into graphene-like boron sheets sandwiched between transition metals and find that the energy barrier of the transformation is less than $0.4$ eV/atom.

cond-mat.mtrl-sci↗

arXiv2019

Lane Change Decision-making through Deep Reinforcement Learning with Rule-based Constraints

Autonomous driving decision-making is a great challenge due to the complexity and uncertainty of the traffic environment. Combined with the rule-based constraints, a Deep Q-Network (DQN) based method is applied for autonomous driving lane change decision-making task in this study. Through the combination of high-level lateral decision-making and low-level rule-based trajectory modification, a safe and efficient lane change behavior can be achieved. With the setting of our state representation and reward function, the trained agent is able to take appropriate actions in a real-world-like simulator. The generated policy is evaluated on the simulator for 10 times, and the results demonstrate that the proposed rule-based DQN method outperforms the rule-based approach and the DQN method.

cs.RO↗

arXiv2019

Ternary Inorganic Electrides with mixed bonding

A high-throughput screening based on first-principles calculations was performed to search for new ternary inorganic electrides. From the available materials database, we identified three new thermodynamically stable materials (Li$_{12}$Mg$_3$Si$_4$, NaBa$_2$O and Ca$_5$Ga$_2$N$_4$) as potential electrides made by main group elements, in addition to the well known mayenite based electride (C12A7:$e^-$). Different from those conventional inorganic electrides in which the excess electrons play only the role of anions, the three new materials, resembling the electrides found in simple metals under high pressure, possess mixed ionic and metallic bonding. The interplay between two competing mechanisms, together with the different crystal packing motifs, gives rise to a variety of geometries in anionic electrons, and rich physical phenomena such as ferromagnetism, superconductivity and metal-insulator transition. Our finding here bridges the gap between electrides found at ambient and high pressure conditions.

cond-mat.mtrl-sci↗

arXiv2019

Superion: Grammar-Aware Greybox Fuzzing

In recent years, coverage-based greybox fuzzing has proven itself to be one of the most effective techniques for finding security bugs in practice. Particularly, American Fuzzy Lop (AFL for short) is deemed to be a great success in fuzzing relatively simple test inputs. Unfortunately, when it meets structured test inputs such as XML and JavaScript, those grammar-blind trimming and mutation strategies in AFL hinder the effectiveness and efficiency. To this end, we propose a grammar-aware coverage-based greybox fuzzing approach to fuzz programs that process structured inputs. Given the grammar (which is often publicly available) of test inputs, we introduce a grammar-aware trimming strategy to trim test inputs at the tree level using the abstract syntax trees (ASTs) of parsed test inputs. Further, we introduce two grammar-aware mutation strategies (i.e., enhanced dictionary-based mutation and tree-based mutation). Specifically, tree-based mutation works via replacing subtrees using the ASTs of parsed test inputs. Equipped with grammar-awareness, our approach can carry the fuzzing exploration into width and depth. We implemented our approach as an extension to AFL, named Superion; and evaluated the effectiveness of Superion on real-life large-scale programs (a XML engine libplist and three JavaScript engines WebKit, Jerryscript and ChakraCore). Our results have demonstrated that Superion can improve the code coverage (i.e., 16.7% and 8.8% in line and function coverage) and bug-finding capability (i.e., 31 new bugs, among which we discovered 21 new vulnerabilities with 16 CVEs assigned and 3.2K USD bug bounty rewards received) over AFL and jsfunfuzz. We also demonstrated the effectiveness of our grammar-aware trimming and mutation.

cs.CR↗

arXiv2018

Cutting Away the Confusion From Crowdtesting

Crowdtesting is effective especially when it comes to the feedback on GUI systems, or subjective opinions about features. Despite of this, we find crowdtesting reports are highly replicated, i.e., 82% of them are replicates of others. Hence automatically detecting replicate reports could help reduce triaging efforts. Most of the existing approaches mainly adopted textual information for replicate detection, and suffered from low accuracy because of the expression gap. Our observation on real industrial crowdtesting data found that when dealing with crowdtesting reports of GUI systems, the reports would accompanied with images, i.e., the screenshots of the app. We assume the screenshot to be valuable for replicate crowdtesting report detection because it reflects the real scenario of the failure and is not affected by the variety of natural languages. In this work, we propose a replicate detection approach, TSDetector, which combines information from the screenshots and the textual descriptions to detect replicate crowdtesting reports. We extract four types of features to characterize the screenshots and the textual descriptions, and design an algorithm to detect replicates based on four similarity scores derived from the four different features respectively. We investigate the effectiveness and advantage of TSDetector on 15 commercial projects with 4,172 reports from one of the Chinese largest crowdtesting platforms.Results show that TSDetector can outperform existing state-of-the-art approaches significantly. In addition, we also evaluate its usefulness using real-world case studies. The feedback from real-world testers demonstrates its practical value

cs.SE↗

arXiv2018

Crowdtesting : When is The Party Over?

Trade-offs such as "how much testing is enough" are critical yet challenging project decisions in software engineering. Most existing approaches adopt risk-driven or value-based analysis to prioritize test cases and minimize test runs. However, none of these is applicable to the emerging crowd testing paradigm where task requesters typically have no control over online crowdworkers's dynamic behavior and uncertain performance. In current practice, deciding when to close a crowdtesting task is largely done by guesswork due to lack of decision support. This paper intends to fill this gap by introducing automated decision support for monitoring and determining appropriate time to close the crowdtesting tasks. First, this paper investigates the necessity and feasibility of close prediction of crowdtesting tasks based on industrial dataset. Then,it designs 8 methods for close prediction, based on various models including the bug trend, bug arrival model, capture-recapture model.Finally, the evaluation is conducted on 218 crowdtesting tasks from one of the largest crowdtesting platforms in China, and the results show that a median of 91% bugs can be detected with 49% saved cost.

cs.SE↗

arXiv2018

Effective Automated Decision Support for Managing Crowdtesting

Crowdtesting has grown to be an effective alter-native to traditional testing, especially in mobile apps. However,crowdtesting is hard to manage in nature. Given the complexity of mobile applications and unpredictability of distributed, parallel crowdtesting process, it is difficult to estimate (a) the remaining number of bugs as yet undetected or (b) the required cost to find those bugs. Experience-based decisions may result in ineffective crowdtesting process. This paper aims at exploring automated decision support to effectively manage crowdtesting process. The proposed ISENSE applies incremental sampling technique to process crowdtesting reports arriving in chronological order, organizes them into fixed-size groups as dynamic inputs, and predicts two test completion indicators in an incrementally manner. The two indicators are: 1)total number of bugs predicted with Capture-ReCapture (CRC)model, and 2) required test cost for achieving certain test objectives predicted with AutoRegressive Integrated Moving Average(ARIMA) model. We assess ISENSE using 46,434 reports of 218 crowdtesting tasks from one of the largest crowdtesting platforms in China. Its effectiveness is demonstrated through two applications for automating crowdtesting management, i.e. automation oftask closing decision, and semi-automation of task closing trade-off analysis. The results show that decision automation using ISENSE will provide managers with greater opportunities to achieve cost-effectiveness gains of crowdtesting. Specifically, a median of 100% bugs can be detected with 30% saved cost basedon the automated close prediction

cs.SE↗

arXiv2017

Sonication-assisted synthesis of semiconducting atomic crystals of germanium monoselenide: An isostructural and isoelectronic analog of black phosphorous

Monochalcogenides of germanium (or tin) are considered as stable isoelectronic and isostructural analogue of black phosphorous. Their two-dimensional (2D) forms have been just predicted to shown strong thickness-dependent physical properties, and even indirect to direct band gap crossover at the monolayer limit. Here, we demonstrate the synthesis of atomically thin GeSe by direct sonication-assisted exfoliation of bulk microcrystalline powders in solvents. The exfoliated few-layer GeSe sheets characterize high crystallinity with lateral sizes over 100 nm and, importantly, strong resistance against oxidation and degradation in ambient conditions. Density functional theory calculation combined with optical characterizations confirm the layer-number dependent optical bandgap, which, for few-layer sheets, is optimal for solar light harvesting, and promising for relevant applications, such as optoelectronics and photonics.

cond-mat.mtrl-sci↗

arXiv2015

Gate-modulated conductance of few-layer WSe_2 field-effect transistors in the subgap regime: Schottky barrier transistor and subgap impurity states

Two key subjects stand out in the pursuit of semiconductor research: material quality and contact technology. The fledging field of atomically thin transition metal dichalcogenides (TMDCs) faces a number of challenges in both efforts. This work attempts to establish a connection between the two by examining the gate-dependent conductance of few-layer (1-5L) WSe2 field effect devices. Measurements and modeling of the subgap regime reveal Schottky barrier transistor behavior. We show that transmission through the contact barrier is dominated by thermionic field emission (TFE) at room temperature, despite the lack of intentional doping. The TFE process arises due to a large number of subgap impurity states, the presence of which also leads to high mobility edge carrier densities. The density of states of such impurity states is self-consistently determined to be approximately 1-2x10^13 /cm^2/eV in our devices. We demonstrate that substrate is unlikely to be a major source of the impurity states and suspect that lattice defects within the material itself are primarily responsible. Our experiments provide key information to advance the quality and understanding of TMDC materials and electrical devices.

cond-mat.mes-hall↗

arXiv2011

Detecting Collusive Cliques in Futures Markets Based on Trading Behaviors from Real Data

In financial markets, abnormal trading behaviors pose a serious challenge to market surveillance and risk management. What is worse, there is an increasing emergence of abnormal trading events that some experienced traders constitute a collusive clique and collaborate to manipulate some instruments, thus mislead other investors by applying similar trading behaviors for maximizing their personal benefits. In this paper, a method is proposed to detect the hidden collusive cliques involved in an instrument of future markets by first calculating the correlation coefficient between any two eligible unified aggregated time series of signed order volume, and then combining the connected components from multiple sparsified weighted graphs constructed by using the correlation matrices where each correlation coefficient is over a user-specified threshold. Experiments conducted on real order data from the Shanghai Futures Exchange show that the proposed method can effectively detect suspect collusive cliques. A tool based on the proposed method has been deployed in the exchange as a pilot application for futures market surveillance and risk management.

q-fin.TR↗

arXiv2011

Characteristics of Real Futures Trading Networks

Futures trading is the core of futures business, and it is considered as one of the typical complex systems. To investigate the complexity of futures trading, we employ the analytical method of complex networks. First, we use real trading records from the Shanghai Futures Exchange to construct futures trading networks, in which nodes are trading participants, and two nodes have a common edge if the two corresponding investors appear simultaneously in at least one trading record as a purchaser and a seller respectively. Then, we conduct a comprehensive statistical analysis on the constructed futures trading networks. Empirical results show that the futures trading networks exhibit features such as scale-free behavior with interesting odd-even-degree divergence in low-degree regions, small-world effect, hierarchical organization, power-law betweenness distribution, disassortative mixing, and shrinkage of both the average path length and the diameter as network size increases. To the best of our knowledge, this is the first work that uses real data to study futures trading networks, and we argue that the research results can shed light on the nature of real futures business.

q-fin.ST↗