Influence of poling methods on the orientational dynamics of 2-methyl-4-nitro-aniline in poly(methyl methacrylate) studied by second harmonic generation

The magnitude and stability of the induced dipolar orientation of 2-methyl-4-nitroaniline (MNA)/poly(methyl methacrylate) (PMMA) guest/host system is investigated. The chromophores are aligned using both the corona discharge and contact electrode poling techniques. The magnitude of order parameter (also an indicator for the second order nonlinear susceptibility) is measured by recording absorbances of the poled (by the two different techniques) and unpoled PMMA films at different concentrations of MNA. Under the same conditions the corona poling technique creates a higher alignment of molecules along the field direction. The time dependence of the second harmonic intensity of the MNA/PMMA film prepared by the two techniques can be described by a Kohlrausch-Williams-Watts stretched exponential. The temperature dependence of the decay time constant is found to generally follow a modified Williams-Landel-Ferry (WLF) or Vogel-Tamann-Fulcher (VTF) equation. The glass transition temperature seems to be the single most important parameter for determining the relaxation time tau(T).

On generating optimal signal probabilities for random tests: A genetic approach

Genetic Algorithms are robust search and optimization techniques. A Genetic Algorithm based approach for determining the optimal input distributions for generating random test vectors is proposed in the paper. A cost function based on the COP testability measure for determining the efficacy of the input distributions is discussed, A brief overview of Genetic Algorithms (GAs) and the specific details of our implementation are described. Experimental results based on ISCAS-85 benchmark circuits are presented. The performance pf our GA-based approach is compared with previous results. While the GA generates more efficient input distributions than the previous methods which are based on gradient descent search, the overheads of the GA in computing the input distributions are larger. To account for the relatively quick convergence of the gradient descent methods, we analyze the landscape of the COP-based cost function. We prove that the cost function is unimodal in the search space. This feature makes the cost function amenable to optimization by gradient-descent techniques as compared to random search methods such as Genetic Algorithms.

The generation of carbonyl compounds from acetals and ketals by iodotrichlorosilane (ITCS)

Cheap and readily available iodotrichlorosilane (SiCl4 / NaI) readily regenerates aldehydes and ketones from cyclic and acyclic acetals and ketals, in 20–60 min at ambient temperature. The reaction is highly chemoselective as phenolic ethers and esters are not cleaved. The pathway for the process is unlike any previously proposed.

Generation of an eight node brick element using Papcovitch-Neuber functions

Some conventional finite elements suffer from drawbacks, such as shear locking, membrane locking, etc. To overcome them researchers have developed various techniques, termed as tricks by some and variational crimes by others. Many attempts have been made, but satisfactory explanations for why some of these techniques work have not been obtained, especially in the case of solid elements. This paper attempts a simple non-conforming solid element using assumed displacement fields which satisfy the Navier equation exactly. Its behaviour under simple loadings like bending, torsion and tension is examined and comparisons are made with existing elements.

Hydrogen-Bond-Directed Nonlinear-Optical Organic Materials - Evidence For The Control Of 2nd-Harmonic Generation Activities From The X-Ray Crystal-Structures Of The Complexes Of L-Tartaric Acid With M-Anisidine and P-Toluidine

Several substituted anilines were converted to binary salts with L-tartaric acid. Second harmonic generation (SHG) activities of these salts were determined. The crystal packing in two structures, (i) m-anisidinium-L-tartrate monohydrate (i) and (ii) p-toluidinium-L-tartrate (2), studied using X-ray diffraction demonstrates that extensive hydrogen bonding steers the components into a framework which has a direct bearing on the SHG activity

Japanese encephalitis virus infection of mouse cell lines: ability to prime mice for generation of virus specific cytotoxic T lymphocytes and differences in CTL recognisable viral determinants

Ten different mouse cell lines were examined for Japanese encephalitis virus (JEV) infection in vitro and then tested for their ability to generate virus specific cytotoxic T lymphocytes (CTL). Among all cell lines examined, Neuro La (a neuroblastoma) was readily infected with JEV as examined by immunofluorescence and viral replication. Among other cells, P388D1, RAW 264.7 (Macrophage origin), Sp2/0 (B-cell Hybridoma), YAC-1 (T-cell lymphoma), and L929 (Fibroblast) were semipermissive to JEV infection. The cytopathic effects caused by progressive JEV infection varied from cell line to cell line. In the case of YAC-1 cells long-term viral antigen expression was observed without significant alterations in cell viability. Intermediate degrees of cytopathicity are seen in RAW 264.7 and L929 cells while infection of PS, Neuro 2a, P388D1 and Sp2/0 caused major viability losses. All infected cell lines were able to prime adult BALB/c (H-2(d)) mice for the generation of secondary JEV specific CTL. In contrast to YAC-1, the permissive neuroblastoma cell line Neuro 2a (H-2K(k)D(d)) was found to be least efficient in its ability to stimulate anti-viral CTL generation. Cold target competition studies demonstrated that both Neuro 2a and YAC-1 (H-2K(k)D(d)) cells expressed similar viral determinants that are recognised by CTL, suggesting that the reason for the lower ability of Neuro 2a to stimulate anti-viral CTL was not due to lack of viral CTL determinants. These findings demonstrate that a variety of mouse cell lines can be infected with Japanese encephalitis virus, and that these infected cells could be utilised to generate virus specific CTL in BALB/c mice.

Reinforcement Learning With Function Approximation for Traffic Signal Control

We propose, for the first time, a reinforcement learning (RL) algorithm with function approximation for traffic signal control. Our algorithm incorporates state-action features and is easily implementable in high-dimensional settings. Prior work, e. g., the work of Abdulhai et al., on the application of RL to traffic signal control requires full-state representations and cannot be implemented, even in moderate-sized road networks, because the computational complexity exponentially grows in the numbers of lanes and junctions. We tackle this problem of the curse of dimensionality by effectively using feature-based state representations that use a broad characterization of the level of congestion as low, medium, or high. One advantage of our algorithm is that, unlike prior work based on RL, it does not require precise information on queue lengths and elapsed times at each lane but instead works with the aforementioned described features. The number of features that our algorithm requires is linear to the number of signaled lanes, thereby leading to several orders of magnitude reduction in the computational complexity. We perform implementations of our algorithm on various settings and show performance comparisons with other algorithms in the literature, including the works of Abdulhai et al. and Cools et al., as well as the fixed-timing and the longest queue algorithms. For comparison, we also develop an RL algorithm that uses full-state representation and incorporates prioritization of traffic, unlike the work of Abdulhai et al. We observe that our algorithm outperforms all the other algorithms on all the road network settings that we consider.

Screw dynamo and the generation of nonaxisymmetric magnetic fields

A mechanism is presented here for the amplification of large-scale nonaxisymmetric magnetic fields as a manifestation of the dynamo effect. We generalize a result on restrictions of dynamo actions due to laminar flow originally derived by Zeldovich, Ruzmaikin, and Sokolov [Magnetic Fields in Astrophysics (Gordon and Breach, New York, 1983)]. We show how a screwlike motion having phi and z components of velocity can help to grow a magnetic field. This model postulates a large-scale flow having phi and z components with radial dependences (helical flow). Shear in the radial field, because of a near-flux-freezing condition, causes amplification of the phi component of the magnetic field. The radial and axial components grow due to the presence of turbulent diffusion. The shear in the large scale flow induces an indefinite growth of magnetic field without the a effect; nevertheless, turbulent diffusion forms an important part in the overall mechanism.

Signal compression through spatial frequency-based motion estimation

The interest in low bit rate video coding has increased considerably. Despite rapid progress in storage density and digital communication system performance, demand for data-transmission bandwidth and storage capacity continue to exceed the capabilities of available technologies. The growth of data-intensive digital audio, video applications and the increased use of bandwidth-limited media such as video conferencing and full motion video have not only sustained the need for efficient ways to encode analog signals, but made signal compression central to digital communication and data-storage technology. In this paper we explore techniques for compression of image sequences in a manner that optimizes the results for the human receiver. We propose a new motion estimator using two novel block match algorithms which are based on human perception. Simulations with image sequences have shown an improved bit rate while maintaining ''image quality'' when compared to conventional motion estimation techniques using the MAD block match criteria.

Trace processors: Moving to fourth-generation microarchitectures

Trace processors rely on hierarchy, replication, and prediction to dramatically increase the execution speed of ordinary sequential programs. The authors describe some of the processors will meet future technology demands.

Distributed intrusion detection in the presence of correlated sensor readings: Signal-space and communication-complexity view-point

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 view-point is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces f(s) and f(g) 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 f(s) and f(g) 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. Extensions to the multi-party case is straightforward and is briefly discussed. The average case CC of the relevant greaterthan (CT) function is characterized within two bits. Under 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. 2010 Elsevier B.V. All rights reserved.

Relaxation behavior of twin nonlinear optical chromophores: Effect of the spacer length

A new series of twin nonlinear optical (NLO) molecules, having two 4-nitrophenol chromophores that are linked via a flexible polymethylene spacer of varying length [(CH2)(n), n = 1-12], were synthesized. Powder second harmonic generation measurements of these twin samples indicated a pronounced odd-even oscillation, with the odd twins exhibiting a high SHG value while the even ones gave no measurable SH signal. This behavior reflects the crystal packing preferences in such twin NLO systems that have odd and even numbers of atoms linking them - the even ones appear to prefer a centrosymmetric packing arrangement. The orientational/disordering dynamics of these twin NLO molecules, doped in a polymer (poly(methyl methacrylate)) matrix, has also been studied using SHG in electric field poled samples. Interestingly, the maximum attainable SH signal, chi((2)), in, the poled samples also showed an odd-even oscillation; the odd ones again having a higher value of chi((2)) This unprecedented odd-even oscillation in such molecularly doped systems is rationalized as being due to the intrinsically greater ease of a parallel alignment of the two chromophores in the twins with an odd spacer than in those with an even one. Further, the temporal stability of the SHG intensity at 70 degrees C, after the removal of the applied corona, was also studied. The relaxation of all the twin chromophores followed a biexponential decay; the characteristic relaxation time (tau(2)) for the slow decay component suggests that while the twin with a single methylene unit relaxes relatively slowly, the relaxation is significantly faster in cases where n = 2 and 3. In the twins with even longer spacer segments, the relaxation again becomes slower and reaches a saturation value. The observed minimum appears to reflect the interplay of two competing factors that affect the chromophore alignment in such twin systems, namely, the electrostatic repulsion between neighboring oriented dipoles and the intrinsic flexibility of the spacer.

The complexity of certain incremental code generation problems

This paper looks at the complexity of four different incremental problems. The following are the problems considered: (1) Interval partitioning of a flow graph (2) Breadth first search (BFS) of a directed graph (3) Lexicographic depth first search (DFS) of a directed graph (4) Constructing the postorder listing of the nodes of a binary tree. The last problem arises out of the need for incrementally computing the Sethi-Ullman (SU) ordering [1] of the subtrees of a tree after it has undergone changes of a given type. These problems are among those that claimed our attention in the process of our designing algorithmic techniques for incremental code generation. BFS and DFS have certainly numerous other applications, but as far as our work is concerned, incremental code generation is the common thread linking these problems. The study of the complexity of these problems is done from two different perspectives. In [2] is given the theory of incremental relative lower bounds (IRLB). We use this theory to derive the IRLBs of the first three problems. Then we use the notion of a bounded incremental algorithm [4] to prove the unboundedness of the fourth problem with respect to the locally persistent model of computation. Possibly, the lower bound result for lexicographic DFS is the most interesting. In [5] the author considers lexicographic DFS to be a problem for which the incremental version may require the recomputation of the entire solution from scratch. In that sense, our IRLB result provides further evidence for this possibility with the proviso that the incremental DFS algorithms considered be ones that do not require too much of preprocessing.

GNSS Signal Detection Under Noise Uncertainty

High sensitivity detection techniques are required for indoor navigation using Global Navigation Satellite System (GNSS) receivers, and typically, a combination of coherent and non- coherent integration is used as the test statistic for detection. The coherent integration exploits the deterministic part of the signal and is limited due to the residual frequency error, navigation data bits and user dynamics, which are not known apriori. So, non- coherent integration, which involves squaring of the coherent integration output, is used to improve the detection sensitivity. Due to this squaring, it is robust against the artifacts introduced due to data bits and/or frequency error. However, it is susceptible to uncertainty in the noise variance, and this can lead to fundamental sensitivity limits in detecting weak signals. In this work, the performance of the conventional non-coherent integration-based GNSS signal detection is studied in the presence of noise uncertainty. It is shown that the performance of the current state of the art GNSS receivers is close to the theoretical SNR limit for reliable detection at moderate levels of noise uncertainty. Alternate robust post-coherent detectors are also analyzed, and are shown to alleviate the noise uncertainty problem. Monte-Carlo simulations are used to confirm the theoretical predictions.