Observability by using viability kernels

The aim of this paper is to propose a new way to deal with observability of systems governed by ODEs, in a more general setting than the standard output equation.The primary finding is that observability over a time horizon reduces to single-valuedness of the vertical section of a set we name the observability kernel.The latter consists of the viability kernel of the output domain under the augmented system.The approach may be used either for global or local observability,to which available results on single-valuedness of multifunctions shall be applied in order to get necessary and/or sufficient characterizing conditions.Several examples are provided in order to illustrate the method.     

Parametric 3D modeling of young women's lower bodies based on shape classification

Three-dimensional (3D) human body modeling is an important research direction in the field of clothing virtual design. On the basis of 3D human body scanning, this paper studied a method to build a 3D parametric lower body model according to body classification. The research includes three main parts. (1) Anthropometry and body shape classification. We randomly selected 333 young women ages 18–25 years old in Northeast China as the experimental sample. Then we divided the lower body shape into three categories using principal component analysis and K-means clustering. (2) Determination of feature cross sections and points, and reconstruction of feature curves. According to the average values of each body type, we obtained the mean reference body by Euclidean distance method. We determined feature cross sections and points, and extracted the 3D coordinates of the feature points of the mean reference body to reconstruct the feature curves. (3) The surface lofting and establishment of parametric 3D lower body model. According to the shape characteristics of the lower body, we constructed the guiding lines for the crotch and lower limbs, and established parametric lower body models for three body types.Relevance to industry3D human modeling is an important part of garment industry digitization. This research provides an effective way to construct a parametric 3D lower body model. The method offers a reference for the parametric virtual human modeling and virtual fitting of trousers.     

Randomized function evaluation on a ring

LetR be a unidirectional asynchronous ring ofn identical processors each with a single input bit. Letf be any cyclic nonconstant function ofn boolean variables. Moran and Warmuth (1986) prove that anydeterministic algorithm that evaluatesf onR has communication complexity (n logn) bits. They also construct a family of cyclic nonconstant boolean functions that can be evaluated inO(n logn) bits by a deterministic algorithm.This contrasts with the following new results:

基于行人下肢防护的前保险杠改进分析

利用有限元方法,建立了小腿冲击器与汽车前部结构的碰撞模型,用以评价某款车保险杠系统对小腿损伤的影响。通过增加吸能部件、副保险杠加强板等方式减轻行人下肢的损伤,并通过正交试验设计研究了吸能部件的材料、吸能部件前后面之间的距离、副保险杠加强板的厚度以及副保险杠加强板前后面之间的距离对行人下肢损伤的影响。研究结果表明,经正交试验设计后的前保险杠系统能有效地减小小腿冲击器的胫骨加速度以及膝关节弯曲角度,使得下肢保护指标满足Eu-roNCAP法规要求。优化设计后的前保险杠系统更好的防护行人下肢的损伤。     

On problem transformability in VLSI

The two basic performance parameters that capture the complexity of any VLSI chip are the area of the chip,A, and the computation time,T. A systematic approach for establishing lower bounds onA is presented. This approach relatesA to the bisection flow, . A theory of problem transformation based on , which captures bothAT ² andA complexity, is developed. A fundamental problem, namely, element uniqueness, is chosen as a computational prototype. It is shown under general input/output protocol assumptions that any chip that decides ifn elements (each with (1+)lognbits) are unique must have =(nlogn), and thus, AT²=(n ²log² n), andA= (nlogn). A theory of VLSI transformability reveals the inherentAT ² andA complexity of a large class of related problems.This work was supported in part by the Semiconductor Research Corporation under contract RSCH 84-06-049-6.     

知识的属性扰动规律的不等式关系

知识的属性扰动引起知识规律的变化,这些变化的规律称为扰动规律.利用单向S-粗集和单向S-粗集对偶,给出属性扰动的知识规律的上规律.下规律的概念,并对知识规律与属性扰动的知识规律进行了讨论,提出了属性扰动知识规律(上规律,下规律)的不等式定理.     

The space complexity of unbounded timestamps

The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide information about the real-time ordering of those events. We consider the space complexity of wait-free implementations of timestamps from shared read-write registers in a system of n processes. We prove an lower bound on the number of registers required. If the timestamps are elements of a nowhere dense set, for example the integers, we prove a stronger, and tight, lower bound of n. However, if timestamps are not from a nowhere dense set, this bound can be beaten: we give an implementation that uses n − 1 (single-writer) registers. We also consider the special case of anonymous implementations, where processes are programmed identically and do not have unique identifiers. In contrast to the general case, we prove anonymous timestamp implementations require n registers. We also give an implementation to prove that this lower bound is tight. This is the first anonymous timestamp implementation that uses a finite number of registers.     

Continuous query processing over music streams based on approximate matching mechanisms

It is foreseen that more and more music objects in symbolic format and multimedia objects, such as audio, video, or lyrics, integrated with symbolic music representation (SMR) will be published and broadcasted via the Internet. The SMRs of the flowing songs or multimedia objects will form a music stream. Many interesting applications based on music streams, such as interactive music tutorials, distance music education, and similar theme searching, make the research of content-based retrieval over music streams much important. We consider multiple queries with error tolerances over music streams and address the issue of approximate matching in this environment. We propose a novel approach to continuously process multiple queries over the music streams for finding all the music segments that are similar to the queries. Our approach is based on the concept of n-grams, and two mechanisms are designed to reduce the heavy computation of approximate matching. One mechanism uses the clustering of query n-grams to prune the query n-grams that are irrelevant to the incoming data n-gram. The other mechanism records the data n-gram that matches a query n-gram as a partial answer and incrementally merges the partial answers of the same query. We implement a prototype system for experiments in which songs in the MIDI format are continuously broadcasted, and the user can specify musical segments as queries to monitor the music streams. Experiment results show the effectiveness and efficiency of the proposed approach.     

The renaming problem in shared memory systems: An introduction

Exploring the power of shared memory communication objects and models, and the limits of distributed computability are among the most exciting research areas of distributed computing. In that spirit, this paper focuses on a problem that has received considerable interest since its introduction in 1987, namely the renaming problem. It was the first non-trivial problem known to be solvable in an asynchronous distributed system despite process failures. Many algorithms for renaming and variants of renaming have been proposed, and sophisticated lower bounds have been proved, that have been a source of new ideas of general interest to distributed computing. It has consequently acquired a paradigm status in distributed fault-tolerant computing.In the renaming problem, processes start with unique initial names taken from a large name space, then deciding new names such that no two processes decide the same new name and the new names are from a name space that is as small as possible.This paper presents an introduction to the renaming problem in shared memory systems, for non-expert readers. It describes both algorithms and lower bounds. Also, it discusses strong connections relating renaming and other important distributed problems such as set agreement and symmetry breaking.