Analysis of Transverse Shear Strains in Pre-Twisted Thick Beams using Variational Asymptotic Method

The cross-sectional stiffness matrix is derived for a pre-twisted, moderately thick beam made of transversely isotropic materials and having rectangular cross sections. An asymptotically-exact methodology is used to model the anisotropic beam from 3-D elasticity, without any further assumptions. The beam is allowed to have large displacements and rotations, but small strain is assumed. The strain energy is computed making use of the beam constitutive law and kinematical relations derived with the inclusion of geometrical nonlinearities and an initial twist. The energy functional is minimized making use of the Variational Asymptotic Method (VAM), thereby reducing the cross section to a point on the beam reference line with appropriate properties, forming a 1-D constitutive law. VAM is a mathematical technique employed in the current problem to rigorously split the 3-D analysis of beams into two: a 2-D analysis over the beam cross-sectional domain, which provides a compact semi-analytical form of the properties of the cross sections, and a nonlinear 1-D analysis of the beam reference curve. In this method, as applied herein, the cross-sectional analysis is performed asymptotically by taking advantage of a material small parameter and two geometric small parameters. 3-D strain components are derived using kinematics and arranged in orders of the small parameters. Closed-form expressions are derived for the 3-D non-linear warping and stress fields. Warping functions are obtained by the minimization of strain energy subject to certain set of constraints that render the 1-D strain measures well-defined. The zeroth-order 3-D warping field thus yielded is then used to integrate the 3-D strain energy density over the cross section, resulting in the 1-D strain energy density, which in turn helps identify the corresponding cross-sectional stiffness matrix. The model is capable of predicting interlaminar and transverse shear stresses accurately up to first order.

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.

Two player game variant of the Erdos-Szekeres problem

The classical Erdos-Szekeres theorem states that a convex k-gon exists in every sufficiently large point set. This problem has been well studied and finding tight asymptotic bounds is considered a challenging open problem. Several variants of the Erdos-Szekeres problem have been posed and studied in the last two decades. The well studied variants include the empty convex k-gon problem, convex k-gon with specified number of interior points and the chromatic variant. In this paper, we introduce the following two player game variant of the Erdos-Szekeres problem: Consider a two player game where each player playing in alternate turns, place points in the plane. The objective of the game is to avoid the formation of the convex k-gon among the placed points. The game ends when a convex k-gon is formed and the player who placed the last point loses the game. In our paper we show a winning strategy for the player who plays second in the convex 5-gon game and the empty convex 5-gon game by considering convex layer configurations at each step. We prove that the game always ends in the 9th step by showing that the game reaches a specific set of configurations.

ASYMPTOTIC PRESERVING SCHEME FOR A KINETIC MODEL DESCRIBING IN COMPRESSIBLE FLUIDS

The kinetic theory of fluid turbulence modeling developed by Degond and Lemou in 7] is considered for further study, analysis and simulation. Starting with the Boltzmann like equation representation for turbulence modeling, a relaxation type collision term is introduced for isotropic turbulence. In order to describe some important turbulence phenomenology, the relaxation time incorporates a dependency on the turbulent microscopic energy and this makes difficult the construction of efficient numerical methods. To investigate this problem, we focus here on a multi-dimensional prototype model and first propose an appropriate change of frame that makes the numerical study simpler. Then, a numerical strategy to tackle the stiff relaxation source term is introduced in the spirit of Asymptotic Preserving Schemes. Numerical tests are performed in a one-dimensional framework on the basis of the developed strategy to confirm its efficiency.

Wave propagation in a 2D nonlinear structural acoustic waveguide using asymptotic expansions of wavenumbers

Nonlinear acoustic wave propagation in an infinite rectangular waveguide is investigated. The upper boundary of this waveguide is a nonlinear elastic plate, whereas the lower boundary is rigid. The fluid is assumed to be inviscid with zero mean flow. The focus is restricted to non-planar modes having finite amplitudes. The approximate solution to the acoustic velocity potential of an amplitude modulated pulse is found using the method of multiple scales (MMS) involving both space and time. The calculations are presented up to the third order of the small parameter. It is found that at some frequencies the amplitude modulation is governed by the Nonlinear Schrodinger equation (NLSE). The first objective here is to study the nonlinear term in the NLSE. The sign of the nonlinear term in the NLSE plays a role in determining the stability of the amplitude modulation. Secondly, at other frequencies, the primary pulse interacts with its higher harmonics, as do two or more primary pulses with their resultant higher harmonics. This happens when the phase speeds of the waves match and the objective is to identify the frequencies of such interactions. For both the objectives, asymptotic coupled wavenumber expansions for the linear dispersion relation are required for an intermediate fluid loading. The novelty of this work lies in obtaining the asymptotic expansions and using them for predicting the sign change of the nonlinear term at various frequencies. It is found that when the coupled wavenumbers approach the uncoupled pressure-release wavenumbers, the amplitude modulation is stable. On the other hand, near the rigid-duct wavenumbers, the amplitude modulation is unstable. Also, as a further contribution, these wavenumber expansions are used to identify the frequencies of the higher harmonic interactions. And lastly, the solution for the amplitude modulation derived through the MMS is validated using these asymptotic expansions. (C) 2015 Elsevier Ltd. All rights reserved.

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.

Asymptotic behavior and interpretation of virtual states: The effects of confinement and of basis sets

A real-space high order finite difference method is used to analyze the effect of spherical domain size on the Hartree-Fock (and density functional theory) virtual eigenstates. We show the domain size dependence of both positive and negative virtual eigenvalues of the Hartree-Fock equations for small molecules. We demonstrate that positive states behave like a particle in spherical well and show how they approach zero. For the negative eigenstates, we show that large domains are needed to get the correct eigenvalues. We compare our results to those of Gaussian basis sets and draw some conclusions for real-space, basis-sets, and plane-waves calculations. (C) 2016 AIP Publishing LLC.

Social optimum in social groups with give-and-take criterion

We consider a Social Group' of networked nodes, seeking a universe' of segments. Each node has a subset of the universe and access to an expensive resource for downloading data. Nodes can also acquire the universe by exchanging copies of segments among themselves, at low cost, using inter-node links. While exchanges over inter-node links ensure minimum cost, some nodes in the group try to exploit the system. We term such nodes as non-reciprocating nodes' and prohibit such behavior by proposing the give-and-take' criterion, where exchange is allowed if each node has segments unavailable with the other. Under this criterion, we consider the problem of maximizing the number of nodes with the universe at the end of local exchanges. First, we present a randomized algorithm that is shown to be optimal in the asymptotic regime. Then, we present greedy links algorithm, which performs well for most of the scenarios and yields an optimal result when the number of nodes is four. The polygon algorithm is proposed, which yields an optimal result when each of the nodes has a unique segment. After presenting some intuitive algorithms (e.g., greedy incremental algorithm and rarest first algorithm), we compare the performances of all proposed algorithms with the optimal. Copyright (c) 2015 John Wiley & Sons, Ltd.

A systematic asymptotic approach to determine the dispersion characteristics of structural-acoustic waveguides with arbitrary fluid loading

Structural-acoustic waveguides of two different geometries are considered: a 2-D rectangular and a circular cylindrical geometry. The objective is to obtain asymptotic expansions of the fluid-structure coupled wavenumbers. The required asymptotic parameters are derived in a systematic way, in contrast to the usual intuitive methods used in such problems. The systematic way involves analyzing the phase change of a wave incident on a single boundary of the waveguide. Then, the coupled wavenumber expansions are derived using these asymptotic parameters. The phase change is also used to qualitatively demarcate the dispersion diagram as dominantly structure-originated, fluid originated or fully coupled. In contrast to intuitively obtained asymptotic parameters, this approach does not involve any restriction on the material and geometry of the structure. The derived closed-form solutions are compared with the numerical solutions and a good match is obtained. (C) 2016 Elsevier Ltd. All rights reserved.