The TSIMMIS Approach to Mediation: Data Models and Languages

TSIMMIS—The Stanford-IBM Manager of Multiple InformationSources—is a system for integrating information. It offers a datamodel and a common query language that are designed to support thecombining of information from many different sources. It also offerstools for generating automatically the components that are needed tobuild systems for integrating information. In this paper we shalldiscuss the principal architectural features and their rationale.     

Heat transfer efficiency in a fliuidized bed

The equilibrium stage concept used in staged contacting operations was adopted as a measure of heat transfer efficiency for a fluidized bed. A simple model was developed which postulates that solids flow through the bed can be by perfect mixing, plug flow and short-circuiting. Efficiencies were determined experimentally in a 150 mm diameter fluidized bed with air as the fluidizing medium and sand as the solid. Heat transfer efficiencies greater than 100% were obtained indicating that small diameter, low aspect ratio fluidized beds do not behave as perfect mixers. The results indicate that heat transfer measurements can be used to develop information on solids flow behavior.     

The OODB path-method generator (PMG) using access weights and precomputed access relevance

A path-method is used as a mechanism in object-oriented databases (OODBs) to retrieve or to update information relevant to one class that is not stored with that class but with some other class. A path-method is a method which traverses from one class through a chain of connections between classes and accesses information at another class. However, it is a difficult task for a casual user or even an application programmer to write path-methods to facilitate queries. This is because it might require comprehensive knowledge of many classes of the conceptual schema that are not directly involved in the query, and therefore may not even be included in a user's (incomplete) view about the contents of the database. We have developed a system, called path-method generator (PMG), which generates path-methods automatically according to a user's database-manipulating requests. The PMG offers the user one of the possible path-methods and the user verifies from his knowledge of the intended purpose of the request whether that path-method is the desired one. If the path method is rejected, then the user can utilize his now increased knowledge about the database to request (with additional parameters given) another offer from the PMG. The PMG is based on access weights attached to the connections between classes and precomputed access relevance between every pair of classes of the OODB. Specific rules for access weight assignment and algorithms for computing access relevance appeared in our previous papers [MGPF92, MGPF93, MGPF96]. In this paper, we present a variety of traversal algorithms based on access weights and precomputed access relevance. Experiments identify some of these algorithms as very successful in generating most desired path-methods. The PMG system utilizes these successful algorithms and is thus an efficient tool for aiding the user with the difficult task of querying and updating a large OODB. Received July 19, 1993 / Accepted May 16, 1997     

The attentional white bear phenomenon: The mandatory allocation of attention to expected distractor locations.

The authors devised a prestimulus-probe method to assess the allocation of attention as a function of participants' top-down expectancies concerning distractor and target locations. Participants performed the flanker task, and distractor locations remained fixed. On some trials, instead of the flanker display, either 2 simultaneous dots or a horizontal line appeared. The dot in the expected distractor location was perceived to occur before the dot in the expected empty location, and the line appeared to extend from the expected distractor location to the expected empty location, suggesting that attention is allocated to expected distractor locations prior to stimulus onset. The authors propose that a process-all mechanism guides attention to expected locations of all stimuli regardless of task demands and that this constitutes a major cause for failures of selective attention. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Inference of monotonicity constraints in Datalog programs

Datalog (i.e., function-free logic) programs with monotonicity constraints on extensional predicates are considered. A monotonicity constraint states that one argument of a predicate or a constant is always less than another argument or a constant, according to some strict partial order. Relations of an extensional database are required to satisfy the monotonicity constraints imposed on their predicates. More specifically, a strict partial order is defined on the domain (i.e., set of constants) of the database, and every tuple of each relation satisfies the monotonicity constraints imposed on its predicate. This paper focuses on the problem of entailment of monotonicity constraints in the intensional database from monotonicity constraints in the extensional database. The entailment problem is proven to be decidable, based on a suggested algorithm for computing sound and complete disjunctions of monotonicity and equality constraints that hold in the intentional database. It is also shown that the entailment of monotonicity constraints in programs is a complete problem for exponential time. For linear programs, this problem is complete for polynomial space. This revised version was published online in June 2006 with corrections to the Cover Date.     

Object features, object locations, and object files: Which does selective attention activate and when?

The representation within which attention operates was investigated in 3 experiments. The task was similar to that of R. Egly, J. Driver, and R. D. Rafal (1994). Participants had to detect the presence of a target at 1 of 4 ends of 2 shapes, differing in color and form. A precue appeared at 1 of the 4 possible corners. The 2 shapes occupied either the same or different locations in the cuing and target displays. The results showed that the cued object location was attended whether or not space was task relevant, whereas the cued object features (color and form) were attended only when these were task relevant. Moreover, when object file continuity was maintained through continuous movement, attention was found to follow the cued object file as it moved while also accruing to the cued location. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Computing access relevance for path-method generation in OODB and IM-OODB

A path-method (PM) is a mechanism to retrieve or to update information relevant to one class, in an object-oriented database (OODB), that is not stored with that class but with some other class. The PM traverses a chain of classes and connections that ends at the class where the required information is stored. However, it is a difficult task for a user to write PMs. This is because it might require comprehensive knowledge of many classes of the conceptual schema. But a typical user has often incomplete or even inconsistent knowledge of the schema. Currently we are developing a system, called Path-Method Generator (PMG), which generates PMs automatically according to a naive user's requests. One algorithm of PMG uses numerical access relevance between pairs of classes as a guide for the traversal of an OODB schema. In this paper we define the notion of access relevance to measure the significance of the (indirect) connection between any two classes in an OODB and present efficient algorithms to compute access relevance. The manual PM generation in an interoperable multi object-oriented database (IM-OODB) is even more difficult than for one OODB since a user has to be familiar with several OODBs. We use a hierarchical approach for developing efficient online algorithms for the computation of access relevances in an IM-OODB, based on precomputed access relevances for each autonomous OODB. In an IM-OODB the access relevances are used as a guide in generating PMs between the classes of different OODBs.     

The effect of gender on left ventricular function immediately after the wingate test

The effect of gender on left ventricular systolic function and exercise haemodynamics in healthy young subjects was studied during 30-s all-out sudden strenuous dynamic exercise. A group of 22 men [19.3 (SD 1) years] 20 women [19.1 (SD 1) years] volunteered to participate in this study. Two-dimensional direct M-mode and Doppler echocardiograph studies were performed with the subject in the sitting position. The Doppler examination of flow was located with continuous-wave, interrogating ascending aorta measurements. The subjects completed the study without showing any electrocardiograph abnormalities. An interaction effect with stroke volume (P < 0.05) was characterized by a decrease in the men and an increase of stroke volume in the women. Cardiac output rose significantly (P < 0.05) up to 14.5 (SD 6) 1.min-1) for the men and 12.1 (SD 4) 1.min-1 for the women compared to the rest values [5.8 (SD 0.4) and 4.7 (SD 0.5) 1.min-1, respectively]. Flow velocity integral and acceleration time differed significantly between the two groups at rest (P < 0.05). During exercise these differences showed an interaction effect (P < 0.05). These results would indicate that normal men and women respond to sudden strenuous exercise by reducing their left ventricular systolic function, with a significantly greater decrease in women (P < 0.05). The gender differences in the haemodynamic responses during the present study, may, as suggested by others, be attributable to differences in energy metabolism. In addition, changes in Doppler parameters of aortic flow, haemodynamics and blood pressure responses during sudden strenuous exercise differed markedly from those seen before with endurance exercise.     

Location dominance in attending to color and shape.

Investigated in 4 experiments whether Ss direct attention to stimulus location when attempting to attend to its color or shape. In the 1st 2 experiments, a given property (location, color, or shape) of a letter cue instructed Ss whether to report any letters from a subsequent display. Regardless of which property was relevant, Ss reported letters adjacent to the cue and not those similar to its color or shape. In the last 2 experiments, the varied location of a cue was irrelevant to the task, whereas its varied color instructed Ss to report a letter in a given location or of a given shape. Targets adjacent to the cue were reported faster than those remote from the cue. The results suggest that attempting to attend to any aspect of a stimulus entails directing attention to location. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Capturing an area-covering robot

Area coverage is a fundamental task in robotics, where one or more robots are required to visit all points in a target area at least once. In many real-world scenarios, the need arises for protecting one’s territory from being covered by a robot, e.g., when we need to defend a building from being surveyed by an adversarial force. Therefore, this paper discusses the problem of defending a given area from being covered by a robot. In this problem, the defender needs to choose the locations of k stationary guards in the target area, each one having some probability of capturing the robot, in a way that maximizes the probability of stopping the covering robot. We consider two types of covering robots: one that has an a-priori map of the environment, including the locations of the guards; and the other has no prior knowledge of the environment, and thus has to use real-time sensor measurements in order to detect the guards and plan its path according to their discovered locations. We show that in both cases the defender can exploit the target area’s topology, and specifically the vulnerability points in the area (i.e., places that must be visited by the robot more than once), in order to increase its chances of capturing the covering robot. We also show that although in general finding an optimal strategy for a defender with zero-knowledge on the robot’s coverage strategy is \({\mathcal {NP}}\)-Hard, for certain values of k an optimal strategy can be found in polynomial time. For other cases we suggest heuristics that can significantly outperform the random baseline strategy. We provide both theoretical and empirical evaluation of our suggested algorithms.