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

Optimal Color Range Reporting in One Dimension

Color (or categorical) range reporting is a variant of the orthogonal range reporting problem in which every point in the input is assigned a \emph{color}. While the answer to an orthogonal point reporting query contains all points in the query range $Q$, the answer to a color reporting query contains only distinct colors of points in $Q$. In this paper we describe an O(N)-space data structure that answers one-dimensional color reporting queries in optimal $O(k+1)$ time, where $k$ is the number of colors in the answer and $N$ is the number of points in the data structure. Our result can be also dynamized and extended to the external memory model

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

Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints

We introduce a new structure for a set of points in the plane and an angle $\alpha$, which is similar in flavor to a bounded-degree MST. We name this structure $\alpha$-MST. Let $P$ be a set of points in the plane and let $0 < \alpha \le 2\pi$ be an angle. An $\alpha$-ST of $P$ is a spanning tree of the complete Euclidean graph induced by $P$, with the additional property that for each point $p \in P$, the smallest angle around $p$ containing all the edges adjacent to $p$ is at most $\alpha$. An $\alpha$-MST of $P$ is then an $\alpha$-ST of $P$ of minimum weight. For $\alpha < \pi/3$, an $\alpha$-ST does not always exist, and, for $\alpha \ge \pi/3$, it always exists. In this paper, we study the problem of computing an $\alpha$-MST for several common values of $\alpha$. Motivated by wireless networks, we formulate the problem in terms of directional antennas. With each point $p \in P$, we associate a wedge $W_p$ of angle $\alpha$ and apex $p$. The goal is to assign an orientation and a radius $r_p$ to each wedge $W_p$, such that the resulting graph is connected and its MST is an $\alpha$-MST. (We draw an edge between $p$ and $q$ if $p \in W_q$, $q \in W_p$, and $|pq| \le r_p, r_q$.) Unsurprisingly, the problem of computing an $\alpha$-MST is NP-hard, at least for $\alpha=\pi$ and $\alpha=2\pi/3$. We present constant-factor approximation algorithms for $\alpha = \pi/2, 2\pi/3, \pi$. One of our major results is a surprising theorem for $\alpha = 2\pi/3$, which, besides being interesting from a geometric point of view, has important applications. For example, the theorem guarantees that given any set $P$ of $3n$ points in the plane and any partitioning of the points into $n$ triplets, one can orient the wedges of each triplet {\em independently}, such that the graph induced by $P$ is connected. We apply the theorem to the {\em antenna conversion} problem