Meaningful Alignments

We propose a method for detecting geometric structures in an image, without any a priori information. Roughly speaking, we say that an observed geometric event is meaningful if the expectation of its occurences would be very small in a random image. We discuss the apories of this definition, solve several of them by introducing maximal meaningful events and analyzing their structure. This methodology is applied to the detection of alignments in images.     

VIMS: A Video Information Management System

Video data management is fast becoming one of the most importanttopics in multimedia databases. In this paper, we describe thedevelopment of an experimental video information management system,called VIMS, being implemented at the Hong Kong University ofScience & Technology, which employs two fundamental components—i)a Video Classification Component (VCC) for the generation of effectiveindices necessary for structuring the video data, and ii) a ConceptualClustering Mechanism (CCM) having extended object-oriented featuresand techniques. By incorporating CCM concepts and techniques togetherwith the classified features and indices generated from the VCC, theinformation management system enables users to form dynamically, among other things, video programs(or segments) from existing objects based on semantic features/indexterms. A prototype of this system has been constructed, using apersistent object storage manager (viz., EOS), on Sun4 workstations.     

Personalized and Adaptive Services on Board a Car: An Application for Tourist Information

Personalization and adaptation techniques are an interesting opportunity to design new services on-board vehicles. In this context, in fact, the need of an individual user to receive the right service at the right time and in the right way is more critical than in other cases, where personalization and adaptation already showed interesting advantages. At the same time, this context of application can provide new interesting insights for user modeling and adaptation. In the paper we present an architecture for providing personalized services on-board vehicles and we discuss an application to the case of tourist information. We focus on the choices we made to design an on-board system which was as less intrusive and distracting as possible and that could adapt its recommendations, the way it presents them and its own behavior to the user's preferences/interests and to the context of interaction (especially the driving conditions).     

The connection between an event structure semantics and an operational semantics forTCSP

The relation between an operational interleaving semantics forTSCP based on a transition system and a compositional true concurrency semantics based on event structures is studied. In particular we extend the consistency result of Goltz and Loogan [15] forTCSP processes without recursion to the general case. Thus we obtain for everyTCSP processP that its operational meaningO(P) and the interleaving behaviourO( M3P3) which is derived from the event structureM3P3 associated withP are bisimilar.     

Learning to Play Chess Using Temporal Differences

In this paper we present TDLEAF(), a variation on the TD() algorithm that enables it to be used in conjunction with game-tree search. We present some experiments in which our chess program KnightCap used TDLEAF() to learn its evaluation function while playing on Internet chess servers. The main success we report is that KnightCap improved from a 1650 rating to a 2150 rating in just 308 games and 3 days of play. As a reference, a rating of 1650 corresponds to about level B human play (on a scale from E (1000) to A (1800)), while 2150 is human master level. We discuss some of the reasons for this success, principle among them being the use of on-line, rather than self-play. We also investigate whether TDLEAF() can yield better results in the domain of backgammon, where TD() has previously yielded striking success.     

Unitary immersions of nonlinear systems

In this paper, we define what we call a unitary immersion of a nonlinear system. We observe that, for classical Hamiltonian systems, this notion contains, in some sense, the concept of quantization. We restrict our attention to degree-zero unitary immersions, where all observation functions must be represented by operators of the type multiplication by a function. We show that the problem of classifying such degree-zero unitary immersions of a given nonlinear system is not obvious. In some cases, we solve this problem.Chargé de Recherche au CNRS.Maître de Conférences.     

Digital blush: towards shame and embarrassment in multi-agent information trading applications

This paper explores the possibility of, and potential for, using a socio-cognitive theory of shame and embarrassment in agent-agent socio-economic interaction. We use this theory to specify an idea of digital blush, i.e. a representation of the state of embarrassment of an agent according to an evaluation of its behaviour by its peers. Through a detailed worked example, we demonstrate how digital blush offers a higher-level, finer-grained control of/over agent behaviour than typically strict, rule-based security mechanisms. We propose digital blush both as a computational device for self-regulation in certain types of multi-agent information trading applications, and, by representing an agents shame and embarrassment through some form of status visualisation, discuss its potential as a socio-technical device for affecting presence, especially in what we refer to as socio-cognitive grids.     

Sometime = always + recursion ≡ always on the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs

Summary We propose and compare two induction principles called always and sometime for proving inevitability properties of programs. They are respective formalizations and generalizations of Floyd invariant assertions and Burstall intermittent assertions methods for proving total correctness of sequential programs whose methodological advantages or disadvantages have been discussed in a number of previous papers. Both principles are formalized in the abstract setting of arbitrary nondeterministic transition systems and illustrated by appropriate examples. The sometime method is interpreted as a recursive application of the always method. Hence always can be considered as a special case of sometime. These proof methods are strongly equivalent in the sense that a proof by one induction principle can be rewritten into a proof by the other one. The first two theorems of the paper show that an invariant for the always method can be translated into an invariant for the sometime method even if every recursive application of the later is required to be of finite length. The third and main theorem of the paper shows how to translate an invariant for the sometime method into an invariant for the always method. It is emphasized that this translation technique follows the idea of transforming recursive programs into iterative ones. Of course, a general translation technique does not imply that the original sometime invariant and the resulting always invariant are equally understandable. This is illustrated by an example.     

Iterative weighted finite transductions

We investigate 2-tape weighted finite automata called weighted finite transducers (WFT) and their applications to image processing. We show that probabilistic mutually recursive function systems (PMRFS) can be simulated by iterative weighted fimite transductions. We conjecture that iterative WFT are stronger than PMRFS and give examples of WFT that support this conjecture. We also show that the family of images defined by iterative WFT is closed under continuous invertible WFT relations which include invertible affine transformations as a special case. We give examples of iterative WFT which can compute mathematical functions given by a Taylor series with regular coefficients which cannot be computed by WFA. We discuss the implementation of an efficient image manipulation system which includes the implementation of efficient algorithms for the application of a WFT to an image in either pixel or WFA representation and for composition of WFT. The system also includes the Culik-Kari recursive WFA inference algorithm as a conversion from pixel representation to WFA representation.This work was supported by the National Science Foundation under Grant No. CCR-9202396. The work of the second author was partially supported by Grant of Slovak Academy of Sciences No. 88 and by EC Cooperative Action IC 1000 Algorithms for Future Technologies (Project ALTEC)     

“NTT's Joint Utilization Tests of Multimedia Communications”--Utilization Tests for CATV and VOD over FTTH

NTT is carrying out Utilization Tests for CATV Video Transmissions that provide CATV video transmissions, Video-on-demand (VOD) and ISDN services on an integrated basis to participating subscribers. In these tests, optical fibers are installed under the Fiber-to-the-Home (FTTH) concept in three trial areas, each having about 300 subscribers, and two types of transmission systems are used: FDM-PON and ATM-PON. The trial is scheduled to finish at the end of March, 1997.     

The discovery of the artificial. Some protocybernetic developments 1930–1940

In this paper I start from a definition of culture of the artificial which might be stated by referring to the background of philosophical, methodological, pragmatical assumptions which characterizes the development of the information processing analysis of mental processes and of some trends in contemporary cognitive science: in a word, the development of AI as a candidate science of mind. The aim of this paper is to show how (with which plausibility and limitations) the discovery of the mentioned background might be dated back to a period preceding the cybernetic era, the decade 1930–1940 at least. Therefore a somewhat detailed analysis of Hull's robot approach is given, as well as of some of its independent and future developments.     

PDAs and shared public displays: Making personal information public, and public information personal

We are investigating how people move from individual to group work through the use of both personal digital assistants (PDAs) and a shared public display. Our scenario of this work covers the following activities. First, mobile individuals can create personal notes on their PDAs. Second, when individuals meet in real time, they can selectively publicise notes by moving them to a shared public display. Third, the group can manipulate personal and public items in real time through both PDAs and the shared public display, where the notes contained on both PDAs and public display are automatically synchronised. Finally, people leave a meeting with a common record of their activity. We describe our SharedNotes system that illustrates how people move through this scenario. We also highlight a variety of problematic design issues that result from having different devices and from having the system enforce a rigid distinction between personal and public information.     

From “website” to “on-line presence”: From “internet” to “information society”

This paper discusses some of the key drivers that will enable businesses to operate effectively on-line, and looks at how the notion of website will become one of an on-line presence which will support the main activities of an organisation. This is placed in the context of the development of the information society which will allow individuals-as consumers or employees-quick, inexpensive and on-demand access to vast quantities of entertainment, services and information. The paper draws on an example of these developments in Australasia.     

Cockpit cognition: Education,the military and cognitive engineering

The goals of public education, as well as conceptions of human intelligence and learning, are undergoing a transformation through the application of military-sponsored information technologies and information processing models of human thought. Recent emphases in education on thinking skills, learning strategies, and computer-based technologies are the latest episodes in the postwar military agenda to engineer intelligent components, human and artificial, for the optimal performance of complex technological systems. Public education serves increasingly as a human factors laboratory and production site for this military enterprise, whose high performance technologies and command and control paradigms have also played central roles in the emergence of the information economy.Our final hope is to develop the brain as a natural resource ... Human intelligence will be the weapon of the future.Luis Alberto MachadoThis paper will also appear, under the title Mental Material inCyborg Worlds: The Military Information Society, eds. Les Levidow and Kevin Robins, London: Free Association Press, (in press).     

End-to-end communications management using TMN “X” interfaces

The ongoing integration of LANs and WANs to support global communications and businesses and the emergence of integrated broadband communication services has created an increased demand for cooperation between customers, network and service providers to achieve end-to-end service management. Such a cooperation between autonomous authorities, each defining their own administrative management domains, requires the application of an open standardized framework to facilitate and regulate interworking. Such a framework is given by the ITU-T recommendations on TMN, where the so-called X interface is of particular importance for inter-domain management. In this paper, we explain the role of the TMN X interface within an inter-domain TMN architecture supporting end-to-end communications management. We identify the important issues that need to be addressed for the definition and realization of TMN X interfaces and report about our practical experiences with the implementation of TMN X interfaces in the PREPARE project.     

Pseudo-Linear Scale-Space Theory

It has been observed that linear, Gaussian scale-space, and nonlinear, morphological erosion and dilation scale-spaces generated by a quadratic structuring function have a lot in common. Indeed, far-reaching analogies have been reported, which seems to suggest the existence of an underlying isomorphism. However, an actual mapping appears to be missing.In the present work a one-parameter isomorphism is constructed in closed-form, which encompasses linear and both types of morphological scale-spaces as (non-uniform) limiting cases. The unfolding of the one-parameter family provides a means to transfer known results from one domain to the other. Moreover, for any fixed and non-degenerate parameter value one obtains a novel type of pseudo-linear multiscale representation that is, in a precise way, in-between the familiar ones. This is of interest in its own right, as it enables one to balance pros and cons of linear versus morphological scale-space representations in any particular situation.     

A Note on the Rational Closure of Knowledge Bases with Both Positive and Negative Knowledge

The notion of the rational closure of a positive knowledge base K of conditional assertions | (standing for if then normally ) was first introduced by Lehmann (1989) and developed by Lehmann and Magidor (1992). Following those authors we would also argue that the rational closure is, in a strong sense, the minimal information, or simplest, rational consequence relation satisfying K. In practice, however, one might expect a knowledge base to consist not just of positive conditional assertions, | , but also negative conditional assertions, _i (standing for not if then normally . Restricting ourselves to a finite language we show that the rational closure still exists for satisfiable knowledge bases containing both positive and negative conditional assertions and has similar properties to those exhibited in Lehmann and Magidor (1992). In particular an algorithm in Lehmann and Magidor (1992) which constructs the rational closure can be adapted to this case and yields, in turn, completeness theorems for the conditional assertions entailed by such a mixed knowledge base.     

Using computer technology to teach and evaluate prewriting

The purpose of this research was to determine whether computer-aided instruction may be effectively utilized in stimulating prewriting composition when the CAI is based upon (1) conceptual (cognitive) strategies, (2) data-driven guidance (resulting from CAE techniques), and (3) recent findings in tutorial strategies research. If this specifically designed CAI is as good a means of prewriting instruction as personal tutoring and a better means than classroom instruction, then the practical and economical implications may be weighed in a decision to use such techniques. Forty-three college freshmen in three basic writing classes participated in this study. One class was exposed to a CAI medium, the other two either to a human tutor or to classroom instruction. A computer-aided evaluation of previous essays provided focus, and other intellectual processing cues provided information on an expository topic; this database was then used to construct a CAI program to encourage specificity and depth of intellectual processing in students' prewriting composition. The program also possessed and was designed to provide conceptual guidance through the use of five heuristic procedures; thus it contained two key elements that a human tutor would possess in working with a topic—knowledge of the topic, and a means for eliciting that knowledge from the tutee. The second treatment method used consisted of instruction by human tutors, utilizing the same methodology. The control for the study consisted of a classroom instruction group. Results showed the CAI group demonstrating gains in every category of measurement utilized in this study, and its performances was significantly better than both the tutorial group on two of the post-test measures. The CAI group was superior, through not significantly, on post-test performances in every category used in the study except fluency.     

Constructing sets of functions which have a givenF-cardinality

The termF-cardinality of (=F-card()) is introduced whereF: ^{n n} is a partial function and is a set of partial functionsf: ^{n n} . TheF-cardinality yields a lower bound for the worst-case complexity of computingF if only functionsf can be evaluated by the underlying abstract automaton without conditional jumps. This complexity bound isindependent from the oracles available for the abstract machine. Thus it is shown that any automaton which can only apply the four basic arithmetic operations needs (n logn) worst-case time to sortn numbers; this result is even true if conditional jumps witharbitrary conditions are possible. The main result of this paper is the following: Given a total functionF: ^{n n} and a natural numberk, it is almost always possible to construct a set such that itsF-cardinality has the valuek; in addition, can be required to be closed under composition of functionsf,g . Moreover, ifF is continuous, then consists of continuous functions.     

Expert Estimation of Web-Development Projects: Are Software Professionals in Technical Roles More Optimistic Than Those in Non-Technical Roles?

Estimating the effort required to complete web-development projects involves input from people in both technical (e.g., programming), and non-technical (e.g., user interaction design) roles. This paper examines how the employees' role and type of competence may affect their estimation strategy and performance. An analysis of actual web-development project data and results from an experiment suggest that people with technical competence provided less realistic project effort estimates than those with less technical competence. This means that more knowledge about how to implement a requirement specification does not always lead to better estimation performance. We discuss, amongst others, two possible reasons for this observation: (1) Technical competence induces a bottom-up, construction-based estimation strategy, while lack of this competence induces a more outside view of the project, using a top-down estimation strategy. An outside view may encourage greater use of the history of previous projects and reduce the bias towards over-optimism. (2) Software professionals in technical roles perceive that they are evaluated as more skilled when providing low effort estimates. A consequence of our findings is that the choice of estimation strategy, estimation evaluation criteria and feedback are important aspects to consider when seeking to improve estimation accuracy.