ppxscal/embedding_network huggingface dataset:
A High Speed Reconfigurable Firewall Based On Parameterizable FPGA-based Content Addressable Memories
Authors: Alistair A. McEwan, Jonathan Saul
Venue: The Journal of Supercomputing (2001)

A technique for implementing a Content Addressable Memory (CAM) on an FPGA is described. The CAM is highly parameterizable, allowing varying word widths, memory depths and operations to be implemented depending upon the requirements of the target application. The application of the CAM is then demonstrated by using it in the core of a network firewall application, where it is used in a pipeline IP packet detection algorithm. The firewall application is particularly useful in demonstrating the application potential of the CAM as the packet detection algorithm can be dynamically reconfigured to react to different criteria simply by altering the contents of the CAM. The result is a complete system on a chip.
Race-Free State Assignments for Synthesizing Large-Scale Asynchronous Sequential Logic Circuits
Authors: P. D. Fisher, Sheng-Fu Wu
Venue: IEEE Transactions on Computers (1993)

A state assignment technique is introduced for synthesizing large-scale asynchronous sequential logic circuits (ASLCs). It provides a systematic and efficient approach for generating race-free state assignments. A race condition is classified as being either an intrinsic race (IR) or or a generated race. Intrinsic races decompose into two subclassifications: visible intrinsic races and hidden intrinsic races. Algorithms have been developed to identify and eliminate these races. A graph, referred to as a Node-Weight Diagram, facilitates the process of making state assignments and guarantees that no races are generated. Moreover, it provides a convenient and efficient method for investigating the implications of selecting from an allowed set of alternative race-free state assignments. The state assignment technique described adds cycles and states, as needed, to avoid IRs and always attempts to use the minimum or near-minimum number of state variables and states. This technique has been implemented and incorporated into an ASLC design automation system. Experimental results show that it provides significantly better results than other approaches in terms of the computation time required to make the assignments and the number of state variables required to achieve race-free ASLCs.
Effects of Reuse on Quality, Productivity, and Economics
Authors: Wayne C. Lim
Venue: IEEE Software (1994)

This article presents metrics from two Hewlett-Packard (HP) reuse programs that document the improved quality, increased productivity, shortened time-to-market, and enhanced economics resulting from reuse. Work products are the products or by-products of the software-development process: for example, code, design, and test plans. Reuse is the use of these work products without modification in the development of other software. Leveraged reuse is modifying existing work products to meet specific system requirements. A producer is a creator of reusable work products, and the consumer is someone who uses them to create other software. Time-to-market is the time it takes to deliver a product from the time it is conceived. Experience with reuse has been largely positive. Because work products are used multiple times, the accumulated defect fixes result in a higher quality work product. Because the work products have already been created, tested, and documented, productivity increases because consumers of reusable work products need to do less work. However, increased productivity from reuse does not necessarily shorten time-to-market. To reduce time-to-market, reuse must be used effectively on the critical path of a development project. Finally, we have found that reuse allows an organization to use personnel more effectively because it leverages expertise. However, software reuse is not free. It requires resources to create and maintain reusable work products, a reuse library, and reuse tools. To help evaluate the costs and benefits of reuse, we have developed an economic analysis method, which we have applied to multiple reuse programs at HP.
Clarifications and Corrections To 'Performance Analysis of a Generalized Class of m-Level Hierarchical Multiprocessor Systems' (Mar 1992 129-138)
Authors: I. O. Mahgoub, A. K. Elmagarmid
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Several items in the above-titled work areclarified and corrected.
Efficient Simplicial Reconstructions of Manifolds from Their Samples
Authors: Daniel Freedman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

A new algorithm for manifold learning is presented. Given only samples of a finite-dimensional differentiable manifold and no a priori knowledge of the manifold's geometry or topology except for its dimension, the goal is to find a description of the manifold. The learned manifold must approximate the true manifold well, both geometrically and topologically, when the sampling density is sufficiently high. The proposed algorithm constructs a simplicial complex based on approximations to the tangent bundle of the manifold. An important property of the algorithm is that its complexity depends on the dimension of the manifold, rather than that of the embedding space. Successful examples are presented in the cases of learning curves in the plane, curves in space, and surfaces in space; in addition, a case when the algorithm fails is analyzed.
Parallel Simulated Annealing Algorithms for Cell Placement on Hypercube Multiprocessors
Authors: P. Banerjee, M. H. Jones, J. S. Sargent
Venue: IEEE Transactions on Parallel and Distributed Systems (1990)

A discussion is presented of two ways of mapping the cells in a two-dimensional area of a chip onto processors in an n-dimensional hypercube such that both small and large cell moves can be applied. Two types of move are allowed: cell exchanges and cell displacements. The computation of the cost function in parallel among all the processors in the hypercube is described, along with a distributed data structure that needs to be stored in the hypercube to support such a parallel cost evaluation. A novel tree broadcasting strategy is presented for the hypercube that is used extensively in the algorithm for updating cell locations in the parallel environment. A dynamic parallel annealing schedule is proposed that estimates the errors due to interacting parallel moves and adapts the rate of synchronization automatically. Two novel approaches in controlling error in parallel algorithms are described: heuristic cell coloring and adaptive sequence control. The performance on an Intel iPSC-2/D4/MX hypercube is reported.
Teaching ocean wave forecasting using computer-generated visualization and animation--Part 1: sea forecasting
Authors: Dennis J. Whitford
Venue: Computers Geosciences (2002)

Ocean waves are the most recognized phenomena in oceanography. Unfortunately, undergraduate study of ocean wave dynamics and forecasting involves mathematics and physics and therefore can pose difficulties with some students because of the subject's interrelated dependence on time and space. Verbal descriptions and two-dimensional illustrations are often insufficient for student comprehension. Computer-generated visualization and animation offer a visually intuitive and pedagogically sound medium to present geoscience, yet there are very few oceanographic examples. A two-part article series is offered to explain ocean wave forecasting using computer-generated visualization and animation. This paper, Part 1, addresses forecasting of sea wave conditions and serves as the basis for the more difficult topic of swell wave forecasting addressed in Part 2. Computer-aided visualization and animation, accompanied by oral explanation, are a welcome pedagogical supplement to more traditional methods of instruction.In this article, several MATLAB® software programs have been written to visualize and animate development and comparison of wave spectra, wave interference, and forecasting of sea conditions. These programs also set the stage for the more advanced and difficult animation topics in Part 2. The programs are user-friendly, interactive, easy to modify, and developed as instructional tools. By using these software programs, teachers can enhance their instruction of these topics with colorful visualizations and animation without requiring an extensive background in computer programming.
Cryptography Efficient Permutation Instructions for Fast Software
Authors: Ruby B. Lee, Zhijie Shi, Xiao Yang
Venue: IEEE Micro (2001)

Performing permutations in software can facilitate more widespread use of secure information processing and faster multimedia processing. But current instruction set architectures, even when augmented with subword-parallel multimedia instructions, do not provide efficient, bit-level software permutations. Four new instructions each offer a solution.
Automating extraction of logical domains in a web site
Authors: Necip Fazil Ayan, Wen-Syan Li, Okan Kolak
Venue: Data Knowledge Engineering (2002)

The domain name field in a universal resource locator (URL) has been viewed as a natural choice to organize Web pages. For example, Web search results may be grouped in terms of domains and presented to users as clusters for ease of visualization. However, using this approach, large Web sites, such as Geocities, W3C, and www.cs.umd.edu, tend to yield many matches that leads to a few large, flat structured, and unorganized clusters. As a matter of fact, many pages in these sites are actually "logical domains" by themselves. For example, Web sites for projects at a university or the XML section at W3C could be viewed as "logical domains". In this paper, we propose the concept of a logical domain, which is identified by semantic relatedness, as opposed to a physical domain, which is identified simply by domain name. The identification of logical domain is important to many Web applications, such as query result reorganization, site map generation, and topic distillation. We have developed and implemented a set of rules based on link structure, path information, document metadata, and citations to identify logical domain entry pages (i.e., root pages of logical domains). The importance of these rules are automatically adjusted using a novel decision tree algorithm and training data provided by human feedback. We also develop techniques to define the boundary of each logical domain based on identified logical domain entry pages. We have conducted extensive experiments on real Web sites to evaluate the effectiveness of our proposed techniques. The experimental results show that our techniques perform very well in extracting logical domains in a Web site.
Robust traffic engineering: game theoretic perspective
Authors: Vladimir Marbukh
Venue: ACM SIGMETRICS Performance Evaluation Review (2002)

On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line traffic engineering algorithms assume complete statistical knowledge of the request generating process. This dichotomy, however, oversimplifies many practical situations when some incomplete information on the expected demands is available, and proper utilization of the available information may improve the network performance. This paper proposes a game theoretic framework for robust traffic engineering intended to guard against the worst case scenario with respect to possible uncertainties in the external demands and link loads. The proposed framework can be interpreted as a game of the routing algorithm attempting to optimize the network performance and the adversarial environment attempting to obstruct these efforts by selecting the worst case scenario with respect to the uncertainties. Two different classes of schemes are considered: first, suitable for MPLS implementation, centralized schemes, and, second, suitable for OSPF-OMP implementation, decentralized schemes.
Hybrid simplification: combining multi-resolution polygon and point rendering
Authors: Jonathan D. Cohen, Daniel G. Aliaga, Weiqiang Zhang
Venue: Proceedings of the conference on Visualization '01 (2001)

Multi-resolution hierarchies of polygons and more recently of points are familiar and useful tools for achieving interactive rendering rates. We present an algorithm for tightly integrating the two into a single hierarchical data structure. The trade-off between rendering portions of a model with points or with polygons is made automatically.Our approach to this problem is to apply a bottom-up simplification process involving not only polygon simplification operations, but point replacement and point simplification operations as well. Given one or more surface meshes, our algorithm produces a hybrid hierarchy comprising both polygon and point primitives. This hierarchy may be optimized according to the relative performance characteristics of these primitive types on the intended rendering platform. We also provide a range of aggressiveness for performing point replacement operations. The most conservative approach produces a hierarchy that is better than a purely polygonal hierarchy in some places, and roughly equal in others. A less conservative approach can trade reduced complexity at the far viewing ranges for some increased complexity at the near viewing ranges.We demonstrate our approach on a number of input models, achieving primitive counts that are 1.3 to 4.7 times smaller than those of triangle-only simplification.
Graduated Nonconvexity by Functional Focusing
Authors: Mads Nielsen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

Reconstruction of noise-corrupted surfaces may be stated as a (in general nonconvex) functional minimization problem. For functionals with quadratic data term, this paper addresses the criteria for such functionals to be convex, and the variational approach for minimization. I present two automatic and general methods of approximation with convex functionals based on Gaussian convolution. They are compared to the Blake-Zisserman graduated nonconvexity (GNC) method and Bilbro et al. and Geiger and Girosi's mean field annealing (MFA) of a weak membrane.
Exact Convergence of a Parallel Textured Algorithm for Data Network Optimal Routing Problems
Authors: Garng M. Huang, Wen-Lin Hsieh
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

In our earlier paper [1], a textured decomposition based algorithm is developed to solve the optimal routing problem in data networks; a few examples were used to illustrate the speedup advantage and the convergence conditions for the textured algorithm to converge to a global minimum. The speedup advantage is investigated in [2]. However, the theoretical foundation is not provided. In this paper, we provide the foundation. First, we show that for any textured decomposition, the algorithm always converges to a stationary point, which may not be a global minimum. And then, we prove that if the conditions of the exact convergence theorem are satisfied, the textured algorithm will converge to a global minimum.
A Revisionist Account of Early Language Development
Authors: Maurice V. Wilkes
Venue: Computer (1998)

In the 1950s, there was a good deal of discussion at computer conferences about what was then known as automatic programming. This led to Fortran, which was developed by a group within IBM who had strictly pragmatic aims. They saw a clear need for some system that would enable the labor of programming to be reduced. The scientific study of programming languages began slightly later with the publication of the Algol 60 report. This was put together by an international committee whose aims were essentially intellectual. They set out to design a language that was elegant in a mathematical sense and would enable scientists to specify a computation without concerning themselves about practical details. Together, Fortran and Algol define a fault line that runs through the study of programming languages that we are now only beginning to bridge.
Direct Gray-Scale Minutiae Detection In Fingerprints
Authors: Dario Maio, Davide Maltoni
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

Most automatic systems for fingerprint comparison are based on minutiae matching. Minutiae are essentially terminations and bifurcations of the ridge lines that constitute a fingerprint pattern. Automatic minutiae detection is an extremely critical process, especially in low-quality fingerprints where noise and contrast deficiency can originate pixel configurations similar to minutiae or hide real minutiae. Several approaches have been proposed in the literature; although rather different from each other, all these methods transform fingerprint images into binary images. In this work we propose an original technique, based on ridge line following, where the minutiae are extracted directly from gray scale images. The results achieved are compared with those obtained through some methods based on image binarization. In spite of a greater conceptual complexity, the method proposed performs better both in terms of efficiency and robustness.
Parallel Hash-Based Join Algorithms for a Shared-Everything Environment
Authors: T. P. Martin, P. -Å. Larson, V. Deshpande
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Analyzes the costs, and describes the implementation, of three hash-based join algorithms for a general purpose shared-memory multiprocessor. The three algorithms considered are the hashed loops, GRACE and hybrid algorithms. We also describe the results of a set of experiments that validate the cost models presented and demonstrate the relative performance of the three algorithms.
BTU: A Host Communication Benchmark
Authors: Kurt J. Maly, Ajay K. Gupta, Satish Mynam
Venue: Computer (1998)

In a distributed environment, CPU speed is only one factorý and not necessarily the most importantýin determining the time an application needs to complete its tasks. In some applications, the dominant factor may instead be communication. Most existing benchmark suites measure just the computational performance of a given workstation or the maximum network throughput under ideal conditions. The authors have developed the BTU (bits to the user) benchmark to take into account both concurrent activities within a workstation (such as CPU and I/O processes that compete for resources) and concurrent activities on the network. BTU can be used to more realistically assess a workstation's communication performance under a particular load. It provides detailed reports to evaluate hardware and software configurations and identify their communication bottlenecks. The BTU benchmark produces results at various levels of abstraction from a single number that characterizes average performance to a report of how all the individual test suite components performed.
Image Description and 3-D Reconstruction From Image Trajectories of Rotational Motion
Authors: H. S. Sawnhey, J. Oleinsis, A. R. Hanson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A new technique for reconstructing the 3-D structure and motion of a scene undergoing relative rotational motion with respect to the camera is discussed. Given image correspondences of point features tracked over many frames, a two-stage technique for reconstruction is presented. A grouping algorithm that exploits spatio-temporal constraints of the common motion to achieve a reliable description of discrete point correspondences as curved trajectories in the image plane is developed. In contrast, trajectories fitted to points independent of each other lead to arbitrary image descriptions and very inaccurate 3-D parameters. A new closed-form solution, under perspective projection, for the 3-D motion and location of points from the computed image trajectories is also presented. Both stages are applied to real image sequences with good results. This approach represents a first step in a longer-term research effort examining the role of explicit spatio-temporal organization in the interpretation of scenes from dynamic images.
Learning to Match the Schemas of Data Sources: A Multistrategy Approach
Authors: Anhai Doan, Pedro Domingos, Alon Halevy
Venue: Machine Learning (2003)

The problem of integrating data from multiple data sources&mdash;either on the Internet or within enterprises&mdash;has received much attention in the database and AI communities. The focus has been on building data integration systems that provide a uniform query interface to the sources. A key bottleneck in building such systems has been the laborious manual construction of semantic mappings between the query interface and the source schemas. Examples of mappings are &ldquo;element location maps to address&rdquo; and &ldquo;price maps to listed-price&rdquo;. We propose a multistrategy learning approach to automatically find such mappings. The approach applies multiple learner modules, where each module exploits a different type of information either in the schemas of the sources or in their data, then combines the predictions of the modules using a meta-learner. Learner modules employ a variety of techniques, ranging from Naive Bayes and nearest-neighbor classification to entity recognition and information retrieval. We describe the LSD system, which employs this approach to find semantic mappings. To further improve matching accuracy, LSD exploits domain integrity constraints, user feedback, and nested structures in XML data. We test LSD experimentally on several real-world domains. The experiments validate the utility of multistrategy learning for data integration and show that LSD proposes semantic mappings with a high degree of accuracy.
Analysis of a Semidiscrete Version of the Wigner Equation
Authors: Thierry Goudon
Venue: SIAM Journal on Numerical Analysis (2002)

We introduce a semidiscretized version of the Wigner equation---discretization concerning the velocity variable. We show that the corresponding discrete velocity problem is well-posed and permits us to approach the solution of the continuous problem when the mesh size of the discretization vanishes. The approximation shows spectral accuracy because the rate of convergence corresponds to the (Sobolev) regularity of the solution of the continuous problem. We also discuss the behavior of the solution with respect to the Planck constant.
Performance Evaluation of Dynamic Sharing of Processors in Two-Stage Parallel Processing Systems
Authors: J. H. Huang, L. Kleinrock
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The performance of job scheduling is studied in a large parallel processing system where a job is modeled as a concatenation of two stages which must be processed in sequence.P/sub i/ is the number of processors required by stage P as the total number ofprocessors in the system. A large parallel computing system is considered whereMax(/math/). For such systems, exact expressions for the mean system delay are obtained for variousjob models and disciplines. The results show that the priority should be given to jobsworking on the stage which requires fewer processors. The large parallel system condition is then relaxed to obtain the mean system time for two job models whenthe priority is given to the second stage. Moreover, a scale-up rule is introduced toobtain the approximated delay performance when the system provides more processorsthan the maximum number of processors required by both stages. An approximation model is given for jobs with more than two stages.