Cyclic response of hollow and concrete-filled circular hollow section braces

yesThe behaviour of seismic-resistant buildings relies heavily upon the inclusion of energy dissipating devices. For concentrically-braced frames, this function is accomplished by diagonal bracing members whose performance depends upon both cross-sectional properties and global slenderness. Traditionally preferred rectangular hollow sections are susceptible to local buckling, particularly in cold-formed tubes, owing to the residual stresses from manufacture. This paper explores the response of hollow and concrete-filled circular tubes under cyclic axial loading. The uniformity of the circular cross-section provides superior structural efficiency over rectangular sections and can be further optimised by the inclusion of concrete infill. A series of experiments was conducted on filled and hollow specimens to assess the merit of the composite section. Comparisons were drawn between hot-finished and cold-formed sections to establish the influence of fabrication on member performance. Two specimen lengths were utilised to assess the influence of non-dimensional slenderness. Parameters such as ductility, energy dissipation, tensile strength and compressive resistance are presented and compared with design codes and empirically derived predictions

Structural response of concrete-filled elliptical steel hollow sections under eccentric compression

The purpose of this research is to examine the behaviour of elliptical concrete-filled steel tubular stub columns under a combination of axial force and bending moment. Most of the research carried out to date involving concrete-filled steel sections has focussed on circular and rectangular tubes, with each shape exhibiting distinct behaviour. The degree of concrete confinement provided by the hollow section wall has been studied under pure compression but remains ambiguous for combined compressive and bending loads, with no current design provision for this loading combination. To explore the structural behaviour, laboratory tests were carried out using eight stub columns of two different tube wall thicknesses and applying axial compression under various eccentricities. Moment-rotation relationships were produced for each specimen to establish the influence of cross-section dimension and axis of bending on overall response. Full 3D finite element models were developed, comparing the effect of different material constitutive models, until good agreement was found. Finally, analytical interaction curves were generated assuming plastic behaviour and compared with the experimental and finite element results. Ground work provided from these tests paves the way for the development of future design guidelines on the member level

Bringing Order to Special Cases of Klee's Measure Problem

Klee's Measure Problem (KMP) asks for the volume of the union of n axis-aligned boxes in d-space. Omitting logarithmic factors, the best algorithm has runtime O*(n^{d/2}) [Overmars,Yap'91]. There are faster algorithms known for several special cases: Cube-KMP (where all boxes are cubes), Unitcube-KMP (where all boxes are cubes of equal side length), Hypervolume (where all boxes share a vertex), and k-Grounded (where the projection onto the first k dimensions is a Hypervolume instance). In this paper we bring some order to these special cases by providing reductions among them. In addition to the trivial inclusions, we establish Hypervolume as the easiest of these special cases, and show that the runtimes of Unitcube-KMP and Cube-KMP are polynomially related. More importantly, we show that any algorithm for one of the special cases with runtime T(n,d) implies an algorithm for the general case with runtime T(n,2d), yielding the first non-trivial relation between KMP and its special cases. This allows to transfer W[1]-hardness of KMP to all special cases, proving that no n^{o(d)} algorithm exists for any of the special cases under reasonable complexity theoretic assumptions. Furthermore, assuming that there is no improved algorithm for the general case of KMP (no algorithm with runtime O(n^{d/2 - eps})) this reduction shows that there is no algorithm with runtime O(n^{floor(d/2)/2 - eps}) for any of the special cases. Under the same assumption we show a tight lower bound for a recent algorithm for 2-Grounded [Yildiz,Suri'12].Comment: 17 page

Real space first-principles derived semiempirical pseudopotentials applied to tunneling magnetoresistance

In this letter we present a real space density functional theory (DFT) localized basis set semi-empirical pseudopotential (SEP) approach. The method is applied to iron and magnesium oxide, where bulk SEP and local spin density approximation (LSDA) band structure calculations are shown to agree within approximately 0.1 eV. Subsequently we investigate the qualitative transferability of bulk derived SEPs to Fe/MgO/Fe tunnel junctions. We find that the SEP method is particularly well suited to address the tight binding transferability problem because the transferability error at the interface can be characterized not only in orbital space (via the interface local density of states) but also in real space (via the system potential). To achieve a quantitative parameterization, we introduce the notion of ghost semi-empirical pseudopotentials extracted from the first-principles calculated Fe/MgO bonding interface. Such interface corrections are shown to be particularly necessary for barrier widths in the range of 1 nm, where interface states on opposite sides of the barrier couple effectively and play a important role in the transmission characteristics. In general the results underscore the need for separate tight binding interface and bulk parameter sets when modeling conduction through thin heterojunctions on the nanoscale.Comment: Submitted to Journal of Applied Physic

Succinct Indices for Range Queries with applications to Orthogonal Range Maxima

We consider the problem of preprocessing $N$ points in 2D, each endowed with a priority, to answer the following queries: given a axis-parallel rectangle, determine the point with the largest priority in the rectangle. Using the ideas of the \emph{effective entropy} of range maxima queries and \emph{succinct indices} for range maxima queries, we obtain a structure that uses O(N) words and answers the above query in $O(\log N \log \log N)$ time. This is a direct improvement of Chazelle's result from FOCS 1985 for this problem -- Chazelle required $O(N/\epsilon)$ words to answer queries in $O((\log N)^{1+\epsilon})$ time for any constant $\epsilon > 0$.Comment: To appear in ICALP 201

Solving Complex Logistics Problems with Multi-Artificial Intelligent System

The economy, which has become more information intensive, more global and more technologically dependent, is undergoing dramatic changes. The role of logistics is also becoming more and more important. In logistics, the objective of service providers is to fulfill all customers’ demands while adapting to the dynamic changes of logistics networks so as to achieve a higher degree of customer satisfaction and therefore a higher return on investment. In order to provide high quality service, knowledge and information sharing among departments becomes a must in this fast changing market environment. In particular, artificial intelligence (AI) technologies have achieved significant attention for enhancing the agility of supply chain management, as well as logistics operations. In this research, a multi-artificial intelligence system, named Integrated Intelligent Logistics System (IILS) is proposed. The objective of IILS is to provide quality logistics solutions to achieve high levels of service performance in the logistics industry. The new feature of this agile intelligence system is characterized by the incorporation of intelligence modules through the capabilities of the case-based reasoning, multi-agent, fuzzy logic and artificial neural networks, achieving the optimization of the performance of organizations

Selection from read-only memory with limited workspace

Given an unordered array of $N$ elements drawn from a totally ordered set and an integer $k$ in the range from $1$ to $N$, in the classic selection problem the task is to find the $k$-th smallest element in the array. We study the complexity of this problem in the space-restricted random-access model: The input array is stored on read-only memory, and the algorithm has access to a limited amount of workspace. We prove that the linear-time prune-and-search algorithm---presented in most textbooks on algorithms---can be modified to use $\Theta(N)$ bits instead of $\Theta(N)$ words of extra space. Prior to our work, the best known algorithm by Frederickson could perform the task with $\Theta(N)$ bits of extra space in $O(N \lg^{*} N)$ time. Our result separates the space-restricted random-access model and the multi-pass streaming model, since we can surpass the $\Omega(N \lg^{*} N)$ lower bound known for the latter model. We also generalize our algorithm for the case when the size of the workspace is $\Theta(S)$ bits, where $\lg^3{N} \leq S \leq N$. The running time of our generalized algorithm is $O(N \lg^{*}(N/S) + N (\lg N) / \lg{} S)$, slightly improving over the $O(N \lg^{*}(N (\lg N)/S) + N (\lg N) / \lg{} S)$ bound of Frederickson's algorithm. To obtain the improvements mentioned above, we developed a new data structure, called the wavelet stack, that we use for repeated pruning. We expect the wavelet stack to be a useful tool in other applications as well.Comment: 16 pages, 1 figure, Preliminary version appeared in COCOON-201

Globally Anisotropic High Porosity Silica Aerogels

We discuss two methods by which high porosity silica aerogels can be engineered to exhibit global anisotropy. First, anisotropy can be introduced with axial strain. In addition, intrinsic anisotropy can result during growth and drying stages and, suitably controlled, it can be correlated with preferential radial shrinkage in cylindrical samples. We have performed small angle X-ray scattering (SAXS) to characterize these two types of anisotropy. We show that global anisotropy originating from either strain or shrinkage leads to optical birefringence and that optical cross-polarization studies are a useful characterization of the uniformity of the imposed global anisotropy.Comment: 18 pages, 14 figures, submitted to Journal of Non-Crystalline Solid

An oncogenic role for sphingosine kinase 2

While both human sphingosine kinases (SK1 and SK2) catalyze the generation of the pleiotropic signaling lipid sphingosine 1-phosphate, these enzymes appear to be functionally distinct. SK1 has well described roles in promoting cell survival, proliferation and neoplastic transformation. The roles of SK2, and its contribution to cancer, however, are much less clear. Some studies have suggested an antiproliferative/ pro-apoptotic function for SK2, while others indicate it has a prosurvival role and its inhibition can have anti-cancer effects. Our analysis of gene expression data revealed that SK2 is upregulated in many human cancers, but only to a small extent (up to 2.5-fold over normal tissue). Based on these findings, we examined the effect of different levels of cellular SK2 and showed that high-level overexpression reduced cell proliferation and survival, and increased cellular ceramide levels. In contrast, however, low-level SK2 overexpression promoted cell survival and proliferation, and induced neoplastic transformation in vivo. These findings coincided with decreased nuclear localization and increased plasma membrane localization of SK2, as well as increases in extracellular S1P formation. Hence, we have shown for the first time that SK2 can have a direct role in promoting oncogenesis, supporting the use of SK2-specific inhibitors as anti-cancer agents.Heidi A. Neubauer, Duyen H. Pham, Julia R. Zebol, Paul A.B. Moretti, Amanda L. Peterson, Tamara M. Leclercq, Huasheng Chan, Jason A. Powell, Melissa R. Pitman, Michael S. Samuel, Claudine S. Bonder, Darren J. Creek, Briony L. Gliddon and Stuart M. Pitso