ppxscal/embedding_network huggingface dataset:
n-Dimensional Moment Invariants and Conceptual Mathematical Theory of Recognition n-Dimensional Solids
Authors: Alexander G. Mamistvalov
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1998)

The proof of the generalized fundamental theorem of moment invariants (GFTMI) [1] is presented for n-dimensional pattern recognition. In 1962, Hu [2] formulated the fundamental theorem of moment invariants (FTMI) for two-dimensional pattern recognition, that is subjected to general linear transformation. In 1970, I showed that the FTMI was in fact incorrect, and the corrected FTMI (CFTMI) was formulated [3], which was generalized by us for n-dimensional case in 1974 [1] without proof. On the basis of GFTMI, the moment invariants of affine transformation and subgroups of affine transformation are constructed. Using these invariants, the conceptual mathematical theory of recognition of geometric figures, solids, and their n-dimensional generalizations is worked out. By means of this theory, it is possible for the first time to analyze scenes consisting not only of polygons and polyhedra, as so far, but also scenes consisting of geometric figures and solids with curved contours and surfaces, respectively. In general, it is the author's opinion that this theory is a useful step toward the essential development of robot vision and toward creating machine intelligence¿to make machines able to think by means of geometric concepts of different generalities and dimensions, and by associations of these concepts.
On the Dimension of the Hull
Authors: Nicolas Sendrier
Venue: SIAM Journal on Discrete Mathematics (1997)

The hull [Assmus, Jr. and Key, Discrete Math., 83 (1990), pp. 161--187], [Assmus, Jr. and Key, Designs and Their Codes, Cambridge University Press, 1992, p. 43] of a linear code is defined to be its intersection with its dual. We give here the number of distinct q-ary linear codes which have a hull of given dimension.We will prove that, asymptotically, the proportion of q-ary codes whose hull has dimension l is a positive constant that depends only on l and q and consequently that the average dimension of the hull is asymptotically a positive constant depending only on q.
Automatic Plankton Image Recognition
Authors: Xiaoou Tang, W. Kenneth Stewart, He Huang, Scott M. Gallager, Cabell S. Davis, Luc Vincent, Marty Marra
Venue: Artificial Intelligence Review (1998)

Plankton form the base of the food chain in the ocean and are fundamental to marine ecosystem dynamics. The rapid mapping of plankton abundance together with taxonomic and size composition is very important for ocean environmental research, but difficult or impossible to accomplish using traditional techniques. In this paper, we present a new pattern recognition system to classify large numbers of plankton images detected in real time by the Video Plankton Recorder (VPR), a towed underwater video microscope system. The difficulty of such classification is compounded because: 1) underwater images are typically very noisy, 2) many plankton objects are in partial occlusion, 3) the objects are deformable and 4) images are projection variant, i.e., the images are video records of three-dimensional objects in arbitrary positions and orientations. Our approach combines traditional invariant moment features and Fourier boundary descriptors with gray-scale morphological granulometries to form a feature vector capturing both shape and texture information of plankton images. With an improved learning vector quantization network classifier, we achieve 95% classification accuracy on six plankton taxa taken from nearly 2,000 images. This result is comparable with what a trained biologist can achieve by using conventional manual techniques, making possible for the first time a fully automated, at sea-approach to real-time mapping of plankton populations.
Efficient retrieval of composite multimedia objects in the JINSIL distributed system
Authors: Junehwa Song, Asit Dan, Dinkar Sitaram
Venue: Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (1997)

In a distributed environment, presentation of structured, composite multimedia information poses new challenges in dealing with variable bandwidth (BW) requirement and synchronization of media data objects. The detailed knowledge of BW requirement obtained by analyzing the document structure can be used to create a prefetch schedule that results in efficient utilization of system resources. A distributed environment consists of various system components that are either dedicated to a client or shared across multiple clients. Shared system components could benefit from Fine Granularity Advanced Reservation (FGAR) of resources based on true BW requirement. Prefetching by utilizing advance knowledge of BW requirement can further improve resource utilization. In this paper, we describe the JINSIL retrieval system that takes into account the available bandwidth and buffer resources and the nature of sharing in each component on the delivery path. It reshapes BW requirement, creates prefetch schedule for efficient resource utilization in each component, and reserves necessary BW and buffer. We also consider good choices for placement of prefetch buffers across various system components.
Sequential and Parallel Splitting Methods for Bilinear Control Problems in Hilbert Spaces
Authors: K. Kunisch, X.-C. Tai
Venue: SIAM Journal on Numerical Analysis (1997)

An augmented Lagrangian method with second-order update is developed, and its relationship to the sequential quadratic programming method is described. The rate of convergence proof depends on a second-order sufficient optimality condition, which is shown to be satisfied for a class of nonlinear optimal control problems of tracking type. Numerical examples are included which demonstrate the globalizing effect of the augmented Lagrangian method.
Classification of Some Optimal Ternary Linear Codes of Small Length
Authors: Marijn Van Eupen, Petr Lisonvek
Venue: Designs, Codes and Cryptography (1997)

A classification is given of some optimal ternary linear codes of small length. Dimension 2 is classified for every minimum distance. Dimension 3, 4 and 5 is classified up to minimum distance 12. For higher dimension a classification is given where possible.
Hardware/software co-verification (panel)
Authors: Gary Smith, Michel Courtoy, Marion Kenefick, Brian Bailey, Kurt Keutzer, Amr Mohsen, Richard Moseley, Jim Rowson, Geoff Bunza, Willis Hendley
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

Over the recent past, the focus of EDA tools has been on tackling the chip issues. Today, system design issues areemerging as the top concerns of design teams. The issues include the inability to simulate at the system level,incomplete and inaccurate system specs, and immature hardware/software co-design.
Borrow, copy or steal?: loans and larceny in the orthodox canonical form
Authors: Anthony J. H. Simons
Venue: ACM SIGPLAN Notices (1998)

Dynamic memory management in C++ is complex, especially across the boundaries of library abstract data types. C++ libraries designed in the orthodox canonical form (OCF) alleviate some of the problems by ensuring that classes which manage any kind of heap structures faithfully copy and delete these. However, in certain common circumstances, OCF heap structures are wastefully copied multiple times. General reference counting is not an option in OCF, since a shared body violates the intended value semantics; although a copy-on-write policy can be made to work with borrowed heap structures. A simpler ownership policy, based on larceny, allows low-level memory manager objects to steal heap structures from temporary variables, in properly isolated circumstances. Various strategies for regulating theft are presented, ranging from pilfer-constructors to locks on heap data. Larceny has similarities with other transfer of ownership patterns, but is more a core implementation technique designed to improve the efficiency and effectiveness of OCF-conformant libraries.
Comparison of Two Integrated BiCMOS 950 MHz Direct I/QModulators
Authors: Juha Häkkinen, Timo Rahkonen, Juha Kostamovaara
Venue: Analog Integrated Circuits and Signal Processing (1998)

Two integrated direct I/Q modulators suitable for direct upconversion with an output frequency of 950 MHz and baseband frequencies of 60 to 500 kHz are fabricated in a 1.2 &micro;m and 0.8 &micro;m BiCMOS process, respectively, and their performance under various operating conditions is discussed. The modulators use different phase shifter topologies, one of which is based on digital CML latches and the other on differential pairs with resistive and capacitive emitter degeneration. Both circuits are operated using a single 5 V supply and they consume 50 mA or 115 mA depending on the topology. The main properties of the CML modulator are, for example, an output power of &minus;11 &plusmn; 0.5 dBm at 100 MHz and &minus;15 &plusmn; 2.25 dBm at 950 MHz over the temperature range of &minus;10 to &plus;85&deg;C, LO suppression of 38 dBc and image rejection of 41 dBc.
Recursive hashing functions for n-grams
Authors: Jonathan D. Cohen
Venue: ACM Transactions on Information Systems (TOIS) (1997)

Many indexing, retrieval, and comparison methods are based on counting or cataloguing n-grams in streams of symbols. The fastest method of implementing such operations is through the use of hash tables. Rapid hashing of consecutive n-grams is best done using a recursive hash function, in which the hash value of the current n-gram is drived from the hash value of its predecessor. This article generalizes recursive hash functions found in the literature and proposes new methods offering superior performance. Experimental results demonstrate substantial speed improvement over conventional approaches, while retaining near-ideal hash value distribution.
Partial-evaluation techniques for concurrent programs
Authors: Mihnea Marinescu, Benjamin Goldberg
Venue: Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation (1997)

This paper presents an application of partial evaluation (program specialization) techniques to concurrent programs. The language chosen for this investigation is a very simple CSP-like language. A standard binding-time analysis for imperative languages is extended in order to deal with the basic concurrent constructs (synchronous communication and nondeterministic choice). Based on the binding-time annotations, a specialization transformation is defined and proved correct. In order to maintain a simple and clear presentation, the specialization algorithm addresses only the data transfer component of the communication; partial evaluation, the way it is defined here, always generates residual synchronizations. However, a simple approximate analysis for detecting and removing redundant synchronizations from the residual program (i.e. synchronizations whose removal does not increase the nondeterminism of a program) can be performed. The paper also addresses pragmatic concerns such as improving the binding-time analysis, controlling loop unrolling and the consequences of lifting nondeterminism from run-time to specialization-time. Finally, the power of the newly developed technique is shown in several examples.
Solving Large Quadratic Assignment Problems in Parallel
Authors: Jens Clausen, Michael Perregaard
Venue: Computational Optimization and Applications (1997)

Quadratic Assignment problems are in practice among the most difficult to solve in the class of NP-complete problems. The only successful approach hitherto has been Branch-and-Bound-based algorithms, but such algorithms are crucially dependent on good bound functions to limit the size of the space searched. Much work has been done to identify such functions for the QAP, but with limited success.Parallel processing has also been used in order to increase the size of problems solvable to optimality. The systems used have, however, often been systems with relatively few, but very powerful vector processors, and have hence not been ideally suited for computations essentially involving non-vectorizable computations on integers.In this paper we investigate the combination of one of the best bound functions for a Branch-and-Bound algorithm (the Gilmore-Lawler bound) and various testing, variable binding and recalculation of bounds between branchings when used in a parallel Branch-and-Bound algorithm. The algorithm has been implemented on a 16-processor MEIKO Computing Surface with Intel i860 processors. Computational results from the solution of a number of large QAPs, including the classical Nugent 20 are reported.
Parallelization of FORTRAN code on distributed-memory parallel processors
Authors: Roland Rühl, Marco Annaratone
Venue: Proceedings of the 4th international conference on Supercomputing (1990)

This paper presents some preliminary results toward the automatic parallelization of uniprocessor FORTRAN code on distributed-memory parallel processors (DMPPs). The paper introduces Oxygen, a compiler for a DMPP under development at the Laboratory. The design of Oxygen and its parallelization strategy are discussed, and an analysis of its most significant components is presented, together with performance benchmarks. Oxygen carries out data consistency analysis at run-time; our results show that the overhead introduced is acceptable. Run-time data consistency analysis may also be the only viable approach to parallelize certain &ldquo;hard&rdquo; algorithms, as we will show in this study.
A model C++ tree iterator class for binary search trees
Authors: Richard Rasala
Venue: Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education (1997)

In object-oriented design, the concept of a container class that holds a collection of similar objects is fundamental. To use a container class most effectively, it is helpful to define one or more associated iterator classes that can return the objects in the container class in a specified order. An iterator is a bridge that permits the caller to use the objects in a container without knowledge of the details of how the objects are stored in the container. Although the concept of iterator is discussed in a number of books on C++ and/or object-oriented design, it is difficult to find a complete example that is both elegant and sophisticated. In this article, we provide such an example by developing an iterator class for binary search trees that is capable of doing all standard traversals: inorder, preorder, and postorder.
A Prioritized Multiprocessor Spin Lock
Authors: Theordore Johnson, Krishna Harathi
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

In this paper, we present the PR lock, a prioritized spin lock mutual exclusion algorithm. The PR lock is a contention-free spin lock, in which blocked processes spin on locally stored or cached variables. In contrast to previous work on prioritized spin locks, our algorithm maintains a pointer to the lock holder. As a result, our spin lock can support operations on the lock holder (e.g., for abort ceiling protocols). Unlike previous algorithms, all work to maintain a priority queue is done while a process acquires a lock when it is blocked anyway. Releasing a lock is a constant time operation. We present simulation results that demonstrate the prioritized acquisition of locks, and compare the performance of the PR lock against that of the best alternative prioritized spin lock.
The Request Reply Family of Group Routing Protocols
Authors: Jorge A. Cobb, Mohamed G. Gouda
Venue: IEEE Transactions on Computers (1997)

We present a family of group routing protocols for a network of processes. The task of these protocols is to route data messages to each member of a process group. To this end, a tree of processes is constructed in the network, ensuring that each group member is included in the tree. No processing or storage overhead is required for processes not included in the tree. The overhead of processes in the tree consists solely of the periodic exchange of request/reply messages with their parent. To choose the processes that constitute the tree, we take advantage of the existing unicast routing protocol in the network. In addition, our family of group routing protocols distinguishes itself from other group routing protocols in three ways. First, the protocols are proven correct. Second, the protocols preserve the integrity of the group tree as it adapts to changes in the unicast routing tables, even in the presence of temporary unicast routing loops. Third, data messages are propagated along the entire group tree, even while the tree adapts to changes in the unicast routing tables.
A Splitting Method for Unsteady Incompressible Viscous Fluids Imposing No Boundary Conditions on Pressure
Authors: D. Funaro, M. Giangi, D. Mansutti
Venue: Journal of Scientific Computing (1998)

We propose a time-advancing scheme for the discretization of the unsteady incompressible Navier-Stokes equations. At any time step, we are able to decouple velocity and pressure by solving some suitable elliptic problems. In particular, the problem related with the determination of the pressure does not require boundary conditions. The divergence free condition is imposed as a penalty term, according to an appropriate restatement of the original equations. Some experiments are carried out by approximating the space variables with the spectral Legendre collocation method. Due to the special treatment of the pressure, no spurious modes are generated.
A Parallel Repetition Theorem
Authors: Ran Raz
Venue: SIAM Journal on Computing (1998)

We show that a parallel repetition of any two-prover one-round proof system (MIP(2,1)) decreases the probability of error at an exponential rate. No constructive bound was previously known. The constant in the exponent (in our analysis) depends only on the original probability of error and on the total number of possible answers of the two provers. The dependency on the total number of possible answers is logarithmic, which was recently proved to be almost the best possible [U. Feige and O. Verbitsky, Proc.11th Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 70--76].
Discovering Patterns from Large and Dynamic Sequential Data
Authors: Ke Wang
Venue: Journal of Intelligent Information Systems (1997)

Most daily and scientific data are sequential in nature. Discovering important patterns from such data can benefit the user and scientist by predicting coming activities, interpreting recurring phenomena, extracting outstanding similarities and differences for close attention, compressing data, and detecting intrusion. We consider the following incremental discovery problem for large and dynamic sequential data. Suppose that patterns were previously discovered and materialized. An update is made to the sequential database. An incremental discovery will take advantage of discovered patterns and compute only the change by accessing the affected part of the database and data structures. In addition to patterns, the statistics and position information of patterns need to be updated to allow further analysis and processing on patterns. We present an efficient algorithm for the incremental discovery problem. The algorithm is applied to sequential data that honors several sequential patterns modeling weather changes in Singapore. The algorithm finds what it is supposed to find. Experiments show that for small updates and large databases, the incremental discovery algorithm runs in time independent of the data size.
Dataflow analysis in APL
Authors: Timothy A. Budd
Venue: ACM SIGAPL APL Quote Quad (1985)

An algorithm is described to perform dataflow analysis on programs written in an APL-like language. The dataflow analysis is performed at both the intra and interprocedural levels. The algorithm presented here is simpler and tailored more directly to the target language than previously published algorithms for dataflow analysis in APL. These algorithms have been implemented as part of a APL compiler.
Systolic Array Implementation of Euclid's Algorithm for Inversion and Division in GF (2m)
Authors: Jyh-Huei Guo, Chin-Liang Wang
Venue: IEEE Transactions on Computers (1998)

This paper presents two new systolic arrays to realize Euclid's algorithm for computing inverses and divisions in finite fields GF(2m) with the standard basis representation. One of these two schemes is parallel-in parallel-out, and the other is serial-in serial-out. The former employs O(m2) area complexity to provide the maximum throughput in the sense of producing one result every clock cycle, while the latter achieves a throughput of one result per m clock cycles using O(m· log2m) area complexity. Both of the proposed architectures are highly regular and, thus, well suited to VLSI implementation. As compared to existing related systolic architectures with the same throughput performance, the proposed parallel-in parallel-out scheme reduces the hardware complexity (and, thus, the area-time product) by a factor of O(m) and the proposed serial-in serial-out scheme by a factor of O(m/log2m).
Automatic building of graphs for rectangular dualisation
Authors: Marwan A. Jabri
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

Rectangular dualisation is a technique used to generate rectangular topologies for use in top-down floorplanning of integrated circuits. This paper presents an efficient algorithm that transforms an arbitrary graph, representing a custom integrated circuit, into one suitable for rectangular dualisation. The algorithm makes use of efficient techniques in graph processing such as planar embedding and introduces a novel procedure to transform a tree of biconnected sub-graphs into a block neighbourhood graph that is a path.
Finite Element Solution of the Helmholtz Equation with High Wave Number Part II: The h-p Version of the FEM
Authors: Frank Ihlenburg, Ivo Babuska
Venue: SIAM Journal on Numerical Analysis (1997)

In this paper, which is part II in a series of two, the investigation of the Galerkin finite element solution to the Helmholtz equation is continued. While part I contained results on the $h$ version with piecewise linear approximation, the present part deals with approximation spaces of order $p \ge 1$. As in part I, the results are presented on a one-dimensional model problem with Dirichlet--Robin boundary conditions. In particular, there are proven stability estimates, both with respect to data of higher regularity and data that is bounded in lower norms. The estimates are shown both for the continuous and the discrete spaces under consideration. Further, there is proven a result on the phase difference between the exact and the Galerkin finite element solutions for arbitrary $p$ that had been previously conjectured from numerical experiments. These results and further preparatory statements are then employed to show error estimates for the Galerkin finite element method (FEM). It becomes evident that the error estimate for higher approximation can---with certain assumptions on the data---be written in the same form as the piecewise linear case, namely, as the sum of the error of best approximation plus a pollution term that is of the order of the phase difference. The paper is concluded with a numerical evaluation.