Towards human motion capture from a camera mounted on a mobile robot

This article describes a multiple feature data fusion applied to a particle filter for marker-less human motion capture (HMC) by using a single camera devoted to an assistant mobile robot. Particle filters have proved to be well suited to this robotic context. Like numerous approaches, the principle relies on the projection of the model's silhouette of the tracked human limbs and appearance features located on the model surface, to validate the particles (associated configurations) which correspond to the best model-to-image fits. Our particle filter based HMC system is improved and extended in two ways. First, our estimation process is based on the so-called AUXILIARY scheme which has been surprisingly seldom exploited for tracking purpose. This scheme is shown to outperform conventional particle filters as it limits drastically the well-known burst in term of particles when considering high dimensional state-space. The second line of investigation concerns data fusion. Data fusion is considered both in the importance and measurement functions with some degree of adaptability depending on the current human posture and the environmental context encountered by the robot. Implementation and experiments on indoor sequences acquired by an assistant mobile robot highlight the relevance and versatility of our HMC system. Extensions are finally discussed.     

On the axiomatizability of priority II

This paper contributes to the study of the equational theory of the priority operator of Baeten, Bergstra and Klop in the setting of the process algebra BCCSP. It is shown that, in the presence of at least two actions, the collection of process equations over BCCSP with the priority operator that are valid modulo bisimilarity, irrespective of the chosen priority order over actions, is not finitely based. This holds true even if one restricts oneself to the collection of valid process equations that do not contain occurrences of process variables.     

A calculus for four-valued sequential logic

We present a complete axiomatisation for four-valued sequential logic. It consists of nine axioms, from which all valid laws can be derived by equational reasoning. These nine axioms are independent of each other.     

Special factors,periodicity, and an application to Sturmian words

Let w be a finite word and n the least non-negative integer such that w has no right special factor of length and its right factor of length n is unrepeated. We prove that if all the factors of another word v up to the length n + 1 are also factors of w, thenv itself is a factor ofw. A similar result for ultimately periodic infinite words is established. As a consequence, some ‘uniqueness conditions’ for ultimately periodic words are obtained as well as an upper bound for the rational exponents of the factors of uniformly recurrent non-periodic infinite words. A general formula is derived for the ‘critical exponent’ of a power-free Sturmian word. In particular, we effectively compute the ‘critical exponent’ of any Sturmian sequence whose slope has a periodic development in a continued fraction. Received: 6 May 1999 / 21 February 2000     

Using Semantic Classification Trees for WSD

This paper describes the evaluation of a WSD method withinSENSEVAL. This method is based on Semantic Classification Trees (SCTs)and short context dependencies between nouns and verbs. The trainingprocedure creates a binary tree for each word to be disambiguated. SCTsare easy to implement and yield some promising results. The integrationof linguistic knowledge could lead to substantial improvement.     

VC^＋＋环境下利用SQL Server与Object ARX开发智能参数化刀具实体模型库

对VC^ ,SQL Server和AutoCAD相互通讯的技术进行深入研究,在此基础上利用AutoCAD的二次开发工具Object ARX完成了对刀具的参数化生成、模糊化选刀和智能化管理的刀具实体模型库系统的开发。     

Direct integration of micromachined pipettes in a flow channel forsingle DNA molecule study by optical tweezers

We have developed a micromachined flow cell consisting of a flow channel integrated with micropipettes. The flow cell is used in combination with an optical trap setup (optical tweezers) to study mechanical and structural properties of λ-DNA molecules. The flow cell was realized using silicon micromachining including the so-called buried channel technology to fabricate the micropipettes, the wet etching of glass to create the flow channel, and the powder blasting of glass to make the fluid connections. The volume of the flow cell is 2 μl. The pipettes have a length of 130 μm, a width of 5-10 μm, a round opening of 1 μm and can be processed with different shapes. Using this flow cell we stretched single molecules (λ-DNA) showing typical force-extension curves also found with conventional techniques. These pipettes can be also used for drug delivery, for injection of small gas bubbles into a liquid flow to monitor the streamlines, and for the mixing of liquids to study diffusion effects. The paper describes the design, the fabrication and testing of the flow cell     

A neural network with asymmetric basis functions for feature extraction of ECG P waves.

In this work a simple neural network with asymmetric basis functions is proposed as a feature extractor for P waves in electrocardiographic signals (ECG). The neural network is trained using the classical backward-error-propagation algorithm. The performance of the proposed network was tested using actual ECG signals and compared with other types of neural feature extractors.     

Fabrication of multilayer systems combining microfluidic andmicrooptical elements for fluorescence detection

This paper presents the fabrication of a microchemical chip for the detection of fluorescence species in microfluidics. The microfluidic network is wet-etched in a Borofloat 33 (Pyrex) glass wafer and sealed by means of a second wafer. Unlike other similar chemical systems, the detection system is realized with the help of microfabrication techniques and directly deposited on both sides of the microchemical chip. The detection system is composed of the combination of refractive microlens arrays and chromium aperture arrays. The microfluidic channels are 60 μm wide and 25 μm deep. The utilization of elliptical microlens arrays to reduce aberration effects and the integration of an intermediate (between the two bonded wafers) aluminum aperture array are also presented. The elliptical microlenses have a major axis of 400 μm and a minor axis of 350 μm. The circular microlens diameters range from 280 to 300 μm. The apertures deposited on the outer chip surfaces are etched in a 3000-Å-thick chromium layer, whereas the intermediate aperture layer is etched in a 1000-Å-thick aluminum layer. The overall thickness of this microchemical system is less than 1.6 mm. The wet-etching process and new bonding procedures are discussed. Moreover, we present the successful detection of a 10-nM Cy5 solution with a signal-to-noise ratio (SNR) of 21 dB by means of this system     

Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search

Although lexicographic (lex) variants of greedy algorithms are often P -complete, NC -algorithms are known for the following lex-search problems: lexicographic depth-first search (lex-dfs) for dags [12], [17], lexicographic breadth-first search (lex-bfs) for digraphs [12], [17], and lexicographic topological-first search (lex-tfs) for dags [12]. For the all-sources version of the problem for dense digraphs, the lex-dfs (lex-bfs, lex-tfs) in [12] is (within a log factor of) work-optimal with respect to the all-sources sequential solution that performs a dfs (bfs, tfs) from every vertex. By contrast, to solve the single-source lexicographic version on inputs of size n , all known NC -algorithms perform work that is at least an n factor away from the work performed by their sequential counterparts. We present parallel algorithms that solve the single-source version of these lex-search problems in O(log  ² n) time using M(n) processors on the EREW PRAM. (M(n) denotes the number of processors required to multiply two n\times n integer matrices in O(log  n) time and has O(n ^2.376 ) as tightest currently known bound.) They all offer a polynomial improvement in work-efficiency over that of their corresponding best previously known and close the gap between the requirements of the best known parallel algorithms for the lex and the nonlex versions of the problems. Key to the efficiency of these algorithms is the novel idea of a lex-splitting tree and lex-conquer subgraphs of a dag G from source s . These structures provide a divide-and-conquer skeleton from which NC -algorithms for several lexicographic search problems emerge, in particular, an algorithm that places in the class NC the lex-dfs for reducible flow graphs—an interesting class of graphs which arise naturally in connection with code optimization and data flow analysis [4], [19]. A notable aspect of these algorithms is that they solve the lex-search problem instance at hand by efficiently transforming solutions of appropriate instances of (nonlex) path problems. This renders them potentially capable of transferring significant algorithmic advances—such as Driscoll et al.'s [14] single-source shortest paths algorithm and Ullman and Yannakakis' [34] transitive closure algorithm—from fundamental (nonlex) path problems to lex-search problems. Received January 9, 1994, and in revised form November 1997. Online publication July 20, 2001.