尺寸关联约束的识别及求解方法的研究

针对尺寸之间的关联约束，本文首先分析了尺寸链约束的特点，提出了基于尺寸链的尺寸环模型．通过对尺寸和被约束图形对象的识别与理解，研究了尺寸链、尺寸环建立和尺寸环中的尺寸到被约束元素之间的约束关系的映射算法，实现了尺寸关联约束的识别和求解．     

Automatic detection and tracking of moving image target with CNN‐UM via target probability fusion of multiple features

A high speed target detection and tracking algorithm for a CNN‐UM chip is presented in this paper. The target confidence value is computed based on the fusion of target existence probabilities of features using products of weighted sums. The target decision is done with such a confidence value and target initiation is done through the temporal accumulation of the confidence. The probability of the target existence for each feature is created in the region of influence depending on the reliability and the strength of the feature. By virtue of the analogic parallel processing structure of the CNN‐UM (Roska T, Chua LO. The CNN universal machine: an analogic array computer. IEEE Trans. Circuits Systems II 1993; CAS‐40 : 163–173), real time tracking can be achieved with presently available technologies with the speed of several kilo‐frames per second. Due to the utilization of multiple features of target, robust target detection is possible via the proposed algorithm. On‐chip experiments of the proposed target‐tracking algorithm have been done and properties of the proposed approach are disclosed through the various experiments. Copyright © 2003 John Wiley & Sons, Ltd.     

AC motor drive systems with a reduced-switch-count converter

This paper presents two reduced-switch-count AC drive systems. One of the configurations was conceived to operate with a two-phase motor and the other one with a three-phase motor. The drive systems provide both bidirectional power flow and power factor control. Pulsewidth modulation techniques for the converter control are discussed. Experimental results are presented.     

Supply Chain Management in Food Chains: Improving Performance by Reducing Uncertainty

This paper investigates the impact of Supply Chain Management on logistical performance indicators in food supply chains. From a review of quantitative and more qualitative managerial literature, we believe that Supply Chain Management should be concerned with the reduction or even elimination of uncertainties to improve the performance of the chain. The following clusters of sources of uncertainty are identified: order forecast horizon, input data, administrative and decision processes and inherent uncertainties. For each source of uncertainty, several improvement principles are identified. A case study was conducted in a food chain in which a simulation model helped quantify the effects of alternative configurations and operational management concepts. By comparing this simulation study with a pilot study, the model is validated against real data, and organisational consequences are identified. The results of the case study suggest that reduction of uncertainties can improve service levels significantly, although current supply chain configurations restrict possible benefits. The availability of real-time information systems is found to be a requirement for obtaining efficient and effective Supply Chain Management concepts.     

An invitation to Friendly Testing

1IntroductionSinceitspresentationin[1,2]TestingSemanticshasbeenwidelystudiedandusedasanaturalwaytodefineanobservationalbehaviorwithareasonablepowertodistinguishsemanticallydifferentprocesses.TestingSemanticsisdefinedbyobservingtheoperationalsemanticsofprocessesbymeansoftests.Testsarejustprocesseswhichmayexecuteanewactionwreportingsuccessofthetestapplication.Todefinetheapplicationofatesttoaprocesslweconsiderthedifferentcomputationsoftheexperimentalsystemwhichisobtainedbycomposinginparallelthe…     

基于NURBS曲线拟合的图像亚像素边缘提取方法

通过介绍激光扫描测量原理 ,说明准确地从光刀图像中提取光刀边缘位置是影响测量精度的关键因素 .由于噪声的存在 ,使用常见的边缘检测方法 ,在光刀图像中提取同一位置的光刀边缘 ,以及计算光刀中心位置 ,会带来很大的误差 .为了降低误差 ,本论文提出了基于 NURBS曲线拟合的亚像素光刀边缘提取方法 .通过实验 ,说明该方法重复提取的结果比较稳定 ,而且将误差控制在 0 .4个像素以下 ,从而使重复测量的高度误差在 0 .0 8mm以下     

Meta-modelling and graph grammars for multi-paradigm modelling in AToM<Superscript>3</Superscript>

This paper presents the combined use of meta-modelling and graph grammars for the generation of visual modelling tools for simulation formalisms. In meta-modelling, formalisms are described at a meta-level. This information is used by a meta-model processor to generate modelling tools for the described formalisms. We combine meta-modelling with graph grammars to extend the model manipulation capabilities of the generated modelling tools: edit, simulate, transform into another formalism, optimize and generate code. We store all (meta-)models as graphs, and thus, express model manipulations as graph grammars.We present the design and implementation of these concepts in AToM³ (A_To_ol for M_ulti-formalism, M_eta-M_odelling). AToM³ supports modelling of complex systems using different formalisms, all meta-modelled in their own right. Models in different formalisms may be transformed into a single common formalism for further processing. These transformations are specified by graph grammars. Mosterman and Vangheluwe [18] introduced the term multi-paradigm modelling to denote the combination of multiple formalisms, multiple abstraction levels, and meta-modelling. As an example of multi-paradigm modelling we present a meta-model for the Object-Oriented Continuous Simulation Language OOCSMP, in which we combine ideas from UML class diagrams (to express the OOCSMP model structure), Causal Block Diagrams (CBDs), and Statecharts (to specify the methods of the OOCSMP classes). A graph grammar is able to generate OOCSMP code, and then a compiler for this language (C-OOL) generates Java applets for the simulation execution.     

On-Line Dial-a-Ride Problems Under a Restricted Information Model

In on-line dial-a-ride problems servers are traveling in some metric space to serve requests for rides which are presented over time. Each ride is characterized by two points in the metric space, a source, the starting point of the ride, and a destination, the endpoint of the ride. Usually it is assumed that at the release of a request, complete information about the ride is known. We diverge from this by assuming that at the release of a ride, only information about the source is given. At visiting the source, the information about the destination will be made available to the servers. For many practical problems, our model is closer to reality. However, we feel that the lack of information is often a choice, rather than inherent to the problem: additional information can be obtained, but this requires investments in information systems. In this paper we give mathematical evidence that for the problem under study it pays to invest.     

On combining support vector machines and simulated annealing in stereovision matching

This paper outlines a method for solving the stereovision matching problem using edge segments as the primitives. In stereovision matching, the following constraints are commonly used: epipolar, similarity, smoothness, ordering, and uniqueness. We propose a new strategy in which such constraints are sequentially combined. The goal is to achieve high performance in terms of correct matches by combining several strategies. The contributions of this paper are reflected in the development of a similarity measure through a support vector machines classification approach; the transformation of the smoothness, ordering and epipolar constraints into the form of an energy function, through an optimization simulated annealing approach, whose minimum value corresponds to a good matching solution and by introducing specific conditions to overcome the violation of the smoothness and ordering constraints. The performance of the proposed method is illustrated by comparative analysis against some recent global matching methods.     

Software process representation and analysis for framework instantiation

Object-oriented frameworks are currently regarded as a promising technology for reusing designs and implementations. However, developers find there is still a steep learning curve when extracting the design rationale and understanding the framework documentation during framework instantiation. Thus, instantiation is a costly process in terms of time, people, and other resources. These problems raise a number of questions including: "How can we raise the level of abstraction in which the framework instantiation is expressed, reasoned about and implemented?" "How can the same high-level design abstractions that were used to develop the framework be used during framework instantiation instead of using source code as is done currently?" "How can we define extended design abstractions that can allow framework instantiation to be explicitly represented and validated?" We present an approach to framework instantiation based on software processes that addresses these issues. Our main goal is to represent the framework design models in an explicit and declarative way, and support changes to this design based on explicit instantiation tasks based on software processes while maintaining system integrity, invariants, and general constraints. In this way, the framework instantiation can be performed in a valid and controlled way.