Timed Specification For Web Services Compatibility Analysis

Web services are becoming one of the main technologies for designing and building complex inter-enterprise business applications. Usually, a business application cannot be fulfilled by one Web service but by coordinating a set of them. In particular, to perform a coordination, one of the important investigations is the compatibility analysis. Two Web services are said compatible if they can interact correctly. In the literature, the proposed frameworks for the services compatibility checking rely on the supported sequences of messages. The interaction of services depends also on other properties, such that the exchanged data flow. Thus, considering only supported sequences of messages seems to be insufficient. Other properties on which the services interaction can rely on, are the temporal constraints. In this paper, we focus our interest on the compatibility analysis of Web services regarding their (1) supported sequences of messages, (2) the exchanged data flow, (3) constraints related to the exchanged data flow and (4) the temporal requirements. Based on these properties, we study three compatibility classes: (i) absolute compatibility, (ii) likely compatibility and (iii) absolute incompatibility.     

Improving the definition of general constraints in UML

An important aspect in the specification of conceptual schemas is the definition of general constraints that cannot be expressed by the predefined constructs provided by conceptual modeling languages. This is generally achieved by using general-purpose languages like OCL. In this paper we propose a new approach that facilitates the definition of such general constraints in UML. More precisely, we define a profile that extends the set of predefined UML constraints by adding certain types of constraints that are commonly used in conceptual schemas. We also show how our proposal facilitates reasoning about the constraints and their automatic code generation, study the application of our ideas to the specification of two real-life applications, and present a prototype tool implementation.

Analytical benchmarks for topological optimization IV: square-shaped line support

Michell’s problem of optimizing truss topology for stress or compliance constraints under a single load condition is solved analytically for plane trusses having a square-shaped line support. Geometrical characteristics of the Hencky nets giving the truss layout are expressed in terms of Lommel functions. Analytically derived truss volumes for the above problem are compared with those of trusses supported along circles of equivalent area. Some general implications of the results are also discussed.     

A ranking selection-based particle swarm optimizer for engineering design optimization problems

Particle swarm optimization (PSO) algorithms have been proposed to solve optimization problems in engineering design, which are usually constrained (possibly highly constrained) and may require the use of mixed variables such as continuous, integer, and discrete variables. In this paper, a new algorithm called the ranking selection-based PSO (RSPSO) is developed. In RSPSO, the objective function and constraints are handled separately. For discrete variables, they are partitioned into ordinary discrete and categorical ones, and the latter is managed and searched directly without the concept of velocity in the standard PSO. In addition, a new ranking selection scheme is incorporated into PSO to elaborately control the search behavior of a swarm in different search phases and on categorical variables. RSPSO is relatively simple and easy to implement. Experiments on five engineering problems and a benchmark function with equality constraints were conducted. The results indicate that RSPSO is an effective and widely applicable optimizer for optimization problems in engineering design in comparison with the state-of-the-art algorithms in the area.     

Dynamic Control of Walking Cycle with Initiation Process for Humanoid Robot

This paper focuses on numerical method to solve the dynamic equilibrium of a humanoid robot during the walking cycle with the gait initiation process. It is based on a multi-chain strategy and a dynamic control/command architecture previously developed by Gorce. The strategy is based on correction of the trunk center of mass acceleration and force distribution of the forces exerced by the limbs on the trunk. This latter is performed by mean of a Linear Programming (LP) method. We study the gait initiation process when a subject, initially in quiet erect stance posture, performs a walking cycle. In this paper, we propose to adjust the method for the multiphases (from double support to single support) and multicriteria features of the studied movement. This is done by adapting some specific constraints and criteria in order to ensure the global stability of the humanoid robot along the task execution. For that, we use a Real-Time Criteria and Constraints Adaptation method. Simulation results are presented to demonstrate criteria and constraints influences on the dynamic stability.     

Numerical Schemes for Variational Inequalities Arising in International Asset Pricing

This paper introduces a valuation model of international pricing in the presence of political risk. Shipments between countries are charged with shipping costs and the country specific production processes are modelled as diffusion processes. The political risk is modelled as a continous time jump process that affects the drift of the returns in the politically unstable countries. The valuation model gives rise to a singular stochastic control problem that is analyzed numerically. The fundamental tools come from the theory of viscosity solutions of the associated Hamilton–Jacobi–Bellman equation which turns out to be a system of integral-differential Variational Inequalities with gradient constraints.     

发现含有第一类项目约束的频繁集的快速算法

与Apriori-like类型的算法相比,Zaki提出的基于垂直数据库结构及基于网络理论的算法将关联规则挖掘的运行速度提高了一个数量级,并且这些算法非常适合挖掘低支持度、长模式的关联规则。以Ecalt算法为原型,讨论了如何将项目约束引入关联规则挖掘过程的问题,从理论上证明了引入约束后的Eclat＋算法可以大大提高算法的效率和速度,并对相关的算法进行了比较。     

基于资源约束的并行活动优化调度方法

针对并行产品开发过程,提出了一种基资源约束的优化调度算法,首先给出了并行活动的三个定义,提出了一个使算法能够实现优化调度的综合函数,并研究了并行工程中的两个关键问题－－角色分配和反馈修改,仿真实例表明了算法的可行性。     

A constraint programming approach to cutset problems

We consider the problem of finding a cutset in a directed graph G=(V,E)$G=(V,E)$, i.e., a set of vertices that cuts all cycles in G  . Finding a cutset of minimum cardinality is NP-hard. There exist several approximate and exact algorithms, most of them using graph reduction techniques. In this paper, we propose a constraint programming approach to cutset problems and design a global constraint for computing cutsets. This cutset constraint is a global constraint over boolean variables associated to the vertices of a given graph and states that the subgraph restricted to the vertices having their boolean variable set to true is acyclic. We propose a filtering algorithm based on graph contraction operations and inference of simple boolean constraints, that has a linear time complexity in O(|E|+|V|)$O(|E|+|V|)$. We discuss search heuristics based on graph properties provided by the cutset constraint, and show the efficiency of the cutset constraint on benchmarks of the literature for pure minimum cutset problems, and on an application to log-based reconciliation problems where the global cutset constraint is mixed with other boolean constraints.     

非线性模型预测控制的现状与问题

模型预测控制的主要优点是能显式并优化处理控制量和状态量的约束。为此,主要围绕非线性预测控制的算法、稳定性鲁棒性、对偶问题和流动时域估计的最新研究成果进行综述,并阐述了理论与应用方面有待进一步研究的几个主要问题。