ppxscal/embedding_network huggingface dataset:
Job Completion Prediction in Grid Using Distributed Case-based Reasoning
Authors: Lilian Noronha Nassif, Jose Marcos Nogueira, Mohamed Ahmed, Ahmed Karmouch, Roger Impey, Flavio Vinicius de Andrade
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

Grid allows several entities to share their computational resources. Selecting the best resource to run a job can become a complex and inadequate task for the user since Grid is a distributed, dynamic, and heterogeneous network. The current frameworks for this problem still face some challenges. Users never know when the job will finish and what the service provider guarantees. Moreover, job scheduling for a future time is unavailable in most existing framework solutions since they lack performance prediction techniques. This paper presents an approach to job execution time prediction in Grid using the case-based reasoning paradigm. The prediction module presented is part of a Multi-Agent System that selects the best resource to run a job in the Grid environment. Case retrieval algorithms involving relevance and geometric matching are presented. We also elaborate adaptation algorithms that use prediction techniques for job workload forecasting
Visual literacy in the digital age: the use of film in computer-based assessment
Authors: Katherine E. Kortes
Venue:  (2005)

In the United States computers and information technologies are changing the nature of literacy. In this digital environment, individuals are expected to make and communicate meaning not only with traditional print but also with various combinations of print, sound, and image. Education has a special responsibility in preparing students to meet this expectation, and hence many teachers have sought to introduce innovative curriculum into their classrooms. Their efforts have, however, often been constrained by the standardized testing that dominates American education. In the Pacesetter Program established by the College Board, a 12th grade English Language Arts course is a prime example of an innovative curriculum that is constrained by the assessment model it uses. A research project was established to address this gap between curriculum and assessment in the Pacesetter English course. A total of ten computer-based assessment activities were developed and administered in a high school in San Jose, California. This dissertation presents the design, implementation, and evaluation of four activities that used film clips. With respect to the design, the film clips were presented as a basic resource and students were asked to respond to three tasks: a Planning Task, an Interpretation Task, and an Application Task. These tasks constitute a model called &ldquo;grounded constructivism,&rdquo; in which the Planning Task is used to gather factual information from the film resource, which is then used to respond to the constructivist tasks. This model reflects an approach in which fact, inference, and experience are viewed as integral dimensions of comprehension. With respect to the evaluation, this study focuses not only on the students' responses to the activities, but also the processes in which they engaged. As for the responses, a rubric based on Content, Clarity, and Critical/Creative Thinking was used in evaluating them. As for the processes, analysis was conducted of students' think-aloud protocols and retrospective interviews as well as process logs that the computer generated. These logs provide useful diagnostic information in that they show the degree to which students engage in planning, drafting, and revising as they write.
Sketching with a low-latency electronic ink drawing tablet
Authors: Alex Henzen, Neculai Ailenei, Fabian Di Fiore, Frank Van Reeth, John Patterson
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Drawing on paper is an experience which is still unmatched by any input device for drawing into a computer in terms of accuracy, dexterity and general pleasantness of use. This paper describes a paper-like drawing tablet which uses electronic ink as its output medium with stylus-based touchpanel input. The device mimics the experience of drawing in a manner which can be adjusted to approach the feel of different kinds of paper. We discuss further some basic issues which need to be addressed in managing interfacing to such a device, specifically the avoidance of the legacy of mouse-oriented point-and-click interfaces which have influenced GUI design for so long. We see a sketch-based model for interaction, based on free-form curve drawing, as being the way forward but new interaction models are required. The tablet is initially intended to serve as an input-device for cartoon drawing and editing, so the product of any sketching process has to be presented to the rest of the animation data-path in terms of a conventional curve model, here B&eacute;zier chains. We discuss models for achieving this without having to resort to legacy curve-editing techniques which have no counterpart in drawing on paper or in the repertoire of the traditional animator. Potential uses of these interaction techniques go well beyond supporting the cartoon drawing application.
A Computational Framework for Taxonomic Research: Diagnosing Body Shape within Fish Species Complexes
Authors: Yixin Chen, Henry L. Bart,  Jr., Shuqing Huang, Huimin Chen
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

It is estimated that ninety percent of the world's species have yet to be discovered and described. The main reason for the slow pace of new species description is that the science of taxonomy, as traditionally practiced, can be very laborious. To formally describe a new species, taxonomists have to manually gather and analyze data from large numbers of specimens, often from broad geographic areas, and identify the smallest subset of external body characters that uniquely diagnoses the new species as distinct from all its known relatives. In this paper, we use an automated feature selection and classification approach to address the taxonomic impediment in new species discovery. The experiments on a taxonomic problem involving species of suckers in the genus Carpiodes demonstrate promising results.
Uniform random number generator by shift register method
Authors: Harold Joseph Highland
Venue: ACM SIGSIM Simulation Digest (1976)

The quixotic quest for the perfect random number generator has been an overriding factor for a group of simulation purists. Although we have developed a series of tests for the evaluation of random number generators, only a few of us engaged in modeling and simulation have actually taken the time to analyze the generators we use; most are willing to accept the random number generators available on the system - just because it is there! The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Multigrid elliptic equation solver with adaptive mesh refinement
Authors: J. David Brown, Lisa L. Lowe
Venue: Journal of Computational Physics (2005)

In this paper, we describe in detail the computational algorithm used by our parallel multigrid elliptic equation solver with adaptive mesh refinement. Our code uses truncation error estimates to adaptively refine the grid as part of the solution process. The presentation includes a discussion of the orders of accuracy that we use for prolongation and restriction operators to ensure second order accurate results and to minimize computational work. Code tests are presented that confirm the overall second order accuracy and demonstrate the savings in computational resources provided by adaptive mesh refinement.
Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation
Authors: Jianliang Xu, Xueyan Tang, Wang-Chien Lee
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

On-demand broadcast is an effective wireless data dissemination technique to enhance system scalability and deal with dynamic user access patterns. With the rapid growth of time-critical information services in emerging applications, there is an increasing need for the system to support timely data dissemination. This paper investigates online scheduling algorithms for time-critical on-demand data broadcast. We propose a novel scheduling algorithm called {\rm{SIN}}{\hbox{-}}\alpha that takes the urgency and number of outstanding requests into consideration. An efficient implementation of {\rm{SIN}}{\hbox{-}}\alpha is presented. We also analyze the theoretical bound of request drop rate when the request arrival rate rises toward infinity. Trace-driven experiments show that {\rm{SIN}}{\hbox{-}}\alpha significantly outperforms existing algorithms over a wide range of workloads and approaches the analytical bound at high request rates.
Lessons Learned: A Security Analysis of the Internet Chess Club
Authors: John Black, Martin Cochran, Martin Ryan Gardner
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

The Internet Chess Club (ICC) is a popular online chess server with more than 30,000 members worldwide including various celebrities and the best chess players in the world. Although the ICC website assures its users that the security protocol used between client and server provides sufficient security for sensitive information to be transmitted (such as credit card numbers), we show this is not true. In particular we show how a passive adversary can easily read all communications with a trivial amount of computation, and how an active adversary can gain virtually unlimited powers over an ICC user. We also show simple methods for defeating the timestamping mechanism used by ICC. For each problem we uncover, we suggest repairs and draw conclusions on how to best avoid repeating these types of problems in the future.
Self-stopping worms
Authors: Justin Ma, Geoffrey M. Voelker, Stefan Savage
Venue: Proceedings of the 2005 ACM workshop on Rapid malcode (2005)

Modern network worms spread with tremendous speed-potentially covering the planet in mere seconds. However, for most worms, this prodigious pace continues unabated long after the outbreak's incidence has peaked. Indeed, it is this ongoing infection activity that is typically used to identify compromised hosts. In principle, a stealthier worm might eliminate this telltale sign by coordinating its members to halt infection activity after the vulnerable population is subverted. Thus, after a short initial spreading period all infected hosts could become quiescent "sleep eragents." In this paper, we show that such "self-stopping" capabilities are trivial to add to existing worms, and can be efficiently implemented without any explicit coordination or additional network traffic.
Transforming Embedded Java Code into Custom Tags
Authors: Shannon Xu, Thomas Dean
Venue: Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (2005)

When a new technology is introduced, the migration of existing applications to the new technology must be carefully considered. Automation can make some migrations feasible that otherwise may be too risky or expensive to be worth the advantages of the new technology. In this paper we describe a technique for migrating web applications using embedded Java code into a custom tag implementation. The technique uses source code transformation techniques to analyze and separate the Java from the web pages. The code is then automatically transformed to custom Java classes which are invoked from the modified web pages containing custom tags. The result is an web application with identical function and appearance, but where the business logic (the Java code) has been separated from the presentation (the web pages).
Implementing clarification dialogues in open domain question answering
Authors: Marco De Boni, Suresh Manandhar
Venue: Natural Language Engineering (2005)

We examine the implementation of clarification dialogues, a mechanism for ensuring that question answering systems take into account user goals by allowing them to ask series of related questions either by refining or expanding on previous questions with follow-up questions, in the context of open domain Question Answering systems. We develop an algorithm for clarification dialogue recognition through the analysis of collected data on clarification dialogues and examine the importance of clarification dialogue recognition for question answering. The algorithm is evaluated and shown to successfully recognize the start and continuation of clarification dialogues in 94% of cases. We then show the usefulness of the algorithm by demonstrating how the recognition of clarification dialogues can simplify the task of answer retrieval.
Action Machines - Towards a Framework for Model Composition, Exploration and Conformance Testing Based on Symbolic Computation
Authors: Wolfgang Grieskamp, Nikolai Tillmann, Colin Campbell, Wolfram Schulte, Margus Veanes
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

We report on a framework for model composition, exploration, and conformance testing based on symbolic execution. The foundations of this framework are given by socalled action machines, a variation of labeled transition systems which communicate over synchronously stepped actions and constraints attached to them. The implementation is based on XRT, an exploration engine for .NET CIL code which supports symbolic computation. The main application is in the area of model-based conformance testing, where our approach addresses practical problems users at Microsoft have in applying model-based testing technology.
A manpower analysis of private practice dentistry thru simulation
Authors: Thomas M. Kisko, Kerry E. Kilpatrick, Richard S. Mackenzie
Venue: ACM SIGSIM Simulation Digest (1978)

A simulation model of solo private practice dentistry has been developed to evaluate the effects of introducing expanded function auxiliary personnel. The model permits the experimental investigation of a variety of staffing patterns and facility configurations. Four task assignment schemes are examined over 208 experiments. Results indicate increases in net revenue of 118% can be realized by the addition of expanded function auxiliary personnel.
A framework for a multi-sensory VR effect system with motional display
Authors: Byounghyun Yoo, Moohyun Cha, Soonhung Han
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

Virtual reality simulators have been developed as tools for the transfer of knowledge and education. Concurrently, the demand for exhibition systems of science education and cultural experiences has also increased. Existing VR (virtual reality) simulators, which are based on the calculation of dynamics equations, cannot easily be adapted to changes in simulation content. In order to transfer knowledge and maintain interest through educational applications, an experiential system that has multi-sensory effects as well as motion effects is needed. The authors proposed a method for motion generation that is tailored to riding systems and multisensory VR effects. In this study, both sense of motion, which is generated from movement of the viewpoint of the visual image, and motion effects, which are prepared in advance, are blended to realize motion simulation by the proposed method. Motion effects can easily be added by interaction between the user and the riding system. Various sensory cues are also implemented to the riding system.
An Integrated Approach for Increasing the Soft-Error Detection Capabilities in SoCs processors
Authors: P. Bernardi, L. Bolzani, M. Rebaudengo, M. Sonza Reorda, M. Violante
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

Software Implemented Hardware Fault Tolerance (SIHFT) techniques are able to detect most of the transient and permanent faults during the usual system operations. However, these techniques are not capable to detect some transient faults affecting processor memory elements such as state registers inside the processor control unit, or temporary registers inside the arithmetic and logic unit. In this paper we propose an integrated (hardware and software) approach to increase the fault detection capabilities of software techniques by introducing a limited hardware redundancy. Experimental results are reported showing the effectiveness of the proposed approach in covering soft-errors affecting the processor memory elements and escaping to purely software approaches.
An Adaptive De-Blocking Algorithm Based on MRF
Authors: Shengli Xie, Zhiliang Xu
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

One of the major drawbacks in block-based discrete cosine transform (BDCT) is the blocking artifacts at low bit rates. In this paper, an adaptive de-blocking algorithm based on Markov Random Field (MRF) is proposed. A visibility function of blocking artifacts is introduced which based on human visual system (HVS), together with edge information to construct a new adaptive potential function of MRF. The experiment results show that the proposed algorithm reduces the blocking artifacts effectively and preserves the original edges faithful.
Accelerating the convergence of the lms adaptive algorithm
Authors: Bernard Widrow
Venue:  (2005)

Adaptive filters have over the years found many applications in the field of digital signal processing. One of the most common adaptive algorithms is the Least Mean Square (LMS) algorithm, an online method that utilizes a noisy estimate of the mean square error (MSE) performance surface gradient for iteratively computing the weight vector which yields the minimum MSE solution. LMS is a simple and robust algorithm, and thus enjoys great popularity. However, its transient performance may suffer when the input autocorrelation matrix has large eigenvalue spread. In this thesis, we first establish the LMS/Newton algorithm as the optimal theoretical benchmark for reducing eigenvalue spread. We then define the excess error energy of an adaptive algorithm as the area between the transient learning curve and its steady-state asymptotic value and demonstrate that the LMS and LMS/Newton algorithms are equivalent in terms of their average excess error energies. This new result further explains the popularity of the LMS algorithm. We then examine utilizing fixed orthogonal transforms for reducing the input eigenvalue spread and explain the appropriate transform choice based on the input power spectral density. We show that both Discrete Hartley Transform LMS (DHT-LMS) and Discrete Fourier Transform LMS (DFT-LMS) attain the same asymptotic eigenvalue spread for first-order Markov inputs. Since the fastest DHT implementations are a factor of two more computationally efficient than corresponding DFT implementations, we thus show that DHT-LMS is preferred over DFT-LMS for first-order Markov inputs. However, orthogonal transform-based algorithms may perform poorly with certain narrowband inputs. We thus introduce the variable leaky LMS (VL-LMS) algorithm that performs well across a broad range of inputs. We show that the VL-LMS algorithm can reduce the eigenvalue spread without a large increase in the steady-state asymptotic MSE that plagues fixed leaky algorithms. We derive bounds on the convergence of VL-LMS and its steady-state asymptotic MSE in a simple nonstationary system identification model. Finally, we introduce the colored variable leaky LMS (CVL-LMS) algorithm that can utilize additional spectral information about the input to intelligently color the leak. Simulation results demonstrate that VL-LMS and CVL-LMS can significantly outperform LMS.
Facilitating information access: interaction between system components (the data library and the traditional library)
Authors: Judith Rowe
Venue: ACM SIGSOC Bulletin (1974)

During the last twenty years, social scientists involved with the establishment and administration of data archives have been making overtures to traditional libraries. But until recently, there has been almost no response. In 1957, York Lucci and Stein Rokkan proposed a "library center of survey research data." [1] In 1965, Ithiel de Sola-Pool argued cogently that "the storing of basic data... [is] a library function." [2] In 1967, Ralph Bisco addressed the question, "Why should university libraries undertake data services...?" [3] That same year, a report prepared for the National Academy of Sciences examined some of the factors which seemed to vitiate against a merger of data archives and traditional libraries. [4] In 1969, at the last conference of the Council of Social Science Data Archives, David Elesh, then director of Wisconsin's Social Science Data and Program Library Service, and Erwin Welsch, Wisconsin's Social Studies Librarian, addressed an audience composed of data archivists and librarians on "The Library of the Future." [5] In 1970, Jack Dennis, present director of the Data and Program Library Service, addressed a conference of librarians where he spoke of the need for "closer integration of the local archive into existing local university information services--particularly those provided by the traditional university library." [6] By 1971, when David Nasitir summarized the history of the data archive movement's attempts to establish a rapprochement with the traditional library [7], there was little positive activity to report. However, in commenting on a paper delivered by Constance Citro in 1968, which was concerned with the desire on the part of the Bureau of the Census to allow libraries to manage the summary tapes of the 1970 census [8], his words proved prophetic. Nasitir said, "This is the one area in which the data archive movement is converging with academic libraries....If the census tapes form the thin end of the wedge, a large number of sample survey data tapes now held in archives may follow." [9] The wedge is now in the door and the remainder of this discussion will look briefly at the evidence of its presence.
ACM SIGACT news distributed computing column 20
Authors: Sergio Rajsbaum
Venue: ACM SIGACT News (2005)

The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification, Internet, and the Web. This issue consists of:&bull; "A review of the DISC 2005 conference," by Dariusz Kowalski.Many thanks to Dariusz for his contribution to this issue.
From the Editor's Desk
Authors: David Alan Grier
Venue: IEEE Annals of the History of Computing (2005)

David Alan Grier pays tribute to the American Computer Museum and previews the five articles featured in this issue of Annals.