ppxscal/embedding_network huggingface dataset:
A New Relaxation Procedure in the Hopfield Network for Solving Optimization Problems
Authors: Xinchuan Zeng, Tony Martinez
Venue: Neural Processing Letters (1999)

When solving an optimization problem with a Hopfield network, a solution is obtained after the network is relaxed to an equilibrium state. The relaxation process is an important step in achieving a solution. In this paper, a new procedure for the relaxation process is proposed. In the new procedure, the amplified signal received by a neuron from other neurons is treated as the target value for its activation (output) value. The activation of a neuron is updated directly based on the difference between its current activation and the received target value, without using the updating of the input value as an intermediate step. A relaxation rate is applied to control the updating scale for a smooth relaxation process. The new procedure is evaluated and compared with the original procedure in the Hopfield network through simulations based on 200 randomly generated instances of the 10-city traveling salesman problem. The new procedure reduces the error rate by 34.6% and increases the percentage of valid tours by 194.6% as compared with the original procedure.
Linley on Linux: Linux Drives Digital Audio Revolution
Authors: Linley Gwennap
Venue: Linux Journal (2000)

The author plans to write about digital audio players, in particular the Rio Receiver that S3 has announced, which runs Linux. As MP3 replaces CDs, these devices will become pervasive, and Linux plays a key role in enabling them to be
Look-Ahead Procedures for Lanczos-Type Product Methods Based on Three-Term Lanczos Recurrences
Authors: Martin H. Gutknecht, Klaus J. Ressel
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

Lanczos-type product methods for the solution of large sparse non-Hermitian linear systems either square the Lanczos process or combine it with a local minimization of the residual. They inherit from the underlying Lanczos process the danger of breakdown. For various Lanczos-type product methods that are based on the Lanczos three-term recurrence, look-ahead versions are presented which avoid such breakdowns or near-breakdowns at the cost of a small computational overhead. Different look-ahead strategies are discussed and their efficiency is demonstrated by several numerical examples.
Empirical Performance Evaluation Methodology and Its Application to Page Segmentation Algorithms
Authors: Song Mao, Tapas Kanungo
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

While numerous page segmentation algorithms have been proposed in the literature, there is lack of comparative evaluation¿empirical or theoretical¿of these algorithms. In the existing performance evaluation methods, two crucial components are usually missing: 1) automatic training of algorithms with free parameters and 2) statistical and error analysis of experimental results. In this paper, we use the following five-step methodology to quantitatively compare the performance of page segmentation algorithms: 1) First, we create mutually exclusive training and test data sets with groundtruth, 2) we then select a meaningful and computable performance metric, 3) an optimization procedure is then used to search automatically for the optimal parameter values of the segmentation algorithms on the training data set, 4) the segmentation algorithms are then evaluated on the test data set, and, finally, 5) a statistical and error analysis is performed to give the statistical significance of the experimental results. In particular, instead of the ad hoc and manual approach typically used in the literature for training algorithms, we pose the automatic training of algorithms as an optimization problem and use the Simplex algorithm to search for the optimal parameter value. A paired-model statistical analysis and an error analysis are then conducted to provide confidence intervals for the experimental results of the algorithms. This methodology is applied to the evaluation of five page segmentation algorithms of which, three are representative research algorithms and the other two are well-known commercial products, on 978 images from the University of Washington III data set. It is found that the performance indices (average textline accuracy) of the Voronoi, Docstrum, and Caere segmentation algorithms are not significantly different from each other, but they are significantly better than that of ScanSoft's segmentation algorithm, which, in turn, is significantly better than that of X-Y cut.
Use of the Two-Dimensional Radon Transform to Generate a Taxonomy of Shape for the Characterization of Abrasive Powder Particles
Authors: Violet F. Leavers
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

A novel image processing technique for the extraction of parameters characteristic of the shape and angularity of abrasive powder particles is proposed. The image data are not analyzed directly. Information concerning angularity and shape is extracted from the parametric transformation of the 2D binarized edge map. The transformation process used, the Radon Transform, is one to many, that is, each image point generates in transform space the parameters of all the possible curves on which it may lie and the resulting distribution is an accumulation of that evidence. Once the image data are segmented, the technique has the potential to deliver a comprehensive numerical description of the shape and angularity of the particles under investigation without the need for further interaction by the operator. The parameters obtained are arranged into a Taxonomy according to their usefulness in categorizing the shapes under inspection. The technique is novel in that it offers an analytical definition of a corner and its apex and it automatically selects only those protrusions coincident with the convex hull of the shape and, hence, those most likely to contribute to the process of abrasion. The advantages and potential pitfalls of using the technique are illustrated and discussed using real image data.
A sorting problem and its complexity
Authors: Ira Pohl
Venue: Communications of the ACM (1972)

A technique for proving min-max norms of sorting algorithms is given. One new algorithm for finding the minimum and maximum elements of a set with fewest comparisons is proved optimal with this technique.
A memory coherence technique for online transient error recovery of FPGA configurations
Authors: Wei-Je Huang, Edward J. McCluskey
Venue: Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays (2001)

The partial reconfiguration feature of some of the current-generation Field Programmable Gate Arrays (FPGAs) can improve dependability by detecting and correcting errors in on-chip configuration data. Such an error recovery process can be executed online with minimal interference of user applications. However, because Look-up Tables (LUTs) in Configurable Logic Blocks (CLBs) of FPGAs can also implement memory modules for user applications, a memory coherence issue arises such that memory contents in user applications may be altered by the online configuration data recovery process. In this paper, we investigate this memory coherence problem and propose a memory coherence technique that does not impose extra constraints on the placement of memory-configured LUTs. Theoretical analyses and simulation results show that the proposed technique guarantees the memory coherence with a very small (on the order of 0.1%) execution time overhead in user applications.
Energy-delay efficient data storage and transfer architectures: circuit technology versus design methodology solutions
Authors: F. Catthoor
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Both in custom and programmable instruction-set processors for data-dominated multi-media applications, many of the architecture components are intended to solve the data transfer and storage issues. Recent experiments at several locations have clearly demonstrated that due to this fact, the main power (and largely also area) cost is situated in the memory units and the communication hardware. In this paper, the main reasons for this problem will be reviewed and a perspective will be provided on the expected near-future evolution. It will be shown that the circuit and process technology advances have been very significant in the past decade. Still, these are not sufficient to fully solve this power and area bottle-neck which has been created in the same period. Therefore, also several possible design methodology remedies will be proposed for this critical design issue, with emphasis on effective system-level memory management methodologies. These promise very large savings on energy-delay also on area for multi-media applications, while still meeting the real-time constraints.
Coordination of communication: effects of shared visual context on collaborative work
Authors: Susan R. Fussell, Robert E. Kraut, Jane Siegel
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

We outline some of the benefits of shared visual information for collaborative repair tasks and report on a study comparing collaborative performance on a manual task by workers and helpers who are located side-by-side or connected via audio-video or audio-only links. Results show that the dyads complete the task more quickly and accurately when helpers are co-located than when they are connected via an audio link. However, they didn't achieve similar efficiency gains when they communicated through an audio/video link. These results demonstrate the value of a shared visual work space, but raise questions about the adequacy of current video communication technology for implementing it.
Finding Curvilinear Features in Spatial Point Patterns: Principal Curve Clustering with Noise
Authors: Derek C. Stanford, Adrian E. Raftery
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Clustering about principal curves combines parametric modeling of noise with nonparametric modeling of feature shape. This is useful for detecting curvilinear features in spatial point patterns, with or without background noise. Applications include the detection of curvilinear minefields from reconnaissance images, some of the points in which represent false detections, and the detection of seismic faults from earthquake catalogs. Our algorithm for principal curve clustering is in two steps: The first is hierarchical and agglomerative (HPCC) and the second consists of iterative relocation based on the Classification EM algorithm (CEM-PCC). HPCC is used to combine potential feature clusters, while CEM-PCC refines the results and deals with background noise. It is important to have a good starting point for the algorithm: This can be found manually or automatically using, for example, nearest neighbor clutter removal or model-based clustering. We choose the number of features and the amount of smoothing simultaneously, using approximate Bayes factors.
Validity Measures for the Fuzzy Cluster Analysis of Orientations
Authors: Reginald E. Hammah, John H. Curran
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Fuzzy K-means clustering can be applied to the automatic identification of sets in discontinuity data after suitable adaptation of the algorithm. To establish the number of clusters in a data set, modified versions of the validity measures of Gath and Geva, Xie-Beni and Fukuyama-Sugeno are presented in this paper.
Principles of package design
Authors: Bertrand Meyer
Venue: Communications of the ACM (1982)

Subprogram packages are groups of related subroutines used to extend the available facilities in a programming system. The results of developing several such packages for various applications are presented, with a distinction made between external and internal design criteria&mdash; what properties packages should offer to their users and the guidelines designers should follow in order to provide them. An important issue, the design of reusable software, is thus addressed, and the concept of abstract data types proposed as a desirable solution.
Functional extension of structural logic optimization techniques
Authors: J. A. Espejo, L. Entrena, E. San Millán, E. Oliás
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

This work provides a generalization of structural logic optimization methods to general boolean networks. With this generalization, the nodes of the network are no longer restricted to simple gates and can be functions of any size. Within this framework, we present necessary and sufficient conditions to identify all the possible functional expansions of a node that allow to eliminate a wire elsewhere in the network. These conditions are also given for the case of multiple variable expansion, providing an incremental mechanism to perform functional transformations involving any number of variables that can be applied in a very efficient manner. On the other hand, we will show in this paper that relevant simplifications can be obtained when this framework is applied to the particular case of AND-OR-NOT networks, resulting in important savings in the computational effort. When compared to previous approaches, the experimental results show an important reduction in the number of computations required.
Editorial
Authors: Krzysztof R. Apt, Antonis C. Kakas, Fariba Sadri
Venue: ACM Transactions on Computational Logic (TOCL) (2001)

This special issue of the ACM Transactions on Computational Logic (TOCL) is dedicated to Robert A. Kowalski, or as he is better known, to Bob Kowalski, on the occasion of his 60th birthday. Throughout his distinguished research career Bob has been interested in various forms of logic-based reasoning from the computer science point of view. This novel view of logic has had an impact on a number of areas, including programming languages, databases, artificial intelligence, natural language processing, and more recently machine learning. In the late sixties and early seventies Bob contributed to the development of the theory of resolution by proposing a number of modifications to the original proposal of Alan Robinson. One of the notions that withstood the test of time is his and Hayes concept of semantic trees. This research eventually led him to the seminal 1974 paper Predicate Logic as a Programming Language which is at the roots of the logic programming paradigm. His early work with Maarten van Emden provided a direction for the subsequent research on procedural and declarative semantics of programming languages within the specific field of logic programming. In turn, his influential dictum "Algorithm+Logic=Control" has shaped our views on the essence of declarative programming within the logic programming framework and has had a large impact on the design of new control mechanisms for this approach to programming. His subsequent research revealed the rich potential of the logic programming paradigm. He showed how legal, metalevel, and commonsense reasoning can naturally be formalized by means of logic programs. His work with Marek Sergot on the event calculus had a long-standing impact on the research effort of representing temporal knowledge and formalizing commonsense reasoning. His research on verification of integrity constraints for database systems became highly relevant in deductive and temporal databases, while his work on abductive reasoning and argumentation was influential for mechanized legal and diagnostic reasoning. More recently, his work on multiagent systems has helped shape new approaches to building intelligent distributed systems. Several of these themes can be found in the collection of papers that constitute this special issue. All of these papers were solicited directly by the guest editors but, conforming to the high standards of TOCL, went through the usual rigorous refereeing process. We would like to thank the authors of the contributed papers for their willingness and interest in contributing to this issue. We also thank the referees for their precious time in providing helpful reviews of the submissions. And to Bob we extend our best wishes and hope he will agree with us that this special issue shows, at least partly, the long-term impact of his research.
A modified inversion procedure for product form of the inverse linear programming codes
Authors: L. J. Larsen
Venue: Communications of the ACM (1962)

This paper describes a new algorithm for the selection of the pivot row in matrix inversion when using the product form of the inverse. This algorithm has been developed for linear programming codes; however, it would be valuable for the inversion of any non-dense matrix. The procedures described in this paper have been thoroughly tested and have been in operation on the Esso Research and Engineering IBM 7090 computer for nine months. Substantial computer cost savings have been realized because of this procedure.
Incompressible flow network calculations
Authors: H. N. Cantrell
Venue: Communications of the ACM (1963)

A general method for the calculation of flows and pressures in fluid flow networks is presented. The method is applicable to computer use.
Optimal sequencing by hybridization in rounds
Authors: Alan M. Frieze, Bjarni V. Halldórsson
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

Sequencing by hybridization (SBH) is a method for reconstructing a sequence over a small finite alphabet from a collection of probes (substrings). Substring queries can be arranged on an array (SBH chip) and then a combinatorial method is used to construct the sequence from its collection of probes. Technological constraints limit the number of substring queries that can be placed on a single SBH chip. We develop an idea of Margaritis and Skiena and propose an algorithm that uses a series of small SBH chips to sequence long strings while the number of probes used matches the information theoretical lower bound up to a constant factor.
Estimating block accesses and number of records in file management
Authors: To-Yat Cheung
Venue: Communications of the ACM (1982)

We consider the problems of estimating the number of secondary storage blocks and the number of distinct records accessed when a transaction consisting of possibly duplicate requested records is presented to a file management system. Our main results include (1) a new formula for block access estimation for the case where the requested records may have duplications and their ordering in immaterial and (2) a simple formula for estimating the number of distinct records in the transaction.
Logical construction of software
Authors: Donald R. Chand, Surya B. Yadav
Venue: Communications of the ACM (1980)

The authors contend that it is both possible and necessary to clearly demark and explicitly define the transition between the software design and software implementation phases of the software life cycle. The output of the software design phase is defined to be a logical design of software, and the logical design can be described explicitly if the software is viewed as a system of data sets and data transforms. Logical Construction of Software (LCS) is a software design methodology that guides the designer in defining and describing these software components and their relationships. The methodology is illustrated via a practical application.
On the emulation of flowcharts by decision tables
Authors: Art Lew
Venue: Communications of the ACM (1982)

Any flowchart can be emulated by a decision table, whose complexity depends on that of the flowchart. It may be necessary, however, to introduce a new control variable with associated tests and sets or to permit changes in execution sequences provided action-test independence holds. Two measures of decision table complexity are discussed and interrelated. Finally, conditions and procedures for reducing complexity are presented.
A reductionist approach to a course on programming languages
Authors: Michael R. Wick, Daniel E. Stevenson
Venue: ACM SIGCSE Bulletin (2001)

The Programming Languages course is often a critical turning point in an undergraduate education where students begin to think more abstractly about programming languages and the design paradigms that use them. Traditional approaches to presenting this material often fail to achieve a number of important goals. We present an approach to Programming Languages that uses a single demonstration language (Scheme) and a collection of fundamental building blocks to study a variety of programming paradigms.
A quick check of network performance
Authors: Jeffrey T. Hicks, John Q. Walker
Venue: International Journal of Network Management (2001)

Have you ever tried to measure the response time across a network&quest; Do you sometimes wonder what throughput rate you&apos;re getting over a particular link&quest; Are you concerned about the impact of adding streaming multimedia traffic to a network&quest; Would you like to know the exact route your data is taking&quest; Individual tools are available to measure the throughput and response time of your applications, trace a network route, or test a network&apos;s capacity for handling multimedia traffic. But a software tool called Qcheck can perform all of these tasks and more, while providing a quick check of network performance. Copyright &copy; 2001 John Wiley Sons, Ltd.
Permutation enumeration: four new permutation algorithms
Authors: F. M. Ives
Venue: Communications of the ACM (1976)

Classical permutation enumeration algorithms encounter special cases requiring additional computation every nth permutation when generating the n! permutations on n marks. Four new algorithms have the attribute that special cases occur every n(n&mdash;1) permutations. Two of the algorithms produce the next permutation with a single exchange of two marks. The other two algorithms infrequently exchange more than two marks, but the rules for generating the next permutation are very simple. Performance tests which have counted execution of assignment statements, comparisons, arithmetic operations, and subscripted array references have shown superiority of the new algorithms compared to Boothroyd's implementation of M.B. Well's algorithm and Ehrlich's implementation of the Johnson-Trotter algorithm.
Algorithms to reveal properties of floating-point arithmetic
Authors: Michael A. Malcolm
Venue: Communications of the ACM (1972)

Two algorithms are presented in the form of Fortran subroutines. Each subroutine computes the radix and number of digits of the floating-point numbers and whether rounding or chopping is done by the machine on which it is run. The methods are shown to work on any &ldquo;reasonable&rdquo; floating-point computer.
A scalable methodology for cost estimation in a transformational high-level design space exploration environment
Authors: J. Gerlach, W. Rosenstiel
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Objective of the methodology presented in this paper is to perform design space exploration on a high level of abstraction by applying high-level transformations. To realize a design loop which is close and settled on upper design levels, a high-level estimation step is integrated. In this paper, several estimation methodologies fixed on different states of the high-level synthesis process are examined with respect to their aptitude on controlling the transformational design space exploration process. Estimation heuristics for several design characteristics are derived and experimentally validated.