电视中心系统测试实践

结合本台硬盘播控系统实际,阐述了模拟向数字过渡时期电视中心系统验收测试的方法,并对测试中的几点体会进行了介绍,最后还阐述了深入使用VM700T的一些方法。     

On Using Tabu Search for Design Automation of VLSI Systems

Tabu search is a meta-heuristic problem solving technique that, when applied carefully, provides near optimal solutions in a very short time. In this paper, we have described the use of tabu search for solving problems related to very large scale integrated (VLSI) circuit design automation. Specifically, we have demonstrated the use for VLSI circuit partitioning and placement. We present a tabu search based circuit bi-partitioning technique that partitions circuits with the goal of minimizing the size of the cutset between the partitions. Then, we use tabu search techniques along with force directed placement techniques to accomplish the physical placement of VLSI circuits on regular two-dimensional arrays with the goal of minimizing the placement time. We use empirical data from partitioning and placement of benchmark circuits to test our techniques. Our methods show improvement when compared to partitioning techniques from the literature and commercially available placement tools. Relative to the literature, our tabu search bi-partitioning technique improves on the best known minimum cuts for several benchmark circuits. Relative to commercially available computer aided design tools, our tabu search based placement approach shows dramatic (20×) speedup in execution time without negative impact on the quality of the solution.     

自适应桁架形状控制中主动杆多目标最优配置

导出自适应桁架结构静态形状控制方程，这些方程在线弹性范围内适用；一般主动杆件数远小于结构杆件数目，且主动杆件的配置问题取决于控制能量和杆件强度等因素，因此基于最短行程和最小导出内力指标和模态退火组合优化算法进行了主动杆件的多目标最优配置；通过算例分析验证了本文分析方法的可行性和有效性。     

An algorithm ofk-line location for BBL in LSI/VLSI

In this paper, aK-line location algorithm for building block cells in LSI/VLSI is presented. When the relative positions of rectangular cells are given, there are 2 states according to the two orientations of a cell. It is proved that to find the optimum solution from the 2^N states can be reduced to calculate theN states inK-line algorithm. So the algorithm is shown very effective and can be used with association for cluster method in BBL placement. Under certain conditions, this method can also be used to pesudo BBL placement directly.     

基于复模态的控制力矩陀螺配置优化

由于陀螺耦合效应,系统动力学方程的特征值和特征向量皆为复数形式,不便于进行控制力矩陀螺的配置优化和控制律设计。本文基于复模态理论,构造出一种实数域上的伪模态矩阵,从而实现方程解耦。综合考虑结构模态、控制输入能量和传感器接收能量的复合优化准则,获得了控制力矩陀螺的最优配置。结果表明,采用线性二次型最优控制,能够快速将结构的响应振幅降至5%以内,验证了使用伪模态矩阵进行方程解耦的可行性及控制的有效性。     

Variance of the virtual displacement

We show that the affine structure of the 3-dimensional space is deeply enmeshed with the static laws expression. The relevance of tensorial rules for calculus in mechanics is thus enhanced. The virtual work principle is stated precisely but a little twist is given to the usual statements: the tensorial nature of the so-called virtual displacement vector is asserted to be covariant. To cite this article: C. Vallée et al., C. R. Mecanique 332 (2004).

Résumé

Nous montrons que la structure affine de l'espace tridimensionnel est fortement imbriquée avec l'expression des lois de la statique. La pertinence de l'application des règles du calcul tensoriel à la mécanique est ainsi renforcée. Le principe des travaux virtuels est établi précisément avec une seule entorse aux exposés classiques : la nature tensorielle de l'habituel vecteur déplacement virtuel est affirmée covariante. Pour citer cet article : C. Vallée et al., C. R. Mecanique 332 (2004).     

基于网格点覆盖模型的高效传感器网络节点配置算法

节点配置问题是传感器网络研究的关键问题.在DhillonS.S.的模型化方法基础上,完成了两种改进的高效节点配置算法.以最少化传感器数目为目标,通过减少局部冗余、优化整体性能以及考虑传感器检测范围的有限性,修改算法的初始化模型等方法,对现有的传感器节点配置算法进行了改进.通过仿真分析,充分验证了两种模型的可行性与性能的优越性.     

基于覆盖网络的应用层选播服务的设计与研究

针对网络层的选播通信存在着可扩展性和无状态服务等根本问题,在现有的应用层选播研究基础上,提出了一种基于覆盖网络的应用层选播的结构,并把这种结构从代理节点的部署和链路的选取上进行求解,并通过实验对此拓扑结构进行了验证.     

应用于贴片机贴装顺序优化的遗传算法的比较和改进

元件贴装顺序优化是决定贴片机生产效率的关键问题,传统的解决贴装顺序优化问题的方法有遗传算法,蚁群算法,SS(伞布搜索法)等。使用较多的还是遗传算法。遗传算法中包含选择算子、交叉算子、变异算子,且编程思想简单,但容易出现局部最优,过早收敛等情况。在此,通过对遗传算法在贴装顺序优化应用的结果比较找到一种更适合的遗传算法,使之拥有较快的收敛速度和全局优化性。     

软件定义网络中可靠性优化控制器的位置研究(英)

By decoupling control plane and data plane,Software-Defined Networking(SDN) approach simplifies network management and speeds up network innovations.These benefits have led not only to prototypes,but also real SDN deployments.For wide-area SDN deployments,multiple controllers are often required,and the placement of these controllers becomes a particularly important task in the SDN context.This paper studies the problem of placing controllers in SDNs,so as to maximize the reliability of SDN control networks.We present a novel metric,called expected percentage of control path loss,to characterize the reliability of SDN control networks.We formulate the reliability-aware control placement problem,prove its NP-hardness,and examine several placement algorithms that can solve this problem.Through extensive simulations using real topologies,we show how the number of controllers and their placement influence the reliability of SDN control networks.Besides,we also found that,through strategic controller placement,the reliability of SDN control networks can be significantly improved without introducing unacceptable switch-to-controller latencies.