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.

Multipath Dissemination in Regular Mesh Topologies

Mesh topologies are important for large-scale peer-to-peer systems that use low-power transceivers. The Quality of Service (QoS) in such systems is known to decrease as the scale increases. We present a scalable approach for dissemination that exploits all the shortest paths between a pair of nodes and improves the QoS. Despite th presence of multiple shortest paths in a system, we show that these paths cannot be exploited by spreading the messages over the paths in a simple round-robin manner; nodes along one of these paths will always handle more messages than the nodes along the other paths. We characterize the set of shortest paths between a pair of nodes in regular mesh topologies and derive rules, using this characterization, to effectively spread the messages over all the available paths. These rules ensure that all the nodes that are at the same distance from the source handle roughly the same number of messages. By modeling the multihop propagation in the mesh topology as a multistage queuing network, we present simulation results from a variety of scenarios that include link failures and propagation irregularities to reflect real-world characteristics. Our method achieves improved QoS in all these scenarios.

Anionic clay-Pt metal nanoparticle composite through intercalation of hexachloroplatinate in nickel zinc hydroxysalt

Nickel zinc hydroxysalt–Pt metal nanoparticle composite was prepared by intercalation of the anionic platinum complex, [PtCl6]2− in nickel zinc hydroxysalt through ion exchange reaction and subsequent reduction of the platinum complex by ethanol. Powder X-ray diffraction and microscopy studies indicate that the process of reduction of the platinum complex in the interlayer region of the anionic clay takes place topotactically without destroying the layers.

Location of concentrators in a computer communication network: a stochastic automation search method

The following problem is considered. Given the locations of the Central Processing Unit (ar;the terminals which have to communicate with it, to determine the number and locations of the concentrators and to assign the terminals to the concentrators in such a way that the total cost is minimized. There is alao a fixed cost associated with each concentrator. There is ail upper limit to the number of terminals which can be connected to a concentrator. The terminals can be connected directly to the CPU also In this paper it is assumed that the concentrators can bo located anywhere in the area A containing the CPU and the terminals. Then this becomes a multimodal optimization problem. In the proposed algorithm a stochastic automaton is used as a search device to locate the minimum of the multimodal cost function . The proposed algorithm involves the following. The area A containing the CPU and the terminals is divided into an arbitrary number of regions (say K). An approximate value for the number of concentrators is assumed (say m). The optimum number is determined by iteration later The m concentrators can be assigned to the K regions in (mk) ways (m > K) or (km) ways (K>m).(All possible assignments are feasible, i.e. a region can contain 0,1,…, to concentrators). Each possible assignment is assumed to represent a state of the stochastic variable structure automaton. To start with, all the states are assigned equal probabilities. At each stage of the search the automaton visits a state according to the current probability distribution. At each visit the automaton selects a 'point' inside that state with uniform probability. The cost associated with that point is calculated and the average cost of that state is updated. Then the probabilities of all the states are updated. The probabilities are taken to bo inversely proportional to the average cost of the states After a certain number of searches the search probabilities become stationary and the automaton visits a particular state again and again. Then the automaton is said to have converged to that state Then by conducting a local gradient search within that state the exact locations of the concentrators are determined This algorithm was applied to a set of test problems and the results were compared with those given by Cooper's (1964, 1967) EAC algorithm and on the average it was found that the proposed algorithm performs better.

Evolution of Social Behavior Through Interpopulation Selection

Under certain special conditions natural selection can be effective at the level of local populations, or demes. Such interpopulation selection will favor genotypes that reduce the probability of extinction of their parent population even at the cost of a lowered inclusive fitness. Such genotypes may be characterized by altruistic traits only in a viscous population, i.e., in a population in which neighbors tend to be closely related. In a non-viscous population the interpopulation selection will instead favor spiteful traits when the populations are susceptible to extinction through the overutilization of the habitat, and cooperative traits when it is the newly established populations that are in the greatest danger of extinction.

Cu2+-induced room temperature hydrogen release from ammonia borane

Mechanical stirring of ammonia borane with CuCl2 in the solid state resulted in the release of hydrogen at room temperature through the intermediacy of [NH4](+)[BCl4](-).

Numerical simulations of crack tip fields in polycrystalline plastic solids

In this paper, modes I and II crack tip fields in polycrystalline plastic solids are studied under plane strain, small scale yielding conditions. Two different initial textures of an Al–Mg alloy, viz., continuous cast AA5754 sheets in the recrystallized and cold rolled conditions, are considered. The former is nearly-isotropic, while the latter displays distinct anisotropy. Finite element simulations are performed by employing crystal plasticity constitutive equations along with a Taylor-type homogenization as well as by using the Hill quadratic yield theory. It is found that significant texture evolution occurs close to the notch tip which profoundly influences the stress and plastic strain distributions. Also, the cold rolling texture gives rise to higher magnitude of plastic strain near the tip.

Numerical simulations of crack tip fields in polycrystalline plastic solids

In this paper, modes I and II crack tip fields in polycrystalline plastic solids are studied under plane strain, small scale yielding conditions. Two different initial textures of an Al-Mg alloy, viz.,continuous cast AA5754 sheets in the recrystallized and cold rolled conditions, are considered. The former is nearly-isotropic, while the latter displays distinct anisotropy. Finite element simulations are performed by employing crystal plasticity constitutive equations along with a Taylor-type homogenization as well as by using the Hill quadratic yield theory. It is found that significant texture evolution occurs close to the notch tip which profoundly influences the stress and plastic strain distributions. Also, the cold rolling texture gives rise to higher magnitude of plastic strain near the tip. (C) 2010 Elsevier Ltd. All rights reserved.

An X-ray and neutron diffraction study of cation substituted TlSr2CuO5

The structures of TlSr(2−x)LaxCuO(5+δ), with x=0.5, 0.75 and 1, and Tl.5Pb0.5Sr2CuO(5+δ) have been examined with X-ray and neutron powder Rietveld refinement. They are isostructural (P4/mmm) with the corresponding thallium-barium cuprate having one Cu-O layer with Cu3+ ions in octahedral coordination with oxygen (structure type 1201). The influence of cation substitution and disorder on the structure and superconducting properties of these phases have been investigated. La3+ substitution for Sr2+ stabilises the structure and reduces Cu3+, permitting superconductivity, while Pb2+ substitution for Tl3+ only stabilises the structure, without reducing Cu3+.

Popular matchings with variable item copies

We consider the problem of matching people to items, where each person ranks a subset of items in an order of preference, possibly involving ties. There are several notions of optimality about how to best match a person to an item; in particular, popularity is a natural and appealing notion of optimality. A matching M* is popular if there is no matching M such that the number of people who prefer M to M* exceeds the number who prefer M* to M. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not admit popular matchings. This motivates the following extension of the popular matchings problem: Given a graph G = (A U 3, E) where A is the set of people and 2 is the set of items, and a list < c(1),...., c(vertical bar B vertical bar)> denoting upper bounds on the number of copies of each item, does there exist < x(1),...., x(vertical bar B vertical bar)> such that for each i, having x(i) copies of the i-th item, where 1 <= xi <= c(i), enables the resulting graph to admit a popular matching? In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c(i) is 1 or 2. We show a polynomial time algorithm for a variant of the above problem where the total increase in copies is bounded by an integer k. (C) 2011 Elsevier B.V. All rights reserved.

An approach to multi-temporal MODIS image analysis using image classification and segmentation

This paper discusses an approach for river mapping and flood evaluation based on multi-temporal time series analysis of satellite images utilizing pixel spectral information for image classification and region-based segmentation for extracting water-covered regions. Analysis of MODIS satellite images is applied in three stages: before flood, during flood and after flood. Water regions are extracted from the MODIS images using image classification (based on spectral information) and image segmentation (based on spatial information). Multi-temporal MODIS images from ``normal'' (non-flood) and flood time-periods are processed in two steps. In the first step, image classifiers such as Support Vector Machines (SVMs) and Artificial Neural Networks (ANNs) separate the image pixels into water and non-water groups based on their spectral features. The classified image is then segmented using spatial features of the water pixels to remove the misclassified water. From the results obtained, we evaluate the performance of the method and conclude that the use of image classification (SVM and ANN) and region-based image segmentation is an accurate and reliable approach for the extraction of water-covered regions. (c) 2012 COSPAR. Published by Elsevier Ltd. All rights reserved.