ppxscal/embedding_network huggingface dataset:
Architecture and experimental framework for supporting QoS in wireless networks using differentiated services
Authors: Indu Mahadevan, Krishna M. Sivalingam
Venue: Mobile Networks and Applications (2001)

This paper describes the design an implementation of an enhanced Differentiated Services (Diffserv) architectural framework for providing Quality of Service (QoS) in wireless networks. The Diffserv architecture has been recently proposed to compliment the Integrated Services (Intserv) model for providing QoS in the wired Internet. The paper studies whether Diffserv framework takes into consideration several factors, including signaling requirements, mobility, losses, lower wireless bandwidth and battery power constraints. It identifies the need for supporting signaling and mobility in wireless networks. The framework and mechanisms have been implemented in the wireless testbed at Washington State University. Experimental results from this testbed show the validity of the proposed Diffserv model and also provide performance analyses. The framework is also designed to be extensible so that other researchers may use our implementation as a foundation for implementing other wireless network algorithms and mechanisms.
Tiling imperfectly-nested loop nests
Authors: Nawaaz Ahmed, Nikolay Mateev, Keshav Pingali
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

Tiling is one of the more important transformations for enhancing loca lity of reference in programs. Intuitively, tiling a set of loops achieves the effect of interleaving iterations of these loops. Tiling of perfectly-nested loop nests (which are loop nests in which all assignment statements are contained in the innermost loop) is well understood. In practice, many loop nests are imperfectly nested, so existing compilers use heuristics to try to find a sequence of transformations that convert such loop nests into perfectly-nested ones, but these heuristics do not always succeed. In this paper, we propose a novel approach to tiling imperfectly-nested loop nests. The key idea is to embed the iteration space of every statement in the imperfectly-nested loop nest into a special space called the product space which is tiled to produce the final code. We evaluate the effectiveness of this approach for dense numrical linear algebra benchmarks, relaxation codes, and the tomcatv code from the SPEC benchmarks. No other single approach in the literature can tile all these codes automatically.
Data Mining with optimized two-dimensional association rules
Authors: Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
Venue: ACM Transactions on Database Systems (TODS) (2001)

We discuss data mining based on association rules for two numeric attributes and one Boolean attribute. For example, in a database of bank customers, Age and Balance are two numeric attributes, and CardLoan is a Boolean attribute. Taking the pair (Age, Balance) as a point in two-dimensional space, we consider an association rule of the form Age,Balance &isin;P&rArr;CardLoan =Yes, which implies that bank customers whose ages and balances fall within a planar region P tend to take out credit card loans with a high probability.We consider two classes of regions, rectangles and admissible (i.e., connected and x-monotone) regions. For each class, we propose efficient algorithms for computing the regions that give optimal association rules for gain, support, and confidence, respectively. We have implemented the algorithms for admissible regions as well as several advanced functions based on them in our data mining system named SONAR (System for Optimized Numeric Association Rules), where the rules are visualized by using a graphic user interface to make it easy for users to gain an intuitive understanding of rules.
Coding isomorphisms
Authors: William C. Lynch
Venue: Communications of the ACM (1960)

The coding of external symbols into symbols internal to a computer can sometimes be carried out in such a way that relevant informational properties are preserved, but in a form much more easily dealt with. A case in point is presented.
Collaboration vs plagiarism in computer science programming courses
Authors: Carolee Stewart-Gardiner, David G. Kay, Joyce Currie Little, Joseph D. Chase, John Fendrich, Laurie A. Williams, Ursula Wolz
Venue: ACM SIGCSE Bulletin (2001)

In some circles, all programming is collaborative, yet in many CS1 and CS2 courses, individual programming assignments are made, collaboration with other students is cheating, and tailoring a program found on the web is plagiarism. Many educators feel that collaboration belongs only in a very few upper division courses. Others have experience to show that early collaboration broadens the learning of students, to become more effective professional individuals. Most conclude that a blend of the two styles is best for students, and can reduce cheating/plagiarism.Does collaboration belong in programming classes? Where does collaboration end and cheating/plagiarism begin? What are the advantages, problems and techniques of allowing collaboration on programming assignments in CS1 and CS2? The moderator created six discussion questions. Each member of the panel has chosen the position they can strongly support from experience. This panel will discuss these questions in detail among the panelists and audience.
What can we do about the unnecessary diversity of notation for syntactic definitions?
Authors: Niklaus Wirth
Venue: Communications of the ACM (1977)

The population of programming languages is steadily growing, and there is no end of this growth in sight. Many language definitions appear in journals, many are found in technical reports, and perhaps an even greater number remains confined to proprietory circles. After frequent exposure to these definitions, one cannot fail to notice the lack of &ldquo;common denominators.&rdquo; The only widely accepted fact is that the language structure is defined by a syntax. But even notation for syntactic description eludes any commonly agreed standard form, although the underlying ancestor is invariably the Backus-Naur Form of the Algol 60 report. As variations are often only slight, they become annoying for their very lack of an apparent motivation.
Push-Based Information Delivery in Two Stage Satellite-Terrestrial Wireless Systems
Authors: Özgür Erçetin, Leandros Tassiulas
Venue: IEEE Transactions on Computers (2001)

One of the prominent objectives of National/Global Information Infrastructure is to provide all types of users global access to information. Satellite broadcast data delivery has inherent advantages, such as scalability and location independent availability, in achieving this objective. However, users need expensive and cumbersome equipment to receive and transmit satellite signals. Furthermore, as the amount of information being broadcast increases, average user latency increases as well. Often, users in a geographical locality have similar interests, which can be better served by employing a local broadcast schedule. In this context, a two stage satellite-terrestrial wireless broadcast system can provide more efficient service in terms of lower average user latency and cheaper and more convenient user equipment. In such a system, the main server broadcasts information via satellite to the geographically distributed local ground stations. Every ground station has limited buffer capacity to store the data broadcast by the satellite. According to their buffer content, and the interests of their users, local stations deliver the information to their users via terrestrial wireless channel. We develop novel methods for the joint cache management and scheduling problem encountered in these systems. Our results demonstrate that such two stage systems are feasible and they can provide more efficient data delivery compared to the single stage systems.
Determining a computing center environment
Authors: Robert F. Rosin
Venue: Communications of the ACM (1965)

An investigation is described in which several generally unavailable parameters descriptive of a computing center environment are obtained. The actual data collection and reduction is described, and the results of one month of this collection are tabulated and summarized.
JavaScript for educators and students
Authors: Barbara Boucher Owens
Venue: Journal of Computing Sciences in Colleges (2001)

Participants will learn HTML/Javascripting components that work well teaching programming to non-computing majors by designing interactive web pages. Topics include: clickable images, forms, and dialogue boxes, a discussion of similarities and differences between Java and Javascript; sample programming exercises utilizing functions, event handling, object creation. Supplied materials will include assignments, programming examples, teaching units and web resources.
Structural pattern recognition of Carotid pulse waves using a general waveform parsing system
Authors: George Stockman, Laveen Kanal, M. C. Kyle
Venue: Communications of the ACM (1976)

A general waveform parsing system with application to structural pattern recognition of carotid pulse waves is described. The carotid arterial pulse wave is of medical importance because of variation in its structure induced by arterial aging and cardiovascular disease. The syntax-driven waveform analysis system has been applied with good results to these pulse waves to detect and measure structural variations. The waveform parsing system is modeled on a compiler-compiler system and allows the user to enter application specific information as data. It is thus general enough to be applicable to other waveforms.
Telemedicine of the future: teleneuropathology
Authors: G. F. Walter, H. K. Matthies, A. Brandis, U. von Jan
Venue: Technology and Health Care (2000)

The chief relevance of telemedicine lies in its capability to link medical practitioners and remote hospitals to larger or specialized facilities in a very fast electronic manner. This may become even more important due to current increase in subspecialization and demand for more precise diagnosis and consultation in difficult cases. A network attaching small clinics or laboratories to larger and more specialized units, and to highly specialized referral centers may improve the professional standard of health care services and education. For a wider use, a technological standardization will be required, since the existence of several types of computer and numerous image manipulation programs, have resulted in a proliferation of file formats. However, every potential user or client of telemedicine should keep in mind, that standardization also includes legal and ethical issues such as patient confidentiality and malpractice avoidance. The adoption of workable guidelines and protocols is required. Telepathology in general and teleneuropathology in particular is the practice of pathology at a distance, viewing digitized images of histological slides on a video monitor rather than directly through a light microscope. For the transmission of the digitized images from a telemicroscope to the remote diagnostic video monitor, different technologies such as ordinary telephone lines, broadband telecommunications channels, and the Internet can be used. The transmitted images may serve for primary neuropathological diagnosis, teleconsultation, quality assurance, proficiency testing, and distance learning. Static-imaging and dynamic-imaging are the two major competing technologies of telemicroscopy. Static-imaging systems appear to have levels of diagnostic accuracy which are not satisfactory for diagnostic neuropathology. On the contrary, high levels of diagnostic accuracy can be achieved using dynamic-imaging systems with the transmission of live video images in real time and by using a robotized telemicroscope with the possibility to examine the entire histological specimen under control of the remote teleneuropathologist.
Can P3P help to protect privacy worldwide?
Authors: Rüdiger Grimm, Alexander Rossnagel
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

Privacy is a basic cultural requirement, often regulated by national law, but not everywhere in the same way. Privacy protection must be effective across national borders. Technical tools and procedures can help to enforce and propagate privacy protection for Internet communication worldwide. The &ldquo;Platform for Privacy Preferences Project (P3P)&rdquo; is a standardization approach of the World Wide Web Consortium for privacy protection of the Web. This article describes the history and current state of P3P and evaluates the effect of P3P against legal requirements, particularly against those strict laws in Germany and Europe. This article is an interdisciplinary cooperation with technical and legal background.
Toward Reference Models for Requirements Traceability
Authors: Balasubramaniam Ramesh, Matthias Jarke
Venue: IEEE Transactions on Software Engineering (2001)

Requirements traceability is intended to ensure continued alignment between stakeholder requirements and various outputs of the system development process. To be useful, traces must be organized according to some modeling framework. Indeed, several such frameworks have been proposed, mostly based on theoretical considerations or analysis of other literature. This paper, in contrast, follows an empirical approach. Focus groups and interviews conducted in 26 major software development organizations demonstrate a wide range of traceability practices with distinct low-end and high-end users of traceability. From these observations, reference models comprising the most important kinds of traceability links for various development tasks have been synthesized. The resulting models have been validated in case studies and are incorporated in a number of traceability tools. A detailed case study on the use of the models is presented. Four kinds of traceability link types are identified and critical issues that must be resolved for implementing each type and potential solutions are discussed. Implications for the design of next-generation traceability methods and tools are discussed and illustrated.
MultiBoosting: A Technique for Combining Boosting and Wagging
Authors: Geoffrey I. Webb
Venue: Machine Learning (2000)

MultiBoosting is an extension to the highly successful AdaBoost technique for forming decision committees. MultiBoosting can be viewed as combining AdaBoost with wagging. It is able to harness both AdaBoost's high bias and variance reduction with wagging's superior variance reduction. Using C4.5 as the base learning algorithm, MultiBoosting is demonstrated to produce decision committees with lower error than either AdaBoost or wagging significantly more often than the reverse over a large representative cross-section of UCI data sets. It offers the further advantage over AdaBoost of suiting parallel execution.
Constraint-type statements in programming languages
Authors: M. V. Wilkes
Venue: Communications of the ACM (1964)

A proposal is made for including in a programming language statements which imply relations between variables but which are not explicit assignment statements. The compiler sets up a Newtonian iteration making use for the purpose of a routine for formal differentiation.
Reuse libraries for real-time multimedia over the network
Authors: Luigi Benedicenti, Giancarlo Succi, Tullio Vernazza, George Kovacs Andrea Valerio
Venue: ACM SIGAPP Applied Computing Review (2000)

Throughout the software industry there is an increasingly critical need to reduce the costs of producing software, while at the same time providing higher quality and coping with an increasing demand for sophisticated, ultra-complex systems. Software development with and for reuse promises to address this situation.This paper considers a case study involving a company in Northeastern Italy which undertook the implementation of a reuse-oriented, multimedia, network-distributed software entities library. It was soon discovered that unfortunately institutionalizing reuse is not a straightforward process. Despite completing the implementation and refinement of the tool, the firm encountered resistance in getting software engineers and managers to use it.The main role in reuse was played by management taking decisions in setting up an appropriate corporate reuse policy that rendered the reuse application tool effective. This paper surveys the associated problems and suggesting potential solutions, making references to the particular case study.
Integrating a realistic information technology project into an introductory computer science course at West Point
Authors: Jerry Schumacher, Margaret Sosinski
Venue: Proceedings of the sixth annual CCSC northeastern conference on The journal of computing in small colleges (2001)

Teaching Information Technology (IT) is an important first and sometimes only opportunity to expose undergraduate students to technology and concepts that will be a part of their daily lives and future careers. This paper describes and compares the integration and use of a real world Information Technology project into an introductory level computer science course at West Point over 3 semesters. The real world problem posed to the students was to set up a deployable network using commercial of the shelf (COTS) equipment and a limited budget. Specific requirements for the system to be developed were given such as the number of users, system functionality and connectivity. The project was to address the following components of an Information System. During the first semester this project was used, it was handed out during lesson 8 of 40 lessons. During the second semester when this project was given to freshmen for the first time, the project was assigned later, during lesson 26. The motivation for assigning the project later was to reinforce material covered in the course. During the third semester, a hands-on introduction of new equipment such as personal digital assistants (PDA's) as well as network components was added before the project was assigned. One of the objectives was to provide a better understanding of the technology used in creating the system for the project as well as a better understanding of the parts of an Information System. The project was successful in all three iterations. The cadets, who were given the project later in the semester, when it was used to reinforce previous classroom lessons, developed the more detailed and potentially successful systems. Overall, the IT project was successful in the goals of introducing and reinforcing basic IT principles and applying this knowledge to a real world problem. This type of IT project can be used in all introductory, undergraduate computer science courses to reinforce the material taught as well as generate excellent discussion and questions on important IT concepts.
Gauss-Markov Measure Field Models for Low-Level Vision
Authors: Jose L. Marroquin, Fernando A. Velasco, Mariano Rivera, Miguel Nakamura
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

We present a class of models, derived from classical discrete Markov random fields, that may be used for the solution of ill-posed problems in image processing and in computational vision. They lead to reconstrucion algorithms that are flexible, computationally efficient, and biologically plausible. To illustrate their use, we present their application to the reconstruction of the dominant orientation and direction fields, to the classification of multiband images, and to image quantization and filtering.
A lecture on Array languages
Authors: Keith Smillie
Venue: ACM SIGAPL APL Quote Quad (2000)

Programming languages are introduced briefly and a distinction is made between conventional and array languages. The language J is given as a modern exemplar of array languages and is illustrated with a few simple examples. Some comments are given on the teaching of languages and on the history of computing.
XML and genomic data
Authors: Judith D. Cohn
Venue: ACM SIGBIO Newsletter (2000)

XML is an extensible, universal format for structured data exchange and documents on the Web. This brief overview highlights examples of current work and future directions for domain-specific XML within the genomic community.
Document ontology based personalized filtering system (poster session)
Authors: Kyung-Sam Choi, Chi-Hoon Lee, Phill-Kyu Rhee
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

We propose the use of the personalized ontology model to improve the effectiveness of web documents filtering process. One important feature of this model is that by constructing the user specific ontology, web documents can be classified by using the user oriented meta data that reflects the user's view about the documents concept. Another is that by applying the user model to searching the classified documents, we achieved the effective document search performance. To find the user's preference, Bayesian Learner accepts user's interests flow as an input and writes output to users profile. Based on those user profiles, user specific ontologies are constructed to provide efficient search environment.
Pruning algorithms for multicast flow control
Authors: Dah Ming Chiu, Miriam Kadansky, Joe Provino, Joseph Wesley, Haifeng Zhu
Venue: Proceedings of NGC 2000 on Networked group communication (2000)

Multicast flow (congestion) control establishes a data rate for a multicast session based on prevailing bandwidth availability given other network traffic. This rate is dictated by the sender's path to the slowest receiver. This level of performance, however, may not be in the best interest for the multicast group as a whole. A pruning algorithm is then used to identify and remove some slow members so that the performance is acceptable for the whole group. This paper discusses the conceptual issues with pruning, and proposes practical algorithms for pruning. The crux of the problem is to achieve a balance between speed and accuracy, because increased accuracy tends to require monitoring for a longer time and using more global information. We evaluate and compare different strategies using both simulation and measurement of real implementations.
SIGGRAPH public policy committee activity detailed
Authors: David Nelson, Bob Ellis, Laurie Reinhart
Venue: ACM SIGGRAPH Computer Graphics (2001)

We start this column with the results of our third on-line opinion survey on public policy issues affecting computer graphics. Next we provide an introduction to and a copy of the definition paper for a prospective study of computer graphics research to be conducted by the National Research Council with partial funding from SIGGRAPH. This is followed by an update on our activities in proposing a course on public policy and a panel on digital rights management of intellectual property for SIGGRAPH 2001. Myles Losch provides an update on the issues related to the slow pace of adoption of Digital TV. Finally, we close with another set of comments from a reader.
Lightweight computational steering of very large scale molecular dynamics simulations
Authors: David M. Beazley, Peter S. Lomdahl
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

We present a computational steering approach for controlling, analyzing, and visualizing very large scale molecular dynamics simulations involving tens to hundreds of millions of atoms. Our approach relies on extensible scripting languages and an easy to use tool for building extensions and modules. The system is extremely easy to modify, works with existing C code, is memory efficient, and can be used from inexpensive workstations and networks. We demonstrate how we have used this system to manipulate data from production MD simulations involving as many as 104 million atoms running on the CM-5 and Cray T3D. We also show how this approach can be used to build systems that integrate common scripting languages (including Tcl/Tk, Perl, and Python), simulation code, user extensions, and commercial data analysis packages.