Combined time- and space-resolved Raman spectrometer for the non-invasive depth profiling of chemical hazards

A time-resolved inverse spatially offset Raman spectrometer was constructed for depth profiling of Raman-active substances under both the lab and the field environments. The system operating principles and performance are discussed along with its advantages relative to traditional continuous wave spatially offset Raman spectrometer. The developed spectrometer uses a combination of space- and time-resolved detection in order to obtain high-quality Raman spectra from substances hidden behind coloured opaque surface layers, such as plastic and garments, with a single measurement. The time-gated spatially offset Raman spectrometer was successfully used to detect concealed explosives and drug precursors under incandescent and fluorescent background light as well as under daylight. The average screening time was 50 s per measurement. The excitation energy requirements were relatively low (20 mW) which makes the probe safe for screening hazardous substances. The unit has been designed with nanosecond laser excitation and gated detection, making it of lower cost and complexity than previous picosecond-based systems, to provide a functional platform for in-line or in-field sensing of chemical substances.

Capping computation time and storage requirements for appearance-based localization with CAT-SLAM

Appearance-based localization is increasingly used for loop closure detection in metric SLAM systems. Since it relies only upon the appearance-based similarity between images from two locations, it can perform loop closure regardless of accumulated metric error. However, the computation time and memory requirements of current appearance-based methods scale linearly not only with the size of the environment but also with the operation time of the platform. These properties impose severe restrictions on longterm autonomy for mobile robots, as loop closure performance will inevitably degrade with increased operation time. We present a set of improvements to the appearance-based SLAM algorithm CAT-SLAM to constrain computation scaling and memory usage with minimal degradation in performance over time. The appearance-based comparison stage is accelerated by exploiting properties of the particle observation update, and nodes in the continuous trajectory map are removed according to minimal information loss criteria. We demonstrate constant time and space loop closure detection in a large urban environment with recall performance exceeding FAB-MAP by a factor of 3 at 100% precision, and investigate the minimum computational and memory requirements for maintaining mapping performance.

Collecting in an urban context: Relationships between collections and space in the home

Collecting has become a popular hobby within Western society, with collectables including anything from ‘bottle tops’ to ‘skyscrapers’. As the nature and size of these collections can impact upon the use of space in the home, the purpose of this study is to explore the relationship between the collections, space in the home and the impacts on others. This qualitative study explores the experiences of 11 Australian collectors, investigating the motivations, practices and adaption techniques used within their urban home environment. The themes of sentimentality, sociability and spatial tensions, including physical, personal and use of space are discussed within the context of their home and family environments. Overall the practice of collecting objects is a complex, varied, sentimental and sociable activity, providing enjoyment, knowledge and friendships. Space can be a central consideration to the practice of collecting as collections shape and are shaped by the available space in a household.

Space and time efficiency of the forest-of-quadtrees representation

A forest of quadtrees is a refinement of a quadtree data structure that is used to represent planar regions. A forest of quadtrees provides space savings over regular quadtrees by concentrating vital information. The paper presents some of the properties of a forest of quadtrees and studies the storage requirements for the case in which a single 2m × 2m region is equally likely to occur in any position within a 2n × 2n image. Space and time efficiency are investigated for the forest-of-quadtrees representation as compared with the quadtree representation for various cases.

Spatial requirements of animals: Allometry and beyond

Space allowance is a major factor influencing animal welfare. For livestock, at least, it plays a critical role in profitability, yet there is little information on the amount of space that animals require. The amount of space an animal occupies as a consequence of its shape and size can be estimated using allometry; linear dimensions (L) can be expressed as L = kW1/3 and surface area (S) as S = kW2/3, where k = a constant and W = the weight of the animal. Such equations have been used to determine the amount of space needed by standing (area [m2] = 0.019W0.66) and lying (area [m2] = 0.027W0.67) animals. Limited studies on the lying down and standing up behaviors of pigs and cattle suggest that the amount of space required can be estimated by area (m2) = 0.047W0.66. Linear space required per animal for behaviors such as feeding or drinking from a trough can be estimated from 0.064W0.33, but in groups this requirement will be affected by social interactions among group members and the amount of competition for the resource. Determining the amount of space for groups of animals is complex, as the amount of useable space can vary with group size and by how group members share space in time. Some studies have been conducted on the way in which groups of domestic fowl use space, but overall, we know very little about the ways in which livestock time-share space, synchronicity in the performance of behaviors, and the effects of spatial restrictions on behavior and welfare.

Future learning landscapes for architectural education: Linking space, place, pedagogy, technology + context

Diversification and expansion of global higher education in the 21st century, has resulted in Learning Landscapes for architectural education that can no longer be sustained by the traditional model. Changes have resulted because of surging student numbers, extensions to traditional curricula, evolving competency standards and accreditation requirements, and modified geographical and pedagogical boundaries. The influx of available new technology has helped to democratise knowledge, transforming when, where and how learning takes place. Pressures on government funded higher education budgets highlight the need for a critical review of the current approach to the design and use of learning environments. Efficient design of physical space contributes significantly to savings in provision, management and use of facilities, while also potentially improving pedagogical quality. The purpose of this research is to identify emerging trends in the design of future Learning Landscapes for architectural education in Australasia; to understand where and how students of architecture are likely to learn, in the future context. It explores the important linkages between space, place, pedagogy, technology and context, using a multi methodological qualitative research approach. An Australasian context study will explore the Learning Landscapes of 23 Schools of Architecture across Australia, New Zealand and Papua New Guinea. The focus of this paper is on the methodology which is being employed to undertake dynamic data collection for the study. The research will be determined through mapping all forms of architectural learning environments, pedagogical approaches and contextual issues, to bridge the gap between academic theory, and architectural design practice. An initial understanding that pedagogy is an intrinsic component imbedded within the design of learning environments, will play an important role. Active learning environments which are exemplified by the architectural design studio, support dynamic project based and collaborative connected learning models. These have recently become a lot more common in disciplines outside of design and the arts. It is anticipated, therefore, that the implications for this research may well have a positive impact far beyond the confines of the architectural studio learning environment.

Rectilinear Path Following in 3D Space

This paper addresses the problem of determining an optimal (shortest) path in three dimensional space for a constant speed and turn-rate constrained aerial vehicle, that would enable the vehicle to converge to a rectilinear path, starting from any arbitrary initial position and orientation. Based on 3D geometry, we propose an optimal and also a suboptimal path planning approach. Unlike the existing numerical methods which are computationally intensive, this optimal geometrical method generates an optimal solution in lesser time. The suboptimal solution approach is comparatively more efficient and gives a solution that is very close to the optimal one. Due to its simplicity and low computational requirements this approach can be implemented on an aerial vehicle with constrained turn radius to reach a straight line with a prescribed orientation as required in several applications. But, if the distance between the initial point and the straight line to be followed along the vertical axis is high, then the generated path may not be flyable for an aerial vehicle with limited range of flight path angle and we resort to a numerical method for obtaining the optimal solution. The numerical method used here for simulation is based on multiple shooting and is found to be comparatively more efficient than other methods for solving such two point boundary value problem.

The requirements for Ca2+, protein phosphorylation and concurrent protein synthesis for zeatin signaling of acidic chitinase transcript accumulation in Cucumis sativus L

We have previously reported that both Ca2+ and staurosporine-sensitive protein kinase(s) are involved in the cytokinin zeatin induction of cucumber chitinase activity and its protein content (Barwe et al. 2001). To further characterize signal transduction events involved in this cytokinin induction of chitinase gene expression, Northern hybridizations of total RNAs prepared from excised, dark-grown cucumber cotyledons treated with cytokinins and/or various agonists and antagonists of signal transduction components, were carried out using a cucumber acidic chitinase (CACHT) cDNA probe (Metraux et al. 1989). CACHT mRNA increased by approximately 5- to 6-fold in response to exogenous zeatin (Z), zeatin riboside (ZR), and benzyladenine (BA) treatment, but failed to accumulate in response to kinetin (K). Among the cytokinins tested, Z was most effective. The Z-induced accumulation of CACHT mRNA was inhibited by a plasma membrane Ca2+ channel blocker verapamil. Treatment of cotyledons with exogenous CaCl2 and calcium ionophore A23187 in the presence and absence of cytokinin enhanced CACHT mRNA accumulation. These two observations suggest the participation of extracellular calcium in signaling Z-induction. Furthermore, the presence of staurosporine (an inhibitor of protein kinase) in Z treatment reduced CACHT mRNA, suggesting the involvement of phosphorylation of one or more cellular proteins. In addition, we provide evidence that the Z-induction of CACHT mRNA is blocked by protein synthesis inhibitor cycloheximide treatment. Taken together, these results suggest that Ca2+ influx from extracellular space, protein phosphorylation, and concurrent protein synthesis events participate in cytokinin signaling during Z-induced CACHT transcript accumulation.

Optimal trajectory planning for path convergence in three-dimensional space

This article addresses the problem of determining the shortest path that connects a given initial configuration (position, heading angle, and flight path angle) to a given rectilinear or a circular path in three-dimensional space for a constant speed and turn-rate constrained aerial vehicle. The final path is assumed to be located relatively far from the starting point. Due to its simplicity and low computational requirements the algorithm can be implemented on a fixed-wing type unmanned air vehicle in real time in missions where the final path may change dynamically. As wind has a very significant effect on the flight of small aerial vehicles, the method of optimal path planning is extended to meet the same objective in the presence of wind comparable to the speed of the aerial vehicles. But, if the path to be followed is closer to the initial point, an off-line method based on multiple shooting, in combination with a direct transcription technique, is used to obtain the optimal solution. Optimal paths are generated for a variety of cases to show the efficiency of the algorithm. Simulations are presented to demonstrate tracking results using a 6-degrees-of-freedom model of an unmanned air vehicle.

A movable-cavity cold atom space clock

We present an experimental scheme of a cold atom space clock with a movable cavity. By using a single microwave cavity, we find that the clock has a significant advantage, i.e. the longitudinal cavity phase shift is eliminated. A theoretical analysis has been carried out in terms of the relation between the atomic transition probability and the velocity of the moving cavity by taking into account the velocity distribution of cold atoms. The requirements for the microwave power and its stability for atomic pi/2 excitation at different moving velocities of the cavity lead to the determination of the proper working parameters of the rubidium clock in frequency accuracy 10(-17). Finally, the mechanical stability for the scheme is analysed and the ways of solving the possible mechanical instability of the device are proposed.

Conceptual design of Americium nuclear battery for space power applications

This work presents simplified 242mAm-fueled nuclear battery concept design featuring direct fission products energy conversion and passive heat rejection. Optimization of the battery operating characteristics and dimensions was performed. The calculations of power conversion efficiency under thermal and nuclear design constraints showed that 5.6 W e/kg power density can be achieved, which corresponds to conversion efficiency of about 4%. A system with about 190 cm outer radius translates into 17.8 MT mass per 100 kW e. Total power scales linearly with the outer surface area of the battery through which the residual heat is rejected. Tradeoffs between the battery lifetime, mass, dimensions, power rating, and conversion efficiency are presented and discussed. The battery can be used in a wide variety of interplanetary missions with power requirements in the kW to MW range. Copyright © 2007 by the American Institute of Aeronautics and Astronautics, Inc. All rights reserved.

A compact proton source for space simulation

A compact proton beam source for space simulation has been developed. A compact structure was designed in order to meet the special requirements of miniaturization. Some particular means have been adopted for improving the proton portion and beam transmission at a long distance. The experimental results showed that 8mA/80keV proton beam can be successfully obtained from this source at about 700W input microwave power.

Automated Camera Layout to Satisfy Task-Specific and Floorplan-Specific Coverage Requirements

In many multi-camera vision systems the effect of camera locations on the task-specific quality of service is ignored. Researchers in Computational Geometry have proposed elegant solutions for some sensor location problem classes. Unfortunately, these solutions utilize unrealistic assumptions about the cameras' capabilities that make these algorithms unsuitable for many real-world computer vision applications: unlimited field of view, infinite depth of field, and/or infinite servo precision and speed. In this paper, the general camera placement problem is first defined with assumptions that are more consistent with the capabilities of real-world cameras. The region to be observed by cameras may be volumetric, static or dynamic, and may include holes that are caused, for instance, by columns or furniture in a room that can occlude potential camera views. A subclass of this general problem can be formulated in terms of planar regions that are typical of building floorplans. Given a floorplan to be observed, the problem is then to efficiently compute a camera layout such that certain task-specific constraints are met. A solution to this problem is obtained via binary optimization over a discrete problem space. In experiments the performance of the resulting system is demonstrated with different real floorplans.

Towards Improving the Utilisation of University Teaching Space

There is a perception that teaching space in universities is a rather scarce resource. However, some studies have revealed that in many institutions it is actually chronically under-used. Often, rooms are occupied only half the time, and even when in use they are often only half full. This is usually measured by the ‘utilization’ which is defined as the percentage of available ‘seat-hours’ that are employed. Within real institutions, studies have shown that this utilization can often take values as low as 20–40%. One consequence of such a low level of utilization is that space managers are under pressure to make more efficient use of the available teaching space. However, better management is hampered because there does not appear to be a good understanding within space management (near-term planning) of why this happens. This is accompanied, within space planning (long-term planning) by a lack of experise on how best to accommodate the expected low utilizations. This motivates our two main goals: (i) To understand the factors that drive down utilizations, (ii) To set up methods to provide better space planning. Here, we provide quantitative evidence that constraints arising from timetabling and location requirements easily have the potential to explain the low utilizations seen in reality. Furthermore, on considering the decision question ‘Can this given set of courses all be allocated in the available teaching space?’ we find that the answer depends on the associated utilization in a way that exhibits threshold behaviour: There is a sharp division between regions in which the answer is ‘almost always yes’ and those of ‘almost always no’. Through analysis and understanding of the space of potential solutions, our work suggests that better use of space within universities will come about through an understanding of the effects of timetabling constraints and when it is statistically likely that it will be possible for a set of courses to be allocated to a particular space. The results presented here provide a firm foundation for university managers to take decisions on how space should be managed and planned for more effectively. Our multi-criteria approach and new methodology together provide new insight into the interaction between the course timetabling problem and the crucial issue of space planning.

Packet classification by multi-level cutting of the classification space: An algorithmic-architectural solution for IP packet classification in next generation networks

Traditionally, the Internet provides only a “best-effort” service, treating all packets going to the same destination equally. However, providing differentiated services for different users based on their quality requirements is increasingly becoming a demanding issue. For this, routers need to have the capability to distinguish and isolate traffic belonging to different flows. This ability to determine the flow each packet belongs to is called packet classification. Technology vendors are reluctant to support algorithmic solutions for classification due to their non-deterministic performance. Although CAMs are favoured by technology vendors due to their deterministic high lookup rates, they suffer from the problems of high power dissipation and high silicon cost. This paper provides a new algorithmic-architectural solution for packet classification that mixes CAMs with algorithms based on multi-level cutting the classification space into smaller spaces. The provided solution utilizes the geometrical distribution of rules in the classification space. It provides the deterministic performance of CAMs, support for dynamic updates, and added flexibility for system designers.