Tunneling magnetoresistance in diluted magnetic semiconductor tunnel junctions

Using the spin-polarized tunneling model and taking into account the basic physics of ferromagnetic semiconductors, we study the temperature dependence of the tunneling magnetoresistance (TMR) in the diluted magnetic semiconductor (DMS) trilayer heterostructure system (Ga,Mn)As/AlAs/(Ga,Mn)As. The experimentally observed TMR ratio is in reasonable agreement with our result based on the typical material parameters. It is also shown that the TMR ratio has a strong dependence on both the itinerant-carrier density and the magnetic ion density in the DMS electrodes. This can provide a potential way to achieve larger TMR ratio by optimally adjusting the material parameters.Comment: 5 pages (RevTex), 3 figures (eps), submitted to PR

A Novel Local Community Detection Method Using Evolutionary Computation.

The local community detection is a significant branch of the community detection problems. It aims at finding the local community to which a given starting node belongs. The local community detection plays an important role in analyzing the complex networks and recently has drawn much attention from the researchers. In the past few years, several local community detection algorithms have been proposed. However, the previous methods only make use of the limited local information of networks but overlook the other valuable information. In this article, we propose an evolutionary computation-based algorithm called evolutionary-based local community detection (ELCD) algorithm to detect local communities in the complex networks by taking advantages of the entire obtained information. The performance of the proposed algorithm is evaluated on both synthetic and real-world benchmark networks. The experimental results show that the proposed algorithm has a superior performance compared with the state-of-the-art local community detection methods. Furthermore, we test the proposed algorithm on incomplete real-world networks to show its effectiveness on the networks whose global information cannot be obtained

Scalable supergraph search in large graph databases

© 2016 IEEE. Supergraph search is a fundamental problem in graph databases that is widely applied in many application scenarios. Given a graph database and a query-graph, supergraph search retrieves all data-graphs contained in the query-graph from the graph database. Most existing solutions for supergraph search follow the pruning-and-verification framework, which prunes false answers based on features in the pruning phase and performs subgraph isomorphism testings on the remaining graphs in the verification phase. However, they are not scalable to handle large-sized data-graphs and query-graphs due to three drawbacks. First, they rely on a frequent subgraph mining algorithm to select features which is expensive and cannot generate large features. Second, they require a costly verification phase. Third, they process features in a fixed order without considering their relationship to the query-graph. In this paper, we address the three drawbacks and propose new indexing and query processing algorithms. In indexing, we select features directly from the data-graphs without expensive frequent subgraph mining. The features form a feature-tree that contains all-sized features and both the cost sharing and pruning power of the features are considered. In query processing, we propose a verification-free algorithm, where the order to process features is query-dependent by considering both the cost sharing and the pruning power. We explore two optimization strategies to further improve the algorithm efficiency. The first strategy applies a lightweight graph compression technique and the second strategy optimizes the inclusion of answers. Finally, we conduct extensive performance studies on two real large datasets to demonstrate the high scalability of our algorithms

Extracted BERT Model Leaks More Information than You Think!

The collection and availability of big data, combined with advances in pre-trained models (e.g. BERT), have revolutionized the predictive performance of natural language processing tasks. This allows corporations to provide machine learning as a service (MLaaS) by encapsulating fine-tuned BERT-based models as APIs. Due to significant commercial interest, there has been a surge of attempts to steal remote services via model extraction. Although previous works have made progress in defending against model extraction attacks, there has been little discussion on their performance in preventing privacy leakage. This work bridges this gap by launching an attribute inference attack against the extracted BERT model. Our extensive experiments reveal that model extraction can cause severe privacy leakage even when victim models are facilitated with advanced defensive strategies

Intrinsic non-uniqueness of the acoustic full waveform inverse problem

SUMMARY In the context of seismic imaging, full waveform inversion (FWI) is increasingly popular. Because of its lower numerical cost, the acoustic approximation is often used, especially at the exploration geophysics scale, both for tests and for real data. Moreover, some research domains such as helioseismology face true acoustic media for which FWI can be useful. In this work, an argument that combines particle relabelling and homogenization is used to show that the general acoustic inverse problem based on band-limited data is intrinsically non-unique. It follows that the results of such inversions should be interpreted with caution. To illustrate these ideas, we consider 2-D numerical FWI examples based on a Gauss–Newton iterative inversion scheme and demonstrate effects of this non-uniqueness in the local optimization context.</jats:p