We study bend loss in chalcogenide negative curvature fibers with different polarizations, different tube wall thicknesses, and different bend directions relative to the mode polarization. The coupling between the core mode and tube modes induces bend loss peaks in the two non-degenerate modes at the same bend radius. There is as much as a factor of 28 difference between the losses of the two p...

The crystal structure of a DNA duplex dodecamer d(CGCAAAAATGCG) and its complementary strand has been determined at 2.6-A resolution. Although our goal was to deduce the structural features of the static bending of the helical axis exhibited by adenine-tract structures in solution, we conclude that the overall bend of 20 degrees in the direction of the major groove observed here arises from the...

In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal (45◦) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few bends per edge. A k-planar graph is a planar graph in which each vertex has degree less or equal to k. In particular, we prove that every 4-planar graph admits a planar...

Stability of an idealized hyperbolic hedgehog in a nematic liquid crystal against a twist transition is investigated by extending the methodology of Rüdinger and Stark [Liq. Cryst. 26, 753 (1999)], where the hedgehog is confined between two concentric spheres. In the ideal hyperbolic-hedgehog the molecular orientation is assumed to rotate proportionally with respect to the inclination angle, θ ...

An orthogonal drawing of a graph is a planar drawing where each edge is drawn as a sequence of horizontal and vertical line segments. Finding a bend-minimized orthogonal drawing of a planar graph of maximum degree 4 is NP-hard. The problem becomes tractable for planar graphs of maximum degree 3, and the fastest known algorithm takes O(n5 logn) time. Whether a faster algorithm exists has been a ...

The proposed smooth bend structure was implemented with a 150-degree to reduce the asymmetrical part of differential and thus prevent mode conversion loss common-mode noise. maintained signal integrity. In addition, we several hybrid compensation methods enhance noise suppression concluded that using “L-C-L” method offered best performance. frequency-domain analysis, from direct current (DC) 6 ...

Cylindrical microparticle transport and deposition from electrokinetic microflow in a 90 degree bend have been numerically simulated. Under the effect of dielectrohporetic force, gravity and stokes force, it’s found that microparticles with larger size deposit on the lower region of the bend’s outer wall. An exponential curve of deposition efficiency versus the product of stokes number and shap...

In this work, a plasmonic right-angled waveguide bend and divider are proposed. Using the Transformation Optics (TO) approach transformation media of T-shaped obtained. Such with continuous refractive index realized help graphene in terahertz frequency range, key to effectively guiding surface plasmon polariton (SPP) propagation on 90 degree curves. Components such capability promising for THz ...

Resonance Raman spectra were obtained for 2-nitrophenol in cyclohexane solution with excitation wavelengths in resonance with the charge-transfer (CT) proton transfer band absorption. These spectra indicate that the Franck-Condon region photodissociation dynamics have multidimensional character with motion along more than 15 normal modes: the nominal CCH bend+CC stretch nu(12) (1326 cm(-1)), th...

We consider embeddings of planar graphs in R where vertices map to points and edges map to polylines. We refer to such an embedding as a polyline drawing, and ask how few bends are required to form such a drawing for an arbitrary planar graph. It has long been known that even when the vertex locations are completely fixed, a planar graph admits a polyline drawing where edges bend a total of O(n...