Vector Field Based Texture Mapping of Animated Implicit Objects

This paper shows that an adequate use of vectorfields can solve most inconsistencies related to texture mapping that appear in current animation and rendering systems based on implicit objects. The method used is based on the concept of a virtual skin. A skin with its own texture mapping is spread over an implicit object and is constrained to stick to the deformation of the implicit object. A vectorfield is used to compute the relationship between the motion of the skin and the deformation of the object. Visual and implementation issues are discussed with respect to typical applications of implicit objects in computer graphics.     

Consensus in the presence of mortal Byzantine faulty processes

We consider the problem of reaching agreement in distributed systems in which some processes may deviate from their prescribed behavior before they eventually crash. We call this failure model “mortal Byzantine”. After discussing some application examples where this model is justified, we provide matching upper and lower bounds on the number of faulty processes, and on the required number of rounds in synchronous systems. We then continue our study by varying different system parameters. On the one hand, we consider the failure model under weaker timing assumptions, namely for partially synchronous systems and asynchronous systems with unreliable failure detectors. On the other hand, we vary the failure model in that we limit the occurrences of faulty steps that actually lead to a crash in synchronous systems.     

Distributed constraint optimization with MULBS: A case study on collaborative meeting scheduling

This paper introduces MULBS, a new DCOP (distributed constraint optimization problem) algorithm and also presents a DCOP formulation for scheduling of distributed meetings in collaborative environments. Scheduling in CSCWD can be seen as a DCOP where variables represent time slots and values are resources of a production system (machines, raw-materials, hardware components, etc.) or management system (meetings, project tasks, human resources, money, etc). Therefore, a DCOP algorithm must find a set of variable assignments that maximize an objective function taking constraints into account. However, it is well known that such problems are NP-complete and that more research must be done to obtain feasible and reliable computational approaches. Thus, DCOP emerges as a very promising technique: the search space is decomposed into smaller spaces and agents solve local problems, collaborating in order to achieve a global solution. We show with empirical experiments that MULBS outperforms some of the state-of-the-art algorithms for DCOP, guaranteeing high quality solutions using less computational resources for the distributed meeting scheduling task.     

用于精确焊接的智能视觉系统

通过与其它传感技术的对比,简要分析了激光视觉在焊接生产中得到成功应用的原因。分析了早期激光视觉系统的特征和当时面临的挑战。介绍了Servo-Robot激光视觉的关键技术和已取得的显著进步,阐述了集成激光视觉的移动式便携焊接机器人和激光视觉在焊缝质量检测中的应用。展望了激光视觉系统的未来和智能视觉在提高机器人性能方面发展的显著进步,包括改进机器人人工示教、离线编程及视觉辅助机器人示教。