Sökresultat
Filtrera
Filtyp
Din sökning på "*" gav 567012 sökträffar
No title
No title
The level crossing method was used to measure the hyperfine structure of Bi 209 in the 6 p 2 ( 3 P 0 )6 d 2 D 3/2 and 6 p 2 ( 3 P 1 )7 s 4 P 3/2 levels of the Bi I spectrum. For the magnetic dipole and the electric quadrupole interaction constants a and b the following values were obtained: | a (6 p 2 ( 3 P 0 ) 6 d 2 D 3/2 )| = 128.0(0.6) g J /-0.79 MHz | b (6 p 2 ( 3 P 0 ) 6 d 2 D 3/2 )| = 58(4)
No title
No title
No title
No title
No title
This paper deals with the performance of frequency selective structures with defects. A frequency selective structure is in this case a periodic pattern of apertures in a conducting plate. The plate can be of arbitrary thickness. The defects can be by deviations in the placing of the apertures, in the material parameters, or in the shape of the apertures. First the perturbation to the far- field pa
No title
No title
No title
No title
No title
No title
No title
No title
The reactivity of the phosphine-thioether ligands bis(2-diphenylphosphino) ethylthio)ethane (PSSP), bis(2-(diphenylphosphino) ethyl)sulfane (PSP), PPh2CH2CH2SMe (PS), PPh2(o-C6H4SMe (PortoS), and PPh(o-C6H4SMe)2 (PSS) towards low-valent carbonyl clusters has been studied. In all structurally characterized clusters, the ligand donor atoms are terminally coordinated. The phosphine-thioether ligands
No title
Abstract in UndeterminedCaring for intensive care patients involves extensive use ofmedical technology. When staff are educated in workingwith these devices, the focus is on practical management.The context in which they are used is however verycomplex and the device cannot be seen as a separatecomponent. Knowledge about for example the patient’smedical status and background must also be considere
No title
No title
We investigate the computational hardness of approximating the longest path and the longest cycle in undirected and directed graphs on n vertices. We show that * in any expander graph, we can find (n) long paths in polynomial time. * there is an algorithm that finds a path of length (log2 L/ log log L) in any undirected graph having a path of length L, in polynomial time. * there is an algorithm t