With the program HistCiteTM it is possible to generate and visualize the most relevant papers in a set of documents retrieved from the Science Citation Index. Historical reconstructions of scientific developments can be represented chronologically as developments in networks of citation relations extracted from scientific literature. This study aims to go beyond the historical reconstruction of...

We study in the laboratory threeand four-player, two-action, dominance solvable games of complete information. We consider sequential and simultaneous versions of games that have the same equilibrium actions, and use mousetracking to determine which payoffs subjects pay attention to. We find slightly more equilibrium choices in sequential than in simultaneous, and an overall good fit of level k...

The monitoring of one's own spatial orientation depends on the ability to estimate successive self-motion cues accurately. This process has become to be known as path integration. A feature of sequential cue estimation, in general, is that the history of previously experienced stimuli, or priors, biases perception. Here, we investigate how during angular path integration, the prior imparted by ...

This paper investigates the relationship between multi-cycle false paths and the testability of sequential circuits. We show that removal of multi-cycle false paths (either by circuit restructuring or by proper state encoding) improves circuit testability, but not as signiicantly as one would expect. We demonstrate the inability of current structure-based scan register selection techniques to s...

This paper focuses on optimal path planning for vehicles in known environments. Previous work has presented mixed integer linear programming (MILP) formulations, which suffer from scalability issues as the number of obstacles, and hence the number of integer variables, increases. In order to address MILP scalability, a novel three-stage algorithm is presented which first computes a desirable pa...

In this paper, a unified sequential architecture for 8-point discrete cosine transform and its inverse is described. The architecture is based on rescheduled constant geometry algorithms, which are mapped onto a one-dimensional structure with the aid of vertical projection. The resulting modular architecture can be efficiently pipelined since arithmetic units are removed from the critical path....

In this contribution we present two interior-point path-following algorithms that solve the convex optimisation problem that arises in recentred barrier function model predictive control (MPC), which includes standard MPC as a limiting case. However the optimisation problem that arises in nonlinear MPC may not be convex. In this case we propose sequential convex programming (SCP) as an alternat...

This study used a sample of 551 children surveyed yearly from ages 6 to 13 to examine the longitudinal associations among early behavior, middle-childhood peer rejection and friendedness, and early-adolescent depressive symptoms, loneliness, and delinquency. The study tested a sequential mediation hypothesis in which (a) behavior problems in the early school years are associated with middle-chi...