"Comment on 'Articulation of values'": Response to Cochran (1988).

We respond to Cochran's critique of our 1986 study, which was in part a replication of Cochran's original grid methodology for the study of career values. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Une architecture massivement parallèle intégrée

This paper presents a new massively parallel MIMD architecture, halfway between the Connection Machine and hypercubes based on 32-bit processors. It is built from specific 8-bit processors arranged in a 2-D grid and communicating by message transfers. We discuss the communication problems, the instruction set of the basic processing unit, the programmation of the whole array and the use of a high level data-flow language.     

Onr-partition designs in hamming spaces

The concept of the combinatorial matrix of an unrestricted code and the notion of anr-partition design admitted by a code are introduced and discussed in detail. The theory includes a characterization of completely regular codes, and a combinatorial interpretation of the fact that the distinct rows of the distance distribution matrix of a code are linearly independent. In general, it is possible to compute the distance distribution matrix of any code admitting a given partition design by solving a well-defined system of linear equations; this is an efficient technique provided the number of classes in the partition is relatively small.     

Multihour engineering and traffic routing optimization in hierarchical telephone networks

Classical hierarchical routing in telephone networks is extended to a wider class called out-of-chain routing in such a way that some useful properties of hierarchical routing are retained. This new routing pattern offers more potential paths than the fixed hierarchical one and can be introduced as a dynamic routing where the fixed alternate sequences change at some predetermined instants during the day. The effect of this new routing pattern on the network performances is examined. The main topic of this paper is to present heuristic methods used to optimise such routings in large networks. We show on artificial networks that the throughput of a given network can be significantly improved by suitable routing choices. We demonstrate that the integration of routing changes within a multihour dimensioning process is possible but the lack of realistic data does not permit at this time to quantify the value of routing optimization on real networks.     

Vision and navigation for the Carnegie-Mellon Navlab

A distributed architecture articulated around the CODGER (communication database with geometric reasoning) knowledge database is described for a mobile robot system that includes both perception and navigation tools. Results are described for vision and navigation tests using a mobile testbed that integrates perception and navigation capabilities that are based on two types of vision algorithms: color vision for road following, and 3-D vision for obstacle detection and avoidance. The perception modules are integrated into a system that allows the vehicle to drive continuously in an actual outdoor environment. The resulting system is able to navigate continuously on roads while avoiding obstacles     

Inhibition et mémoire de travail : effet d'une privation aigu? de sommeil sur une tache de génération aléatoire.

The literature contains inconsistent data on the effects of acute sleep deprivation on the superior cognitive functions. The primary purpose of this study is to determine the effectiveness of inhibition, one of the functions of the working memory executive centre (EC), over an extended, 36-hour waking period. Inhibition is a cognitive mechanism whereby individuals ignore non-relevant information recorded in their working memory. We also tested the effects of a 36- hour period of acute sleep deprivation on simple reaction time. Twelve young, healthy volunteers (M=21.5 years, ?=2.3) performed a random generation task involving letters and a simple reaction time psychomotor test over four sessions held at 10-hour intervals. Each participant was assigned a "constant routine." Participants were kept awake in a prone position within a room whose environment was held strictly constant (light, noise, temperature, meals, etc.). This control procedure provided assurance that any variation in participant performance was solely caused by sleep deprivation. The random generation task, nearly two minutes in length, consisted in verbally producing a sequence of 100 letters in a random fashion (i.e. by inhibiting, for example, alphabetical order) and by keeping to a set rhythm... (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Multi-heuristic scheduling: three approaches to tune compromises

Most of the available industrial schedulers are based on a simulation approach using dispatching rules. These rules are often dedicated to the satisfaction of a single performance criterion, and are used whatever the characteristics of the workshop or of the set of jobs. An approach which allows one to bring in compromises between rules is set out in this paper. These compromises can be parametered in accordance with the objectives of the workshop and the characteristics of the jobs in order to introduce some reactivity in the decision system. Three ways to set up the parameters are compared: experimental design, fuzzy expert system and neural network. The method allowing one to define compromises can be implemented on each scheduler that uses a simulation approach. Tests have been made with an industrial scheduler called SIPAPLUS, the results of which are developed in this paper.     

A clustering method to distribute a database on a grid

Clusters and grids of workstations provide available resources for data mining processes. To exploit these resources, new distributed algorithms are necessary, particularly concerning the way to distribute data and to use this partition. We present a clustering algorithm dubbed Progressive Clustering that provides an “intelligent” distribution of data on grids. The usefulness of this algorithm is shown for several distributed datamining tasks.     

Theoretical analysis of a fractal surface radiation

We compare, in this paper, the far field radiated by two fractal distributions of current. The first one is obtained by a fractal cut following the Cantor arrangement, the second one keeps the length of each previous current element, but modifies the distance between the elements which is now taken as a constant. We establish the analytical formulations of the far field at any step n of the Cantor set. Then, we extract the array factor and we analyse and compare the following properties : convergence of the radiation pattern, wide of the main lobe, side lobes level and directivity.