ppxscal/embedding_network huggingface dataset:
Circular incident edge lists: a data structure for rendering complex unstructured grids
Authors: Bruno Lévy, Guillaume Caumon, Stéphane Conreaux, Xavier Cavin
Venue: Proceedings of the conference on Visualization '01 (2001)

We present the Circular Incident Edge Lists (CIEL), a new data structure and a high-performance algorithm for generating a series of iso-surfaces in a highly unstructured grid. Slicing-based volume rendering is also considered. The CIEL data structure represents all the combinatorial information of the grid, making it possible to optimize the classical propagation from local minima paradigm. The usual geometric structures are replaced by a more efficient combinatorial structure. An active edges list is maintained, and iteratively propagated from an iso-surface to the next one in a very efficient way. The intersected cells incident to each active edge are retrieved, and the intersection polygons are generated by circulating around their facets. This latter feature enables arbitrary irregular cells to be treated, such as those encountered in certain computational fluid dynamics (CFD) simulations. Since the CIEL data structure solely depends on the connections between the cells, it is possible to take into account dynamic changes in the geometry of the mesh and in property values, which only requires the sorted extrema list to be updated. Experiments have shown that our approach is significantly faster than classical methods. The major drawback of our method is its memory consumption, higher than most classical methods. However, experimental results show that it stays within a practical range.
Improving Performance of Similarity-Based Clustering by Feature Weight Learning
Authors: D. S. Yeung, X. Z. Wang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Similarity-based clustering is a simple but powerful technique which usually results in a clustering graph for a partitioning of threshold values in the unit interval. The guiding principle of similarity-based clustering is ¿similar objects are grouped in the same cluster.¿ To judge whether two objects are similar, a similarity measure must be given in advance. The similarity measure presented in this paper is determined in terms of the weighted distance between the features of the objects. Thus, the clustering graph and its performance (which is described by several evaluation indices defined in this paper) will depend on the feature weights. This paper shows that, by using gradient descent technique to learn the feature weights, the clustering performance can be significantly improved. It is also shown that our method helps to reduce the uncertainty (fuzziness and nonspecificity) of the similarity matrix. This enhances the quality of the similarity-based decision making.
Software Trace Cache for Commercial Applications
Authors: Alex Ramirez, Josep Ll. Larriba-Pey, Carlos Navarro, Mateo Valero, Josep Torrellas
Venue: International Journal of Parallel Programming (2002)

In this paper we address the important problem of instruction fetch for future wide issue superscalar processors. Our approach focuses on understanding the interaction between software and hardware techniques targeting an increase in the instruction fetch bandwidth. That is the objective, for instance, of the Hardware Trace Cache (HTC). We design a profile based code reordering technique which targets a maximization of the sequentiality of instructions, while still trying to minimize instruction cache misses. We call our software approach, Software Trace Cache (STC). We evaluate our software approach, and then compare it with the HTC and the combination of both techniques. Our results on PostgreSQL show that for large codes with few loops and deterministic execution sequences the STC offers better results than a HTC. Also, both the software and hardware approaches combine well to obtain improved results.
Learning Visual Models from Shape Contours Using Multiscale Convex/Concave Structure Matching
Authors: N. Ueda, S. Suzuki
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A novel approach is proposed for learning a visual model from real shape samples of the same class. The approach can directly acquire a visual model by generalizing the multiscale convex/concave structure of a class of shapes, that is, the approach is based on the concept that shape generalization is shape simplification wherein perceptually relevant features are retained. The simplification does not mean the approximation of shapes but rather the extraction of the optimum scale convex/concave structure common to shape samples of the class. The common structure is obtained by applying the multiscale convex/concave structure-matching method to all shape pairs among given shape samples of the class and by integrating the matching results. The matching method, is applicable to heavily deformed shapes and is effectively implemented with dynamic programming techniques. The approach can acquire a visual model from a few samples without any a priori knowledge of the class. The obtained model is very useful for shape recognition. Results of applying the proposed method are presented.
Performance of RS-Coded DS/CDMA Microcellular Systems with M-ary Orthogonal Signaling
Authors: A. C. Iossifides, F.-N. Pavlidou
Venue: Wireless Personal Communications: An International Journal (1999)

This paper investigates the application of Reed-Solomon coding on DS/CDMA systems with M-ary orthogonal signaling for the reverse link of a microcellular environment. The performance of voice and data communications are analytically evaluated for a Rician or Rayleigh faded channel with lognormal shadowing and a two-slope path loss model. The effects of sectorization and antenna diversity are also considered. Numerical results, in terms of bit error probability and throughput, show that with proper selection of the coding rate and spreading, the proposed system presents enhanced performance with moderate complexity.
Oracle9i PL/SQL: A Developer's Guide
Authors: Bulusu Lakshman
Venue:  (2002)

:"Oracle 9i PL/SQL Application Development" is targeted to the intermediate level Oracle Developer designing or coding applications in SQL and PL/SQL. It assumes a working knowledge of Oracle SQL and PL/SQL. Advanced PL/SQL Programmers intending to learn PL/SQL 9i features will also benefit from this book."Oracle 9i PL/SQL Application Development" will cover the techniques of using PL/SQL 9i (latest release of PL/SQL language) for server-side applications. It also covers PL/SQL 9i in exhaustive detail and provides the methodology for implementing quality-proof and robust applications. Bulusu Lakshman assists the reader in implementing techniques that are effective for real-world and code-centric Oracle applications which, in the long run, saves time and effort on the part of the PL/SQL developer and increases his or her level to that of an advanced developer.
OSAM*.KBMS/P: A Parallel, Active, Object-Oriented Knowledge Base Server
Authors: Stanley Y. W. Su, Ramamohanrao Jawadi, Prashant Cherukuri, Qiang Li, Richard Nartey
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

An active object-oriented knowledge base server can provide many desirable features for supporting a wide spectrum of advanced and complex database applications. Knowledge rules, which are used to define a variety of database tasks to be performed automatically on the occurrence of some events, often need much more sophisticated rule-specification and control mechanisms than the traditional priority-based mechanism to specify the control structural relationships and parallel execution properties among rules. The underlying object-oriented (OO) knowledge representation model must provide a means to model the structural relationships among data entities and the control structures among rules in a uniform fashion. The transaction execution model must provide a means to incorporate the execution of structured rules in a transaction framework. Also, a parallel implementation of an active knowledge base server is essential to achieve the needed efficiency in processing nested transactions and rules. In this paper, we present the architecture, implementation, and performance of a parallel active OO knowledge base server, which has the following features. First, the server is developed based on an extended OO knowledge representation model that models rules as objects and their control structural relationships as association types. This is analogous to the modeling of entities as objects and their structural relationships as association types. Thus, entities and rules, and their structures, can be uniformly modeled. Second, the server uses a graph-based transaction model that can naturally incorporate the control semantics of structured rules and guarantee the serializable execution of rules as subtransactions. Thus, the rule-execution model is uniformly integrated with that of transactions. Third, it uses an asynchronous parallel execution model to process the graph-based transactions and structured rules. This server, named OSAM*.KBMS/P, has been implemented on a shared-nothing multiprocessor system (nCUBE2) to verify and evaluate the proposed knowledge-representation model, graph-based transaction model, and asynchronous parallel-execution model.
New Sequences with Zero Autocorrelation
Authors: E. M. Gabidulin, V. V. Shorin
Venue: Problems of Information Transmission (2002)

New families of unimodular sequences of length p = 3f + 1 with zero autocorrelation are described, p being a prime. The construction is based on employing Gauss periods. It is shown that in this case elements of the sequences are algebraic numbers defined by irreducible polynomials over \mathbb{Z} of degree 12 (for the first family) and 6 (for the second family). In turn, these polynomials are factorized in some extension of the field \mathbb{Q} into polynomials of degree, respectively, 4 and 2, which are written explicitly. For p = 13, using the exhaustive search method, full classification of unimodular sequences with zero autocorrelation is given.
Rapid Prototyping of High-Speed Communications Chips
Authors: David G. Boyer, Robert R. Cordell
Venue: IEEE Design Test (1991)

A description is given of the Mulga symbolic design system, which is based on the virtual-grid concept, a structural approach to symbolic design that extends naturally to a hierarchical design. The relative placement of the circuit elements is determined by their location on the input grid. This grid serves only to delineate the relative topology of the circuit elements and does not correspond to a physical coordinate system. Experience with Mulga for more than seven years is reported, showing that it has been very effective in providing quality layout and high productivity, enabling small teams to do entire designs, from algorithms to logic design to layout. A new symbolic design system called Dasl is also reported. The advantages of using symbolic layout for generator systems and silicon compilers are discussed.
The Universality of a Class of Modified Single-Stage Shuffle/Exchange Networks
Authors: S. Thanawastien, P. K. Srimani
Venue: IEEE Transactions on Computers (1988)

A class of modified single-state shuffle/exchange (S/E) networks with reconfigurable connections is described. The capability of these modified networks to simulate every arbitrary permutation and other multistage S/E networks is studied. In particular, the upper bounds on simulating six multistage S/E networks are given. It is also shown that C.L. Wu and T.Y. Feng's (1981) modified single-stage S/E network is optimal in terms of its universality and cost for the networks with one reconfigurable connection. However, some of the modified networks with two reconfigurable connections have better capability although they are slightly more expensive than Wu and Feng's network. Also proposed is a link folding scheme that can be used to reduce the connection complexity of implementing the connection selection mechanism.
Ideas: A Tool for VLSI CAD
Authors: A. Kumar, V. Kashyap, S. D. Sherlekar, G. Venkatesh, S. Biwas, P. C. P. Bhatt, S. Kumar
Venue: IEEE Design Test (1989)

The authors describe the Ideas integrated design automation system being developed in India. Ideas is based on a new high-level hardware description language, called Ideal (integrated design automation language), which incorporates several features that allow it to model both event-driven and demand-driven behavior. Ideas is built on an object-oriented kernel and consists of a text-graphics front-end for Ideal, a simulator that uses a mixed interpretive and compiled mode, a microcode generator, and layout tools.
Dispencery in different numbers of colors
Authors: Benjamin Doerr
Venue: Discrete Mathematics (2002)

In this article, we investigate the interrelation between the discrepancies of a given hypergraph in different numbers of colors. Being an extreme example we determine the multi-color discrepancies of the k-balanced hypergraph Hnk on partition classes of (equal) size n. Let c, k, n ∈ N. Set k0:=k mod c and bnkc := (n - [n/[c/k]])k/c. For the discrepancy in c colors we show bnk0c ≤ disc(Hnk, c) < bnk0c + 1, if k0 ≠ 0, and disc(Hnk, c)= 0, if c divides k. This shows that, in general, there is little correlation between the discrepancies of Hnk in different numbers of colors. If c divides k though, disc(H,c) ≤ (k/c)disc(H,k) holds for any hypergraph H.
Prospects for improving the regulatory process using e-rulemaking
Authors: Jane E. Fountain
Venue: Communications of the ACM (2003)

U.S. citizens participate directly in rulemaking---a deliberate agenda-setting process designed to elicit, sort, and clarify fact and opinion from a wide variety of interested parties. The rulemaking process offers a directness and scope for public participation unavailable in other policy-making processes [1].
Computer-Aided Surgery Planning and Rehearsal at Mayo Clinic
Authors: Richard A. Robb, Dennis P. Hanson, Jon J. Camp
Venue: Computer (1996)

Mayo Clinic surgeons are using computer-generated, highly accurate 3D images of patients to plan and rehearse complex operations. Surgeons have found this process invaluable in neurosurgery, as well as in craniofacial, orthopedic, lung, and prostate surgeries--and even such special operations as the separation of joined twins. The authors describe how they generate sophisticated 3D images from images currently taken by such established technologies as computerized tomography (CT) and magnetic resonance (MR). Doctors can even manipulate the 3D images to determine the exact nature of a patient's condition, the best way to treat the condition, and, if surgery is necessary, the best way to perform the operation. The authors have also brought 3D biomedical imaging and virtual reality together, developing the Virtual Reality Assisted Surgery Program (VRASP) to plan and rehearse surgical procedures. Doctors may some day take VRASP into the operating room to help during surgery. Readers can contact Robb at the Mayo Biomedical Imaging Resource; e-mail rar@mayo.edu
PROUD: A Sea-Of-Gates Placement Algorithm
Authors: Ren-Song Tsay, Ernest S. Kuh, Chi-Ping Hsu
Venue: IEEE Design Test (1988)

An efficient method is proposed for placing modules in large and highly complex sea-of-gates chips that include preplaced I/O pads and macrocells. PROUD repeatedly solves sparse linear equations. A resistive network analogy of the placement problem and convexity of the objective function are key concepts in this algorithm. The algorithm was tested on nine real circuits. For a triple-metal-layer, 100000-gate sea-of-gate design with 26000 instances, the constructive phase took 50 minutes on a VAX 8650 and yielded excellent results for total wire length. Extensions of the method are considered.
A Graph-Based Approach for Discovering Various Types of Association Rules
Authors: Show-Jane Yen, Arbee L. P. Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Mining association rules is an important task for knowledge discovery. We can analyze past transaction data to discover customer behaviors such that the quality of business decision can be improved. Various types of association rules may exist in a large database of customer transactions. The strategy of mining association rules focuses on discovering large itemsets, which are groups of items which appear together in a sufficient number of transactions. In this paper, we propose a graph-based approach to generate various types of association rules from a large database of customer transactions. This approach scans the database once to construct an association graph and then traverses the graph to generate all large itemsets. Empirical evaluations show that our algorithms outperform other algorithms which need to make multiple passes over the database.
Teamwork: Rough Around the Edges
Venue: IEEE Software (1990)

No abstract available 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 Estimation of 'Small' Probabilities by Leaving-One-Out
Authors: Hermann Ney, Ute Essen, Reinhard Kneser
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

In this paper, we apply the leaving-one-out concept to the estimation of ¿small¿ probabilities, i.e., the case where the number of training samples is much smaller than the number of possible classes. After deriving the Turing-Good formula in this framework, we introduce several specific models in order to avoid the problems of the original Turing-Good formula. These models are the constrained model, the absolute discounting model and the linear discounting model. These models are then applied to the problem of bigram-based stochastic language modeling. Experimental results are presented for a German and an English corpus.
An Optimal Retry Policy Based on Fault Classification
Authors: Tein-Hsiang Lin, K. G. Shin
Venue: IEEE Transactions on Computers (1994)

An optimal retry policy in a computer system is usually derived under the unrealistic assumption that fault characteristics are known a priori and remain unchanged throughout the mission lifetime. In such a case, the optimal retry period depends only upon the system's status at the time of fault detection. We propose to remedy this deficiency by formulating the optimal retry problem as a Bayesian decision problem where not only the time of fault detection but also the results of earlier retries are used to estimate the current fault characteristics. Previous knowledge about fault characteristics is represented by the prior distributions of fault-related parameters which are updated whenever new samples are obtained from retry and detection mechanisms. A new fault classification scheme is proposed to assign a temporal fault type (i.e. permanent, intermittent or transient) to each detected fault so that the corresponding fault parameters can be estimated. The estimated fault parameters are then used to derive the optimal retry period that minimizes the mean task completion time. Efficient algorithms are developed to determine the optimal retry period online upon detection of each fault. To evaluate the goodness of the proposed retry policy, it is compared with, and is always found to outperform, a number of fixed retry period policies.
Design of CAECC - Cellular Automata Based Error Correcting Code
Authors: D. Roy Chowdhury, S. Basu, I. Sen Gupta, P. Pal Chaudhuri
Venue: IEEE Transactions on Computers (1994)

A new scheme for designing error detecting and error correcting codes around cellular automata (CA) is reported. A simple and efficient scheme for generating SEC-DED codes is presented which can also be extended for generating codes with higher distances. A CA-based hardware scheme for very fast decoding (and correcting) of the codewords is also reported.
Performance Evaluation of Circuit Switched Multistage Interconnection Networks Using a Hold Strategy
Authors: S. H. Hsiao, C. Y. R. Chen
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

The performance evaluation of processor-memory communications for multiprocessor systems using circuit switched interconnection networks with a hold strategy is performed. Message size and processor processing time are considered and shown to have a significant effect on the overall system performance. A closed queuing network model is proposed such that only (n+2) states are required by the proposed model, in contrast to (n/sup 2/+3n+4)/2 states needed in previous studies, where n is the number of stages of the multistage interconnection network. Since a closed-form solution is obtained, the behavior of a complete cycle of memory access through multistage interconnection networks can be accurately analyzed and various performance bounds can be obtained.
The Misprediction Recovery Cache
Authors: Ashwini K. Nanda, James O. Bondi, Simonjit Dutta
Venue: International Journal of Parallel Programming (1998)

In modern processors, deep pipelines couple with superscalar techniques to allow each pipe stage to process multiple instructions. When such a pipe must be flushed and refilled, as when predicted program flow beyond a branch is subsequently recognized as wrong, the temporary performance loss is significant. While modern branch target buffer (BTB) technology makes this flush/refill penalty fairly rare, the penalty that accrues from the remaining branch mispredictions is a serious impediment to even higher processor performance. Advanced mechanisms that can reduce this residual misprediction penalty can be of enormous value in future microprocessor designs. In this paper we describe the design and performance of a promising new mechanism called the Misprediction Recovery Cache (MRC). The key results of our study are. (1) Small, finite sized MRCs (16 to 256 entry) can effectively reduce branch penalty in deeply pipelined processors. (2) Commercial Benchmarks such as the Winstone benchmarks make better use of larger M RCs due to large number of unique branch instructions unlike the predominantly technical SPECint benchmarks. (3) The MRC hit rates increase with increasing BTB prediction accuracy (5-200% depending on MRC size) due to fewer residual mispredictions associated with better prediction. (4) For the processor architecture we studied, the M RC resulted in up to 20% improvement in cpi(cycles per instruction). (5) The incremental performance gain achievable by adding an MRC to a modern CISC processor (which uses a BTB with a two-level predictor) is two to three times of what was achievable by going from a one-level predictor to a two-level predictor.
A comparative study of some generalized rough approximations
Authors: Anna Gomolińska
Venue: Fundamenta Informaticae (2002)

In this paper we focus upon a comparison of some generalized rough approximations of sets, where the classical indiscernibility relation is generalized to any binary reflexive relation. We aim at finding the best of several candidates for generalized rough approximation mappings, where both definability of sets by elementary granules of information as well as the issue of distinction among positive, negative, and border regions of a set are taken into account.