A formal approach to negotiating agents development

This paper presents a formal and executable approach to capture the behaviour of parties involved in a negotiation. A party is modeled as a negotiating agent composed of a communication module, a control module, a reasoning module, and a knowledge base. The control module is expressed as a statechart, and the reasoning module as a defeasible logic program. A strategy specification therefore consists of a statechart, a set of defeasible rules, and a set of initial facts. Such a specification can be dynamically plugged into an agent shell incorporating a statechart interpreter and a defeasible logic inference engine, in order to yield an agent capable of participating in a given type of negotiations. The choice of statecharts and defeasible logic with respect to other formalisms is justified against a set of desirable criteria, and their suitability is illustrated through concrete examples of bidding and multi-lateral bargaining scenarios.     

A vertical and floor line-based monocular SLAM system for corridor environments

In this paper, we propose a vertical and floor line-based monocular simultaneous localization and mapping (SLAM) system which utilizes vertical lines, floor lines, and vanishing points as sensory input to perform robust SLAM in corridor environments. By combining three map feature types, our design can help a robot to perform accurate pose estimation, repeatable loop closure, and to construct a more expressive environmental map. As a primitive element of a geometric structure, a line segment has one additional dimension compared to a point feature, thereby allowing the use of line segments to easily represent a geometric structure using a smaller number of features. This system presents map features on a 2D ground space: the vertical line as a projection point, the floor line as the original line, and the vanishing point as a directional vector. Although the vertical line, floor line, and vanishing point use different parameterization and initialization methods, their measurement models are integrated into a unified extended Kalman filter (EKF) framework. Experimental results show that our system can be deployed in a structured indoor environment as a suitable SLAM solution.     

关于一种网格运行时结构的若干注记

进程是传统计算机系统的一个核心概念，自1960年出现以来一直沿用至今，进程的一个主要目的是为主体提供一种运行时结构，在操作系统和处理器硬件支持下，代表主体访问和使用各种资源，与传统的单机和并行机计算平台相比，网格计算机中进程所对应的概念面临新的挑战，包括网格资源繁杂、自主控制的条件下的单一系统映像和资源的共享与协同、与特定操作系统的松耦合、时间和空间的流动性、更高级的交互性，提出一种称为网程(grip)的运行时结构，试图解决上述问题，网程运行在网格操作系统之上，代表网格主体，访问和使用网格资源。     

An experimental remote handling system

An experimental robotic remote handling system is described which has been constructed in order to investigate various engineering problems in advanced remote handling such as the man-machine interface, system control and communication. The device consists of a mobile and a control station. The mobile station comprises an electrical manipulator having seven degrees of freedom, a TV camera, a control sub-computer, a servo-control unit, radio transmitters and receivers, batteries, etc., which are mounted on a crawler-type vehicle. The control station is equipped with the master arm of the manipulator, radio transmitters and receivers, a TV monitor, a main control computer and its peripheral devices, etc. The manipulator can be operated in either a master-slave, a playback or a programmed control mode with the assistance of control computers. Communication between the mobile and the control stations is made using optical fibres or a radio link.     

Stochastic colored Petri net models of flexible manufacturing systems: Material handling systems and machining

This paper presents an overview of SCPN theory, a set of three generic SCPN submodels, a behavior-preserving methodology for combining those submodels into a larger model, and a combined model. The three submodels include a machine with failures, repairs, and limited I/O buffers, and two types of conveyor submodels—a simple conveyor segment and a conveyor segment at a machine.     

On the controllability of systems with a time-varying delay†

This paper is concerned with the controllability of a system with a time-varying delay. The system to be considered here is described by a linear differential-difference equation of a retarded type, where a time-varying delay is a certain class of a time-varying function. First, the concepts of controllability for linear differential-difference systems with a constant delay, introduced by Weiss (1987), are developed to the system with a time-varying delay. Second, necessary and sufficient conditions for controllability are obtained. Finally, the controllability of a stationary system with a constant delay is treated, including the results of Chyung and Lee (1966).     

Developing a vision-based auto-recharging system for mobile robots

This article describes a vision-based auto-recharging system that guides a mobile robot moving toward a docking station. The system contains a docking station and a mobile robot. The docking station contains a docking structure, a control device, a charger, a safety detection device, and a wireless RF interface. The mobile robot contains a power detection module (voltage and current), an auto-switch, a wireless RF interface, a controller, and a camera. The controller of the power detection module is a Holtek chip. The docking structure is designed with one active degree of freedom and two passive degrees of freedom. For image processing, the mobile robot uses a webcam to capture a real-time image. The image signal is transmitted to the controller of the mobile robot via a USB interface. We use an Otsu algorithm to calculate the distance and orientation of the docking station from the mobile robot. In the experiment, the proposed algorithm guided the mobile robot to the docking station.     

PSoC-based embedded design and quartz tuning fork for low-temperature measurement system design

This article describes a commercial quartz tuning fork (QTF), 8 mm in height by 3 mm in diameter, holding a two-terminal electronic component with a nominal frequency of 32.768 kHz and 12.5 pF typical load capacitance packed in a vacuum-sealed metal container, which has been used as a sensor for low-temperature measurement with good sensitivity, repeatability, and reliability. An embedded readout design with the support of a programmable system on-chip (PSoC) and virtual instrument control program, which uses a personal computer as an input/output device, provides online data acquisition of the QTF frequency data, which will in turn provide the measurement of the low-temperature bath in which the QTF is immersed. The embedded PSoC readout captures the varying frequency signals from the QTF as a response to the measurement temperature, processes it, and sends the frequency value to a personal computer, where LabVIEW, a graphical language ("G" language), displays the data in a graphical format. The QTFs for low temperature (300 K to 77 K) are well studied, whereas a sensor using a PSoC embedded design as a readout is a novel design implementation.     

Detection of a brain aneurysm and a way to search for a brain aneurysm aimed at the development of a system to simulate an operation

In this article, a system is proposed for a simulated operation which would help a trainee surgeon to perform a medical operation to ensure that a cerebral aneurysm does not burst. The physician will have acquired empirical medical technologies from operations in traditional clinical teaching. However, there is a problem with safety and the burden to the patient. Therefore, recently a new training approach for a simulated medical operation using virtual reality has been explored. With the aim of developing a simulated system for a medical operation for a cerebral aneurysm, we considered the necessary functions such as detecting the brain aneurysm that is the target of the operation, and searching for a suitable blood vessel to make a plan for the operation.     

Bayesian recognition of local 3-d shape by approximating image intensity functions with quadric polynomials

The recognition in image data of viewed patches of spheres, cylinders, and planes in the 3-D world is discussed as a first step to complex object recognition or complex object location and orientation estimation. Accordingly, an image is partitioned into small square windows, each of which is a view of a piece of a sphere, or of a cylinder, or of a plane. Windows are processed in parallel for recognition of content. New concepts and techniques include approximations of the image within a window by 2-D quadric polynomials where each approximation is constrained by one of the hypotheses that the 3-D surface shape seen is either planar, cylindrical, or spherical; a recognizer based upon these approximations to determine whether the object patch viewed is a piece of a sphere, or a piece of a cylinder, or a piece of a plane; lowpass filtering of the image by the approximation. The shape recognition is computationally simple, and for large windows is approximately Bayesian minimum-probability-of-error recognition. These classifications are useful for many purposes. One such purpose is to enable a following processor to use an appropriate estimator to estimate shape, and orientation and location parameters for the 3-D surface seen within a window.     

A superscalar simulation employing poisson distributed stalls

This paper presents a statistical approach to estimating the performance of a superscalar processor. Traditional trace-driven simulators can take a large amount time to conduct a performance evaluation of a machine, especially as the number of instructions increases. The result of this type of simulation is typically tied to the particular trace that was run. Elements such as dependencies, delays, and stalls are all a direct result of the particular trace being run, and can differ from trace to trace. This paper describes a model designed to separate simulation results from a specific trace. Rather than running a trace-driven simulation, a statistical model is employed, more specifically a Poisson distribution, to predict how these types of delay affects performance. Through the use of this statistical model, a performance evaluation can be conducted using a general code model, with specific stall rates, rather than a particular code trace. This model allows simulations to quickly run tens of millions of instructions and evaluate the performance of a particular micro-architecture while at the same time, allowing the flexibility to change the structure of the architecture.     

A disruption recovery plan in a three-stage production-inventory system

This paper proposes a recovery plan for managing disruptions in a three-stage production-inventory system under a mixed production environment. First, a mathematical model is developed to deal with a disruption at any stage while maximizing total profit during the recovery-time window. The model is solved after the occurrence of a disruption event, with changed data used to generate a revised plan. We also propose a new and efficient heuristic for solving the developed mathematical model. Second, multiple disruptions are considered, where a new disruption may or may not affect the recovery plans of earlier disruptions. The heuristic, developed for a single disruption, is extended to deal with a series of disruptions so that it can be implemented for disruption recovery on a real-time basis. We compare the heuristic solutions with those obtained by a standard search algorithm for a set of randomly generated disruption test problems, and that show the consistent performance of our developed heuristic with lower computational times. Finally, some numerical examples and a real-world case study are presented to demonstrate the benefits and usefulness of our proposed approach.     

Exact combinatorial bounds on the probability of overfitting for empirical risk minimization

Three general methods for obtaining exact bounds on the probability of overfitting are proposed within statistical learning theory: a method of generating and destroying sets, a recurrent method, and a blockwise method. Six particular cases are considered to illustrate the application of these methods. These are the following model sets of predictors: a pair of predictors, a layer of a Boolean cube, an interval of a Boolean cube, a monotonic chain, a unimodal chain, and a unit neighborhood of the best predictor. For the interval and the unimodal chain, the results of numerical experiments are presented that demonstrate the effects of splitting and similarity on the probability of overfitting.     

Modeling interactive storytelling genres as application domains

In this paper, we introduce a formalism to specify interactive storytelling genres in the context of digital entertainment, adopting an information systems approach. We view a genre as a set of plots, where a plot is a partially ordered sequence of events, taken from a fixed repertoire. In general, the specification of a genre should allow to determine whether a plot is a legitimate representative of the genre, and also to generate all plots belonging to the genre. The formalism divides the specification of a genre into static, dynamic and behavioral schemas, that reflect a plan recognition/plan generation paradigm. It leads to executable specifications, supported by LOGTELL, a prototype tool that helps users generate, modify and reuse plots that follow a genre specification. To illustrate the use of the formalism, we specify a simple Swords & Dragons genre and show plots generated by the tool.     

Modeling and Control of Hybrid Machine Systems – a Five-bar Mechanism Case

A hybrid machine (HM) as a typical mechatronic device, is a useful tool to generate smooth motion, and combines the motions of a large constant speed motor with a small servo motor by means of a mechnical linkage mechanism, in order to provide a powerful programmable drive system. To achieve design objectives, a control system is required. To design a better control system and analyze the performance of an HM, a dynamic model is necessary. This paper first develops a dynamic model of an HM with a five-bar mechanism using a Lagrangian formulation. Then, several important properties which are very useful in system analysis, and control system design, are presented. Based on the developed dynamic model, two control approaches, computed torque, and combined computed torque and slide mode control, are adopted to control the HM system. Simulation results demonstrate the control performance and limitations of each control approach.     

高压传感器在高静压下的动态校准方法

提出了一种校准高压传感器频响特性的方法,动态校准系统主要由甘油油腔、霍普金森杆、气枪、应变片、电荷放大器、活塞式压力计和数据采集系统等组成.校准时先利用活塞式压力计在封闭式油腔中产生高静压,高静压作用于被校准的压力传感器.气枪发射子弹,子弹撞击霍普金森杆产生近似于冲激函数的窄脉冲应力波,应力波通过甘油传播并激励传感器,...     

充电桩计量过程中输出与充电需求不匹配问题分析及处理

针对充电桩现场测试设备的充电需求与实际输出不一致,出现电压、电流不匹配的问题,设计了一套检测方案,构建出包括电流检测模块、电压检测模块和示波器检测模块的检测电路,通过采样电压和电流信号,计算出不同负载下充电桩输出电流和电压值,并设计了包括直流电能采集电路,由双通道AD转换AD7380、可编程增益放大器、可编程增益放大器、增益电阻Rg2和电源变换器、低通滤波器电容CL、低通滤波器电阻RL组成的检测电路,在检测电路中,为了提高检测效率,还设置了校正电路。通过试验,本研究方法分析直观,误差低。     

A lagrangian propagator for artificial neural networks in constraint programming

This paper discusses a new method to perform propagation over a (two-layer, feed-forward) Neural Network embedded in a Constraint Programming model. The method is meant to be employed in Empirical Model Learning, a technique designed to enable optimal decision making over systems that cannot be modeled via conventional declarative means. The key step in Empirical Model Learning is to embed a Machine Learning model into a combinatorial model. It has been showed that Neural Networks can be embedded in a Constraint Programming model by simply encoding each neuron as a global constraint, which is then propagated individually. Unfortunately, this decomposition approach may lead to weak bounds. To overcome such limitation, we propose a new network-level propagator based on a non-linear Lagrangian relaxation that is solved with a subgradient algorithm. The method proved capable of dramatically reducing the search tree size on a thermal-aware dispatching problem on multicore CPUs. The overhead for optimizing the Lagrangian multipliers is kept within a reasonable level via a few simple techniques. This paper is an extended version of [27], featuring an improved structure, a new filtering technique for the network inputs, a set of overhead reduction techniques, and a thorough experimentation.     

HelSweeper: Screw-sweeps of canal surfaces

A tube is a solid bounded by the union of a one-parameter family of circles that may be decomposed into canal-surfaces and planar disks or annuli. A screw-sweep is the region swept by a shape during a screw motion. HelSweeper computes the boundary of a screw-sweep of an arbitrary union of tubes and polyhedra. To do so, it generates a superset of faces, splits them at their intersections, and selects the face portions that form the desired boundary. The novelty of the proposed approach lies in the fact that the faces contributed to this superset by a tube are each a screw-sweeps of a rigid curve (generator), which is the locus of grazing points, and that each grazing point is formulated as the intersection of a circle of the tube with a corresponding screw-plane. Hence, each such face is a one-parameter family of helices, each being the screw-sweep of a grazing point.