Synthesis of Novel Oxide Pyrochlores, A2BB?O7 (A = La, Nd; BB? = Pb, Sn, Bi), by Alkali Melt Route

Oxide pyrochlores of the formula A2BB? O7 (A = La, Nd; BB? = Pb, Sn, Bi) have been synthesized by a low-temperature ambient-pressure route employing KOH melts. All the compositions, including La2Bi2O7 and its strontium-substituted derivatives, La2-xSrxBi2O7-?, are deeply colored insulators, confirming that a metallic ground state is not achieved for Pb(IV) and Bi(IV/V) oxides with the pyrochlore structure.

S-nets: A Petri net based model for performance evaluation of real-time scheduling algorithms

A new class of nets, called S-nets, is introduced for the performance analysis of scheduling algorithms used in real-time systems Deterministic timed Petri nets do not adequately model the scheduling of resources encountered in real-time systems, and need to be augmented with resource places and signal places, and a scheduler block, to facilitate the modeling of scheduling algorithms. The tokens are colored, and the transition firing rules are suitably modified. Further, the concept of transition folding is used, to get intuitively simple models of multiframe real-time systems. Two generic performance measures, called �load index� and �balance index,� which characterize the resource utilization and the uniformity of workload distribution, respectively, are defined. The utility of S-nets for evaluating heuristic-based scheduling schemes is illustrated by considering three heuristics for real-time scheduling. S-nets are useful in tuning the hardware configuration and the underlying scheduling policy, so that the system utilization is maximized, and the workload distribution among the computing resources is balanced.

Study of the reactions of pyridinium poly(hydrogen fluoride) with some ternary oxides

The products of the reaction of pyridinium poly(hydrogen fluoride), PPHF, with KIO3, Na2SnO3, NaBiO3, K2CrO4, Na2MoO4 and Na2WO4 were KIO2F2; Na2SnF6; NaHF2, BiF3; K3CrF6, KHF2, (PyH)(3)CrF6; NaHF2, (PyH)(2)MoO2F4.2NaHF(2); and (PyH)(2)WO2F4.2NaHF(2), respectively, while KClO3, KBrO3 and KlO(4) react with complete decomposition to form KHF2 as the fluorinated product. This differential reactivity and mode of reaction has been discussed in terms of the oxidation state of the central atom, the nature and strength of the bonds and the complex behaviour of the formed intermediate or fluorinated products that undergo complexation or solvation with pyridine and/or hydrogen fluoride.

Direction of arrival estimation in the presence of distributed noise sources: Cumulant based approach

In the past few years there have been attempts to develop subspace methods for DoA (direction of arrival) estimation using a fourth?order cumulant which is known to de?emphasize Gaussian background noise. To gauge the relative performance of the cumulant MUSIC (MUltiple SIgnal Classification) (c?MUSIC) and the standard MUSIC, based on the covariance function, an extensive numerical study has been carried out, where a narrow?band signal source has been considered and Gaussian noise sources, which produce a spatially correlated background noise, have been distributed. These simulations indicate that, even though the cumulant approach is capable of de?emphasizing the Gaussian noise, both bias and variance of the DoA estimates are higher than those for MUSIC. To achieve comparable results the cumulant approach requires much larger data, three to ten times that for MUSIC, depending upon the number of sources and how close they are. This is attributed to the fact that in the estimation of the cumulant, an average of a product of four random variables is needed to make an evaluation. Therefore, compared to those in the evaluation of the covariance function, there are more cross terms which do not go to zero unless the data length is very large. It is felt that these cross terms contribute to the large bias and variance observed in c?MUSIC. However, the ability to de?emphasize Gaussian noise, white or colored, is of great significance since the standard MUSIC fails when there is colored background noise. Through simulation it is shown that c?MUSIC does yield good results, but only at the cost of more data.

Perfluoroalkyl bile esters: a new class of efficient gelators of organic and aqueous-organic media

A new class of fluorinated gelators derived from bile acids is reported. Perfluoroalkyl chains were attached to the bile acids through two different ester linkages and were synthesized following simple transformations. The gelation property of these derivatives is a function of the bile acid moiety, the spacer and the fluoroalkyl chain length. By varying these parameters, gels were obtained in aromatic hydrocarbons, DMSO and DMSO/DMF-H(2)O mixtures of different proportions. Several derivatives of deoxycholic and lithocholic acids were found to be efficient organogelators, while the reported bile-acid based organogelators are mostly derived from the cholic acid moiety. The efficient gelators among these compounds formed gels well below 1.0% (w/v) and hence they can be termed as supergelators. The mechanical properties of these gels could be modulated by changing either the bile acid moiety or by varying the length of the fluoroalkyl segment. The presence of CO(2)-philic perfluoroalkyl groups is also expected to enhance their solubility in supercritical CO(2) and hence these compounds are promising candidates for making aerogels.

Perfluoroalkyl bile esters: a new class of efficient gelators of organic and aqueous-organic media

A new class of fluorinated gelators derived from bile acids is reported. Perfluoroalkyl chains were attached to the bile acids through two different ester linkages and were synthesized following simple transformations. The gelation property of these derivatives is a function of the bile acid moiety, the spacer and the fluoroalkyl chain length. By varying these parameters, gels were obtained in aromatic hydrocarbons, DMSO and DMSO/DMF-H(2)O mixtures of different proportions. Several derivatives of deoxycholic and lithocholic acids were found to be efficient organogelators, while the reported bile-acid based organogelators are mostly derived from the cholic acid moiety. The efficient gelators among these compounds formed gels well below 1.0% (w/v) and hence they can be termed as supergelators. The mechanical properties of these gels could be modulated by changing either the bile acid moiety or by varying the length of the fluoroalkyl segment. The presence of CO(2)-philic perfluoroalkyl groups is also expected to enhance their solubility in supercritical CO(2) and hence these compounds are promising candidates for making aerogels.

Rainbow Connection Number and Connectivity

The rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one path in which no two edges are colored the same. Our main result is that rc(G) <= inverted right perpendicularn/2inverted left perpendicular for any 2-connected graph with at least three vertices. We conjecture that rc(G) <= n/kappa + C for a kappa-connected graph G of order n, where C is a constant, and prove the conjecture for certain classes of graphs. We also prove that rc(G) < (2 + epsilon)n/kappa + 23/epsilon(2) for any epsilon > 0.

Evaluation of the role of disordered organic fluorine in crystal packing: insights from halogen substituted benzanilides

The determination of the crystal and molecular structures of a large number of compounds containing the C(sp(2))-F bond has been investigated in detail in halogenated benzanilides and also in liquids, namely the fluorinated amines. It has been observed that when the fluorine atom is present in the ortho or meta position with respect to the amide functionality in benzanilides or the amino group in fluorinated amines which are liquids at room temperature, the fluorine atom exhibits positional disorder. This is associated with changes in patterns of intermolecular interactions which affect crystal packing. Furthermore, the presence of a fluorine atom on the benzanilide framework, in the presence of a heavier halogen (chloro, bromo and iodo), meta or ortho to the amide group does not eliminate the disorder associated with these molecules. In this article, we highlight the salient features present in halogenated compounds exhibiting disorder in the position of organic fluorine with concomitant changes in crystal packing. This feature is also compared with related compounds exhibiting similarity in electronic features, namely positional disorder.

DMT of Multihop Networks: End Points and Computational Tools

In this paper, the diversity-multiplexing gain tradeoff (DMT) of single-source, single-sink (ss-ss), multihop relay networks having slow-fading links is studied. In particular, the two end-points of the DMT of ss-ss full-duplex networks are determined, by showing that the maximum achievable diversity gain is equal to the min-cut and that the maximum multiplexing gain is equal to the min-cut rank, the latter by using an operational connection to a deterministic network. Also included in the paper, are several results that aid in the computation of the DMT of networks operating under amplify-and-forward (AF) protocols. In particular, it is shown that the colored noise encountered in amplify-and-forward protocols can be treated as white for the purpose of DMT computation, lower bounds on the DMT of lower-triangular channel matrices are derived and the DMT of parallel MIMO channels is computed. All protocols appearing in the paper are explicit and rely only upon AF relaying. Half-duplex networks and explicit coding schemes are studied in a companion paper.

Synthesis, Structure, and Magnetic Properties of a New Eight-Connected Metal-Organic Framework (MOF) based on Co-4 Clusters

A hydrothermal reaction of cobalt nitrate, 4,4'-oxybis(benzoic acid) (OBA), 1,2,4-triazole, and NaOH gave rise to a deep purple colored compound Co-4(triazolate)(2)(OBA)(3)], I, possessing Co-4 clusters. The Co-4 clusters are connected together through the tirazolate moieties forming a two-dimensional layer that closely resembles the TiS2 layer. The layers are pillared by the OBA units forming the three-dimensional structure. To the best of our knowledge, this is the first observation of a pillared TiS2 layer in a metal-organic framework compound. Magnetic studies in the temperature range 1.8-300 K indicate strong antiferromagetic interactions for Co-4 clusters. The structure as well as the magnetic behavior of the present compound has been compared with the previously reported related compound Co-2(mu 3-OH)(mu(2)-H2O)(pyrazine)(OBA)(OBAH)] prepared using pyrazine as the linker between the Co-4 clusters.

The force distribution function of an oscillator model of polymer stretching at constant velocity

Recent simulations of the stretching of tethered biopolymers at a constant speed v (Ponmurugan and Vemparala, 2011 Phys. Rev. E 84 060101(R)) have suggested that for any time t, the distribution of the fluctuating forces f responsible for chain deformation is governed by a relation of the form P(+ f)/ P(- f) = expgamma f], gamma being a coefficient that is solely a function of v and the temperature T. This result, which is reminiscent of the fluctuation theorems applicable to stochastic trajectories involving thermodynamic variables, is derived in this paper from an analytical calculation based on a generalization of Mazonka and Jarzynski's classic model of dragged particle dynamics Mazonka and Jarzynski, 1999 arXiv:cond-\textbackslashmat/9912121v1]. However, the analytical calculations suggest that the result holds only if t >> 1 and the force fluctuations are driven by white rather than colored noise; they further suggest that the coefficient gamma in the purported theorem varies not as v(0.15)T-(0.7), as indicated by the simulations, but as vT(-1).

Conflict-Free Coloring for Rectangle Ranges Using O(n.382) Colors

Given a set of points P ⊆ R2, a conflict-free coloring of P w.r.t. rectangle ranges is an assignment of colors to points of P, such that each nonempty axisparallel rectangle T in the plane contains a point whose color is distinct from all other points in P ∩ T . This notion has been the subject of recent interest and is motivated by frequency assignment in wireless cellular networks: one naturally would like to minimize the number of frequencies (colors) assigned to base stations (points) such that within any range (for instance, rectangle), there is no interference. We show that any set of n points in R2 can be conflict-free colored with O(nβ∗+o(1)) colors in expected polynomial time, where β∗ = 3−√5 2 < 0.382.

Confinement and viscoelastic effects on chain closure dynamics

Chemical reactions inside cells are typically subject to the effects both of the cell's confining surfaces and of the viscoelastic behavior of its contents. In this paper, we show how the outcome of one particular reaction of relevance to cellular biochemistry - the diffusion-limited cyclization of long chain polymers - is influenced by such confinement and crowding effects. More specifically, starting from the Rouse model of polymer dynamics, and invoking the Wilemski-Fixman approximation, we determine the scaling relationship between the mean closure time t(c) of a flexible chain (no excluded volume or hydrodynamic interactions) and the length N of its contour under the following separate conditions: (a) confinement of the chain to a sphere of radius d and (b) modulation of its dynamics by colored Gaussian noise. Among other results, we find that in case (a) when d is much smaller than the size of the chain, t(c) similar to Nd-2, and that in case (b), t(c) similar to N-2/(2 (2H)), H being a number between 1/2 and 1 that characterizes the decay of the noise correlations. H is not known a priori, but values of about 0.7 have been used in the successful characterization of protein conformational dynamics. At this value of H (selected for purposes of illustration), t(c) similar to N-3.4, the high scaling exponent reflecting the slow relaxation of the chain in a viscoelastic medium. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4729041]

Rainbow connection number and connected dominating sets

The rainbow connection number of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on n vertices with minimum degree delta, the rainbow connection number is upper bounded by 3n/(delta + 1) + 3. This solves an open problem from Schiermeyer (Combinatorial Algorithms, Springer, Berlin/Hiedelberg, 2009, pp. 432437), improving the previously best known bound of 20n/delta (J Graph Theory 63 (2010), 185191). This bound is tight up to additive factors by a construction mentioned in Caro et al. (Electr J Combin 15(R57) (2008), 1). As an intermediate step we obtain an upper bound of 3n/(delta + 1) - 2 on the size of a connected two-step dominating set in a connected graph of order n and minimum degree d. This bound is tight up to an additive constant of 2. This result may be of independent interest. We also show that for every connected graph G with minimum degree at least 2, the rainbow connection number, rc(G), is upper bounded by Gc(G) + 2, where Gc(G) is the connected domination number of G. Bounds of the form diameter(G)?rc(G)?diameter(G) + c, 1?c?4, for many special graph classes follow as easy corollaries from this result. This includes interval graphs, asteroidal triple-free graphs, circular arc graphs, threshold graphs, and chain graphs all with minimum degree delta at least 2 and connected. We also show that every bridge-less chordal graph G has rc(G)?3.radius(G). In most of these cases, we also demonstrate the tightness of the bounds.

Rainbow connectivity: hardness and tractability

A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of colors required to edge color the graph such that G is (strongly) rainbow connected. In this paper we study the rainbow connectivity problem and the strong rainbow connectivity problem from a computational point of view. Our main results can be summarised as below: 1) For every fixed k >= 3, it is NP-Complete to decide whether src(G) <= k even when the graph G is bipartite. 2) For every fixed odd k >= 3, it is NP-Complete to decide whether rc(G) <= k. This resolves one of the open problems posed by Chakraborty et al. (J. Comb. Opt., 2011) where they prove the hardness for the even case. 3) The following problem is fixed parameter tractable: Given a graph G, determine the maximum number of pairs of vertices that can be rainbow connected using two colors. 4) For a directed graph G, it is NP-Complete to decide whether rc(G) <= 2.