Results 1  10
of
23
A Probability Ranking Principle for Interactive Information Retrieval
, 2008
"... The classical Probability Ranking Principle (PRP) forms the theoretical basis for probabilistic Information Retrieval (IR) models, which are dominating IR theory since about 20 years. However, the assumptions underlying the PRP often do not hold, and its view is too narrow for interactive informatio ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
The classical Probability Ranking Principle (PRP) forms the theoretical basis for probabilistic Information Retrieval (IR) models, which are dominating IR theory since about 20 years. However, the assumptions underlying the PRP often do not hold, and its view is too narrow for interactive information retrieval (IIR). In this paper, a new theoretical framework for interactive retrieval is proposed: The basic idea is that during IIR, a user moves between situations. In each situation, the system presents to the user a list of choices, about which s/he has to decide, and the first positive decision moves the user to a new situation. Each choice is associated with a number of cost and probability parameters. Based on these parameters, an optimum ordering of the choices can the derived the PRP for IIR. The relationship of this rule to the classical PRP is described, and issues of further research are pointed out. 1
Eyespy: Supporting navigation through play
 In ACM SIGCHI
, 2009
"... This paper demonstrates how useful content can be generated as a byproduct of an enjoyable mobile multiplayer game. In EyeSpy, players tag geographic locations with photos or text. By locating the places in which other players ’ tags were created and ‘confirming’ them, players earn points for thems ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
(Show Context)
This paper demonstrates how useful content can be generated as a byproduct of an enjoyable mobile multiplayer game. In EyeSpy, players tag geographic locations with photos or text. By locating the places in which other players ’ tags were created and ‘confirming’ them, players earn points for themselves and verify the tags ’ locations. As a side effect of gameplay, EyeSpy produces a collection of recognisable and findable geographic details, in the form of photographs and text tags, that can be repurposed to support navigation tasks. Two user trials of the game successfully produced an archive of geolocated photographs and tags, and in a followup experiment we compared performance in a navigation task using photographs from the game, with georeferenced photos collected from the Flickr website. Our experiences with EyeSpy support reflection upon the design challenges presented by ‘human computation ’ and the production of usable byproducts through mobile gameplay.
Agentbased modeling: The right mathematics for the social sciences
 W., (Eds.). Elgar Recent Economic Methodology Companion, Northhampton
, 2011
"... for the social sciences? ..."
Turing Oracle Machines, Online Computing, and Three Displacements in Computability Theory
, 2009
"... ..."
Highlevel Structured Interactive Programs with Registers and Voices 1,2
"... Abstract: A model (consisting of rvsystems), a core programming language (for developing rvprograms), several specification and analysis techniques appropriate for modeling, programming and reasoning about interactive computing systems have been introduced by Stefanescu in 2004 using register mach ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract: A model (consisting of rvsystems), a core programming language (for developing rvprograms), several specification and analysis techniques appropriate for modeling, programming and reasoning about interactive computing systems have been introduced by Stefanescu in 2004 using register machines and spacetime duality, see [Stefanescu 2006, Stefanescu 2006b]. Later on, Dragoi and Stefanescu have introduced structured programming techniques for programming rvsystems and have presented a kernel programming language AGAPIA v0.1 for interactive computing systems, see [Dragoi and Stefanescu 2006a, Dragoi and Stefanescu 2006b]. AGAPIA v0.1 has a restricted format for program construction, using a “3level ” grammar for their definition: the procedure starts with simple while programs, then modules are defined, and finally AGAPIA v0.1 programs are obtained applying structured rvprogramming statements on top of modules. In the current paper the above restriction is completely removed. By an appropriate reshaping interface technique, general programs may be encapsulated into modules, allowing to reiterate the above “3level ” construction of programs, now starting with arbitrary AGAPIA programs, not with simple while programs. This way, highlevel interactive programs are obtained. The extended version is called AGAPIA v0.2. As a case study we consider a cluster of computers, each having a dynamic set of running processes. We present a protocol for the communication and termination detection in this system and implement the protocol in our AGAPIA v0.2 language. We also describe the operational semantics of the program using highlevel scenarios, i.e., scenarios where, recursively, the cells may themselves contain scenarios, at a lower, refined level.
The Development of Models of Computation with Advances in Technology and Natural Sciences
"... Abstract. The development of models of computation induces the development of technology and natural sciences and vice versa. Current state of the art of technology and sciences, especially networks of concurrent processes such as Internet or biological and sociological systems, calls for new comput ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. The development of models of computation induces the development of technology and natural sciences and vice versa. Current state of the art of technology and sciences, especially networks of concurrent processes such as Internet or biological and sociological systems, calls for new computational models. It is necessary to extend classical Turing machine model towards physical / natural computation. Important aspects are openness and interactivity of computational systems, as well as concurrency of computational processes. The development proceeds in two directions – as a search for new mathematical structures beyond algorithms as well as a search for different modes of physical computation that are not equivalent to actions of human executing an algorithm, but appear in physical systems in which concurrent interactive information processing takes place. The article presents the framework of infocomputationalism as applied on computing nature, where nature is an informational structure and its dynamics (information processing) is understood as computation. In natural computing, new developments in both understanding of natural systems and in their computational modelling are needed, and those two converge and enhance each other. 1 INTRODUCTION: WHAT IS COMPUTING
with registers and voices
, 810
"... A sound spatiotemporal Hoare logic for the verification of structured interactive programs ..."
Abstract
 Add to MetaCart
(Show Context)
A sound spatiotemporal Hoare logic for the verification of structured interactive programs
in Artificial Intelligence,”, L.A. Zadeh et.al (Eds.), Editing House of Romanian Academy, 2008. New parallel programming language
, 812
"... design: a bridge between brain models ..."
(Show Context)
The Expressive Power of Analog Recurrent Neural Networks on Infinite Input Streams
, 2012
"... We consider analog recurrent neural networks working on infinite input streams, provide a complete topological characterization of their expressive power, and compare it to the expressive power of classical infinite word reading abstract machines. More precisely, we consider analog recurrent neural ..."
Abstract
 Add to MetaCart
We consider analog recurrent neural networks working on infinite input streams, provide a complete topological characterization of their expressive power, and compare it to the expressive power of classical infinite word reading abstract machines. More precisely, we consider analog recurrent neural networks as language recognizers over the Cantor space, and prove that the classes of ωlanguages recognized by deterministic and nondeterministic analog networks correspond precisely to the respective classes of Π 0 2sets and Σ 1 1sets of the Cantor space. Furthermore, we show that the result can be generalized to more expressive analog networks equipped with any kind of Borel accepting condition. Therefore, in the deterministic case, the expressive power of analog neural nets turns out to be comparable to the expressive power of any kind of Büchi abstract machine, whereas in the nondeterministic case, analog recurrent networks turn out to machine, including the main cases of classical automata, 1counter automata, kcounter automata, pushdown automata, and Turing machines.