Vibration-rotation pattern in acetylene. II. Introduction of Coriolis coupling in the global model and analysis of emission spectra of hot acetylene around 3 mu m

A high temperature source has been developed and coupled to a high resolution Fourier transform spectrometer to record emission spectra of acetylene around 3 mu m up to 1455 K under Doppler limited resolution (0.015 cm(-1)). The nu(3)-ground state (GS) and nu(2)+nu(4)+nu(5)(Sigma(+)(u) and Delta(u))-GS bands and 76 related hot bands, counting e and f parities separately, are assigned using semiautomatic methods based on a global model to reproduce all related vibration-rotation states. Significantly higher J-values than previously reported are observed for 40 known substates while 37 new e or f vibrational substates, up to about 6000 cm(-1), are identified and characterized by vibration-rotation parameters. The 3 811 new or improved data resulting from the analysis are merged into the database presented by Robert et al. [Mol. Phys. 106, 2581 (2008)], now including 15 562 lines accessing vibrational states up to 8600 cm(-1). A global model, updated as compared to the one in the previous paper, allows all lines in the database to be simultaneously fitted, successfully. The updates are discussed taking into account, in particular, the systematic inclusion of Coriolis interaction.

Strategies for efficient disruption of metabolism in Mycobacterium tuberculosis from network analysis

Tuberculosis continues to be a major health challenge, warranting the need for newer strategies for therapeutic intervention and newer approaches to discover them. Here, we report the identification of efficient metabolism disruption strategies by analysis of a reactome network. Protein-protein dependencies at a genome scale are derived from the curated metabolic network, from which insights into the nature and extent of inter-protein and inter-pathway dependencies have been obtained. A functional distance matrix and a subsequent nearness index derived from this information, helps in understanding how the influence of a given protein can pervade to the metabolic network. Thus, the nearness index can be viewed as a metabolic disruptability index, which suggests possible strategies for achieving maximal metabolic disruption by inhibition of the least number of proteins. A greedy approach has been used to identify the most influential singleton, and its combination with the other most pervasive proteins to obtain highly influential pairs, triplets and quadruplets. The effect of deletion of these combinations on cellular metabolism has been studied by flux balance analysis. An obvious outcome of this study is a rational identification of drug targets, to efficiently bring down mycobacterial metabolism.

Transient response of nonlinear magneto-optic rotation in a paraffin-coated Rb vapor cell

We study resonant nonlinear magneto-optic rotation (NMOR) in a paraffin-coated Rb vapor cell as the magnetic field is swept. At low sweep rates, the nonlinear rotation appears as a narrow resonance signal with a linewidth of about ``300 mu G''(2 pi x 420 Hz). At high sweep rates, the signal shows transient response with an oscillatory decay. The decay time constant is of order 100 ms. The behavior is different for transitions starting from the lower or the upper hyperfine level of the ground state because of optical pumping effects.

Efficient scheduling of sensor activity for information coverage in wireless sensor networks

In this paper, we are concerned with algorithms for scheduling the sensing activity of sensor nodes that are deployed to sense/measure point-targets in wireless sensor networks using information coverage. Defining a set of sensors which collectively can sense a target accurately as an information cover, we propose an algorithm to obtain Disjoint Set of Information Covers (DSIC), which achieves longer network life compared to the set of covers obtained using an Exhaustive-Greedy-Equalized Heuristic (EGEH) algorithm proposed recently in the literature. We also present a detailed complexity comparison between the DSIC and EGEH algorithms.

On the Average Case Communication Complexity for Detection in Sensor Networks

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space viewpoint is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces $\mathcal{S_I}$ and $\mathcal{S_C}$ and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating $\mathcal{S_I}$ and $\mathcal{S_C}$ is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. The average case CC of the relevant greater-than (GT) function is characterized within two bits. In the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm.

Secondary flow induced by the rotation of two concentric spheres about their common diameter in micropolar fluids

In this paper, we have studied the secondary flow induced in a micropolar fluid by the rotation of two concentric spheres about a fixed diameter. The secondary flow exhibits behaviour commonly observed in visco-elastic fluids. In particular we have obtained the expressions for microrotation vector. Numerical results have been obtained for a number of values of relative rotations of the two spheres for a chosen set of values of fluid parameters. The results are presented graphically and compared with the previous investigations.

Secondary flows induced by the rotation of a sphere or coaxial cones in micropolar fluids

The micropolar fluids like Newtonian and Non-Newtonian fluids cannot sustain a simple shearing motion, wherein only one component of velocity is present. They exhibit both primary and secondary motions when the boundaries are subject to slow rotations. The primary motion, as in Non-Newtonian fluids, characterized by the equation due to Rivlin-Ericksen, Oldroyd, Walters etc., resembles that of Newtonian fluid for slow steady rotation. We further notice that the micro-rotation becomes identically equal to the vorticity present in the fluid and the condition b) of "Wall vorticity" can alone be satisfied at the boundaries. As regards, the secondary motion, we notice that it can be determined by the above procedure for a special class of fluids, namely that for which j0(n2-n3)=4 n3/l2. Moreover for this class of fluids, the micro-rotation is identical with the vorticity of the fluid everywhere. Also the stream function for the secondary flow is identical with that for the Newtonian fluid with a suitable definition of the Reynolds number. In contrast with the Non-Newtonian fluids, characterized by the equation due to Rivlin-Ericksen, Oldroyd, Walters etc., this class of micropolar fluids does not show separation. This is in conformity with the statement of Condiff and Dahler (3) that in any steady flow, internal spin matches the vorticity everywhere provided that (i) spin boundary conditions are satisfied, (ii) body torques and non-conservative body forces are absent, and (iii) inertial and spin-inertial terms are either negligible or vanish identically.

Slow rotation of a sphere in a non-Newtonian fluid with or without suction or injection

The flow generated by the rotation of a sphere in an infinitely extending fluid has recently been studied by Goldshtik. The corresponding problem for non-Newtonian Reiner-Rivlin fluids has been studied by Datta. Bhatnagar and Rajeswari have studied the secondary flow between two concentric spheres rotating about an axis in the non-Newtonian fluids. This last investigation was further generalised by Rajeswari to include the effects of small radial suction or injection. In Part A of the present investigation, we have studied the secondary flow generated by the slow rotation of a single sphere in non-Newtonian fluid obeying the Rivlin-Ericksen constitutive equation. In Part B, the effects of small suction or injection have been studied which is applied in an arbitrary direction at the surface of the sphere. In the absence of suction or injection, the secondary flow for small values of the visco-elastic parameter is similar to that of Newtonian fluids with inclusion of inertia terms in the Oseen approximation. If this parameter exceeds Kc = 18R/219, whereR is the Reynolds number, the breaking of the flow field takes place into two domains, in one of which the stream lines form closed loops. For still higher values of this parameter, the complete reversal of the sense of the flow takes place. When suction or injection is included, the breaking of the flow persists under certain condition investigated in this paper. When this condition is broken, the breaking of the flow is obliterated.

Minimizing total weighted tardiness on a batch-processing machine with non-agreeable release times and due dates

This study considers the scheduling problem observed in the burn-in operation of semiconductor final testing, where jobs are associated with release times, due dates, processing times, sizes, and non-agreeable release times and due dates. The burn-in oven is modeled as a batch-processing machine which can process a batch of several jobs as long as the total sizes of the jobs do not exceed the machine capacity and the processing time of a batch is equal to the longest time among all the jobs in the batch. Due to the importance of on-time delivery in semiconductor manufacturing, the objective measure of this problem is to minimize total weighted tardiness. We have formulated the scheduling problem into an integer linear programming model and empirically show its computational intractability. Due to the computational intractability, we propose a few simple greedy heuristic algorithms and meta-heuristic algorithm, simulated annealing (SA). A series of computational experiments are conducted to evaluate the performance of the proposed heuristic algorithms in comparison with exact solution on various small-size problem instances and in comparison with estimated optimal solution on various real-life large size problem instances. The computational results show that the SA algorithm, with initial solution obtained using our own proposed greedy heuristic algorithm, consistently finds a robust solution in a reasonable amount of computation time.

Two-agent cooperative search using game models with endurance-time constraints

In this article, the problem of two Unmanned Aerial Vehicles (UAVs) cooperatively searching an unknown region is addressed. The search region is discretized into hexagonal cells and each cell is assumed to possess an uncertainty value. The UAVs have to cooperatively search these cells taking limited endurance, sensor and communication range constraints into account. Due to limited endurance, the UAVs need to return to the base station for refuelling and also need to select a base station when multiple base stations are present. This article proposes a route planning algorithm that takes endurance time constraints into account and uses game theoretical strategies to reduce the uncertainty. The route planning algorithm selects only those cells that ensure the agent will return to any one of the available bases. A set of paths are formed using these cells which the game theoretical strategies use to select a path that yields maximum uncertainty reduction. We explore non-cooperative Nash, cooperative and security strategies from game theory to enhance the search effectiveness. Monte-Carlo simulations are carried out which show the superiority of the game theoretical strategies over greedy strategy for different look ahead step length paths. Within the game theoretical strategies, non-cooperative Nash and cooperative strategy perform similarly in an ideal case, but Nash strategy performs better than the cooperative strategy when the perceived information is different. We also propose a heuristic based on partitioning of the search space into sectors to reduce computational overhead without performance degradation.

Rotation sensitivity of Lau fringes: an analysis based on coherence theory

An analysis based on coherence theory is presented, which explains the experimentally observed rotation sensitivity of the contrast of Lau fringes obtained under spatially incoherent illumination.

Wavelength/Time Multiple-Pulses-per-Row codes: Construction and verification

Two dimensional Optical Orthogonal Codes (OOCs) named Wavelength/Time Multiple-Pulses-per-Row (W/T MPR) codes suitable for use in incoherent fiber-optic code division multiple access (FO-CDMA) networks are reported in [6]. In this paper, we report the construction of W/T MPR codes, using Greedy Algorithm (GA), with distinct 1-D OOCs [1] as the row vectors. We present the W/T MPR codes obtained using the GA. Further, we verify the correlation properties of the generated W/T MPR codes using Matlab.

Document page layout analysis using Harris corner points

Extraction of text areas from the document images with complex content and layout is one of the challenging tasks. Few texture based techniques have already been proposed for extraction of such text blocks. Most of such techniques are greedy for computation time and hence are far from being realizable for real time implementation. In this work, we propose a modification to two of the existing texture based techniques to reduce the computation. This is accomplished with Harris corner detectors. The efficiency of these two textures based algorithms, one based on Gabor filters and other on log-polar wavelet signature, are compared. A combination of Gabor feature based texture classification performed on a smaller set of Harris corner detected points is observed to deliver the accuracy and efficiency.

Utilization bounds for RM scheduling on uniform multiprocessors

Utilization bounds for Earliest Deadline First(EDF) and Rate Monotonic(RM) scheduling are known and well understood for uniprocessor systems. In this paper, we derive limits on similar bounds for the multiprocessor case, when the individual processors need not be identical. Tasks are partitioned among the processors and RM scheduling is assumed to be the policy used in individual processors. A minimum limit on the bounds for a 'greedy' class of algorithms is given and proved, since the actual value of the bound depends on the algorithm that allocates the tasks. We also derive the utilization bound of an algorithm which allocates tasks in decreasing order of utilization factors. Knowledge of such bounds allows us to carry out very fast schedulability tests although we are constrained by the fact that the tests are sufficient but not necessary to ensure schedulability.