Vague集向Fuzzy集转化的一种新方法

提出Vague值向Fuzzy值转化的实用方法的定义。针对文献[6]中的一个Vague值向Fuzzy值转化的均值修正法,提出了加权均值修正法,并证明了这种方法同样是Vague值向Fuzzy转化的一种非常实用的方法。     

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.     

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.     

An optimal part sending policy for a production system in a generalconfiguration with a new control strategy

We consider a production system in a general configuration with a new control strategy: the push mechanism for the part transport and the kanban technique for the work-in-process (WIP). The production system is composed of many stations such as an entrance station, a set of work stations, a central station, and an exit station, that are arranged in a general configuration. The push mechanism is followed for transporting a part from a station to a destination station. The kanban technique is adopted for controlling the WIP in a work station. The production system is modeled by a closed queuing network in a general configuration with a Markov part sending mechanism and a machine no blocking (MNB) technique. An optimal part sending policy that maximizes the expected system throughput is formulated into a long run average semi-Markov decision process. Three solution approaches are developed for obtaining optimal or suboptimal solutions. Numerical examples are given to evaluate the quality of the solutions obtained by the solution approaches     

The conversion of a dynamic B-spline curve into piecewise polynomials in power form

The evaluation of points and the computations of inflection points or cusps on a curve are often necessary in CAGD applications. When a curve is represented in a B-spline form, such computations can be made easier once it is transformed into a set of piecewise polynomial curves in power form. The usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in power form is done either by a knot refinement followed by basis conversions, or by applying a Taylor expansion on each knot span of a B-spline curve.Presented in this paper is a new algorithm to convert a B-spline curve into a set of piecewise polynomial curves in power form. Experiment shows that the proposed algorithm significantly outperforms the conventional approach when one or more control points of a B-spline curve are continuously moving.     

Modeling and feedback control of a flexible arm

When a flexible arm is rotated by a motor about an axis through the arm's fixed end, transverse vibration may occur. The motor torque should be controlled in such a way that the motor rotates by a specified angle, while simultaneously stabilizing vibration of the flexible arm so that it is arrested as soon as possible at the end of rotation. In this paper, we first derive a partial differential equation and a set of boundary conditions governing the vibration. Then, a feedback control system which incorporates a dynamic compensator is designed using sensor outputs. A set of experiments has been constructed to demonstrate control strategies for a flexible arm, where a strain gage was used as a vibration sensor and a microcomputer was equipped as a controller. Several satisfactory experimental results are shown.     

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).     

Applying the extended Kalman filter to systems described by nonlinear differential-algebraic equations

This paper describes a method for the state estimation of nonlinear systems described by a class of differential-algebraic equation models using the extended Kalman filter. The method involves the use of a time-varying linearisation of a semi-explicit index one differential-algebraic equation. The estimation technique consists of a simplified extended Kalman filter that is integrated with the differential-algebraic equation model. The paper describes a simulation study using a model of a batch chemical reactor. It also reports a study based on experimental data obtained from a mixing process, where the model of the system is solved using the sequential modular method and the estimation involves a bank of extended Kalman filters.     

Analysis of dimensions and tolerances in computer-aided mechanical design

The paper sets forth a theory to explain how dimensions and views combine to specify the shape of a mechanical component. It provides a method to determine whether a component is under, over, or exactly defined by a given dimensioning scheme. Measures for assessing the quality of a scheme are proposed. A solution is offered to a problem of tolerancing: given a toleranced dimensioning scheme, find the resulting tolerances between undimensioned parts of a component.     

我国青少年网上银行犯罪问题研究

在剖析青少年网上银行犯罪本质特征和主要特点的基础上，进一步探讨了青少年网上银行犯罪产生的根源，并据此提出一些根本的打击防范对策．有助于进一步确保网上银行的运行安全。     

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.     

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.     

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.     

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

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

Formatting texts accessed randomly

Full-text systems that access text randomly cannot normally determine the format operations in effect for a given target location. The problem can be solved by viewing the format marks as the non-terminals in a format grammar. A formatted text can then be parsed using the grammar to build a data structure that serves both as a parse tree and as a search tree. While processing a retrieved segment, a full-text system can follow the search tree from root to leaf, collecting the format marks encountered at each node to derive the sequence of commands active for that segment. The approach also supports the notion of a ‘well formatted’ document and provides a means for verifying the well-formedness of a given text. To illustrate the approach, a sample set of format marks and a sample grammar are given suitable for formatting and parsing the article as a sample text.     

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.     

Robust linear output feedback controller for autonomous landing of a quadrotor on a ship deck

Ship deck landing control of a quadrotor requires certain robustness with respect to ship heave motion. Typical systems only provide relative height, therefore do not have relative heave rate information. In this paper, a linear output feedback control consisting of a full state feedback controller and a Luenberger observer is formulated. Invariant ellipsoid method is used to formulate an estimation of a bound on the response of a linear output feedback-controlled system subjected to external disturbances and measurement noise. The gains that result in a minimum bound are optimized using a gradient descent iterative approach proposed in this paper where the invariant ellipsoid condition is linearized into a tractable LMI condition. This approach is applied to a simulation of a quadrotor landing on a ship deck and results are compared with other gains. The gains selected using the proposed approach exhibits improved robustness to external disturbances and measurement noise.     

A dynamic Houjin (square) and a symmetric Houjin

A Houjin is an n by n square lattice with each cell containing a symbol (such as a number or a letter). Further, these numbers or letters are designed to exhibit symmetry. For example, a magic square is a Houjin where the embedded symmetry is that the numbers in each row, column, and a center diagonal have an equal sum. This article reports a new Houjin: a dynamic Houjin. A dynamic Houjin changes its numbers at each time step while satisfying the symmetry as a Houjin (a magic square). The dynamic Houjin has a further symmetry in a time dimension, i.e., the sums of the numbers in each cell are identical.     

Pervasive computing: a paradigm for the 21st century

Pervasive computing promises to make life simpler via digital environments that sense, adapt, and respond to human needs. Yet we still view computers as machines that run programs in a virtual environment. Pervasive computing presumes a different vision. A device can be a portal into an application-data space, not just a repository of custom software a user must manage. An application is a means by which a user performs a task, not software written to exploit a device's capabilities. And a computing environment is an information-enhanced physical space, not a virtual environment that exists to store and run software. Pervasive computing is close to technical and economic viability.