Nonlinear geometric and material computational technique : higher-order element with refined plastic hinge approach

This paper addresses of the advanced computational technique of steel structures for both simulation capacities simultaneously; specifically, they are the higher-order element formulation with element load effect (geometric nonlinearities) as well as the refined plastic hinge method (material nonlinearities). This advanced computational technique can capture the real behaviour of a whole second-order inelastic structure, which in turn ensures the structural safety and adequacy of the structure. Therefore, the emphasis of this paper is to advocate that the advanced computational technique can replace the traditional empirical design approach. In the meantime, the practitioner should be educated how to make use of the advanced computational technique on the second-order inelastic design of a structure, as this approach is the future structural engineering design. It means the future engineer should understand the computational technique clearly; realize the behaviour of a structure with respect to the numerical analysis thoroughly; justify the numerical result correctly; especially the fool-proof ultimate finite element is yet to come, of which is competent in modelling behaviour, user-friendly in numerical modelling and versatile for all structural forms and various materials. Hence the high-quality engineer is required, who can confidently manipulate the advanced computational technique for the design of a complex structure but not vice versa.

Algebraic and geometric intersection numbers for free groups

We show that the algebraic intersection number of Scott and Swarup for splittings of free groups Coincides With the geometric intersection number for the sphere complex of the connected sum of copies of S-2 x S-1. (C) 2009 Elsevier B.V. All rights reserved.

GEODERM: geometric shape design system using an entity-relationship model

GEODERM, a microcomputer-based solid modeller, which incorporates the parametric object model, is discussed. The entity-relationship model, which is used to describe the conceptual schema of the geometric database, is also presented. Three of the four modules of GEODERM, which have been implemented are described in some detail. They are the Solid Definition Language (SDL), the Solid Manipulation Language (SML) and the User-System Interface.

Implications of geometric plasticity for maximizing photosynthesis in branching corals

Reef-building corals are an example of plastic photosynthetic organisms that occupy environments of high spatiotemporal variations in incident irradiance. Many phototrophs use a range of photoacclimatory mechanisms to optimize light levels reaching the photosynthetic units within the cells. In this study, we set out to determine whether phenotypic plasticity in branching corals across light habitats optimizes potential light utilization and photosynthesis. In order to do this, we mapped incident light levels across coral surfaces in branching corals and measured the photosynthetic capacity across various within-colony surfaces. Based on the field data and modelled frequency distribution of within-colony surface light levels, our results show that branching corals are substantially self-shaded at both 5 and 18 m, and the modal light level for the within-colony surface is 50 mu mol photons m(-2) s(-1). Light profiles across different locations showed that the lowest attenuation at both depths was found on the inner surface of the outermost branches, while the most self-shading surface was on the bottom side of these branches. In contrast, vertically extended branches in the central part of the colony showed no differences between the sides of branches. The photosynthetic activity at these coral surfaces confirmed that the outermost branches had the greatest change in sun- and shade-adapted surfaces; the inner surfaces had a 50 % greater relative maximum electron transport rate compared to the outer side of the outermost branches. This was further confirmed by sensitivity analysis, showing that branch position was the most influential parameter in estimating whole-colony relative electron transport rate (rETR). As a whole, shallow colonies have double the photosynthetic capacity compared to deep colonies. In terms of phenotypic plasticity potentially optimizing photosynthetic capacity, we found that at 18 m, the present coral colony morphology increased the whole-colony rETR, while at 5 m, the colony morphology decreased potential light utilization and photosynthetic output. This result of potential energy acquisition being underutilized in shallow, highly lit waters due to the shallow type morphology present may represent a trade-off between optimizing light capture and reducing light damage, as this type morphology can perhaps decrease long-term costs of and effect of photoinhibition. This may be an important strategy as opposed to adopting a type morphology, which results in an overall higher energetic acquisition. Conversely, it could also be that maximizing light utilization and potential photosynthetic output is more important in low-light habitats for Acropora humilis.

Using Mathematical Morphology for Geometric Music Retrieval

The usual task in music information retrieval (MIR) is to find occurrences of a monophonic query pattern within a music database, which can contain both monophonic and polyphonic content. The so-called query-by-humming systems are a famous instance of content-based MIR. In such a system, the user's hummed query is converted into symbolic form to perform search operations in a similarly encoded database. The symbolic representation (e.g., textual, MIDI or vector data) is typically a quantized and simplified version of the sampled audio data, yielding to faster search algorithms and space requirements that can be met in real-life situations. In this thesis, we investigate geometric approaches to MIR. We first study some musicological properties often needed in MIR algorithms, and then give a literature review on traditional (e.g., string-matching-based) MIR algorithms and novel techniques based on geometry. We also introduce some concepts from digital image processing, namely the mathematical morphology, which we will use to develop and implement four algorithms for geometric music retrieval. The symbolic representation in the case of our algorithms is a binary 2-D image. We use various morphological pre- and post-processing operations on the query and the database images to perform template matching / pattern recognition for the images. The algorithms are basically extensions to classic image correlation and hit-or-miss transformation techniques used widely in template matching applications. They aim to be a future extension to the retrieval engine of C-BRAHMS, which is a research project of the Department of Computer Science at University of Helsinki.

Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R-1 x R-2 x...x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a left perpendicular1 + 1/c log n right perpendicular(d-1) approximation ratio for any constant c >= 1 when d >= 2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard. We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in left perpendicular(Delta + 2) ln nright perpendicular dimensions, where Delta is the maximum degree of G. This algorithm implies that box(G) <= left perpendicular(Delta + 2) ln nright perpendicular for any graph G. Our bound is tight up to a factor of ln n. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree Delta, we show that for almost all graphs on n vertices, their boxicity is O(d(av) ln n) where d(av) is the average degree.

Shape effect on optimal geometric conditions in surface aeration systems

The performance of surface aeration systems, among other key design variables, depends upon the geometric parameters of the aeration tank. Efficient performance and scale up or scale down of the experimental results of an aeration ystem requires optimal geometric conditions. Optimal conditions refer to the conditions of maximum oxygen transfer rate, which assists in scaling up or down the system for ommercial utilization. The present work investigates the effect of an aeration tank's shape (unbaffled circular, baffled circular and unbaffled square) on oxygen transfer. Present results demonstrate that there is no effect of shape on the optimal geometric conditions for rotor position and rotor dimensions. This experimentation shows that circular tanks (baffled or unbaffled) do not have optimal geometric conditions for liquid transfer, whereas the square cross-section tank shows a unique geometric shape to optimize oxygen transfer.

A geometric approach for determining inner and exterior boundaries of workspaces of planar manipulators

In this paper a method to determine the internal and external boundaries of planar workspaces, represented with an ordered set of points, is presented. The sequence of points are grouped and can be interpreted to form a sequence of curves. Three successive curves are used for determining the instantaneous center of rotation for the second one of them. The two extremal points on the curve with respect to the instantaneous center are recognized as singular points. The chronological ordering of these singular points is used to generate the two envelope curves, which are potentially intersecting. Methods have been presented in the paper for the determination of the workspace boundary from the envelope curves. Strategies to deal with the manipulators with joint limits and various degenerate situations have also been discussed. The computational steps being completely geometric, the method does not require the knowledge about the manipulator's kinematics. Hence, it can be used for the workspace of arbitrary planar manipulators. A number of illustrative examples demonstrate the efficacy of the proposed method.

A geometric approach to stationary defect solutions in one space dimension

In this manuscript, we consider the impact of a small jump-type spatial heterogeneity on the existence of stationary localized patterns in a system of partial dierential equations in one spatial dimension...

Capturability analysis of a geometric guidance law in relative velocity space

In this paper, a relative velocity approach is used to analyze the capturability of a geometric guidance law. Point mass models are assumed for both the missile and the target. The speeds of the missile and target are assumed to remain constant throughout the engagement. Lateral acceleration, obtained from the guidance law, is applied to change the path of the missile. The kinematic equations for engagements in the horizontal plane are derived in the relative velocity space. Some analytical results for the capture region are obtained for non-maneuvering and maneuvering targets. For non-maneuvering targets it is enough for the navigation gain to be a constant to intercept the target, while for maneuvering targets a time varying navigation gain is needed for interception. These results are then verified through numerical simulations.

Manifestation of geometric frustration on magnetic and thermodynamic properties of the pyrochlores Sm2X2O7 (X=Ti,Zr)

We present here magnetization, specific heat, and Raman studies on single-crystalline specimens of the first pyrochlore member Sm2Ti2O7 of the rare-earth titanate series. Its analogous compound Sm2Zr2O7 in the rare-earth zirconate series is also investigated in the polycrystalline form. The Sm spins in Sm2Ti2O7 remain unordered down to at least T=0.5 K. The absence of magnetic ordering is attributed to very small values of exchange (θcw∼−0.26 K) and dipolar interaction (μeff∼0.15 μB) between the Sm3+ spins in this pyrochlore. In contrast, the pyrochlore Sm2Zr2O7 is characterized by a relatively large value of Sm-Sm spin exchange (θcw∼−10 K); however, long-range ordering of the Sm3+ spins is not established at least down to T=0.67 K due to frustration of the Sm3+ spins on the pyrochlore lattice. The ground state of Sm3+ ions in both pyrochlores is a well-isolated Kramers doublet. The higher-lying crystal field excitations are observed in the low-frequency region of the Raman spectra of the two compounds recorded at T=10 K. At higher temperatures, the magnetic susceptibility of Sm2Ti2O7 shows a broad maximum at T=140 K, while that of Sm2Zr2O7 changes monotonically. Whereas Sm2Ti2O7 is a promising candidate for investigating spin fluctuations on a frustrated lattice, as indicated by our data, the properties of Sm2Zr2O7 seem to conform to a conventional scenario where geometrical frustration of the spin excludes their long-range ordering.

Topological properties of the one dimensional exponential random geometric graph

In this article we study the one-dimensional random geometric (random interval) graph when the location of the nodes are independent and exponentially distributed. We derive exact results and limit theorems for the connectivity and other properties associated with this random graph. We show that the asymptotic properties of a graph with a truncated exponential distribution can be obtained using the exponential random geometric graph. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008.

A Geometric Algorithm for Learning Oblique Decision Trees

In this paper we present a novel algorithm for learning oblique decision trees. Most of the current decision tree algorithms rely on impurity measures to assess goodness of hyperplanes at each node. These impurity measures do not properly capture the geometric structures in the data. Motivated by this, our algorithm uses a strategy, based on some recent variants of SVM, to assess the hyperplanes in such a way that the geometric structure in the data is taken into account. We show through empirical studies that our method is effective.