Study on ride comfort assessment of multiple occupants using lumped parameter analysis

Growing consumer expectations continue to fuel further advancements in vehicle ride comfort analysis including development of a comprehensive tool capable of aiding the understanding of ride comfort. To date, most of the work on biodynamic responses of human body in the context of ride comfort mainly concentrates on driver or a designated occupant and therefore leaves the scope for further work on ride comfort analysis covering a larger number of occupants with detailed modeling of their body segments. In the present study, governing equations of a 13-DOF (degrees-of-freedom) lumped parameter model (LPM) of a full car with seats (7-DOF without seats) and a 7-DOF occupant model, a linear version of an earlier non-linear occupant model, are presented. One or more occupant models can be coupled with the vehicle model resulting into a maximum of 48-DOF LPM for a car with five occupants. These multi-occupant models can be formulated in a modular manner and solved efficiently using MATLAB/SIMULINK for a given transient road input. The vehicle model and the occupant model are independently verified by favorably comparing computed dynamic responses with published data. A number of cases with different dispositions of occupants in a small car are analyzed using the current modular approach thereby underscoring its potential for efficient ride quality assessment and design of suspension systems.

Recent Seismicity in India and Adjoining Regions

In the present work, historical and instrumental seismicity data of India and its adjoining areas (within 300km from Indian political boundary) are compiled to form the earthquake catalog for the country covering the period from 1505 to 2009. The initial catalogue consisted of about 139563 earthquake events and after declustering,the total number of events obtained was 61315. Region specific earthquake magnitude scaling relations correlating different magnitude scales were achieved and a homogenous earthquake catalogue in moment magnitude (MW) scale was developed for the region. This paper also presents the results of the use of Geographic Information Systems (GIS) to prepare a digitized seismic source map of India. The latest earthquake data were superimposed on the digitized source map to get a final Seismotectonic map of India. The study area has been divided into 1225 grid points (approximately 110km×110km) and the seismicity analysis has been done to get the spatial variation of seismicity parameters ‘a’ and ‘b’ across the country. The homogenized earthquake catalogue with the event details is listed in the website http://civil.iisc.ernet.in/~sreevals/resource.htm

Impact dynamics of high Weber number drops on chemically modified metallic surfaces

Hydrophobic/superhydrophobic metallic surfaces prepared via chemical treatment are encountered in many industrial scenarios involving the impingement of spray droplets. The effectiveness of such surfaces is understood through the analysis of droplet impact experiments. In the present study, three target surfaces with aluminum (Al-6061) as base material-acid-etched, Octadecyl Trichloro Silane (OTS) coated, and acid-etched plus OTS-coated-were prepared. Experiments on the impact of inertia dominated water drops on these chemically modified aluminum surfaces were carried out with the objective to highlight the effect of chemical treatment on the target surfaces on key sub-processes occurring in drop impact phenomenon. High speed videos of the entire drop impact dynamics were captured at three Weber number (We) conditions representative of high We (We > 200) regime. During the early stages of drop spreading, the drop impact resulted in ejection of secondary droplets from spreading drop front on the etched surfaces resembling prompt splash on rough surfaces whereas no such splashing was observable on untreated aluminum surface. Prominent development of undulations (fingers) were observed at the rim of drop spreading on the etched surfaces; between the etched surfaces the OTS-coated surface showed a subdued development of fingers than the uncoated surface. The impacted drops showed intense receding on OTS-coated surfaces whereas on the etched surface a highly irregular receding, with drop liquid sticking to the surface, was observed. Quantitative analyses were performed to reveal the effect of target surface characteristics on drop impact parameters such as temporal variation of spread factor of drop lamella, temporal variation of average finger length during spreading phase, maximum drop spreading, time taken to attain maximum spreading, sensitivity of maximum spreading to We, number of fingers at maximum spreading, and average receding velocity of drop lamella. Existing models for maximum drop spreading showed reasonably good agreement with the experimental measurements on the target surfaces except the acid-etched surface. (C) 2014 Elsevier B.V. All rights reserved.

Rainbow Connection Number of Graph Power and Graph Products

Rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges so that every pair of vertices is connected by at least one path in which no two edges are colored the same (note that the coloring need not be proper). In this paper we study the rainbow connection number with respect to three important graph product operations (namely the Cartesian product, the lexicographic product and the strong product) and the operation of taking the power of a graph. In this direction, we show that if G is a graph obtained by applying any of the operations mentioned above on non-trivial graphs, then rc(G) a parts per thousand currency sign 2r(G) + c, where r(G) denotes the radius of G and . In general the rainbow connection number of a bridgeless graph can be as high as the square of its radius 1]. This is an attempt to identify some graph classes which have rainbow connection number very close to the obvious lower bound of diameter (and thus the radius). The bounds reported are tight up to additive constants. The proofs are constructive and hence yield polynomial time -factor approximation algorithms.

On the Maximum Number of Linearly Independent Cycles and Paths in a Network

Central to network tomography is the problem of identifiability, the ability to identify internal network characteristics uniquely from end-to-end measurements. This problem is often underconstrained even when internal network characteristics such as link delays are modeled as additive constants. While it is known that the network topology can play a role in determining the extent of identifiability, there is a lack in the fundamental understanding of being able to quantify it for a given network. In this paper, we consider the problem of identifying additive link metrics in an arbitrary undirected network using measurement nodes and establishing paths/cycles between them. For a given placement of measurement nodes, we define and derive the ``link rank'' of the network-the maximum number of linearly independent cycles/paths that may be established between the measurement nodes. We achieve this in linear time. The link rank helps quantify the exact extent of identifiability in a network. We also develop a quadratic time algorithm to compute a set of cycles/paths that achieves the maximum rank.

Equilibrium and equivariant triangulations of some small covers with minimum number of vertices

Small covers were introduced by Davis and Januszkiewicz in 1991. We introduce the notion of equilibrium triangulations for small covers. We study equilibrium and vertex minimal 4-equivariant triangulations of 2-dimensional small covers. We discuss vertex minimal equilibrium triangulations of RP3#RP3, S-1 x RP2 and a nontrivial S-1 bundle over RP2. We construct some nice equilibrium triangulations of the real projective space RPn with 2(n) + n 1 vertices. The main tool is the theory of small covers.

Behaviour of turbulent Prandtl/Schmidt number in compressible mixing layer

The behaviour of turbulent Prandtl/Schmidt number is explored through the model-free simulation results. It has been observed that compressibility affects the Reynolds scalar flux vectors. Reduced peak values are also observed for compressible convective Mach number mixing layer as compared with the incompressible convective Mach number counterpart, indicating a reduction in the mixing of enthalpy and species. Pr-t and Sc-t variations also indicate a reduction in mixing. It is observed that unlike the incompressible case, it is difficult to assign a constant value to these numbers due to their continuous variation in space. Modelling of Pr-t and Sc-t would be necessary to cater for this continuous spatial variation. However, the turbulent Lewis number is evaluated to be near unity for the compressible case, making it necessary to model only one of the Pr-t and Sc-t..

An estimate of the number of tropical tree species

The high species richness of tropical forests has long been recognized, yet there remains substantial uncertainty regarding the actual number of tropical tree species. Using a pantropical tree inventory database from closed canopy forests, consisting of 657,630 trees belonging to 11,371 species, we use a fitted value of Fisher's alpha and an approximate pantropical stem total to estimate the minimum number of tropical forest tree species to fall between similar to 40,000 and similar to 53,000, i.e., at the high end of previous estimates. Contrary to common assumption, the Indo-Pacific region was found to be as species-rich as the Neotropics, with both regions having a minimum of similar to 19,000-25,000 tree species. Continental Africa is relatively depauperate with a minimum of similar to 4,500-6,000 tree species. Very few species are shared among the African, American, and the Indo-Pacific regions. We provide a methodological framework for estimating species richness in trees that may help refine species richness estimates of tree-dependent taxa.

Unique Covering Problems with Geometric Sets

The Exact Cover problem takes a universe U of n elements, a family F of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) F' of size at most k such that each element is covered by exactly one set. The Unique Cover problem also takes the same input and decides whether there is a subfamily F' subset of F such that at least k of the elements F' covers are covered uniquely(by exactly one set). Both these problems are known to be NP-complete. In the parameterized setting, when parameterized by k, Exact Cover is W1]-hard. While Unique Cover is FPT under the same parameter, it is known to not admit a polynomial kernel under standard complexity-theoretic assumptions. In this paper, we investigate these two problems under the assumption that every set satisfies a given geometric property Pi. Specifically, we consider the universe to be a set of n points in a real space R-d, d being a positive integer. When d = 2 we consider the problem when. requires all sets to be unit squares or lines. When d > 2, we consider the problem where. requires all sets to be hyperplanes in R-d. These special versions of the problems are also known to be NP-complete. When parameterizing by k, the Unique Cover problem has a polynomial size kernel for all the above geometric versions. The Exact Cover problem turns out to be W1]-hard for squares, but FPT for lines and hyperplanes. Further, we also consider the Unique Set Cover problem, which takes the same input and decides whether there is a set cover which covers at least k elements uniquely. To the best of our knowledge, this is a new problem, and we show that it is NP-complete (even for the case of lines). In fact, the problem turns out to be W1]-hard in the abstract setting, when parameterized by k. However, when we restrict ourselves to the lines and hyperplanes versions, we obtain FPT algorithms.

Onset of plane layer magnetoconvection at low Ekman number

We study the onset of magnetoconvection between two infinite horizontal planes subject to a vertical magnetic field aligned with background rotation. In order to gain insight into the convection taking place in the Earth's tangent cylinder, we target regimes of asymptotically strong rotation. The critical Rayleigh number Ra-c and critical wavenumber a(c) are computed numerically by solving the linear stability problem in a systematic way, with either stress-free or no-slip kinematic boundary conditions. A parametric study is conducted, varying the Ekman number E (ratio of viscous to Coriolis forces) and the Elsasser number. (ratio of the Lorentz force to the Coriolis force). E is varied from 10(-9) to 10(-2) and. from 10(-3) to 1. For a wide range of thermal and magnetic Prandtl numbers, our results verify and confirm previous experimental and theoretical results showing the existence of two distinct unstable modes at low values of E-one being controlled by the magnetic field, the other being controlled by viscosity (often called the viscous mode). It is shown that oscillatory onset does not occur in the range of parameters we are interested in. Asymptotic scalings for the onset of these modes are numerically confirmed and their domain of validity is precisely quantified. We show that with no-slip boundary conditions, the asymptotic behavior is reached for E < 10(-6) and establish a map in the (E, Lambda) plane. We distinguish regions where convection sets in either through the magnetic mode or through the viscous mode. Our analysis gives the regime in which the transition between magnetic and viscous modes may be observed. We also show that within the asymptotic regime, the role played by the kinematic boundary conditions is minimal. (C) 2015 AIP Publishing LLC.

Size Effects on Strength in the Transition from Single-to-Polycrystalline Behavior

During the transition from single crystalline to polycrystalline behavior, the available data show the strength increasing or decreasing as the number of grains in a cross section is reduced. Tensile experiments were conducted on polycrystalline Ni with grain sizes (d) between 16 and 140 mu m and varying specimen thickness (t), covering a range of lambda (-t/d) between similar to 0.5 and 20. With a decrease in lambda, the data revealed a consistent trend of strength being independent of lambda at large lambda, an increase in strength, and then a decrease in strength. Microstructural studies revealed that lower constraints enabled easier rotation of the surface grains and texture evolution, independent of the specimen thickness. In specimen interiors, there was a greater ease of rotation in thinner samples. Measurements of misorientation deviations within grains revealed important differences in the specimen interiors. A simple model is developed taking into account the additional geometrically necessary dislocations due to variations in the behavior of surface and interior grains, leading to additional strengthening. A suitable combination of this strengthening and surface weakening can give rise to wide range of possibilities with a decrease in lambda, including weakening, strengthening, and strengthening and weakening.

Upper bound on cubicity in terms of boxicity for graphs of low chromatic number

The boxicity (respectively cubicity) of a graph G is the least integer k such that G can be represented as an intersection graph of axis-parallel k-dimensional boxes (respectively k-dimensional unit cubes) and is denoted by box(G) (respectively cub(G)). It was shown by Adiga and Chandran (2010) that for any graph G, cub(G) <= box(G) log(2) alpha(G], where alpha(G) is the maximum size of an independent set in G. In this note we show that cub(G) <= 2 log(2) X (G)] box(G) + X (G) log(2) alpha(G)], where x (G) is the chromatic number of G. This result can provide a much better upper bound than that of Adiga and Chandran for graph classes with bounded chromatic number. For example, for bipartite graphs we obtain cub(G) <= 2(box(G) + log(2) alpha(G)] Moreover, we show that for every positive integer k, there exist graphs with chromatic number k such that for every epsilon > 0, the value given by our upper bound is at most (1 + epsilon) times their cubicity. Thus, our upper bound is almost tight. (c) 2015 Elsevier B.V. All rights reserved.