Search

The Third International Conference on Data Engineering was held in Los Angeles, California on February 2 to 6, 1987. The conference was designed as an international forum for bringing together researchers, developers, managers, strategic planners and other users with an interest in the research, design and development of data engineering methodologies, strategies and systems. Its scope includes computer science, artificial intelligence, electrical engineering, and computer engineering. It featured papers from all major areas of data engineering, including database design and modeling, performance evaluation, algorithms, integrity, security, fault tolerance, query language, artificial intelligence approaches, knowledge bases, database machines, distributed databases and data engineering applications.

The generalization error bounds found by current error models using the number of effective parameters of a classifier and the number of training samples are usually very loose. These bounds are intended for the entire input space. However, support vector machine (SVM), radial basis function neural network (RBFNN), and multilayer perceptron neural network (MLPNN) are local learning machines for solving problems and treat unseen samples near the training samples to be more important. In this paper, we propose a localized generalization error model which bounds from above the generalization error within a neighborhood of the training samples using stochastic sensitivity measure. It is then used to develop an architecture selection technique for a classifier with maximal coverage of unseen samples by specifying a generalization error threshold. Experiments using 17 University of California at Irvine (UCI) data sets show that, in comparison with cross validation (CV), sequential learning, and two other ad hoc methods, our technique consistently yields the best testing classification accuracy with fewer hidden neurons and less training time. [ABSTRACT FROM AUTHOR]

This paper presents the results of an analysis of indicators that can be used to predict whether a student will succeed in a Computer Science Ph.D. program. The analysis was conducted by studying the records of 75 students who have been in the Computer Science Ph.D. program of the University of Alabama in Huntsville. Seventy-seven variables were extracted from each student's record, and the variables were correlated with whether the student did or did not successfully graduate from the program. A multivariate model was developed that predicts success with a high degree of accuracy. Importantly, the model relies on variables that can be determined reasonably early in a student's Ph.D. class work, enabling its use as a selection metric. Hypotheses about the composition of the model are also presented and discussed. [ABSTRACT FROM AUTHOR]

The past several decades have seen enormous growth in the computing sciences, marked by increased educational and professional opportunities. Noting the implications of these opportunities for individual life chances and for social and economic developments, we explore demographic patterns in terms of varying representation in computing in the United States (U.S.). Using currently available data to delineate the demography of U.S. computing, the analysis points to deeply institutionalized and contextually embedded factors and relationships affecting educational and workforce participation and inclusion. Findings confirm that, despite growth in the number of computer science degrees awarded in the United States, the demographic diversity of degree recipients has been slow to change. Moreover, the U.S. advanced-degreed computing workforce is less diverse than workforce segments with lower educational credential requirements. Such findings are presented not merely relative to questions of numerical representations but also in terms of the sociocultural and institutional processes that determine participation and inclusion in computing. [ABSTRACT FROM AUTHOR]

Previous analytical work [16], [17] on the resilience of P2P networks has been restricted to disconnection arising from simultaneous failure of all neighbors in routing tables of participating users. In this paper, we focus on a different technique for maintaining consistent graphs—Chord's successor sets and periodic stabilizations—under both static and dynamic node failure. We derive closed-form models for the probability that Chord remains connected under both types of node failure and show the effect of using different stabilization interval lengths (i.e., exponential, uniform, and constant) on the probability of partitioning in Chord. [ABSTRACT FROM AUTHOR]

The article provides information on the importance of computer architecture in the U.S. It is said that this subject offers a further explanation of the implementation of a simple but computationally intensive algorithm and shows how a series of incremental refinements to the code yields significant performance gains. Moreover, in this paper which is the first of a three-part series concentrates on instruction selection and scheduling.

The article presents a discussion on domain-driven development frameworks in the U.S. It is said that with the help of these frameworks such as Naked Objects for java, changes to an application's core functionality propagate automatically to the user interface and persistence layers. Moreover, the paper also presents a clever yet practical approach that will drive readers to focus on the most essential part of the development efforts which is the domain layer.

The article discusses the survey on provenance management in computational tasks in the U.S. It states that the problem of systematically capturing and managing provenance for computational tasks has received significant attention because of its relevance to a wide range of domains and applications. Moreover, the paper presents an overview of the concepts of provenance management, so that potential users can make informed decisions when selecting or designing a provenance solution.

Much has been made of the dark web's dangers, but democracy has more to fear from Citizens United and the global surveillance industry than Silk Road or Tor. [ABSTRACT FROM AUTHOR]

Details on convention held on June 13-15, 1997 at William and Mary College in Williamsburg, Virginia to survey the different aspects of computers' history. Description about the series of invited papers from historians on computer history; Highlights of the conference.

The article presents an examination into the early history of the computer programing language Algol. Introductory details are given noting the language's original purpose and potential to act as a universal computing language for scientific computations. Discussion is offered outlining how the initial development of the language in the 1950s was shared between European nations and the United States but then declined in the U.S. due to a lack of interest in uniform programming languages on the conceptual level.

The article presents an exploration into the origins and early history of the International Federation for Information Processing (IFIP), focusing on the Cold War political context of its formation and major paradigms in its first years. The primary goals of the IFIP are discussed, particularly its efforts to facilitate cooperation between Eastern and Western nations in computer science research. The challenges which the IFIP faced in reconciling and separating geopolitics from scientific computing are addressed during several episodes of tension and negotiation between the U.S., Europe, and the Soviet Union.

The article discusses the "INSPIRED" program at Lamar University, which seeks to increase encourage women and underrepresented minorities to enter the field of computer science. In the U.S. women typically receive less than 20% of university computing degrees awarded annually, and the situation is worse for African Americans, Native Americans, and Hispanics. INSPIRED seeks to address this state of affairs through a number of initiatives including faculty mentoring, efforts at educating students about opportunities in computer science, and outreach programs targeted at children in kindergarten through grade 12.

The article focuses on the formation of a computer science center (CSC) at the University of Maryland (UMD) in Baltimore, Maryland. The CSC was formed in 1962 and computer use for research and administration at UMD started in the late 1940s. Professor Harry Polachek conducted the first course to acknowledge computers for calculations. The CSC was headed by Werner C. Rheinboldt who made significant progress in its development. Several proposals were written to industry and government agencies by Rheinboldt to purchase computer equipment and research. The center received grants from the National Aeronautics & Space Administration of the U.S. and many other corporations.

The article narrates several prelude stories behind the acclaimed contributions in computer science of Phillip A. Laplante, one of the second generation pioneers of computing in the U.S. According to the author his story exemplifies how the chances for Laplante were bounded by voluntary restraints, such as his inclination to move his families. As a result, he endured depression and extreme poverty but able to subdue all of those and acquired fluency in seven languages that with certainty helped him master computer syntax. Along the way, numerous exceptional opportunities and potential rewards have succeeded by him. But in the end, he opted to put his family before his career .

Discusses degree trends and policy implications among women of color in information technology in the U.S. Definition of terms concerning minorities; Science and engineering bachelor's degrees.

Reports the integration of Accreditation Board for Engineering and Technology and the Computing Sciences Accreditation Board into a single agency in New York. Accreditation responsibility of the single organization on educational programs; Introduction of computer science on programming; Evaluation of baccalaureate degree programs on computer science.

Describes a process of developing an upper-level undergraduate computer science course in robotics in a purely undergraduate computer science department in the U.S. Establishment of a robotics course; Efforts of computer science departments to offer a rigorous curriculum in spite of significant general education course requirements; Design of the robotics course.

Discusses whether the early entry of universities in the United States (U.S.) in computing was a competitive advantage in academic computing. Discussion of the first three decades of computing at Harvard, Massachusetts Institute of Technology, and the Universities of Pennsylvania, Columbia and Princeton; Advantages and disadvantages of being an early entrant; Implications of the emergence of computer science. INSET: Princeton years.

Discusses the role of the United States National Science Foundation in the provision of scientific computing facilities for colleges and universities in the period 1950 to 1973. Establishment of the discipline of computer science; Technical and financial challenges.

For several years now, the Semantic Web's promise has been exciting computer science researchers. With the publication of futuristic scenarios in "Scientific American," we all know what kind of dreams can eventually become true. The Semantic Web Challenge started in the fall of 2003, challenging academic researchers and people from the industry to show what kind of applications can be created with Semantic Web techniques. The challenge's aim is twofold. First it should help researchers show our society what kind of applications the Semantic Web can provide. Second, the competition should be fun for researchers and stimulate their creativity. Each year, the focus will be on a different specific goal reflecting Semantic Web developments at the time.

The author reflects on Greg Wilson's contention regarding the lack of computational practices of science and engineering students in the U.S. He states that Wilson's statement reminds teachers that scientific, engineering, and educational work involves practices, and that these can be as different as the cultures of the practitioners. The author also stresses on his findings that Wilson's argument is making an appeal for the basic of orderly programming practice.

The author reflects on the prospects of computational science in the U.S. The author assesses the opinions of speakers during a workshop on computational science education. In conclusion, he stresses that he strongly believe on the potential of computing to revolutionize science. He points out that if people do not learn from previous efforts to make it part of mainstream scientific education, the computing potential will go unrealized.

The article discusses the possibilities of petascale computer simulations, which would involve petaflops computers performing quadrillions of calculations per second. The United States National Science Foundation is distributing grants to promote research in this area of computer science. Such machines would be useful for drug design, molecular-scale electronics, climate modeling and astrophysics.

Provides information about the IEEE Fellow Nominations in the U.S. Rules in nominating a candidate; Criterias in evaluating nominees; Nomination deadline; Web site. INSET: 2004 Meeting and Election Schedule Now Available..