Simultaneous multilayer scanning and detection for multiphoton fluorescence microscopy

Fast three-dimensional (3D) imaging requires parallel optical slicing of a specimen with an efficient detection scheme. The generation of multiple localized dot-like excitation structures solves the problem of simultaneous slicing multiple specimen layers, but an efficient detection scheme is necessary. Confocal theta detection (detection at 90 degrees to the optical axis) provides a suitable detection platform that is capable of cross-talk-free fluorescence detection from each nanodot (axial dimension approximate to 150 nm). Additionally, this technique has the unique feature of imaging a specimen at a large working distance with super-resolution capabilities. Polarization studies show distinct field structures for fixed and fluid samples, indicating a non-negligible field-dipole interaction. The realization of the proposed imaging technique will advance and diversify multiphoton fluorescence microscopy for numerous applications in nanobioimaging and optical engineering.

Object Tracking Using Motion Direction Detection

We present an algorithm for tracking objects in a video sequence, based on a novel approach for motion detection. We do not estimate the velocity �eld. In-stead we detect only the direction of motion at edge points and thus isolate sets of points which are moving coherently. We use a Hausdor� distance based matching algorithm to match point sets in local neighborhood and thus track objects in a video sequence. We show through some examples the e�ectiveness of the algo- rithm.

Intelligent Approach for Fault Diagnosis in Power Transmission Systems Using Support Vector Machines

This paper presents an approach for identifying the faulted line section and fault location on transmission systems using support vector machines (SVMs) for diagnosis/post-fault analysis purpose. Power system disturbances are often caused by faults on transmission lines. When fault occurs on a transmission system, the protective relay detects the fault and initiates the tripping operation, which isolates the affected part from the rest of the power system. Based on the fault section identified, rapid and corrective restoration procedures can thus be taken to minimize the power interruption and limit the impact of outage on the system. The approach is particularly important for post-fault diagnosis of any mal-operation of relays following a disturbance in the neighboring line connected to the same substation. This may help in improving the fault monitoring/diagnosis process, thus assuring secure operation of the power systems. In this paper we compare SVMs with radial basis function neural networks (RBFNN) in data sets corresponding to different faults on a transmission system. Classification and regression accuracy is reported for both strategies. Studies on a practical 24-Bus equivalent EHV transmission system of the Indian Southern region is presented for indicating the improved generalization with the large margin classifiers in enhancing the efficacy of the chosen model.

Switching and fault transient analysis of 765 kV transmission systems

The analysis of electromagnetic transients arising in EHV/UHV power networks gives necessary information about the possible stresses on the different network components, which will determine their proper design, limits of operation as well as their pertinent protection strategies. This paper describes the transient analysis of 765 kV EHV transmission system which is a typical expansion in Indian power grid system. Considering various conditions, switching transient and fault transient studies are carried out. A FORTRAN version of EMTP is developed, to study a practical example, then a comparison with the results available in the literature is made.

Delay Optimal Event Detection on Ad Hoc Wireless Sensor Networks

We consider a small extent sensor network for event detection, in which nodes periodically take samples and then contend over a random access network to transmit their measurement packets to the fusion center. We consider two procedures at the fusion center for processing the measurements. The Bayesian setting, is assumed, that is, the fusion center has a prior distribution on the change time. In the first procedure, the decision algorithm at the fusion center is network-oblivious and makes a decision only when a complete vector of measurements taken at a sampling instant is available. In the second procedure, the decision algorithm at the fusion center is network-aware and processes measurements as they arrive, but in a time-causal order. In this case, the decision statistic depends on the network delays, whereas in the network-oblivious case, the decision statistic does not. This yields a Bayesian change-detection problem with a trade-off between the random network delay and the decision delay that is, a higher sampling rate reduces the decision delay but increases the random access delay. Under periodic sampling, in the network-oblivious case, the structure of the optimal stopping rule is the same as that without the network, and the optimal change detection delay decouples into the network delay and the optimal decision delay without the network. In the network-aware case, the optimal stopping problem is analyzed as a partially observable Markov decision process, in which the states of the queues and delays in the network need to be maintained. A sufficient decision statistic is the network state and the posterior probability of change having occurred, given the measurements received and the state of the network. The optimal regimes are studied using simulation.

Fluoranthene based fluorescent chemosensors for detection of explosive nitroaromatics

A novel fluoranthene based fluorescent chemosensor for the detection of picric acid (PA) at the parts per billion (ppb) level was evaluated. Static fluorescence quenching was the dominant process by intercalative pi-pi interaction between fluoranthene (S-1) and nitroaromatics.

Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance

We present two online algorithms for maintaining a topological order of a directed n-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm handles m arc additions in O(m(3/2)) time. For sparse graphs (m/n = O(1)), this bound improves the best previous bound by a logarithmic factor, and is tight to within a constant factor among algorithms satisfying a natural locality property. Our second algorithm handles an arbitrary sequence of arc additions in O(n(5/2)) time. For sufficiently dense graphs, this bound improves the best previous bound by a polynomial factor. Our bound may be far from tight: we show that the algorithm can take Omega(n(2)2 root(2lgn)) time by relating its performance to a generalization of the k-levels problem of combinatorial geometry. A completely different algorithm running in Theta (n(2) log n) time was given recently by Bender, Fineman, and Gilbert. We extend both of our algorithms to the maintenance of strong components, without affecting the asymptotic time bounds.

Vehicle Detection Tool - VDtect

The report talks about the implementation of Vehicle Detection tool using opensource software - WxPython. The main functionality of this tool includes collection of data, plotting of magnetometer data and the count of the vehicles detected. The report list about how installation process and various functionality of the tool.