Lacunary Fourier series and a qualitative uncertainty principle for compact Lie groups

We define lacunary Fourier series on a compact connected semisimple Lie group G. If f is an element of L-1 (G) has lacunary Fourier series and f vanishes on a non empty open subset of G, then we prove that f vanishes identically. This result can be viewed as a qualitative uncertainty principle.

Thiol-ene Clickable Hyperscaffolds Bearing Peripheral Allyl Groups

Radical catalyzed thiol-ene reaction has become a useful alternative to the Huisgen-type click reaction as it helps to expand the variability in reaction conditions as well as the range of clickable entities. Thus, direct generation of hyper-branched polymers bearing peripheral allyl groups that could be clicked using a variety of functional thiols would be of immense value. A specifically designed AB(2) type monomer, that carries two allyl benzyl ethers groups and one alcohol functionality, was shown to undergo self-condensation under acid-catalyzed melt-transetherification to yield a hyperbranched polyether that carries numerous allyl end-groups. Importantly, it was shown that the kinetics of polymerization is not dramatically affected by the change of the ether unit from previously studied methyl benzyl ether to an allyl benzyl ether. The peripheral allyl groups were readily clicked quantitatively, using a variety of thiols, to generate an hydrocarbon-soluble octadecyl-derivative, amphiphilic systems using 2-mercaptoethanol and chiral amino acid (N-benzoyl cystine) derivatized hyperbranched structures; thus demonstrating the versatility of this novel class of clickable hyperscaffolds. (C) 2011 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 49:1735-1744, 2011

Social selection and the evolution of cooperative groups: The example of the cellular slime moulds

In social selection the phenotype of an individual depends on its own genotype as well as on the phenotypes, and so genotypes, of other individuals. This makes it impossible to associate an invariant phenotype with a genotype: the social context is crucial. Descriptions of metazoan development, which often is viewed as the acme of cooperative social behaviour, ignore or downplay this fact. The implicit justification for doing so is based on a group-selectionist point of view. Namely, embryos are clones, therefore all cells have the same evolutionary interest, and the visible differences between cells result from a common strategy. The reasoning is flawed, because phenotypic heterogeneity within groups can result from contingent choices made by cells from a flexible repertoire as in multicellular development. What makes that possible is phenotypic plasticity, namely the ability of a genotype to exhibit different phenotypes. However, co-operative social behaviour with division of labour requires that different phenotypes interact appropriately, not that they belong to the same genotype, or have overlapping genetic interests. We sketch a possible route to the evolution of social groups that involves many steps: (a) individuals that happen to be in spatial proximity benefit simply by virtue of their number; (b) traits that are already present act as preadaptations and improve the efficiency of the group; and (c) new adaptations evolve under selection in the social context-that is, via interactions between individuals-and further strengthen group behaviour. The Dictyostelid or cellular slime mould amoebae (CSMs) become multicellular in an unusual way, by the aggregation of free-living cells. In nature the resulting group can be genetically homogeneous (clonal) or heterogeneous (polyclonal); in either case its development, which displays strong cooperation between cells (to the extent of so-called altruism) is not affected. This makes the CSMs exemplars for the study of social behaviour.

Wet chemical syntheses of ultrafine multicomponent ceramic powders through gel to crystallite conversion

Coarse (BOn/2)-O-n+/xH(2)O (10splitting of the bridging groups like B-(OH)-B or B-O-B, leading to the breakdown of the gel into crystallites. G-C conversion has advantages as a method of synthesis of ceramics in terms of operational cost and procedural simplicity.

Novel geodesic splitting on paraboloid of revolution with applications to ray-theoretic analysis

Computer simulations have shown a novel geodesic splitting on the paraboloid of revolution leading to a multiplicity of surface ray paths. Such a phenomenon would have wide ramifications for wave propagation problems in general, besides applications in target-detection problems and the computational requirements of ray-theoretic formulations such as the UTD, in computing the antenna characteristics in the high-frequency domain.

KFVS (Kinetic Flux Vector Splitting) on moving grids for unsteady aerodynamics

Accurate numerical solutions to the problems in fluid-structure (aeroelasticity) interaction are becoming increasingly important in recent years. The methods based on FCD (Fixed Computational Domain) and ALE (Alternate Lagrangian Eulerian) to solve such problems suffer from numerical instability and loss of accuracy. They are not general and can not be extended to the flowsolvers on unstructured meshes. Also, global upwind schemes can not be used in ALE formulation thus leads to the development of flow solvers on moving grids. The KFVS method has been shown to be easily amenable on moving grids required in unsteady aerodynamics. The ability of KFMG (Kinetic Flux vector splitting on Moving Grid) Euler solver in capturing shocks, expansion waves with small and very large pressure ratios and contact discontinuities has been demonstrated.

Reaction of diisopropoxytitanium(III) tetrahydroborate with selected organic compounds containing representative functional groups

Diisopropoxytitanium(III) tetrahydroborate, ((PrO)-Pr-1)(2)TiBH4), generated in situ in dichloromethane from diisopropoxytitanium dichloride and benzyltriethylammonium borohydride in a 1:2 ratio selectively reduces aldehydes, ketones, acid chlorides, carboxylic acids, and N-Boc-protected amino acids to the corresponding alcohols in excellent yield under very mild reaction conditions (-78 to 25 degrees C).

Micellar structures of dimeric surfactants with phosphate head groups and wettable spacers: A small-angle neutron scattering study

Dimeric or gemini surfactants consist of two hydrophobic chains and two hydrophilic head groups covalently connected by a hydrophobic or hydrophilic spacer. This paper reports the small-angle neutron scattering (SANS) measurements from aqueous micellar solutions of two different recently developed types of dimeric surfactants: (i) bis-anionic C16H33PO4--(CH2)(m)-PO4-C16H33,2Na(+) dimeric surfactants composed of phosphate head groups and a hydrophobic polymethylene spacer, referred to as 16-m-16,2Na(+), for spacer lengths m = 2, 4, 6, and 10, (ii) bis-cationic C16H33N+(CH3)(2)-CH2-(CH2-O-CH2)(p)-CH2-N+ (CH3)(2)C16H33,2Br(-) dimeric surfactants composed of dimethylammonium head groups and a wettable polyethylene oxide spacer, referred to as 16-CH2-p-CH2-16,2Br(-), for spacer lengths p = 1 - 3. The micellar structures of these surfactants are compared with the earlier studied bis-cationic C16H33N+ (CH3)(2)-(CH2)(m)-N+ (CH3)(2)C16H33,2Br(-) dimeric surfactants composed of dimethylammonium head groups and a hydrophobic polymethylene spacer, referred to as 16-m-16,2Br(-). It is found that 16-m-16,2Na(+), similar to 16-m-16,2Br(-), form various micellar structures depending on the spacer length. Micelles an disklike for rn = 2, rodlike for m = 4, and prolate ellipsoidal fur m = 6 and 10. The micelles of 16-CH2-p-CH2-16,2Br(-) are prolate ellipsoidal for all the values of p = 1 - 3. It is also found that micelles of 16-m-16,2Na(+) and 16-CH2-p-CH2-16,2Br(-) are large in comparison to those of 16-in-16,2Br(-) for similar spacer lengths. This is connected with the fact that both in 16-m-16,2Na(+) and 16-CH2-p-CH2-16,2Br(-), the head group or the spacer is more hydrated as compared to that in the 16-m-16,2Br(-). An increase in the hydration of the spacer or the head group increases the screening of the Coulomb repulsion between the charged head groups. This effect has been found to be more pronounced in the dimeric surfactants having wettable spacers. [S1063-651X(99)00303-7].

Providing quality of service via opportunistic splitting using stochastic approximation

We consider the problem of wireless channel allocation to multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. Each metric sequence can be Markov. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Opportunistic splitting for scheduling via stochastic approximation

We consider the problem of scheduling a wireless channel among multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Nanotubes of the disulfides of groups 4 and 5 metals

The layered chalcogenides, having structures analogous to graphite, are known to be unstable toward bending and show high propensity to form curved structures, thus eliminating dangling bonds at the edges. Since the discovery of fullerene and nanotube structures of WS2 and MoS2 by Tenne et al. [1-3], there have been attempts to prepare and characterize nanotubes of other layered dichalcogenides with structures analogous to MoS2. Nanotubes of MoS2 and WS2 were prepared by Tenne et al. by reducing the corresponding oxides to the suboxides followed by heating in an atmosphere of forming gas (5 % H-2 + 95 % N-2) and H2S at 700-900 degreesC [1-3]. Alternative methods of synthesis of MoS2 and WS2 nanotubes have since been proposed by employing the decomposition of the ammonium thiometallates or the corresponding trisulfide precursors. This alternative procedure was based on the observation that the trisulfide seems to be formed as an intermediate in the synthesis of the MoS2 and WS2 nanotubes [4]. Accordingly, the decomposition of the trisulfides of MoS2 and W in a reducing atmosphere directly yielded nanotubes of the disulfides MoS2 and WS2 [5]. In this article, we describe the synthesis, structure, and characterization of a few novel nanotubes of the disulfides of groups 4 and 5 metals. These include nanotubes of NbS2, TaS2, ZrS2, and HfS2. The study enlarges the scope of the inorganic nanotubes significantly and promises other interesting possibilities, including the synthesis of the diselenide nanotubes of these metals.

Modified kinetic flux vector splitting (m-KFVS) method for compressible flows

To resolve many flow features accurately, like accurate capture of suction peak in subsonic flows and crisp shocks in flows with discontinuities, to minimise the loss in stagnation pressure in isentropic flows or even flow separation in viscous flows require an accurate and low dissipative numerical scheme. The first order kinetic flux vector splitting (KFVS) method has been found to be very robust but suffers from the problem of having much more numerical diffusion than required, resulting in inaccurate computation of the above flow features. However, numerical dissipation can be reduced by refining the grid or by using higher order kinetic schemes. In flows with strong shock waves, the higher order schemes require limiters, which reduce the local order of accuracy to first order, resulting in degradation of flow features in many cases. Further, these schemes require more points in the stencil and hence consume more computational time and memory. In this paper, we present a low dissipative modified KFVS (m-KFVS) method which leads to improved splitting of inviscid fluxes. The m-KFVS method captures the above flow features more accurately compared to first order KFVS and the results are comparable to second order accurate KFVS method, by still using the first order stencil. (C) 2011 Elsevier Ltd. All rights reserved.

Variants of Miyachi�s Theorem for Nilpotent lie Groups

We formulate and prove two versions of Miyachi�s theorem for connected, simply connected nilpotent Lie groups. This allows us to prove the sharpness of the constant 1/4 in the theorems of Hardy and of Cowling and Price for any nilpotent Lie group. These theorems are proved using a variant of Miyachi�s theorem for the group Fourier transform.

Variants Of Miyachi’S Theorem For Nilpotent Lie Groups

We formulate and prove two versions of Miyachi’s theorem for connected, simply connected nilpotent Lie groups. This allows us to prove the sharpness of the constant 1/4 in the theorems of Hardy and of Cowling and Price for any nilpotent Lie group. These theorems are proved using a variant of Miyachi’s theorem for the group Fourier transform.

Fast edge splitting and Edmonds' arborescence construction for unweighted graphs

Given an unweighted undirected or directed graph with n vertices, m edges and edge connectivity c, we present a new deterministic algorithm for edge splitting. Our algorithm splits-off any specified subset S of vertices satisfying standard conditions (even degree for the undirected case and in-degree ≥ out-degree for the directed case) while maintaining connectivity c for vertices outside S in Õ(m+nc2) time for an undirected graph and Õ(mc) time for a directed graph. This improves the current best deterministic time bounds due to Gabow [8], who splits-off a single vertex in Õ(nc2+m) time for an undirected graph and Õ(mc) time for a directed graph. Further, for appropriate ranges of n, c, |S| it improves the current best randomized bounds due to Benczúr and Karger [2], who split-off a single vertex in an undirected graph in Õ(n2) Monte Carlo time. We give two applications of our edge splitting algorithms. Our first application is a sub-quadratic (in n) algorithm to construct Edmonds' arborescences. A classical result of Edmonds [5] shows that an unweighted directed graph with c edge-disjoint paths from any particular vertex r to every other vertex has exactly c edge-disjoint arborescences rooted at r. For a c edge connected unweighted undirected graph, the same theorem holds on the digraph obtained by replacing each undirected edge by two directed edges, one in each direction. The current fastest construction of these arborescences by Gabow [7] takes Õ(n2c2) time. Our algorithm takes Õ(nc3+m) time for the undirected case and Õ(nc4+mc) time for the directed case. The second application of our splitting algorithm is a new Steiner edge connectivity algorithm for undirected graphs which matches the best known bound of Õ(nc2 + m) time due to Bhalgat et al [3]. Finally, our algorithm can also be viewed as an alternative proof for existential edge splitting theorems due to Lovász [9] and Mader [11].