Simulation of Facial Muscle Actions Based on Rational Free Form Deformations

This paper describes interactive facilities for simulating abstract muscle actions using Rational Free Form Deformations (RFFD). The particular muscle action is simulated as the displacement of the control points of the control-unit for an RFFD defined on a region of interest. One or several simulated muscle actions constitute a Minimum Perceptible Action (MPA), which is defined as the atomic action unit, similar to Action Unit (AU) of the Facial Action Coding System (FACS), to build an expression.     

论理工类工业设计的素描教学改革

理工类学生由于入学前很少经过系统的美术专业训练,造型基础十分薄弱,但其在毕业时,其设计能力并不比文科生艺术生要求低,甚至在当今社会中,很大一部分企业对有着理工背景的专业设计人才的要求日益迫切。如何尽快地使其在长期固化的理性思维向活泼开放的感性思维,这是一个新的领域和挑战。素描作为其学习的第一门专业基础课,其改革势在必行。     

Self-intersections of rational Bézier curves

Rational Bézier curves provide a curve fitting tool and are widely used in Computer Aided Geometric Design, Computer Aided Design and Geometric Modeling. The injectivity (one-to-one property) of rational Bézier curve as a mapping function is equivalent to the curve without self-intersections. We present a geometric condition on the control polygon which is equivalent to the injectivity of rational Bézier curve with this control polygon for all possible choices of weights. The proof is based on the degree elevation and toric degeneration of rational Bézier curve.     

Requirements for Security Enhancements to Legacy Software with RUP

ABSTRACT

This article describes how to adapt a specific part of the Rational Unified Process (RUP) framework for the purpose of conducting requirements gathering for software projects aimed at adding security features to legacy software. The RUP seems particularly fitting for this purpose because it aggregates numerous software engineering terms into a common body of knowledge and strives to give them clear and unambiguous semantics. Furthermore, the RUP allows project coordinators to pick and choose only the process elements best suited to meet the particular needs of a project.

The article should prove useful to project managers, process engineers, and software architects responsible for teaching old software new security functions. It should also prove useful to organizations that have already carried out basic software security projects such as those that fix buffer overflows, teach the software to perform better data validation, replace unsafe string handling functions, and recompile code with safe exception handling. This article covers only a small and very specific part of the RUP. It interprets the RUP in ways guided by the author's experience and specializes the Requirements discipline for use in projects tasked with adding new security features to legacy software.     

使用IBM Rational Test RealTime进行嵌入式软件测试

介绍IBM Rational Test RealTime测试工具,并以单元测试为重点说明其在嵌入式软件测试中的应用。     

Toward a programming theory for rational agents

An important problem in agent verification is a lack of proper understanding of the relation between agent programs on the one hand and agent logics on the other. Understanding this relation would help to establish that an agent programming language is both conceptually well-founded and well-behaved, as well as yield a way to reason about agent programs by means of agent logics. As a step toward bridging this gap, we study several issues that need to be resolved in order to establish a precise mathematical relation between a modal agent logic and an agent programming language specified by means of an operational semantics. In this paper, we present an agent programming theory that provides both an agent programming language as well as a corresponding agent verification logic to verify agent programs. The theory is developed in stages to show, first, how a modal semantics can be grounded in a state-based semantics, and, second, how denotational semantics can be used to define the mathematical relation connecting the logic and agent programming language. Additionally, it is shown how to integrate declarative goals and add precompiled plans to the programming theory. In particular, we discuss the use of the concept of higher-order goals in our theory. Other issues such as a complete axiomatization and the complexity of decision procedures for the verification logic are not the focus of this paper and remain for future investigation. Part of this research was carried out while the first author was affiliated with the Nijmegen Institute for Cognition and Information, Radboud University Nijmegen.     

Rational wavelet decompositions of transfer functions in hardy-sobolev classes

The model approximation of transfer functions using rational wavelets (or molecular decompositions) is considered. By using techniques from Hardy-Sobolev spaces it is shown that Hilbert space methods such as a modified matching-pursuit algorithm and least-squares technique can be employed to obtain good approximations in bothH ² andH norms. Several theoretical results are given on rates of convergence when the methods are applied to delay systems and fractional filters.The research of the first author was supported by E.P.S.R.C.