Fast exact nearest neighbour matching in high dimensions using d-D Sort

Data structures such as k-D trees and hierarchical k-means trees perform very well in approximate k nearest neighbour matching, but are only marginally more effective than linear search when performing exact matching in high-dimensional image descriptor data. This paper presents several improvements to linear search that allows it to outperform existing methods and recommends two approaches to exact matching. The first method reduces the number of operations by evaluating the distance measure in order of significance of the query dimensions and terminating when the partial distance exceeds the search threshold. This method does not require preprocessing and significantly outperforms existing methods. The second method improves query speed further by presorting the data using a data structure called d-D sort. The order information is used as a priority queue to reduce the time taken to find the exact match and to restrict the range of data searched. Construction of the d-D sort structure is very simple to implement, does not require any parameter tuning, and requires significantly less time than the best-performing tree structure, and data can be added to the structure relatively efficiently.

Extensão do modelo hipercubo para análise de sistemas de atendimento médico emergencial com prioridade na fila

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Investigation of the M2/G2/1/ ∞, N Queue with Restricted Admission of Priority Customers and its Application to HSDPA Mobile Systems

This paper investigates a queuing system for QoS optimization of multimedia traffic consisting of aggregated streams with diverse QoS requirements transmitted to a mobile terminal over a common downlink shared channel. The queuing system, proposed for buffer management of aggregated single-user traffic in the base station of High-Speed Downlink Packet Access (HSDPA), allows for optimum loss/delay/jitter performance for end-user multimedia traffic with delay-tolerant non-real-time streams and partially loss tolerant real-time streams. In the queuing system, the real-time stream has non-preemptive priority in service but the number of the packets in the system is restricted by a constant. The non-real-time stream has no service priority but is allowed unlimited access to the system. Both types of packets arrive in the stationary Poisson flow. Service times follow general distribution depending on the packet type. Stability condition for the model is derived. Queue length distribution for both types of customers is calculated at arbitrary epochs and service completion epochs. Loss probability for priority packets is computed. Waiting time distribution in terms of Laplace-Stieltjes transform is obtained for both types of packets. Mean waiting time and jitter are computed. Numerical examples presented demonstrate the effectiveness of the queuing system for QoS optimization of buffered end-user multimedia traffic with aggregated real-time and non-real-time streams.

Rule-based transit signal priority control method using a real-time transit travel time prediction model

An advanced rule-based Transit Signal Priority (TSP) control method is presented in this paper. An on-line transit travel time prediction model is the key component of the proposed method, which enables the selection of the most appropriate TSP plans for the prevailing traffic and transit condition. The new method also adopts a priority plan re-development feature that enables modifying or even switching the already implemented priority plan to accommodate changes in the traffic conditions. The proposed method utilizes conventional green extension and red truncation strategies and also two new strategies including green truncation and queue clearance. The new method is evaluated against a typical active TSP strategy and also the base case scenario assuming no TSP control in microsimulation. The evaluation results indicate that the proposed method can produce significant benefits in reducing the bus delay time and improving the service regularity with negligible adverse impacts on the non-transit street traffic.

Generalized Priority Systems. Analytical Results and Numerical Algorithms

A class of priority systems with non-zero switching times, referred as generalized priority systems, is considered. Analytical results regarding the distribution of busy periods, queue lengths and various auxiliary characteristics are presented. These results can be viewed as generalizations of the Kendall functional equation and the Pollaczek-Khintchin transform equation, respectively. Numerical algorithms for systems’ busy periods and traffic coefficients are developed. ACM Computing Classification System (1998): 60K25.

Listening, sharing understanding and facilitating consumer, family and community empowerment through a priority driven partnership in Far North Queensland

Objectives: This paper provides an example of a mental health research partnership underpinned by empowerment principles that seeks to foster strength among community organizations to support better outcomes for consumers, families and communities. It aims to raise awareness among researchers and service providers that empowerment approaches to assist communities to address mental health problems are not too difficult to be practical but require long-term commitment and appropriate support. Methods: A collaborative research strategy that has become known as the Priority Driven Research (PDR) Partnership emerged through literature review,consultations, Family Wellbeing Program delivery with community groups and activities in two discrete Indigenous communities. Progress to date on three of the four components of the strategy is described. Results: The following key needs were identified in a pilot study and are now being addressed in a research-based implementation phase: (i) gaining two-way understanding of perspectives on mental health and promoting universal awareness; (ii) supporting the empowerment of carers, families, consumers and at-risk groups through existing community organizations to gain greater understanding and control of their situation; (iii) developing pathways of care at the primary health centre level to enable support of social and emotional wellbeing as well as more integrated mental health care; (iv) accessing data to enable an ongoing process of analysis/sharing/planning and monitoring to inform future activity. Conclusion: One of the key learnings to emerge in this project so far is that empowerment through partnership becomes possible when there is a concerted effort to strengthen grassroots community organizations. These include social health teams and men’s and women’s groups that can engage local people in an action orientation. Key words: Aboriginal, empowerment, Indigenous, mental health.

NAPLAN, a high priority or . . . ? Statements about its purpose in Queensland schools

This paper reports on statements from Professional Development participants who were asked to comment on NAPLAN. The participants were involved in a project designed by the YuMi Deadly Centre (YDC) for implementation into 25 Queensland School to enhance the teaching and learning of mathematics to Aboriginal and Torres Strait Islander students and low SES students. Using an action research framework and a survey questionnaire, the preliminary data obtained from participating principals is mixed, with statements indicating that NAPLAN is a high priority for some schools while others indicated that it does not “tell” the whole story of student learning.

A ∑GIi/D/1/∞ queue with heterogeneous input/output slot times

In this paper, we present a ∑GIi/D/1/∞ queue with heterogeneous input/output slot times. This queueing model can be regarded as an extension of the ordinary GI/D/1/∞ model. For this ∑GIi/D/1/∞ queue, we assume that several input streams arrive at the system according to different slot times. In other words, there are different slot times for different input/output processes in the queueing model. The queueing model can therefore be used for an ATM multiplexer with heterogeneous input/output link capacities. Several cases of the queueing model are discussed to reflect different relationships among the input/output link capacities of an ATM multiplexer. In the queueing analysis, two approaches: the Markov model and the probability generating function technique, are adopted to develop the queue length distributions observed at different epochs. This model is particularly useful in the performance analysis of ATM multiplexers with heterogeneous input/output link capacities.

The treatment of employee priority in a deed of company arrangement

This article examines one of the changes implemented in the Corporations Amendment (Insolvency) Act 2007 (Cth) . It is argued that the insertion of s 444DA raises some matters that go to the nature of the insolvency process generally and the operation of Pt 5.3A in a particular. The position of employees in insolvency is a matter that is the subject of much comment from a policy perspective. This article does not cover that debate but provides some initial explanation of the need to protect employees. The second part of the article covers the particular background to the voluntary administration system as far as employee rights are concerned as well as the arguments put forward by the government to justify the change in the legislation which inserted s 444DA . It suggests that there was little evidence provided for the need to protect employee priority rights in this particular way. An alternative explanation is given for the change adopted by the government. The third part of the article suggests that the manner in which the legislation seeks to better protect employee creditors is somewhat clumsy in its operation. It raises a number of questions about how the legislation may operate and argues that given the stated aims, some alteration to it would improve its effectiveness.

Queue protection parameters’ fine-tuning for variable speed limits

Any incident on motorways potentially can be followed by secondary crashes. Rear-end crashes also could happen as a result of queue formation downstream of high speed platoons. To decrease the occurrence of secondary crashes and rear-end crashes, Variable Speed Limits (VSL) can be applied to protect queue formed downstream. This paper focuses on fine tuning the Queue Protection algorithm of VSL. Three performance indicators: activation time, deactivation time and number of false alarms are selected to optimise the Queue Protection algorithm. A calibrated microscopic traffic simulation model of Pacific Motorway in Brisbane is used for the optimisation. Performance of VSL during an incident and heavy congestion and the benefit of VSL will be presented in the paper.