A thermal molecular migration in the solid-state - structures of isomeric 5-amino-4-(2,6-dichlorophenyl)-1-(2-nitrophenyl)-1h-1,2,3-triazole (yellow form i) and 4-(2,6-dichlorophenyl)-5-(2-nitroanilino)-2h-1,2,3-triazole (red form-ii), c14h9cl2n5o2

Yellow form (I): Mr= 350.09, monoclinic, P2Jn, Z--4, a=9.525(1), b=14.762(1), c= 11.268(1),/t, fl= 107.82 (1) o , V= 1508.3 A 3 , Din(flotation in aqueous KI)= 1.539 (2), D x= 1.541 (2) g cm -3, #(Cu Ka, 2 = 1.5418 A) = 40.58 cm -~, F(000) = 712, T= 293 K, R = 8.8% for 2054 significant refections. Red form (II): Mr= 350.09, triclinic, Pi, Z=2, a=9.796(2), b= 10.750 (2), c= 7.421 (1)A, a= 95.29 (2), fl= 0108-2701/84/111901-05501.50 70.18 (1), y = 92-.76 (2) °, V= 731.9 A 3, Din(flotation in KI) = 1.585 (3), D x = 1.588 (3) g cm -3, ~t(Cu Ka, 2 = 1.5418/~) = 40.58 cm -1, F(000) = 356, T=293 K, R = 5.8% for 1866 significant reflections. There are no unusual bond distances or angles. The triazole and two phenyl rings are planar. On the basis of packing considerations the possibility of intermolecular interactions playing a role in the reactivity of the starting material is ruled out.

Solid-State Acyl Migration In Salicylamides - An X-Ray Study Of The Ortho-Propionyl And Normal-Propionyl Derivatives

In recent years there has been an upsurge of interest in the study of organic reactions in the solid state. It is now realised that the crystalline matrix provides an extra-ordinary spatial control on the initiation and progress of these reactions. Electronic and dipolar effects which are important in solution are replaced by structural and geometric effects in solids. These 'spatial' or 'topochemical' aspects are important in understanding the mechanistic details of the reaction. In our laboratory, the thermally induced acyl migration in salicylamides from 0- to N- position in the solid state has been under study (Scheme 1). The structures of the acetyl and benzoyl derivatives (Ia,IIa, Ib and IIb) have been reported.

Thermally Induced Acyl Migration in Salicylamides. 1. Structures of the Reactants, O-Acetylsalicylamide and O-Benzoylsalicylamide

O-Acetylsalicylamide (Ia), C9H9NO3, M r =179.18, monoclinic, P2Jc, a=8.155(5), b=8.571 (2), c= 13.092 (3)A, fl=99.54 (5) ° , V= 902.4(6)A 3, Z=4, Dm=l.31, Dx=l.319gcm -3, 2(Mo Ka) = 0.71069 A,/~ = 1.08 cm -1, F(000) = 376, T = 295 K, R = 0.076 for 1604 reflections. O-Benzoylsalicylamide (Ib), C14HtlNO 3, M,=241.2, monoclinic, P2t/e, a=9.423(1), b=5.116(1), e= 26.424 (2) A, fl= 103.97 (1)% V= 1236.2 (3)/~3, Z= 4, D~ = 1.28, D x = 1.296 gcm -3, ,;L(Cu Ks) = 1.5418 A, p = 7.71 cm-', F(000) = 504, T= 295 K, R =0.050 for 2115 reflections. The dihedral angles between the amide group and the benzene ring are 39.9 ° (Ia) and 37.9 ° (Ib), whereas between the acyl group and the benzene ring they are 78.1 ° (Ia) and 93.4 ° (Ib). The differences in the packing of the two structures are brought out in terms of the observed hydrogen-bonding patterns. Based on the crystallographic results, an intramolecular mechanism for the migration of the acyl group from the O to the N position is suggested in both compounds.

Efficient Energy Management Policies for Networks with Energy Harvesting Sensor Nodes

We study sensor networks with energy harvesting nodes. The generated energy at a node can be stored in a buffer. A sensor node periodically senses a random field and generates a packet. These packets are stored in a queue and transmitted using the energy available at that time at the node. For such networks we develop efficient energy management policies. First, for a single node, we obtain policies that are throughput optimal, i.e., the data queue stays stable for the largest possible data rate. Next we obtain energy management policies which minimize the mean delay in the queue. We also compare performance of several easily implementable suboptimal policies. A greedy policy is identified which, in low SNR regime, is throughput optimal and also minimizes mean delay. Next using the results for a single node, we develop efficient MAC policies.

A self-adaptive migration model genetic algorithm for data mining applications

Data mining involves nontrivial process of extracting knowledge or patterns from large databases. Genetic Algorithms are efficient and robust searching and optimization methods that are used in data mining. In this paper we propose a Self-Adaptive Migration Model GA (SAMGA), where parameters of population size, the number of points of crossover and mutation rate for each population are adaptively fixed. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions and a set of actual classification datamining problems. Michigan style of classifier was used to build the classifier and the system was tested with machine learning databases of Pima Indian Diabetes database, Wisconsin Breast Cancer database and few others. The performance of our algorithm is better than others.

Average-Delay Optimal Policies for the Point-to-Point Channel

Average-delay optimal scheduflng of messages arriving to the transmitter of a point-to-point channel is considered in this paper. We consider a discrete time batch-arrival batch-service queueing model for the communication scheme, with service time that may be a function of batch size. The question of delay optimality is addressed within the semi-Markov decision-theoretic framework. Approximations to the average-delay optimal policy are obtained.

Optimized Policies for the Retransmission Probabilities in Slotted Aloha

In this paper, we study the behaviour of the slotted Aloha multiple access scheme with a finite number of users under different traffic loads and optimize the retransmission probability q(r) for various settings, cost objectives and policies. First, we formulate the problem as a parameter optimization problem and use certain efficient smoothed functional algorithms for finding the optimal retransmission probability parameter. Next, we propose two classes of multi-level closed-loop feedback policies (for finding in each case the retransmission probability qr that now depends on the current system state) and apply the above algorithms for finding an optimal policy within each class of policies. While one of the policy classes depends on the number of backlogged nodes in the system, the other depends on the number of time slots since the last successful transmission. The latter policies are more realistic as it is difficult to keep track of the number of backlogged nodes at each instant. We investigate the effect of increasing the number of levels in the feedback policies. Wen also investigate the effects of using different cost functions (withn and without penalization) in our algorithms and the corresponding change in the throughput and delay using these. Both of our algorithms use two-timescale stochastic approximation. One of the algorithms uses one simulation while the other uses two simulations of the system. The two-simulation algorithm is seen to perform better than the other algorithm. Optimal multi-level closed-loop policies are seen to perform better than optimal open-loop policies. The performance further improves when more levels are used in the feedback policies.

A Dynamic Migration Model for Self-adaptive Genetic Algorithms

In this paper, we propose a self Adaptive Migration Model for Genetic Algorithms, where parameters of population size, the number of points of crossover and mutation rate for each population are fixed adaptively. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions, when compared with Island model GA(IGA) and Simple GA(SGA).

Heat-shock protein 70-2 (HSP70-2) expression in bladder urothelial carcinoma is associated with tumour progression and promotes migration and invasion

Purpose: Testis specific heat-shock protein 70-2 (HSP70-2), a member of HSP70 chaperone family, is essential for the growth of spermatocytes and cancer cells. We investigated the association of HSP70-2 expression with clinical behaviour and progression of urothelial carcinoma of bladder. Experimental design: We assessed the HSP70-2 expression by RT-PCR and HSP70-2 protein expression by immunofluorescence, flow cytometry, immunohistochemistry and Western blotting in urothelial carcinoma patient specimens and HTB-1, UMUC-3, HTB-9, HTB-2 and normal human urothelial cell lines. Further, to investigate the role of HSP70-2 in bladder tumour development, HSP70-2 was silenced in the high-grade invasive HTB-1 and UMUC-3 cells. The malignant properties of urothelial carcinoma cells were examined using colony formation, migration assay, invasion assay in vitro and tumour growth in vivo. Results: Our RT-PCR analysis and immunohistochemistry analysis revealed that HSP70-2 was expressed in both moderate to well-differentiated and high-grade invasive urothelial carcinoma cell lines studied and not in normal human urothelial cells. In consistence with these results, HSP70-2 expression was also observed in superficially invasive (70%) and muscle-invasive (90%) patient's tumours. Furthermore, HSP70-2 knockdown significantly suppressed cellular motility and invasion ability. An in vivo xenograft study showed that inhibition of HSP70-2 significantly suppressed tumour growth. Conclusions: In conclusion, our data suggest that the HSP70-2 expression is associated with early spread and progression of urothelial carcinoma of bladder cancer and that HSP70-2 can be the potential therapeutic target for bladder urothelial carcinoma. (C) 2009 Elsevier Ltd. All rights reserved.

Optimal threshold policies for admission control in communication networks via discrete parameter stochastic approximation

The problem of admission control of packets in communication networks is studied in the continuous time queueing framework under different classes of service and delayed information feedback. We develop and use a variant of a simulation based two timescale simultaneous perturbation stochastic approximation (SPSA) algorithm for finding an optimal feedback policy within the class of threshold type policies. Even though SPSA has originally been designed for continuous parameter optimization, its variant for the discrete parameter case is seen to work well. We give a proof of the hypothesis needed to show convergence of the algorithm on our setting along with a sketch of the convergence analysis. Extensive numerical experiments with the algorithm are illustrated for different parameter specifications. In particular, we study the effect of feedback delays on the system performance.

A Dynamic Migration Model for self-adaptive Genetic Algorithms

In this paper, we propose a self Adaptive Migration Model for Genetic Algorithms, where parameters of population size, the number of points of crossover and mutation rate for each population are fixed adaptively. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions, when compared with Island model GA(IGA) and Simple GA(SGA).

Online association policies in IEEE 802.11 WLANs

In this paper, we study the performance of client-Access Point (AP) association policies in IEEE 802.11 based WLANs. In many scenarios, clients have a choice of APs with whom they can associate. We are interested in finding association policies which lead to optimal system performance. More specifically, we study the stability of different association policies as a function of the spatial distribution of arriving clients. We find for each policy the range of client arrival rates for which the system is stable. For small networks, we use Lyapunov function methods to formally establish the stability or instability of certain policies in specific scenarios. The RAT heuristic policy introduced in our prior work is shown to have very good stability properties when compared to several other natural policies. We also validate our analytical results by detailed simulation employing the IEEE 802.11 MAC.

Photophysics of conjugated polymers: interplay between Forster energy migration and defect concentration in shaping a photochemical funnel in PPV

Recent single molecule experiments have suggested the existence of a photochemical funnel in the photophysics of conjugated polymers, like poly[2-methoxy-5-(2'-ethylhexyl)oxy-1,4-phenylenevinylene] (MEH-PPV). The funnel is believed to be a consequence of the presence of conformational or chemical defects along the polymer chain and efficient non-radiative energy transfer among different chromophore segments. Here we address the effect of the excitation energy dynamics on the photophysics of PPV. The PPV chain is modeled as a polymer with the length distribution of chromophores given either by a Gaussian or by a Poisson distribution. We observe that the Poisson distribution of the segment lengths explains the photophysics of PPV better than the Gaussian distribution. A recently proposed version of an extended particle-in-a-box' model is used to calculate the exciton energies and the transition dipole moments of the chromophores, and a master equation to describe the excitation energy transfer among different chromophores. The rate of energy transfer is assumed to be given here, as a first approximation, by the well-known Forster expression. The observed excitation population dynamics confirms the photochemical funneling of excitation energy from shorter to longer chromophores of the polymer chain. The time scale of spectral shift and energy transfer for our model polymer, with realistic values of optical parameters, is in the range of 200-300 ps. We find that the excitation energy may not always migrate towards the longest chromophore segments in the polymer chain as the efficiency of energy transfer between chromophores depends on the separation distance between the two and their relative orientation.

Optimal Sleep-Wake Policies for an Energy Harvesting Sensor Node

We study a sensor node with an energy harvesting source. In any slot,the sensor node is in one of two modes: Wake or Sleep. The generated energy is stored in a buffer. The sensor node senses a random field and generates a packet when it is awake. These packets are stored in a queue and transmitted in the wake mode using the energy available in the energy buffer. We obtain energy management policies which minimize a linear combination of the mean queue length and the mean data loss rate. Then, we obtain two easily implementable suboptimal policies and compare their performance to that of the optimal policy. Next, we extend the Throughput Optimal policy developed in our previous work to sensors with two modes. Via this policy, we can increase the through put substantially and stabilize the data queue by allowing the node to sleep in some slots and to drop some generated packets. This policy requires minimal statistical knowledge of the system. We also modify this policy to decrease the switching costs.

A theory on the migration of an extraneous electron across hydrogen bonds in polypeptides

The migrating electrons in biological systems normally are extraneous and taking this into account the electron delocalisation across the hydrogen bonds in proteins is re-examined. It is seen that an extraneous electron can travel rapidly via the low-lying virtual orbitals of the hydrogen-bonded π-electronic structure of peptide units in proteins. The frequency of electron transfer decreases slowly with an increase in the path length. However, the coupling of electron and protonic motions enhances this frequency. Transfer of electrons across the hydrogen bonds in accordance with the double-exchange mechanism does not appear to be possible. This theory offers a possibility for an extraneous electron to transfer within protein structures.