Magnetic Structure and Properties of the Rechargeable Battery Insertion Compound Na2FePO4F

The magnetic structure and properties of sodium iron fluorophosphate Na2FePO4F (space group Pbcn), a cathode material for rechargeable batteries, were studied using magnetometry and neutron powder diffraction. The material, which can be described as a quasi-layered structure with zigzag Fe-octahedral chains, develops a long-range antiferromagnetic order below similar to 3.4 K. The magnetic structure is rationalized as a super-exchange-driven ferromagnetic ordering of chains running along the a-axis, coupled antiferromagnetically by super-super-exchange via phosphate groups along the c-axis, with ordering along the b-axis likely due to the contribution of dipole dipole interactions.

Modified roaming optimization for multi-modal optima

This paper explains the algorithm of Modified Roaming Optimization (MRO) for capturing the multiple optima for multimodal functions. There are some similarities between the Roaming Optimization (RO) and MRO algorithms, but the MRO algorithm is created to overcome the problems facing while applying the RO to the problems possessing large number of solutions. The MRO mainly uses the concept of density to overcome the challenges posed by RO. The algorithm is tested with standard test functions and also discussions are made to improve the efficacy of the MRO algorithm. This paper also gives the results of MRO applied for solving Inverse Kinematics (IK) problem for SCARA and PUMA robots.

A parametric study on the buckling of functionally graded material plates with internal discontinuities using the partition of unity method

In this paper, the effect of local defects, viz., cracks and cutouts on the buckling behaviour of functionally graded material plates subjected to mechanical and thermal load is numerically studied. The internal discontinuities, viz., cracks and cutouts are represented independent of the mesh within the framework of the extended finite element method and an enriched shear flexible 4-noded quadrilateral element is used for the spatial discretization. The properties are assumed to vary only in the thickness direction and the effective properties are estimated using the Mori-Tanaka homogenization scheme. The plate kinematics is based on the first order shear deformation theory. The influence of various parameters, viz., the crack length and its location, the cutout radius and its position, the plate aspect ratio and the plate thickness on the critical buckling load is studied. The effect of various boundary conditions is also studied. The numerical results obtained reveal that the critical buckling load decreases with increase in the crack length, the cutout radius and the material gradient index. This is attributed to the degradation in the stiffness either due to the presence of local defects or due to the change in the material composition. (C) 2013 Elsevier Masson SAS. All rights reserved.

Automatic Data Allocation and Buffer Management for Multi-GPU Machines

Multi-GPU machines are being increasingly used in high-performance computing. Each GPU in such a machine has its own memory and does not share the address space either with the host CPU or other GPUs. Hence, applications utilizing multiple GPUs have to manually allocate and manage data on each GPU. Existing works that propose to automate data allocations for GPUs have limitations and inefficiencies in terms of allocation sizes, exploiting reuse, transfer costs, and scalability. We propose a scalable and fully automatic data allocation and buffer management scheme for affine loop nests on multi-GPU machines. We call it the Bounding-Box-based Memory Manager (BBMM). BBMM can perform at runtime, during standard set operations like union, intersection, and difference, finding subset and superset relations on hyperrectangular regions of array data (bounding boxes). It uses these operations along with some compiler assistance to identify, allocate, and manage data required by applications in terms of disjoint bounding boxes. This allows it to (1) allocate exactly or nearly as much data as is required by computations running on each GPU, (2) efficiently track buffer allocations and hence maximize data reuse across tiles and minimize data transfer overhead, and (3) and as a result, maximize utilization of the combined memory on multi-GPU machines. BBMM can work with any choice of parallelizing transformations, computation placement, and scheduling schemes, whether static or dynamic. Experiments run on a four-GPU machine with various scientific programs showed that BBMM reduces data allocations on each GPU by up to 75% compared to current allocation schemes, yields performance of at least 88% of manually written code, and allows excellent weak scaling.

Progress in tuberculosis vaccine development and host-directed therapies-a state of the art review

Tuberculosis continues to kill 1.4 million people annually. During the past 5 years, an alarming increase in the number of patients with multidrug-resistant tuberculosis and extensively drug-resistant tuberculosis has been noted, particularly in eastern Europe, Asia, and southern Africa. Treatment outcomes with available treatment regimens for drug-resistant tuberculosis are poor. Although substantial progress in drug development for tuberculosis has been made, scientific progress towards development of interventions for prevention and improvement of drug treatment outcomes have lagged behind. Innovative interventions are therefore needed to combat the growing pandemic of multidrug-resistant and extensively drug-resistant tuberculosis. Novel adjunct treatments are needed to accomplish improved cure rates for multidrug-resistant and extensively drug-resistant tuberculosis. A novel, safe, widely applicable, and more effective vaccine against tuberculosis is also desperately sought to achieve disease control. The quest to develop a universally protective vaccine for tuberculosis continues. So far, research and development of tuberculosis vaccines has resulted in almost 20 candidates at different stages of the clinical trial pipeline. Host-directed therapies are now being developed to refocus the anti-Mycobacterium tuberculosis-directed immune responses towards the host; a strategy that could be especially beneficial for patients with multidrug-resistant tuberculosis or extensively drug-resistant tuberculosis. As we are running short of canonical tuberculosis drugs, more attention should be given to host-directed preventive and therapeutic intervention measures.

Effect of the Flow Rule on the Bearing Capacity of Strip Foundations on Sand by the Upper-Bound Limit Analysis and Slip Lines

The influence of the flow rule on the bearing capacity of strip foundations placed on sand was investigated using a new kinematic approach of upper-bound limit analysis. The method of stress characteristics was first used to find the mechanism of the failure and to compute the stress field by using the Mohr-Coulomb yield criterion. Once the failure mechanism had been established, the kinematics of the plastic deformation was established, based on the requirements of the upper-bound limit theorem. Both associated and nonassociated plastic flows were considered, and the bearing capacity was obtained by equating the rate of external plastic work to the rate of the internal energy dissipation for both smooth and rough base foundations. The results obtained from the analysis were compared with those available from the literature. (C) 2014 American Society of Civil Engineers.

Performance Analysis of a Cooperative MAC Protocol of Wireless Ad Hoc Networks

Different medium access control (MAC) layer protocols, for example, IEEE 802.11 series and others are used in wireless local area networks. They have limitation in handling bulk data transfer applications, like video-on-demand, videoconference, etc. To avoid this problem a cooperative MAC protocol environment has been introduced, which enables the MAC protocol of a node to use its nearby nodes MAC protocol as and when required. We have found on various occasions that specified cooperative MAC establishes cooperative transmissions to send the specified data to the destination. In this paper we propose cooperative MAC priority (CoopMACPri) protocol which exploits the advantages of priority value given by the upper layers for selection of different paths to nodes running heterogeneous applications in a wireless ad hoc network environment. The CoopMACPri protocol improves the system throughput and minimizes energy consumption. Using a Markov chain model, we developed a model to analyse the performance of CoopMACPri protocol; and also derived closed-form expression of saturated system throughput and energy consumption. Performance evaluations validate the accuracy of the theoretical analysis, and also show that the performance of CoopMACPri protocol varies with the number of nodes. We observed that the simulation results and analysis reflects the effectiveness of the proposed protocol as per the specifications.

Turing and animal coat patterns

The present article describes a beautiful contribution of Alan Turing to our understanding of how animal coat patterns form. The question that Turing posed was the following. A collection of identical cells (or processors for that matter), all running the exact same program, and all communicating with each other in the exact same way, should always be in the same state. Yet they produce nonhomogeneous periodic patterns, like those seen on animal coats. How does this happen? Turing gave an elegant explanation for this phenomenon, namely that differences between the cells due to small amounts of random noise can actually be amplified into structured periodic patterns. We attempt to describe his core conceptual contribution below.

Give-and-take based peer-to-peer content distribution networks

Content Distribution Networks (CDNs) are widely used to distribute data to large number of users. Traditionally, content is being replicated among a number of surrogate servers, leading to high operational costs. In this context, Peer-to-Peer (P2P) CDNs have emerged as a viable alternative. An issue of concern in P2P networks is that of free riders, i.e., selfish peers who download files and leave without uploading anything in return. Free riding must be discouraged. In this paper, we propose a criterion, the Give-and-Take (G&T) criterion, that disallows free riders. Incorporating the G&T criterion in our model, we study a problem that arises naturally when a new peer enters the system: viz., the problem of downloading a `universe' of segments, scattered among other peers, at low cost. We analyse this hard problem, and characterize the optimal download cost under the G&T criterion. We propose an optimal algorithm, and provide a sub-optimal algorithm that is nearly optimal, but runs much more quickly; this provides an attractive balance between running time and performance. Finally, we compare the performance of our algorithms with that of a few existing P2P downloading strategies in use. We also study the computation time for prescribing the strategy for initial segment and peer selection for the newly arrived peer for various existing and proposed algorithms, and quantify cost-computation time trade-offs.

PolyGLoT: A Polyhedral Loop Transformation Framework for a Graphical Dataflow Language

Polyhedral techniques for program transformation are now used in several proprietary and open source compilers. However, most of the research on polyhedral compilation has focused on imperative languages such as C, where the computation is specified in terms of statements with zero or more nested loops and other control structures around them. Graphical dataflow languages, where there is no notion of statements or a schedule specifying their relative execution order, have so far not been studied using a powerful transformation or optimization approach. The execution semantics and referential transparency of dataflow languages impose a different set of challenges. In this paper, we attempt to bridge this gap by presenting techniques that can be used to extract polyhedral representation from dataflow programs and to synthesize them from their equivalent polyhedral representation. We then describe PolyGLoT, a framework for automatic transformation of dataflow programs which we built using our techniques and other popular research tools such as Clan and Pluto. For the purpose of experimental evaluation, we used our tools to compile LabVIEW, one of the most widely used dataflow programming languages. Results show that dataflow programs transformed using our framework are able to outperform those compiled otherwise by up to a factor of seventeen, with a mean speed-up of 2.30x while running on an 8-core Intel system.

Parameterized Algorithms for MAX COLORABLE INDUCED SUBGRAPH Problem on Perfect Graphs

We address the parameterized complexity ofMaxColorable Induced Subgraph on perfect graphs. The problem asks for a maximum sized q-colorable induced subgraph of an input graph G. Yannakakis and Gavril IPL 1987] showed that this problem is NP-complete even on split graphs if q is part of input, but gave a n(O(q)) algorithm on chordal graphs. We first observe that the problem is W2]-hard parameterized by q, even on split graphs. However, when parameterized by l, the number of vertices in the solution, we give two fixed-parameter tractable algorithms. The first algorithm runs in time 5.44(l) (n+#alpha(G))(O(1)) where #alpha(G) is the number of maximal independent sets of the input graph. The second algorithm runs in time q(l+o()l())n(O(1))T(alpha) where T-alpha is the time required to find a maximum independent set in any induced subgraph of G. The first algorithm is efficient when the input graph contains only polynomially many maximal independent sets; for example split graphs and co-chordal graphs. The running time of the second algorithm is FPT in l alone (whenever T-alpha is a polynomial in n), since q <= l for all non-trivial situations. Finally, we show that (under standard complexitytheoretic assumptions) the problem does not admit a polynomial kernel on split and perfect graphs in the following sense: (a) On split graphs, we do not expect a polynomial kernel if q is a part of the input. (b) On perfect graphs, we do not expect a polynomial kernel even for fixed values of q >= 2.

Vertex Cover Gets Faster and Harder on Low Degree Graphs

The problem of finding an optimal vertex cover in a graph is a classic NP-complete problem, and is a special case of the hitting set question. On the other hand, the hitting set problem, when asked in the context of induced geometric objects, often turns out to be exactly the vertex cover problem on restricted classes of graphs. In this work we explore a particular instance of such a phenomenon. We consider the problem of hitting all axis-parallel slabs induced by a point set P, and show that it is equivalent to the problem of finding a vertex cover on a graph whose edge set is the union of two Hamiltonian Paths. We show the latter problem to be NP-complete, and also give an algorithm to find a vertex cover of size at most k, on graphs of maximum degree four, whose running time is 1.2637(k) n(O(1)).

MAXIMUM A-POSTERIORI ESTIMATION OF MISSING SAMPLES WITH CONTINUITY CONSTRAINT IN ELECTROMAGNETIC ARTICULOGRAPHY DATA

Electromagnetic Articulography (EMA) technique is used to record the kinematics of different articulators while one speaks. EMA data often contains missing segments due to sensor failure. In this work, we propose a maximum a-posteriori (MAP) estimation with continuity constraint to recover the missing samples in the articulatory trajectories recorded using EMA. In this approach, we combine the benefits of statistical MAP estimation as well as the temporal continuity of the articulatory trajectories. Experiments on articulatory corpus using different missing segment durations show that the proposed continuity constraint results in a 30% reduction in average root mean squared error in estimation over statistical estimation of missing segments without any continuity constraint.

Experimental Characterization and Control of Miniaturized Pneumatic Artificial Muscle

Robotic surgical tools used in minimally invasive surgeries (MIS) require miniaturized and reliable actuators for precise positioning and control of the end-effector. Miniature pneumatic artificial muscles (MPAMs) are a good choice due to their inert nature, high force to weight ratio, and fast actuation. In this paper, we present the development of miniaturized braided pneumatic muscles with an outer diameter of similar to 1.2 mm, a high contraction ratio of about 18%, and capable of providing a pull force in excess of 4 N at a supply pressure of 0.8 MPa. We present the details of the developed experimental setup, experimental data on contraction and force as a function of applied pressure, and characterization of the MPAM. We also present a simple kinematics and experimental data based model of the braided pneumatic muscle and show that the model predicts contraction in length to within 20% of the measured value. Finally, a robust controller for the MPAMs is developed and validated with experiments and it is shown that the MPAMs have a time constant of similar to 10 ms thereby making them suitable for actuating endoscopic and robotic surgical tools.

Improved subject-independent acoustic-to-articulatory inversion

In subject-independent acoustic-to-articulatory inversion, the articulatory kinematics of a test subject are estimated assuming that the training corpus does not include data from the test subject. The training corpus in subject-independent inversion (SII) is formed with acoustic and articulatory kinematics data and the acoustic mismatch between training and test subjects is then estimated by an acoustic normalization using acoustic data drawn from a large pool of speakers called generic acoustic space (GAS). In this work, we focus on improving the SII performance through better acoustic normalization and adaptation. We propose unsupervised and several supervised ways of clustering GAS for acoustic normalization. We perform an adaptation of acoustic models of GAS using the acoustic data of the training and test subjects in SII. It is found that SII performance significantly improves (similar to 25% relative on average) over the subject-dependent inversion when the acoustic clusters in GAS correspond to phonetic units (or states of 3-state phonetic HMMs) and when the acoustic model built on GAS is adapted to training and test subjects while optimizing the inversion criterion. (C) 2014 Elsevier B.V. All rights reserved.