ppxscal/embedding_network huggingface dataset:
Knowledge Incorporation into Neural Networks From Fuzzy Rules
Authors: Yaochu Jin, Bernhard Sendhoff
Venue: Neural Processing Letters (1999)

The incorporation of prior knowledge into neural networks can improve neural network learning in several respects, for example, a faster learning speed and better generalization ability. However, neural network learning is data driven and there is no general way to exploit knowledge which is not in the form of data input-output pairs. In this paper, we propose two approaches for incorporating knowledge into neural networks from fuzzy rules. These fuzzy rules are generated based on expert knowledge or intuition. In the first approach, information from the derivative of the fuzzy system is used to regularize the neural network learning, whereas in the second approach the fuzzy rules are used as a catalyst. Simulation studies show that both approaches increase the learning speed significantly.
A note on multiplying boolean matrices II
Authors: D. R. Comstock
Venue: Communications of the ACM (1964)

In a note by Baker [1], a method is given for getting the limiting connectivity matrix, B, of a matrix whose entries are Boolean 0's and 1's. Harary [2] suggests determining An-1 since An-1 = An = &middot;&middot;&middot; , where n is the order of the matrix. The purpose of this note is to give a method for determining An-1. The method is also applicable to finding the output matrix of a switching network as described in [3] and [4] where again An-1 = An = &middot;&middot;&middot; , but A now has Boolean switching functions as entries instead of 0's and 1's.
Soviet cybernetics and computer sciences, 1960
Authors: Edward A. Feigenbaum
Venue: Communications of the ACM (1961)

This article records observations on Soviet research and technology in cybernetics and computer science, made by the author during a visit to the Soviet Union as a delegate to the IFAC Congress on Automatic Control held in Moscow in the summer of 1960.
The economics of designing generalized software
Authors: Frank Milne, Ron Weber
Venue: Communications of the ACM (1983)

The choice of the attributes to be incorporated in a generalized software package is a complex design task, much like the choice of the characteristics of the basic model and the options to be offered when a new automobile is being designed. Some empirical evidence available suggests that the choices made by generalized software designers are not always well founded; for example, some functions included in the software are hardly, if ever, used, while functions that would be used extensively are not available. To assist the designer, we formulate a market model showing the interactions between the producers (designers) of generalized software and the consumers (users) of generalized software. The model provides insight into those factors that affect the demand for a package and the variables to be considered in a profit-maximizing decision.
System of thermal simulation of the flip chip (abstract only)
Authors: Dmytro Fedasyuk, Evgenia Levus, Juriy Nazar
Venue: Proceedings of the symposium on Contemporary computing in Ukraine (2000)

Thermal three-dimensional model built is based on formalisation of conjugate problem of heat exchange in die and substrate with various boundary conditions. Distributed software system developed on the basis of analytical solution of the physical-mathematical problem has been used for the computations. For decreasing of the calculation time the method for parallel processing has been developed. Brought the results of application.
Self-Organization of Pulse-Coupled Oscillators with Application to Clustering
Authors: Mohamed Ben Hadj Rhouma, Hichem Frigui
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

We introduce an efficient synchronization model that organizes a population of Integrate and Fire oscillators into stable and structured groups. Each oscillator fires synchronously with all the others within its group, but the groups themselves fire with a constant phase difference. The structure of the synchronized groups depends on the choice of the coupling function. We show that by defining the interaction between oscillators according to the relative distance between them, our model can be used as a general clustering algorithm. Unlike existing models, our model incorporates techniques from relational and prototype-based clustering methods and results in a clustering algorithm that is simple, efficient, robust, unbiased by the size of the clusters, and that can find an arbitrary number of clusters. In addition to helping the model self-organize into stable groups, the synergy between clustering and synchronization reduces the computational complexity significantly. The resulting clustering algorithm has several advantages over conventional clustering techniques. In particular, it can generate a nested sequence of partitions and it can determine the optimum number of clusters in an efficient manner. Moreover, since our approach does not involve optimizing an objective function, it is not sensitive to initialization and it can incorporate nonmetric similarity measures. We illustrate the performance of our algorithms with several synthetic and real data sets.
A Comparison of Three Rounding Algorithms for IEEE Floating-Point Multiplication
Authors: Guy Even, Peter-Michael Seidel
Venue: IEEE Transactions on Computers (2000)

A new IEEE compliant floating-point rounding algorithm for computing the rounded product from a carry-save representation of the product is presented. The new rounding algorithm is compared with the rounding algorithms of Yu and Zyner [26] and of Quach et al. [17]. For each rounding algorithm, a logical description and a block diagram is given, the correctness is proven, and the latency is analyzed. We conclude that the new rounding algorithm is the fastest rounding algorithm, provided that an injection (which depends only on the rounding mode and the sign) can be added in during the reduction of the partial products into a carry-save encoded digit string. In double precision format, the latency of the new rounding algorithm is $12$ logic levels compared to $14$ logic levels in the algorithm of Quach et al. and $16$ logic levels in the algorithm of Yu and Zyner.
A hybrid indoor navigation system
Authors: Andreas Butz, Jörg Baus, Antonio Krüger, Marco Lohse
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

We describe a hybrid building navigation system consisting of stationary information booths and a mobile communication infrastructure feeding small portable devices. The graphical presentations for both the booths and the mobile devices are generated from a common source and for the common task of way finding, but they use different techniques to convey possibly different subsets of the relevant information. The form of the presentations is depending on technical limitations of the output media, accuracy of location information, and cognitive restrictions of the user. We analyze what information needs to be conveyed, how limited resources influence the presentation of this information, and argue, that by generating all different presentations in a common framework, a consistent appearance across devices can be achieved and that the different device classes can complement each other in facilitating the navigation task.
Static and kinetic geometric spanners with applications
Authors: Menelaos I. Karavelas, Leonidas J. Guibas
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions is a spanner graph of its vertices as well. We extend the notion of spanner graphs to environments with obstacles and show that both the Constrained Delaunay Triangulation and bounded aspect ratio conforming triangulations are spanners with respect to the corresponding visibility graph. We also show how to kinetize the Constrained Delaunay Triangulation. Using such time-varying triangulations we describe how to maintain sets of near neighbors for a set of moving points in both unconstrained and constrained environments. Such nearest neighbor maintenance is needed in many virtual environments where nearby agents interact. Finally, we show how to use the Constrained Delaunay Triangulation in order to maintain the relative convex hull of a set of points moving inside a simple polygon.
A comparison of 650 programming methods
Authors: T. B. Curtz, J. F. Riordan, M. Spohn
Venue: Communications of the ACM (1960)

An evaluation of an automatic programming method can be made from many points of view. Two recent articles give evaluations of two compilers for the IBM 650 based on the method of decomposition of compiler statements into machine language [1, 2]. This paper briefly describes these two compilers, appraises them for the ease with which they can be used and for the efficiency of the programs they produce. While this approach is of less theoretical interest than the evaluations presented in the referenced articles, it is of substantially more practical significance to a programmer or to an installation which is seeking to answer the following questions: Should a compiler be used? If so, which compiler? It will be noted that no universal answers are possible since such factors as relative costs and availability of machine time and programmer time, the skill and predilections of programmers, and the type of problems are of major importance. Nevertheless, the results presented below, we believe, provide the best available guide for arriving at reasonable answers.
Concepts of use in contour map processing
Authors: Stephen P. Morse
Venue: Communications of the ACM (1969)

Generalized techniques are developed whose use can simplify the solution of problems relating to contour maps. One of these techniques makes use of the topological properties of contour maps. The topology is represented by a graphical structure in which adjacent contour lines appear as connected nodes. Another generalized technique consists of utilizing geometrical properties to determine the characteristics of straight lines drawn on the contour map. Both of these techniques have been applied to the problem of locating the ground track of an aircraft from elevation readings obtained during a flight.
Comments on a paper by Lowe
Authors: Kirk Sattley, Robert Millstein
Venue: Communications of the ACM (1970)

We have read with much interest the paper &ldquo;Automatic Segmentation of Cyclic Program Structures Based on Connectivity and Processor Timing&rdquo; by T. C. Lowe [Comm. ACM 13, 1 (Jan. 1970), 3-6, 9], and we congratulate the author on the clarity of his exposition. However, we're afraid we must question the technique he describes.
A Regularized Sampling Method for Solving Three-Dimensional Inverse Scattering Problems
Authors: David Colton, Klaus Giebermann, Peter Monk
Venue: SIAM Journal on Scientific Computing (1999)

The inverse scattering problem under consideration is to determine the shape of an obstacle in $\RE^3$ from a knowledge of the time harmonic incident acoustic wave and the far field pattern of the scattered wave with frequency in the resonance region. A method for solving this nonlinear and improperly posed problem is presented which is based on solving a linear integral equation of the first kind and avoids the use of nonlinear optimization methods. Numerical examples are given showing the practicality of this new approach.
On SDSI's linked local name spaces
Authors: Martín Abadi
Venue: Journal of Computer Security (1998)

Rivest and Lampson have recently introduced SDSI, a Simple Distributed Security Infrastructure. One of the important innovations of SDSI is the use of linked local name spaces. This paper suggests a logical explanation of SDSIs local name spaces, as a complement to the operational explanation given in the SDSI definition.
Session summary: distribution and real-time
Authors: Michael González Harbour, Luis Miguel Pinho
Venue: Proceedings of the 10th international workshop on Real-time Ada workshop (2001)

The objective of this session was to discuss aspects related to the integration of real-time and distribution capabilities in Ada. Special focus was given to:- the integration of the Real-Time and Distributed Systems Annexes;- Ravenscar and Distributed Systems.
The CRAY-1 computer system
Authors: Richard M. Russell
Venue: Communications of the ACM (1978)

This paper describes the CRAY-1, discusses the evolution of its architecture, and gives an account of some of the problems that were overcome during its manufacture. The CRAY-1 is the only computer to have been built to date that satisfies ERDA's Class VI requirement (a computer capable of processing from 20 to 60 million floating point operations per second) [1]. The CRAY-1's Fortran compiler (CFT) is designed to give the scientific user immediate access to the benefits of the CRAY-1's vector processing architecture. An optimizing compiler, CFT, &ldquo;vectorizes&rdquo; innermost DO loops. Compatible with the ANSI 1966 Fortran Standard and with many commonly supported Fortran extensions, CFT does not require any source program modifications or the use of additional nonstandard Fortran statements to achieve vectorization. Thus the user's investment of hundreds of man months of effort to develop Fortran programs for other contemporary computers is protected.
The digital simulation of river plankton population dynamics
Authors: R. Mark Claudson
Venue: Communications of the ACM (1975)

This paper deals with the development of a mathematical model for and the digital simulation in Fortran IV of phytoplankton and zooplankton population densities in a river using previously developed rate expressions. In order to study the relationships between the ecological mechanisms involved, the simulation parameters were varied illustrating the response of the ecosystem to different conditions, including those corresponding to certain types of chemical and thermal pollution. As an investigation of the accuracy of the simulation methods, a simulation of the actual population dynamics of Asterionella in the Columbia River was made based on approximations of conditions in that river. Although not totally accurate, the simulation was found to predict the general annual pattern of plankton growth fairly well and, specifically, revealed the importance of the annual velocity cycle in determining such patterns. In addition, the study demonstrates the usefulness of digital simulations in the examinations of certain aquatic ecosystems, as well as in environmental planning involving such examinations.
AUTOMAST: automatic mathematical analysis and symbolic translation
Authors: William E. Ball, Robert I. Berns
Venue: Communications of the ACM (1966)

A procedure for numerically solving systems of ordinary differential equations is shown to also generate symbolic solutions. The procedure is based on a finite Taylor series expansion that includes an estimate of the error in the final result. A computer program is described that reads in a system of such equations and then generates the expansions for all of the dependent variables. The expansions are determined symbolically, hence any non-numeric parameters in the original equations are carried automatically into the final expansions. Thus the exact influence of any parameters on the problem solution can be easily displayed.
Static analysis tools for soft-core reviews and audits
Authors: S. Olcoz, A. Castellvi, M. Garcia, J.-A. Gómez
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Three navigation tools are presented to statically and interactively analyze Soft-Cores described in VHDL. These tools ease the adoption of mechanisms to perform reviews and audits procedures similar to those adopted in software development. These navigation tools help to better understand and reuse VHDL Soft-Cores. The three navigators are integrated in a VHDL-ICE environment, to get design data management support.
Hiding Cliques for Cryptographic Security
Authors: Ari Juels, Marcus Peinado
Venue: Designs, Codes and Cryptography (2000)

We demonstrate how a well studied combinatorial optimization problem may be used as a new cryptographic primitive. The problem in question is that of finding a "large" clique in a random graph. While the largest clique in a random graph with n vertices and edge probability p is very likely to be of size about 2 \log_{1/p}{n}, it is widely conjectured that no polynomial-time algorithm exists which finds a clique of size \geq (1 + \epsilon)\log_{1/p}n with significant probability for any constant \epsilon > 0. We present a very simple method of exploiting this conjecture by ``hiding'' large cliques in random graphs. In particular, we show that if the conjecture is true, then when a large clique&mdash;of size, say, (1 + 2 \epsilon) \log_{1/p}{n}&mdash;is randomly inserted (``hidden'') in a random graph, finding a clique of size \geq (1 + \epsilon)\log_{1/p}{n} remains hard. Our analysis also covers the case of high edge probabilities which allows us to insert cliques of size up to n^{1/4-\epsilon} ( \epsilon>0). Our result suggests several cryptographic applications, such as a simple one-way function.
Dimensions of diversity in design of telerehabilitation systems for universal usability
Authors: G. Lathan
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

Telerehabilitation is defined as the application of multimedia technologies to deliver rehabilitation services to consumers at a distance &mdash; and to support independent living for individuals with disabilities. The panelists are members of the r d team of the Rehabilitation Engineering Research Center (RERC) on Telerehabilitation, the center on this topic funded in October, 1998 by the National Institute on Disability and Rehabilitation Research (NIDRR). They address the challenges to universal usability posed by the diversity of consumers and professionals in telerehab, illustrating their comments with their own projects. They also take part in a real-time design-for-usability exercise and engage the audience in their deliberations.
A comparison of next-fit, first-fit, and best-fit
Authors: Carter Bays
Venue: Communications of the ACM (1977)

&ldquo;Next-fit&rdquo; allocation differs from first-fit in that a first-fit allocator commences its search for free space at a fixed end of memory, whereas a next-fit allocator commences its search wherever it previously stopped searching. This strategy is called &ldquo;modified first-fit&rdquo; by Shore [2] and is significantly faster than the first-fit allocator. To evaluate the relative efficiency of next-fit (as well as to confirm Shore's results) a simulation was written in Basic Plus on the PDP-11, using doubly linked lists to emulate the memory structure of the simulated computer. The simulation was designed to perform essentially in the manner described in [2]. The results of the simulation of the three methods show that the efficiency of next-fit is decidedly inferior to first-fit and best-fit when the mean size of the block requested is less than about 1/16 the total memory available. Beyond this point all three allocation schemes have similar efficiencies.
The aliasing problem in computer-generated shaded images
Authors: Franklin C. Crow
Venue: Communications of the ACM (1977)

Certain defects, such as jagged edges and disappearing detail, have long been an annoyance in digitally generated shaded images. Although increasing the resolution or defocusing the display can attenuate them, an understanding of these defects leads to more effective methods. This paper explains the observed defects in terms of the aliasing phenomenon inherent in sampled signals and discusses prefiltering as a recognized cure. A method for evaluating filters is presented, the application of prefiltering to hidden-surface algorithms is discussed, and an implementation of a filtering tiler is shown accompanied by examples of its effectiveness.
Efficient Address Generation for Affine Subscripts in Data-Parallel Programs
Authors: Kuei-Ping Shih, Jang-Ping Sheu, Chih-Yung Chang
Venue: The Journal of Supercomputing (2000)

Address generation for compiling programs, written in HPF, to executable SPMD code is an important and necessary phase in a parallelizing compiler. This paper presents an efficient compilation technique to generate the local memory access sequences for block-cyclically distributed array references with affine subscripts in data-parallel programs. For the memory accesses of an array reference with affine subscript within a two-nested loop, there exist repetitive patterns both at the outer and inner loops. We use tables to record the memory accesses of repetitive patterns. According to these tables, a new start-computation algorithm is proposed to compute the starting elements on a processor for each outer loop iteration. The complexities of the table constructions are O(k+s2), where k is the distribution block size and s2 is the access stride for the inner loop. After tables are constructed, generating each starting element for each outer loop iteration can run in O(1) time. Moreover, we also show that the repetitive iterations for outer loop are Pk/gcd(Pk,&thinsp;s1), where P is the number of processors and s1 is the access stride for the outer loop. Therefore, the total complexity to generate the local memory access sequences for a block-cyclically distributed array with affine subscript in a two-nested loop is O(Pk/gcd(Pk,&thinsp;s1)+k+s2).
On matrix program schemes
Authors: Iu I. Ianov
Venue: Communications of the ACM (1958)

Considered are finite sets of objects A1, &hellip;, An which we will call operations and two-place (logical) variables p1, &hellip;, pk taking the values 0 and 1.
A comparison of simulation event list algorithms
Authors: Jean G. Vaucher, Pierre Duval
Venue: Communications of the ACM (1975)

Four algorithms are considered which can be used to schedule events in a general purpose discrete simulation system. Two of the algorithms are new, one is based on an end-order tree structure for event notices, and another uses an indexed linear list. The algorithms are tested with a set of typical stochastic scheduling distributions especially chosen to show the advantages and limitations of the algorithms. The end-order tree algorithm is shown to be an advantageous, immediate replacement for the algorithm in use with current simulation languages. The most promising algorithm uses the indexed list concept. It will require an adaptive routine before it can be employed in general purpose simulators, but its performance is such that further study would be fruitful.
Comments on Moorer's music and computer composition
Authors: Stephen W. Smoliar
Venue: Communications of the ACM (1972)

J.A. Moorer's &ldquo;Music and Computer Composition&rdquo; [1] was a distressing communication. While I realize that musical expertise is probably beyond the realm of the editorial staff, I must object to both the naivet&eacute; and faulty reasoning on the musical side of this article. In a nutshell, Moorer presents us with many paragraphs of philosophical meanderings to back up a few results which are, by his own admission, inadequate. From this he concludes, &ldquo;It is also hoped that this experiment may help dispel doubts that musical composition is &lsquo;sacred&rsquo; and unreachable by mechanical methods.&rdquo; From any serious musical point of view, such a conclusion is almost vacuous.