ppxscal/embedding_network huggingface dataset:
Number of Solutions for Motion and Structure from Multiple FrameCorrespondence
Authors: Robert J. Holt, Arun N. Netravali
Venue: International Journal of Computer Vision (1997)

Much of the dynamic computer vision literature deals with the determination of motion and structure by observing two frames captured at two instants of time. Motion prediction and understanding can be improved significantly, particularly in the presence of noise, by analyzing an image sequence containing more than two frames. In this paper, we assume knowledge of correspondence of points on the surface of an object which is moving with constant motion, i.e., constant translation and constant rotation around an unknown center. We give a new formulation of the problem and prove that the following results hold in general for the number of solutions to motion and structure values (i.e., values of translation, rotation, and depth): (a) For three point correspondences over three views, there are at most two solutions, only one of which has all positive depth values; (b) For two point correspondences over four views, there is a unique solution; (c) For one point correspondence over five views, there can be up to ten solutions; (d) For one point correspondence over six views, there is a unique solution. The method of solution for each of the above formulations requires the solving of a system of multivariate polynomials, whose coefficients are functions of the observed data. In order to determine the number of solutions to these systems, we use theorems from algebraic geometry which imply that under a few mild conditions, the number of solutions at one set of data points provides an upper bound on the number of solutions for almost all sets of data points.Thus a bound on the number of solutions is obtained when a single system is solved by a method such as homotopy continuation, which we use here.
Java-based query driven simulation environment
Authors: Rajesh S. Nair, John A. Miller, Zhiwei Zhang
Venue: Proceedings of the 28th conference on Winter simulation (1996)

The concept of Web-based simulation can be finally realized using Java. We have used Java to create a powerful simulation modeling library which is based on the process interaction paradigm. Java threads make it easy for us to implement each process (or active entity) as a thread. Our library, JSIM, supports both simulation and animation thus rendering the model developer's job easier. An important component of our approach is that we integrate our Java Simulator with a Database Management System (DBMS). The conceptual basis for this integration is an environment based on Query Driven Simulation, which allows simulation analysts to study the performance of systems simply by querying a database. Simulation inputs and outputs are stored in databases, and simulation models can be launched as a part of query processing. This integration also resolves a security restriction problem which Java imposes. Most browsers (e.g., Netscape Navigator) restrict Java applets from writing into a file which may be necessary to make simulation results available to the user. Our approach bypasses this problem by writing into a database. Databases are much less of a security concern since they already have substantial authorization mechanisms.
Model-Based Localisation and Recognition of Road Vehicles
Authors: T. N. Tan, G. D. Sullivan, K. D. Baker
Venue: International Journal of Computer Vision (1998)

Objects are often constrained to lie on a known plane. This paper concerns the pose determination and recognition of vehicles in traffic scenes, which under normal conditions stand on the ground-plane. The ground-plane constraint reduces the problem of localisation and recognition from 6 dof to 3 dof.The ground-plane constraint significantly reduces the pose redundancy of 2D image and 3D model line matches. A form of the generalised Hough transform is used in conjuction with explicit probability-based voting models to find consistent matches and to identify the approximate poses. The algorithms are applied to images of several outdoor traffic scenes and successful results are obtained. The work reported in this paper illustrates the efficiency and robustness of context-based vision in a practical application of computer vision.Multiple cameras may be used to overcome the limitations of a single camera. Data fusion in the proposed algorithms is shown to be simple and straightforward.
Future directions in program transformations
Authors: R. Paige
Venue: ACM SIGPLAN Notices (1997)

As the emphasis of Programming Languages has evolved from computing on numbers to computing on programs, the area of program transformations has naturally gained in importance. This paper briefly surveys what transformational programming is about, and how to make progress in the field.
Pattern-based design recovery of Java software
Authors: Jochen Seemann, Jürgen Wolff von Gudenberg
Venue: Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering (1998)

In this paper we show how to recover design information from Java source code. We take a pattern-based approach and proceed in a step by step manner deriving several layers of increasing abstraction. A compiler collects information about inheritance hierarchies and method call relations. It also looks for particular source text patterns coming from naming conventions or programming guidelines.The result of the compile phase is a graph acting as the starting graph of a graph grammar that describes our design recovery process. We define criteria for the automatic detection of associations and aggregations between classes, as well as for some of the popular design patterns such as composite or strategy.
Teaching ethical and social issues in CS1 and CS2
Authors: Kay G. Schulze, Frances S. Grodzinsky
Venue: Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education (1997)

The discussion of whether ethical and social issues of computing should be explored in undergraduate computer science education has resulted in most academic institutions and educators agreeing that they are important topics that must be included. Further support has been provided by Curricula '91 [16], the CSAC/CSAB accreditation [2] and ImpactCS [12]. Many books [7, 8, 9, 10] and papers [6, 14] have discussed what topics should be covered and what techniques can be used either in a dedicated course or in modules across the curriculum. However, explicit detailed examples that have worked successfully, particularly in lower level computer science courses, are still rare. This paper will discuss several examples that have been successfully used in CS1 and CS2 at a medium-sized university.
Automatic layout procedures for serial routing devices
Authors: Yasushi Ogawa, Hidekazu Terai, Tokinori Kozawa
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

Conventional automatic layout systems have been applied to MOS or bipolar devices. However, these systems cannot deal with certain features, e.g. signal serialization, in serial routing devices such as Josephson devices. This paper defines layout requirements and presents new automatic layout procedures for such devices. These procedures are based on &ldquo;subnet partitioning&rdquo;. They can be applied to hierarchical design of both masterslice and custom logic LSIs. Experiments using 4-bit-full-adder circuits confirm their feasibility.
A Recursive Construction for 2-Designs
Authors: Kirsten Mackenzie-Fleming
Venue: Designs, Codes and Cryptography (1998)

This paper contains two main results: given a symmetric (v, k, &lambda;) design, D, and a resolvable design which has the parameters of a residual design of D, there exists a symmetric (dv + 1, v, k) design, where d = (v - k)/(k - &lambda;), and d is a prime power; given a symmetric (v, k, &lambda;) design, D, and a resolvable design with the parameters of a derived design of D, there exists a 2 - (ek + v, 2k, k) design, where e = k/&lambda;,and e is a prime power.
On the Incidence Matrix of the Ree Unital
Authors: Gerhard Hiss
Venue: Designs, Codes and Cryptography (1997)

The dimensions of the codes associated to the Ree unital are computed using methods from modular representation theory.
The Nonexistence of Ternary [38, 6, 23] Codes
Authors: Noboru Hamada, Marijn Van Eupen
Venue: Designs, Codes and Cryptography (1998)

It has been shown by Bogdanova and Boukliev [1] that there exist a ternary [38,5,24] code and a ternary [37,5,23] code. But it is unknown whether or not there exist a ternary [39,6,24] code and a ternary [38,6,23] code. The purpose of this paper is to prove that (1) there is no ternary [39,6,24] code and (2) there is no ternary [38,6,23] code using the nonexistence of ternary [39,6,24] codes. Since it is known (cf. Brouwer and Sloane [2] and Hamada and Watamori [14]) that (i) n_3(6,23) = 38> or 39 and d_3(38,6) = 22 or 23 and (ii) n_3(6,24) = 39 or 40 and d_3(39,6) = 23 or 24, this implies that n_3(6,23) = 39, d_3(38,6) = 22, n_3(6,24) = 40 and d_3(39,6) = 23, where n_3<math>(k,d) and d<math>_3(n,k) denote the smallest value of n and the largest value of d, respectively, for which there exists an [n,k,d] code over the Galois field GF(3).
The selection of optimal cache lines for microprocessor-based controllers
Authors: Tsang-Ling Sheu, Yuan-Bao Shieh, Woei Lin
Venue: Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture (1990)

This paper presents a method of selecting optimal line sizes of cache memories for microprocessor-based controllers. It is well known that the use of cache memories in microprocessor systems can greatly improve their performance, especially in a heavy-traffic environment. We analyze cache performance using trace-driven simulation, a widely used method that is considered to be effective in exploring cache hit ratios. Three cache parameters, cache sizes, set associativity and line sizes, which can directly impact the hit ratios, are investigated. Among the three parameters, we mainly focus on exploring the effects of selecting line sizes on the entire microprocessor performance. A significant observation is that, although increasing line sizes can result in a higher hit ratio, it also considerably increases traffic to main memory, thereby degrading the performance. This indicates that a larger line size with a slightly higher hit ratio may perform worse than a smaller one with a lower hit ratio. We therefore present a simple method of determining an optimal line size that produces the best overall system performance.
On-Line Parameter Estimation for Infinite-Dimensional Dynamical Systems
Authors: J. Baumeister, W. Scondo, M. A. Demetriou, I. G. Rosen
Venue: SIAM Journal on Control and Optimization (1997)

The on-line or adaptive identification of parameters in abstract linear and nonlinear infinite-dimensional dynamical systems is considered. An estimator in the form of an infinite-dimensional linear evolution system having the state and parameter estimates as its states is defined. Convergence of the state estimator is established via a Lyapunov estimate. The finite-dimensional notion of a plant being sufficiently rich or persistently excited is extended to infinite dimensions. Convergence of the parameter estimates is established under the additional assumption that the plant is persistently excited. A finite-dimensional approximation theory is developed, and convergence results are established. Numerical results for examples involving the estimation of both constant and functional parameters in one-dimensional linear and nonlinear heat or diffusion equations and the estimation of stiffness and damping parameters in a one-dimensional wave equation with Kelvin--Voigt viscoelastic damping are presented.
A Distributed Graph Algorithm for the Detection of Local Cycles and Knots
Authors: Azzedine Boukerche, Carl Tropper
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

In this paper, a distributed cycle/knot detection algorithm for general graphs is presented. The algorithm distinguishes between cycles and knots and is the first algorithm to our knowledge which does so. It is especially relevant to an application such as parallel simulation in which 1) cycles and knots can arise frequently, 2) the size of the graph is very large, and 3) it is necessary to know if a given node is in a cycle or a knot. It requires less communication than previous algorithms¿2m vs. (at least) (4m) for the Chandy and Misra algorithm, where m is the number of links in the graph. It requires O (nlog (n)) bits of memory, where n is the number of nodes. The algorithm differs from the classical diffusing computation methods through its use of incomplete search messages to speed up the computation. We introduce a marking scheme in order to identify strongly connected subcomponents of the graph which cannot reach the initiator of the algorithm. This allows us to distinguish between the case in which the initiator is in a cycle (only) or is in a knot.
A Viewpoint Planning Strategy for Determining True Angles on Polyhedral Objects by Camera Alignment
Authors: Claus B. Madsen, Henrik I. Christensen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

The paper presents a viewpoint planning strategy which automatically guides a movable camera from an arbitrary position to a position where the optical axis is perpendicular to a plane spanned by any two intersecting edges on a polyhedral object, i.e., a junction. In related work it is common to use the changing length of edge segments to control such alignment, but we demonstrate the use of the apparent angle between the edge segments of the junction. By basing the control on the apparent angle we achieve robustness as well as independence of distance to the object and focal length. The strategy is able to determine the true angle of a junction with an accuracy of approximately 1°, and align with an accuracy of approximately 6°.
Fast parallel similarity search in multimedia databases
Authors: Stefan Berchtold, Christian Böhm, Bernhard Braunmüller, Daniel A. Keim, Hans-Peter Kriegel
Venue: Proceedings of the 1997 ACM SIGMOD international conference on Management of data (1997)

Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature space which is computationally very intensive. In this paper, we present a new parallel method for fast nearest-neighbor search in high-dimensional feature spaces. The core problem of designing a parallel nearest-neighbor algorithm is to find an adequate distribution of the data onto the disks. Unfortunately, the known declustering methods to not perform well for high-dimensional nearest-neighbor search. In contrast, our method has been optimized based on the special properties of high-dimensional spaces and therefore provides a near-optimal distribution of the data items among the disks. The basic idea of our data declustering technique is to assign the buckets corresponding to different quadrants of the data space to different disks. We show that our technique - in contrast to other declustering methods - guarantees that all buckets corresponding to neighboring quadrants are assigned to different disks. We evaluate our method using large amounts of real data (up to 40 MBytes) and compare it with the best known data declustering method, the Hilbert curve. Our experiments show that our method provides an almost linear speed-up and a constant scale-up. Additionally, it outperforms the Hilbert approach by a factor of up to 5.
The using of inference mechanisms to improve the retrieval facilities from large relational databases
Authors: Gian Pierro Zarri
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

This paper describes the development of &ldquo;intelligent&rdquo; tools aimed at improving the retrieval facilities from large relational databases. When a natural language query does not correspond directly to the data contained in the base, a class of inferential processes called &ldquo;transformations&rdquo; is applied. The original query is thus automatically converted into one or more &ldquo;semantically close&rdquo; ones. &ldquo;Semantically close&rdquo; means that the data possibly obtained with the new query will give useful information about the data originally searched for.
On the Complexity of Finding a Minimum Cycle Cover of a Graph
Authors: Carsten Thomassen
Venue: SIAM Journal on Computing (1997)

We prove that the problem of finding a cycle cover of smallest total length is NP-hard. This confirms a conjecture of Itai, Lipton, Papadimitriou, and Rodeh from 1981.
An integrated design environment for performance and dependability analysis
Authors: Robert H. Klenke, Moshe Meyassed, James H. Aylor, Barry W. Johnson, Ramesh Rao, Anup Ghosh
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

This paper presents an integrated design environment thatsupports the design and analysis of digital systems from initialconcept to the final implementation. The environment supports bothsystem level performance and dependability analysis from acommon modeling representation. A tool called ADEPT (AdvancedDesign Environment Prototype Tool) has been developed toimplement the environment. ADEPT is based on IEEE 1076 VHDLand uses commercial schematic capture systems as a front end viaan EDIF interface. Several examples are presented whichdemonstrate various aspects of the environment.
A Parallel System for Text Inference Using Marker Propagations
Authors: Sanda M. Harabagiu, Dan I. Moldovan
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

This paper presents a possible solution for the text inference problem¿extracting information unstated in a text, but implied. Text inference is central to natural language applications such as information extraction and dissemination, text understanding, summarization, and translation. Our solution takes advantage of a semantic English dictionary available in electronic form that provides the basis for the development of a large linguistic knowledge base. The inference algorithm consists of a set of highly parallel search methods that, when applied to the knowledge base, find contexts in which sentences are interpreted. These contexts reveal information relevant to the text. Implementation, results, and parallelism analysis are discussed.
Building shared trees using a one-to-many joining mechanism
Authors: Ken Carlberg, Jon Crowcroft
Venue: ACM SIGCOMM Computer Communication Review (1997)

This paper presents a new approach for building shared trees which have the capability of providing multiple routes from the joining node onto an existing tree. The approach follows a design parameter of CBT and PIM in that it operates independently of any unicast routing protocol. However, a paradigm shift is introduced such that trees are built in an on-demand basis through the use of a one-to-many joining mechanism. In addition, the paper presents optimisations of the new mechanism to help constrain its impact in the case where many receivers exist for a given multicast group.
On Spin Models, Modular Invariance, and Duality
Authors: Eiichi Bannai, Etsuko Bannai, Francois Jaeger
Venue: Journal of Algebraic Combinatorics: An International Journal (1997)

A spin model is a triple (X, W^+, W^-), whereW^+ and W^- are complex matrices with rows and columns indexed by X which satisfy certain equations (these equations allow the construction of a link invariant from(X, W^+, W^-) ). We show that these equations imply the existence of a certain isomorphism &Psi; between two algebras m and h associated with (X, W^+, W^-) . When m=h=u,u is the Bose-Mesner algebra of some association scheme, and &Psi; is a duality of u. These results had already been obtained in [15] when W^+, W^- are symmetric, and in [5] in the general case, but the present proof is simpler and directly leads to a clear reformulation of the modular invariance property for self-dual association schemes. This reformulation establishes a correspondence between the modular invariance property and the existence of &ldquo;spin models at the algebraic level&rdquo;. Moreover, for Abelian group schemes, spin models at the algebraic level and actual spin models coincide. We solve explicitly the modular invariance equations in this case, obtaining generalizations of the spin models of Bannai and Bannai [3]. We show that these spin models can be identified with those constructed by Kac and Wakimoto [20] using even rational lattices. Finally we give some examples of spin models at the algebraic level which are not actual spin models.
Unified versioning through feature logic
Authors: Andreas Zeller, Gregor Snelting
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1997)

Software configuration management (SCM) suffers from tight coupling between SCM version-ing models and the imposed SCM processes. In order to adapt SCM tools to SCM processes, rather than vice versa, we propose a unified versioning model, the version set model. Version sets denote versions, components, and configurations by feature terms, that is, Boolean terms over (feature : value)-attributions. Through feature logic, we deduce consistency of abstract configurations as well as features of derived components and describe how features propagate in the SCM process; using feature implications, we integrate change-oriented and version-oriented SCM models. We have implemented the version set model in an SCM system called ICE, for Incremental Configuration Environment. ICE is based on a featured file system (FFS), where version sets are accessed as virtual files and directories. Using the well-known C preprocessor (CPP) representation, users can view and edit multiple versions simultaneously, while only the differences between versions are stored. It turns out that all major SCM models can be realized and integrated efficiently on top of the FFS, demonstrating the flexible and unifying nature of the version set model.
Comparison of simulation environments through analytic hierarchy process
Authors: S. Cem Karacal
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper describes the application of analytic hierarchy process to evaluate a new methodology for simulation against conventional approaches. The study utilizes structured pair-wise comparison of analytic hierarchy process to reach a scale of preference between the two simulation modeling approaches. Both tangible and intangible aspects of modeling and simulation are combined to create a comprehensive platform for comparing simulation environments.
Fast and extensive system-level memory exploration for ATM applications
Authors: Peter Slock, Sven Wuytack, Francky Catthoor, Gjalt de Jong
Venue: Proceedings of the 10th international symposium on System synthesis (1997)

In this paper, our memory architecture exploration methodology and CAD techniques for network protocol applications are presented. Prototype tools have been implemented, and applied on part of an industrial ATM application to show how our novel approach can be used to easily and thoroughly explore the memory organization search space at the system-level. An extended, novel method for signal to memory assignment is proposed which takes into account memory access conflict constraints. The number of conflicts is first optimized by our flow-graph balancing technique. Significant power and area savings were obtained by performing the exploration thoroughly at each of the degrees of freedom in the global search space.