Oxidative DNA cleavage, cytotoxicity and antimicrobial studies of L-ornithine copper (II) complexes

New ternary copper (II) complexes, Cu(L-orn)(B)(Cl)](Cl center dot 2H(2)O) (1-2) where L-orn is L-ornithine, B is an N,N-donor heterocyclic base, viz. 2,2'-bipyridine (bpy, 1) and 1,10-phenanthroline (phen, 2), were synthesized and characterized by various spectroscopic techniques. Complex 2 is characterized by the X-ray single crystallographic method. The complex shows a distorted square-pyramidal (4 + 1) CuN3OCl coordination sphere. Binding interactions of the complexes with calf thymus DNA (CT-DNA) were investigated by UV-Vis absorption titration, ethidium bromide displacement assay, viscometric titration experiment and DNA melting studies. Complex 2 shows appreciable chemical nuclease activity in the presence of 3-mercaptopropionic acid (MPA). The complexes were subjected to in vitro cytotoxicity studies against carcinomic human alveolar basal epithelial cells (A-549) and human epithelial (HEp-2) cells. The IC50 values of 1 and 2 are less than that of cisplatin against HEp-2 cell lines. MIC values for 1 against the bacterial strains Streptococcus mutans and Pseudomonas aeruginosa are 0.5 mM. (C) 2012 Elsevier Ltd. All rights reserved.

Bubble size measurement and error analysis in a gas liquid ejector

Bubble size in a gas liquid ejector has been measured using the image technique and analysed for estimation of Sauter mean diameter. The individual bubble diameter is estimated by considering the two dimensional contour of the ellipse, for the actual three dimensional ellipsoid in the system by equating the volume of the ellipsoid to that of the sphere. It is observed that the bubbles are of oblate and prolate shaped ellipsoid in this air water system. The bubble diameter is calculated based on this concept and the Sauter mean diameter is estimated. The error between these considerations is reported. The bubble size at different locations from the nozzle of the ejector is presented along with their percentage error which is around 18%.

Fast Likelihood Computation in Speech Recognition using Matrices

Acoustic modeling using mixtures of multivariate Gaussians is the prevalent approach for many speech processing problems. Computing likelihoods against a large set of Gaussians is required as a part of many speech processing systems and it is the computationally dominant phase for Large Vocabulary Continuous Speech Recognition (LVCSR) systems. We express the likelihood computation as a multiplication of matrices representing augmented feature vectors and Gaussian parameters. The computational gain of this approach over traditional methods is by exploiting the structure of these matrices and efficient implementation of their multiplication. In particular, we explore direct low-rank approximation of the Gaussian parameter matrix and indirect derivation of low-rank factors of the Gaussian parameter matrix by optimum approximation of the likelihood matrix. We show that both the methods lead to similar speedups but the latter leads to far lesser impact on the recognition accuracy. Experiments on 1,138 work vocabulary RM1 task and 6,224 word vocabulary TIMIT task using Sphinx 3.7 system show that, for a typical case the matrix multiplication based approach leads to overall speedup of 46 % on RM1 task and 115 % for TIMIT task. Our low-rank approximation methods provide a way for trading off recognition accuracy for a further increase in computational performance extending overall speedups up to 61 % for RM1 and 119 % for TIMIT for an increase of word error rate (WER) from 3.2 to 3.5 % for RM1 and for no increase in WER for TIMIT. We also express pairwise Euclidean distance computation phase in Dynamic Time Warping (DTW) in terms of matrix multiplication leading to saving of approximately of computational operations. In our experiments using efficient implementation of matrix multiplication, this leads to a speedup of 5.6 in computing the pairwise Euclidean distances and overall speedup up to 3.25 for DTW.

An Adaptive Conditional Zero-Forcing Decoder With Full-Diversity, Least Complexity and Essentially-ML Performance for STBCs

A low complexity, essentially-ML decoding technique for the Golden code and the three antenna Perfect code was introduced by Sirianunpiboon, Howard and Calderbank. Though no theoretical analysis of the decoder was given, the simulations showed that this decoding technique has almost maximum-likelihood (ML) performance. Inspired by this technique, in this paper we introduce two new low complexity decoders for Space-Time Block Codes (STBCs)-the Adaptive Conditional Zero-Forcing (ACZF) decoder and the ACZF decoder with successive interference cancellation (ACZF-SIC), which include as a special case the decoding technique of Sirianunpiboon et al. We show that both ACZF and ACZF-SIC decoders are capable of achieving full-diversity, and we give a set of sufficient conditions for an STBC to give full-diversity with these decoders. We then show that the Golden code, the three and four antenna Perfect codes, the three antenna Threaded Algebraic Space-Time code and the four antenna rate 2 code of Srinath and Rajan are all full-diversity ACZF/ACZF-SIC decodable with complexity strictly less than that of their ML decoders. Simulations show that the proposed decoding method performs identical to ML decoding for all these five codes. These STBCs along with the proposed decoding algorithm have the least decoding complexity and best error performance among all known codes for transmit antennas. We further provide a lower bound on the complexity of full-diversity ACZF/ACZF-SIC decoding. All the five codes listed above achieve this lower bound and hence are optimal in terms of minimizing the ACZF/ACZF-SIC decoding complexity. Both ACZF and ACZF-SIC decoders are amenable to sphere decoding implementation.

Mapping joint ROM on a cube using electromagnetic trackers

This paper presents a unified framework using the unit cube for measurement, representation and usage of the range of motion (ROM) of body joints with multiple degrees of freedom (d.o.f) to be used for digital human models (DHM). Traditional goniometry needs skill and kn owledge; it is intrusive and has limited applicability for multi-d.o.f. joints. Measurements using motion capture systems often involve complicated mathematics which itself need validation. In this paper we use change of orientation as the measure of rotation; this definition does not require the identification of any fixed axis of rotation. A two-d.o.f. joint ROM can be represented as a Gaussian map. Spherical polygon representation of ROM, though popular, remains inaccurate, vulnerable due to singularities on parametric sphere and difficult to use for point classification. The unit cube representation overcomes these difficulties. In the work presented here, electromagnetic trackers have been effectively used for measuring the relative orientation of a body segment of interest with respect to another body segment. The orientation is then mapped on a surface gridded cube. As the body segment is moved, the grid cells visited are identified and visualized. Using the visual display as a feedback, the subject is instructed to cover as many grid cells as he can. In this way we get a connected patch of contiguous grid cells. The boundary of this patch represents the active ROM of the concerned joint. The tracker data is converted into the motion of a direction aligned with the axis of the segment and a rotation about this axis later on. The direction identifies the grid cells on the cube and rotation about the axis is represented as a range and visualized using color codes. Thus the present methodology provides a simple, intuitive and accura te determination and representation of up to 3 d.o.f. joints. Basic results are presented for the shoulder. The measurement scheme to be used for wrist and neck, and approach for estimation of the statistical distribution of ROM for a given population are also discussed.

Experiments on thermal response of low aspect ratio packed beds at high Reynolds numbers with varying inflow temperature

An experimental study for transient temperature response of low aspect ratio packed beds at high Reynolds numbers for a free stream with varying inlet temperature is presented. The packed bed is used as a compact heat exchanger along with a solid propellant gas-generator, to generate room temperature gases for use in applications such as control actuation and air bottle pressurization. Packed beds of lengths similar to 200 mm and 300 mm were characterized for packing diameter based Reynolds numbers, Re-d ranging from 0.6 x 10(4) to 8.5 x 10(4). The solid packing used in the bed consisted of circle divide 9.5 mm and circle divide 5 mm steel spheres with suitable arrangements to eliminate flow entrance and exit effects. The ratios of packed bed diameter to packing diameter for 9.5 mm and 5 mm sphere packing were similar to 9.5 and 18 respectively, with the average packed bed porosities around 0.4. Gas temperatures were measured at the entry, exit and at three axial locations along centre-line in the packed beds. The solid packing temperature was measured at three axial locations in the packed bed. An average Nusselt number correlation of the form Nu(d) = 3.91Re(d)(05) for Re-d range of 10(4) is proposed. For engineering applications of packed beds such as pebble bed heaters, thermal storage systems, and compact heat exchangers a simple procedure is suggested for calculating unsteady gas temperature at packed bed exit for packing Biot number Bi-d < 0.1. (C) 2012 Elsevier Inc. All rights reserved.

Antenna selection in spatial modulation systems

Novel transmit antenna selection techniques are conceived for Spatial Modulation (SM) systems and their symbol error rate (SER) performance is investigated. Specifically, low-complexity Euclidean Distance optimized Antenna Selection (EDAS) and Capacity Optimized Antenna Selection (COAS) are studied. It is observed that the COAS scheme gives a better SER performance than the EDAS scheme. We show that the proposed antenna selection based SM systems are capable of attaining a significant gain in signal-to-noise ratio (SNR) compared to conventional SM systems, and also outperform the conventional MIMO systems employing antenna selection at both low and medium SNRs.

Adaptive constellation rotation scheme for two-user fading MAC with quantized fade state feedback

With no Channel State Information (CSI) at the users, transmission over the two-user Gaussian Multiple Access Channel with fading and finite constellation at the input, will have high error rates due to multiple access interference (MAI). However, perfect CSI at the users is an unrealistic assumption in the wireless scenario, as it would involve extremely large feedback overheads. In this paper we propose a scheme which removes the adverse effect of MAI using only quantized knowledge of fade state at the transmitters such that the associated overhead is nominal. One of the users rotates its constellation relative to the other without varying the transmit power to adapt to the existing channel conditions, in order to meet certain predetermined minimum Euclidean distance requirement in the equivalent constellation at the destination. The optimal rotation scheme is described for the case when both the users use symmetric M-PSK constellations at the input, where M = 2(gimel), gimel being a positive integer. The strategy is illustrated by considering the example where both the users use QPSK signal sets at the input. The case when the users use PSK constellations of different sizes is also considered. It is shown that the proposed scheme has considerable better error performance compared to the conventional non-adaptive scheme, at the cost of a feedback overhead of just log log(2) (M-2/8 - M/4 + 2)] + 1 bits, for the M-PSK case.

Linearization of Drucker-Prager yield criterion for axisymmetric problems: implementation in lower-bound limit analysis

The linearization of the Drucker-Prager yield criterion associated with an axisymmetric problem has been achieved by simulating a sphere with the truncated icosahedron with 32 faces and 60 vertices. On this basis, a numerical formulation has been proposed for solving an axisymmetric stability problem with the usage of the lower-bound limit analysis, finite elements, and linear optimization. To compare the results, the linearization of the Mohr-Coulomb yield criterion, by replacing the three cones with interior polyhedron, as proposed earlier by Pastor and Turgeman for an axisymmetric problem, has also been implemented. The two formulations have been applied for determining the collapse loads for a circular footing resting on a cohesive-friction material with nonzero unit weight. The computational results are found to be quite convincing. (C) 2013 American Society of Civil Engineers.

Free energy barriers for homogeneous crystal nucleation in a eutectic system of binary hard spheres

In this study, the free energy barriers for homogeneous crystal nucleation in a system that exhibits a eutectic point are computed using Monte Carlo simulations. The system studied is a binary hard sphere mixture with a diameter ratio of 0.85 between the smaller and larger hard spheres. The simulations of crystal nucleation are performed for the entire range of fluid compositions. The free energy barrier is found to be the highest near the eutectic point and is nearly five times that for the pure fluid, which slows down the nucleation rate by a factor of 10(-31). These free energy barriers are some of highest ever computed using simulations. For most of the conditions studied, the composition of the critical nucleus corresponds to either one of the two thermodynamically stable solid phases. However, near the eutectic point, the nucleation barrier is lowest for the formation of the metastable random hexagonal closed packed (rhcp) solid phase with composition lying in the two-phase region of the phase diagram. The fluid to solid phase transition is hypothesized to proceed via formation of a metastable rhcp phase followed by a phase separation into respective stable fcc solid phases.

On the SIG-dimension of trees under the L (a)-metric

Let where be a set of points in d-dimensional space with a given metric rho. For a point let r (p) be the distance of p with respect to rho from its nearest neighbor in Let B(p,r (p) ) be the open ball with respect to rho centered at p and having the radius r (p) . We define the sphere-of-influence graph (SIG) of as the intersection graph of the family of sets Given a graph G, a set of points in d-dimensional space with the metric rho is called a d-dimensional SIG-representation of G, if G is isomorphic to the SIG of It is known that the absence of isolated vertices is a necessary and sufficient condition for a graph to have a SIG-representation under the L (a)-metric in some space of finite dimension. The SIG-dimension under the L (a)-metric of a graph G without isolated vertices is defined to be the minimum positive integer d such that G has a d-dimensional SIG-representation under the L (a)-metric. It is denoted by SIG (a)(G). We study the SIG-dimension of trees under the L (a)-metric and almost completely answer an open problem posed by Michael and Quint (Discrete Appl Math 127:447-460, 2003). Let T be a tree with at least two vertices. For each let leaf-degree(v) denote the number of neighbors of v that are leaves. We define the maximum leaf-degree as leaf-degree(x). Let leaf-degree{(v) = alpha}. If |S| = 1, we define beta(T) = alpha(T) - 1. Otherwise define beta(T) = alpha(T). We show that for a tree where beta = beta (T), provided beta is not of the form 2 (k) - 1, for some positive integer k a parts per thousand yen 1. If beta = 2 (k) - 1, then We show that both values are possible.

Data Fusion of Dual Foot-Mounted INS to Reduce the Systematic Heading Drift

In this report, we investigate the problem of applying a range constraint in order to reduce the systematic heading drift in a foot-mounted inertial navigation system (INS) (motion-tracking). We make use of two foot-mounted INS, one on each foot, which are aided with zero-velocity detectors. A novel algorithm is proposed in order to reduce the systematic heading drift. The proposed algorithm is based on the idea that the separation between the two feet at any given instance must always lie within a sphere of radius equal to the maximum possible spatial separation between the two feet. A Kalman filter, getting one measurement update and two observation updates is used in this algorithm.

Monopoles on S-F(2) from the fuzzy conifold

The intersection of the conifold z(1)(2) + z(2)(2) + z(3)(2) = 0 and S-5 is a compact 3-dimensional manifold X-3. We review the description of X-3 as a principal U(1) bundle over S-2 and construct the associated monopole line bundles. These monopoles can have only even integers as their charge. We also show the Kaluza-Klein reduction of X-3 to S-2 provides an easy construction of these monopoles. Using the analogue of the Jordan-Schwinger map, our techniques are readily adapted to give the fuzzy version of the fibration X-3 -> S-2 and the associated line bundles. This is an alternative new realization of the fuzzy sphere S-F(2) and monopoles OH it.

Entanglement entropy in higher derivative holography

We consider holographic entanglement entropy in higher derivative gravity theories. Recently Lewkowycz and Maldacena 1] have provided a method to derive the equations for the entangling surface from first principles. We use this method to compute the entangling surface in four derivative gravity. Certain interesting differences compared to the two derivative case are pointed out. For Gauss-Bonnet gravity, we show that in the regime where this method is applicable, the resulting equations coincide with proposals in the literature as well as with what follows from considerations of the stress tensor on the entangling surface. Finally we demonstrate that the area functional in Gauss-Bonnet holography arises as a counterterm needed to make the Euclidean action free of power law divergences.

Condition R and proper holomorphic maps between equidimensional product domains

We consider proper holomorphic mappings of equidimensional pseudoconvex domains in complex Euclidean space, where both source and target can be represented as Cartesian products of smoothly bounded domains. It is shown that such mappings extend smoothly up to the closures of the domains, provided each factor of the source satisfies Condition R. It also shown that the number of smoothly bounded factors in the source and target must be the same, and the proper holomorphic map splits as a product of proper mappings between the factor domains. (C) 2013 Elsevier Inc. All rights reserved.