ppxscal/embedding_network huggingface dataset:
Using Idle Workstations to Implement Predictive Prefetching
Authors: Jasmine Y.Q. Wang, Joon S Ong, Yvonne Coady, Michael J. Feeley
Venue:  (2000)

The benefits of Markov-based predictive prefetching have been largely overshadowed by the overhead required to produce high quality predictions. While both theoretical and simulation results for prediction algorithms appear promising, substantial limitations exist in practice. This outcome can be partially attributed to the fact that practical implementations ultimately make compromises in order to reduce overhead. These compromises limit the level of algorithm complexity, the variety of access patterns, and the granularity of trace data the implementation supports. This paper describes the design and implementation of GMS-3P, an operating-system kernel extension that offloads prediction overhead to idle network nodes. GMS-3P builds on the GMS global memory system, which pages to and from remote workstation memory. In GMS-3P, the target node sends an on-line trace of an application''s page faults to an idle node that is running a Markov-based prediction algorithm. The prediction node then uses GMS to prefetch pages to the target node from the memory of other workstations in the network. Our preliminary results show that predictive prefetching can reduce remote-memory page fault time by 60% or more and that by offloading prediction overhead to an idle node, GMS-3P can reduce this improved latency by between 24% and 44%, depending on Markov-model order.
Design Metrics Which Predict Source Code Quality
Authors: H. R Hartson, Eric C. Smith, Sallie M. Henry, Calvin Selig
Venue:  (1987)

Since the inception of software engineering, the major goal has been to control the development and maintenance of reliable software. To this end, many different design methodologies have been presented as a means to improve software quality through semantic clarity and syntactic accuracy during the specification and design phases of the software life cycle. On the other end of the life cycle, software quality metrics have been proposed to supply quantitative measures of the resultant software. This study is an attempt to unify the concepts of design methodologies and software quantity metrics by providing a means to determine the quality of a design before its implementation. By knowing (quantitatively) the quality of the design, a considerable amount of time and money can be saved by realizing design problems and being able to correct these problems at design time. All of this can be accomplished before any effort has been expended on the implementation of the software. This paper provides a means of allowing a software designer to predict the quality of the source code at design time. Actual equations for predicting source code quality from design metric values are given.
On the densest k-subgraph problems
Authors: U. Feige, M. Seltser
Venue:  (1997)

Given an n-vertex graph G and a parameter k, we are to find a k-vertex subgraph with the maximum number of edges. This problem is NP-hard. We show that the problem remains NP-hard even when the maximum degree in G is three. When G contains a k-clique, we give an algorithm that for any e < 0 finds a k-vertex subgraph with at least (1 - e)(k || 2) edges, in time nO((1 + logn/>sub<k>/sub<)/e). We study the applicability of semidefinite programming for approximating the dense k-subgraph problem. Our main result in this respect is negative, showing that for k @ n1/3, semidefinite programs fail to distinguish between graphs that contain k-cliques and graphs in which the densest k-vertex subgraph has average degree below logn.
An Object-Oriented Graphics Kernel
Authors: Gene Lee
Venue:  (1997)

A graphics kernel serves as interface between an application program and an underlying graphics subsystem. Developers interact with kernel primitives while the primitives interact with a graphics subsystem. Although the two forms of interaction closely relate, their optimal designs conflict. The former interaction prefers a process that closely follows the mental (or object-based) model of application development while the latter prefers a process that parses display-lists. This papers describes RDI, an object-oriented graphics kernel that resolves the differences between the two interactions with one design. Developers explicitly assign intuitive relationships between primitives while an underlying process interprets the primitives in an orderly manner. The kernel''s extensible design decouples the processes of modeling and rendering. Primitives dynamically communicate with graphics subsystems to express their purpose and functions. The discussion of the kernel''s design entails its optimizations, its benefits toward simulation, and its application toward parallel rendering. 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
Multiresolution Image Segmentation Using Markov Random Field
Authors: C. T. Li, R. G. Wilson
Venue:  (1996)

In this work we propose a statistical multiresolution approach by modelling spatial gray level difference using Markov Random Field (MRF). Firstly, a multiresolution gray level pyramid is built by applying a unimodal Gaussian-like kernel operator to subsample the original image by a factor of 2. With the original image (highest spatial resolution and lowest class resolution) at the bottom of the pyramid, each level is a low-pass/sub-sampled version of the level below. Subsequently, based on Markov Random Field, the measure of grey level variances of pairs of pixels within region and across regions are utilised to estimate the maximum a posteriori classification at the top level of the pyramid (highest class resolution and lowest spatial resolution). Stochastic Relaxation is also adopted iteratively to maximise the likelihood. After the class partitioning is done at the top level the information gathered is propagated down to the next level and the algorithm is applied again to the new level to refine the position of the boundary. Results are presented on various test images to show the effectiveness of the method.
The Asymptotic Optimality of Spider-Web Networks
Authors: Nicholas Pippenger
Venue:  (1989)

We determine the limiting behavior of the linking probability for large spider web networks. The result confirms a conjecture made by Ikeno in 1959. We also show that no balanced crossbar network, in which the same components are interconnected according to a different pattern, can have an asymptotically larger linking probability.
A Comparison of Selected Conceptual Frameworks for SimulationModeling
Authors: Emory J Derrick, Osman Balci, Richard E. Nance
Venue:  (1989)

The purpose of this paper is compare 13 Conceptual Frameworks (CFs) selected from among several catagories of applicability to discrete-event simulation modeling. Each CF is briefly reviewed to provide the background information required for the comparison. Based on the insights gained in applying the CFs to the modeling complex traffic intersection system, the CFs are compared to their distinct characteristics and capabilities. Comparative comments are grouped according to the design guidance and implementation guidance features of the CFs. Conclusions highlight the inadequacies of the CFs and the importance of research in CF development.
Multiresolution Motion Analysis
Authors: J. Beacom, R. Wilson
Venue:  (1996)

Motion analysis is an interesting problem in computer vision. There exist many possibilities both for its computation and for its applications which encompass efficient video coding techniques based on prediction of subsequent frames from previously derived motion estimates, motion based segmentation algorithms, robot guidance, object detection and tracking and so on. A review of the most popular techniques in this area is presented along with a promising approach based within a multiresolution framework. Further research is to be pursued from this work and its future direction is discussed.
The Logic of Constraint Satisfaction
Authors: Alan K. Mackworth
Venue:  (1991)

The Constraint Satisfaction Problem (CSP) formalization has been a productive tool within Artificial Intelligence and related areas. The Finite CSP (FCSP) framework is presented here as a restricted logical calculus within a space of logical representation and reasoning systems. FCSP is formulated in a variety of logical settings: theorem proving in first order predicate calculus, propositional theorem proving (and hence SAT), the Prolog and Datalog approaches, constraint network algorithms, a logical interpreter for networks of constraints, the Constraint Logic Programming (CLP) paradigm and propositional model finding (and hence SAT, again). Several standard, and some not-so-standard, logical methods can therefore be used to solve these problems. By doing this we obtain a specification of the semantics of the common approaches. This synthetic treatment also allows algorithms and results from these disparate areas to be imported, and specialized, to FCSP; the special properties of FCSP are exploited to achieve, for example, completeness and to improve efficiency. It also allows export to the related areas. By casting CSP both as a generalization of FCSP and as a specialization of CLP it is observed that some, but not all, FCSP techniques lift to CSP and, perhaps, thereby to CLP. Various new connections are uncovered, in particular between the proof-finding approaches and the alternative model-finding approaches that have arisen in depiction and diagnosis applications.
The Numerical Solution of Delay-Differential-Algebraic Equations of Retarded and Neutral Type
Authors: Uri M. Ascher, Linda R. Petzold
Venue:  (1992)

In this paper we consider the numerical solution of initial value delay-differential-algebraic equations (DDAEs) of retarded and neutral types, with a structure corresponding to that of Hessenberg DAEs. We give conditions under which the DDAE is well-conditioned, and show how the DDAE is related to an underlying retarded or neutral delay-ODE (DODE). We present convergence results for linear multistep and Runge-Kutta methods applied to DDAEs of index 1 and 2, and show how higher-index Hessenberg DDAEs can be formulated in a stable way as index-2 Hessenberg DDAEs.
The STATEMATE Semantics of Statecharts
Authors: D. Harel, A. Naamad
Venue:  (1995)

We describe the semantics of statecharts as implemented in the STATEMATE system. This was the first executable semantics defined for the language, and has been in use for almost a decade. In terms of the controversy around whether changes made in a given step should take effect in the current step or in the next one, this semantics adopts the latter approach.
Increasing the usage of open hypermedia systems: a developer-side approach
Authors: Nikos Karousos, Manolis Tzagarakis, Ippokratis Pandis
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

This paper argues that the existence of a developer support framework is a critical issue to the usage of Open Hypermedia Systems (OHSs). For this reason, the OHS Community would benefit by the adoption of both a service discovery mechanism and a set of standards and tools to approach the development of hypermedia clients in a transparent and methodological manner.
An Isotach Implementation for Myrinet
Authors: John Regehr
Venue:  (1997)

An isotach network provides strong guarantees about message delivery order. We show that an isotach network can be efficiently implemented entirely in software, on off-the-shelf hardware. Parts of this implementation could be performed much more efficiently in hardware - we are currently developing hardware components to do this. The all-software version then serves several purposes: to rapidly develop a working isotach system to use as a platform for development of higher level software, to find potential problems in the hardware design, and to pre-test software components of the system so that they won''t have to be debugged at the same time as hardware.
Langwidere: A New Facial Animation System
Authors: David R. Forsey, Carol L. Wang
Venue:  (1994)

This paper presents Langwidere, a facial animation system. Langwidere is the basis for a flexible system capable of imitating a wide range of characteristics and actions, such as speech or expressing emotion. Langwidere integrates a hierarchical spline modeling system with simulated muscles based on local area surface deformation. The multi-level shape representation allows control over the extent of deformations, at the same time reducing the number of control vertices needed to define the surface. The head model is constructed from a single closed surface allowing the modeling of internal structures such as tongue and teeth, rather than just a mask. Simulated muscles are attached to various levels of the surface with more rudimentary levels substituting for bone such as the skull and jaw. The combination of a hierarchical model and simulated muscles provides precise, flexible surface control and supports easy generation of new characters with a minimum of recoding.
Response Surface Models Combining Linear and Euler Aerodynamics for HSCT Design
Authors: Knill Duane L., Giunta Anthony A., Baker Chuck A., Grossman Bernard, Mason William H., Haftka Raphael T., Watson Layne T.
Venue:  (1998)

A method has been developed to efficiently implement supersonic aerodynamic predictions from Euler solutions into a highly constrained, multidisciplinary design optimization of a High-Speed Civil Transport. The method alleviates the large computational burden associated with performing computational fluid dynamics analyses through the use of variable-complexity modeling techniques, response surface methodologies, and coarse grained parallel computing. Using information gained from lower fidelity aerodynamic models, reduced term response surface models representing a correction to the linear theory response surface model predictions are constructed using Euler solutions. Studies into five, ten, fifteen, and twenty variable design problems show that accurate results can be obtained with the reduced term models at a fraction of the cost of creating the full term quadratic response surface models. Specifically, a savings of 255 CPU hours out of 392 CPU hours required to create the full term response surface model is obtained for the twenty variable problem on a single 75 MHz IP21 processor of a SGI Power Challenge.
Computer Analysis of User Interfaces
Authors: Antonio C. Siochi
Venue:  (1989)

Interface evaluation is a necessary phase in the production of quality user interfaces. The usual evaluation techniques involve formal experiments or observation, and can be invasive. One non-invasive method that can be used at user sites is to record all user input and system output to a file. This transcript is then algorithmatically analyzed to determine interface problems. A new technique analyzes these transcripts by searching for maximal repeating patterns (MRPs), on the hypothesis that repeating sequences of user actions indicate interesting user behavior, and therefore may show problems in the interface. The technique was tested by using it to evaluate the human-computer interface of a large and complex image processing system in active use. Results show MRPs useful in detecting specific problems within the interface.
Fault-Local Distributed Mending
Authors: S. Kutten, D. Peleg
Venue:  (1994)

As communication networks grow, existing fault handling tools that involve global measures such as global time-outs or reset procedures become increasingly unaffordable, since their cost grows with the size of the network. Rather, for a fault handling mechanism to scale to large networks, its cost must depend only on the number of failed nodes (which, thanks to today''s technology, grows much slower than the networks), and moreover, it should allow the non-faulty regions of the networks to continue their operation even during the recovery of the faulty parts. This abstract introduces the concept of fault-local algorithms, which are algorithms whose cost depends only on the (unknown) number of faults, and demonstrates the feasibility of fault locality via developing such algorithms for a number of key problems, including MIS and D+1 coloring.
The Nonlinear Stability of a Heavy Rigid Plate Supported by Flexible Columns
Authors: William I. Thacker, C. Y. Wang, Layne T. Watson
Venue:  (1992)

A heavy rigid platform is supported by thin elastic legs. The governing equations for large deformations are formulated and solved numerically by homotopy and quasi-Newton methods. Nonlinear phenomena such as non-uniqueness, catastrophe and hysteresis are found. A global critical load for nonlinear stability is introduced.
Rigorous Time/Space Tradeoffs for Inverting Functions
Authors: A. Fiat, M. Naor
Venue:  (1995)

We provide rigorous time-space tradeoffs for inverting any function. Given a function f, we give a time space tradeoff of TS2 = N3q(f), where q(f) is the probability that two random elements are mapped to the same image under f. We also give a more general tradeoff, TS3 = N3, that can invert any function at any point.
Using Active Mechanisms for Global Integrity Maintenance in Federated Database Systems
Authors: T&uuml, Can rker, Stefan Conrad
Venue:  (1996)

Der Beitrag wurde auf dem Workshop "Foderierte Datenbanken" vom 22.04 bis 23.04.96 in Magdeburg vorgestellt.
Uniform Hashing with Multiple Passbits
Authors: Paul Martini, Walter Burkhard
Venue:  (2000)

We present a novel extension to passbits providing significant reduction to unsuccessful search lengths for open addressing collision resolution hashing. Both experimental and analytical results included demonstrate the dramatic reductions possible. This method does not restrict the hashing table configuration parameters and utilizes very little additional storage space per bucket. The runtime performance for insertion is essentially the same as for ordinary open addressing with passbits; the successful search lengths remain the same as for open addressing without passbits; the unsuccessful search lengths can be made to be arbitrarily close to one bucket access for any desired loading factor.
Inferring Evolutionary Trees with Strong Combinatorial Evidence
Authors: V. Berry, O. Gascuel
Venue:  (1998)

We consider the problem of inferring the evolutionary tree of a set of n species. We propose a quartet reconstruction method which specifically produces trees whose edges have strong combinatorial evidence. Let Q be a set of resolved quartets defined on the studied species, the method computes the unique maximum subset Q^* of Q which is equivalent to a tree and outputs the corresponding tree as an estimate of the species'' phylogeny. We use a characterization of the subset Q^* due to (Bandelt86) to provide an O(n^4) incremental algorithm for this variant of the NP-hard quartet consistency problem. Moreover, when chosing the resolution of the quartets by the Four-Point Method (FPM) and considering the Cavender-Farris model of evolution, we show that the convergence rate of the Q^* method is at worst polynomial when the maximum evolutive distance between two species is bounded. We complete these theoretical results by an experimental study on real and simulated data sets. The results show that (i) as expected, the strong combinatorial constraints it imposes on each edge leads the Q^* method to propose very few incorrect edges; (ii) more surprisingly, the method infers trees with a relatively high degree of resolution.
On the design of problem-specific evolutionary algorithms
Authors: Stefan Droste, Dirk Wiesmann
Venue: Advances in evolutionary computing: theory and applications (2003)

In this chapter a set of guidelines for the design of genetic operators and the representation of the phenotype space in evolutionary algorithms (EAs) is proposed. These guidelines should help to systematize the design of problem-specific EAs by making the genetic operators behave in a controlled fashion with respect to metrics on geno- and phenotype space. Because we assume that we have enough domain knowledge to choose metrics that smooth the fitness landscape, this controlled behavior should improve the efficiency of the EA.The applicability of this concept is shown by the systematic design of a genetic programming system for finding Boolean functions. This system is the first genetic programming system to have reportedly found the 12 parity function.
Matricial Space-Economy with Constant Access-Time
Authors: I. Pu, A. M. Gibbons
Venue:  (1996)

We describe a particularly simple and practical algorithm for economic storage of arrays without recourse to the intricacies of perfect hash functions. This is done while retaining constant access time. The algorithm performs usefully over a range of values of x/n where the notional input array contains n entries with x non-zero elements. For x less than or equal to n/k and one particular setting of the array parameter, we show that the average storage required is about n(k+30)/10k. For sparse arrays this becomes n/10.
The use of conflicts in Searching Bayesian networks
Authors: David Poole
Venue:  (1993)

This paper discusses how conflicts (as used by the consistency-based diagnosis community) can be adapted to be used in a search-based algorithm for computing prior and posterior probabilities in discrete Bayesian Networks. This is an ``anytime'''' algorithm, that at any stage can estimate the probabilities and give an error bound. Whereas the most popular Bayesian net algorithms exploit the structure of the network for efficiency, we exploit probability distributions for efficiency; this algorithm is most suited to the case with extreme probabilities. This paper presents a solution to the inefficiencies found in naive algorithms, and shows how the tools of the consistency-based diagnosis community (namely conflicts) can be used effectively to improve the efficiency. Empirical results with networks having tens of thousands of nodes are presented.
Evaluation of Software Development Methodologies: A Final Report
Authors: Richard E. Nance, James D. Arthur, Ashok V. Dandekar
Venue:  (1986)

A procedure for evaluating software development methodologies is developed based on the linkage among objectives, principles, and attributes. The procedure utilizes metrics defined to recognize surface properties of the software, leading to evidence of the presence or absence of particular attributes. Application of the procedure to samples from the RNTDS and AEGXS Modular Development programs reveals weaknesses and strengths that should be addressed in efforts to produce a common CDS. The extension of the work is proposed
Integrating TQM and SEI Process Assessment
Authors: Joel Henry, Sallie M. Henry
Venue:  (1992)

This paper describes a methodology for assessing the software process (both development and maintenance) used by an organization. The assessment methodology integrates the principles of Total Quality Management and the work of the Software Engineering Institute. Assessment results in a well-understood, well-documented, quantitatively evaluated software process. The methodology utilizes four steps: investigation, modeling, data collection, and analysis of both process content and process output. Process improvements are determined by analysis results.