Sökresultat

Filtyp

Din sökning på "*" gav 530668 sökträffar

Frequency Selective Structures with Stochastic Deviations

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

Coordination of Phosphine-Thioether Ligands to Low-valent Metal Centers

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

Interactive Scenario Simulation to Learn Medical Technology in the Patient Care Context

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

Approximating Longest Path

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

A Distributed Clustering Algorithm

A new algorithm for clustering is presented --- the Distributed Clustering Algorithm (DCA). It is designed to be incremental and to work in a real-time situation, thus making it suitable for robotics and in models of concept formation. The DCA starts with one cluster (or rather prototype at the center of the cluster), successively adding prototypes and distributing them according to data density u