Detecting localized homogeneous anomalies over spatio-temporal data

The last decade has witnessed an unprecedented growth in availability of data having spatio-temporal characteristics. Given the scale and richness of such data, finding spatio-temporal patterns that demonstrate significantly different behavior from their neighbors could be of interest for various application scenarios such as—weather modeling, analyzing spread of disease outbreaks, monitoring traffic congestions, and so on. In this paper, we propose an automated approach of exploring and discovering such anomalous patterns irrespective of the underlying domain from which the data is recovered. Our approach differs significantly from traditional methods of spatial outlier detection, and employs two phases—(i) discovering homogeneous regions, and (ii) evaluating these regions as anomalies based on their statistical difference from a generalized neighborhood. We evaluate the quality of our approach and distinguish it from existing techniques via an extensive experimental evaluation.     

Iodine speciation studies on Bunsen reaction of S–I cycle using spectroscopic techniques

Bunsen reaction is an important step of sulfur–iodine cycle for hydrogen production from thermochemical splitting of water. Polyiodide species generated during the separation process need to be identified for complete understanding of the mechanism involved. Speciation of these polyiodide species formed during Bunsen reaction can lead to better understanding of kinetics of the process. HIx species formed have been analyzed using UV–visible and Raman spectroscopic techniques. Peak corresponding to HI₃ species have been ascertained and their conversion to higher HI₅, HI₇ …… species has been observed.     

Minimizing makespan during environmental stress screening using a genetic algorithm and an ant colony optimization

The environmental stress screening (ESS) chamber employed in a typical electronics manufacturing service (EMS) provider’s facility is used for screening products, attempting to expose defects that cannot be detected by visual inspection or electrical testing. The ESS chambers are bottleneck work centers in most of the EMS facilities. This research uses a genetic algorithm (GA) and an ant colony optimization (ACO) to solve the job-scheduling problem at the ESS chamber where the makespan of the process is minimized. The performances of the two approaches were compared against some of the first-fit (FF) techniques from the literature. Both the GA and ACO techniques produced satisfactory results up to a job size of 40. Furthermore, ACO generally requires a longer computational time, while offering more consistent solution quality.     

A DELAY-LINE CANCELLATION METHOD FOR CLUTTER ATTENUATION AND ELIMINATION OF BLIND SPEED

In this paper, a conceptual schematic for the search radar has been presented which offers clutter cancellation as well as blind speed elimination. It is assumed that the radar is performing conical scan in both azimuth and elevation. For such cases, strong clutter signals are likely to be intercepted from off-boresight angles. A pulse-to-pulse comparison method is presented where the radar transmits and receives SUM beam during the first pulse and DIFFERENCE beam in the second pulse. The detected voltages for the echoes received during the pulse intervals are subtracted from each other and the negative voltage at the output of subtractor is discarded. This result in a narrow beam pointed in the direction of angle of arrival. This method, in receive only mode, can also be used for calibration of large phased arrays.     

The differential effect of polymyxin B1 on guinea pig lung mitochondrial and microsomal glycerophosphate acyltransferase

The activities of guinea pig lung mitochondrial and microsomal glycerophosphate acyltransferase differed in sensitivity to polymyxin B₁. At an antibiotic concentration of 1 mg/ml, the mitochondrial enzyme activity was stimulated twofold, but the microsomal enzyme activity was completely inhibited. Furthermore, the mitochondrial enzyme activity was stimulated by polymyxin B₁ without the addition of exogenous acyl-CoA. Additional experiments ruled out the possibility of polymyxin B₁ acting as a substrate for the mitochondrial acyltransferase. These results suggest either that the polymyxin B₁ sensitivity of mitochondrial and microsomal glycerophosphate acyltransferase is different or that their accessibility to substrates is different because the two isoenzymes are located differently in the different phospholipid microenvironment of the membranes.     

Fluorescence absorbance inner-filter decomposition: the role of emission shape on estimates of free Ca(2+) using Rhod-2

A method for decomposing complex emission spectra by correcting for known inner-filter effects is described. This approach builds on previous work using a linear combination of model emission spectra and combines the known absorption characteristics of the system to fit the composite emission spectrum. Rhod-2, which has a small Stokes shift and significant self-absorption, was used as the model system. By adding the absorption characteristics of Rhod-2 to the model, the degree of fit was significantly improved, thus minimizing residuals, and accurately predicted the spectral shape changes with increasing concentration, [Rhod-2]. More complex studies were conducted with Rhod-2 in isolated cardiac mitochondria with multiple emission and absorption elements. By including known absorbances to the spectral decomposition, the overall precision increased almost four fold. Moreover, this approach eliminated the significant [Rhod-2] dependence on the apparent K(50) and therefore improved the accuracy of free [Ca(2+)] calculations. These data demonstrate that secondary inner-filter correction can significantly improve spectral decomposition of complex emission spectra, which are used in a variety of biological applications.     

The hardness of the Expected Decision Depth problem

Given a function f over n binary variables, and an ordering of the n variables, we consider the Expected Decision Depth problem. Namely, what is the expected number of bits that need to be observed until the value of the function is determined, when bits of the input are observed according to the given order. Our main finding is that this problem is (essentially) #P-complete. Moreover, the hardness holds even when the function f is represented as a decision tree.     

Deterministic extractors for small-space sources

We give polynomial-time, deterministic randomness extractors for sources generated in small space, where we model space s sources on ${\{0,1\}}^n$ as sources generated by width $2^s$ branching programs. Specifically, there is a constant $\eta >0$ such that for any $\zeta >n^{?\eta }$, our algorithm extracts $m=(\delta ?\zeta )n$ bits that are exponentially close to uniform (in variation distance) from space s sources with min-entropy δn, where $s=\Omega ({\zeta }^{3}n)$. Previously, nothing was known for $\delta ?1/2$, even for space 0. Our results are obtained by a reduction to the class of total-entropy independent sources. This model generalizes both the well-studied models of independent sources and symbol-fixing sources. These sources consist of a set of r independent smaller sources over ${\{0,1\}}^{?}$, where the total min-entropy over all the smaller sources is k. We give deterministic extractors for such sources when k is as small as $\mathsf{polylog}(r)$, for small enough ?.