Evolutionary variational-hemivariational inequalities: Existence and comparison results

We consider an evolutionary quasilinear hemivariational inequality under constraints represented by some closed and convex subset. Our main goal is to systematically develop the method of sub-supersolution on the basis of which we then prove existence, comparison, compactness and extremality results. The obtained results are applied to a general obstacle problem. We improve the corresponding results in the recent monograph [S. Carl, V.K. Le, D. Motreanu, Nonsmooth Variational Problems and Their Inequalities. Comparison Principles and Applications, Springer Monogr. Math., Springer, New York, 2007].     

Random homogenization of an obstacle problem

We study the homogenization of an obstacle problem in a perforated domain, when the holes are periodically distributed and have random shape and size. The main assumption concerns the capacity of the holes which is assumed to be stationary ergodic.     

A stability result concerning the obstacle problem for a plate

It is proposed here to study the free boundary of the obstacle problem in the case of an elastic plate. Under a nondegeneracy assumption, we prove a stability theorem which relates the variations of the contact zone to the variations the external forces. The statement of this result obtained and the steps in the proof are very close to those given by D.G. Schaeffer in 1975, except for the very important fact that the present study deals with the biharmonic operator.     

Sextic spline method for the solution of a system of obstacle problems

We use sextic spline function to develop numerical method for the solution of system of second-order boundary-value problems associated with obstacle, unilateral, and contact problems. We show that the approximate solutions obtained by the present method are better than those produced by other collocation, finite difference and spline methods. A numerical example is given to illustrate practical usefulness of our method.     

基于几何分析的机械臂运动路径规划问题研究

设计了分步-搜索逼近算法,解决了六自由度机械臂的位姿逆运算问题,使机械臂完成指尖到达指定目标点、沿指定曲线轨迹移动等动作.针对避障问题,设计了扫描截面的避碰算法.在此基础上,给出了机械臂作业的通用算法,并对所建模型和算法进行了实际检验.最后,分析了机械臂的设计参数,并提出了改进建议.     

Continuum modeling of cooperative traffic flow dynamics

This paper presents a continuum approach to model the dynamics of cooperative traffic flow. The cooperation is defined in our model in a way that the equipped vehicle can issue and receive a warning massage when there is downstream congestion. Upon receiving the warning massage, the (up-stream) equipped vehicle will adapt the current desired speed to the speed at the congested area in order to avoid sharp deceleration when approaching the congestion. To model the dynamics of such cooperative systems, a multi-class gas-kinetic theory is extended to capture the adaptation of the desired speed of the equipped vehicle to the speed at the downstream congested traffic. Numerical simulations are carried out to show the influence of the penetration rate of the equipped vehicles on traffic flow stability and capacity in a freeway.     

A new fault-management method using congestion-avoidance routing for optical burst-switched networks

Optical burst switching (OBS) has been proposed as a promising technique to support high-bandwidth, bursty data traffic in the next-generation optical Internet. This study investigates a new fault-management framework for an OBS network. In an OBS network, burst-loss performance is a critical concern. In OBS, the data-burst transmission is delayed by an offset time (relative to its burst control packet (BCP), or header), and the burst follows its header without waiting for an acknowledgment for resource reservation. Thus, a burst may be lost at an intermediate node due to contention, which is generally resolved according to the local routing and bandwidth information. The routing table maintained in each OBS node is generally pre-computed and fixed to forward the data bursts. Such a static forwarding feature might have limited efficiency to resolve contentions. Moreover, a burst may be lost and the network may be congested when a network element (e.g., fiber link) fails. Therefore, for reliable burst transport, we develop dynamic routing approaches for preplanned congestion avoidance. Our goal is to proactively avoid congestion during the route-computation process, and our approach employs wavelength-channel utilization, traffic distribution, and link-distance information in the proposed objective functions for routing. Two update mechanisms for maintaining a dynamic routing table are presented to accommodate bursty data traffic. Based on our routing mechanisms, we also propose a new congestion-avoidance-and-protection (CAP) approach, which employs a primary route and a group of backup routes for each node pair against failures and congestion. The performance of the proposed protection strategy using congestion-avoidance routing is demonstrated to be promising through illustrative numerical examples.

基于群智能和冲突规避策略的基因-基因交互作用检测方法

针对当前检测基因-基因交互作用方法中存在的一些缺陷,提出一种基于群智能和冲突规避策略的基因-基因交互作用检测方法（DEIBSC）.以SNP（single nucleotide polymorphism）为研究对象,从大量SNP中选出具有显著基因-基因交互作用的SNP组.初始化多个SNP组作为初值,同时产生多条搜索路径,利用得分单调递增原则寻找问题的解,通过冲突规避策略和群智能动态调整搜索路径的方向,使得到的解更能反映基因-基因交互作用在基因组范围内分布的情况.在仿真数据和真实数据上的实验证实,本文方法在统计能力上可以和SNPHarvester方法相比,在效率上有明显优势,得到的结果能够更广泛地代表基因-基因交互作用在基因组的分布.     

A full-scale solution to the rectilinear obstacle-avoiding Steiner problem

Routing is one of the important steps in very/ultra large-scale integration (VLSI/ULSI) physical design. Rectilinear Steiner minimal tree (RSMT) construction is an essential part of routing. Macro cells, IP blocks, and pre-routed nets are often regarded as obstacles in the routing phase. Obstacle-avoiding RSMT (OARSMT) algorithms are useful for practical routing applications. However, OARSMT algorithms for multi-terminal net routing still cannot meet the requirements of practical applications. This paper focuses on the OARSMT problem and gives a solution to full-scale nets based on two algorithms, namely An-OARSMan and FORSTer. (1) Based on ant colony optimization (ACO), An-OARSMan can be used for common scale nets with less than 100 terminals in a circuit. An heuristic, greedy obstacle penalty distance (OP-distance), is used in the algorithm and performed on the track graph. (2) FORSTer is a three-step heuristic used for large-scale nets with more than 100 terminals in a circuit. In Step 1, it first partitions all terminals into some subsets in the presence of obstacles. In Step 2, it then connects terminals in each connected graph with one or more trees, respectively. In Step 3, it finally connects the forest consisting of trees constructed in Step 2 into a complete Steiner tree spanning all terminals while avoiding all obstacles. (3) These two graph-based algorithms have been implemented and tested on different kinds of cases. Experimental results show that An-OARSMan can handle both convex and concave polygon obstacles with short wire length. It achieves the optimal solution in the cases with no more than seven terminals. The experimental results also show that FORSTer has short running time, which is suitable for routing large-scale nets among obstacles, even for routing a net with one thousand terminals in the presence of 100 rectangular obstacles.     

Management of food-chain systems via Liapunov design control

A general food-chain system involving control is considered. A Liapunov design methodology is used to establish a control growth policy of qualitative nature, aimed to restrict the fluctuations of the size of the chain elements (populations, consumers, resources). The policy is based on the concept of avoidance control.Invited talk at 14 Symposium on Operations Research, Ulm, September 1989.