Top polarization in stop production at the LHC

We survey the expected polarization of the top produced in the decay of a scalar top quark, t -> t((chi) over tildei)(0), i = 1 - 2. The phenomenology is quite interesting, since the expected polarization depends both on the mixing in the stop and neutralino sectors and on the mass differences between the stop and the neutralino. We find that a mixed stop behaves almost like a right-handed stop due to the larger hypercharge that enters the stop/top/gaugino coupling and that these polarisation effects disappear, when m((t) over tilde1) approximate to m(t) +m((chi) over tildei)(0). After a discussion on the expected top polarization from the decay of a scalar top quark, we focus on the interplay of polarization and kinematics at the LHC. We discuss different probes of the top polarization in terms of lab-frame observables. We find that these observables faithfully reflect the polarization of the parent top-quark, but also have a non-trivial dependence on the kinematics of the stop production and decay process. In addition, we illustrate the effect of top polarization on the energy and transverse momentum of the decay lepton in the laboratory frame. Our results show that both spectra are softened substantially in case of a negatively polarized top, particularly for a large mass difference between the stop and the neutralino. Thus, the search strategies, and the conclusions that can be drawn from them, depends not just on the mass difference m((t) over tilde) - m((chi) over tildei)(0) due to the usual kinematic effects but also on the effects of top polarization on the decay kinematics the extent of which depends in turn on the said mass difference.

Effect of hinged leaflets on vortex pair generation

We experimentally study the effect of having hinged leaflets at the jet exit on the formation of a two-dimensional counter-rotating vortex pair. A piston-cylinder mechanism is used to generate a starting jet from a high-aspect-ratio channel into a quiescent medium. For a rigid exit, with no leaflets at the channel exit, the measurements at a central plane show that the trailing jet in the present case is never detached from the vortex pair, and keeps feeding into the latter, unlike in the axisymmetric case. Passive flexibility is introduced in the form of rigid leaflets or flaps that are hinged at the exit of the channel, with the flaps initially parallel to the channel walls. The experimental arrangement closely approximates the limiting case of a free-to-rotate rigid flap with negligible structural stiffness, damping and flap inertia, as these limiting structural properties permit the largest flap openings. Using this arrangement, we start the flow and measure the flap kinematics and the vorticity fields for different flap lengths and piston velocity programs. The typical motion of the flaps involves a rapid opening and a subsequent more gradual return to its initial position, both of which occur when the piston is still moving. The initial opening of the flaps can be attributed to an excess pressure that develops in the channel when the flow starts, due to the acceleration that has to be imparted to the fluid slug between the flaps. In the case with flaps, two additional pairs of vortices are formed because of the motion of the flaps, leading to the ejection of a total of up to three vortex pairs from the hinged exit. The flaps' length (L-f) is found to significantly affect flap motions when plotted using the conventional time scale L/d, where L is the piston stroke and d is the channel width. However, with a newly defined time scale based on the flap length (L/L-f), we find a good collapse of all the measured flap motions irrespective of flap length and piston velocity for an impulsively started piston motion. The maximum opening angle in all these impulsive velocity program cases, irrespective of the flap length, is found to be close to 15 degrees. Even though the flap kinematics collapses well with L/L-f, there are differences in the distribution of the ejected vorticity even for the same L/L-f. Such a redistribution of vorticity can lead to important changes in the overall properties of the flow, and it gives us a better understanding of the importance of exit flexibility in such flows.

Scalable flow-sensitive pointer analysis for fava with strong updates

The ability to perform strong updates is the main contributor to the precision of flow-sensitive pointer analysis algorithms. Traditional flow-sensitive pointer analyses cannot strongly update pointers residing in the heap. This is a severe restriction for Java programs. In this paper, we propose a new flow-sensitive pointer analysis algorithm for Java that can perform strong updates on heap-based pointers effectively. Instead of points-to graphs, we represent our points-to information as maps from access paths to sets of abstract objects. We have implemented our analysis and run it on several large Java benchmarks. The results show considerable improvement in precision over the points-to graph based flow-insensitive and flow-sensitive analyses, with reasonable running time.

Analysis of the degrees-of-freedom of spatial parallel manipulators in regular and singular configurations

This paper presents a study of the nature of the degrees-of-freedom of spatial manipulators based on the concept of partition of degrees-of-freedom. In particular, the partitioning of degrees-of-freedom is studied in five lower-mobility spatial parallel manipulators possessing different combinations of degrees-of-freedom. An extension of the existing theory is introduced so as to analyse the nature of the gained degree(s)-of-freedom at a gain-type singularity. The gain of one- and two-degrees-of-freedom is analysed in several well-studied, as well as newly developed manipulators. The formulations also present a basis for the analysis of the velocity kinematics of manipulators of any architecture. (C) 2013 Elsevier Ltd. All rights reserved.

CUDA-for-clusters: a system for efficient execution of CUDA kernels on multi-core clusters

Rapid advancements in multi-core processor architectures coupled with low-cost, low-latency, high-bandwidth interconnects have made clusters of multi-core machines a common computing resource. Unfortunately, writing good parallel programs that efficiently utilize all the resources in such a cluster is still a major challenge. Various programming languages have been proposed as a solution to this problem, but are yet to be adopted widely to run performance-critical code mainly due to the relatively immature software framework and the effort involved in re-writing existing code in the new language. In this paper, we motivate and describe our initial study in exploring CUDA as a programming language for a cluster of multi-cores. We develop CUDA-For-Clusters (CFC), a framework that transparently orchestrates execution of CUDA kernels on a cluster of multi-core machines. The well-structured nature of a CUDA kernel, the growing popularity, support and stability of the CUDA software stack collectively make CUDA a good candidate to be considered as a programming language for a cluster. CFC uses a mixture of source-to-source compiler transformations, a work distribution runtime and a light-weight software distributed shared memory to manage parallel executions. Initial results on running several standard CUDA benchmark programs achieve impressive speedups of up to 7.5X on a cluster with 8 nodes, thereby opening up an interesting direction of research for further investigation.

Moore meets maxwell

Moore's Law has driven the semiconductor revolution enabling over four decades of scaling in frequency, size, complexity, and power. However, the limits of physics are preventing further scaling of speed, forcing a paradigm shift towards multicore computing and parallelization. In effect, the system is taking over the role that the single CPU was playing: high-speed signals running through chips but also packages and boards connect ever more complex systems. High-speed signals making their way through the entire system cause new challenges in the design of computing hardware. Inductance, phase shifts and velocity of light effects, material resonances, and wave behavior become not only prevalent but need to be calculated accurately and rapidly to enable short design cycle times. In essence, to continue scaling with Moore's Law requires the incorporation of Maxwell's equations in the design process. Incorporating Maxwell's equations into the design flow is only possible through the combined power that new algorithms, parallelization and high-speed computing provide. At the same time, incorporation of Maxwell-based models into circuit and system-level simulation presents a massive accuracy, passivity, and scalability challenge. In this tutorial, we navigate through the often confusing terminology and concepts behind field solvers, show how advances in field solvers enable integration into EDA flows, present novel methods for model generation and passivity assurance in large systems, and demonstrate the power of cloud computing in enabling the next generation of scalable Maxwell solvers and the next generation of Moore's Law scaling of systems. We intend to show the truly symbiotic growing relationship between Maxwell and Moore!

A method of developing an agent based ubiquitous node monitoring protocol

A ubiquitous network plays a critical role to provide rendered services to ubiquitous application running nodes. To provide appropriate resources the nodes are needed to be monitored continuously. Monitoring a node in ubiquitous network is challenging because of dynamicity and heterogeneity of the ubiquitous network. The network monitor has to monitor resource parameters, like data rate, delay and throughput, as well as events such as node failure, network failure and fault in the system to curb the system failure. In this paper, we propose a method to develop a ubiquitous system monitoring protocol using agents. Earlier works on network monitoring using agents consider that the agents are designed for particular network. While in our work the heterogeneity property of the network has been considered. We have shown that the nodes' behaviour can be easily monitored by using agents (both static and mobile agent). The past behavior of the application and network, and past history of the Unode and the predecessor are taken into consideration to help SA to take appropriate decision during the time of emergency situation like unavailability of resources at the local administration, and to predict the migration of the Unode based on the previous node history. The results obtained in the simulation reflects the effectiveness of the technique.

Intercepting maneuvering target with specified impact angle by modified SDRE technique

A guidance law derived by modifying state dependent Riccati equation technique, to enable the imposition of a predetermined terminal intercept angle to a maneuvering target, is presented in this paper. The interceptor is assumed to have no knowledge about the type of maneuver the target is executing. The problem is cast in a non-cooperative game theoretic form. The guidance law obtained is dependent on the LOS angular rotational rate and on the impact angle error. Theoretical conditions which guarantee existence of solutions under this method have been derived. It is shown that imposing the impact angle constraint calls for an increase in the gains of the guidance law considerably, subsequently requiring a higher maneuverability advantage of the interceptor. The performance of the proposed guidance law is studied using a non-linear two dimensional simulation of the relative kinematics, assuming first order dynamics for the interceptor and target.

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.