基于软件体系结构的反射式中间件研究

Internet为分布应用提供了一种开放、动态的运行环境,这要求分布应用的主要基础设施中间件能够支持运行时查看并调整平台内部状态和行为,由此产生了反射式中间件.目前的反射式中间件研究与实践存在3个不足:注重系统局部或单个实体的反射而缺乏全局视图;注重中间件平台内部功能的反射,而对上层应用的反射不够;集中于CORBA平台,而对J2EE平台的反射性研究较少.介绍了一个反射式的J2EE应用服务器PKUAS.基于构件化的平台内部体系结构,PKUAS引入软件体系结构作为全局视图以实现反射体系对系统整体的表示和控制,作为J2EE应用服务器,PKUAS可反射底层平台以及上层EJB构件.同时,以PKUAS实时监控工具为例,探讨了如何利用基于软件体系结构的反射体系管理整个系统,并给出了PKUAS与其他几种反射式中间件的比较.该工作有效地解决了现阶段反射式中间件研究的不足,提高了反射式中间件的实用性.     

Rigidity Constraints for Large Mesh Deformation

It is a challenging problem of surface-based deformation to avoid apparent volumetric distortions around largely deformed areas. In this paper, we propose a new rigidity constraint for gradient domain mesh deformation to address this problem. Intuitively the proposed constraint can be regarded as several small cubes defined by the mesh vertices through mean value coordinates. The user interactively specifies the cubes in the regions which are prone to volumetric distortions, and the rigidity constraints ...     

An Improved Markov Model for IEEE 802.15.4 Slotted CSMA/CA Mechanism

IEEE 802.15.4 protocol is proposed to meet the low latency and energy consumption needs in low-rate wireless applications,however,few analytical models are tractable enough for comprehensive evaluation of the protocol.To evaluate the IEEE 802.15.4 slotted CSMA/CA channel access mechanism in this paper,we propose a practical and accurate discrete Markov chain model,which can dynamically represent different network loads.By computing the steady-state distribution probability of the Markov chain,we obtain a...     

Symbolic Algorithmic Analysis of Rectangular Hybrid Systems

This paper investigates symbolic algorithmic analysis of rectangular hybrid systems.To deal with the symbolic reachability problem,a restricted constraint system called hybrid zone is formalized for the representation and manipulation of rectangular automata state-spaces.Hybrid zones are proved to be closed over symbolic reachability operations of rectangular hybrid systems.They are also applied to model-checking procedures for verifying some important classes of timed computation tree logic formulas.To ...     

Demand-Driven Memory Leak Detection Based on Flow- and Context-Sensitive Pointer Analysis

We present a demand-driven approach to memory leak detection algorithm based on flow- and context-sensitive pointer analysis. The detection algorithm firstly assumes the presence of a memory leak at some program point and then runs a backward analysis to see if this assumption can be disproved. Our algorithm computes the memory abstraction of programs based on points-to graph resulting from flow- and context-sensitive pointer analysis. We have implemented the algorithm in the SUIF2 compiler infrastructure and used the implementation to analyze a set of C benchmark programs. The experimental results show that the approach has better precision with satisfied scalability as expected. This work is supported by the National Natural Science Foundation of China under Grant Nos. 60725206, 60673118, and 90612009, the National High-Tech Research and Development 863 Program of China under Grant No. 2006AA01Z429, the National Basic Research 973 Program of China under Grant No. 2005CB321802, the Program for New Century Excellent Talents in University under Grant No. NCET-04-0996, and the Hunan Natural Science Foundation under Grant No. 07JJ1011.     

Efficient Optimization of Multiple Subspace Skyline Queries

We present the first efficient sound and complete algorithm （i.e., AOMSSQ） for optimizing multiple subspace skyline queries simultaneously in this paper. We first identify three performance problems of the na/ve approach （i.e., SUBSKY） which can be used in processing arbitrary single-subspace skyline query. Then we propose a cell-dominance computation algorithm （i.e., CDCA） to efficiently overcome the drawbacks of SUBSKY. Specially, a novel pruning technique is used in CDCA to dramatically decrease the query time. Finally, based on the CDCA algorithm and the share mechanism between subspaces, we present and discuss the AOMSSQ algorithm and prove it sound and complete. We also present detailed theoretical analyses and extensive experiments that demonstrate our algorithms are both efficient and effective.     

A Trust-Based Approach to Estimating the Confidence of the Software System in Open Environments

Emerging with open environments, the software paradigms, such as open resource coalition and Internetware, present several novel characteristics including user-centric, non-central control, and continual evolution. The goal of obtaining high confidence on such systems is more di?cult to achieve. The general developer-oriented metrics and testing-based methods which are adopted in the traditional measurement for high confidence software seem to be infeasible in the new situation. Firstly, the software develo...     

Summarizing Vocabularies in the Global Semantic Web

In the Semantic Web, vocabularies are defined and shared among knowledge workers to describe linked data for scientific, industrial or daily life usage. With the rapid growth of online vocabularies, there is an emergent need for approaches helping users understand vocabularies quickly. In this paper, we study the summarization of vocabularies to help users understand vocabularies. Vocabulary summarization is based on the structural analysis and pragmatics statistics in the global Semantic Web. Local Bipa...     

Min-max model predictive control for constrained nonlinear systems via multiple LPV embeddings

A min-max model predictive control strategy is proposed for a class of constrained nonlinear system whose trajectories can be embedded within those of a bank of linear parameter varying (LPV) models. The embedding LPV models can yield much better approximation of the nonlinear system dynamics than a single LTV model. For each LPV model, a parameter-dependent Lyapunov function is introduced to obtain poly-quadratically stable control law and to guarantee the feasibility and stability of the original nonlinear system. This approach can greatly reduce computational burden in traditional nonlinear predictive control strategy. Finally a simulation example illustrating the strategy is presented. Supported by the National Natural Science Foundation of China (Grant Nos. 60774015, 60825302, 60674018), the National High-Tech Research & Development Program of China (Grant No. 2007AA041403), the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20060248001), and partly by Shanghai Natural Science Foundation (Grant No. 07JC14016)     

New delay-dependent criterion for the stability of recurrent neural networks with time-varying delay

This paper is concerned with the global asymptotic stability of a class of recurrent neural networks with interval time-varying delay. By constructing a suitable Lyapunov functional, a new criterion is established to ensure the global asymptotic stability of the concerned neural networks, which can be expressed in the form of linear matrix inequality and independent of the size of derivative of time varying delay. Two numerical examples show the effectiveness of the obtained results. Supported by the National Natural Science Foundation of China (Grant Nos. 60534010, 60728307, 60774048, 60774093), the Program for Cheung Kong Scholars and Innovative Research Groups of China (Grant No. 60521003) and the National High-Tech Research & Development Program of China (Grant No. 2006AA04Z183), China Postdoctoral Sciencer Foundation (Grant No. 20080431150), and the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No. 200801451096)     

Receding horizon estimation to networked control systems with multirate scheme

This paper investigates the problem of receding horizon state estimation for networked control systems (NCSs) with random network-induced delays less than one sample period, which are formulated as multirate control systems. Based on a batch of recent past slow rate measurements in a finite horizon window, the initial state estimation in this window is solved by minimizing a receding-horizon objective function, and then the fast rate state estimations are calculated by the prediction of dynamic equation to compensate for the network-induced time delays. Furthermore, convergence results and unbiasedness properties are analyzed. An upper bound of estimation error is presented under the assumption of bounded disturbances acting on the system and measurement equations. A simulation example shows the effectiveness of the proposed method. Supported by the National Natural Science Foundation of China (Grant Nos. 60774015, 60674018, 60825302), the National High-Tech Research & Development Program of China (Grant No. 2006AA04Z173), the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20060248001), and partly by Shanghai Natural Science Foundation (Grant No. 07JC14016)     

Expressing First-Order pi-Calculus in Higher-Order Calculus of Communicating Systems

In the study of process calculi, encoding between different calculi is an effective way to compare the expressive power of calculi and can shed light on the essence of where the difference lies. Thomsen and Sangiorgi have worked on the higher-order calculi (higher-order Calculus of Communicating Systems (CCS) and higher-orderπ-calculus, respectively) and the encoding from and to first-orderπ-calculus. However a fully abstract encoding of first-orderπ-calculus with higher-order CCS is not available up-tod...     

Boolean Operations on Conic Polygons

An algorithm for Boolean operations on conic polygons is proposed.Conic polygons are polygons consisting of conic segments or bounded conics with directions.Preliminaries of Boolean operations on general polygons are presented.In our algorithm,the intersection points and the topological relationships between two conic polygons are computed.Boundaries are obtained by tracking path and selecting uncrossed boundaries following rule tables to build resulting conic polygons. We define a set of rules for the i...     

Algebraic properties on the cuts of lattice-valued regular languages

In this paper, the algebraic operations on the cuts of lattice-valued regular languages are studied. Some sufficient conditions are given to guarantee the family of the cuts of lattice-valued regular languages to be closed under such algebraic operations as union, intersection, complement, quotient, homomorphism, inverse homomorphism, concatennation, reversal, etc. This work is supported by National Science Foundation of China (Grant No.10571112), “TRAPOYT” of China and National 973 Foundation Research Program (Grant No. 2002CB312200).     

Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs

The constrained minimum vertex cover problem on bipartite graphs (the Min-CVCB problem) is an important NP-complete problem. This paper presents a polynomial time approximation algorithm for the problem based on the technique of chain implication. For any given constant ε > 0, if an instance of the Min-CVCB problem has a minimum vertex cover of size (ku, kl), our algorithm constructs a vertex cover of size (ku*, kl* ), satisfying max{ku*/ku, kl* /kl} 1 ε.     

Evaluation for Small Visual Difference Between Conforming Meshes on Strain Field

This paper gives a method of quantifying small visual differences between 3D mesh models with conforming topology, based on the theory of strain fields. Strain field is a geometric quantity in elasticity which is used to describe the deformation of elastomer. In this paper we consider the 3D models as objects with elasticity. The further demonstrations are provided: the first is intended to give the reader a visual impression of how our measure works in practice; and the second is to give readers a visua...     

A 485ps 64-Bit Parallel Adder in 0.18$\mu$m CMOS

This paper presents an optimized 64-bit parallel adder. Sparse-tree architecture enables low carry-merge fan-outs and inter-stage wiring complexity. Single-rail and semi-dynamic circuit improves operation speed. Simulation results show that the proposed adder can operate at 485ps with power of 25.6mW in 0.18μm CMOS process. It achieves the goal of higher speed and lower power.     

Lumiproxy: A Hybrid Representation of Image-Based Models

In this paper,we present a hybrid representation of image-based models combining the textured planes and the hierarchical points.Taking a set of depth images as input,our method starts from classifying input pixels into two categories,indicating the planar and non-planar surfaces respectively.For the planar surfaces,the geometric coefficients are reconstructed to form the uniformly sampled textures.For nearly planar surfaces,some textured planes,called lumiproxies, are constructed to represent the equiva...     

Removing local irregularities of triangular meshes with highlight line models

The highlight line model is a powerful tool in assessing the quality of a surface. It increases the flexibility of an interactive design environment. In this paper, a method to generate a highlight line model on an arbitrary triangular mesh is presented. Based on the highlight line model, a technique to remove local shape irregularities of a triangular mesh is then presented. The shape modification is done by solving a minimization problem and performing an iterative procedure. The new technique improves not only the shape quality of the mesh surface, but also the shape of the highlight line model. It provides an intuitive and yet suitable method for locally optimizing the shape of a triangular mesh. Supported by National Science Foundation of China (Grant Nos. 60533070, 60625202), National Basic Research Program of China (Grant No. 2004CB719400), National High-Tech Research & Development Program of China (Grant No. 2007AA040401), Fok Ying Tung Education Foundation (Grant No. 111070), National Science Foundation of USA (Grant Nos. DMI-0422126, DMS-0310645), and Kentucky Science & Technology Corporation (Grant No. COMM-Fund-712)