Filters








302 Hits in 4.5 sec

Specifying active databases as non-Markovian theories of actions

Iluju Kiringa
2008 Journal of Intelligent Information Systems  
In this paper, we formalize active relational databases within the framework of the situation calculus by uniformly accounting for them using theories embodying non-Markovian control in the situation calculus  ...  We call these theories active relational theories and use them to capture the dynamics of active databases.  ...  Like the later, active relational theories are non-Markovian theories.  ... 
doi:10.1007/s10844-007-0050-3 fatcat:jqhe4vynofbkzolftpucljwzae

Coinductive Models of Finite Computing Agents

Peter Wegner, Dina Goldin
1999 Electronical Notes in Theoretical Computer Science  
The equivalent expressiveness of TMs, algorithms, computable functions, and formal systems is due largely to their common use of induction as a basis for system specification.  ...  Non-wellfounded set theory models sequential interaction by formalizing the semantics of streams [BM]: extension of computational expressiveness: algorithms → interaction extension of set theoretic expressiveness  ...  Non-well-founded set theory provides a denotational semantics for streams, while coalgebras provide a framework for operational semantics of interaction machines that are transducers of streams [WG] .  ... 
doi:10.1016/s1571-0661(05)80270-1 fatcat:aqfntxxu2jcxxhwsdmgj4bc5za

Business process management as the "Killer App" for Petri nets

W. M. P. van der Aalst
2014 Journal of Software and Systems Modeling  
Since their inception in 1962, Petri nets have been used in a wide variety of application domains.  ...  Over time Petri nets emerged as a solid foundation for Business Process Management (BPM) research.  ...  For example, transition t1 has label a referring to the activity of registering a request for compensation.  ... 
doi:10.1007/s10270-014-0424-2 fatcat:np66uinwh5ffnheqylkh7zhypi

Tuning Systems: From Composition to Performance

J. Hillston
2005 Computer journal  
Theoretical developments have been tested and validated by application to a wide range of problems and such case studies have provided the stimulus for new directions in theory.  ...  This paper gives a summary of some of the work of the Performance Evaluation Process Algebra (PEPA) project, which was awarded the 2004 Roger Needham Award from the BCS.  ...  ACKNOWLEDGEMENTS Many people have contributed to the PEPA project in a variety of ways. In particular, the author would like to thank Ashok Argent-Katwala, Anne Benoit  ... 
doi:10.1093/comjnl/bxh097 fatcat:bppqqx46jfhx7hhyem7a6oykpe

A unified model of qualitative belief change: a dynamical systems perspective

Craig Boutilier
1998 Artificial Intelligence  
We also draw parallels to models of stochastic dynamical systems, and use this to develop a model that deals with iterated update and noisy observations in qualitative settings that is analogous to Bayesian  ...  This model of update combines aspects of revision and update, providing a more realistic characterization of belief change.  ...  Acknowledgements Thanks to Nir Friedman, Moists Goldszmidt, Joe Halpern and David Poole for helpful discussions on this topic. This research was supported by NSERC Research Grant OGP0121843.  ... 
doi:10.1016/s0004-3702(97)00066-0 fatcat:5vmau75jarhpffrhxyqte47yx4

A Unification of Sensor and Higher-Level Fusion

Dale Lambert
2006 2006 9th International Conference on Information Fusion  
A State Transition Data Fusion Model is introduced as an extension of the dominant sensor fusion paradigm to provide a unification of both sensor and higher-level fusion.  ...  At time k+1, each observation assessment û(k+1|k+1) is semantically registered as a proposition Φ(k+1) and then associated with zero, one or more predicted observations Φ (k+1|k) by using a semantic theory  ...  A semantic theory F(k+1) can then introduce more sophisticated constructs.  ... 
doi:10.1109/icif.2006.301552 dblp:conf/fusion/Lambert06a fatcat:ymuzkdkjmjh5ddh2p6cn5ej3b4

CADP 2011: a toolbox for the construction and analysis of distributed processes

Hubert Garavel, Frédéric Lang, Radu Mateescu, Wendelin Serwe
2012 International Journal on Software Tools for Technology Transfer (STTT)  
Cadp (Construction and Analysis of Distributed Processes) is a comprehensive software toolbox that implements the results of concurrency theory.  ...  The paper then reviews the main features of Cadp 2011, including compilers for various formal specification languages, equivalence checkers, model checkers, compositional verification tools, performance  ...  -Cadp relies on action-based (rather than state-based ) semantic models inherited from concurrency theory, in which one can only refer to the observable communication actions performed by a system instead  ... 
doi:10.1007/s10009-012-0244-z fatcat:fdch5egwpneebjd3bo6lozyhby

Artificial Intelligence Inheriting the Historical Crisis in Psychology: An Epistemological and Methodological Investigation of Challenges and Alternatives

Mohamad El Maouch, Zheng Jin
2022 Frontiers in Psychology  
a preliminary algorithmic model that grasps the formation of meaning as an essential ability for the qualitative reflection of reality and the emergence of other mental functions.  ...  By following the arguments developed by Vygotsky and employing the cultural-historical activity theory (CHAT) in addition to dialectical logic, this paper attempts to investigate the interaction between  ...  For example, the action of the organism pushing an object becomes a mental component of an active actor (I am doing).  ... 
doi:10.3389/fpsyg.2022.781730 pmid:35360561 pmcid:PMC8961441 fatcat:fnl2ac4fz5da3a3nr2u6dgdqia

A general result for deriving product-form solutions in markovian models

Andrea Marin, Maria Grazia Vigliotti
2010 Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering - WOSP/SIPEW '10  
We take inspiration from the Reversed Compound Agent Theorem [14] and we provide a different formulation using labeled automata, a generalization which encompasses a bigger class of productform solutions  ...  In this paper we provide a general method to derive productform solutions for stochastic models.  ...  ., [21, 27, 7, 25, 12, 8] , for different systems in the theory of Markovian stochastic models.  ... 
doi:10.1145/1712605.1712632 dblp:conf/wosp/MarinV10 fatcat:v62sas3h2nbchkbc7ykrwlwkcu

Exploiting referential context in spoken language interfaces for data-poor domains

Stephen Wu, Lane Schwartz, William Schuler
2008 Proceedings of the 13th international conference on Intelligent user interfaces - IUI '08  
The interface incorporates a knowledge of context into its model of syntax, yielding a referential semantic language model.  ...  Interestingly, the referential semantic language model exploits context dynamically, unlike other recent systems, by using incremental processing and the limited stack memory of an HMM-like time series  ...  The result is a single unified referential semantic probability model which achieves significant recognition accuracy gains over non-semantic alternatives and runs in real time on large domains.  ... 
doi:10.1145/1378773.1378811 dblp:conf/iui/WuSS08 fatcat:bn2llucbfbdjbk3lpvay3lynue

Matching and Merging of Variant Feature Specifications

Shiva Nejati, Mehrdad Sabetzadeh, Marsha Chechik, Steve Easterbrook, Pamela Zave
2012 IEEE Transactions on Software Engineering  
This enables us to automatically construct merges that preserve the semantics of hierarchical state machines.  ...  We report on tool support for our Match and Merge operators, and illustrate and evaluate our work by applying these operators to a set of telecommunication features built by AT&T.  ...  We are grateful to Thomas Smith for help with our analysis of telecom features.  ... 
doi:10.1109/tse.2011.112 fatcat:xlvs46loinbzrmsoijewn2zbkq

DAG-Based Attack and Defense Modeling: Don't Miss the Forest for the Attack Trees [article]

Barbara Kordy, Ludovic Piètre-Cambacédès, Patrick Schweitzer
2013 arXiv   pre-print
DAGs allow for a hierarchical decomposition of complex scenarios into simple, easily understandable and quantifiable actions.  ...  The objective of this survey is to present a complete overview of graphical attack and defense modeling techniques based on DAGs.  ...  Acknowledgments The authors would like to thank Sjouke Mauw and Pieter Hartel for their comments on a preliminary version of this survey, which helped them to improve the paper.  ... 
arXiv:1303.7397v1 fatcat:fiebxymrd5dcnmnufddaoaqlaa

Analyzing large-scale human mobility data: a survey of machine learning methods and applications

Eran Toch, Boaz Lerner, Eyal Ben-Zion, Irad Ben-Gal
2018 Knowledge and Information Systems  
We categorize these approaches and models in a taxonomy based on their positioning characteristics, the scale of analysis, the properties of the modeling approach, and the class of applications they can  ...  The efforts to mine significant patterns within large-scale, high-dimensional mobility data have solicited use of advanced analysis techniques, usually based on machine learning methods, and therefore,  ...  Acknowledgements This work is supported by the Israeli Ministry of Science, Technology, and Space, Grant No. 3-8709: Learning and mining mobility patterns using stochastic models.  ... 
doi:10.1007/s10115-018-1186-x fatcat:nesak2c3uzhyvhynd5gv4vmeve

Machine Learning in Chemical Engineering : A Perspective

Artur M. Schweidtmann, Erik Esche, Asja Fischer, Marius Kloft, Jens-Uwe Repke, Sebastian Sager, Alexander Mitsos
2021 Chemie - Ingenieur - Technik (2021). doi:10.1002/cite.202100083  
Under the umbrella of these challenges, we discuss perspectives for future interdisciplinary research that will enable the transformation of CE.  ...  The transformation of the chemical industry to renewable energy and feedstock supply requires new paradigms for the design of flexible plants, (bio-)catalysts, and functional materials.  ...  The authors gratefully acknowledge the DFG for establishing the Priority Programme SPP 2331 ''Machine learning in chemical engineering.  ... 
doi:10.18154/rwth-2021-09826 fatcat:7tlvcx22urd27fpjfbw4iqhr7a

A quest for beauty and wealth (or, business processes for database researchers)

Daniel Deutch, Tova Milo
2011 Proceedings of the 30th symposium on Principles of database systems of data - PODS '11  
This, in turn, has lead to an economic wealth for both the users and vendors of database systems. Similar beauty and wealth are sought for in the context of Business Processes.  ...  Much of the success of database systems in the last decade is due to the beauty and elegance of the relational model and its declarative query languages, combined with a rich spectrum of underlying evaluation  ...  the application is modeled as a relational database and the database state is modified using the repeated activation of queries (in the spirit of active databases [3] ).  ... 
doi:10.1145/1989284.1989286 dblp:conf/pods/DeutchM11 fatcat:engazu6cbbbehlhp4t77bnfoja
« Previous Showing results 1 — 15 out of 302 results