Pole placement in multi-input systems via elementary transformations

This paper is concerned with the development of an algorithm for pole placement in multi-input dynamic systems. The algorithm which uses a series of elementary transformations is believed to be simpler, computationally more efficient and numerically stable when compared with earlier methods. In this paper two methods have been presented.

Multi Pattern Dynamic Time Warping For Automatic Speech Recognition

We are addressing the problem of jointly using multiple noisy speech patterns for automatic speech recognition (ASR), given that they come from the same class. If the user utters a word K times, the ASR system should try to use the information content in all the K patterns of the word simultaneously and improve its speech recognition accuracy compared to that of the single pattern based speech recognition. T address this problem, recently we proposed a Multi Pattern Dynamic Time Warping (MPDTW) algorithm to align the K patterns by finding the least distortion path between them. A Constrained Multi Pattern Viterbi algorithm was used on this aligned path for isolated word recognition (IWR). In this paper, we explore the possibility of using only the MPDTW algorithm for IWR. We also study the properties of the MPDTW algorithm. We show that using only 2 noisy test patterns (10 percent burst noise at -5 dB SNR) reduces the noisy speech recognition error rate by 37.66 percent when compared to the single pattern recognition using the Dynamic Time Warping algorithm.

Multi-Hypotheses Tracking using the Dempster–Shafer Theory, application to ambiguous road context

This paper presents a Multi-Hypotheses Tracking (MHT) approach that allows solving ambiguities that arise with previous methods of associating targets and tracks within a highly volatile vehicular environment. The previous approach based on the Dempster–Shafer Theory assumes that associations between tracks and targets are unique; this was shown to allow the formation of ghost tracks when there was too much ambiguity or conflict for the system to take a meaningful decision. The MHT algorithm described in this paper removes this uniqueness condition, allowing the system to include ambiguity and even to prevent making any decision if available data are poor. We provide a general introduction to the Dempster–Shafer Theory and present the previously used approach. Then, we explain our MHT mechanism and provide evidence of its increased performance in reducing the amount of ghost tracks and false positive processed by the tracking system.

The accuracy of varietal selection using factor analytic models for multi-environment plant breeding trials

Modeling of cultivar x trial effects for multienvironment trials (METs) within a mixed model framework is now common practice in many plant breeding programs. The factor analytic (FA) model is a parsimonious form used to approximate the fully unstructured form of the genetic variance-covariance matrix in the model for MET data. In this study, we demonstrate that the FA model is generally the model of best fit across a range of data sets taken from early generation trials in a breeding program. In addition, we demonstrate the superiority of the FA model in achieving the most common aim of METs, namely the selection of superior genotypes. Selection is achieved using best linear unbiased predictions (BLUPs) of cultivar effects at each environment, considered either individually or as a weighted average across environments. In practice, empirical BLUPs (E-BLUPs) of cultivar effects must be used instead of BLUPs since variance parameters in the model must be estimated rather than assumed known. While the optimal properties of minimum mean squared error of prediction (MSEP) and maximum correlation between true and predicted effects possessed by BLUPs do not hold for E-BLUPs, a simulation study shows that E-BLUPs perform well in terms of MSEP.

A multi-microprocessor architecture for solving partial differential equations

This paper presents the architecture of a fault-tolerant, special-purpose multi-microprocessor system for solving Partial Differential Equations (PDEs). The modular nature of the architecture allows the use of hundreds of Processing Elements (PEs) for high throughput. Its performance is evaluated by both analytical and simulation methods. The results indicate that the system can achieve high operation rates and is not sensitive to inter-processor communication delay.

The Effect of Framing on Layoff Decisions: Are More-Experienced Managers More Rational? Does Computerized Data Make Any Difference?

[Excerpt] The effects of framing on decisions has been widely studied, producing research that suggests individuals respond to framing in predictable and fairly consistent ways (Bazerman, 1984, 1990; Tversky & Kahneman, 1986; Thaler, 1980). The essential finding from this body of research is that "individuals treat risks concerning perceived gains (for example, saving jobs and plants) differently from risks concerning perceived losses (losing jobs and plants)" (Bazerman, 1990, pp. 49-50). Specifically, individuals tend to avoid risks concerning gains, and seek risks concerning losses.

Quantum behaved Particle Swarm Optimization (QPSO) for multi-objective design optimization of composite structures

We present a new, generic method/model for multi-objective design optimization of laminated composite components using a novel multi-objective optimization algorithm developed on the basis of the Quantum behaved Particle Swarm Optimization (QPSO) paradigm. QPSO is a co-variant of the popular Particle Swarm Optimization (PSO) and has been developed and implemented successfully for the multi-objective design optimization of composites. The problem is formulated with multiple objectives of minimizing weight and the total cost of the composite component to achieve a specified strength. The primary optimization variables are - the number of layers, its stacking sequence (the orientation of the layers) and thickness of each layer. The classical lamination theory is utilized to determine the stresses in the component and the design is evaluated based on three failure criteria; Failure Mechanism based Failure criteria, Maximum stress failure criteria and the Tsai-Wu Failure criteria. The optimization method is validated for a number of different loading configurations - uniaxial, biaxial and bending loads. The design optimization has been carried for both variable stacking sequences as well as fixed standard stacking schemes and a comparative study of the different design configurations evolved has been presented. Also, the performance of QPSO is compared with the conventional PSO.

A multi-hierarchical strategy for on-ramp coordination

Ramp metering (RM) is an access control for motorways, in which a traffic signal is placed at on-ramps to regulate the rate of vehicles entering the motorway and thus to preserve the motorway capacity. In general, RM algorithms fall into two categories by their effective scope: local control and coordinated control. Local control algorithm determines the metering rate based on the traffic condition on adjacent motorway mainline and the on-ramp. Conversely, coordinated RM strategies make use of measurements from the entire motorway network to operate individual ramp signals for optimal performance at the network level. This study proposes a multi-hierarchical strategy for on-ramp coordination. The strategy is structured in two layers. At the higher layer, a centralised, predictive controller plans the coordination control within a long update interval based on the location of high-risk breakdown flow. At the lower layer, reactive controllers determine the metering rates of those ramps involved in the ramp coordination with a short update interval. This strategy is modelled and applied to the northbound model of the Pacific Motorway in a micro-simulation platform (AIMSUN). The simulation results show that the proposed strategy effectively delays the onset of congestion and reduces total congestion with better managed on-ramp queues.

Pole placement in multi-input systems via elementary transformations

This paper is concerned with the development of an algorithm for pole placement in multi-input dynamic systems. The algorithm which uses a series of elementary transformations is believed to be simpler, computationally more efficient and numerically stable when compared with earlier methods. In this paper two methods have been presented.

Multi-Disciplinary Design and Simulation of a Fuel Cell Engine for a UAV

This report describes a methodology for the design and coupling of a proton exchange membrane (PEM) Fuel Cell to an Unmanned Aerial Vehicle (UAV). The report summarizes existing work in the field, the type of UAV and the mission requirements, design the fuel cell system, simulation environment, and compares endurance and range to when the aircraft is fitted with a conventional internal combustion engine (ICE).

Development of a multi-locus sequence typing scheme for avian isolates of Pasteurella multocida.

A total of 63 isolates of Pasteurella multocida from Australian poultry, all associated with fowl cholera outbreaks, and three international reference strains, representing the three subspecies within P. multocida were used to develop a multi-locus sequence typing scheme. Primers were designed for conserved regions of seven house-keeping enzymes - adk, est, gdh, mdh, pgi, pmi and zwf - and internal fragments of 570-784 bp were sequenced for all isolates and strains. The number of alleles at the different loci ranged from 11 to 20 and a total of 29 allelic profiles or sequence types were recognised amongst the 66 strains. There was a strong concordance between the MLST data and the existing multi-locus enzyme electrophoresis and ribotyping data. When used to study a sub-set of isolates with a known detailed epidemiological history, the MLST data matched the results given by restriction endonuclease analysis, pulsed-field gel electrophoresis, ribotyping and REP-PCR. The MLST scheme provides a high level of resolution and is an excellent tool for studying the population structure and epidemiology of P. multocida.

Evaluation of the Red Light Camera Program and the Owner Onus Legislation

Red light cameras were introduced in Victoria in August 1983, with the intention of reducing the number of accidents that result from motorists disobeying red traffic signals at signalised intersections. Accident data from 46 treated and 46 control sites from 1981 to 1986 were analysed. The analysis indicated that red light camera use resulted in a reduction in the incidence of right angle accidents, and in the number of accident casualties. Legislation was introduced in March 1986 to place the onus for red light camera offences onto the vehicle owner. This legislation was intended to improve Police efficiency and therefore increase the number of red light cameras in operation. Data supplied by the Police indicated that these aims have beneficial road safety effects.

Report on Red Light Camera Program: Operation from July 1988 to December 1989

EXECUTIVE SUMMARY (excerpts) The red light camera (RLC) program commenced in July 1988, with five cameras operating at 15 sites in metropolitan Adelaide. This report deals with the first eighteen months of operation, to December 1989. A number of recommendations have been made… PROGRAM EVALUATION … In 1989 dollars, the program was estimated to have achieved an accident reduction benefit of $1.4m in the first 12 months of operation, which is almost twice the benefit expected using the assumptions made when selecting the sites. (There are 8 recommendations, mostly specific to the particular program characteristics)

The Red Light Camera Evaluation - Interim Report - July 1985

Red light cameras were introduced in August 1983 to deter run-the-red offences and therefore to reduce the incidence of right-angle accidents at signalised intersections in Melbourne. This report was prepared after two years of operation of the program. It provides a detailed account of the technical aspects of the program, but does not provide any detailed, evaluative analyses of accident data.

A parallel-serial binary arbitration scheme for collision-free multi-access techniques

Multi-access techniques are widely used in computer networking and distributed multiprocessor systems. On-the-fly arbitration schemes permit one of the many contenders to access the medium without collisions. Serial arbitration is cost effective but is slow and hence unsuitable for high-speed multiprocessor environments supporting very high data transfer rates. A fully parallel arbitration scheme takes less time but is not practically realisable for large numbers of contenders. In this paper, a generalised parallel-serial scheme is proposed which significantly reduces the arbitration time and is practically realisable.