Open Access This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the source is credited. DOI 10.3109/17453671003667192 Börje Walldius was born in southern Sweden in 1913, but spent most of his professional life in Stockholm where he died in 1998. He publis...

Social interdependence theory is a classic example of the interaction among theory, research, and practice. The premise of the theory is that the way in which goals are structured determines how individuals interact, which in turn creates outcomes. Over 750 research studies have been conducted in the past 11 decades on the relative merits of cooperative, competitive, and individualistic efforts...

Kalman’s classic formula “minimal ⇔ controllable and observable” fundamentally solves the minimality problem of linear systems theory. However, it took 35 years until Kalman’s formula was found to apply also to convolutional encoders.

The classic Coupon-Collector Problem (CCP) is generalized. Only basic probability theory is used. Centerpiece rather is an algorithm that efficiently counts all k-element transversals of a set system.

Hermite interpolation is shown to be much more stable than Nyström interpolation in the context of solving classic Fredholm second kind integral equations of potential theory in two dimensions using panel-based Nyström discretization. AMS subject classification (2000): 31A10,45B05,65D05,65R20.

A new study reports that high rates of extrinsic mortality can lead to the evolution of a longer life - a pattern opposite to that expected under the classic predictions of the evolutionary theory of aging.

This essay recounts the story of the quest for equational axiomatizations of parallel composition operators in process description languages, and of similar results in the classic field of formal language theory. Some of the outstanding open problems are also mentioned.

This chapter surveys some basic algorithms for analyzing Markov chains (MCs) and Markov decision processes (MDPs), and discusses their computational complexity. We focus on discrete-time processes, and we consider both finite-state models as well as countably infinite-state models that are finitely-presented. The analyses we will primarily focus on are hitting (reachability) probabilities and ω...

C-CLASSIC is a variant of CLASSIC in which concept learning is theoretically tractable (following the PAC-learning settings). C-CLASSIC is an extension of C-CLASSIC with the connec-tives (default) and (exception) allowing to incorpore default knowledge within concept denitions. Previous work was concerned with both deductive aspects (semantics, subsumption) and in-ductive aspects (PAC-learnabil...