ppxscal/embedding_network huggingface dataset:
SPEDE: Simple Programming Environment for Distributed Execution
Authors: James Gochee
Venue:  (1994)

One of the main goals for people who use computer systems, particularly computational scientists, is speed. In the quest for ways to make applications run faster, engineers have developed parallel computers, which use more than one CPU to solve a task. However, many institutions already posses significant computational power in networks of workstations. Through software, it is possible to glue together clusters of machines to simulate a parallel environment. SPEDE is one such system, designed to place the potential of local machines at the fingertips of the programmer. Through a simple interface, users design computational objects that can be linked and run in parallel. The goal of the project is to have a small portable environment that allows various types of computer systems to interact. SPEDE requires no altering of the kernel and does not require system privileges to use. Using SPEDE, programmers can get significant speedup for computationally intensive problems. As an example, a Mandelbrot image generator was implemented, that attained a five-fold speedup with eight processors. 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
Use of Expertise Ontologies in the Knowledge Engineering Process
Authors: C. Reynaud, F. Tort
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

In this article, we describe an approach, supported by a tool called ASTREE, designed to automate the construction of a model of problem-solving behavior in cases where skeletal models cannot be reused. In ASTREE, such a construction is an identification of methods capable of achieving user-specified tasks. The identification process is based on matching elements specified in the task to be achieved and elements in the expertise ontology that expresses conceptualizations of domain knowledge. We argue that a well-defined expertise ontology provides strong constraints for the creation of a model of problem-solving behavior. The article focuses on the main techniques that ASTREE uses in the identification process.
Data Analysis and Visualization of Cluster-Oriented Genetic Algorithm Output
Authors: I. S. J. Packham
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Simple statistical techniques are investigated to support Cluster- Oriented Genetic Algorithm processes. In a real world application, this analysis improves efficiency by reducing effort relating to exploration of multiple visual representations. The preliminary results suggest that the designer can easily be guided towards interesting areas of high performance regions by viewing the most appropriate two- and three-dimensional plots.
Low-Power Dual-Rail Multiple-Valued Current-Mode Logic Circuit Using Multiple Input-Signal Levels
Authors: Takahiro Hanyu, Tsukasa Ike, Michitaka Kameyama
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

A new high-speed and low-power threshold detector is proposed to realize high-performance arithmetic VLSI systems. In a conventional threshold detector with a single supply voltage, the input signal swing of a differential-pair circuit (DPC) is too large, which causes large power dissipation together with a long switching delay. The use of two kinds of supply voltages makes the input signal swing of the DPC small, which results in a lower power dissipation together with a higher switching speed. As a typical example of the proposed multiple-valued current-mode (MVCM) logic circuit, a radix-2 signed-digit full adder is designed by using a 0.35-um CMOS technology. Its performance is superior to that of a corresponding MVCM logic circuit with a single supply voltage under the same transistor counts.
Automatic Design Pattern Detection
Authors: Dirk Heuzeroth, Thomas Holl, Gustav Högström, Welf Löwe
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

We detect design patterns in legacy code combining static and dynamic analyses. The analyses do not depend on coding or naming conventions. We classify potential pattern instances according to the evidence our analyses provide. We discuss our approach for the Observer, Composite, Mediator, Chain of Responsibility and Visitor Patterns. Our Java analysis tool analyzes Java programs. We evaluate our approach by applying the tool on itself and on the Java Swing Set Example using the Swing library.
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Authors: Cliff Stein, David P. Wagner
Venue:  (2000)

The problem of traversing a set of points in the order that minimizes the total distance traveled (traveling salesman problem) is one of the most famous and well-studied problems in combinatorial optimization. It has many applications, and has been a testbed for many of the must useful ideas in algorithm design and analysis. The usual metric, minimizing the total distance traveled, is an important one, but many other metrics are of interest. In this paper, we introduce the metric of minimizing the number of turns in the tour, given that the input points are in the Euclidean plane. To our knowledge this metric has not been studied previously. It is motivated by applications in robotics and in the movement of other heavy machinery: for many such devices turning is an expensive operation. We give approximation algorithms for several variants of the traveling salesman problem for which the metric is to minimize the number of turns. We call this the minimum bends traveling salesman problem. For the case of an arbitrary set of $n$ points in the Euclidean plane, we give an O(lg z)-approximation algorithm, where z is the maximum number of collinear points. In the worst case z can be as big as n, but z will often be much smaller. For the case when the lines are restricted to being either horizontal or vertical, we give a 2-approximation algorithm. If we have the further restriction that no two points are allowed to have the same x- or y-coordinate, we give an algorithm that finds a tour which makes at most two turns more than the optimal tour. Thus we have an approximation algorithm with an additive, rather than a multiplicative error bound. Beyond the additive error bound, our algorithm for this problem introduces several interesting algorithmic techniques for decomposing sets of points in the Euclidean plane that we believe to be of independent interest.
Java Embedded Real-Time Systems: An Overview of Existing Solutions
Authors: M. Teresa Higuera-Toledano, Valerie Issarny
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

Michel Banatre, Gilbert Cabillic, Jean-Philippe Lesot and Frederic ParaiIRISA-INRIAJava is a programming language with features not found in traditional languages such as platform independence and dynamic loading. Because of this, Java is extending and beginning to be used in many new environments. In particular, the advantages that Java provides make it a good candidate for distributed, real-time and embedded systems. However, Java presents some problems regarding its use in embedded and real-time environments.In this paper, we examine the state-of-the-art in the development of embedded real-time systems using Java. We analyze the limits that the Java language and its execution environment present to develop real-time and embedded systems, and we present current research in this area aimed at solving these limits.
Observing and Measuring Cognitive Support: Steps Toward Systematic Tool Evaluation and Engineering
Authors: Andrew Walenstein
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

A key desideratum for many software comprehension tools is to reduce the mental burdens of software engineers. That is, the tools should support cognition. This key benefit is difficult to directly observe and measure, so evaluating such tools has been problematic. This paper describes an investigation into the application of distributed cognition theories to analyzing and observing cognitive support. Theories of cognitive support are used to generate an analysis of potential cognitive benefits provided by the compilation-error tracking facilities of a commercial software development environment. This analysis is used to generate a scheme for coding user observations such that cognitive support related activity can be tracked. Experiences in applying the technique on data from a field study are reported. The study also serves to provide a glimpse into the ways that programmers and tools cooperate. Implications are drawn for future practices of tool evaluation and engineering.
Automatic Code Placement Alternatives for Ad-Hoc And Sensor Networks
Authors: Emin G Sirer, Rimon Barr, T. W. D Kim, Ian Y Fung
Venue:  (2001)

Developing applications for ad-hoc and sensor networks poses significant challenges. Many interesting applications in these domains entail collaboration between components distributed throughout an ad-hoc network. Defining these components, optimally placing them on nodes in the ad-hoc network and relocating them in response to changes is a fundamental problem faced by such applications. Manual approaches to code and data migration are not only platform-dependent and error-prone, but also needlessly complicate application development. Further, locally optimal decisions made by applications that share the same network can lead to globally unstable and energy inefficient behavior. In this paper we describe the design and implementation of a distributed operating system for ad-hoc and sensor networks whose goal is to enable power-aware, adaptive, and easy-to-develop ad-hoc networking applications. Our system achieves this goal by providing a single system image of a unified Java virtual machine to applications over an ad-hoc collection of heterogeneous nodes. It automatically and transparently partitions applications into components and dynamically finds a placement of these components on nodes within the ad-hoc network to reduce energy consumption and increase system longevity. This paper outlines the design of our system and evaluates two practical, power-aware, online algorithms for object placement that form the core of our system. We demonstrate that our algorithms can increase system longevity by a factor of four to five by effectively distributing energy consumption, and are suitable for use in an energy efficient operating system in which applications are distributed automatically and transparently.
Machine Learning for Software Engineering: Case Studies in Software Reuse
Authors: Justin S. Di Stefano, Tim Menzies
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

There are many machine learning algorithms currently available. In the 21st century, the problem no longer lies in writing the learner, but in choosing which learners to run on a given data set. In this paper, we argue that the final choice of learners should not be exclusive; in fact, there are distinct advantages in running data sets through multiple learners.To illustrate our point, we perform a case study on a reuse data set using three different styles of learners: association rule, decision tree induction, and treatment. Software reuse is a topic of avid debate in the professional and academic arena; it has proven that it can be both a blessing and a curse. Although there is much debate over where and when reuse should be instituted into a project, our learners found some procedures which should significantly improve the odds of a reuse program succeeding.
Agent Warehouse: A New Paradigm for Mobile Agent Deployment
Authors: Chi-Hung Chi, John Sim, Kwok-Yan Lam
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

This paper describes a novel concept of agent warehouse. Non-mobile web agents typically operate from their users' computer and make request for data possibly from a very far location. In addition, much of this data will be irrelevant to the user, thus aggravating the bandwidth scarcity problem of the Internet. With current mobile agent paradigm, many of these problems such as bandwidth reduction and off-line autonomous negotiation are solved. However, thisparadigm does have some significant limitations in its common deployment scenarios; system resource consumption, server collaboration, and accumulated agent size along the travelling path, etc. are some typical ones. These limitations are becoming more important when multiple visits to the same server host are required: updating time of host information isnon-deterministic and the decision of negotiation is also not simultaneous. In this paper, the intermediate "proxy-like" agent warehouse is proposed to address these issues. The agent warehouse locates near the data sources and supports agent execution, thus allowing agents to operate much closer to these data sources and minimising the effect of discarded search results. In addition, it is able to provide more resources than a normal web server host does as it is dedicated to cater for agents. More importantly, even if the remote site does not support agent execution, the agent will still be able to complete its task through the warehouse. Thischanges the typical approach of how agents can be deployed by providing a more generic, flexible system environment for agents to execute.
ICT and the teacher of the future
Authors: Mike Kendall
Venue: Proceedings of the 3.1 and 3.3 working groups conference on International federation for information processing: ICT and the teacher of the future - Volume 23 (2003)

The realisation of many different teaching environments that exploit the transformation potential of ICT may start with ICT facilities and resources but they quickly need people, especially effective school leaders if change is to be systemic and long lasting.
SHOrt Voltage Elevation (SHOVE) Testing
Authors: Jonathan T. -Y. Chang, Edward J. McCluskey
Venue: Proceedings of the 1996 IEEE International Workshop on IDDQ Testing (IDDQ '96) (1996)

A stress procedure for reliability screening, SHOrt Voltage Elevation (SHOVE) test, is analyzed here. During SHOVE, test vectors are run at higher-than-normal supply voltage for a short period. The IDDQ values of circuits-under-test are then measured at the normal voltage. This procedure is effective in screening oxide thinning, which occurs when the oxide thickness of a transistor is less than expected. Oxide thinning can cause early-life failures. The stress voltage of SHOVE testing should be set such that the electrical field across an oxide is approximately 6MV/cm. The stress time can be calculated by using "effective oxide thinning" model. We will also discuss the requirement of an input vector for stressing a complementary CMOS logic gate efficiently.
Recursive Data Structures and Parallelism Detection
Authors: Laurie J. Hendren
Venue:  (1988)

Interference estimation is a key aspect of automatic parallelization of programs. In this paper we study the problem of estimating interference in a language with dynamic data-structures. We focus on the case of binary trees to illustrate the approach. We develop a structural flow-analysis technique that allows us to estimate whether two statements influence disjoint sub-trees of a forest of dynamically-allocated binary trees. The method uses a regular-expression-like representation of the relationships between the nodes of the trees and is based on the algebraic properties of such expressions. We have implemented our analysis in Standard ML and have obtained some promising experimental results.
Towards a composition model problem based on IEC61850
Authors: Otto Preiss, Alain Wegmann
Venue: Journal of Systems and Software (2003)

In order to derive real-world model problems for the breath of research challenges in the area of predictable assembly of certifiable software components, this paper introduces the substation automation domain, as a representative for the wide spectrum of data acquisition and process control systems. Special emphasis in the paper is put on those aspects of the application area, which make its employment as a model problem provider attractive. First, the compositions are required to meet several well defined quality requirements besides functionality and must therefore allow for the prediction of these qualities before the final system is assembled and is undergoing a potentially costly factory and/or onsite acceptance test. Second, the upcoming IEC61850 standard defines agreed upon domain models and quality attribute requirements on system operations. In order to make this problem domain attractive to research in the area of compositional reasoning of component assemblies, this paper provides the needed step of relating the domain models and the domain's quality attribute requirements to software components and assembly properties.
Generalizing preference elicitation in combinatorial auctions
Authors: Benoît Hudson, Tuomas Sandholm
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. However, expressing one's preferences can require bidding on all bundles. Selective incremental preference elicitation by the auctioneer was recently proposed to address this problem but the idea was not experimentally validated. This paper evaluates several approaches and finds that in many cases, automated elicitation is in fact beneficial: as the number of items for sale increases, the amount of information elicited is a small and diminishing fraction of the information collected in traditional "direct revelation mechanisms" where bidders reveal all their valuation information. In forward auctions, the benefit is slightly reduced by increasing the number of agents, while in reverse auctions the benefit increases with both agents and items. The exception is with rank-based elicitors, which limit themselves to eliciting the next-best bundle: these do not scale as the number of agents grows.A full-length version of this paper is on-line at: http://www.cs.cmu.edu/~sandholm/generalizing03.pdf
Error analysis of a mixed finite element approximation of a linear Stefan problem
Authors: M. R. Ohm, J. Y. Shin, H. Y. Lee
Venue: Applied Mathematics and Computation (2003)

Based on a Landau-transformation, both semidiscrete and fully discrete in time mixed methods are applied to a single-phase linear Stefan problem in one space dimension. We construct semidiscrete and fully discrete approximations and show the global existence of a semidiscrete solution. Optimal rates of convergence in L2 and H1 norms are derived.
HIGH THROUGHPUT POWER-AWARE FIR FILTER DESIGN BASED ON FINE-GRAIN PIPELINING MULTIPLIERS AND ADDERS
Authors: Jia Di, J. S. Yuan, R. Demara
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

In regular FIR structure, by pipelining the multipliers onecan improve the throughput. But as the growth of operandword length, the delay in addition process becomes anotherimportant constraint. In this paper, a novel fine-grainpipelining scheme for high throughput FIR is proposed. Bypipelining multipliers and adders, very high throughput canbe achieved. 2-Dimensional pipeline gating technique is usedto make the designed FIR power aware to the precision of theoperands. The average power dissipation and latency areboth significantly reduced with changing of input precisions.
Informatics for the Clinical Laboratory
Authors: D. F. Moore, Daniel F. Cowan
Venue:  (2002)

:This book will highlight all aspects of laboratory informatics, with a focus on information management and the corresponding hardware and technical processes involved. In addition to a comprehensive introduction on laboratory informatics, the book emphasizes the importance of information and resource management as opposed to simply covering the role of computers that support the information system. As a Professor of Pathology and the Director of Laboratory Information Services at the University of Texas Medical Branch at Galveston, Dr. Cowan has witnessed the shift in focus in the laboratory from the information generation to information management, and increasing resource limitations demand a higher level of management precision than can be gained from manual methods. The American Board of Pathology now requires an increasing sophistication in information management from candidates for certification. Thus, this book is intended for pathologists and residents in pathology, clinical laboratory scientists, and laboratory and information managers. Following the broad-based introduction on laboratory informatics, the book's topics include: computer basics; development and validation of the laboratory information system; computer networks; security and confidentiality on computer systems and networks; total cost of ownership; essential software; interfaces; process modeling; artificial intelligence and expert systems; bar coding in the laboratory; image analysis and computer-assisted quantitation; and telepathology.
Automatic Architectural Synthesis of VLIW and EPIC Processors
Authors: Shail Aditya, B. Ramakrishna Rau, Vinod Kathail
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

This paper describes a mechanism for automatic design and synthesis of very long instruction word (VLIW), and its generalization, explicitly parallel instruction computing (EPIC) processor architectures starting from an abstract specification of their desired functionality. The process of architecture design makes concrete decisions regarding the number and types of functional units, number of read/write ports on register files, the data-path interconnect, the instruction format, its decoding hardware, and the instruction unit data-path. The processor design is then automatically synthesized into a detailed RTL-level structural model in VHDL along with an estimate of its area. The system also generates the corresponding detailed machine description and instruction format description that can be used to retarget a compiler and an assembler respectively. All this is part of an overall design system, called Program-In-Chip-Out (PICO), which has the ability to perform automatic exploration of the architectural design space while customizing the architecture to a given application and making intelligent, quantitative, cost-performance tradeoffs.
Requirements Elicitation with Indirect Knowledge Elicitation Techniques: Comparison of Three Methods
Authors: Eva Hudlicka
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

In this paper we describe a case study comparing the effectiveness of three indirect knowledge elicitation techniques: repertory grid analysis, multi-dimensional scaling, and hierarchical clustering. These techniques are used in situations where it is difficult for the expert to articulate their knowledge in response to direct questions. The techniques were compared in terms of the number of attributes elicited, the ease with which these data were obtained, and the degree of post-analysis and interpretation required. The study was conducted in the domain of airline safety inspections and the objective was to define inspection indicators. The results of this study indicate that the repertory grid analysis method generates all of the attributes produced by the other two methods, that it is easy to apply in the field, and is useful without complex analysis and re-interpretation of the results.