An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks

Formulating the minimum concave cost capacitated network flow problem as an integer concave minimization problem, we establish finite branch and bound algorithms, in which the branching operation is the so–called integral rectangular partition and the bounding procedure is performed by the classical minimum linear cost flow problem on subnetworks. For the special case that the flow cost function is concave on a fixed number of arcs and linear on the others, an upper bound of the running time is given. Received: 19 July 1996 / Accepted: 8 July 1997     

DCKPDP：改进k-prototype聚类的差分隐私混合属性数据发布方法

当前混合属性数据发布中隐私保护方法大多存在隐私保护效果不佳或数据效用较差的问题,采用差分隐私与优化的k-prototype聚类方法相结合,提出改进k-prototype聚类的差分隐私混合属性数据发布方法(DCKPDP)。为解决传统k-prototype聚类算法没有考虑不同数值型属性对聚类结果有较大影响的问题,利用信息熵为每个数值型属性添加属性权重;为解决聚类初始中心点人为规定或者由随机算法随机确定,导致聚类结果精确度不高的问题,结合数据对象的局部密度和高密度对聚类过程中初始中心点进行自适应选择;为解决数据信息泄露风险较高的问题,对聚类中心值进行差分隐私保护。实验结果表明,DCKPDP算法满足差分隐私保护所需的噪声量更小,数据的可用性更好。     

Safe and intuitive manual guidance of a robot manipulator using adaptive admittance control towards robot agility

Key areas of robot agility include methods that increase capability and flexibility of industrial robots and facilitate robot re-tasking. Manual guidance can achieve robot agility effectively, provided that a safe and smooth interaction is guaranteed when the user exerts an external force on the end effector. We approach this by designing an adaptive admittance law that can adjust its parameters to modify the robot compliance in critical areas of the workspace, such as near and on configuration singularities, joint limits, and workspace limits, for a smooth and safe operation. Experimental validation was done with two tests: a constraint activation test and a 3D shape tracing task. In the first one, we validate the proper response to constraints and in the second one, we compare the proposed approach with different admittance parameter tuning strategies using a drawing task where the user is asked to guide the robot to trace a 3D profile with an accuracy or speed directive and evaluate performance considering path length error and execution time as metrics, and a questionnaire for user perception. Results show that appropriate response to individual and simultaneous activation of the aforementioned constraints for a safe and intuitive manual guidance interaction is achieved and that the proposed parameter tuning strategy has better performance in terms of accuracy, execution time, and subjective evaluation of users.     

高灰度级TFT-LCD显示系统的实现

提出了一种以FPGA为核心控制器的高灰度级TFT-LCD显示系统的设计方案。该系统采用幅值-帧速率控制调制-空间混合灰度调制方法,首先将10 bit的R、G、B信号分割成高8 bit数据和低2 bit数据,低2 bit数据经过空间处理后平均分到4个相邻的8 bit数据上,然后把这8 bit数据继续分割成高6 bit数据和低2 bit数据,其中高6 bit数据用于幅值调制,低2 bit数据用于帧速率控制调制,从而实现1 024个灰度等级显示。试验结果表明,该系统具有良好的显示效果和较高的显示灰度等级。     

gain bounds for systems with sector bounded and slope‐restricted nonlinearities

This paper proposes a new method for calculating a bound on the gain of a system comprising a linear time invariant part and a static nonlinear part, which is odd, bounded, zero at zero and has a restriction on its slope. The nonlinear part is also assumed to be sector bounded, with the sector bound being (possibly) different from that implied by the slope restriction. The computation of the gain bound is found by solving a set of linear matrix inequalities, which arise from an integral quadratic constraint formulation of a multiplier problem involving both Zames‐Falb and Popov multipliers. Examples illustrate the effectiveness of the results, and comparisons are made against the state‐of‐the‐art. Copyright © 2011 John Wiley & Sons, Ltd.     

Routing with multiple quality-of-services constraints: An approximation perspective

Finding a path that satisfies multiple Quality-of-Service (QoS) constraints is vital to the deployment of current emerged services. However, existing algorithms are not very efficient and effective at finding such a path. Moreover, few works focus on three or more QoS constraints. In this paper, we present an enhanced version of fully polynomial time approximation scheme (EFPTAS) for multiconstrainted path optimal (MCOP) problem. Specifically, we make four major contributions. We first allow the proposed algorithm to construct an auxiliary graph, through which the QoS parameters on each of the finding path can be guaranteed not to exceed the given constraints. Then we adopt a concept, called nonlinear definition of path constraints in EFPTAS for reducing both time and space complexity. Also, we enable EFPTAS to run iteratively to facilitate a progressive refinement of the finding result. In addition to these, we identify some “deployment” issues for proposed algorithm, the essential steps that how and when the EFPTAS takes place are presented. By analyzing the proposed algorithm theoretically, we find that the presented EFPTAS can find a (1+ε)-approximation path in the network with time complexity O(|E||V|/ε) (where |E| is the number of edges and |V| is the number of nodes), which outperforms the previous best-known algorithm for MCOP. We conduct an extensive comparison between the algorithm presented in this paper and previous best-known study experimentally, our results indicate that EFPTAS can find a path with low complexity and preferable quality.     

Augmented Lyapunov functional approach for stability of neutral systems with mixed delays

This paper is concerned with the neutral‐delay‐dependent and discrete‐delay‐dependent stability for uncertain neutral systems with mixed delays and norm‐bounded uncertainties. Through constructing a new augmented Lyapunov‐Krasovskii functional and proving its positive definiteness, introducing some slack matrices and using integral inequality, the improved delay‐dependent stability criteria are derived in terms of linear matrix inequalities. Numerical examples are given to illustrate the significant improvement on the conservatism of the delay bound over some existing results. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Semantic analysis in XTRA,an English — Chinese machine translation system

This paper concerns the resolution of lexical ambiguity in a machine translation environment. We describe the integration of principles of selection restrictions. Preference Semantics, and intelligent relaxation of constraints in handling lexical ambiguity. The approach differs from many previous MT systems in that it is more powerful than brute force systems, while more realistic than systems that assume a large degree of coded encyclopedia information for full understanding.