Approximate Membership Localization within a Web-Based Join Framework

In this paper, we propose a search-based approach to join two tables in the absence of clean join attributes. Non-structured documents from the web are used to express the correlations between a given query and a reference list. To implement this approach, a major challenge we meet is how to efficiently determine the number of times and the locations of each clean reference from the reference list that is approximately mentioned in the retrieved documents. We formalize the Approximate Membership Localization (AML) problem and propose an efficient partial pruning algorithm to solve it. A study using real-word data sets demonstrates the effectiveness of our search-based approach, and the efficiency of our AML algorithm.

Continuous and pedagogically sound assessment : A new economy of power relations in Australian Law schools

In recent decades, assessment practices within Australian law schools have moved from the overwhelming use of end-of-year closed-book examinations to an increase in the use of a wider range of techniques. This shift is often characterised as providing a ‘better’ learning environment for students, contributing more positively to their own ‘personal development’ within higher education, or, considered along the lines of critical legal thought, as ‘liberating’ them from the ‘conservatising’ and ‘indoctrinating’ effects of the power relations that operate in law schools. This paper seeks to render problematic such liberal-progressive narratives about these changes to law school assessment practices. It will do so by utilising the work of French historian and philosopher Michel Foucault on power, arguing that the current range of assessment techniques demonstrates a shift in the ‘economy’ of power relations within the law school. Rather than ‘liberating’ students from relations of power, these practices actually extend the power relations through which students are governed. This analysis is intended to inform legal education research and assessment practice by providing a far more nuanced conceptual framework than one that seeks to ‘free’ law students from these ‘repressive’ practices, or hopes to ‘objectively’ contribute to their ‘personal development’.

Characteristics of modal sound radiation of finite cylindrical shells

Characteristics of modal sound radiation of finite cylindrical shells are studied using finite element and boundary element methods in this paper. In the low frequency range, modal radiation efficiencies of finite cylindrical shells are found to asymptotically approach those of the corresponding infinite cylindrical shell when structural trace wavelengths of the cylindrical shells are greater than the acoustic wavelength. Modal radiation efficiencies for each group of modes having the same circumferential modal index decrease as the axial modal index increases. They converge to each other when the axial trace wavelength is much greater than the circumferential trace wavelength. The mechanism leading to lower radiation efficiency of modes with higher circumferential modal index of short cylinders is explained. Similar to those of flat plate panels, change in slope or waviness is observed in modal radiation efficiency curves of modes with higher order axial modal index at medium frequencies. This is attributed to the interference of sound radiated by neighbouring vibrating cells when the distance between nodal lines of a vibrating mode is in the same order or smaller than the acoustic wavelength. Effects of the internal sound field on modal radiation efficiencies of a finite open-end cylinder are discussed.

Towards a controlled growth of self-assembled nanostructures: shaping, ordering and localization in Ge/Si heteroepitaxy.

The strain-induced self-assembly of suitable semiconductor pairs is an attractive natural route to nanofabrication. To bring to fruition their full potential for actual applications, individual nanostructures need to be combined into ordered patterns in which the location of each single unit is coupled with others and the surrounding environment. Within the Ge/Si model system, we analyze a number of examples of bottom-up strategies in which the shape, positioning, and actual growth mode of epitaxial nanostructures are tailored by manipulating the intrinsic physical processes of heteroepitaxy. The possibility of controlling elastic interactions and, hence, the configuration of self-assembled quantum dots by modulating surface orientation with the miscut angle is discussed. We focus on the use of atomic steps and step bunching as natural templates for nanodot clustering. Then, we consider several different patterning techniques which allow one to harness the natural self-organization dynamics of the system, such as: scanning tunneling nanolithography, focused ion beam and nanoindentation patterning. By analyzing the evolution of the dot assembly by scanning probe microscopy, we follow the pathway which leads to lateral ordering, discussing the thermodynamic and kinetic effects involved in selective nucleation on patterned substrates.

Sound thinking : tips and tools for understanding popular music

Sound Thinking provides techniques and approaches to critically listen, think, talk and write about music you hear or make. It provides tips on making music and it encourages regular and deep thinking about music activities, which helps build a musical dialog that leads to deeper understanding.

Subcellular localization of proteasomes and their regulatory complexes in mammalian cells

Proteasomes can exist in several different molecular forms in mammalian cells. The core 20S proteasome, containing the proteolytic sites, binds regulatory complexes at the ends of its cylindrical structure. Together with two 19S ATPase regulatory complexes it forms the 26S proteasome, which is involved in ubiquitin-dependent proteolysis. The 20S proteasome can also bind 11S regulatory complexes (REG, PA28) which play a role in antigen processing, as do the three variable c-interferoninducible catalytic b-subunits (e.g. LMP7). In the present study, we have investigated the subcellular distribution of the different forms of proteasomes using subunit speci®c antibodies. Both 20S proteasomes and their 19S regulatory complexes are found in nuclear, cytosolic and microsomal preparations isolated from rat liver. LMP7 was enriched approximately two-fold compared with core a-type proteasome subunits in the microsomal preparations. 20S proteasomes were more abundant than 26S proteasomes, both in liver and cultured cell lines. Interestingly, some signi®cant differences were observed in the distribution of different subunits of the 19S regulatory complexes. S12, and to a lesser extent p45, were found to be relatively enriched in nuclear fractions from rat liver, and immuno¯uorescent labelling of cultured cells with anti-p45 antibodies showed stronger labelling in the nucleus than in the cytoplasm. The REG was found to be localized predominantly in the cytoplasm. Three- to six-fold increases in the level of REG were observed following cinterferon treatment of cultured cells but c-interferon had no obvious effect on its subcellular distribution. These results demonstrate that different regulatory complexes and subpopulations of proteasomes have different distributions within mammalian cells and, therefore, that the distribution is more complex than has been reported for yeast proteasomes.

Aromatic l-amino acid decarboxylase : histochemical localization in rat kidney and lack of effect of dietary potassium or sodium loading on enzyme distribution

Utilizing a mono-specific antiserum produced in rabbits to hog kidney aromatic L-amino acid decarboxylase (AADC), the enzyme was localized in rat kidney by immunoperoxidase staining. AADC was located predominantly in the proximal convoluted tubules; there was also weak staining in the distal convoluted tubules and collecting ducts. An increase in dietary potassium or sodium intake produced no change in density or distribution of AADC staining in kidney. An assay of AADC enzyme activity showed no difference in cortex or medulla with chronic potassium loading. A change in distribution or activity of renal AADC does not explain the postulated dopaminergic modulation of renal function that occurs with potassium or sodium loading.

Towards persistent localization and mapping with a continuous appearance-based topology

Appearance-based localization can provide loop closure detection at vast scales regardless of accumulated metric error. However, the computation time and memory requirements of current appearance-based methods scale not only with the size of the environment but also with the operation time of the platform. Additionally, repeated visits to locations will develop multiple competing representations, which will reduce recall performance over time. These properties impose severe restrictions on long-term autonomy for mobile robots, as loop closure performance will inevitably degrade with increased operation time. In this paper we present a graphical extension to CAT-SLAM, a particle filter-based algorithm for appearance-based localization and mapping, to provide constant computation and memory requirements over time and minimal degradation of recall performance during repeated visits to locations. We demonstrate loop closure detection in a large urban environment with capped computation time and memory requirements and performance exceeding previous appearance-based methods by a factor of 2. We discuss the limitations of the algorithm with respect to environment size, appearance change over time and applications in topological planning and navigation for long-term robot operation.

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.

Physically sound vehicle-driver model for realistic microscopic simulation

In microscopic traffic simulators, the interaction between vehicles is considered. The dynamics of the system then becomes an emergent property of the interaction between its components. Such interactions include lane-changing, car-following behaviours and intersection management. Although, in some cases, such simulators produce realistic prediction, they do not allow for an important aspect of the dynamics, that is, the driver-vehicle interaction. This paper introduces a physically sound vehicle-driver model for realistic microscopic simulation. By building a nanoscopic traffic simulation model that uses steering angle and throttle position as parameters, the model aims to overcome unrealistic acceleration and deceleration values, as found in various microscopic simulation tools. A physics engine calculates the driving force of the vehicle, and the preliminary results presented here, show that, through a realistic driver-vehicle-environment simulator, it becomes possible to model realistic driver and vehicle behaviours in a traffic simulation.

Fast power line detection and localization using steerable filter for active UAV guidance

In this paper we present a fast power line detection and localisation algorithm as well as propose a high-level guidance architecture for active vision-based Unmanned Aerial Vehicle (UAV) guidance. The detection stage is based on steerable filters for edge ridge detection, followed by a line fitting algorithm to refine candidate power lines in images. The guidance architecture assumes an UAV with an onboard Gimbal camera. We first control the position of the Gimbal such that the power line is in the field of view of the camera. Then its pose is used to generate the appropriate control commands such that the aircraft moves and flies above the lines. We present initial experimental results for the detection stage which shows that the proposed algorithm outperforms two state-of-the-art line detection algorithms for power line detection from aerial imagery.

The sound of music : sharing song selections between collocated strangers in public urban places

This paper presents Capital Music, a mobile application enabling real-time sharing of song choices with collocated urban dwellers. Due to the real-time, location-based peer-to-peer approach of the application, a user experience study was performed utilising the Wizard of Oz method. The study provides insight into how sharing non-privacy sensitive but personal data in an anonymous way can influence the user experience of people in public urban places. We discuss the findings in relation to how Capital Music influences the process of “cocooning” in public urban places, the practice of designing anonymous interactions between collocated strangers, and how the sharing of song choices can create a sense of commonality between anonymous users in the urban space. The outcomes of this study are relevant for future location-based social networking applications that aim to create interactions between collocated strangers.

Computationally sound automated proofs of cryptographic schemes

Proving security of cryptographic schemes, which normally are short algorithms, has been known to be time-consuming and easy to get wrong. Using computers to analyse their security can help to solve the problem. This thesis focuses on methods of using computers to verify security of such schemes in cryptographic models. The contributions of this thesis to automated security proofs of cryptographic schemes can be divided into two groups: indirect and direct techniques. Regarding indirect ones, we propose a technique to verify the security of public-key-based key exchange protocols. Security of such protocols has been able to be proved automatically using an existing tool, but in a noncryptographic model. We show that under some conditions, security in that non-cryptographic model implies security in a common cryptographic one, the Bellare-Rogaway model [11]. The implication enables one to use that existing tool, which was designed to work with a different type of model, in order to achieve security proofs of public-key-based key exchange protocols in a cryptographic model. For direct techniques, we have two contributions. The first is a tool to verify Diffie-Hellmanbased key exchange protocols. In that work, we design a simple programming language for specifying Diffie-Hellman-based key exchange algorithms. The language has a semantics based on a cryptographic model, the Bellare-Rogaway model [11]. From the semantics, we build a Hoare-style logic which allows us to reason about the security of a key exchange algorithm, specified as a pair of initiator and responder programs. The other contribution to the direct technique line is on automated proofs for computational indistinguishability. Unlike the two other contributions, this one does not treat a fixed class of protocols. We construct a generic formalism which allows one to model the security problem of a variety of classes of cryptographic schemes as the indistinguishability between two pieces of information. We also design and implement an algorithm for solving indistinguishability problems. Compared to the two other works, this one covers significantly more types of schemes, but consequently, it can verify only weaker forms of security.