Before we address the topic of “Information in Computer Science,” it is obvious that we will have to say something about what is meant by “information.” I expect this to be a common preoccupation of the many authors contributing to this volume. Though perhaps not as obvious, it turns out equally important that we should be clear what is meant by “Computer Science.” Incidentally, we will take fo...

ly, taking a step amounts to applying a function, and going step by step corresponds to applying functions one after the other. This is captured by the operation of composing functions. Composing the functions f and g means that first f is applied to some argument, x, to produce f .x/, and then g is applied to that result to produce g.f .x//. Definition 4.3.1. For functions f W A ! B and g W B ...

Nowadays many ontological editors are available. However, several specific requirements forced us to search for new principles and to develop a new ontology edition platform called DL-workbench. The platform combines research experience of model-based software architectures and knowledge based engineering. We applied the metainformatics principles in order to satisfy growing requirements of our...

The World Wide Web has proven to be very effective for teachers to provide information in a host of innovative ways. A number of different pedagogical objectives can also be met by having students design and implement Web sites or applications. This paper presents the results of several experiments in using Web authoring/programming as a teaching tool in a

• Design and formal verification of component-based complex systems (distributed, mobile, real-time and hybrid systems) and application to mechatronics, automobile, aeronautics and telecommunications industrial problems. • Semantic-based systems architectures and applications: Ontology-based systems architectures and application to e-learning systems, semantic integration of data and services, ...

Example 1. Show that every amount of change n ≥ 8 can be paid with only 3c and 5c coins. Proof: Suppose, for the sake of contradiction, that there are some values of n ≥ 8 such that it is not possible to pay n with 3c and 5c coins. Take the set of all such values. Since all of them are natural numbers, there is, by well-ordering principle, a minimal element in this set; let’s call it k. Now, co...

This talk describes how techniques developed by Computer Scientists have helped our understanding of certain problems in statistical physics which involve randomness and \frustration". Examples will be given from two problems that have been widely studied: the \spin glass" and the \random eld model".

In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N − 1} → {0, 1, . . . , N − 1}. The model contains all the known tradeoff techniques as special cases. It is based on a new notion of stateful random graphs. The evolution of a path in the stateful random graph depends on a hidden state such as the color in...

THE CSNET PHOJECT, sponsored by t,he National Science Foundaton, has as its goal the design and implementation of a computer communications network to provide services to computer science research groups in the United States Experience with Arpanet has shown that access to a computer network can lead to a significantly higher level of interactlion between geographically dispersed researchers. T...