A three-dimensionally periodic dielectric structure with a large complete photonic band gap ~PBG! is presented. The structure is distinguished by a sequence of planar layers, identical except for a horizontal offset, and repeating every three layers to form an fcc lattice. The layers can be thought of as an alternating stack of the two basic two-dimensional ~2D! PBG slab geometries: rods in air...

In the mol-ecule of title compound, C(16)H(24)N(2)Si(2), the pyridine rings are nearly planar (r.m.s. deviation = 0.002 Å).

In the title compound, [Pd(C(37)H(55)P(2)Si)Cl], the Pd atom has a distorted square-planar geometry. The two five-membered rings adopt envelope conformations, while the four cyclo-hexane rings have chair conformations. The two planar aromatic rings are oriented at a dihedral angle of 28.79 (3)°.

The paper deals with the fabrication of a p-CuS-n-Si nanocone heterojunction based highly sensitive broad band photodetector. Cone-like one dimensional Si nanostructures formed by metal assisted chemical etching, with superior antireflection characteristics have been used as templates for fabrication of the heterojunction. Covellite CuS material was synthesized by a simple chemical reaction for...

Keywords: Metalorganic chemical vapor deposition (MOCVD) Metal–oxide–semiconductor field effect transistor (MOSFET) Nanowire a b s t r a c t Depletion-mode metal–oxide–semiconductor field effect transistors (MOSFETs) with GaAs planar nano-wire (NW) channels are successfully demonstrated. The Si-doped planar GaAs NWs are grown in a selective lateral epitaxy manner via Au-assisted vapor–liquid–so...

A graph G is a support for a hypergraph H = (V,S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is connected. G is a planar support if it is a support and planar. Johnson and Pollak [11] proved that it is NPcomplete to decide if a given hypergraph has a planar support. In contrast, there are lienar time algorithms to tes...

This paper introduces the concept of low-congestion shortcuts for (near-)planar networks, and demonstrates their power by using them to obtain near-optimal distributed algorithms for problems such as Minimum Spanning Tree (MST) or Minimum Cut, in planar networks. Consider a graph G = (V,E) and a partitioning of V into subsets of nodes S1, . . . , SN , each inducing a connected subgraph G[Si]. W...

The properties and preliminar applications of porous-silicon (p-Si) microcavities are here reported. These structures are based on a planar resonator formed by two narrow-band high-reflectance distributed Bragg reflectors separated by a thin active optical layer, all of which are made of' p-Si layers. The accurate control of the electrochemical dissolution of Si lets us realize p-Si multilayers...