Lane-change detection using a computational driver model

OBJECTIVE: This paper introduces a robust, real-time system for detecting driver lane changes. Background: As intelligent transportation systems evolve to assist drivers in their intended behaviors, the systems have demonstrated a need for methods of inferring driver intentions and detecting intended maneuvers. METHOD: Using a "model tracing" methodology, our system simulates a set of possible driver intentions and their resulting behaviors using a simplification of a previously validated computational model of driver behavior. The system compares the model's simulated behavior with a driver's actual observed behavior and thus continually infers the driver's unobservable intentions from her or his observable actions. RESULTS: For data collected in a driving simulator, the system detects 82% of lane changes within 0.5 s of maneuver onset (assuming a 5% false alarm rate), 93% within 1 s, and 95% before the vehicle moves one fourth of the lane width laterally. For data collected from an instrumented vehicle, the system detects 61% within 0.5 s, 77% within 1 s, and 84% before the vehicle moves one-fourth of the lane width laterally. CONCLUSION: The model-tracing system is the first system to demonstrate high sample-by-sample accuracy at low false alarm rates as well as high accuracy over the course of a lane change with respect to time and lateral movement. APPLICATION: By providing robust real-time detection of driver lane changes, the system shows good promise for incorporation into the next generation of intelligent transportation systems.     

Making Java work for microcontroller applications

The authors investigate complete system development using a Java machine aimed at FPGA devices. A new design strategy targets a single FPGA chip, within which the dedicated Java microcontroller-FemtoJava-is synthesized     

Minimum cost source location problem with vertex-connectivity requirements in digraphs

Given a digraph (or an undirected graph) G=(V,E) with a set V of vertices v with nonnegative real costs w(v), and a set E of edges and a positive integer k, we deal with the problem of finding a minimum cost subset SV such that, for each vertex vV−S, there are k vertex-disjoint paths from S to v. In this paper, we show that the problem can be solved by a greedy algorithm in time in a digraph (or in time in an undirected graph), where n=|V| and m=|E|. Based on this, given a digraph and two integers k and ℓ, we also give a polynomial time algorithm for finding a minimum cost subset SV such that for each vertex vV−S, there are k vertex-disjoint paths from S to v as well as ℓ vertex-disjoint paths from v to S.     

Group weighted finite transducers

We consider weighted finite transducers over arbitrary groups, that is finite transducers having a counter in which, at any step, a value of the group is stored but no information regarding the content of this counter is available until the computation is finished. The computation is valid if the counter value is the neutral element of the group. We generalize here some results from [8] and [17]. Received: 28 January 2001 / 5 June 2001     

A high-field adiabatic fast passage ultracold neutron spin flipper for the UCNA experiment

The UCNA collaboration is making a precision measurement of the β asymmetry (A) in free neutron decay using polarized ultracold neutrons (UCN). A critical component of this experiment is an adiabatic fast passage neutron spin flipper capable of efficient operation in ambient magnetic fields on the order of 1 T. The requirement that it operate in a high field necessitated the construction of a free neutron spin flipper based, for the first time, on a birdcage resonator. The design, construction, and initial testing of this spin flipper prior to its use in the first measurement of A with UCN during the 2007 run cycle of the Los Alamos Neutron Science Center's 800 MeV proton accelerator is detailed. These studies determined the flipping efficiency of the device, averaged over the UCN spectrum present at the location of the spin flipper, to be ε=0.9985(4).     

Characterization of microbial community structures and their activities in single anaerobic granules by beta imaging, microsensors and fluorescence in situ hybridization

The spatial distribution of microorganisms and their in situ activities in anaerobic granules were investigated by fluorescence in situ hybridization (FISH), beta imaging and microsensors. FISH results revealed a layered structure of microorganisms in the granule, where Chloroflexi was present in the outermost layer, Smithella spp. and Syntrophobacter spp. were found in a depth of ca. 100 μm, and Archaea was restricted to the inner layer (below ca. 300 μm from the surface). Substrate uptake patterns elucidated by beta imaging demonstrated that glucose uptake was highest at 50 μm depth, whereas propionate uptake had a peak at 200 μm depth. In addition, microsensor measurements revealed that acid was produced mainly at 100 μm depth and H(2) production was detected at a depth from 100 to 200 μm. H(2) consumption and corresponding CH(4) production were found below 200 μm from the surface. Direct comparison of these results implied sequential degradation of complex organic compounds in anaerobic granules; Chloroflexi contributed to fermentation of organic compounds and acid production in the outermost layer, volatile fatty acids were oxidized and H(2) was produced mainly by Smithella spp. and Syntrophobacter spp. at a depth from 100 to 200 μm, and Archaea produced CH(4) below ca. 300 μm from the surface.     

Case learning for CBR-based collision avoidance systems

With the rapid development of case-based reasoning (CBR) techniques, CBR has been widely applied to real-world applications such as collision avoidance systems. A successful CBR-based system relies on a high-quality case base, and a case creation technique for generating such a case base is highly required. In this paper, we propose an automated case learning method for CBR-based collision avoidance systems. Building on techniques from CBR and natural language processing, we developed a methodology for learning cases from maritime affair records. After giving an overview on the developed systems, we present the methodology and the experiments conducted in case creation and case evaluation. The experimental results demonstrated the usefulness and applicability of the case learning approach for generating cases from the historic maritime affair records.     

Capability and limitation of max- and sum-type construction of Lyapunov functions for networks of iISS systems

This paper addresses the problem of verifying stability of networks whose subsystems admit dissipation inequalities of integral input-to-state stability (iISS). We focus on two ways of constructing a Lyapunov function satisfying a dissipation inequality of a given network. Their difference from one another is elucidated from the viewpoint of formulation, relation, fundamental limitation and capability. One is referred to as the max-type construction resulting in a Lipschitz continuous Lyapunov function. The other is the sum-type construction resulting in a continuously differentiable Lyapunov function. This paper presents geometrical conditions under which the Lyapunov construction is possible for a network comprising $n\ge 2$ subsystems. Although the sum-type construction for general $n>2$ has not yet been reduced to a readily computable condition, we obtain a simple condition of iISS small gain in the case of $n=2$. It is demonstrated that the max-type construction fails to offer a Lyapunov function if the network contains subsystems which are not input-to-state stable (ISS).     

Colorimetric microdetermination of sulphites in foods by use of the modified rankine apparatus. IV.

Summary Detection and determination of traces of sulphites in foods was attempted by use of the modified Rankine apparatus and pararosaniline colorimetry. Replacement of alkaline titration reported previously by pararosaniline colorimetry lowered the absolute detection limit from 30 g (titration method) to 2 g. In view of clean analysis, in the color developing system, 0.1 N-sodium hydroxide was used in place of mercuric chloride solution commonly used as an absorbant of sulphites. In order to prevent oxidative decomposition of sulphites during operation, nitrogen gas was used as carrier instead of air. Dimedone and sodium azide were used for the elimination of aldehydes and nitrites, respecitvely, in the sample, which will disturb the color development of sulphites with pararosaniline-formaldehyde reagents. With this improved method, it was possible to determine the residual sulphites in frozen peeled shrimps, sugared beans and other foods with low sulphite contents accurately.

---

Colorimetrische Mikrobestimmung von Sulfiten in Lebensmitteln bei Anwendung der modifizierten IV. Rankine Apparatur

Zusammenfassung Geringe Sulfitmengen in Lebensmitteln (geschälte Garnelen, gezuckerte Bohnen) können colorimetrisch bestimmt werden. Die neuentwickelte Methode beruht auf einer Kombination von colorimetrischer Bestimmung mittels p-Rosanilin und der Bestimmungsmethode nach Rankine. Auf diese Weise lassen sich Gehalte von 2 g noch genau bestimmen. Bei der Farbentwicklung wurde das giftige Quecksilbertetrachlorid durch 0.1 n-NaOH ersetzt, anstelle von Luft Stickstoff als Trägergas verwendet und somit eine Oxydation des Sulfits während der Bestimmung vermieden. Da Nitrit und Aldehyde die Farbentwicklung stören, wurde ihr Einfluß durch Dimedon und Natriumazid ausgeschaltet.

---

---

Studies on the Analyses of Sulphites in Foods (IV)