SRI International

About: SRI International is a nonprofit organization based out in Menlo Park, California, United States. It is known for research contribution in the topics: Ionosphere & Laser. The organization has 7222 authors who have published 13102 publications receiving 660724 citations. The organization is also known as: Stanford Research Institute & SRI.

Keynote paper: Unlocking the learning value of wireless mobile devices

Abstract: Many researchers see the potential of wireless mobile learning devices to achieve large-scale impact on learning because of portability, low cost, and communications features. This enthusiasm is shared but the lessons drawn from three well-documented uses of connected handheld devices in education lead towards challenges ahead. First, 'wireless, mobile learning' is an imprecise description of what it takes to connect learners and their devices together in a productive manner. Research needs to arrive at a more precise understanding of the attributes of wireless networking that meet acclaimed pedagogical requirements and desires. Second, 'pedagogical applications' are often led down the wrong road by complex views of technology and simplistic views of social practices. Further research is needed that tells the story of rich pedagogical practice arising out of simple wireless and mobile technologies. Third, 'large scale' impact depends on the extent to which a common platform, that meets the requirements of pedagogically rich applications, becomes available. At the moment 'wireless mobile technologies for education' are incredibly diverse and incompatible; to achieve scale, a strong vision will be needed to lead to standardisation, overcoming the tendency to marketplace fragmentation.

An efficient easily adaptable system for interpreting natural language queries

Abstract: This paper gives an overall account of a prototype natural language question answering system, called Chat-80. Chat-80 has been designed to be both efficient and easily adaptable to a variety of applications. The system is implemented entirely in Prolog, a programming language based on logic. With the aid of a logic-based grammar formalism called extraposition grammars, Chat-80 translates English questions into the Prolog subset of logic. The resulting logical expression is then transformed by a planning algorithm into efficient Prolog, cf. "query optimisation" in a relational database. Finally, the Prolog form is executed to yield the answer. On a domain of world geography, most questions within the English subset are answered in well under one second, including relatively complex queries.

SR-4233: a new bioreductive agent with high selective toxicity for hypoxic mammalian cells.

Abstract: We have examined the effects of the benzotriazine di-N-oxide SR-4233 (3-amino-1,2,4-benzotriazine-1,4 (dioxide) on a variety of aerobic and hypoxic cells in culture, and on tumors in mice. The cell lines used were Chinese hamster ovary (HA-1), mouse 10T1/2, RIF-1, and SCC VII cells, and the human cell lines HCI'-8, AG1522, and A549. The effect of SR 4233 in combination with irradiation was also examined in the SCC VII tumor growing in the flank of C3H mice using clonogenic assay (tumors excised 24 hr after irradiation). We found SR-4233 to be a potent and selective killer of hypoxic cells. Cell killing as a function of time for the various cell lines was exponential, with no shoulder. Drug concentrations producing equivalent levels of cell killing were 75–200 fold lower in hypoxic than in aerobic cells for the mouse and hamster lines, and 15–50 fold lower for the human cells. In vivo experiments showed that the non-toxic dose of 0.3 mmole/kg of SR-4233 enhanced radiation-induced tumor cell kill when the drug was given between 1 hr before and 2 hr after the radiation dose. We have also shown that the drug metabolizes more rapidly under hypoxic than aerobic conditions, both in vitro and in vivo. The toxic product(s) is unknown, but could be the I -electron reduction product, the radical anion, because the mono N-oxide (the 2-electron reduction product) did not display cytotoxicity or selective killing under hypoxic conditions. This compound could therefore be a useful tool in tumor biology, as well as being a new lead in the development of bioreductive cytotoxic agents for cancer therapy.

"Sometime" is sometimes "not never": on the temporal logic of programs

Abstract: Pnueli [15] has recently introduced the idea of using temporal logic [18] as the logical basis for proving correctness properties of concurrent programs. This has permitted an elegant unifying formulation of previous proof methods. In this paper, we attempt to clarify the logical foundations of the application of temporal logic to concurrent programs. In doing so, we will also clarify the relation between concurrency and nondeterminism, and identify some problems for further research.In this paper, we consider logics containing the temporal operators "henceforth" (or "always") and "eventually" (or "sometime"). We define the semantics of such a temporal logic in terms of an underlying model that abstracts the fundamental concepts common to almost all the models of computation which have been used. We are concerned mainly with the semantics of temporal logic, and will not discuss in any detail the actual rules for deducing theorems.We will describe two different temporal logics for reasoning about a computational model. The same formulas appear in both logics, but they are interpreted differently. The two interpretations correspond to two different ways of viewing time: as a continually branching set of possibilities, or as a single linear sequence of actual events. The temporal concepts of "sometime" and "not never" ("not always not") are equivalent in the theory of linear time, but not in the theory of branching time -- hence, our title. We will argue that the logic of linear time is better for reasoning about concurrent programs, and the logic of branching time is better for reasoning about nondeterministic programs.The logic of linear time was used by Pnueli in [15], while the logic of branching time seems to be the one used by most computer scientists for reasoning about temporal concepts. We have found this to cause some confusion among our colleagues, so one of our goals has been to clarify the formal foundations of Pnueli's work.The following section gives an intuitive discussion of temporal logic, and Section 3 formally defines the semantics of the two temporal logics. In Section 4, we prove that the two temporal logics are not equivalent, and discuss their differences. Section 5 discusses the problems of validity and completeness for the temporal logics. In Section 6, we show that there are some important properties of the computational model that cannot be expressed with the temporal operators "henceforth" and "eventually", and define more general operators.