JOHN GASCHNIC, used to come into my office quite regularly for conversations that helped calibrate my mental compass. John had definite opinions about many subjects-about how N research ought, to be pursued, about high standards of achievement, about the need for first-rate equipment, about important research topics, about personnel mattersin short, about all the sorts of things that concern me...

We propose lazy propagation as a technique for flowand context-sensitive interprocedural analysis of programs with objects and first-class functions where transfer functions may not be distributive. The technique is described formally as a systematic modification of a variant of the monotone framework and its theoretical properties are shown. It is implemented in a type analysis tool for JavaSc...

In this paper, we present a novel discrepancy-based search technique implemented as an instance of the generic search procedures framework introduced in [10]. Our empirical results indicate that the Discrepancy-Bounded Depth First Search (DBDFS) procedure exhibits a number of good properties. As a discrepancy based search technique, it is able to quickly find solution with low deviation from th...

Imagine that the particles in the system are each called either first class or second class. The evolution is the same as before, except that if a second-class particle attempts to go to a site occupied by a first-class particle, it is not allowed to do so, while if a first-class particle attempts to move to a site occupied by a second-class particle, the two particles exchange positions. In ot...

The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set. This means that for almost every real x, either the derivative of f exists at x, or the derivative fails to exist in the worst possible way: the limit superior of the slopes around x equals +∞, and the limit inferior −∞. Algorithmic randomness a...

For reasoning about uncertain situations, we have probability theory, and we have logics of knowledge and belief. How does elementary probability theory relate to epistemic logic and the logic of belief? The paper focuses on the notion of betting belief, and interprets a language for knowledge and belief in two kinds of models: epistemic neighbourhood models and epistemic probability models. It...

BACKGROUND This study aimed to develop guidelines for how a member of the Japanese public should provide mental health first aid to a person who is suicidal. METHODS The guidelines were produced by developing a questionnaire containing possible first aid actions and asking an expert panel of 32 Japanese mental health professionals to rate whether each action should be included in the guidelin...

The focus of the report Revolutionizing Science and Engineering Through Cyberinfrastructure (Atkins et.al., 2003) is the construction of a layer of “enabling hardware, algorithms, software, communications, institutions, and personnel”. This cyberinfrastructure layer would lie above a hardware layer supporting computing, storage, and communications but below a layer of “software programs, servic...

The inherent heterogeneity of the Grid demands the ability to specify choreographies in portable manner. This ensures that a choreography once specified can be deployed and executed in every workflow system within a Grid environment. Likely, BPEL will have the corresponding broad support in the industry. In order to become first class citizens in the Grid choreographies have to comply with the ...

Searching and retrieving the demanded correct information is one important problem in networks; especially, designing an efficient search algorithm is a key challenge in unstructured peer-to-peer P2P networks. Breadth-first search BFS and depth-first search DFS are the current two typical search methods. BFS-based algorithms show the perfect performance in the aspect of search success rate of n...