Article Free Access Share on Representation of scientific hypotheses for use by the expert system, research assistant: the setup Authors: David J. Weiner Computer and Information Sciences, Temple University, Philadelphia, Pennsylvania Computer and Information Sciences, Temple University, Philadelphia, PennsylvaniaView Profile , E. Judith Weiner View Profile Authors Info & Claims CSC '96: Proceedings of the 1996 ACM 24th annual conference on Computer scienceFebruary 1996 Pages 43–52https://doi.org/10.1145/228329.228333Online:20 February 1996Publication History 0citation224DownloadsMetricsTotal Citations0Total Downloads224Last 12 Months3Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
By 1967, when I delivered my Turing lecture 'Computers Then and Now' [1], the computer field was well on its way to assuming its modem form. Progress had been made with high level languages (including the scientific study of their syntax), operating systems (including time-sharing systems), and CRT displays (including their application to Computer Aided Design). I referred to all these topics in my lecture. One feature was missing. There was as yet no computer networking, although it was in the air. Three years were to elapse before the ARPANET came into operation.
Article Free Access Share on Improving opening book performance through modeling of chess opponents Author: Steven Walczak University of South Florida, 4202 E. Fowler Ave., CIS 1040, Tampa, FL University of South Florida, 4202 E. Fowler Ave., CIS 1040, Tampa, FLView Profile Authors Info & Claims CSC '96: Proceedings of the 1996 ACM 24th annual conference on Computer scienceFebruary 1996 Pages 53–57https://doi.org/10.1145/228329.228334Online:20 February 1996Publication History 4citation570DownloadsMetricsTotal Citations4Total Downloads570Last 12 Months11Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Given T, a minimum spanning tree of the graph G = (V, E), e' E E Tis a replacement fore E TiffT e + e' is a minimum spanning tree ofG' = (V, Ee). In this paper, we propose a solution that computes a replacement for every edge of the minimum spanning tree in O(max{ Cmst. V log V} ), where Cmst is the cost of computing a minimum spanning tree ofG' = (~r, ET). The problem of computing the minimum spanning tree of a graph has been studied extensively by researchers [4, 5, 8, 9]. The problem of finding a replacement for every edge of a minimum spanning tree was first considered by Chin and Houck [2] who give an O(V ) algorithm. Tarjan [10] presented an O(Eo:(E, V)) algorithm, where o:(E, V) is the functional inverse of Ackermann's function. Also, Hsu et. al., [7] presented an algorithm for the replacement problem that requires O(E log E) time. Ballet. al., [II] and Corley et. al., [3] studied a similar problem in networks. They are concerned with the failure of a link in a network and its impact on the links that carry the maximum flow or form the shortest path between two extreme nodes. To the best of our knowledge, when V log V E O(E), our solution is the best so far and comparatively it is quite easy to implement. The running time of any algorithm that attempts to compute the replacement problem is a function of the size of the edge set, S, from which the replacement edges are selected. However, we will show that there is a subset of the remaining edges (the set of graph edges minus the edges of the minimum spanning tree) that can be computed efficiently and that it contains a set of replacement edges as a subset. In § 1, we present an algorithm that computes the set of the replacement edges in terms of an unspecified edge set, S. The largest choice for S is the set of graph edges minus the edges of the minimum spanning tree. In §2. we show how to prune the set of the remaining edges, to form a smaller set S for the algorithm that we present in § 1. This results in an algorithm that runs in O(max(Cmst• V log V)), where Cmin = O(E + V log V) is the cost of computing a second minimum spanning tree of the input
This paper describes an experiment to measure the playing of strength of Shogi players, man or machine, using a test set with 48 next-move problems. Each problem in the test set has been selected from games played by grandmasters, using some specific criteria. In Shogi there is no such rating system as the ELO system in chess to measure the playing strength of players and there was hitherto no test set for Shogi computers like the Bratko-Kopec test set for chess computers. In this paper, we first give a short sketch of test sets in use for chess computers, focusing on our interest in obtaining a similar test set for Shogi computers. Then our recent work on measuring the playing strength of Shogi computers using a newly devised test set is described, including some experiments performed with computer and human subjects.
Article Free Access Share on New advances in Alpha-Beta searching Authors: Jonathan Schaeffer Dept. of Computing Science, University of Alberta, 615 General Services Building, Edmonton, Alberta, Canada T6G 2H1 Dept. of Computing Science, University of Alberta, 615 General Services Building, Edmonton, Alberta, Canada T6G 2H1View Profile , Aske Plaat Dept. of Computer Science, Erasmus University, Room H4-31, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands Dept. of Computer Science, Erasmus University, Room H4-31, P.O. Box 1738, 3000 DR Rotterdam, The NetherlandsView Profile Authors Info & Claims CSC '96: Proceedings of the 1996 ACM 24th annual conference on Computer scienceFebruary 1996Pages 124–130https://doi.org/10.1145/228329.228344Published:20 February 1996Publication History 24citation1,427DownloadsMetricsTotal Citations24Total Downloads1,427Last 12 Months166Last 6 weeks24 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Article Free Access Share on Merging task-centered UI design with complex system development: a risky business Authors: Yolanda J. Reimer Department of Computer Science, University of Montana, Missoula, MT Department of Computer Science, University of Montana, Missoula, MTView Profile , Ray Ford Department of Computer Science, University of Montana, Missoula, MT Department of Computer Science, University of Montana, Missoula, MTView Profile , Nicholas P. Wilde Department of Computer Science, University of Montana, Missoula, MT Department of Computer Science, University of Montana, Missoula, MTView Profile Authors Info & Claims CSC '96: Proceedings of the 1996 ACM 24th annual conference on Computer scienceFebruary 1996 Pages 34–42https://doi.org/10.1145/228329.228332Online:20 February 1996Publication History 0citation474DownloadsMetricsTotal Citations0Total Downloads474Last 12 Months2Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Article Free Access Share on An evaluation of a client-server real-time database system Author: Özgür Ulusoy Department of Computer Engineering and Information Science, Bilkent University, Bilkent, Ankara 06533, Turkey Department of Computer Engineering and Information Science, Bilkent University, Bilkent, Ankara 06533, TurkeyView Profile Authors Info & Claims CSC '96: Proceedings of the 1996 ACM 24th annual conference on Computer scienceFebruary 1996Pages 89–95https://doi.org/10.1145/228329.228339Published:20 February 1996Publication History 0citation600DownloadsMetricsTotal Citations0Total Downloads600Last 12 Months5Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Article Free Access Share on Ternary relationship decomposition and higher normal form structures derived from entity relationship conceptual modeling Authors: Trevor H. Jones School of Business Administration, Duquesne University, Pittsburgh, PA School of Business Administration, Duquesne University, Pittsburgh, PAView Profile , Il-Yeol Song College of Information Studies, Drexel University, Philadelphia, PA College of Information Studies, Drexel University, Philadelphia, PAView Profile , E. K. Park Dept. of Computer Science, U.S. Naval Academy, Annapolis, MD Dept. of Computer Science, U.S. Naval Academy, Annapolis, MDView Profile Authors Info & Claims CSC '96: Proceedings of the 1996 ACM 24th annual conference on Computer scienceFebruary 1996 Pages 96–104https://doi.org/10.1145/228329.228340Online:20 February 1996Publication History 1citation956DownloadsMetricsTotal Citations1Total Downloads956Last 12 Months15Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Article Free Access Share on An architecture for planning with external information points in a real-time system Authors: Rhonda Eller-Meshreki Randolph-Macon College Randolph-Macon CollegeView Profile , Todd Saundurs Randolph-Macon College Randolph-Macon CollegeView Profile , Samer Meshreki University of Delaware University of DelawareView Profile Authors Info & Claims CSC '96: Proceedings of the 1996 ACM 24th annual conference on Computer scienceFebruary 1996 Pages 58–66https://doi.org/10.1145/228329.228335Online:20 February 1996Publication History 1citation289DownloadsMetricsTotal Citations1Total Downloads289Last 12 Months4Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Conceptual clustering is used to organize observations into an abstract hierarchy which can be used to predict classes and/or attribute values. Typically this clustering has been done using either incremental or nonincrementallearning. Incremental learning suffers from the ordering problem, while nonincremental learning cannot handle a dynamic environment efficiently. This paper proposes a hybrid conceptual clustering system which uses two learning algorithms. The first stage is based on Genetic Algorithms and is used as a preprocessor for the second stage. The second stage is an incremental learning system. This hybrid conceptual clustering system overcomes the difficulties encountered by using either a nonincremental or an incremental learning system alone.
This paper presents a new method to parallelize the minimax tree search algorithm. This method is then compared to the "Young Brother Wait Concept" algorithm in an Othello program implementation and in a Chess program. Results of tests done on a 32-node CMS and a 128-node CRAY T3D computers are given.
Reengineering, the redesign of work processes using information technology as an enabler, promises great gains in efficiency, organizational flexibility and responsiveness to customers. Rcengineering aims to eliminate excess work caused when processes involve multiple handoffs between functional departments and authorizations from multiple layers of management. Reengineering is being widely practiced, but with many reports of failures or undesired side effects. Reengineered processes typically require a much greater degree of information technology to support them. As computer based systems grow in size and cross organizational boundaries, they will became increasingly vulnerable to problems such as programming bugs, unauthorized users and inappropriate transactions. The increased complexity of these systems is likely to make these problems more difficult to detect. The realtime interaction of these processes across organizational units and with customers and suppliers increases the likelihood that a single problem will propagate into a large scale disaster that can threaten the organization's long term viability. A systematic examination of new risk vulnerabilities brought about by a proposed reengineered work process is required. -·18Reengineering and Information Technology In their 1993 bestseller, Reengineering the Corporation (Hammer and Champy, 1993, p. 32) Michael Hammer and James Champy defined reengineering as "the fundamental re-thinking and radical re-design of business processes." Instead of applying information technology to existing processes and "paving the cow paths," (Hammer, 1990, p.l 04) reengineering designs new work processes using information technology as an enabler. Most current work processes pre-date the computer and are, therefore, paper based. The result of adhering to these outmoded processes, reengineering advocates claim, is that "about 80% of the administrative processes add no value to the business" (DeBoever, 1994, p. 3). The goal ofreengineering is to create streamlined, integrated work processes that eliminate the inefficiencies caused by handoffs between functional departments, multiple organizational layers to authorize each transaction, and excessive paperwork. Reengineered processes typically place a greater reliance on information technology. Hammer and Champy describe information technology as the essential enabler of reengineered processes (Hammer and Champy, 1993). One recent survey indicated that the information technology portion of a reengineering investment can reach about 80% (ScottMorgan, 1995). Hammer and Stanton state that, "Systems to support reengineered processes are typically five times the size and complexity of traditional information systems" (Hammer and Stanton, 1995, p. 248). Th ese systems can span organizational borders and can interact in real-time with suppliers and customers. The result of many reengineering efforts, therefore, are organizations that have moved toward "mission critical" -the failure of the system can impact the organization's survival -dependence on large complex information systems. A careful examination of the sources of risk exposure brought about by reliance on these systems is necessary to avoid creating new work processes based upon expensive, inappropriate and possibly dangerous systems. Challenges in Developing Complex Code. Statistics from Software Productivity Research indicate that as the size and complexity of a computing project grows, the likelihood of scheduling overruns and project cancellations increase significantly (Gibbs, 1994, p. 88). More seriously, the potential for software bugs also increases. "When a systems becomes so complex that no one manager can understand the entirety, traditional development processes break down" (Gibbs, 1994, p. 89). Development and testing techniques have been developed to help ensure that software is reliable in mission critical, and safety critical (failure would endanger human life) systems (Wiener, 1993, p. 113). These techniques, however, add significantly to the cost of software development and have not yet evolved to the point where they can be used with consistent success (see (Collins, Miller, Spielman, Wherry, 1994), (Norman, 1990), (Pamas, van Schouwen, Kwan, 1990)). For example, the new air-traffic control system commissioned by the FAA, and costing $700 to $900 per line of code due to extensive testing, is currently five years late, $1 billion over budget, and still "bug-infested" (Gibbs, p. 89). In most business applications, program reliability is considered ofless importance than in safety-critical applications like the air traffic control system. Software development is more likely to be subject to cost and deadline considerations (Costello, 1984). "The vast majority of computer code is still handcrafted from raw programming languages by artisans using techniques they neither measure nor are able to repeat consistently" (Gibbs, 1994, p. 87). Business software purchased in packages typically comes with disclaimers, "most producers of software explicitly deny accountability for harmful impacts -19of their products, even when they malfunction" (Nissenbaum, 1994, p. 79). As information technology is used to support more critical business functions, this approach becomes more and more inadequate, "Developing complex systems that must satisfy stringent requirements for reliability, security, human safety or other forms of application correctness, such as the ability to manage money, requires an extremely principled development well beyond what is traditionally experienced in general programming practice" (Neumann, 1995, p. 232). Critics call for making software developers strictly liable for defective software (as manufacturers of consumer goods are liable for their product) and for instituting licensing and performance testing for professional programmers (Neumann, 1991), (Nissenbaum, 1995). Modules of code in a computer program are tightly coupled to one another. They interact without human intervention. In tum, programs running in real-time are tightly coupled to the real world processes they are supporting. Incidents created by software bugs, unauthorized users and inappropriate transactions will propagate more quickly in processes performed by software than in a manual process and will propagate in ways that are more difficult to trace. Problems caused by software bugs in larger, real-time systems are more likely to propagate into disasters. Challenges in Building a Complex Infrastructure. Hardware needed to run the software and to provide the platform and infrastructure of the system is also likely to become more complex and expensive and may rely upon newly developed technologies with less of a proven track record. Reengineered processes crossing departmental lines and organizational boundaries are more likely to require extensive and complex telecommunication networks to support them. Telecommunication networks are by nature tightly coupled -incidents such as operator errors and hacker break-ins can have far reaching impacts before they are discovered. When telecommunication systems cross organizational boundaries, use common carriers, or access the Internet, they become open systems rather than closed ones. Opening a system to the outside environment gives rise to new sources of system vulnerabilities (Perrow, 1984), (Sagan, 1993). In the case of communications technology, hackers or competing firms may intiltrate an organization's information systems to steal or destroy information (Schwartau, 1994 ), (Lewis, 1995). Reenginccring favors distributed rather than centralized decision making to flatten organizational structures, to develop managerial talent and to take advantage of on-site expertise (Champy, 1995) (Longo, 1995). The information architecture to support this distributed decision making is likely to be distributed as well, involving client-server architecture rather than centralized mainframe processing. Although generally more economical than centralized systems, distributed computing systems tend to involve a greater range of hardware, software, and telecommunication devices and a greater range of configurations that these devices can take. "A distributed system is one in which the failure of a computer you didn't even know existed can render your own computer unusable" (Neumann, 1992b, p. 162). Management and control of these decentralized systems becomes a greater challenge, as does the problem of system security (Neumann, 1990, p. 154). "Distributed systems arc particularly vulnerable to users erroneously presumed to be trustworthy or infallible" (Neumann, 1995, p. 211 ). Challenges from Computer-Supported Work Employees performing reenginccrcd processes are often faced with more complex tasks and shorter cycle times to complete them. A common recommendation of reengineering advocates is to practice the "combination, not division, of labor" (Davenport and Nohria, 1994, p. II), by the creation of case manager positions. In these positions, "Individuals or small teams perform a series of tasks, such as the fulfillment of an order, from beginning to end, often with the help of information systems that reach through the organization" (Davenport and Nohria, 1994, p. II). Employees controlling these complex tasks must also assume greater accountability for their work (Caron, 1 arvenpaa, and Stoddard, 1994) (Longo, 1995) and often attain greater degrees of computer literacy in order to perform their new jobs. Organizations contemplating reengineering must be conce~ed whether, "current staff possess ' the expertise and credenti~ls to perform in an increasing technical environment" (Sears and Trotter, 1995, p. 16). Reengineering advocates admit that case manager jobs are far more stressful and demanding than their predecessors. The high degree of computer mediation involved in these tasks may diminish the quality of the work for employees, making the
Article Free Access Share on Mapping a functional specification to an object-oriented specification in software re-engineering Authors: K. Periyasamy Department of Computer Science, University of Manitoba, Winnipeg, MB, R3T 2N2, Canada Department of Computer Science, University of Manitoba, Winnipeg, MB, R3T 2N2, CanadaView Profile , C. Mathew Department of Computer Science, University of Manitoba, Winnipeg, MB, R3T 2N2, Canada Department of Computer Science, University of Manitoba, Winnipeg, MB, R3T 2N2, CanadaView Profile Authors Info & Claims CSC '96: Proceedings of the 1996 ACM 24th annual conference on Computer scienceFebruary 1996Pages 24–33https://doi.org/10.1145/228329.228331Published:20 February 1996Publication History 3citation561DownloadsMetricsTotal Citations3Total Downloads561Last 12 Months16Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Article Free Access Share on Matrix inversion in O(log n) on a scan-enhanced reconfigurable mesh computer Authors: Alberto Moreira College of Computer Science, Northeastern University, Boston, Massachusetts College of Computer Science, Northeastern University, Boston, MassachusettsView Profile , Bryant W. York College of Computer Science, Northeastern University, Boston, Massachusetts College of Computer Science, Northeastern University, Boston, MassachusettsView Profile Authors Info & Claims CSC '96: Proceedings of the 1996 ACM 24th annual conference on Computer scienceFebruary 1996 Pages 67–75https://doi.org/10.1145/228329.228336Online:20 February 1996Publication History 1citation665DownloadsMetricsTotal Citations1Total Downloads665Last 12 Months1Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
The Electronic Delay Storage Automatic Calculator (EDSAC) was a serial binary computer with an ultrasonic delay memory. It was designed and built at the University of Cambridge in England. Work on the project started at the end of 1946, and the machine began to work in May 1949. The paper describes how the programmer handled fixed point arithmetic and emphasizes the merits of having a double length accumulator.
Article Free Access Share on The PML-tree: an efficient parallel spatial index structure for spatial databases Authors: Kap S. Bang Dept. of Computer Science, Oklahoma State University, Stillwater, OK Dept. of Computer Science, Oklahoma State University, Stillwater, OKView Profile , Huizhu Lu Dept. of Computer Science, Oklahoma State University, Stillwater, OK Dept. of Computer Science, Oklahoma State University, Stillwater, OKView Profile Authors Info & Claims CSC '96: Proceedings of the 1996 ACM 24th annual conference on Computer scienceFebruary 1996 Pages 79–88https://doi.org/10.1145/228329.228338Online:20 February 1996Publication History 3citation476DownloadsMetricsTotal Citations3Total Downloads476Last 12 Months5Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
From the beginning the gask force recognized the problems involved with implementing such a course in the high schools. Education is organized in this country by state, and then by local jurisdiction. There is great variance among states, districts and schools with respect to curriculum goals and criteria, teacher preparation and certification, resources, and understanding and appreciation for computer science.
