Synchronous Online Philosophy Courses: An Experiment in Progress

There are two main ways to teach a course online: synchronously or asynchronously. In an asynchronous course, students can log on at their convenience and do the course work. In a synchronous course, there is a requirement that all students be online at specific times, to allow for a shared course environment. In this article, the author discusses the strengths and weaknesses of synchronous online learning for the teaching of undergraduate philosophy courses. The author discusses specific strategies and technologies he uses in the teaching of online philosophy courses. In particular, the author discusses how he uses videoconferencing to create a classroom-like environment in an online class

Development and analysis of the Software Implemented Fault-Tolerance (SIFT) computer

SIFT (Software Implemented Fault Tolerance) is an experimental, fault-tolerant computer system designed to meet the extreme reliability requirements for safety-critical functions in advanced aircraft. Errors are masked by performing a majority voting operation over the results of identical computations, and faulty processors are removed from service by reassigning computations to the nonfaulty processors. This scheme has been implemented in a special architecture using a set of standard Bendix BDX930 processors, augmented by a special asynchronous-broadcast communication interface that provides direct, processor to processor communication among all processors. Fault isolation is accomplished in hardware; all other fault-tolerance functions, together with scheduling and synchronization are implemented exclusively by executive system software. The system reliability is predicted by a Markov model. Mathematical consistency of the system software with respect to the reliability model has been partially verified, using recently developed tools for machine-aided proof of program correctness

Decision-making and problem-solving methods in automation technology

The state of the art in the automation of decision making and problem solving is reviewed. The information upon which the report is based was derived from literature searches, visits to university and government laboratories performing basic research in the area, and a 1980 Langley Research Center sponsored conferences on the subject. It is the contention of the authors that the technology in this area is being generated by research primarily in the three disciplines of Artificial Intelligence, Control Theory, and Operations Research. Under the assumption that the state of the art in decision making and problem solving is reflected in the problems being solved, specific problems and methods of their solution are often discussed to elucidate particular aspects of the subject. Synopses of the following major topic areas comprise most of the report: (1) detection and recognition; (2) planning; and scheduling; (3) learning; (4) theorem proving; (5) distributed systems; (6) knowledge bases; (7) search; (8) heuristics; and (9) evolutionary programming

Applying Formal Methods to Networking: Theory, Techniques and Applications

Despite its great importance, modern network infrastructure is remarkable for the lack of rigor in its engineering. The Internet which began as a research experiment was never designed to handle the users and applications it hosts today. The lack of formalization of the Internet architecture meant limited abstractions and modularity, especially for the control and management planes, thus requiring for every new need a new protocol built from scratch. This led to an unwieldy ossified Internet architecture resistant to any attempts at formal verification, and an Internet culture where expediency and pragmatism are favored over formal correctness. Fortunately, recent work in the space of clean slate Internet design---especially, the software defined networking (SDN) paradigm---offers the Internet community another chance to develop the right kind of architecture and abstractions. This has also led to a great resurgence in interest of applying formal methods to specification, verification, and synthesis of networking protocols and applications. In this paper, we present a self-contained tutorial of the formidable amount of work that has been done in formal methods, and present a survey of its applications to networking.Comment: 30 pages, submitted to IEEE Communications Surveys and Tutorial

Rail transit fare collection: Policy and technology assessment

The impact of fare policies and fare structure on the selection of equipment was investigated, fare collection systems are described, hardware and technology related problems are documented, and the requirements of a fare collection simulation model are outlined. Major findings include: (1) a wide variation in the fare collection systems and equipment, caused primarily by historical precedence; (2) the reliability of AFC equipment used at BART and WMATA discouraged other properties from considering use of similar equipment; (3) existing equipment may not meet the fare collection needs of properties in the near future; (4) the cost of fare collection operation and maintenance is high; and (5) the relatively small market in fare collection equipment discourages new product development by suppliers. Recommendations for fare collection R&D programs include development of new hardware to meet rail transit needs, study of impacts of alternate fare policies increased communication among policymakers, and consensus on fare policy issues

Philosophical foundations of the Death and Anti-Death discussion

Perhaps there has been no greater opportunity than in this “VOLUME FIFTEEN of our Death And Anti-Death set of anthologies” to write about how might think about life and how to avoid death. There are two reasons to discuss “life”, the first being enhancing our understanding of who we are and why we may be here in the Universe. The second is more practical: how humans meet the physical challenges brought about by the way they have interacted with their environment. Many persons discussing “life” beg the question about what “life” is. Surely, when one discusses how to overcome its opposite, death, they are not referring to another “living” thing such as a plant. There seems to be a commonality, though, and it is this commonality is one needing elaboration. It ostensibly seems to be the boundary condition separating what is completely passive (inert) from what attempts to maintain its integrity, as well as fulfilling other conditions we think “life” has. In our present discussion, there will be a reminder that it by no means has been unequivocally established what life really is by placing quotes around the word, namely, “life”. Consider it a tag representing a bundle of philosophical ideas that will be unpacked in this paper

Coherent Integration of Databases by Abductive Logic Programming

We introduce an abductive method for a coherent integration of independent data-sources. The idea is to compute a list of data-facts that should be inserted to the amalgamated database or retracted from it in order to restore its consistency. This method is implemented by an abductive solver, called Asystem, that applies SLDNFA-resolution on a meta-theory that relates different, possibly contradicting, input databases. We also give a pure model-theoretic analysis of the possible ways to `recover' consistent data from an inconsistent database in terms of those models of the database that exhibit as minimal inconsistent information as reasonably possible. This allows us to characterize the `recovered databases' in terms of the `preferred' (i.e., most consistent) models of the theory. The outcome is an abductive-based application that is sound and complete with respect to a corresponding model-based, preferential semantics, and -- to the best of our knowledge -- is more expressive (thus more general) than any other implementation of coherent integration of databases