ppxscal/embedding_network huggingface dataset:
Generalized symmetries in boolean functions
Authors: Victor N. Kravets, Karem A. Sakallah
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

In this paper we take a fresh look at the notion of symmetries in Boolean functions. Our studies are motivated by the fact that the classical characterization of symmetries based on invariance under variable swaps is a special case of a more general invariance based on unrestricted variable permutations. We propose a generalization of classical symmetry that allows for the simultaneous swap of ordered and unordered groups of variables, and show that it captures more of a function's invariant permutations without undue computational requirements. We apply the new symmetry definition to analyze a large set of benchmark circuits and provide extensive data showing the existence of substantial symmetries in those circuits. Specific case studies of several of these benchmarks reveal additional insights about their functional structure and how it might be related to their circuit structure.
Web User Interface Design: Forgotten Lessons
Authors: Uttara Nerurkar
Venue: IEEE Software (2001)

A number of prescriptions are in vogue for designing Web user interfaces, but Web site usability continues to be a serious issue. In comparison, the usability of traditional GUI applications is a couple of notches better. The key difference is in the design methods used. The author argues that improving Web design methods is possible by learning from the GUI design approach.
A case study on the applications of a generic library for low-cost polychromatic passive stereo
Authors: Simon Stegmaier, Dirc Rose, Thomas Ertl
Venue: Proceedings of the conference on Visualization '02 (2002)

Active stereo has been used by engineers and industrial designers for several years to enhance the perception of computer generated three-dimensional images. Unfortunately, active stereo requires specialized hardware. Therefore, as ubiquitous computing and teleworking gain importance, using active stereo becomes a problem. The goal of this case study is to examine the concept of a generic library for polychromatic passive stereo to make stereo vision available everywhere.
HAL: A Faster Match Algorithm
Authors: Pou-Yung Lee, Albert Mo Kim Cheng
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Existing match algorithms treat the matching process like the querying process of relational databases. Owing to the combinatorial nature of the matching process, the match time greatly varies in different recognize-act cycles. Current match algorithms utilize local matching support networks with redundant working memory elements shared among rules involving the same classes. Since the match time is a dominant factor in the total execution time of a production system, such large match time makes production systems with existing match algorithms unsuitable for many applications. To reduce match time, we introduce the Heuristically-Annotated-Linkage (HAL) match algorithm. HAL differs from traditional match algorithms in that HAL employs a fixed-traversal-distance pseudobipartite network approach of treating rules and classes as objects, or nodes, in only one global pseudobipartite-graph-like connection and communication scheme. In addition, HAL is more efficient than other existing match algorithms because it is capable of immediate characterization of any new datum upon arrival. This paper reviews existing match algorithms, presents HAL, and analyzes the performance of HAL in comparison with existing algorithms.
Bounded model checking for the universal fragment of CTL
Authors: Wojciech Penczek, Bozena Wozna, Andrzej Zbrzezny
Venue: Fundamenta Informaticae (2002)

Bounded Model Checking (BMC) has been recently introduced as an efficient verification method for reactive systems. BMC based on SAT methods consists in searching for a counterexample of a particular length and generating a propositional formula that is satisfiable iff such a counterexample exists. This new technique has been introduced by E. Clarke et al. for model checking of linear time temporal logic (LTL). Our paper shows how the concept of bounded model checking can be extended to ACTL (the universal fragment of CTL). The implementation of the algorithm for Elementary Net Systems is described together with the experimental results.
End-user debugging for e-commerce
Authors: Henry Lieberman, Earl Wagner
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

One of the biggest unaddressed challenges for the digital economy is what to do when electronic transactions go wrong. Consumers are frustrated by interminable phone menus, and long delays to problem resolution. Businesses are frustrated by the high cost of providing quality customer service.We believe that many simple problems, such as mistyped numbers or lost orders, could be easily diagnosed if users were supplied with end-user debugging tools, analogous to tools for software debugging. These tools can show the history of actions and data, and provide assistance for keeping track of and testing hypotheses. These tools would benefit not only users, but businesses as well by decreasing the need for customer service.
Block Red-Black Ordering: A New Ordering Strategy for Parallelization of ICCG Method
Authors: Takeshi Iwashita, Masaaki Shimasaki
Venue: International Journal of Parallel Programming (2003)

A parallel ordering technique is a typical strategy for parallelization of the ICCG method. This paper proposes a new parallel ordering method to develop a parallel ICCG solver utilizing fewer synchronization points and achieving a high convergence rate. The new parallel ordering is called &ldquo;block red-black ordering.&rdquo; In this method, nodes in an analyzed grid are divided into several or many blocks, and red-black ordering is applied to the blocks. Since the blocks with an identical color are independent of each other, forward and backward substitutions in the ICCG iteration can be parallelized in each color. The new method has the advantage that only one synchronization point exists in each parallelized substitution. In order to evaluate the convergence and the parallel speed-up of the method, we carried out an analytical investigation using the ordering graph theory and numerical tests on a scalar parallel computer. The analytical study shows that the convergence rate is improved by an increase in the number of nodes of one block and that an optimal block size for getting the best convergence rate is easily set. The numerical tests show that the new method achieves a high parallel speed-up rate due to fast convergence, small synchronization costs, and effective utilization of the data cache on a scalar parallel computer.
Workflow View Based E-Contracts in a Cross-Organizational E-Services Environment
Authors: Dickson K. W. Chiu, Kamalakar Karlapalem, Qing Li, Eleanna Kafeza
Venue: Distributed and Parallel Databases (2002)

In an e-service environment, workflow involves not only a single organization but also a number of business partners. Therefore, workflow inter-operability in such an environment is an important issue for enacting workflows. In this article, we introduce our approach of using workflow views as a fundamental support for E-service workflow inter-operability and for controlled visibility of (sub-)workflows by external parties. We discuss various aspects of a workflow view, and their semantics with example usage. Furthermore, we develop a contract model based on workflow views and demonstrate how management of e-contracts can be facilitated, with an Internet start-up E-service inter-organization workflow example.
Using Microsoft Excel 2000
Authors: Julia Kelly
Venue:  (1973)

:Using Microsoft Excel 2000 is structured in content and approach to fill the needs of the intermediate user, showing you how to get a task done and get on with your job. It provides enough information to be a through reference for all but the most advanced users while not intimidating newer users. This book brings you real-world, practical content that can not only increase the ability to use the software, but also increase your actual productivity level. 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
On the instantiation of possibility distributions
Authors: Ronald R. Yager
Venue: Fuzzy Sets and Systems (2002)

We investigate the problem of instantiating a variable whose value is uncertain, but known to be constrained by a possibility distribution. Using a model based upon the Dempster-Shafer belief structure, we show that this problem of instantiation is analogous to a compound experiment in which we randomly select a subset and then perform a number of repeated experiments without replacement on this set. The probability distribution resulting from this compound experiment leads to a random procedure for instantiating a possibility distribution.
Blending Imperative and Relational Programming
Authors: Timothy A. Budd
Venue: IEEE Software (1991)

When imperative (value- or state-oriented) programming and logical (relation-oriented) programming are combined into a single language, the combination is even more powerful than when either technique is used alone. Leda, a strongly typed compiled language that tries to combine features of both, is described. Suggestions for blending the two styles are offered. Logical features of Leda are examined.
Procedural multiresolution for plant and tree rendering
Authors: Javier Lluch, Emilio Camahort, Roberto Vivó
Venue: Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in Africa (2003)

Modeling and rendering of plants and trees requires generating and processing large numbers of polygons. Geometry simplification methods may be used to reduce the polygon count and obtain a multiresolution representation. However, those methods fail to preserve the visual structure of a tree. We propose a different approach: procedural multiresolution. We build procedural models that reflect a tree's visual structure at different resolution levels. The models are based on parametric L-systems. Our method takes a parametric chain representing a tree and generates a new chain with embedded multiresolution information. The algorithm is based on a metric that quantifies the relevance of the branches of a tree. The representation supports efficient geometry extraction and produces good visual results.
Guest Editors' Introduction-Network Security: It's Time to Take It Seriously
Authors: Patrick W. Dowd, John T. McHenry
Venue: Computer (1998)

The explosive growth of networking technology continues to redefine the rules for maintaining the privacy and integrity of electronic data. There is a staggering amount of personal, commercial, governmental, and military information in the various networking infrastructures worldwide. Almost anyone can reach out to the network, which often means almost anyone can reach in. In short, network security is an issue that can no longer be postponed. Fortunately, security measures do not have to be expensive or complicatedýa reality the networking community has only recently taken to heart. Network security itself, however, must be better understood and embraced, preferably before a compromise occurs. The articles in this issue are intended to alert you to the risks and some solutions and to encourage you to develop and implement security methodologies and strategies beforeýrather than afterýan incident. Strong cryptography is very powerful when it is done right, but it is not a panacea. Building a secure cryptographic system is easy to do badly and very difficult to do well. Unfortunately, most people can't tell the difference. In this article, the author conveys some of the lessons learned in designing, analyzing, and breaking cryptographic systems.
Efficient Exploitation of Instruction-Level Parallelism for Superscalar Processors by the Conjugate Register File Scheme
Authors: Meng-chou Chang, Feipei Lai
Venue: IEEE Transactions on Computers (1996)

This paper introduces a novel superscalar micro-architecture, called IAS-S, and its related software techniques. We treat two basic problems in superscalar machines. First, we seek a feasible hardware platform which allows the compiler to perform more aggressive instruction scheduling. Second, we develop a good way of communication between the instruction scheduler and register allocator to avoid inadequate register allocation resulting in poor instruction schedules. For the first part, IAS-S employs the Conjugate Register File (CRF) scheme to support multilevel instruction boosting so that a greater amount of instruction-level parallelism in a program can be identified at compile time. For the second part, the instruction scheduling in the IAS-S compiler consists of two passes, prepass and postpass, and a scheduling-conflict graph is built for the register allocator during the prepass scheduling. In this manner, the register allocator can take the potential benefit for later postpass instruction scheduling into account and thus prevent inadequate register allocation.
Accurate Rounding Scheme for the Newton-Raphson Method Using Redundant Binary Representation
Authors: H. Kabuo, T. Taniguchi, A. Miyoshi, H. Yamashita, M. Urano, H. Edamatsu, S. Kuninobu
Venue: IEEE Transactions on Computers (1994)

Proposes a new algorithm of estimation and compensation of the error effect for rounding in the case of implementation of division and square root using the Newton-Raphson method. The authors analyze the error of the hardware system to confirm the condition of the implementation with respect to this algorithm. Next, they describe in detail how to compensate the error by using this algorithm. Finally, they show that the hardware components for this algorithm, the direct rounding mechanism in the recode circuit and the sticky digit generating circuit, can be realized simply by improving the redundant binary representation multiplier. The number of increasing cycles for this new algorithm is only one, and the rounding result using this algorithm satisfies IEEE Standard 754 rounding perfectly.
Rivet: a flexible environment for computer systems visualization
Authors: Robert Bosch, Chris Stolte, Diane Tang, John Gerth, Mendel Rosenblum, Pat Hanrahan
Venue: ACM SIGGRAPH Computer Graphics (2000)

Rivet is a visualization system for the study of complex computer systems. Since computer systems analysis and visualization is an unpredictable and iterative process, a key design goal of Rivet is to support the rapid development of interactive visualizations capable of visualizing large data sets. In this paper, we present Rivet's architecture, focusing on its support for varied data sources, interactivity, composition and user-defined data transformations. We also describe the challenges of implementing this architecture efficiently and flexibly. We conclude with several examples of computer systems visualizations generated within Rivet, including studies of parallel systems, superscalar processors and mobile network usage.
On Discontinuity-Adaptive Smoothness Priors in Computer Vision
Authors: S. z. Li
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

A variety of analytic and probabilistic models in connection to Markov random fields (MRFs) have been proposed in the last decade for solving low level vision problems involving discontinuities. This paper presents a systematic study of these models and defines a general discontinuity adaptive (DA) MRF model. By analyzing the Euler equation associated with the energy minimization, it shows that the fundamental difference between different models lies in the behavior of interaction between neighboring points, which is determined by the a priori smoothness constraint encoded into the energy function. An important necessary condition is derived for the interaction to be adaptive to discontinuities to avoid oversmoothing. This forms the basis on which a class of adaptive interaction functions (AIFs) is defined. The DA model is defined in terms of the Euler equation constrained by this class of AIFs. Its solution is C1 continuous and allows arbitrarily large but bounded slopes in dealing with discontinuities. Because of the continuous nature, it is stable to changes in parameters and data, a good property for regularizing ill-posed problems. Experimental results are shown.
Modeling Wireless Local with General Call Holding Times and Finite Number of Subscribers
Authors: Hsien-Ming Tsai, Yi-Bing Lin
Venue: IEEE Transactions on Computers (2002)

This paper proposes an analytic model to compute the loss probability for Wireless Local Loop (WLL) with a finite number of subscribers. The number of trunks between the WLL concentrator and the base station controller is less than the total number of radio links in the WLL. This model is validated against the simulation results. The execution of our model is efficient compared with simulation. However, its time complexity is higher than several existing analytic models that approximate the loss probability for WLL. Therefore, we design an efficient WLL network planning procedure (in terms of time complexity and accuracy) that utilizes the approximate analytic models to provide small ranges for selecting the values of system parameters. Our model is then used to accurately search the operation points of WLL within the small ranges of the system parameter values. This paper proves that the performance of WLL with limited trunk capacity and finite subscriber population is not affected by the call holding time distributions. Based on our model, we illustrate WLL design guidelines with several numerical examples.
Generating systems of equations for performance evaluation of multistage interconnection networks
Authors: Dietmar Tutsch, G&#x00FC;nter Hommel
Venue: Journal of Parallel and Distributed Computing (2002)

Multistage interconnection networks (Banyan networks) are frequently proposed as connections in multiprocessor systems, in ATM switches, or in Gigabit Ethernet switches. There exist several analytical models for evaluating the performance of such networks. Analytical models are much faster for this purpose than simulation. On the other hand, the development of an analytical model is very time-consuming. In this paper, we present a method for the automatic and fast generation of an analytical network model. The generated analysis handles networks of arbitrary size, arbitrary switching element sizes, arbitrary buffer lengths in each network stage, an arbitrary (but uniform) traffic pattern, and an arbitrarily chosen network load. The arbitrary traffic patterns include multicast traffic, which has not been considered by former models.
Nest: A Nested-Predicate Scheme for Fault Tolerance
Authors: L. A. Laranjeira, M. Malek, R. Jenevein
Venue: IEEE Transactions on Computers (1993)

Introduces a nested-predicate scheme for fault tolerance, called Nest. Nest provides a formal comprehensive model for fault-tolerant parallel algorithms and a general methodology for designing reliable applications for multiprocessor systems. The model relies on the formalization of concepts for fault tolerance by means of three nested system predicates and on properties ruling their interrelationships. This rigorous framework facilitates the study of the specific properties that enable an algorithm to tolerate faults. The consequence of that is the outline of systematic design techniques that can be used to add fault tolerance properties to algorithms while preserving their functional characteristics.
The evolution of synaptically generated waves in one- and two-dimensional domains
Authors: Remus Osan, Bard Ermentrout
Venue: Physica D (2002)

We study the onset and evolution of waves in an integrate-and-fire network of synaptically coupled neurons in one- and two-dimensional domains which are restricted to firing one spike. We determine the critical size of initial excitation of the network necessary for the onset of propagation. We also determine the ignition time. We derive an integro-differential equation for the evolution of the firing time as a function of spatial position. We use the evolution equation to understand propagation failure. We compare the behavior of the integrate-and-fire model with a biophysically based model. Finally, we show that weak heterogeneity has similarly weak effects on the firing times.
From the convener of the International Fortran Standards Committee (WG5)
Authors: John Reid
Venue: ACM SIGPLAN Fortran Forum (2002)

The big news from WG5 is that the draft Fortran 2000 standard is now out for comment. This makes other news about what WG5 and its convener have been doing pale into insignificance, but I will nevertheless tell you about what happened since I last wrote an article here, a year ago.I will refer to several WG5 documents by their N numbers; these are all accessible from the WG5 website, http://www.nag.co.uk/sc22wg5/, and I would like once more to take the opportunity to thank Nag for providing this facility.
Performance Evaluation of Some Clustering Algorithms and Validity Indices
Authors: Ujjwal Maulik, Sanghamitra Bandyopadhyay
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four cluster validity indices, namely Davies-Bouldin index, Dunn's index, Calinski-Harabasz index, and a recently developed index \cal I. Based on a relation between the index \cal I and the Dunn's index, a lower bound of the value of the former is theoretically estimated in order to get unique hard K-partition when the data set has distinct substructures. The effectiveness of the different validity indices and clustering methods in automatically evolving the appropriate number of clusters is demonstrated experimentally for both artificial and real-life data sets with the number of clusters varying from two to ten. Once the appropriate number of clusters is determined, the SA-based clustering technique is used for proper partitioning of the data into the said number of clusters.
CAS-BUS: A Test Access Mechanism and a Toolbox Environment for Core-Based System Chip Testing
Authors: Mounir Benabdenbi, Walid Maroufi, Meryem Marzouki
Venue: Journal of Electronic Testing: Theory and Applications (2002)

As System on a Chip (SoC) testing faces new challenges, some new test architectures must be developed. This paper describes a Test Access Mechanism (TAM) named CAS-BUS that solves some of the new problems the test industry has to deal with. This TAM is scalable, flexible and dynamically reconfigurable. The CAS-BUS architecture is compatible with the IEEE P1500 standard proposal in its current state of development, and is controlled by Boundary Scan features.This basic CAS-BUS architecture has been extended with two independent variants. The first extension has been designed in order to manage SoC made up with both wrapped cores and non wrapped cores with Boundray Scan features. The second deals with a test pin expansion method in order to solve the I/O bandwidth problem. The proposed solution is based on a new compression/decompression mechanism which provides significant results in case of non correlated test patterns processing. This solution avoids TAM performance degradation.These test architectures are based on the CAS-BUS TAM and allow trade-offs to optimize both test time and area overhead. A tool-box environment is provided, in order to automatically generate the needed component to build the chosen SoC test architecture.