A fan data compression method is presented that tripled laser printer speed for Bode and simulation plots with many points. This reduced printer delays without the expense of a faster laser printer, and it saved compu...
详细信息
A fan data compression method is presented that tripled laser printer speed for Bode and simulation plots with many points. This reduced printer delays without the expense of a faster laser printer, and it saved computer time as well. The authors describe their problem, solution, and conclusions. They give the fan algorithm and present its performance for several applications. They include a pseudocode implementation.
This paper presents the design and implementation of a mission control system for an AUV. The mission is easily described using an imperative-like pseudo-code that allows sequential/parallel, conditional/unconditional...
详细信息
This paper presents the design and implementation of a mission control system for an AUV. The mission is easily described using an imperative-like pseudo-code that allows sequential/parallel, conditional/unconditional and iterative task execution. This pseudo-code is manually translated into a Petri net, to formally describe the mission thread of execution. Then the mission controller executes the Petri net in real-time on a behavioural control architecture enabling/disabling and configuring robot behaviours. The proposed system has been programmed and tested on a low cost AUV performing a simplified mission of scientific interest.
Given a presentation for a rack R, we define a process which systematically enumerates the elements of R. The process is modeled on the systematic enumeration of cosets first given by Todd and Coxeter. This generalize...
详细信息
Given a presentation for a rack R, we define a process which systematically enumerates the elements of R. The process is modeled on the systematic enumeration of cosets first given by Todd and Coxeter. This generalizes and improves the diagramming method for n-quandles introduced by Winker. We provide pseudocode that is similar to that given by Holt, Eick, and O'Brien for the Todd-Coxeter process. We prove that the process terminates if and only if R is finite, in which case, the procedure outputs an operation table for the finite rack. We conclude with an application to knot theory.
This study presents the design and implementation of efficient architectures for finite Radon transform (FRAT) on a field programmable gate array (FPGA). FPGA-based architectures with two design strategies have been p...
详细信息
This study presents the design and implementation of efficient architectures for finite Radon transform (FRAT) on a field programmable gate array (FPGA). FPGA-based architectures with two design strategies have been proposed: direct implementation of pseudo-code with a sequential or pipelined description, and a block random access memory-based approach. Various medical images modalities have been deployed for both software evaluation and hardware implementation. Xilinx DSP tool has been used to improve the implementation time and reduce the design cycle and the Xilinx software has been used for generating a hardware description language from a high-level MATLAB description. Objective evaluation of image denoising using FRAT is carried out and demonstrates promising results. Moreover, the impact of different block sizes on image reconstruction has been analysed. Performance analysis in terms of area, maximum frequency and throughput is presented and reveals significant achievements.
We construct an example of a C-infinity diffeomorphism on a 7-manifold which has an invariant set with an uncountable number of pseudocircle components. Furthermore, any diffeomorphism which is sufficiently close (in ...
详细信息
We construct an example of a C-infinity diffeomorphism on a 7-manifold which has an invariant set with an uncountable number of pseudocircle components. Furthermore, any diffeomorphism which is sufficiently close (in the C-1 metric) to the constructed map has a similar invariant set. We also discuss the topological nature of the invariant set.
A new algorithm for bisimilarity minimization of labelled directed graphs is presented. Its time consumption is O (m log n), where n is the number of states and m is the number of transitions. Unlike earlier algorithm...
详细信息
A new algorithm for bisimilarity minimization of labelled directed graphs is presented. Its time consumption is O (m log n), where n is the number of states and m is the number of transitions. Unlike earlier algorithms, it meets this bound even if the number of different labels of transitions is not fixed. It is based on refining a partition of states with respect to the labelled transitions. A splitter is a pair consisting of a label and a set in the partition. A transition belongs to a splitter, if and only if it has the same label and its end state is in the set. Earlier algorithms consume lots of time in scanning splitters that have no transitions. The new algorithm avoids this by maintaining also a partition of transitions. To facilitate this, a refinable partition data structure with amortized constant time operations is used. Detailed pseudocode of all nontrivial details is presented. Novel simplifications are applied that both reduce the practical memory consumption and shorten the program code.
This paper concerns the digital circle recognition problem, especially in the form of the circular separation problem. General fundamentals, based on classical tools, as well as algorithmic details, are given (the lat...
详细信息
This paper concerns the digital circle recognition problem, especially in the form of the circular separation problem. General fundamentals, based on classical tools, as well as algorithmic details, are given (the latter by providing pseudo-code for major steps of the algorithm). After recalling the geometrical meaning of the separating circle problem, we present an incremental algorithm to segment a discrete curve into digital arcs. (C) 2003 Elsevier B.V. All rights reserved.
In recent years, researchers come up with lots of path following algorithms. One of their basic assumptions is that the robot's initial position is a single certain point. Actually, as robots rely on sensor data t...
详细信息
ISBN:
(纸本)9781479974894
In recent years, researchers come up with lots of path following algorithms. One of their basic assumptions is that the robot's initial position is a single certain point. Actually, as robots rely on sensor data to locate by Kalman filter or Partical filter, it outputs a probability distribution. In this paper, F* describes a new path following algorithm with the robot's initial position is uncertain. It depends on Monte Carlo method and A* algorithm. Some important concepts are introduced and pseudocode is given to show how it works. Experiment results show that it is more effective than general algorithm.
作者：
de Smith, MJUCL
Ctr Adv Spatial Analysis London WC1E 7HB England
Many spatial datasets and spatial problems can be described with reference to regular lattice frameworks rather than continuous space. Examples include: raster scan and digital elevation model data, digital images, co...
详细信息
Many spatial datasets and spatial problems can be described with reference to regular lattice frameworks rather than continuous space. Examples include: raster scan and digital elevation model data, digital images, cost surfaces, cellular automata models, swarm models, and many others. This raises the question as to how distances should be measured in such cases and to what extent these relate to continuous space metrics. In this paper I show that a set of image processing algorithms known as distance transforms (DTs) may be applied to such datasets and can be extended to solve a wide range of 2D and 3D optimisation problems. These extended versions of the standard DT procedure have applications in many areas including location theory, path determination, planning, and decision support. As such I argue that they warrant consideration for inclusion as a standard set of tools within modern GIS and spatial analysis software packages. Sample pseudo-code for the transforms discussed is included in an appendix.
Weakly consistent multiprocessors such as ARM and IBM POWER have been with us for decades, but their subtle programmer-visible concurrency behaviour remains challenging, both to implement and to use;the traditional ar...
详细信息
ISBN:
(纸本)9781450340342
Weakly consistent multiprocessors such as ARM and IBM POWER have been with us for decades, but their subtle programmer-visible concurrency behaviour remains challenging, both to implement and to use;the traditional architecture documentation, with its mix of prose and pseudocode, leaves much unclear. In this paper we show how a precise architectural envelope model for such architectures can be defined, taking IBM POWER as our example. Our model specifies, for an arbitrary test program, the set of all its allowable executions, not just those of some particular implementation. The model integrates an operational concurrency model with an ISA model for the fixed-point non-vector user-mode instruction set (largely automatically derived from the vendor pseudocode, and expressed in a new ISA description language). The key question is the interface between these two: allowing all the required concurrency behaviour, without over committing to some particular microarchitectural implementation, requires a novel abstract structure. Our model is expressed in a mathematically rigorous language that can be automatically translated to an executable test-oracle tool;this lets one either interactively explore or exhaustively compute the set of all allowed behaviours of intricate test cases, to provide a reference for hardware and software development.
暂无评论