Dense Multiperson Tracking with Robust Hierarchical Linear Assignment

We introduce a novel dual-stage algorithm for online multi-target tracking in realistic conditions. In the first stage, the problem of data association between tracklets and detections, given partial occlusion, is addressed using a novel occlusion robust appearance similarity method. This is used to robustly link tracklets with detections without requiring explicit knowledge of the occluded regions. In the second stage, tracklets are linked using a novel method of constraining the linking process that removes the need for ad-hoc tracklet linking rules. In this method, links between tracklets are permitted based on their agreement with optical flow evidence. Tests of this new tracking system have been performed using several public datasets.

Class Responsibility Assignment (CRA) for Use Case Specification to Sequence Diagrams (UC2SD)

Identifying responsibility for classes in object oriented software design phase is a crucial task. This paper proposes an approach for producing high quality and robust behavioural diagrams (e.g. Sequence Diagrams) through Class Responsibility Assignment (CRA). GRASP or General Responsibility Assignment Software Pattern (or Principle) was used to direct the CRA process when deriving behavioural diagrams. A set of tools to support CRA was developed to provide designers and developers with a cognitive toolkit that can be used when analysing and designing object-oriented software. The tool developed is called Use Case Specification to Sequence Diagrams (UC2SD). UC2SD uses a new approach for developing Unified Modelling Language (UML) software designs from Natural Language, making use of a meta-domain oriented ontology, well established software design principles and established Natural Language Processing (NLP) tools. UC2SD generates a well-formed UML sequence diagrams as output.

AMBIGUITIES IN ADSORBATE SITE ASSIGNMENT FROM VIBRATIONAL FREQUENCIES - A TLEED STRUCTURAL STUDY OF (2X1)CO-PD(110)

The structure of the (2 X 1)CO-Pd(110) surface phase has been determined by LEED intensity analysis. The CO molecule is found to be adsorbed in an atop site, tilted by 11-degrees +/- 4-degrees with respect to the surface normal, with a C-O bond length of 1.16 +/- 0.04 angstrom. Interestingly, the C-O vibrational frequency for this system (2003 cm-1) is virtually identical to the frequency observed for the (2 X 1)CO-Ni(110) surface phase (1998 cm-1) which a previous LEED study has shown involves bridge bound CO molecules. The result indicates that care must be taken in assigning site symmetries on the basis of C-O stretching frequencies alone.

A multi-attribute ranking solutions confirmation procedure

Ranking problems arise from the knowledge of several binary relations defined on a set of alternatives, which we intend to rank. In a previous work, the authors introduced a tool to confirm the solutions of multi-attribute ranking problems as linear extensions of a weighted sum of preference relations. An extension of this technique allows the recognition of critical preference pairs of alternatives, which are often caused by inconsistencies. Herein, a confirmation procedure is introduced and applied to confirm the results obtained by a multi-attribute decision methodology on a tender for the supply of buses to the Porto Public Transport Operator. © 2005 Springer Science + Business Media, Inc.

Convex optimization framework for intermediate deadline assignment in soft and hard real-time distributed systems

It is generally challenging to determine end-to-end delays of applications for maximizing the aggregate system utility subject to timing constraints. Many practical approaches suggest the use of intermediate deadline of tasks in order to control and upper-bound their end-to-end delays. This paper proposes a unified framework for different time-sensitive, global optimization problems, and solves them in a distributed manner using Lagrangian duality. The framework uses global viewpoints to assign intermediate deadlines, taking resource contention among tasks into consideration. For soft real-time tasks, the proposed framework effectively addresses the deadline assignment problem while maximizing the aggregate quality of service. For hard real-time tasks, we show that existing heuristic solutions to the deadline assignment problem can be incorporated into the proposed framework, enriching their mathematical interpretation.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning real-time tasks on a heterogeneous multiprocessor platform comprising two different types of processors — such a platform is referred to as two-type platform. We present two linearithmic timecomplexity algorithms, SA and SA-P, each providing the follow- ing guarantee. For a given two-type platform and a given task set, if there exists a feasible task-to-processor-type assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type, then (i) using SA, it is guaranteed to find such a feasible task-to- processor-type assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding 2 a feasible task-to-processor assignment where tasks are not allowed to migrate between processors but given a platform in which processors are 1+α/times faster, where 0<α≤1. The parameter α is a property of the task set — it is the maximum utilization of any task which is less than or equal to 1.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+α times faster. The parameter 0<α≤1 is a property of the task set; it is the maximum of all the task utilizations that are no greater than 1. We evaluate average-case performance of both the algorithms by generating task sets randomly and measuring how much faster processors the algorithms need (which is upper bounded by 1+α/2 for SA and 1+α for SA-P) in order to output a feasible task assignment (intra-migrative for SA and non-migrative for SA-P). In our evaluations, for the vast majority of task sets, these algorithms require significantly smaller processor speedup than indicated by their theoretical bounds. Finally, we consider a special case where no task utilization in the given task set can exceed one and for this case, we (re-)prove the performance guarantees of SA and SA-P. We show, for both of the algorithms, that changing the adversary from intra-migrative to a more powerful one, namely fully-migrative, in which tasks can migrate between processors of any type, does not deteriorate the performance guarantees. For this special case, we compare the average-case performance of SA-P and a state-of-the-art algorithm by generating task sets randomly. In our evaluations, SA-P outperforms the state-of-the-art by requiring much smaller processor speedup and by running orders of magnitude faster.

CPMD-mindful task assignment for NPS-F

The multiprocessor scheduling scheme NPS-F for sporadic tasks has a high utilisation bound and an overall number of preemptions bounded at design time. NPS-F binpacks tasks offline to as many servers as needed. At runtime, the scheduler ensures that each server is mapped to at most one of the m processors, at any instant. When scheduled, servers use EDF to select which of their tasks to run. Yet, unlike the overall number of preemptions, the migrations per se are not tightly bounded. Moreover, we cannot know a priori which task a server will be currently executing at the instant when it migrates. This uncertainty complicates the estimation of cache-related preemption and migration costs (CPMD), potentially resulting in their overestimation. Therefore, to simplify the CPMD estimation, we propose an amended bin-packing scheme for NPS-F allowing us (i) to identify at design time, which task migrates at which instant and (ii) bound a priori the number of migrating tasks, while preserving the utilisation bound of NPS-F.

The status of drama in education in an Ontario school board

Drama in education has been describea- as a valuable pedagogical medium and methodology, enriching child development in the cognitive, skill, affective, and aesthetic domains, and spanning all areas of curriculum ~ oontent. However, despite its considerable versatility and cost-effectiveness, drama appears to maintain low status within the education system of ontario. This thesis investigated teacher perceptions of both the value and status of drama in education in one ontario school board. Data were gathered in the form of an attitude questionnaire, which was devised for the purpose of this research and administered to a stratified cluster sample of 126 teachers employed in the board's elementary schools. These data were then used to examine teacher perceptions based on their knowledge, attitudes, and self-reported behaviour in the classroom. Teacher characteristics of gender, teaching assignment, years experience, and courses taken in drama were also analyzed as potential determinants of teacher attitudes towards drama in education. Results of the study confirmed apparent discrepancy between teacher perceptions of the value of drama and its current educational status. It was indicated that what teachers value most about drama is its capacity to enhance creativity, social skills, empathy, personal growth, and problem-solving ability among students. Teachers attribute its low status both to school and board priorities of time and resources, and to deficiencies in their knowledge and confidence in the planning, implementation, and evaluation of drama in the classroom. Teacher subgroup analysis revealed no significant differences in attitudes towards the status of drama in education; it did, however, suggest that both teachers who have studied drama and teachers with between ten and twenty years experience are most likely to value drama more highly than their colleagues. Recommendations proposed by the study include the provision of increased - time and resource allotment for drama within the elementary curriculum as well as increased teacher training at both faculty of education and board inservice levels.

Press Release - Great Lakes and St. Lawrence Seaway Assignment, 25 October 1973

A press release assigning Sean O'Sullivan to study the future of the Great Lakes and St. Lawrence Seaway.

Indenture of assignment of mortgage between Executors of the Zimmerman Estate and the Bank of Upper Canada

Indenture of assignment of mortgage between Executors of the Zimmerman Estate and the Bank of Upper Canada regarding Lot no. 4 in block O in the Town of Elgin – instrument no. 6360, May 14, 1858.

«Constrained-optimal strategy-proof assignment: beyond the groves mechanisms»

A single object must be allocated to at most one of n agents. Money transfers are possible and preferences are quasilinear. We offer an explicit description of the individually rational mechanisms which are Pareto-optimal in the class of feasible, strategy-proof, anonymous and envy-free mechanisms. These mechanisms form a one-parameter infinite family; the Vickrey mechanism is the only Groves mechanism in that family.