Yang Yang

Bio: Yang Yang is an academic researcher from Chinese Academy of Sciences. The author has contributed to research in topics: Medicine & Computer science. The author has an hindex of 171, co-authored 2644 publications receiving 153049 citations. Previous affiliations of Yang Yang include Zhejiang University & Northwest Normal University.

Vertical Phase Separation in Poly(3‐hexylthiophene): Fullerene Derivative Blends and its Advantage for Inverted Structure Solar Cells

Abstract: A method which enables the investigation of the buried interfaces without altering the properties of the polymer films is used to study vertical phase separation of spin-coated poly(3-hexylthiophene) (P3HT):fullerene derivative blends. X-ray photoelectron spectroscopy (XPS) and atomic force microscopy (AFM) analysis reveals the P3HT enrichment at the free (air) surfaces and abundance of fullerene derivatives at the organic/substrate interfaces. The vertical phase separation is attributed to the surface energy difference of the components and their interactions with the substrates. This inhomogeneous distribution of the donor and acceptor components significantly affects photovoltaic device performance and makes the inverted device structure a promising choice.

Relay technologies for WiMax and LTE-advanced mobile systems

Abstract: Relay technologies have been actively studied and considered in the standardization process of next-generation mobile broadband communication systems such as 3GPP LTE-Advanced, IEEE 802.16j, and IEEE 802.16m. This article first introduces and compares different relay types in LTE-Advanced and WiMAX standards. Simulation results show that relay technologies can effectively improve service coverage and system throughput. Three relay transmission schemes are then summarized and evaluated in terms of transmission efficiency under different radio channel conditions. Finally, a centralized pairing scheme and a distributed pairing scheme are developed for effective relay selection. Simulation results show that the proposed schemes can maximize the number of served UE units and the overall throughput of a cell in a realistic multiple-RS-multiple-UE scenario.

A Theory of Network Localization

Abstract: In this paper, we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly

I and i

Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

Fast parallel algorithms for short-range molecular dynamics

Abstract: Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A

Abstract: 抗原变异可使得多种致病微生物易于逃避宿主免疫应答。表达在感染红细胞表面的恶性疟原虫红细胞表面蛋白1（PfPMP1）与感染红细胞、内皮细胞、树突状细胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作用。每个单倍体基因组var基因家族编码约60种成员，通过启动转录不同的var基因变异体为抗原变异提供了分子基础。

Electronics and optoelectronics of two-dimensional transition metal dichalcogenides.

Abstract: Single-layer metal dichalcogenides are two-dimensional semiconductors that present strong potential for electronic and sensing applications complementary to that of graphene.