Simultaneous automated design of structured QFT controller and prefilter using nonlinear programming

This paper describes a nonlinear programming‐based robust design methodology for controllers and prefilters of a predefined structure for the linear time‐invariant systems involved in the quantitative feedback theory. This controller and prefilter synthesis problem is formulated as a single optimization problem with a given performance optimization objective and constraints enforcing stability and various specifications usually enforced in the quantitative feedback theory. The focus is set on providing constraints expression that can be used in standard nonlinear programming solvers. The nonlinear solver then computes in a single‐step controller and prefilter design parameters that satisfy the prescribed constraints and maximizes the performance optimization objective. The effectiveness of the proposed approach is demonstrated through a variety of difficult design cases like resonant plants, open‐loop unstable plants, and plants with variation in the time delay. Copyright © 2016 John Wiley & Sons, Ltd.     

基于工程管理的南海地质数据库

从南海地质数据资源、工程实例出发,结合高级语言设计和开发了基于工程管理的南海地质信息数据库系统.该系统设计实现了南海地质信息数据共享、数据融合、数据分析,简单快捷的结合到工程实例中,并应用ADO、DAO、OLE等计算机技术实现的数据资源快速导入、导出便于工程应用的目的.对工程中土的性质做详细的介绍,包括随深度的下降有效重度、抗剪强度、单位表面摩阻力、单位桩端阻力的变化情况.可以按层号、深度、土体性质等不同的条件进行查找.汇总功能可以绘制曲线,比较同一工程土体参数和不同工程之间的参数等,对工程设计和施工进行指导.     

Modeling contextual security policies

As computer infrastructures become more complex, security models must provide means to handle more flexible and dynamic requirements. In the Organization Based Access Control (OrBAC) model, it is possible to express such requirements using the notion of context. In OrBAC, each security rule (permission, prohibition, obligation or dispensation) only applies in a given context. A context is viewed as an extra condition that must be satisfied to activate a given security rule. In this paper, we present a taxonomy of different types of context and investigate the data the information system must manage in order to deal with these different contexts. We then explain how to model and evaluate them in the OrBAC model.

Clock constraint specification language: specifying clock constraints with UML/MARTE

The Object Management Group (OMG) unified modeling language (UML) profile for modeling and analysis of real-time and embedded systems (MARTE) aims at using the general-purpose modeling language UML in the domain of real-time and embedded (RTE) systems. To achieve this goal, it is absolutely required to introduce inside the mainly untimed UML an unambiguous time structure which MARTE model elements can rely on to build precise models amenable to formal analysis. The MARTE Time model has defined such a structure. We have also defined a non-normative concrete syntax called the clock constraint specification language (CCSL) to demonstrate what can be done based on this structure. This paper gives a brief overview of this syntax and its formal semantics, and shows how existing UML model elements can be used to apply this syntax in a graphical way and benefit from the semantics.     

Log-based mining techniques applied to Web service composition reengineering

Web service compositions are becoming more and more complex, involving numerous interacting ad-hoc services. These services are often implemented as business processes themselves. By analysing such complex web service compositions one is able to better understand, control and eventually re-design them. Our contribution to this problem is a mining algorithm, based on a statistical technique to discover composite web service patterns from execution logs. Our approach is characterised by a “local” pattern’s discovery that covers partial results through a dynamic programming algorithm. Those locally discovered patterns are then composed iteratively until the composite Web service is discovered. The analysis of the disparities between the discovered model and the initial ad-hoc composite model (delta-analysis) enables initial design gaps to be detected and thus to re-engineer the initial Web service composition.     

Continuous planar phospholipid bilayer supported on porous silicon thin film reflector

Reconstituting artificial membranes for in vitro studies of cell barrier mechanisms and properties is of major interest in biology. Here, artificial membranes supported on porous silicon photonic crystal reflectors are prepared and investigated. The materials are of interest for label-free probing of supported membrane events such as protein binding, molecular recognition, and transport. The porous silicon substrates are prepared as multilayered films consisting of a periodically varying porosity, with pore dimensions of a few nanometers in size. Planar phospholipid bilayers are deposited on the topmost surface of the oxidized hydrophilic mesoporous silicon films. Atomic force microscopy provides evidence of continuous bilayer deposition at the surface, and optical measurements indicate that the lipids do not significantly infiltrate the porous region. The presence of the supported bilayer does not obstruct the optical spectrum from the porous silicon layer, suggesting that the composite structures can act as effective optical biosensors.     

Property Testing of Regular Tree Languages

We consider the edit distance with moves on the class of words and the class of ordered trees. We first exhibit a simple tester for the class of regular languages on words and generalize it to the class of ranked and unranked regular trees. We also show that this distance problem is -complete on ordered trees. A preliminary version of this paper appeared in Proceedings of 31st International Colloquium on Automata, Languages and Programming, volume 3142 of Lecture Notes in Computer Science, pages 932–944, Springer, 2005. Work supported by ACI Sécurité Informatique: VERA of the French Ministry of research.     

一种安全电子招标系统中专家抽取的方法*

介绍了基于PKI架构的公开电子招标系统中专家管理信息系统的专家抽取方法。该方法通过使用加密技术解决专家抽取过程中的安全问题。采用盲签名协议保证抽取信息的机密性、真实性和不可否认性;通过随机算法保证抽取结果的随机化。在基于Web的客户端,监督方在监控抽取过程中对抽取信息未知的情况下签名,确认抽取结果,抽取结果在公布时,获得带有监督方签名的抽取结果。     

Privacy-preserving boosting

We describe two algorithms, BiBoost (Bipartite Boosting) and MultBoost (Multiparty Boosting), that allow two or more participants to construct a boosting classifier without explicitly sharing their data sets. We analyze both the computational and the security aspects of the algorithms. The algorithms inherit the excellent generalization performance of AdaBoost. Experiments indicate that the algorithms are better than AdaBoost executed separately by the participants, and that, independently of the number of participants, they perform close to AdaBoost executed using the entire data set. Responsible Editor: Charu Aggarwal.     

Algorithms for the Homogeneous Set Sandwich Problem

A homogeneous set is a non-trivial module of a graph, i.e. a non-empty, non-unitary, proper subset of a graph's vertices such that all its elements present exactly the same outer neighborhood. Given two graphs the Homogeneous Set Sandwich Problem (HSSP) asks whether there exists a sandwich graph which has a homogeneous set. In 2001 Tang et al. published an all-fast algorithm which was recently proven wrong, so that the HSSP's known upper bound would have been reset thereafter at the former determined by Cerioli et al. in 1998. We present, notwithstanding, new deterministic algorithms which have it established at We give as well two even faster randomized algorithms, whose simplicity might lend them didactic usefulness. We believe that, besides providing efficient easy-to-implement procedures to solve it, the study of these new approaches allows a fairly thorough understanding of the problem.