ppxscal/embedding_network huggingface dataset:
A faster optimal register allocator
Authors: Changqing Fu, Kent Wilken
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

Recently researchers have proposed modeling register allocation as an integer linear programming (IP) problem and solving it optimally for general purpose processors [17, 20] and for dedicated embedded systems [23]. Compared with traditional graph-coloring approaches, the IP-based allocators can improve a program's performance. However, the solution times are much slower.This paper presents an lP-based optimal register allocator which is much faster than previous work. We present several local and global reduction techniques to identify locations in a program's control-flow graph where spill decisions and register deallocation decisions are unnecessary for optimal register allocation. We propose a hierarchical reduction approach to efficiently remove the corresponding redundant decisions and constraints from the IP model. This allocator is built into the Gnu C Compiler and is evaluated experimentally using the SPEC921NT benchmarks. The results show that the improved IP model is much simpler. The number of constraints produced is almost linear with the function size. The optimal allocation time is much faster, with a speedup factor of about 150 for hard allocation problems.
Using peer evaluation of programs to develop analytical and communication skills
Authors: Mark Michael
Venue: Journal of Computing Sciences in Colleges (2002)

Peer evaluation of programs can be incorporated in programming courses at any level, can be administered in many different ways, and can enhance several dimensions of students' education.
Mobile objects "must" move safely
Authors: Sébastien Briais, Uwe Nestmann
Venue: Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V (2002)

Øjeblik is a lexically-scoped, object-based calculus that represents a distribution-free subset of the LAN-based programming language Obliq. The surrogate operation on Øjeblik-objects, which is the abstraction of migration on Obliq-objects, is a combined operation derived from the more primitive operations cloning and aliasing. In short, surrogation on an object turns the object into an alias for a clone of itself; it amounts to migration when the original and the clone reside on different distribution sites.In previous work, we studied the conditions under which surrogation is safe, i.e., transparent to object clients. To this aim, we developed two complementary formal descriptions of Øjeblik's semantics, one as an operational semantics on Øjeblik-configurations, and another one by translation into a process calculus. We used the former to explain typical (mis-)behaviors of Øjeblik programs, but only the latter to perform rigorous correctness proofs w.r.t. may-equivalence.In this paper, we offer new formal proofs, now based on the operational semantics of Øjeblik, making the results as well as the proofs accessible also to readers not familiar with process calculi. Furthermore, we strengthen our former results by using, in addition to may-equivalence, the much more distinguishing notion of must-equivalence.
An Object-Oriented Environment for Sparse Parallel Computation on Adaptive Grids
Authors: Salvatore Filippone, Michele Colajanni, Dario Pascucci
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Many numerical solutions of large scale simulation models require finer discretizations in some regions of the computational grid. When this region is not known in advance, adaptive meshing is the most convenient approach because it focuses the computational efforts on the most significant subdomain(s). However, leaving the tasks of implementing adaptive meshing capabilities to the programmer would make the parallelization too much complex. We propose an approach based on an object-oriented library that brings the adaptive meshing capabilities to a wide user community without deteriorating much performance. The software framework includes a runtime support that detects the region requiring a dynamic grid refinement, manages reconfigurable data structures and masks any dynamic reconfiguration to the high-level code. 1
Motivation, Knowledge Transfer, and Organizational Forms
Authors: Margit Osterloh, Bruno S. Frey
Venue: Organization Science (2000)

Employees are motivated intrinsically as well as extrinsically. Intrinsic motivation is crucial when tacit knowledge in and between teams must be transferred. Organizational forms enable different kinds of motivation and have different capacities to generate and transfer tacit knowledge. Since knowledge generation and transfer are essential for a firm's sustainable competitive advantage, we ask specifically what kinds of motivation are needed to generate and transfer tacit knowledge, as opposed to explicit knowledge.
Tracking of fluid-advected odor plumes: strategies inspired by insect orientation to pheromone
Authors: Wei Li, Jay A. Farrell, Ring T. Cardé
Venue: Adaptive Behavior (2001)

Autonomous vehicles with plume-tracing capabilities would be valuable for finding chemical sources in fluid flows. This article considers strategies allowing autonomous vehicles to find and trace an odor plume to its source. These strategies are inspired by the maneuvers of moths flying upwind along a pheromone plume. Although moth maneuvers are well documented, the mechanisms underlying sensory perception and navigation are not fully understood; therefore, a key objective was to define sensor, signal-processing, and actuation algorithms for autonomous vehicles. The strategies presented do not precisely mimic insect orientation to odors. Optimizing performance, however, suggests orientation strategies that may have biological counterparts. The results demonstrate the importance of cross-plume counterturning strategies for maintaining intermittent contact with the chemical plume, given noisy sensory information. It is important for the searcher to maintain intermittent contact with the plume because flow direction while detecting odor is the main indicator of the instantaneous desired direction of motion.
Robert Aiken on the future of learning
Authors: Ubiquity staff
Venue: Ubiquity (2002)

In the hands of skilled teachers, technology will provide students with the best possible education -- both face-to-face and distant, collaborative and individualized, and entertaining and instructional.
Sensitivity Analysis for System Design Improvement
Authors: Sergio Contini, Stefan Scheer, Marc Wilikens
Venue: Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8) (2000)

In order to help identifying suitable design modifications for complex systems, there is a need to 1) determine the weakest elements of the system, 2) identify a better design alternative, and 3) evaluate the effect of the adopted solution on system safety/availability. This is a well-known procedure applied to a single system failure mode. In reality, several undesired system states have to be checked for. On the other side, systems grow in complexity, and components are often multifunctional so that they could affect several system states concurrently and even in conflicting terms. This paper presents the sensitivity analysis module of the ASTRA package, based on component importance analysis techniques to be applied to all system failure states concurrently. The technique employs fault-tree analysis and Markovian processes as basic probabilistic models.
Evaluation of the DRM and the Time for Preventive Maintenance for Aging Software
Authors: Salma A. Ghoneim, Hossam M. A. Fahmy
Venue: Software Quality Control (2003)

An attempt to capture software aging and specify when to do preventive maintenance (PM) is presented in this paper. A composite measure termed the DRM, Deteriorating Response Measure, is defined. It is based on the analysis of the deteriorating speed of the software against time and load. This speed is characterized as follows: (1) It decays with increased load. (2) It does not increase again when the load decreases, this indicates &ldquo;loss of elasticity.&rdquo; The DRM is mathematically formulated based on a queueing system model.Specifying when to do preventive maintenance depends on the decision maker's perspective of the manifestation of aging. It is tried here to formalize this dependence. Three degrading performance metrics are defined for a DRM: (1) Decaying restored speed value. (2) Increasing speed offset ratio (recoverability index). (3) Increasing operation interval offset. These metrics can be used singly or aggregately in a DRM to specify when to do preventive maintenance. Results of model testing are also shown.This work can be part of an on-line procedure that calculates performance indexes for a server type software system like a web browser, an operating system, a database, and helps in the decision to do preventive maintenance for aging software.
Use of Metadata Registries for Searching for Statistical Data
Authors: Chris Nelson
Venue: Proceedings of the 14th International Conference on Scientific and Statistical Database Management (2002)

The Internet has spawned an insatiable appetite for information. This appetite cannot be satisfied without useful search tools. These tools rely on metadata in order to give targeted and meaningful results to searches, and the Internet world is realising that metadata, itsmanagement, and the means to search these metadata, are an integral part of the Internet world.The EC 5th Framework project COSMOS [1] aims to demonstrate the use of metadata in this way by building a common model for describing a statistical data set in terms of metadata, populating a metadata registry with descriptions consistent with the model, and searching theregistry to find the data sets, and finally to access the data sets in the relevant repository.
On using genetic algorithms for multimodal relevance optimization in information retrieval
Authors: M. Boughanem, C. Chrisment, L. Tamine
Venue: Journal of the American Society for Information Science and Technology (2002)

This article presents a genetic relevance optimization process performed in an information retrieval system. The process uses genetic techniques for solving multimodal problems (niching) and query reformulation techniques commonly used in information retrieval. The niching technique allows the process to reach different relevance regions of the document space. Query reformulation techniques represent domain knowledge integrated in the genetic operators structure to improve the convergence conditions of the algorithm. Experimental analysis performed using a TREC subcollection validates our approach.
The effects of look-ahead algorithms in content functional robotic intelligence
Authors: Jeff Magnusson
Venue: Journal of Computing Sciences in Colleges (2002)

The last three years have shown a tremendous surge in interest in intelligent robotic systems. Real-time intelligence is of critical importance in areas such as space exploration and military operations. The content functional method (CFM) has proven to be one of the major breakthroughs in the development of real-time intelligence in critical robotic domains. [1]This paper explores the results obtained by using look-ahead algorithms, utilizing the decision matrix, to predict the long-term outcomes of various actions. The CFM with look-ahead enhancements must maintain its real-time performance levels in order to remain effective. In order to achieve real-time performance, look-ahead must be performed during idle processing. This means that look-ahead must be balanced with processing of data in the learning engine (another task performed during idle time). This paper discusses methods for obtaining correct balance between look-ahead and processing learning data in different domains and scenarios within those domains. A software-based simulator was developed to test the look-ahead algorithm's performance. The results of various modifications to the algorithm are explored and compared to results from the original CFM in this paper. Several new complex critical scenarios have been simulated, producing new results and fascinating evidence of a "smarter" intelligence.
WTA: waveform-based timing analysis for deep submicron circuits
Authors: Larry McMurchie, Carl Sechen
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Existing static timing analyzers make several assumptions about circuits, implicitly trading off accuracy for speed. In this paper we examine the validity of these assumptions, notably the slope approximation to waveforms, single-input transitions, and the choice of a propagating signal based on a single voltage-time point. We provide data on static CMOS gates that show delays obtained in this way can be optimistic by more than 30%. We propose a new approach, Waveform-based Timing Analysis that employs a state-of-the-art circuit simulator as the underlying delay modeler. We show that such an approach can achieve more accurate delays than slope-based timing analyzers at a computation cost that still allows iterations between design modification and delay analysis.
On the Method of Multivalent Guiding Functions for Periodic Solutions of Differential Inclusions
Authors: S. V. Kornev
Venue: Automation and Remote Control (2003)

The paper developed the method of multivalent vector guiding functions (MVGF). The notions of full collection of the strict MVGF's, full and sharp collection of the generalized MVGF's, and the regular MVGF were introduced and considered. These methods were extended to the problem of periodic trajectories of the controlled system obeying a differential inclusion.
View from Bangladesh: the new literacy
Authors: Mir Lutful Kabir Saadi
Venue: Ubiquity (2002)

How communications technology will bridge the Divide
New security services based on PKI
Authors: Antonio F. Gómez, Gregorio Martínez, Óscar Cánovas
Venue: Future Generation Computer Systems (2003)

The basic job of a public key infrastructure (PKI) is to define the mechanisms used both to allow a recipient of a signed message to trust a digital signature and to allow a sender to find the encryption key for a recipient. It is comprised of those elements needed to manage and enable the effective use of public key cryptography technology, particularly in medium and large-scale. Nowadays, PKIs are considered to be a key element for providing security to new distributed application environments. However, the sole use of a PKI as a mechanism to create a link between an identifier and a public key is not enough to offer effective mechanisms to those environments. New security services based on PKI try to address some existing drawbacks of current distributed systems. On the one hand, they can provide mechanisms to alleviate the lack of support for decentralized and automated management of access control and authorization policies, which are usually configured using inefficient and error-prone methods. On the other hand, new security services can also be used to link authorization information to the public keys being certified by the PKI, therefore enabling new opportunities for distributed access control procedures. In this paper, we describe two of these innovative security services built over our own designed and implemented Java IPv6 PKI: a distributed security policy management architecture and a distributed credential management system.
Unsung Heroes: An Interview with Steve Havlovic
Authors: Madhavan Parthasarathy, Anol Bhattacherjee, Peter J. Frost
Venue: Organization Science (1998)

Behind every successful performance, such as was the jazz symposium at the 1995 Academy of Management Conference, are people who have worked long and hard to try to ensure that the event will come to fruition; who have solved tricky problems and improvised in a number of ways, so that the pe rformers can do their craft with a maximum of opportunity to excel. In the case of this symposium, organizing involved having very specialized microphones in place and in working order. It required getting all the right permits (some unanticipated) approved and it meant having an effective grasp of and control over the logistics of a complex process well beyond the prior experience base of most of the organizers involved. It meant doing these things at a ridiculously low price and yet operating at a cost that was higher than anticipated. New money had to be found, rules and laws had to be bent or reframed or reinterpreted. When the magic of the session unfolded, when people were learning, having fun and being moved by what they experienced on stage, it wa s due, in no small part, to the individuals behind the scenes who themselves had performed, learned and improvised and who thus had helped created conditions that enabled the event to take place. Such individuals often are unsung heroes. They have stories to tell that are interesting and instructive. What follows are the recollections of one such hero, Steve Havlovic, Chair of the Local Arrangements Committee for the 1995 Academy of Management Conference in Vancouver, British Columbia, Canada. In conversa tion with Peter Frost, he talks about the roles that he and others who worked with him played in preparing the ground for the jazz symposium and he describes some of what happened along the way. The story provides a perspective on the way improvisation and organizing may be intertwined in both the figure and the ground of a novel event. (Improvisation; Organizing; Leadership; Crisis Management; Champions)d
Dynamic Pricing in Airline Seat Management for Flights with Multiple Flight Legs
Authors: Yasushi Masuda, Seungjin Whang, Peng-Sheng You
Venue: Transportation Science (1999)

Consider a multiple bo oking class airline-seat inventory control problem that relates to either a single flight leg or to multiple flight legs. During the time before the flight, the airline may face the problems of (1) what are the suitable prices for the opened booking classes, and (2) when to close those opened booking classes. This work deals with these two problems by only using the pricing policy. In this paper, a dynamic pricing model is developed in which the demand for tickets is modeled as a discrete time stochastic process. An important result of this work is that the strategy for the ticket booking policy can be reduced to sets of critical decision periods, which eliminates the need for large amounts of data storage.
Improving information requirements determination: a cognitive perspective
Authors: Glenn J. Browne, V. Ramesh
Venue: Information and Management (2002)

Requirements determination is a critical phase of information systems development, but much evidence suggests that the process can and should be improved. Because the bulk of requirements determination occurs early in the development of a system, improvements can yield significant benefits for the entire systems development process. This paper first discusses a three-stage descriptive model of the requirements determination process. Four classes of difficulties in determining systems requirements are then used to organize and describe particular problems that occur within each stage of the process, together with the cognitive and behavioral theories that underlie them. The paper then describes techniques that can address the problems and presents theoretical considerations that analysts can use in applying the techniques to improve requirements determination.
Evidence Propagation and Value of Evidence on Influence Diagrams
Authors: Gonzalo Cortazar, Eduardo S. Schwartz, Marcelo Salinas, James E. Smith, Sven Axsater, Kazuo J. Ezawa
Venue: Operations Research (1998)

In this paper, we introduce evidence propagation operations on influence diagrams, a concept of the value of evidence to measure the impact/value of new observations/experimentation, and a concept of the value of revelation. Evidence propagation operations are critical for the computation of the value of evidence, general update and inference operations in normative expert systems that are based on the influence diagram (generalized Bayesian network) paradigm. The value of evidence allows us to compute the outcome sensitivity directly defined as the maximum difference among the values of evidence, and the value of perfect information, as the expected value of the values of evidence. We define the value of revelation as the optimal value of the values of evidence. We discuss the relationship between the value of revelation and the value of control. We also discuss implementation issues related to computation of the value of evidence and the value of perfect information.
Enterprise frameworks for workflow management systems
Authors: Itana M. S. Gimenes, Leonor Barroca
Venue: Software&mdash;Practice Experience (2002)

This paper proposes an enterprise framework for workflow management (WFM) systems based on the Workflow Management Coalition generic architecture. In addition, it presents one smaller object-oriented framework for task scheduling. This framework is obtained by refining one of the packages of the overall framework. The task scheduling framework was designed following the concept of model framework as in Catalysis. This sort of framework can be used as a template to generate code components within an application domain. According to this approach we can develop WFM components that can interoperate within a well-defined enterprise framework. This paper also presents the process of developing interoperable code components from model frameworks.
Managing schema evolution in a container-based persistent system
Authors: J. Baltasar García Perez-Schofield, Emilio García Roselló, Tim B. Cooper, Manuel Pérez Cota
Venue: Software&mdash;Practice Experience (2002)

Managing schema evolution is a problem every persistent system has to cope with to be useful in practice. Schema evolution consists basically of supporting class modification and dealing with data objects created and stored under the old class definitions. Several proposals have been made to handle this problem in systems that follow a full orthogonally persistent approach, but, until now, there has not been any proposal to support it in container-based persistent systems. In this paper we describe a schema evolution management system designed for Barbados. Barbados is a complete programming environment which is based on an architecture of containers to provide persistent storage. Barbados does not provide full orthogonal persistence, but, as will be described in this paper, its architecture has several other advantages. Among them is the fact that this model is especially suitable for solving the schema evolution problem.
Neural networks in civil engineering: a review
Authors: I. Flood
Venue: Civil and structural engineering computing: 2001 (2001)

The Chapter provides an introduction to the diverse range of alternative artificial neural networks (ANNs) currently available and the types of application they have been adopted for in civil and structural engineering. The presentation is made with reference to a classification and decomposition of the main features of ANNs. An introduction is first provided of the essential features of a typical ANN, and its mode of operation. A brief graphical interpretation is presented to illustrate how ANNs model data, and to help gain insight to their scope of application, merits and drawbacks. An identification is then made of the different types of processing that can be performed at the neuron level, the lowest level in an ANN. This is followed by an identification of the different ways in which neurons can be combined into an integral processing device capable of solving non-trivial problems. The range of alternative function types that can be implemented by ANNs are then examined. Finally, a review is provided of the primary methods of developing/training ANNs to solve specific problems. At each stage in the chapter, relevant neural paradigms are referenced and areas of application in civil and structural engineering are identified.