Stereo and motion correspondences using nonlinear optimization method

This paper presents a new approach for using stereo and motion correspondences to solve the problem of tracking multiple independently moving features. In this approach, quantitative relational structure (QRS) is proposed as a framework for the integration of stereo–motion correspondences. The similarity function, tightly coupled to stereo and motion cues, is constructed on QRS, and then energy function E² consisting of the similarity function is defined. The tracking problem can be converted into the maximization problem of the energy function E². The stereo and motion correspondences that maximize E² are recovered by applying an extended graduated assignment algorithm. The relaxation labeling method is also presented for the comparison with the proposed method. Experimental results are presented to illustrate the performance of the proposed method.     

松辽流域初始水权分配实践与探索

根据松辽流域用水现状和需水预测,流域水资源承载能力将成为流域经济社会可持续发展的关键制约因素.节水型社会建设是解决这一问题的战略举措.水权制度建设和水市场建立是水资源管理适应市场经济的正确选择.面对松辽流域水资源管理的实际情况,流域初始用水权分配是实现战略举措的一项基础工作,也是水权制度建设和水市场建立的起步工作.结合松辽流域的具体情况,松辽委适时组织开展了流域初始用水权分配专题研究,并在霍林河与大凌河流域进行了初始用水权分配的实践探索.     

The influence of morphological information on cataphoric pronoun assignment.

In 3 eye-tracking experiments, the authors investigated the use of morphological information during pronoun resolution. Experiments 1 and 2 showed that disruption occurred when a preferred assignment was inconsistent with gender information. Experiment 2 ensured that this difficulty was not due to the introduction of a new discourse entity. Experiment 3 showed that disruption also occurred when number information was inconsistent with the preferred assignment. The results indicate that the use of morphological information is delayed until after the computation of coreference relations. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

动态交通分配中一类转换率系统的稳定性

在假设交通很拥挤同时交通的转换率与路径费用成正比的前提下，构建了一个动态的转换率模型．为了获取转换率系统的全局渐近稳定，提出了一个普遍适用的Lyapunov函数方法，与此同时通过线性矩阵不等式方法，得到了保证转换率系统全局渐近稳定的充分条件．     

Metaheuristic downhill simplex method in combinatorial optimization

The concept of combinatorial objects is formalized. It allows strict definition of a combinatorial optimization problem (COP). An efficient metaheuristic method to solve COPs (H-method) is considered. It includes stochastic local search algorithms as a built-in procedure. A parallel implementation of the H-method is set forth and analyzed. The results from a numerical experiment and solution of some well-known COPs on personal computers and on the SKIT cluster supercomputer are presented. The study was supported by INTAS (Project 06-1000017-8909). __________ Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 70–79, November–December 2007.     

Robust pole assignment for incomplete nonlinear decoupling applied to robots

A robustness analysis and synthesis for incomplete nonlinear decoupling for a class of nonlinear systems is discussed. Rigid and elastic-joint robot models belong to this class. For the elastic case, a transformation facilitates the robustness analysis under a weak assumption. Charts with H ₁- and H - norms of closed-loop disturbance transfer functions of the nonlinear-decoupled system are presented for a robust pole assignment.     

基于家族基因的网格信任模型

针对现有基于PKI (Public Key Infrastructure)的网格信任系统的不足,证书主体信息不明确, 认证过程复杂等缺陷提出了一种新颖的基于家族基因的网格信任模型。该模型解决了传统信任模型存在的问题,如采用将用户的全部身份信息放在用户的基因里方法解决了证书主体信息的不明确,用基因检测解决了认证过程的复杂,用基因指派解决了访问控制的繁琐,并且给出了网格家族、家族基因、基因指派、基因鉴别和信任等概念,并建立了模型的形式化描述,理论分析和实验结果表明这种模型是网格信任领域一种较好的解决方案。     

Greedy-search-based multi-objective genetic algorithm for emergency logistics scheduling

To enable the immediate and efficient dispatch of relief to victims of disaster, this study proposes a greedy-search-based, multi-objective, genetic algorithm capable of regulating the distribution of available resources and automatically generating a variety of feasible emergency logistics schedules for decision-makers. The proposed algorithm dynamically adjusts distribution schedules from various supply points according to the requirements at demand points in order to minimize unsatisfied demand for resources, time to delivery, and transportation costs. The proposed algorithm was applied to the case of the Chi–Chi earthquake in Taiwan to verify its performance. Simulation results demonstrate that under conditions of a limited/unlimited number of available vehicles, the proposed algorithm outperforms the MOGA and standard greedy algorithm in ‘time to delivery’ by an average of 63.57% and 46.15%, respectively, based on 10,000 iterations.     

An efficient procedure for finding best compromise solutions to the multi-objective assignment problem

In this paper, we consider the problem of determining a best compromise solution for the multi-objective assignment problem. Such a solution minimizes a scalarizing function, such as the weighted Tchebychev norm or reference point achievement functions. To solve this problem, we resort to a ranking (or k-best) algorithm which enumerates feasible solutions according to an appropriate weighted sum until a condition, ensuring that an optimal solution has been found, is met. The ranking algorithm is based on a branch and bound scheme. We study how to implement efficiently this procedure by considering different algorithmic variants within the procedure: choice of the weighted sum, branching and bounding schemes. We present an experimental analysis that enables us to point out the best variants, and we provide experimental results showing the remarkable efficiency of the procedure, even for large size instances.     

Multiple targets enclosure by robotic swarm

Target enclosure by autonomous robots is useful for many practical applications, for example, surveillance of disaster sites. Scalability is important for autonomous robots because a larger group is more robust against breakdown, accidents, and failure. However, since the traditional models have discussed only the cases in which minimum number of robots enclose a single target, there has been no study on the utilization of the redundant number of robots. In this paper, to achieve a highly scalable target enclosure model about the number of target to enclose, we introduce swarm based task assignment capability to Takayama’s enclosure model. The original model discussed only single target environment but it is well suited for applying to the environments with multiple targets. We show the robots can enclose the targets without predefined position assignment by analytic discussion based on switched systems and a series of computer simulations. As a consequence of this property, the proposed robots can change their target according to the criterion about robot density while they enclose multiple targets.