Quantum entropic ambiguities: Ethylene

In a quantum system, there may be many density matrices associated with a state on an algebra of observables. For each density matrix, one can compute its entropy. These are, in general, different. Therefore, one reaches the remarkable possibility that there may be many entropies for a given state R. Sorkin (private communication)]. This ambiguity in entropy can often be traced to a gauge symmetry emergent from the nontrivial topological character of the configuration space of the underlying system. It can also happen in finite-dimensional matrix models. In the present work, we discuss this entropy ambiguity and its consequences for an ethylene molecule. This is a very simple and well-known system, where these notions can be put to tests. Of particular interest in this discussion is the fact that the change of the density matrix with the corresponding entropy increase drives the system towards the maximally disordered state with maximum entropy, where Boltzman's formula applies. Besides its intrinsic conceptual interest, the simplicity of this model can serve as an introduction to a similar discussion of systems such as colored monopoles and the breaking of color symmetry.

A Novel Anticancer Agent, 8-Methoxypyrimido4 `,5 `: 4,5]thieno(2,3-b) Quinoline-4(3H)-One Induces Neuro 2a Neuroblastoma Cell Death through p53-Dependent, Caspase-Dependent and Independent Apoptotic Pathways

Neuroblastoma is the most common cancer in infants and fourth most common cancer in children. Despite recent advances in cancer treatments, the prognosis of stage-IV neuroblastoma patients continues to be dismal which warrant new pharmacotherapy. A novel tetracyclic condensed quinoline compound, 8-methoxypyrimido 4 `,5 `: 4,5] thieno(2,3-b) quinoline-4(3H)-one (MPTQ) is a structural analogue of an anticancer drug ellipticine and has been reported to posses anticancer property. Study on MPTQ on neuroblastoma cells is very limited and mechanisms related to its cytotoxicity on neuroblastoma cells are completely unknown. Here, we evaluated the anticancer property of MPTQ on mouse neuro 2a and human SH-SY5Y neuroblastoma cells and investigated the mechanisms underlying MPTQ-mediated neuro 2a cell death. MPTQ-mediated neuro 2a and SH-SY5Y cell deaths were found to be dose and time dependent. Moreover, MPTQ induced cell death reached approximately 99.8% and 90% in neuro 2a and SH-SY5Y cells respectively. Nuclear oligonucleosomal DNA fragmentation and Terminal dUTP Nick End Labelling assays indicated MPTQ-mediated neuro 2a cell death involved apoptosis. MPTQ-mediated apoptosis is associated with increased phosphorylation of p53 at Ser15 and Ser20 which correlates with the hyperphosphorylation of Ataxia-Telangiectasia mutated protein (ATM). Immunocytochemical analysis demonstrated the increased level of Bax protein in MPTQ treated neuro 2a cells. MPTQ-mediated apoptosis is also associated with increased activation of caspase-9, -3 and -7 but not caspase-2 and -8. Furthermore, increased level of caspase-3 and cleaved Poly ( ADP Ribose) polymerase were observed in the nucleus of MPTQ treated neuro 2a cells, suggesting the involvement of caspase-dependent intrinsic but not extrinsic apoptotic pathway. Increased nuclear translocation of apoptosis inducing factor suggests additional involvement of caspase-independent apoptosis pathway in MPTQ treated neuro 2a cells. Collectively, MPTQ-induced neuro 2a cell death is mediated by ATM and p53 activation, and Bax-mediated activation of caspase-dependent and caspase-independent mitochondrial apoptosis pathways.

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.

Wireless Network Coding for MIMO Two-Way Relaying

The design of modulation schemes for the physical layer network-coded two-way MIMO relaying scenario is considered, with the denoise-and-forward protocol which employs two phases: Multiple Access phase and Broadcast phase. It is shown that for MIMO two-way relaying, the minimum distance of the effective constellation at the relay becomes zero when all the rows of the channel fade coefficient matrix belong to a finite number of vector subspaces referred to as the singular fade subspaces. The singular fade subspaces can be classified into two kinds based on whether their harmful effects can be removed or not: (i) the removable and (ii) the non-removable singular fade subspaces. It is shown that network coding maps obtained by the completion of appropriate partially filled Latin Rectangles can remove the harmful effects of all the removable singular fade subspaces. For 2(lambda)-PSK signal set, the removable and non-removable singular fade subspaces are characterized and, it is shown that the number of non-removable singular fade subspaces is a small fraction of the total number of singular fade subspaces and this fraction tends to zero as the constellation size tends to infinity. The Latin Rectangles for the case when the end nodes use different number of antennas are shown to be obtainable from the Latin Squares for the case when they use the same number of antennas. Also, the network coding maps which remove all the removable singular singular fade subspaces are shown to be obtainable from a small set of Latin Squares. The removal of all the singular fade subspaces by properly choosing the network coding map, provides a gain of 5.5 dB over the conventional Exclusive-OR network coding, in a Rayleigh fading scenario with 2 antennas at the end nodes and one antenna at the relay node, for 4-PSK signal set.

Wireless Network-Coded Bidirectional Relaying Using Latin Squares for M-PSK Modulation

The design of modulation schemes for the physical layer network-coded two-way relaying scenario is considered with a protocol which employs two phases: multiple access (MA) phase and broadcast (BC) phase. It was observed by Koike-Akino et al. that adaptively changing the network coding map used at the relay according to the channel conditions greatly reduces the impact of MA interference which occurs at the relay during the MA phase and all these network coding maps should satisfy a requirement called the exclusive law. We show that every network coding map that satisfies the exclusive law is representable by a Latin Square and conversely, that this relationship can be used to get the network coding maps satisfying the exclusive law. The channel fade states for which the minimum distance of the effective constellation at the relay become zero are referred to as the singular fade states. For M - PSK modulation (M any power of 2), it is shown that there are (M-2/4 - M/2 + 1) M singular fade states. Also, it is shown that the constraints which the network coding maps should satisfy so that the harmful effects of the singular fade states are removed, can be viewed equivalently as partially filled Latin Squares (PFLS). The problem of finding all the required maps is reduced to finding a small set of maps for M - PSK constellations (any power of 2), obtained by the completion of PFLS. Even though the completability of M x M PFLS using M symbols is an open problem, specific cases where such a completion is always possible are identified and explicit construction procedures are provided. Having obtained the network coding maps, the set of all possible channel realizations (the complex plane) is quantized into a finite number of regions, with a specific network coding map chosen in a particular region. It is shown that the complex plane can be partitioned into two regions: a region in which any network coding map which satisfies the exclusive law gives the same best performance and a region in which the choice of the network coding map affects the performance. The quantization thus obtained analytically, leads to the same as the one obtained using computer search for M = 4-PSK signal set by Koike-Akino et al., when specialized for Simulation results show that the proposed scheme performs better than the conventional exclusive-OR (XOR) network coding and in some cases outperforms the scheme proposed by Koike-Akino et al.

The dual role of Zn-acid medium for one-step rapid synthesis of M@rGO (M = Au, Pt, Pd and Ag) hybrid nanostructures at room temperature

We report a new protocol for the synthesis of M@rGO (M = Au, Pt, Pd, Ag and rGO = reduced graphene oxide) hybrid nanostructures at room temperature in Zn-acid medium. The roles of Zn-acid are to reduce the GO by generated hydrogen and the deposition of metal nanoparticles on rGO by galvanic replacement reaction between Zn and Mn+.

Subject independent human action recognition using spatio-depth information and meta-cognitive RBF network

In this paper, we present a machine learning approach for subject independent human action recognition using depth camera, emphasizing the importance of depth in recognition of actions. The proposed approach uses the flow information of all 3 dimensions to classify an action. In our approach, we have obtained the 2-D optical flow and used it along with the depth image to obtain the depth flow (Z motion vectors). The obtained flow captures the dynamics of the actions in space time. Feature vectors are obtained by averaging the 3-D motion over a grid laid over the silhouette in a hierarchical fashion. These hierarchical fine to coarse windows capture the motion dynamics of the object at various scales. The extracted features are used to train a Meta-cognitive Radial Basis Function Network (McRBFN) that uses a Projection Based Learning (PBL) algorithm, referred to as PBL-McRBFN, henceforth. PBL-McRBFN begins with zero hidden neurons and builds the network based on the best human learning strategy, namely, self-regulated learning in a meta-cognitive environment. When a sample is used for learning, PBLMcRBFN uses the sample overlapping conditions, and a projection based learning algorithm to estimate the parameters of the network. The performance of PBL-McRBFN is compared to that of a Support Vector Machine (SVM) and Extreme Learning Machine (ELM) classifiers with representation of every person and action in the training and testing datasets. Performance study shows that PBL-McRBFN outperforms these classifiers in recognizing actions in 3-D. Further, a subject-independent study is conducted by leave-one-subject-out strategy and its generalization performance is tested. It is observed from the subject-independent study that McRBFN is capable of generalizing actions accurately. The performance of the proposed approach is benchmarked with Video Analytics Lab (VAL) dataset and Berkeley Multimodal Human Action Database (MHAD). (C) 2013 Elsevier Ltd. All rights reserved.

Classification calibration dimension for general multiclass losses

We study consistency properties of surrogate loss functions for general multiclass classification problems, defined by a general loss matrix. We extend the notion of classification calibration, which has been studied for binary and multiclass 0-1 classification problems (and for certain other specific learning problems), to the general multiclass setting, and derive necessary and sufficient conditions for a surrogate loss to be classification calibrated with respect to a loss matrix in this setting. We then introduce the notion of \emph{classification calibration dimension} of a multiclass loss matrix, which measures the smallest `size' of a prediction space for which it is possible to design a convex surrogate that is classification calibrated with respect to the loss matrix. We derive both upper and lower bounds on this quantity, and use these results to analyze various loss matrices. In particular, as one application, we provide a different route from the recent result of Duchi et al.\ (2010) for analyzing the difficulty of designing `low-dimensional' convex surrogates that are consistent with respect to pairwise subset ranking losses. We anticipate the classification calibration dimension may prove to be a useful tool in the study and design of surrogate losses for general multiclass learning problems.

Bulk Majorana mass terms and Dirac neutrinos in the Randall-Sundrum model

We present a novel scheme where Dirac neutrinos are realized even if lepton number violating Majorana mass terms are present. The setup is the Randall-Sundrum framework with bulk right-handed neutrinos. Bulk mass terms of both Majorana and Dirac type are considered. It is shown that massless zero mode solutions exist when the bulk Dirac mass term is set to zero. In this limit, it is found that the effective 4D small neutrino mass is primarily of Dirac nature, with the Majorana-type contributions being negligible. Interestingly, this scenario is very similar to the one known with flat extra dimensions. Neutrino phenomenology is discussed by fitting both charged lepton masses and neutrino masses simultaneously. A single Higgs localized on the IR brane is highly constrained, as unnaturally large Yukawa couplings are required to fit charged lepton masses. A simple extension with two Higgs doublets is presented, which facilitates a proper fit for the lepton masses.

Delay optimized zero-forcing channel shortening algorithm for wireless communication

In Orthogonal Frequency Division Multiplexing and Discrete Multitone transceivers, a guard interval called Cyclic Prefix (CP) is inserted to avoid inter-symbol interference. The length of the CP is usually greater than the impulse response of the channel resulting in a loss of useful data carriers. In order to avoid long CP, a time domain equalizer is used to shorten the channel. In this paper, we propose a method to include a delay in the zero-forcing equalizer and obtain an optimal value of the delay, based on the location of zeros of the channel. The performance of the algorithms is studied using numerical simulations.

Burst error correction using partial fourier matrices and block sparse representation

There is a strong relation between sparse signal recovery and error control coding. It is known that burst errors are block sparse in nature. So, here we attempt to solve burst error correction problem using block sparse signal recovery methods. We construct partial Fourier based encoding and decoding matrices using results on difference sets. These constructions offer guaranteed and efficient error correction when used in conjunction with reconstruction algorithms which exploit block sparsity.

Asymptotically-good, multigroup decodable space-time block codes

For a family of Space-Time Block Codes (STBCs) C-1, C-2,..., with increasing number of transmit antennas N-i, with rates R-i complex symbols per channel use, i = 1, 2,..., we introduce the notion of asymptotic normalized rate which we define as lim(i ->infinity) R-i/N-i, and we say that a family of STBCs is asymptotically-good if its asymptotic normalized rate is non-zero, i. e., when the rate scales as a non-zero fraction of the number of transmit antennas. An STBC C is said to be g-group decodable, g >= 2, if the information symbols encoded by it can be partitioned into g groups, such that each group of symbols can be ML decoded independently of the others. In this paper we construct full-diversity g-group decodable codes with rates greater than one complex symbol per channel use for all g >= 2. Specifically, we construct delay-optimal, g-group decodable codes for number of transmit antennas N-t that are a multiple of g2left perpendicular(g-1/2)right perpendicular with rate N-t/g2(g-1) + g(2)-g/2N(t). Using these new codes as building blocks, we then construct non-delay-optimal g-group decodable codes with rate roughly g times that of the delay-optimal codes, for number of antennas N-t that are a multiple of 2left perpendicular(g-1/2)right perpendicular, with delay gN(t) and rate Nt/2(g-1) + g-1/2N(t). For each g >= 2, the new delay-optimal and non-delay- optimal families of STBCs are both asymptotically-good, with the latter family having the largest asymptotic normalized rates among all known families of multigroup decodable codes with delay T <= gN(t). Also, for g >= 3, these are the first instances of g-group decodable codes with rates greater than 1 reported in the literature.

A prototype of a first-responder indoor localization system

In this paper we present an approach to build a prototype. model of a first-responder localization system intended for disaster relief operations. This system is useful to monitor and track the positions of the first-responders in an indoor environment, where GPS is not available. Each member of the first responder team is equipped with two zero-velocity-update-aided inertial navigation systems, one on each foot, a camera mounted on a helmet, and a processing platform strapped around the waist of the first responder, which fuses the data from the different sensors. The fusion algorithm runs real-time on the processing platform. The video is also processed using the DSP core of the computing machine. The processed data consisting of position, velocity, heading information along with video streams is transmitted to the command and control system via a local infrastructure WiFi network. A centralized cooperative localization algorithm, utilizing the information from Ultra Wideband based inter-agent ranging devices combined with the position estimates and uncertainties of each first responder, has also been implemented.

Computational Study of the Migration of Rhenium from One Enantioface of an Olefin to the Other Facilitated by (C-H)center dot center dot center dot Re Interactions

The migration of a metal atom in a metal olefin complex from one pi face of the olefin to the opposite pi face has been rarely documented. Gladysz and co-workers showed that such a movement is indeed possible in monosubstituted chiral Re olefin complexes, resulting in diastereomerization. Interestingly, this isomerization occurred without dissociation, and on the basis of kinetic isotope effects, the involvement of a trans C-H bond was indicated. Either oxidative addition or an agostic interaction of the vinylic C-H(D) bond with the metal could account for the experimentally observed kinetic isotope effect. In this study we compute the free energy of activation for the migration of Re from one enantioface of the olefin to the other through various pathways. On the basis of DFT calculations at the B3LYP level we show that a trans (C-H)center dot center dot center dot Re interaction and trans C-H oxidative addition provide a nondissociative path for the diastereomerization. The trans (C-H)center dot center dot center dot Re interaction path is computed to be more favorable by 2.3 kcal mol(-1) than the oxidative addition path. While direct experimental evidence was not able to discount the migration of the metal through the formation of a eta(2)-arene complex (conducted tour mechanism), computational results at the B3LYP level show that it is energetically more expensive. Surprisingly, a similar analysis carried out at the M06 level computes a lower energy path for the conducted tour mechanism and is not consistent with the experimental isotope effects observed. Metal-(C-H) interactions and oxidative additions of the metal into C-H bonds are closely separated in energy and might contribute to unusual fluxional processes such as this diastereomerization.

Lipschitz Correspondence between Metric Measure Spaces and Random Distance Matrices

Given a metric space with a Borel probability measure, for each integer N, we obtain a probability distribution on N x N distance matrices by considering the distances between pairs of points in a sample consisting of N points chosen independently from the metric space with respect to the given measure. We show that this gives an asymptotically bi-Lipschitz relation between metric measure spaces and the corresponding distance matrices. This is an effective version of a result of Vershik that metric measure spaces are determined by associated distributions on infinite random matrices.