Collinearity and Parallelism are Statistically Significant Second-Order Relations of Complex Cell Responses

By investigating the second-order statistics of Gabor wavelet responses derived from natural images, we show that collinearity and parallelism are conspicuous relations. We give a precise mathematical characterization of these Gestalt principles by the conditional probability of two responses. Essential for our investigations is a non-linear transformation, initially utilized within the object recognition system [5], which transforms continuous Gabor wavelet responses into a binary code indicating the presence or absence of local oriented line segments.     

Plasmon energy mapping in energy-filtering transmission electron microscopy

In this paper, we demonstrate the two-dimensional mapping of plasmon energies by energy-filtering transmission electron microscopy. The maps are obtained from a series of energy-filtered images in the plasmon energy region. Examples are shown for a nano-crystalline Si-B-C-N ceramic. This material contains SiC and Si(3)N(4) grains as well as intergranular regions composed of hexagonal BN (h-BN) and turbostratic carbon (t-C). The different phases can be clearly identified by their specific plasmon energies. An energy resolution of < or =0.1eV is achieved. In addition, the plasmon map of an amorphous carbon film is used to visualize the non-isochromaticity of the Corrected Omega filter (90 degrees filter) of the SESAM2. A procedure is proposed for the correction of the non-isochromaticity.     

Investigation of blind tip estimation

In this work we study functions for maximum likelihood estimation in blind tip estimation. We will implement the expectation maximization (EM), the stochastic EM, and stochastic approximation EM algortithms to estimate the unknown tip geometry. To demonstrate the functionality of the algorithms we applied it to dilated artificial input signal.     

Characterisation of neutron fields around high-energy x-ray radiotherapy machines

Photoneutron spectra around the treatment bed of a Varian Clinac 2100C machine were measured using a Bonner sphere spectrometer. To overcome problems with pulse pile-up and detection of non-neutron-induced events, the active detector of thermal neutrons normally used at the centre of the spheres was replaced by a sandwich of four CR-39 track detectors interleaved with 10B radiators. Track densities measured for the CR-39 detectors in Bonner spheres were used for the unfolding of neutron spectra. Neutron fluence and ambient dose equivalent for the whole energy range and partial energy intervals were derived from the neutron spectra.     

Study of structure and properties of ZnO–Bi<Subscript>2</Subscript>O<Subscript>3</Subscript>–P<Subscript>2</Subscript>O<Subscript>5</Subscript> glasses

Glasses of the ternary system ZnO–Bi₂O₃–P₂O₅ were prepared and studied in two compositional series 50ZnO–xBi₂O₃–(50 − x)P₂O₅ and (50 − y)ZnO–yBi₂O₃–50P₂O₅. Two distinct glass-forming regions were found in the 50ZnO–xBi₂O₃–(50 − x)P₂O₅ glass series with x = 0–10 and 20–35 mol.% Bi₂O₃. All prepared Bi₂O₃-containing glasses reveal a high chemical durability. Small additions of Bi₂O₃ (∼5 mol.%) improve thermal stability of glasses. All glasses crystallize on heating within the temperature range of 505–583 °C. Structural studies by Raman and ³¹P MAS NMR spectroscopies showed the rapid depolymerisation of phosphate chains within the first region with x = 0–15 and the presence of isolated Q⁰ phosphate units within the second region with x = 20–35. Raman studies showed that bismuth is incorporated in the glass structure in BiO₆ units and their vibrational bands were observed within the spectral region of 350–700 cm⁻¹. The evolution of properties and the spectroscopic data are both in accordance with a network former effect of Bi₂O₃.     

Distributed algorithms for barrier coverage using relocatable sensors

We study the barrier coverage problem using relocatable sensor nodes. We assume each sensor can sense an intruder or event inside its sensing range. Sensors are initially located at arbitrary positions on the barrier and can move along the barrier. The goal is to find final positions for sensors so that the entire barrier is covered. In recent years, the problem has been studied extensively in the centralized setting. In this paper, we study a barrier coverage problem in the distributed and discrete setting. We assume that we have n identical sensors located at grid positions on the barrier, and that each sensor repeatedly executes a Look-Compute-Move cycle: based on what it sees in its vicinity, it makes a decision on where to move, and moves to its next position. We make two strong but realistic restrictions on the capabilities of sensors: they have a constant visibility range and can move only a constant distance in every cycle. In this model, we give the first two distributed algorithms that achieve barrier coverage for a line segment barrier when there are enough nodes in the network to cover the entire barrier. Our algorithms are synchronous, and local in the sense that sensors make their decisions independently based only on what they see within their constant visibility range. One of our algorithms is oblivious whereas the other uses two bits of memory at each sensor to store the type of move made in the previous step. We show that our oblivious algorithm terminates within \(\varTheta (n^2)\) steps with the barrier fully covered, while the constant-memory algorithm is shown to take \(\varTheta (n)\) steps to terminate in the worst case. Since any algorithm in which a sensor can only move a constant distance in one step requires \(\varOmega (n)\) steps on some inputs, our second algorithm is asymptotically optimal.     

Schrifttumsberichte

Ohne Zusammenfassung     

Schrifttumsberichte

Ohne Zusammenfassung     

Buchbesprechungen

Ohne Zusammenfassung