In this paper we present preliminary results of a rigorous development of the actor model of computation. We present an actor language which is an extension of a simple functional language, and provide a precise operational semantics for this extension. Our actor systems are open distributed systems, meaning we explicitly take into account the interface with external components in the speciicat...

We describe the vertex collocation profile (VCP) concept. VCPs provide rich information about the surrounding local structure of embedded vertex pairs. VCP analysis offers a new tool for researchers and domain experts to understand the underlying growth mechanisms in their networks and to analyze link formation mechanisms in the appropriate sociological, biological, physical, or other context. ...

We maintain that agent-environment dynamics is cucial even in activities, like algorithm execution, which are ordinarily conceived in terms of exclusively internal resources. In this paper, we in fact outline the principles of a dynamical theory of human computation, intended as any activity of a human being that consists in executing a purely mechanical procedure.

Cognitive appraisal theory has been used extensively as basis for computational models. Evaluating these models in an objective way is a difficult issue. Further, integration and comparison between appraisal theories is needed in order to advance the development of appraisal theory. In this paper we argue that a good solution is to formally specify structural appraisal theories using a common f...

1 Pong P. Chu, Electrical and Computer Engineering Department, Cleveland State University, Cleveland, OH 44115, [email protected] Abstract  Programmable devices and EDA (Electronic Design Automation) software tools are widely used to design today’s digital systems. Many introductory digital systems courses are aware of the trend and integrate the technology, especially HDL (Hardware Descriptio...

Different definitions of spectra have been proposed during the years to characterize the asymptotic behavior of nonautonomous linear systems. Here, we consider the spectrum based on exponential dichotomy of Sacker and Sell and the spectrum defined in terms of upper and lower Lyapunov exponents. A main goal of ours is to understand to what extent these spectra are computable. By using an orthogo...

(a) Prove that L is not regular. (b) Prove that L cannot be recognized in real time by a one-counter machine, i.e., i. M reads its input from left to right with no -transitions. ii. M has a finite set of states Q. At each step it may update its state and may increment or decrement its counter by any integer. iii. M ’s only dependence on the current value of its counter is whether or not it is z...

We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic results (such as the existence of a Nash equilibrium) no longer hold. Nevertheless, we can use the framework to provide psychologically appealing explanations of observed behavior in well-studied games (such as finitely rep...