Photocurrent generation system incorporated with antenna function

Porphyrin accumulation onto a self-assembled monolayer (SAM) of imidazole-substituted porphyrins by a supramolecular method to form a chain structure leads to significant increase of light absorption in the visible light region and therefore photocurrents.     

Direct evidence for an intrinsic square vortex lattice in the overdoped high- T(c) superconductor La(1.83)Sr(0.17)CuO(4+delta)

We report here the first direct observations of a well ordered vortex lattice in the bulk of a La(2-x)Sr(x)CuO(4+delta) single crystal (slightly overdoped, x = 0.17). Our small angle neutron scattering investigation of the mixed phase reveals a crossover from triangular to square coordination with increasing magnetic field. The existence of an intrinsic square vortex lattice has never been observed in high-temperature superconductors and is indicative of the coupling of the vortex lattice to a source of anisotropy, such as those provided by a d-wave order parameter or the presence of stripes.     

Hyperfine structure of the electron spin resonance of phosphorus-doped Si nanocrystals

Electronic states of P donors in Si nanocrystals (nc-Si) embedded in insulating glass matrices have been studied by electron spin resonance. Doping of P donors into nc-Si was demonstrated by the observation of optical absorption in the infrared region due to intraconduction band transitions. P hyperfine structure (hfs) was successfully observed at low temperatures. The observed splitting of the hfs was found to be much larger than that of the bulk Si:P and depended strongly on the size of nc-Si. The observed strong size dependence indicates that the enhancement of the hyperfine splitting is caused by the quantum confinement of P donors in nc-Si.     

The synthesis of bicyclo[6.2.0]decapentaene

The parent bicyclo[6.2.0]decapentaene is synthesized for the first time by thermal ring opening of its valence isomer. Thermal dimerization of the compound is also described.     

A linear algorithm for the domination number of a series-parallel graph

A vertex u in an undirected graph G = (V, E) is said to dominate all its adjacent vertices and itself. A subset D of V is a dominating set in G if every vertex in G is dominated by a vertex in D, and is a minimum dominating set in G if no other dominating set in G has fewer vertices than D. The domination number of G is the cardinality of a minimum dominating set in G.The problem of determining, for a given positive integer k and an undirected graph G, whether G has a dominating set D in G satisfying ¦D¦ ≤ k, is a well-known NP-complete problem. Cockayne have presented a linear time algorithm for finding a minimum dominating set in a tree. In this paper, we will present a linear time algorithm for finding a minimum dominating set in a series-parallel graph.