Calculation of light delay for coupled microrings by FDTD technique and Pade approximation

The Pade approximation with Baker's algorithm is compared with the least-squares Prony method and the generalized pencil-of-functions (GPOF) method for calculating mode frequencies and mode Q factors for coupled optical microdisks by FDTD technique. Comparisons of intensity spectra and the corresponding mode frequencies and Q factors show that the Pade approximation can yield more stable results than the Prony and the GPOF methods, especially the intensity spectrum. The results of the Prony method and the GPOF method are greatly influenced by the selected number of resonant modes, which need to be optimized during the data processing, in addition to the length of the time response signal. Furthermore, the Pade approximation is applied to calculate light delay for embedded microring resonators from complex transmission spectra obtained by the Pade approximation from a FDTD output. The Prony and the GPOF methods cannot be applied to calculate the transmission spectra, because the transmission signal obtained by the FDTD simulation cannot be expressed as a sum of damped complex exponentials. (C) 2009 Optical Society of America

Pipeline Architecture and Parallel Computation-Based Real-Time Stereovision Tracking System for Surgical Navigation

This paper studies the development of a real-time stereovision system to track multiple infrared markers attached to a surgical instrument. Multiple stages of pipeline in field-programmable gate array (FPGA) are developed to recognize the targets in both left and right image planes and to give each target a unique label. The pipeline architecture includes a smoothing filter, an adaptive threshold module, a connected component labeling operation, and a centroid extraction process. A parallel distortion correction method is proposed and implemented in a dual-core DSP. A suitable kinematic model is established for the moving targets, and a novel set of parallel and interactive computation mechanisms is proposed to position and track the targets, which are carried out by a cross-computation method in a dual-core DSP. The proposed tracking system can track the 3-D coordinate, velocity, and acceleration of four infrared markers with a delay of 9.18 ms. Furthermore, it is capable of tracking a maximum of 110 infrared markers without frame dropping at a frame rate of 60 f/s. The accuracy of the proposed system can reach the scale of 0.37 mm RMS along the x- and y-directions and 0.45 mm RMS along the depth direction (the depth is from 0.8 to 0.45 m). The performance of the proposed system can meet the requirements of applications such as surgical navigation, which needs high real time and accuracy capability.

Pipeline Architecture and Parallel Computation-Based Real-Time Stereovision Tracking System for Surgical Navigation

This paper studies the development of a real-time stereovision system to track multiple infrared markers attached to a surgical instrument. Multiple stages of pipeline in field-programmable gate array (FPGA) are developed to recognize the targets in both left and right image planes and to give each target a unique label. The pipeline architecture includes a smoothing filter, an adaptive threshold module, a connected component labeling operation, and a centroid extraction process. A parallel distortion correction method is proposed and implemented in a dual-core DSP. A suitable kinematic model is established for the moving targets, and a novel set of parallel and interactive computation mechanisms is proposed to position and track the targets, which are carried out by a cross-computation method in a dual-core DSP. The proposed tracking system can track the 3-D coordinate, velocity, and acceleration of four infrared markers with a delay of 9.18 ms. Furthermore, it is capable of tracking a maximum of 110 infrared markers without frame dropping at a frame rate of 60 f/s. The accuracy of the proposed system can reach the scale of 0.37 mm RMS along the x- and y-directions and 0.45 mm RMS along the depth direction (the depth is from 0.8 to 0.45 m). The performance of the proposed system can meet the requirements of applications such as surgical navigation, which needs high real time and accuracy capability.

Resonance-enhanced group delay times in an asymmetric single quantum barrier

It is shown that transmission and reflection group delay times in an asymmetric single quantum barrier are greatly enhanced by the transmission resonance when the energy of incident particles is larger than the height of the barrier. The resonant transmission group delay is of the order of the quasibound state lifetime in the barrier region. The reflection group delay can be either positive or negative, depending on the relative height of the potential energies on the two sides of the barrier. Its magnitude is much larger than the quasibound state lifetime. These predictions have been observed in microwave experiments. (c) 2005 Elsevier B.V. All rights reserved.

A Prototype X-ray Framing Camera With Variable Exposure Time Based on Double-Gated Micro-Channel Plates

We present a novel X-ray frame camera with variable exposure time that is based on double-gated micro-channel plates (MCP). Two MCPs are connected so that their channels form a Chevron-MCP structure, and four parallel micro-strip lines (MSLs) are deposited on each surface of the Chevron-MCP. The MSLs on opposing surfaces of the Chevron-MCP are oriented normal to each other and subjected to high voltage. The MSLs on the input and output surfaces are fed high voltage pulses to form a gating action. In forming two-dimensional images, modifying the width of the gating pulse serves to set exposure times (ranging from ps to ms) and modifying the delay between each gating pulse serves to set capture times. This prototype provides a new tool for high-speed X-ray imaging, and this paper presents both simulations and experimental results obtained with the camera.

Restoration of the signals from multi-hit three-layer delay-line anode position-sensitive detector

Multi-hit 3-layer delay-line anode (Hexanode) has an increased ability to detect multi-hit events in a collision experiment. Coupled with a pair of micro-channel plates, it can provide position information of the particles even if the particles arrive at the same time or within small time dwell. But it suffers from some ambiguous outputs and signal losses due to timing order and triggering thresholds etc. We have developed a signal reconstruction program to correct those events. After the program correction, the dead time only exists when 2 paxticles arrive at the same time and the same position within a much smaller range. With the combination of Hexanode and the program, the experimental efficiencies will be greatly improved in near threshold double ionization on He collisions.

Laser-time-resolved fluorescence spectroscopy in immunoassays

This paper described a laser-excited time-resolved fluoroimmunoassay set. It made lanthanide ion to couple the anhydrde of diethylenetriaminepentaacetic acid (DTPAA) for labeling antibodies. The experiment used polystyrene tap coated with HCV antigen as the solid phase and a chelate of the rare earth metal europium as fluorescent label. A nitrogen laser beam was used to excite the Eu3+ chelates and after 60 ys delay time,the emission fluorescence was measured. Background fluorescence of short lifetimes caused by serum components and Raman scattering can be eliminated by set the delay rime. In the system condition, fluorescent spectra and fluorescent lifetimes of Eu3+ beta-naphthoyltrifluroacetone (NTA) chelates were measured. The fluorescent lifetime value is 650 mu s. The maximum emssion wavelength is 613 nm. The linear range of europium ion concentration is 1 x 10(-7)- 1 x 10(-11) g.mL(-1) and the detection limit is 1 x 10(-13) g.mL(-1). The relative standard deviation of determination ( n = 12) for samples at 0.01 ng.mL(-1) magnitude is 6.4%. Laser-TRFIA was also found to be suitable for diagnosis of HCV. The sensitvity and specificity were comparable to enzyme immunoassay. The result was obtained with laser-TRFIA for 29 human correlated well with enzyme immunoassay.

Real-time investigation of the photodissociation dynamics of p-chlorotoluene and p-dichlorobenzene

De-excited dynamics of p-chlorotoluene and p-dichlorobenzene have been investigated by the femtosecond pump-probe method in a supersonic molecular beam. The yields of the parent ion and daughter ion are examined as a function of the delay time between the pump and probe laser pulses. The lifetime constants of excited p-chlorotoluene and p-dichlorobenzene are determined. Possible de-excitation mechanisms are suggested that the initially excited S-1 state is predissociative via the repulsive triplet state. The substituent effects of additional chlorine atom and methyl group are discussed. Moreover, for the first time, we observe a novel quantum beat oscillation in p-dichlorobenzene. (c) 2005 Elsevier B.V. All rights reserved.

Time-dependent Hyperstar algorithm for robust vehicle navigation in time-dependent stochastic road networks.

The vehicle navigation problem studied in Bell (2009) is revisited and a time-dependent reverse Hyperstar algorithm is presented. This minimises the expected time of arrival at the destination, and all intermediate nodes, where expectation is based on a pessimistic (or risk-averse) view of unknown link delays. This may also be regarded as a hyperpath version of the Chabini and Lan (2002) algorithm, which itself is a time-dependent A* algorithm. Links are assigned undelayed travel times and maximum delays, both of which are potentially functions of the time of arrival at the respective link. The driver seeks probabilities for link use that minimise his/her maximum exposure to delay on the approach to each node, leading to the determination of the pessimistic expected time of arrival. Since the context considered is vehicle navigation where the driver is not making repeated trips, the probability of link use may be interpreted as a measure of link attractiveness, so a link with a zero probability of use is unattractive while a link with a probability of use equal to one will have no attractive alternatives. A solution algorithm is presented and proven to solve the problem provided the node potentials are feasible and a FIFO condition applies for undelayed link travel times. The paper concludes with a numerical example.

Dynamic Window-Constrained Scheduling for Real-Time Media Streaming

This paper describes an algorithm for scheduling packets in real-time multimedia data streams. Common to these classes of data streams are service constraints in terms of bandwidth and delay. However, it is typical for real-time multimedia streams to tolerate bounded delay variations and, in some cases, finite losses of packets. We have therefore developed a scheduling algorithm that assumes streams have window-constraints on groups of consecutive packet deadlines. A window-constraint defines the number of packet deadlines that can be missed in a window of deadlines for consecutive packets in a stream. Our algorithm, called Dynamic Window-Constrained Scheduling (DWCS), attempts to guarantee no more than x out of a window of y deadlines are missed for consecutive packets in real-time and multimedia streams. Using DWCS, the delay of service to real-time streams is bounded even when the scheduler is overloaded. Moreover, DWCS is capable of ensuring independent delay bounds on streams, while at the same time guaranteeing minimum bandwidth utilizations over tunable and finite windows of time. We show the conditions under which the total demand for link bandwidth by a set of real-time (i.e., window-constrained) streams can exceed 100% and still ensure all window-constraints are met. In fact, we show how it is possible to guarantee worst-case per-stream bandwidth and delay constraints while utilizing all available link capacity. Finally, we show how best-effort packets can be serviced with fast response time, in the presence of window-constrained traffic.

A Two-Tiered On-Line Server-Side Bandwidth Reservation Framework for the Real-Time Delivery of Multiple Video Streams

The advent of virtualization and cloud computing technologies necessitates the development of effective mechanisms for the estimation and reservation of resources needed by content providers to deliver large numbers of video-on-demand (VOD) streams through the cloud. Unfortunately, capacity planning for the QoS-constrained delivery of a large number of VOD streams is inherently difficult as VBR encoding schemes exhibit significant bandwidth variability. In this paper, we present a novel resource management scheme to make such allocation decisions using a mixture of per-stream reservations and an aggregate reservation, shared across all streams to accommodate peak demands. The shared reservation provides capacity slack that enables statistical multiplexing of peak rates, while assuring analytically bounded frame-drop probabilities, which can be adjusted by trading off buffer space (and consequently delay) and bandwidth. Our two-tiered bandwidth allocation scheme enables the delivery of any set of streams with less bandwidth (or equivalently with higher link utilization) than state-of-the-art deterministic smoothing approaches. The algorithm underlying our proposed frame-work uses three per-stream parameters and is linear in the number of servers, making it particularly well suited for use in an on-line setting. We present results from extensive trace-driven simulations, which confirm the efficiency of our scheme especially for small buffer sizes and delay bounds, and which underscore the significant realizable bandwidth savings, typically yielding losses that are an order of magnitude or more below our analytically derived bounds.

An energy-efficient data delivery scheme for delay-sensitive traffic in wireless sensor networks

We propose a novel data-delivery method for delay-sensitive traffic that significantly reduces the energy consumption in wireless sensor networks without reducing the number of packets that meet end-to-end real-time deadlines. The proposed method, referred to as SensiQoS, leverages the spatial and temporal correlation between the data generated by events in a sensor network and realizes energy savings through application-specific in-network aggregation of the data. SensiQoS maximizes energy savings by adaptively waiting for packets from upstream nodes to perform in-network processing without missing the real-time deadline for the data packets. SensiQoS is a distributed packet scheduling scheme, where nodes make localized decisions on when to schedule a packet for transmission to meet its end-to-end real-time deadline and to which neighbor they should forward the packet to save energy. We also present a localized algorithm for nodes to adapt to network traffic to maximize energy savings in the network. Simulation results show that SensiQoS improves the energy savings in sensor networks where events are sensed by multiple nodes, and spatial and/or temporal correlation exists among the data packets. Energy savings due to SensiQoS increase with increase in the density of the sensor nodes and the size of the sensed events. © 2010 Harshavardhan Sabbineni and Krishnendu Chakrabarty.

Telescoping is not time compression: a model of the dating of autobiographical events.

A model of telescoping is proposed that assumes no systematic errors in dating. Rather, the overestimation of recent occurrences of events is based on the combination of three factors: (1) Retention is greater for recent events; (2) errors in dating, though unbiased, increase linearly with the time since the dated event; and (3) intrusions often occur from events outside the period being asked about, but such intrusions do not come from events that have not yet occurred. In Experiment 1, we found that recall for colloquia fell markedly over a 2-year interval, the magnitude of errors in psychologists' dating of the colloquia increased at a rate of .4 days per day of delay, and the direction of the dating error was toward the middle of the interval. In Experiment 2, the model used the retention function and dating errors from the first study to predict the distribution of the actual dates of colloquia recalled as being within a 5-month period. In Experiment 3, the findings of the first study were replicated with colloquia given by, instead of for, the subjects.

Delay activity of saccade-related neurons in the caudal dentate nucleus of the macaque cerebellum.

The caudal dentate nucleus (DN) in lateral cerebellum is connected with two visual/oculomotor areas of the cerebrum: the frontal eye field and lateral intraparietal cortex. Many neurons in frontal eye field and lateral intraparietal cortex produce "delay activity" between stimulus and response that correlates with processes such as motor planning. Our hypothesis was that caudal DN neurons would have prominent delay activity as well. From lesion studies, we predicted that this activity would be related to self-timing, i.e., the triggering of saccades based on the internal monitoring of time. We recorded from neurons in the caudal DN of monkeys (Macaca mulatta) that made delayed saccades with or without a self-timing requirement. Most (84%) of the caudal DN neurons had delay activity. These neurons conveyed at least three types of information. First, their activity was often correlated, trial by trial, with saccade initiation. Correlations were found more frequently in a task that required self-timing of saccades (53% of neurons) than in a task that did not (27% of neurons). Second, the delay activity was often tuned for saccade direction (in 65% of neurons). This tuning emerged continuously during a trial. Third, the time course of delay activity associated with self-timed saccades differed significantly from that associated with visually guided saccades (in 71% of neurons). A minority of neurons had sensory-related activity. None had presaccadic bursts, in contrast to DN neurons recorded more rostrally. We conclude that caudal DN neurons convey saccade-related delay activity that may contribute to the motor preparation of when and where to move.

Effect of Addiction Modeling Reinforcement Schedules on Delay Discounting

Elevated delay discounting, in which delayed rewards quickly lose value as a function of time, is associated with substance use and abuse. Currently, the direction of causation is unclear: while some research indicates that elevated delay discounting leads to future substance use, it is also possible that chronic substance use and specifically the rate of reinforcement associated with drug use, leads to elevated delay discounting. This project aims to examine the latter possibility. 47 participants completed ten 30-minute daily sessions of a visual attention task, and were reinforced at a rate intended to model drug use (fixed ratio 1) or drug abstinence (fixed ratio 10). Baseline and post-training rates of delay discounting were assessed for hypothetical $50 and $1000. Area under the curve of the indifference points as a function of delay was calculated. A greater area under the curve suggests more self-control, whereas a lower value represents more impulsiveness. Results at the monetary value of both $50 and $1000 showed increased impulsivity in relation to the control for both the FR1 and FR10 groups indicating that the two schedules may both model drug use.