1,417 research outputs found
Are there new models of computation? Reply to Wegner and Eberbach
Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations
to Turing Machines as a foundation of computability and that these can be overcome
by so-called superTuring models such as interaction machines, the [pi]calculus and the
$-calculus. In this paper we contest Weger and Eberbach claims
Recommended from our members
Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine
A stream X-machine is a type of extended finite state machine with an associated development approach that consists of building a system from a set of trusted components. One of the great benefits of using stream X-machines for the purpose of specification is the existence of test generation techniques that produce test suites that are guaranteed to determine correctness as long as certain well-defined conditions hold. One of the conditions that is traditionally assumed to hold is controllability: this insists that all paths through the stream X-machine are feasible. This restrictive condition has recently been weakened for testing from a deterministic stream X-machine. This paper shows how controllability can be replaced by a weaker condition when testing
a deterministic system against a non-deterministic stream X-machine. This paper therefore develops a new, more general, test generation algorithm for testing from a non-deterministic stream X-machine
A systematic algorithm development for image processing feature extraction in automatic visual inspection : a thesis presented in partial fulfilment of the requirements for the degree of Master of Technology in the Department of Production Technology, Massey University
Image processing techniques applied to modern quality control are described together with the development of feature extraction algorithms for automatic visual inspection. A real-time image processing hardware system already available in the Department of Production Technology is described and has been tested systematically for establishing an optimal threshold function. This systematic testing has been concerned with edge strength and system noise information. With the a priori information of system signal and noise, non-linear threshold functions have been established for real time edge detection. The performance of adaptive thresholding is described and the usefulness of this nonlinear approach is demonstrated from results using machined test samples. Examination and comparisons of thresholding techniques applied to several edge detection operators are presented. It is concluded that, the Roberts' operator with a non-linear thresholding function has the advantages of being simple, fast, accurate and cost effective in automatic visual inspection
A neural network model to forecast and describe bond ratings
Neural Network;Bond Ratings;accountancy
Interference and communications among active network applications
This paper focuses on active networks applications and in
particular on the possible interactions among these applications. Active networking is a very promising research field which has been developed recently, and which poses several interesting challenges to network designers.
A number of proposals for e±cient active network architectures are already to be found in the literature. However, how two or more active network applications may interact has not being investigated so far. In this work, we consider a number of applications that have been designed to exploit the main features of active networks and we discuss what are the main benefits that these applications may derive from them. Then, we introduce some forms of interaction including interference and communications among applications, and identify the components of an active network architecture that are needed to support these forms of interaction. We conclude by presenting a brief example of an active network
application exploiting the concept of interaction
Smart Sampling for Lightweight Verification of Markov Decision Processes
Markov decision processes (MDP) are useful to model optimisation problems in
concurrent systems. To verify MDPs with efficient Monte Carlo techniques
requires that their nondeterminism be resolved by a scheduler. Recent work has
introduced the elements of lightweight techniques to sample directly from
scheduler space, but finding optimal schedulers by simple sampling may be
inefficient. Here we describe "smart" sampling algorithms that can make
substantial improvements in performance.Comment: IEEE conference style, 11 pages, 5 algorithms, 11 figures, 1 tabl
Combined Modeling of Software and Hardware with Versions and Variants
Produktlinien ermöglichen die Entwicklung variabler, konfigurierbarer Produkte auf Basis von Konfigurationen. Eine valide Konfiguration wird im Problemraum einer Produktlinie abgeleitet, während ihre Realisierbarkeit zu einem Produkt im Lösungsraum entschieden wird. Eine valide, aber nicht realisierbare Konfiguration führt zu einer Inkonsistenz zwischen Problem- und Lösungsraum, da die Menge der tatsächlich baubaren Produkte im Lösungsraum nicht mit der definierten Variabilität im Problemraum übereinstimmt. Für große Produktlinien ist es händisch schwierig zu entscheiden, ob Inkonsistenzen existieren, da die Anzahl der Konfigurationen in Produktlinien exponentiell wächst. In dieser Arbeit wird die Konsistenz von Problem- und Lösungsraum adressiert und zwei formale Methoden auf Basis von Bedingungserfüllungsproblemen vorgeschlagen, um die Menge der Konfigurationen zu berechnen, die sowohl valide als auch realisierbar sind. Die Sampling-Methode entscheidet die Realisierbarkeit für jede Konfiguration aus einer Menge von validen Konfigurationen einzeln. Damit kann im Voraus überprüft werden, welche bestehenden Konfigurationen auch nach einer Softwareaktualisierung noch funktionsfähig sind. Die kombinierte Methode berechnet direkt Konfigurationen, die sowohl valide als auch realisierbar sind, für weitere Produkttests. Beide Methoden werden anhand zweier Fallstudien mit exemplarischen Produktlinien evaluiert. In den Ergebnissen wird gezeigt, dass beide Methoden alle Inkonsistenzen zwischen Problem- und Lösungsraum in den Produktlinienbeispielen identifizieren können
UML Interactions Meet State Machines - An Institutional Approach
UML allows the multi-viewpoint modelling of systems. One important question is whether an interaction as specified by a sequence diagram can be actually realised in the system. Here, the latter is specified as a combination of several state machines (one for each lifeline in the interaction) by a composite structure diagram. In order to tackle this question, we formalise the involved UML diagram types as institutions, and their relations as institution (co)morphisms
Critical Management Issues for Implementing RFID in Supply Chain Management
The benefits of radio frequency identification (RFID) technology in the supply chain are fairly compelling. It has the potential to revolutionise the efficiency, accuracy and security of the supply chain with significant impact on overall profitability. A number of companies are actively involved in testing and adopting this technology. It is estimated that the market for RFID products and services will increase significantly in the next few years. Despite this trend, there are major impediments to RFID adoption in supply chain. While RFID systems have been around for several decades, the technology for supply chain management is still emerging. We describe many of the challenges, setbacks and barriers facing RFID implementations in supply chains, discuss the critical issues for management and offer some suggestions. In the process, we take an in-depth look at cost, technology, standards, privacy and security and business process reengineering related issues surrounding RFID technology in supply chains
- …