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.     

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.     

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     

Bumpless transfer between observer-based gain scheduled controllers

This paper deals with bumpless transfer between a number of observer-based controllers in a gain scheduling architecture. Linear observer-based controllers are designed for a number of linear approximations of a non-linear system in a set of operating points, and gain scheduling control can subsequently be achieved by interpolating between each controller. The Youla-Jabr-Bongiorno-Kucera (YJBK) parameterization is used to achieve a smooth scheduling between the controllers. This approach produces a scheduled controller as a linear fractional transformation between a fixed controller and a scheduling parameter. The approach is tested on a simple, but highly non-linear model of a fossil fuel power plant.     

Panoramic appearance-based recognition of video contents using matching graphs

This paper proposes a general scheme for recognizing the contents of a video using a set of panoramas recorded in a database. In essence, a panorama inherently records the appearances of an omni-directional scene from its central point to arbitrary viewing directions and, thus, can serve as a compact representation of an environment. In particular, this paper emphasizes the use of a sequence of successive frames in a video taken with a video camera, instead of a single frame, for visual recognition. The associated recognition task is formulated as a shortest-path searching problem, and a dynamic-programming technique is used to solve it. Experimental results show that our method can effectively recognize a video.     

An Interactive Designing System with Virtual Sculpting and Virtual Woodcut Printing

In this paper, we propose an interactive designing method and a system based on it to create 3D objects and 2D images. This system consists of two subsystems for virtual sculpting to create a 3D shape and virtual printing to produce a picture with a printing block. In the virtual sculpting subsystem, a user can form solid objects with curved surfaces as if sculpting them. The user operates virtual chisels, and can remove or attach arbitrary shapes of ellipsoids or cubes from or to the workpiece. A 3D object generated by virtual sculpting looks like a real wooden sculpture. If using a board as a workpiece, a user can generate a virtual printing block. In the virtual printing subsystem, a user can synthesize a woodcut printing image from the virtual printing block mentioned above, a virtual paper sheet, and a printing brush. The user can synthesize a realistic woodcut print with a procedure similar to the actual woodcut printing.     

On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion

We show how Ohori and Sasano's recent lightweight fusion by fixed-point promotion provides a simple way to prove the equivalence of the two standard styles of specification of abstract machines: (1) in small-step form, as a state-transition function together with a ‘driver loop’, i.e., a function implementing the iteration of this transition function; and (2) in big-step form, as a tail-recursive function that directly maps a given configuration to a final state, if any. The equivalence hinges on our observation that for abstract machines, fusing a small-step specification yields a big-step specification. We illustrate this observation here with a recognizer for Dyck words, the CEK machine, and Krivine's machine with call/cc.The need for such a simple proof is motivated by our current work on small-step abstract machines as obtained by refocusing a function implementing a reduction semantics (a syntactic correspondence), and big-step abstract machines as obtained by CPS-transforming and then defunctionalizing a function implementing a big-step semantics (a functional correspondence).     

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 proposal of bargaining solution for cooperative contract in a supply chain

As a problem in supply chain management, the decision problem of terms and conditions of a contract between a supplier and a retailer is recognized commonly. The concept of cooperative bargaining between a supplier and a retailer is the key concepts to resolve this problem in the supply chain. Then, the bargaining evaluation function by Nash in the game theory exists as a tool to obtain the solution by cooperation bargaining. The Nash bargaining solution is derived under the premise that a power balance between a supplier and a retailer is equal. However, the situation where the power balance between a supplier and a retailer in actual bargaining is not equal is supposed frequently. For the purpose of reflecting the power balance in obtaining the bargaining solution, the concept of a general bargaining solution was proposed and then the general bargaining evaluation function for obtaining the general bargaining solution was devised. However, in the case of adopting the general bargaining evaluation function as a bargaining tool, some problems are included. In this article, we address the problems in the general bargaining solution. Then, we propose a new concept of bargaining process to obtain a solution under considering the existence of power balance between a supplier and a retailer.     

Error estimate for quasistatic history-dependent contact model

In this paper we consider a mathematical model which describes a quasistatic process for a viscoelastic body in contact with an obstacle or a foundation. The variational formulation of the problem is in the form of a system coupling a nonlinear integral equation with a history-dependent hemivariational inequality. We establish a fully discrete scheme of the abstract problem and derive a result on error estimate.     

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.     

Conditional states and independence in D-posets

In this paper a new approach to a conditional probability is studied in more general structure called a D-poset. The authors go into the inner structure of a conditional system which is a crucial notion for the existence of a conditional state. An independence of elements in a D-poset with respect to a state is defined.     

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.