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.

Towards a Snowdrift Game Optimization to Vertex Cover of Networks

Abstract: To solve the vertex cover problem in an agent-based and distributed networking systems utilizing local information, we treat each vertex as an intelligent rational agent rather than an inanimate one and provide a spatial-snowdrift-game-based optimization framework to vertex cover of networks. We analyze the inherent relation between the snowdrift game and the vertex cover: Strict Nash equilibriums of the spatial snowdrift game are the intermediate states between vertex-covered and minimal-vertex-covered states. Such equilibriums are obtained by employing the memory-based best response update rule. We also find that a better approximate solution in terms of the minimal vertex cover will be achieved by increasing the individuals' memory length, because such a process optimizes the individuals' strategies and helps them convert from bad equilibriums into better ones. Our findings pave a new way to solve the vertex cover problem from the perspective of agent-based self-organized optimization.

BLOT: Bandit Learning-Based Offloading of Tasks in Fog-Enabled Networks

Abstract: Task offloading is a promising technology to exploit the available computational resources in spatially distributed fog nodes efficiently in the era of fog computing In this paper, we look for an online task offloading strategy to minimize the long-term cost, which factors in the latency, the energy consumption, and the switching cost To this end, we formulate a stochastic programming problem and the expectations of the system parameters are allowed to change abruptly at unknown time instants Meanwhile, we consider the fact that the queried nodes can only feed back the processing results after finishing the tasks Then we put forth an effective bandit learning algorithm, ie, the BLOT, to solve this challenging stochastic programming under the non-stationary bandit model We also demonstrate that our proposed BLOT algorithm is asymptotically optimal in a non-stationary fog-enabled network Numerical experiments further verify the superb performance of BLOT

Solution-processed organic light-emitting devices with two polymer light-emitting units connected in series by a charge-generation layer

Abstract: We present a solution-based process to fabricate stacked OLEDs consisting of two polymer light-emitting units (LEUs), connected in series by a charge generation layer (CGL). We used Cs2CO3-doped ZnO nanoparticles as an EIL on the LE-polymer to improve the electron injection from the cathode. The surface morphology of a spin-coated metal oxide nanoparticle appears to be rough, with many gaps due to agglutination of nanoparticles. We chose poly(4-vinyl pyridine) (PVPy) as a binder to improve the film morphology of the ZnO:Cs2CO3 mixture and facilitate the formation of a uniform and dense film to prevent the solvent from soaking into the 1st LEU. The efficient solution-based processing of EILs in the 1st CGL containing MoO3/poly-TPD bilayers was employed for the construction of an MPE device. The device exhibited a sum current efficiency of 10 cd A−1, with 4 cd A−1 contributed by the 1st unit and 6 cd A−1 by the 2nd unit.

Generalized pairwise complementary codes with set-wise uniform interference-free windows

Abstract: This paper introduces an approach to generate generalized pairwise complementary (GPC) codes, which offer a uniform interference free windows (IFWs) across the entire code set. The GPC codes work in pairs and can fit extremely power efficient quadrature carrier modems. The characteristic features of the GPC codes include: the set size is 2K, the processing gain is 4NK, and the IFW's width is 8N identically for all codes in a set, where K is the times to perform Walsh-Hadamard expansions and N is element code length of seed complementary codes. Therefore, by using different N, the IFW width of a GPC code set can be adjusted with its set size unchanged. Each GPC code set consists of two code groups, with each having K codes, and they have sparsely and uniformly distributed autocorrelation side lobes and cross-correlation levels outside the IFWs.

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.