Minor mergers and their impact on the kinematics of old and young stellar populations in disk galaxies

By means of N-body simulations we investigate the impact of minor mergers on the angular momentum and dynamical properties of the merger remnant. Our simulations cover a range of initial orbital characteristics and gas-to-stellar mass fractions (from 0 to 20%), and include star formation and supernova feedback. We confirm and extend previous results by showing that the specific angular momentum of the stellar component always decreases independently of the orbital parameters or morphology of the satellite, and that the decrease in the rotation velocity of the primary galaxy is accompanied by a change in the anisotropy of the orbits. However, the decrease affects only the old stellar population, and not the new population formed from gas during the merging process. This means that the merging process induces an increasing difference in the rotational support of the old and young stellar components, with the old one lagging with respect to the new. Even if our models are not intended specifically to reproduce the Milky Way and its accretion history, we find that, under certain conditions, the modeled rotational lag found is compatible with that observed in the Milky Way disk, thus indicating that minor mergers can be a viable way to produce it. The lag can increase with the vertical distance from the disk midplane, but only if the satellite is accreted along a direct orbit, and in all cases the main contribution to the lag comes from stars originally in the primary disk rather than from stars in the satellite galaxy. We also discuss the possibility of creating counter-rotating stars in the remnant disk, their fraction as a function of the vertical distance from the galaxy midplane, and the cumulative effect of multiple mergers on their creation.

Large improvements in application throughput of long-running multi-component applications using batch grids

Computational grids with multiple batch systems (batch grids) can be powerful infrastructures for executing long-running multi-component parallel applications. In this paper, we evaluate the potential improvements in throughput of long-running multi-component applications when the different components of the applications are executed on multiple batch systems of batch grids. We compare the multiple batch executions with executions of the components on a single batch system without increasing the number of processors used for executions. We perform our analysis with a foremost long-running multi-component application for climate modeling, the Community Climate System Model (CCSM). We have built a robust simulator that models the characteristics of both the multi-component application and the batch systems. By conducting large number of simulations with different workload characteristics and queuing policies of the systems, processor allocations to components of the application, distributions of the components to the batch systems and inter-cluster bandwidths, we show that multiple batch executions lead to 55% average increase in throughput over single batch executions for long-running CCSM. We also conducted real experiments with a practical middleware infrastructure and showed that multi-site executions lead to effective utilization of batch systems for executions of CCSM and give higher simulation throughput than single-site executions. Copyright (c) 2011 John Wiley & Sons, Ltd.

Experimental Studies on the Kinematics of Cutting in Granular Materials

Slow flow in granular materials is characterized by high solid fraction and sustained inter-particle interaction. The kinematics of trawling or cutting is encountered in processes such as locomotion of organisms in sand; trawl gear movement on a soil deposit; plow movement; movement of rovers, earth moving equipment etc. Additionally, this configuration is very akin to shallow drilling configuration encountered in the mining and petroleum industries. An experimental study has been made in order to understand velocity and deformation fields in cutting of a model rounded sand. Under nominal plane strain conditions, sand is subjected to orthogonal cutting at different tool-rake angles. High-resolution optical images of the region of cutting were obtained during the flow of the granular ensemble around the tool. Interesting kinematics underlying the formation of a chip and the evolution of the deformation field is seen in these experiments. These images are also analyzed using a PIV algorithm and detailed information of the deformation parameters such as velocity, strain rate and volume change is obtained.

Probing the spin-parity of the Higgs boson via jet kinematics in vector boson fusion

Determining the spin and the parity quantum numbers of the recently discovered Higgs-like boson at the LHC is a matter of great importance. In this Letter, we consider the possibility of using the kinematics of the tagging jets in Higgs production via the vector boson fusion (VBF) process to test the tensor structure of the Higgs-vector boson (HVV) interaction and to determine the spin and CP properties of the observed resonance. We show that an anomalous HVV vertex, in particular its explicit momentum dependence, drastically affects the rapidity between the two scattered quarks and their transverse momenta and, hence, the acceptance of the kinematical cuts that allow to select the VBF topology. The sensitivity of these observables to different spin-parity assignments, including the dependence on the LHC center of mass energy, are evaluated. In addition, we show that in associated Higgs production with a vector boson some kinematical variables, such as the invariant mass of the system and the transverse momenta of the two bosons and their separation in rapidity, are also sensitive to the spin-parity assignments of the Higgs-like boson.

Report on the IUTAM Symposium on Mobile Particulate Systems: Kinematics, Rheology, and Complex Phenomena, Bangalore, India, 2012

This report summarizes the presentations and discussions conducted during the symposium, which was held under the aegis of the International Union of Theoretical and Applied Mechanics during 23-27 January 2012 in Bangalore, India. (C) 2013 AIP Publishing LLC.

Current kinematics and dynamics of Africa and the East African Rift System

Although the East African Rift System (EARS) is an archetype continental rift, the forces driving its evolution remain debated. Some contend buoyancy forces arising from gravitational potential energy (GPE) gradients within the lithosphere drive rifting. Others argue for a major role of the diverging mantle flow associated with the African Superplume. Here we quantify the forces driving present-day continental rifting in East Africa by (1) solving the depth averaged 3-D force balance equations for 3-D deviatoric stress associated with GPE, (2) inverting for a stress field boundary condition that we interpret as originating from large-scale mantle tractions, (3) calculating dynamic velocities due to lithospheric buoyancy forces, lateral viscosity variations, and velocity boundary conditions, and (4) calculating dynamic velocities that result from the stress response of horizontal mantle tractions acting on a viscous lithosphere in Africa and surroundings. We find deviatoric stress associated with lithospheric GPE gradients are similar to 8-20 MPa in EARS, and the minimum deviatoric stress resulting from basal shear is similar to 1.6 MPa along the EARS. Our dynamic velocity calculations confirm that a force contribution from GPE gradients alone is sufficient to drive Nubia-Somalia divergence and that additional forcing from horizontal mantle tractions overestimates surface kinematics. Stresses from GPE gradients appear sufficient to sustain present-day rifting in East Africa; however, they are lower than the vertically integrated strength of the lithosphere along most of the EARS. This indicates additional processes are required to initiate rupture of continental lithosphere, but once it is initiated, lithospheric buoyancy forces are enough to maintain rifting.

Flux Transport Dynamos: From Kinematics to Dynamics

Over the past several decades, Flux-Transport Dynamo (FTD) models have emerged as a popular paradigm for explaining the cyclic nature of solar magnetic activity. Their defining characteristic is the key role played by the mean meridional circulation in transporting magnetic flux and thereby regulating the cycle period. Most FTD models also incorporate the so-called Babcock-Leighton (BL) mechanism in which the mean poloidal field is produced by the emergence and subsequent dispersal of bipolar active regions. This feature is well grounded in solar observations and provides a means for assimilating observed surface flows and fields into the models in order to forecast future solar activity, to identify model biases, and to clarify the underlying physical processes. Furthermore, interpreting historical sunspot records within the context of FTD models can potentially provide insight into why cycle features such as amplitude and duration vary and what causes extreme events such as Grand Minima. Though they are generally robust in a modeling sense and make good contact with observed cycle features, FTD models rely on input physics that is only partially constrained by observation and that neglects the subtleties of convective transport, convective field generation, and nonlinear feedbacks. Here we review the formulation and application of FTD models and assess our current understanding of the input physics based largely on complementary 3D MHD simulations of solar convection, dynamo action, and flux emergence.

Kinematics and dynamics of Jansen leg mechanism: A bond graph approach

The Jansen mechanism is a one degree-of-freedom, planar, 12-link, leg mechanism that can be used in mobile robotic applications and in gait analysis. This paper presents the kinematics and dynamics of the Jansen leg mechanism. The forward kinematics, accomplished using circle intersection method, determines the trajectories of various points on the mechanism in the chassis (stationary link) reference frame. From the foot point trajectory, the step length is shown to vary linearly while step height varies non-linearly with change in crank radius. A dynamic model for the Jansen leg mechanism is proposed using bond graph approach with modulated multiport transformers. For given ground reaction force pattern and crank angular speed, this model helps determine the motor torque profile as well as the link and joint stresses. The model can therefore be used to rate the actuator torque and in design of the hardware and controller for such a system. The kinematics of the mechanism can also be obtained from this dynamic model. The proposed model is thus a useful tool for analysis and design of systems based on the Jansen leg mechanism. (C) 2015 Elsevier B.V. All rights reserved.

A Scalable High Throughput Firewall in FPGA

High end network security applications demand high speed operation and large rule set support. Packet classification is the core functionality that demands high throughput in such applications. This paper proposes a packet classification architecture to meet such high throughput. We have implemented a Firewall with this architecture in reconflgurable hardware. We propose an extension to Distributed Crossproducting of Field Labels (DCFL) technique to achieve scalable and high performance architecture. The implemented Firewall takes advantage of inherent structure and redundancy of rule set by using our DCFL Extended (DCFLE) algorithm. The use of DCFLE algorithm results in both speed and area improvement when it is implemented in hardware. Although we restrict ourselves to standard 5-tuple matching, the architecture supports additional fields. High throughput classification invariably uses Ternary Content Addressable Memory (TCAM) for prefix matching, though TCAM fares poorly in terms of area and power efficiency. Use of TCAM for port range matching is expensive, as the range to prefix conversion results in large number of prefixes leading to storage inefficiency. Extended TCAM (ETCAM) is fast and the most storage efficient solution for range matching. We present for the first time a reconfigurable hardware implementation of ETCAM. We have implemented our Firewall as an embedded system on Virtex-II Pro FPGA based platform, running Linux with the packet classification in hardware. The Firewall was tested in real time with 1 Gbps Ethernet link and 128 sample rules. The packet classification hardware uses a quarter of logic resources and slightly over one third of memory resources of XC2VP30 FPGA. It achieves a maximum classification throughput of 50 million packet/s corresponding to 16 Gbps link rate for the worst case packet size. The Firewall rule update involves only memory re-initialization in software without any hardware change.

A Jacobian-Based Algorithm for Planning Attitude Maneuvers Using Forward and Reverse Rotations

Algorithms for planning quasistatic attitude maneuvers based on the Jacobian of the forward kinematic mapping of fully-reversed (FR) sequences of rotations are proposed in this paper. An FR sequence of rotations is a series of finite rotations that consists of initial rotations about the axes of a body-fixed coordinate frame and subsequent rotations that undo these initial rotations. Unlike the Jacobian of conventional systems such as a robot manipulator, the Jacobian of the system manipulated through FR rotations is a null matrix at the identity, which leads to a total breakdown of the traditional Jacobian formulation. Therefore, the Jacobian algorithm is reformulated and implemented so as to synthesize an FR sequence for a desired rotational displacement. The Jacobian-based algorithm presented in this paper identifies particular six-rotation FR sequences that synthesize desired orientations. We developed the single-step and the multiple-step Jacobian methods to accomplish a given task using six-rotation FR sequences. The single-step Jacobian method identifies a specific FR sequence for a given desired orientation and the multiple-step Jacobian algorithm synthesizes physically feasible FR rotations on an optimal path. A comparison with existing algorithms verifies the fast convergence ability of the Jacobian-based algorithm. Unlike closed-form solutions to the inverse kinematics problem, the Jacobian-based algorithm determines the most efficient FR sequence that yields a desired rotational displacement through a simple and inexpensive numerical calculation. The procedure presented here is useful for those motion planning problems wherein the Jacobian is singular or null.

N-Phenylnicotinamide

In the title compound, C12H10N2O, the dihedral angle between the phenyl and pyridine rings is 64.81 (1)degrees. Intermolecular N-H center dot center dot center dot O hydrogen bonds connect the molecules into chains running along the b axis.

A Scalable High Throughput Firewall in FPGA

High end network security applications demand high speed operation and large rule set support. Packet classification is the core functionality that demands high throughput in such applications. This paper proposes a packet classification architecture to meet such high throughput. We have Implemented a Firewall with this architecture in reconfigurable hardware. We propose an extension to Distributed Crossproducting of Field Labels (DCFL) technique to achieve scalable and high performance architecture. The implemented Firewall takes advantage of inherent structure and redundancy of rule set by using, our DCFL Extended (DCFLE) algorithm. The use of DCFLE algorithm results In both speed and area Improvement when It is Implemented in hardware. Although we restrict ourselves to standard 5-tuple matching, the architecture supports additional fields.High throughput classification Invariably uses Ternary Content Addressable Memory (TCAM) for prefix matching, though TCAM fares poorly In terms of area and power efficiency. Use of TCAM for port range matching is expensive, as the range to prefix conversion results in large number of prefixes leading to storage inefficiency. Extended TCAM (ETCAM) is fast and the most storage efficient solution for range matching. We present for the first time a reconfigurable hardware Implementation of ETCAM. We have implemented our Firewall as an embedded system on Virtex-II Pro FPGA based platform, running Linux with the packet classification in hardware. The Firewall was tested in real time with 1 Gbps Ethernet link and 128 sample rules. The packet classification hardware uses a quarter of logic resources and slightly over one third of memory resources of XC2VP30 FPGA. It achieves a maximum classification throughput of 50 million packet/s corresponding to 16 Gbps link rate for file worst case packet size. The Firewall rule update Involves only memory re-initialiization in software without any hardware change.

An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V, E). The expected running time of our algorithm is (O) over tilde (mc) where vertical bar E vertical bar = m and c is the maximum u-v edge connectivity, where u, v is an element of V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n - 1; so the expected run-ning time of our algorithm for simple unweighted graphs is (O) over tilde (mn). All the algorithms currently known for constructing a Gomory-Hu tree [8, 9] use n - 1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest (O) over tilde (n(20/9)) max flow algorithm due to Karger and Levine[11] yields the current best running time of (O) over tilde (n(20/9)n) for Gomory-Hu tree construction on simple unweighted graphs with m edges and n vertices. Thus we present the first (O) over tilde (mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs. We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S subset of V can be reused for computing a minimum Steiner cut for certain Steiner sets S' subset of S.

Performance of graphic aluminium particulate composite materials

Friction characteristics of journal bearings made from cast graphic aluminum particulate composite alloy were determined under mixed lubrication and compared with those of the base alloy (without graphite) and leaded phosphor bronze. All three materials ran without seizure while the performance of the particulate composite and leaded phosphor bronze improved with running. Temperature rise in the journal bearing under mixed/boundary lubrication was also measured. It was found that with 0.3D/1000 to 1.5D/1000 clearance and a low lubrication rate (typical value for a bearing of diameter 35 mm × length 35 mm is 80 mm3/min) and at a PV value of 73 × 106 Nm m−2 min−1 graphitic aluminium alloy journal bearings operate satisfactorily without seizure and excessive temperature rise. In comparison, the bronze bearings, with all the other parameters remaining the same, could not run without excessive temperature rise at clearances below D/1000 at lubrication rates lower than 200 mm3/min

Comprehensive Path-sensitive Data-flow Analysis

Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex control-flow. W initially perform data-flow analysis to determine those control-flow merges which cause the loss in data-flow analysis precision. The control-flow graph of the program is then restructured such that performing data-flow analysis on the resulting restructured graph gives more precise results. The proposed framework is both simple, involving the familiar notion of product automata, and also general, since it is applicable to any forward data-flow analysis. Apart from proving that our restructuring process is correct, we also show that restructuring is effective in that it necessarily leads to more optimization opportunities. Furthermore, the framework handles the trade-off between the increase in data-flow precision and the code size increase inherent in the restructuring. We show that determining an optimal restructuring is NP-hard, and propose and evaluate a greedy strategy. The framework has been implemented in the Scale research compiler, and instantiated for the specific problem of Constant Propagation. On the SPECINT 2000 benchmark suite we observe an average speedup of 4% in the running times over Wegman-Zadeck conditional constant propagation algorithm and 2% over a purely path profile guided approach.