On Space-Time Trade-Off for Montgomery Multipliers over Finite Fields

La multiplication dans le corps de Galois à 2^m éléments (i.e. GF(2^m)) est une opérations très importante pour les applications de la théorie des correcteurs et de la cryptographie. Dans ce mémoire, nous nous intéressons aux réalisations parallèles de multiplicateurs dans GF(2^m) lorsque ce dernier est généré par des trinômes irréductibles. Notre point de départ est le multiplicateur de Montgomery qui calcule A(x)B(x)x^(-u) efficacement, étant donné A(x), B(x) in GF(2^m) pour u choisi judicieusement. Nous étudions ensuite l'algorithme diviser pour régner PCHS qui permet de partitionner les multiplicandes d'un produit dans GF(2^m) lorsque m est impair. Nous l'appliquons pour la partitionnement de A(x) et de B(x) dans la multiplication de Montgomery A(x)B(x)x^(-u) pour GF(2^m) même si m est pair. Basé sur cette nouvelle approche, nous construisons un multiplicateur dans GF(2^m) généré par des trinôme irréductibles. Une nouvelle astuce de réutilisation des résultats intermédiaires nous permet d'éliminer plusieurs portes XOR redondantes. Les complexités de temps (i.e. le délais) et d'espace (i.e. le nombre de portes logiques) du nouveau multiplicateur sont ensuite analysées: 1. Le nouveau multiplicateur demande environ 25% moins de portes logiques que les multiplicateurs de Montgomery et de Mastrovito lorsque GF(2^m) est généré par des trinômes irréductible et m est suffisamment grand. Le nombre de portes du nouveau multiplicateur est presque identique à celui du multiplicateur de Karatsuba proposé par Elia. 2. Le délai de calcul du nouveau multiplicateur excède celui des meilleurs multiplicateurs d'au plus deux évaluations de portes XOR. 3. Nous determinons le délai et le nombre de portes logiques du nouveau multiplicateur sur les deux corps de Galois recommandés par le National Institute of Standards and Technology (NIST). Nous montrons que notre multiplicateurs contient 15% moins de portes logiques que les multiplicateurs de Montgomery et de Mastrovito au coût d'un délai d'au plus une porte XOR supplémentaire. De plus, notre multiplicateur a un délai d'une porte XOR moindre que celui du multiplicateur d'Elia au coût d'une augmentation de moins de 1% du nombre total de portes logiques.

An Exponentially Convergent Nonpolynomial Finite Element Method for Time-Harmonic Scattering from Polygons

In recent years nonpolynomial finite element methods have received increasing attention for the efficient solution of wave problems. As with their close cousin the method of particular solutions, high efficiency comes from using solutions to the Helmholtz equation as basis functions. We present and analyze such a method for the scattering of two-dimensional scalar waves from a polygonal domain that achieves exponential convergence purely by increasing the number of basis functions in each element. Key ingredients are the use of basis functions that capture the singularities at corners and the representation of the scattered field towards infinity by a combination of fundamental solutions. The solution is obtained by minimizing a least-squares functional, which we discretize in such a way that a matrix least-squares problem is obtained. We give computable exponential bounds on the rate of convergence of the least-squares functional that are in very good agreement with the observed numerical convergence. Challenging numerical examples, including a nonconvex polygon with several corner singularities, and a cavity domain, are solved to around 10 digits of accuracy with a few seconds of CPU time. The examples are implemented concisely with MPSpack, a MATLAB toolbox for wave computations with nonpolynomial basis functions, developed by the authors. A code example is included.

Robust finite-horizon Kalman filtering for uncertain discrete-time systems

In this note, we propose a design for a robust finite-horizon Kalman filtering for discrete-time systems suffering from uncertainties in the modeling parameters and uncertainties in the observations process (missing measurements). The system parameter uncertainties are expected in the state, output and white noise covariance matrices. We find the upper-bound on the estimation error covariance and we minimize the proposed upper-bound.

Tracking single bubble in Hall-Héroult aluminium cell : an experimental and numerical study

In simulations of the hydrodynamics of the multiphase flow in gas– liquid systems with finite sizes of bubbles, the important thing is to compute explicitly the time evolution of the gas–liquid interface in many engineering applications. The most commonly used methods representing this approach are: the volume of fluid and the phase field methods. The later has gained significant interest because of its capability of performing numerical computations on a fixed Cartesian grid without having to parametrise these objects (Eulerian approach) and at the same time it allows to follow the interface ( for example bubble’s shape) that change the topology. In this paper, both numerical (phase field method) and experimental results for the bubble shapes underneath a downward facing plane is presented. Experiments are carried out to see the bubble sliding motion underneath a horizontal and inclined anode. It is assumed that the bubble formed under the anode surface is deformed (flattened) due to buoyant field before it goes around the anode corner. The bubble elongates to form a tail-like shape. The change in shape of the bubble is almost instantaneous and has a significant effect on the localised hydrodynamics around the bubble, which could influence the dynamics of the flow patterns in the Hall–Héroult cell. This deformation is the main cause of the bubble wake and the induced flow field in the aluminium cell. Various parameters such as bubble size, deformation and its sliding mechanism at different surface tensions are discussed and compared with experimental results.

Tracking of maternal self-efficacy for limiting young children's television viewing and associations with children's television viewing time: a longitudinal analysis over 15-months

BACKGROUND: Mothers' self-efficacy for limiting their children's television viewing is an important correlate of this behaviour in young children. However, no studies have examined how maternal self-efficacy changes over time, which is potentially important during periods of rapid child development. This study examined tracking of maternal self-efficacy for limiting young children's television viewing over 15-months and associations with children's television viewing time. METHODS: In 2008 and 2010, mothers (n = 404) from the Melbourne InFANT Program self-reported their self-efficacy for limiting their child's television viewing at 4- and 19-months of age. Tertiles of self-efficacy were created at each time and categorised into: persistently high, persistently low, increasing or decreasing self-efficacy. Weighted kappa and multinomial logistic regression examined tracking and demographic and behavioural predictors of change in self-efficacy. A linear regression model examined associations between tracking categories and children's television viewing time. RESULTS: Tracking of maternal self-efficacy for limiting children's television viewing was low (kappa = 0.23, p < 0.001). Mothers who had persistently high or increasing self-efficacy had children with lower television viewing time at 19-months (β = -35.5; 95 % CI = -54.4,-16.6 and β = 37.0; 95 % CI = -54.4,-19.7, respectively). Mothers of children with difficult temperaments were less likely to have persistently high self-efficacy. Mothers who met adult physical activity guidelines had 2.5 greater odds of increasing self-efficacy. CONCLUSIONS: Interventions to increase and maintain maternal self-efficacy for limiting children's television viewing time may result in lower rates of this behaviour amongst toddlers. Maternal and child characteristics may need to be considered when tailoring interventions.

Labeled random finite sets and the bayes multi-target tracking filter

An analytic solution to the multi-target Bayes recursion known as the δ-Generalized Labeled Multi-Bernoulli ( δ-GLMB) filter has been recently proposed by Vo and Vo in [“Labeled Random Finite Sets and Multi-Object Conjugate Priors,” IEEE Trans. Signal Process., vol. 61, no. 13, pp. 3460-3475, 2014]. As a sequel to that paper, the present paper details efficient implementations of the δ-GLMB multi-target tracking filter. Each iteration of this filter involves an update operation and a prediction operation, both of which result in weighted sums of multi-target exponentials with intractably large number of terms. To truncate these sums, the ranked assignment and K-th shortest path algorithms are used in the update and prediction, respectively, to determine the most significant terms without exhaustively computing all of the terms. In addition, using tools derived from the same framework, such as probability hypothesis density filtering, we present inexpensive (relative to the δ-GLMB filter) look-ahead strategies to reduce the number of computations. Characterization of the L1-error in the multi-target density arising from the truncation is presented.

Dynamic Tracking with Zero Variation and Disturbance Rejection Applied to Discrete-Time Systems

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Application of Time-Delay Estimation to Mixed Reality Multisensor Tracking

Spatial tracking is one of the most challenging and important parts of Mixed Reality environments. Many applications, especially in the domain of Augmented Reality, rely on the fusion of several tracking systems in order to optimize the overall performance. While the topic of spatial tracking sensor fusion has already seen considerable interest, most results only deal with the integration of carefully arranged setups as opposed to dynamic sensor fusion setups. A crucial prerequisite for correct sensor fusion is the temporal alignment of the tracking data from several sensors. Tracking sensors are typically encountered in Mixed Reality applications, are generally not synchronized. We present a general method to calibrate the temporal offset between different sensors by the Time Delay Estimation method which can be used to perform on-line temporal calibration. By applying Time Delay Estimation on the tracking data, we show that the temporal offset between generic Mixed Reality spatial tracking sensors can be calibrated. To show the correctness and the feasibility of this approach, we have examined different variations of our method and evaluated various combinations of tracking sensors. We furthermore integrated this time synchronization method into our UBITRACK Mixed Reality tracking framework to provide facilities for calibration and real-time data alignment.

Time-variable gravity signal in Greenland revealed by high-low satellite-to-satellite tracking

[1] In the event of a termination of the Gravity Recovery and Climate Experiment (GRACE) mission before the launch of GRACE Follow-On (due for launch in 2017), high-low satellite-to-satellite tracking (hl-SST) will be the only dedicated observing system with global coverage available to measure the time-variable gravity field (TVG) on a monthly or even shorter time scale. Until recently, hl-SST TVG observations were of poor quality and hardly improved the performance of Satellite Laser Ranging observations. To date, they have been of only very limited usefulness to geophysical or environmental investigations. In this paper, we apply a thorough reprocessing strategy and a dedicated Kalman filter to Challenging Minisatellite Payload (CHAMP) data to demonstrate that it is possible to derive the very long-wavelength TVG features down to spatial scales of approximately 2000 km at the annual frequency and for multi-year trends. The results are validated against GRACE data and surface height changes from long-term GPS ground stations in Greenland. We find that the quality of the CHAMP solutions is sufficient to derive long-term trends and annual amplitudes of mass change over Greenland. We conclude that hl-SST is a viable source of information for TVG and can serve to some extent to bridge a possible gap between the end-of-life of GRACE and the availability of GRACE Follow-On.