Search results for "Computer Science Applications"
showing 10 items of 3993 documents
HOW SMART DOES AN AGENT NEED TO BE?
2005
The classic distributed computation is done by atoms, molecules or spins in vast numbers, each equipped with nothing more than the knowledge of their immediate neighborhood and the rules of statistical mechanics. These agents, 1023 or more, are able to form liquids and solids from gases, realize extremely complex ordered states, such as liquid crystals, and even decode encrypted messages. We will describe a study done for a sensor-array "challenge problem" in which we have based our approach on old-fashioned simulated annealing to accomplish target acquisition and tracking under the rules of statistical mechanics. We believe the many additional constraints that occur in the real problem ca…
ENFORCEMENT OF INTER-TASK DEPENDENCIES IN WORKFLOWS, CHARACTERIZATION AND PARADIGM
1998
Workflow techniques have gained a lot of attention as a means to support advanced business applications such as cooperative information systems and process re-engineering but also as a means to integrate legacy systems. Inter-task dependencies, described separately from the other parts of the workflow, have been recognized as a valuable method in describing certain restrictions on the executions of workflows. In this paper, we study the issue of pre-analysing and enforcing inter-task dependencies. The protocol and the theory behind it are presented, along with examples and discussions on ways to improve the performance. The idea is to present the meaning of a dependency through an automato…
Algorithmic Analysis of Programs with Well Quasi-ordered Domains
2000
AbstractOver the past few years increasing research effort has been directed towards the automatic verification of infinite-state systems. This paper is concerned with identifying general mathematical structures which can serve as sufficient conditions for achieving decidability. We present decidability results for a class of systems (called well-structured systems) which consist of a finite control part operating on an infinite data domain. The results assume that the data domain is equipped with a preorder which is a well quasi-ordering, such that the transition relation is “monotonic” (a simulation) with respect to the preorder. We show that the following properties are decidable for wel…
Communication complexity in a 3-computer model
1996
It is proved that the probabilistic communication complexity of the identity function in a 3-computer model isO(√n).
Dirac physical measures for generic diffeomorphisms
2016
We prove that, for a $C^1$ generic diffeomorphism, the only Dirac physical measures with dense statistical basin are those supported on sinks.
The Hierarchical Continuous Pursuit Learning Automation: A Novel Scheme for Environments With Large Numbers of Actions.
2019
Although the field of learning automata (LA) has made significant progress in the past four decades, the LA-based methods to tackle problems involving environments with a large number of actions is, in reality, relatively unresolved. The extension of the traditional LA to problems within this domain cannot be easily established when the number of actions is very large. This is because the dimensionality of the action probability vector is correspondingly large, and so, most components of the vector will soon have values that are smaller than the machine accuracy permits, implying that they will never be chosen . This paper presents a solution that extends the continuous pursuit paradigm to …
nalysis, Modeling and Simulation of Mechatronic Systems using the Bond Graph Method
2011
The Bond Graph is the proper choice of physical system used for: (i) Modeling which can be applied to systems combining multidisciplinary energy domains, (ii) Analysis to provide a great value proposition for finding the algebraic loops within the system enabling the process of troubleshooting and eliminating the defects by using the proper component(s) to fix the causality conflict even without being acquainted in the proper system, and (iii) Simulation facilitated through derived state space equations from the Bond Graph model is solved using industrial simulation software, such as 20-Sim. The Bond Graph technique is a graphical language of modeling, in which component energy ports are co…
MAD+. Introducing Misconceptions in the Temporal Analysis of the Mathematical Modelling Process of a Fermi Problem
2021
This work describes how the combination of the mistakes committed by a group of pre-service teachers when solving a Fermi problem, with the representation of the temporal analysis of their resolutions, can offer more in-depth information about their conceptual misconceptions regarding mathematical and modelling concepts. The combined representation allows knowing when mistakes occur and provides a powerful tool for instructors to adapt the teaching–learning processes of mathematics at all levels of education. Our study is based on a recent categorisation of students’ mistakes, together with the creation of a new representation tool, called MAD+, that can combine all this information. The ma…
Diffusive neural network
2002
Abstract A non-connectionist model of a neuronal network based on passive diffusion of neurotransmitters is presented as an alternative to hard-wired artificial neural networks. Classic thermodynamical approach shows that the diffusive network is capable of exhibiting asymptotic stability and a dynamics resembling that of a chaotic system. Basic computational capabilities of the net are discussed based on the equivalence with a Turing machine. The model offers a way to represent mass-sustained brain functions in terms of recurrent behaviors in the phase space.
Artificial Intelligence + Distributed Systems = Agents
2009
The connection with Wirth’s book goes beyond the title, albeit confining the area to modern Artificial Intelligence (AI). Whereas thirty years ago, to devise effective programs, it became necessary to enhance the classical algorithmic framework with approaches applied to limited and focused subdomains, in the context of broad-band technology and semantic web, applications - running in open, heterogeneous, dynamic and uncertain environments-current paradigms are not enough, because of the shift from programs to processes. Beside the structure as position paper, to give more weight to some basic assertions, results of recent research are abridged and commented upon in line with new paradigms.…