Resource-efficient routing and scheduling of time-constrained streaming communication on networks-on-chip

Network-on-chip-based multiprocessor systems-on-chip are considered as future embedded systems platforms. One of the steps in mapping an application onto such a parallel platform involves scheduling the communication on the network-on-chip. This paper presents different scheduling strategies that minimize resource usage by exploiting all scheduling freedom offered by networks-on-chip. It also introduces a technique to take the dynamism in applications into account when scheduling the communication of an application on the network-on-chip while minimizing the resource usage. Our experiments show that resource-utilization is improved when compared to existing techniques.     

Perceptual issues in the use of head-mounted visual displays

OBJECTIVE: We provide a review and analysis of much of the published literature on visual perception issues that impact the design and use of head-mounted displays (HMDs). BACKGROUND: Unlike the previous literature on HMDs, this review draws heavily from the basic vision literature in order to help provide insight for future design solutions for HMDs. METHOD: Included in this review are articles and books found cited in other works as well as articles and books obtained from an Internet search. RESULTS: Issues discussed include the effect of brightness and contrast on depth of field, dark focus, dark vergence, and perceptual constancy; the effect of accommodation-vergence synergy on perceptual constancy, eyestrain, and discomfort; the relationship of field of view to the functioning of different visual pathways and the types of visual-motor tasks mediated by them; the relationship of binocular input to visual suppression; and the importance of head movements, head tracking, and display update lag. CONCLUSION: This paper offers a set of recommendations for the design and use of HMDs. APPLICATION: Consideration of the basic vision literature will provide insight for future design solutions for HMDs.     

Numerical calculations on microwave propagation through rain

Calculations on transmission effects through rain are presented. Based on a special form of the radiative transfer equation treated in [1], numerical values are given for coherent propagation through a medium composed of a set of uncanted spheroidal drops, oscillating raindrops and bistatic radar scattering crosssections of rain of uncanted spheroidal drops. Calculations have been made for the range 10–100 GHz. Examples are chosen for Ots frequency bands (11.5 and 14 GHz) and Louvainla-Neuve experimental link (12 GHz).     

Finite-element analysis for magnetic resonance image artifact evaluation

The static magnetic field of a magnetic resonance imaging scanner can be distorted by the presence of materials, perturbing the spatial encoding process in magnetic resonance imaging and often resulting in image artifacts. The relationship between the image artifact size and magnetic susceptibility of the material specimen is of interest to engineers for the design of devices that are to be compatible with the imaging volume of the scanner. In this study, a finite-element method was used to simulate the distorted magnetic field of samples with different susceptibilities. With the knowledge of the external- and self- magnetic field interactions, a Lorentz correction was applied to compute the magnetic field deviation. The simulated results were then validated by the corresponding experimental magnetic resonance images.     

An exact approach for maximizing the lifetime of sensor networks with adjustable sensing ranges

This paper addresses the problem of target coverage for wireless sensor networks, where the sensing range of sensors can vary, thereby saving energy when only close targets need to be monitored. Two versions of this problem are addressed. In the first version, sensing ranges are supposed to be continuously adjustable (up to the maximum sensing range). In the second version, sensing ranges have to be chosen among a set of predefined values common to all sensors. An exact approach based on a column generation algorithm is proposed for solving these problems. The use of a genetic algorithm within the column generation scheme significantly decreases computation time, which results in an efficient exact approach.     

Efficient solution of the 3G network planning problem

The 3G universal mobile telecommunications system (UMTS) planning problem is combinatorially explosive and difficult to solve optimally, though solution methods exist for its three main subproblems (cell, access network, and core network planning). We previously formulated the entire problem as a single integrated mixed-integer linear program (MIP) and showed that only small instances of this global planning problem can be solved to optimality by a commercial MIP solver within a reasonable amount of time ( St-Hilaire, Chamberland, & Pierre, 2006). Heuristic methods are needed for larger instances. This paper provides the first complete formulation for the heuristic sequential method ( St-Hilaire, Chamberland, & Pierre, 2005) that re-partitions the global formulation into the three conventional subproblems and solves them in sequence using a MIP solver. This greatly improves the solution time, but at the expense of solution quality. We also develop a new hybrid heuristic that uses the results of the sequential method to generate constraints that provide tighter bounds for the global planning problem with the goal of reaching the provable optimum solution much more quickly. We empirically evaluate the speed and solution accuracy of four solution methods: (i) the direct MIP solution of the global planning problem, (ii) a local search heuristic applied to the global planning problem, (iii) the sequential method and (iv) the new hybrid method. The results show that the sequential method provides very good results in a fraction of the time needed for the direct MIP solution of the global problem, and that optimum results can be provided by the hybrid heuristic in greatly reduced time.     

Good reduction of Puiseux series and applications

We have designed a new symbolic-numeric strategy for computing efficiently and accurately floating point Puiseux series defined by a bivariate polynomial over an algebraic number field. In essence, computations modulo a well-chosen prime number p are used to obtain the exact information needed to guide floating point computations. In this paper, we detail the symbolic part of our algorithm. First of all, we study modular reduction of Puiseux series and give a good reduction criterion for ensuring that the information required by the numerical part is preserved. To establish our results, we introduce a simple modification of classical Newton polygons, that we call “generic Newton polygons”, which turns out to be very convenient. Finally, we estimate the size of good primes obtained with deterministic and probabilistic strategies. Some of these results were announced without proof at ISSAC’08.     

PIXHAWK: A micro aerial vehicle design for autonomous flight using onboard computer vision

We describe a novel quadrotor Micro Air Vehicle (MAV) system that is designed to use computer vision algorithms within the flight control loop. The main contribution is a MAV system that is able to run both the vision-based flight control and stereo-vision-based obstacle detection parallelly on an embedded computer onboard the MAV. The system design features the integration of a powerful onboard computer and the synchronization of IMU-Vision measurements by hardware timestamping which allows tight integration of IMU measurements into the computer vision pipeline. We evaluate the accuracy of marker-based visual pose estimation for flight control and demonstrate marker-based autonomous flight including obstacle detection using stereo vision. We also show the benefits of our IMU-Vision synchronization for egomotion estimation in additional experiments where we use the synchronized measurements for pose estimation using the 2pt+gravity formulation of the PnP problem.