FaSa: A fast and stable quadratic placement algorithm

Placement is a critical step in VLSI design because it dominates overall speed and quality of design flow.In this paper,a new fast and stable placement algorithm called FaSa is proposed.It uses quadratic programming model and Lagrange multiplier method to solve placement problems.And an incremental LU factorization method is used to solve equations for speeding up.The experimental results show that FaSa is very stable,much faster than previous algorithms and its total wire length is comparable with other algorithms.     

基于时间序列相似性聚类的应用研究综述

在综合分析近年来时间序列数据挖掘相关文献的基础上从时间序列分割、相似性度量、时间序列聚类等方面对时间序列数据挖掘进行了综述,简要分析了基于时间序列相似性聚类的研究现状,对比较流行的算法进行了比较分析,对当前一些未解决的问题进行了简要介绍,并在此基础上对未来的发展趋势进行了展望,为研究者了解最新的基于时间序列相似性聚类研究动态、新技术及发展趋势提供了参考.     

用改进的信赖域方法求解二次插值模型

一种改进的信赖域方法被用来解无约束最优化问题,当目标函数的导数信息不可利用或者求解目标函数的导数代价太大。通常,考虑用二次插值模型来逼近目标函数,并且用传统的信赖域方法求解这个二次模型。传统的信赖域方法将被改进,并且形成两个改进的信赖域子问题。改进的信赖域方法的创新点在于:求解二次模型在一个参数化的信赖域中,修改这个模型在另一个参数化的信赖域当中。在这两个新的信赖域中,可以分别很快地找到一个好的下降方向和一个具有均衡性的插值点。这个改进的方法不但节省了函数值计算次数而且提高了解的精度。实验结果表明,针对测试问题,提出的方法的确是优于传统的信赖域方法的。     

A Parameterization Method from Conic Spline Interpolation

Interpolating a set of planar points is a common problem in CAD. Most constructions of interpolation functions are based on the parameters at the sample points. Assigning parameters to all sample points is a vital step before constructing interpolation functions. The most widely used parameterization method is accumulative chord length parameterization. In this paper, we give out a better method based on the interpolation of conics. Based on this method, a sequence of fairer Hermite curves can be constructed.     

物体轮廓线的多边形拟合

本文讨论了在给定数字轮廓线顶点数目为N的情况下，从其上选择k个点来构造拟和多边形来近似原图，使得物体轮廓线的形状丢失最小。本文的贡献在于1）本文的轮廓线拟和是以物体轮廓线的形状的信息丢失最小为目标的。而传统的方法是以拟和多边形和原图的面积差距最小。2）本文认为每一个点具有一定的形状信息，然后建立了一个以丢失的形状信息最小的0—1规划模型：3）使用了两种方：去对轮廓线进行了多边形拟合，并把两个结果进行了比较。     

时变不确定广义系统的鲁棒无源控制

研究了除E外其余系数矩阵均含有范数有界时变不确定性的广义系统的鲁棒无源控制器设计问题.利用线性矩阵不等式方法,首先给出自治系统广义二次稳定且无源的充分条件;然后给出状态反馈鲁棒无源控制器的存在条件并用线性矩阵不等式的解构造了相应的控制器;随后以矩阵不等式的形式得到了动态输出反馈鲁棒无源控制器的存在条件,同时利用矩阵不等式的解给出相应控制器的设计方法;最后举例说明了所提出方法的可行性.     

基于约束规划的一类排序问题通用求解方法

多约束排序问题是生产调度中常遇到的问题,传统的优化模型及方法在适应约束改变等方面存在诸多不足。鉴于此,将多约束排序问题定义为约束满足问题,系统设计时将模型定义与求解算法分离,利用约束规划平台的基本约束构建特定领域的抽象约束库,形成可重构的多约束排序问题通用求解框架。应用时,根据问题需求不同可利用抽象约束库快速重构优化模型,针对重构的优化模型配置相应的求解算法即可实现问题求解。应用结果表明,提出的方法通用性强,可满足实际应用的要求。     

A multicomputer garbage collector for a single-assignment language

An asynchronous garbage collector for a message-passing multiprocessor (multicomputer) is described. This combines Weighted Reference Counting (WRC) interprocessor collection and tracing intraprocessor collection to permit individual processors to reclaim local storage independently. A novel feature is the integration of Weighted Reference Counting collection and the communication algorithms required to support a global address space in a single assignment language. This significantly reduces communication overhead and space requirements attributable to garbage collection. In addition, techniques are described that avoid the creation of cyclic structures that cannot be reclaimed using WRC. Experimental studies performed in a concurrent logic programming system that incorporates the collector confirm its efficiency and the benefits of integrating garbage collector and language implementation.     

Slicing Software for Model Construction

Applying finite-state verification techniques (e.g., model checking) to software requires that program source code be translated to a finite-state transition system that safely models program behavior. Automatically checking such a transition system for a correctness property is typically very costly, thus it is necessary to reduce the size of the transition system as much as possible. In fact, it is often the case that much of a program's source code is irrelevant for verifying a given correctness property.In this paper, we apply program slicing techniques to remove automatically such irrelevant code and thus reduce the size of the corresponding transition system models. We give a simple extension of the classical slicing definition, and prove its safety with respect to model checking of linear temporal logic (LTL) formulae. We discuss how this slicing strategy fits into a general methodology for deriving effective software models using abstraction-based program specialization.