Yuri S. Kivshar

Bio: Yuri S. Kivshar is an academic researcher from Australian National University. The author has contributed to research in topics: Metamaterial & Soliton. The author has an hindex of 126, co-authored 1845 publications receiving 79415 citations. Previous affiliations of Yuri S. Kivshar include Technische Universität Darmstadt & Los Alamos National Laboratory.

Sine-Gordon kink-antikink generation on spatially periodic potentials.

Abstract: A spatially periodic perturbation can lead to a breakup of large-amplitude sine-Gordon breathers into kink and antikink solutions, each oscillating around a minimum of the perturbing potential. This behavior can be understood by studying the effective potential experienced by the breather (bound kink-antikink) or the (free) kink-antikink solution as long as kink and antikink are sufficiently far apart. The resulting kinks and antikinks move independently and nearly radiationlessly in the presence of the perturbation and can travel arbitrarily far for sufficiently large initial kinetic energy. Upon interacting with each other they are strongly affected by the perturbation, lose energy by radiating, and can end in a bound state having the character of a distorted breather.

Reversible optical nonreciprocity in periodic structures with liquid crystals

Abstract: We suggest a novel approach to achieve reversible nonreciprocal optical response in a periodic photonic structure with a pair of defects, one of them being a nonlinear liquid crystal. We show that nonreciprocal effects can be reversed by changing the wavelength due to change of localization properties of defect modes.

Tailoring transmission and reflection with metasurfaces

Abstract: We describe the scattering properties of planar metasurfaces composed of arrays of dielectric resonators supporting both electric and magnetic Mie resonances. We focus on the study of metasurfaces with such functionalities as perfect reflection, perfect transmission, and perfect absorption of light at the normal or oblique incidence. Each effect is presented in its simplest form for the cases of electric and magnetic dipole resonances. Generalizations to higher orders and higher numbers of multipoles are discussed as well.

Phase matching in nonlinear χ (2) photonic crystals: errata

Abstract: In Ref. 1: 1. On p. 1204, second column, last paragraph, the formula for k 2 should be k 2 ෇ 2pn 2 ͞l 2. 2. On p. 1205, f irst column, first paragraph, the formula for d should be d ෇ ͑4p͞Dk 2 ͒ ͓͑p 2 1 q 2 1 pq͒͞3͔ 1͞2 , Dk 2 ෇ jk 2 2 2k 1 j .

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基因变异体为抗原变异提供了分子基础。