ppxscal/embedding_network huggingface dataset:
Instruction Prediction for Step Power Reduction
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Because the inductive noise Ldi/dt is induced by the power change and can have disastrous impact on the timing and reliability of the system, high-performance CPU designs are more concerned with the step power reduction instead of the average power reduction. The step power is defined as the power difference between the previous and present clock cycles, and represents the Ldi/dt noise at the microarchitecture level. Two mechanisms at the microarchitecture level are proposed in this paper to reduce the step power of the floating point unit (FPU), as FPU is the potential "hot" spot of Ldi/dt noise. The two mechanisms, ramping up and ramping down FPU based on instruction fetch queue (IFQ) scanning and PC + N instruction prediction, can meet any specific step power constraint. We implement and evaluate the two mechanisms using a performance and power simulator based on the SimpleScalar toolset. Experiments using SPEC95 benchmarks show that our method reduces the performance loss by a factor of four when compared to a recent work. 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
Verifications of RMP: An Efficient Reliable Multicast Protocol
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

This paper presents a novel reliable group multicast based on a logical-clock token ring approach. The algorithms are simple and can guarantee the total ordering and atomicity of multicast messages and is highly efficient. The correctness of the algorithms has been given in terms of the operational processes in a group. The recovery algorithms of the protocol can handle communication fault, process crash failures and network partition. The performance analysis of the algorithms is also presented.
Voronoi Diagrams Based on Convex Distance Functions
Authors: L. P Chew, Robert L. S Drysdale
Venue:  (1986)

We present an "expanding waves" view of Voronoi diagrams that allows such diagrams to be defined for very general metrics and for distance measures that do not qualify as matrics. If a pebble is dropped into a still pond, circular waves move out from the point of impact. If n pebbles are dropped simultaneously, the paces where wave fronts meet define the Voronoi diagram on the n points of impact. The Voronoi diagram for any normed matric, including the Lp metrics, can be obtained by changing the shape of the wave front from a circle to the shape of the "circle" in that metric. (For example, the "circle" in the L1 metric is diamond shaped.) For any convex wave shape there is a corresponding convex distance function. Even if the shape is not symmetric about its center (a triangle, for example), although the resulting distance function is not a metric, it can still be used to define a Voronoi diagram. Like Voronoi diagrams based on the Euclidean metric, the Voronoi diagrams based on other nomed metrics can be used to solve various closest-point problems (all-nearest-neighbors, minimum spanning trees, etc.). Some of these problems also make sense for convex distance functions which are not metrics. In particular, the "largest empty circle" problem becomes the "largest empty convex shape" problem, and "motion planning for a disc" becomes "motion planning for a convex shape". These problems can both be solved quickly given the Voronoi diagram. We present an asymptotically optimal algorithm for computing Voronoi diagrams based on convex distance functions.
A unified neural network approach for steel beams patch load capacity
Authors: E. T. Fonseca, M. M. B. R. Vellasco, S. A. L. de Andrade, P. C. G. da S. Vellasco
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

This work presents a neural networks modelling to forecast steel beam's patch load resistance. In preceding studies, neural network results have been compared and calibrated with experimental data and existing design formulae, showing a good agreement. Despite these results, the adopted method did not properly consider the differences in behaviour of slender, intermediate and compact beams. This paper introduces a new strategy based on a single neural network containing all the 155 experimental results. The Neural Network presented a maximum error value lower than 30%, while the existing formulas presented errors greater than 40%.
Study on Disk Zoning for Video Servers
Authors: Sheau-Ru Tong, Yee-Foon Huang, Jonathan C. L. Liu
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

Without proper care of the disk zoning issue, we may suffer a great loss in both storage and bandwidth utilization for supplying video streams. In this regard, we propose two schemes, free-p and fixed-p schemes, in a unified framework of rearranging the zone layout in a logical manner. The free-p scheme can optimally utilize resources, but needs a complicated timing control. Whereas, the fixed-p scheme can achieve a slightly lower utilization with a simpler timing control compared to the free-p scheme. The fixed-p scheme is further applied to a multiple-disk platform. The variable bit rates of individual disks may cause dramatic aggregated bit rate fluctuation, so we propose a novel data placement policy termed skewed zone-major round robin (SZRR) to ensure a stable disk-bus bandwidth utilization. A file system employing the proposed schemes has been implemented on a PC server equipped with five SCSI-II disk drives. We demonstrate that the system is able to support up to 70 1.5Mbps video streams simultaneously when a 20 second or so initial waiting time is allowed.
Sair Linux and GNU Certification Level II, Apache and Web Servers
Venue:  (2002)

:Managing and troubleshooting Web servers is an integral part of every IT professional's job. Apache is an open source Web server that has captured 630f the more than 18 million Web servers currently in place. This guide provides the in-depth information, skills, and techniques needed to effectively maintain an Apache Web server.With Linux growing rapidly in popularity as an enterprise solution, companies now more than ever are looking for IT professionals who are Linux certified. Designed and developed by the industry-leading members of Sair, Inc. and its advisory board, the Sair Linux and GNU Certification program provides IT professionals with a clear path for improving their Linux skills and knowledge base, while giving employers the means for ensuring the competency level of their staff. The LCE books in this series of study guides help readers master the areas of expertise necessary to pass the certification exam for becoming a Linux Certified Engineer (LCE). Readers will also get prep help through lab exercises and sample questions from the LCE exam. 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
Feature based 2D shape transformation
Authors: K. C. Hui, Yadong Li
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

The transformation or blending of one 2D shape into another usually operates on sets of discrete points approximating the objects. This relies on a series of evenly distributed or properly positioned points on the boundary of the objects. Characteristics of the objects are not well considered. This paper presents a technique for transforming or blending shapes represented as a series of curve segments. Transformation of the shapes is attained by establishing correspondence between pairs of features of the objects. Based on an estimation of the sharpness of a corner on the boundary of a 2D contour, vertices are generated on sharp corners of the shapes and hence dividing the boundary of the shapes into elements. Correspondence between the elements of the shape is then established before the correspondence between points on the elements is established. This allows special features of the shapes to be retained in the blending operation which is essential in product and industrial design.
Graph Homomorphisms and Phase Transitions
Authors: Graham R. Brightwell, Peter Winkler
Venue:  (1997)

We model physical systems with "hard constraints" by the space Hom(G,H) of homomorphisms from a locally finite graph G to a fixed finite constraint graph H. For any assignment $\lambda$ of positive real activities to the nodes of H, there is at least one Gibbs measure on Hom(G,H); when G is infinite, there may be more than one. When G is a regular tree, the simple, invariant Gibbs measures on Hom(G,H) correspond to node-weighted branching random walks on H. we show that such walks exist for every H and $\lambda$, and characterize those H which, by admitting more than one such construction, exhibit phase transition behavior.
A Measurement-Based Model for Estimation of Resource Exhaustion in Operational Software Systems
Authors: Kalyanaraman Vaidyanathan, Kishor S. Trivedi
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

Software systems are known to suffer from outages due to transient errors. Recently, the phenomenon of "software aging" [1], one in which the state of the software system degrades with time, has been reported. The primary causes of this degradation are the exhaustion of operating system resources, data corruption and numerical error accumulation. This may eventually lead to performance degradation of the software or crash/hang failure or both. Earlier work in this area to detect aging and to estimate its effect on system resources does not take into account the system workload [2]. In this paper, we propose a measurement-based model to estimate the time to exhaustion of operating system resources both as a function of time and the system workload state. The semi-Markov reward model is constructed based on workload and resource usage data collected from the UNIX operating system. We first identify different workload states using statistical cluster analysis and build a state-space model. Corresponding to each resource, a reward function is then defined for the model based on the rate of resource exhaustion in the different states. The model is then solved to obtain trends and the estimated exhaustion rates for the resources. With the help of this measure, pro-active fault management techniques such as ``Software rejuvenation'' [1] may be employed to prevent unexpected outages.
Optimising uptake of usability recommendations
Authors: Gerred Blyth
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Analyses the barriers to the uptake of usability recommendations, and techniques that minimise them. Offers an approach for maximising HCI contributions where input is limited and development teams are large and distributed.
Neural representation of probabilistic information
Authors: M. J. Barber, J. W. Clark, C. H. Anderson
Venue: Neural Computation (2003)

It has been proposed that populations of neurons process information in terms of probability density functions (PDFs) of analog variables. Such analog variables range, for example, from target luminance and depth on the sensory interface to eye position and joint angles on the motor output side. The requirement that analog variables must be processed leads inevitably to a probabilistic description, while the limited precision and lifetime of the neuronal processing units lead naturally to a population representation of information. We show how a time-dependent probability density ρ(x; t) over variable x, residing in a specified function space of dimension D, may be decoded from the neuronal activities in a population as a linear combination of certain decoding functions φi(x), with coefficients given by the N firing rates ai(t) (generally with D < N). We show how the neuronal encoding process may be described by projecting a set of complementary encoding functions φ'i(x) on the probability density ρ'(x; t), and passing the result through a rectifying nonlinear activation function. We show how both encoders φ'i(x) and decoders φi(x) may be determined by minimizing cost functions that quantify the inaccuracy of the representation. Expressing a given computation in terms of manipulation and transformation of probabilities, we show how this representation leads to a neural circuit that can carry out the required computation within a consistent Bayesian framework, with the synaptic weights being explicitly generated in terms of encoders, decoders, conditional probabilities, and priors.
Algebraic Multigrid by Smoothed Aggregation for Second and Fourth Order Elliptic Problems
Authors: Petr Vanek, Jan Mandel, Marian Brezina
Venue:  (1995)

An algebraic multigrid algorithm is developed based on prolongations by smoothed aggregation. Coarse levels are generated automatically. Guidelines for the selection of method components are presented based on energy considerations. Efficiency of the resulting algorithm is demonstrated by computational results.
Application of Threshold Partitioning of Sparse Matrices to Markov Chains
Authors: Hwajeong Choi, Daniel B. Szyld
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

Three algorithms which permute and partition a sparse matrix are presented as tools for the improved solution of Markov chain problems. One is the algorithm PABLO [SIAM J.\ Sci.\ Stat.\ Computing, Vol.\ 11, pp.\ 811--823, 1990] while the other two are modifications of it. In the new algorithms, in addition to the location of the nonzeros, the values of the entries are taken into account. The permuted matrices are well suited for block iterative methods that find the corresponding probability distribution, as well as for block diagonal preconditioners of Krylov-based methods. Also, if the partition obtained from the ordering algorithm is used as an aggregation scheme, an iterative aggregation method performs better with this partition than with others found in the literature. Numerical experiments illustrate the performance of the iterative methods with the new orderings.
Visualisation of building maintenance through time
Authors: H. N. Rad, F. Khosrowshahi
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

The use of 3D visualisation has long been established as a major breakthrough in closing the gap between a client's need and what is perceived by the designer to be the need of the client. Nevertheless, construction clients are increasingly demanding a greater participation in the process of design generation. This has been a welcome move by all parties, as less variation means less conflict. In spite of its vast practical uses, in the field of visualisation, the ability to travel through time is an area that has been neglected by the academics and the developers alike. The paper highlights the benefits of the incorporation of the 4/sup th/ dimension-the time dimension-into 3D visualisation. Building maintenance is used as a case study to demonstrate the practicality of the 4D visualisation and its representation through VRML. To this end, the focus is on the lighting, paints and carpets. However, the concept can easily be expanded to encompass the causes and effects of all events on all building components.
Desktop Video Studio Bible, 1 edition
Authors: George Avgerakis
Venue:  (2002)

:There's no other book that offers you comprehensive guidance on all aspects of setting up and running your own desktop video business. Expert George Avgerakis -- who runs a successful multimedia studio in New York City, and writes and speaks professionally on the subject -- generously shares his insider's edge and years of experience in this complete guide to getting up and running with your own one-person video production shop. 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
Integrating evolutionary computing and the SADDE methodology
Authors: Carles Sierra, Jordi Sabater, Jaume Agustí, Pere Garcia
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper introduces a methodology to help the programmer in the transition from a set of desired global properties expressed as an equation-based model (EBM) that a Multi-Agent System (MAS) must fullfil to an actual society of interacting agents. We report the use of evolutionary programming techniques to tune the parameters of the populations of agents so their aggregated behaviour maximaly approaches the desired global properties as specified by the EBM.
Building a Hybrid Tracking System: Integration of Optical and Magnetic Tracking
Authors: Thomas Auer, Axel Pinz
Venue: Proceedings of the 2nd IEEE and ACM International Workshop on Augmented Reality (1999)

Multi-user augmented reality systems require excellent registration in order to allow cooperation among the users. In order to satisfy this need we have built a hybrid tracking system integrating magnetic and optical tracking. Prediction from the magnetic tracker allows for rather small search areas in the optical tracking subsystem. Our hybrid tracking system is faster than a standalone optical tracking system and outperforms a magnetic system in terms of accuracy and jitter.
Modeling instructible robots for waste disposal applications
Authors: L. H. Tsoukalas, D. T. Bargiotas
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

The storage of high-level radioactive waste in centralized interim storage facilities (CIS) creates a unique and challenging environment for developing and deploying innovative robotic technologies. Limited accessibility and resources as well as difficulties in predicting the behavior of some facility components call for enhanced collaboration between humans and robots and improved capacity for robotic instruction in nearly linguistic terms. We present a neurofuzzy approach for instructing robots operating in such environments and propose a functional architecture for groups of collaborating instructible robots.
Real-Time Collaboration in Heterogeneous Computing Environments
Authors: Ivan Marsic
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The recent proliferation of computing devices and the contexts in which they are used demand diversity in collaborative applications as well. The objective of our research is to enable conferees to share applications that are adapted to their (heterogeneous) computing environments. This is achieved by using eXtensible Markup Language (XML) for the communication medium. The conferees share the same data or a subset of that data, represented in XML, but they may see it displayed in different ways as needed or desired. The framework adapts to the computing and network environment and transforms information so that it matches the client's local capabilities and resources.
Negotiations with Inaccurate Payoff Values
Authors: Shigeo Matsubara, Makoto Yokoo
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

We have developed a new method for negotiation with inaccurate payoff values. It is difficult to know accurate payoff values because the available resources of each agent are limited. The inaccuracy of payoff values can cause negotiation failure. However, if the agents know the correct values, they can reach an agreement. Advising, i.e., giving self-estimation values to the other agent, is one way to recover from a negotiation failure. Simple methods for incorporating advice into evaluation, such as by arithmetic mean, do not work well because the advisee may seriously suffer from deception. In order to overcome this drawback, we propose a method that incorporates advice into evaluation. This method is based on similarity between the adviser's estimation and the advisee's estimation. Our method is efficient and can suppress deception fairly well so agents are motivated to adopt this method. Our experiments use example problems, and the results show that our method is efficient and gives an incentive to adopt itself.
Optimal One-to-Many Disjoint Paths in Folded Hypercubes
Authors: C.-N. Lai, G.-H. Chen, D.-R. Duh
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

Routing functions have been shown effective in deriving disjoint paths in the hypercube. In this paper, by the aid of a minimal routing function, k+l disjoint paths from one node to another k+l distinct nodes are constructed in the folded hypercube whose maximal length is not greater than [k/21+1, where k is the dimension and [k/21 is the diameter of the folded hypercube. The maximal length is minimized in the worst case. For general case, the maximal length is nearly optimal (I the maximal distance between the two end nodes of these k+l paths plus two). The result of this paper also computes the Rabin number of the folded hypercube, which is an open problem raised by Liaw and Chang.
Graph decompositions and factorizing permutations
Authors: C. Capelle, M. Habib
Venue: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97) (1997)

A factorizing permutation of a given undirected graph is simply a permutation of the vertices in which all decomposition sets appear to be factors. Such a concept seems to play a central role in recent papers dealing with graph decomposition. We apply it to modular decomposition and we propose a linear algorithm that computes the whole decomposition tree when a factorizing permutation is provided. This algorithm can be seen as a common generalization of (Ma and Hsu, 1991) for modular decomposition of chordal graphs and (Habib et al., 1995) for inheritance graph decomposition. It also suggests many new decomposition algorithms for various notions of graph decompositions.
A Comparison of Graphs of Concept for Reverse Engineering
Authors: Nicolas Anquetil
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

To group related things together (for example to form subsystems); researchers in Reverse Engineering are looking for algorithms that create meaningful groups. One such algorithm, Concept Analysis, received a lot of interest recently. It creates a lattice of concepts, which have some advantages over the more traditional tree of clusters from clustering algorithms.We will argue that the main interest of Concept Analysis lies in the concepts themselves and can be disconnected from the particular structure (the lattice of concepts) in which the concepts are usually arranged. We will compare Concept Analysis to various other algorithms trying to select the most important concepts contained in a set of entities.Our main conclusion is that although it have advantages, the lattice of concepts suffer from a major drawback that other constructs do not have: it returns much more information (concepts) than what it was given in input (a set of entities describing some software system).