ppxscal/embedding_network huggingface dataset:
A Sequential Factorization Method for Recovering Shape and Motion from Image Streams
Authors: Toshihiko Morita, Takeo Kanade
Venue:  (1994)

We present a sequential factorization method for recovering the three-dimensional shape of an object and the motion of the camera from a sequence of images, using tracked features. The factorization method originally proposed by Tomasi and Kanade produces robust and accurate results incorporating the singular value decomposition. However, it is still difficult to apply the method to real-time applications since it is based on a batch-type operation and the cost of the singular value decomposition is large. We develop the factorization method into a sequential method by regarding the feature positions as a vector time series. The new method produces estimates of shape and motion at each frame. The singular value decomposition is replaced with an updating computation of only three dominant eigenvectors, which can be performed in time, while the complete singular value decomposition requires operations for a matrix. Also, the method is able to handle infinite sequences since it does not store any increasingly large matrices. Experiments using synthetic and real images illustrate that the method has nearly the same accuracy and robustness as the original method.
Quality Memory Blocks Balancing the Trade-Offs
Authors: Betty Prince
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Memory blocks have the basic quality requirements shared by all IP blocks. These include transferability between manufacturing areas, transferability from the original technology to the next generation technology, compatibility with available design tools, and qualified manufacturability in available wafer fabs. In addition to these general quality requirements, issues specific to memory blocks need to be considered. These include: memory type and cell for the specific implementation; memory technology generation to be used; cost issues such as requirements for special process modules; design issues such as choice of array compiler or use of predefined memory blocks; yield improvement issues such as redundancy type and implementation; test issues including BIST or direct memory access, special memory test requirements such as bit mapping, and availability of memory testers; reliability issues such as disturb problems, burn-in requirements and soft error considerations; architectural issues such as on-chip bandwidth access, pitch matching of array logic, and refresh implementation. This paper discusses these memory specific quality issues and the trade-offs involved.
Red Hat Linux All-in-One Desk Reference For Dummies
Authors: Naba Barkakati, Nabajyoti Barkakati
Venue:  (2002)

:Take off your hat and curl up with a good book -- this one. With this friendly guide in hand, you'll have Red Hat Linux installed in a jiffy. Eight mini reference books help you find your way around the file system, set up a network or an Internet server, keep your stuff safe, and even venture into programming!
Geometric Partitioning and Its Applications
Authors: K P Agarwal
Venue:  (1991)

\indent In this survey paper we review some results related to {\em geometric partitioning}, i.e. given a set of objects in $ {\bf R}^{d}$, partition the space into few regions so that each region intersects a small number of objects. We first describe the known bounds on the size of such a partitioning and present some of the algorithms for computing a geometric partitioning. We then discuss several applications of geometric partitioning.
Deduction over Mixed-Level Logic Representations for Text Passage Retrieval
Authors: Michael Hess
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

A system is described that uses a mixed-level representation of (part of) the meaning of natural language documents (based on standard Horn Clause Logic) and a variable-depth search strategy that distinguishes between the different levels of abstraction in the knowledge representation to locate specific passages in the documents. Mixed-level representations as well as variable-depth search strategies are applicable in fields outside that of NLP.
Critical (of) Issues in Real-Time Systems: A Position Paper
Authors: Fred B. Schneider
Venue:  (1988)

NO AVAILABLE
Feasibility Study: Applying a Small BVM to an Atmospheric Chemistry Problem
Authors: A R Wagner
Venue:  (1986)

A study of the feasibility of using a small BVM for solution of the EPA atmospheric chemistry problem is presented. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The Expressiveness of Indeterminate Dataflow Primitives
Authors: Vasant Shanbhogue
Venue:  (1990)

This thesis establishes that there are different kinds of indeterminacy in an asynchronous distributed computation setting by studying expressiveness and inexpressiveness situations. We use a particular model of asynchronous distributed computation, called the dataflow model. This model very naturally portrays the situation of autonomous computing agents communicating asynchronously to each other along fixed one-way paths called channels. The nature of computation is studied both in an operational setting, and in a more abstract setting, and equivalences are proved between them so that one may freely move between them. We use the operational semantics of Lynch and Stark to describe the operational behavior of processes in the dataflow model. We show how one can abstract out the low-level operational behavior and obtain ``traces'''' that are well-suited for reasoning about network behavior, once the properties of tract sets have been fully described using the operational semantics from which they arise. We consider several forms of indeterminacy in this context, modeling them as different fairness guarantees on merge primitives, that try to merge two sequences of values into one, and choice primitives, that split one sequence of values into two. The main contribution here has been to show that there is a surprising hierarchy of different notions of indeterminacy. This cannot simply be described using degree of branching bounded versus unbounded. We use the trace of sets of these primitives for these proofs. The description of this hierarchy clarifies the expressibility situation for indeterminacy in an asynchronous distributed setting. It is our hope that by concentrating on specific properties of agents that are really relevant to their behavior in any particular system, one would obtain simpler and more convenient semantics to describe this behavior. In most of this thesis, we consider static dataflow a fixed set of processes communicating along a fixed set of channels. In one of the final chapters, we consider recursively defined dataflow networks whose behavior involves the creation of processes and channels. We prove the equivalence of an operational and an abstract semantics there for determinate networks.
An Efficient Algorithm for Group Multicast Routing with Bandwidth Reservation
Authors: Chor Ping Low, Ning Wang
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

Multicasting refers to the transmission of data from a source node to multiple destination nodes in a network. Group multicasting is a generalization of multicasting whereby every member of a group is allowed to multicast messages to other members that belong to the same group. The routing problem in this case involves the construction of a set of low cost multicast trees with bandwidth requirements, one for each member of the group, for multicasting messages to other members of the group. In this paper we first prove that to find a feasible solution to the group multicast routing problem is NP-complete. Following that we propose a new heuristic algorithm to generate a set of low cost multicast trees with bandwidth reservation. Simulation results show that our proposed algorithm performed better in terms of cost and utilization of bandwidth compared with an existing algorithm that was proposed by Jia and Wang [5].
Quadratic Blending Surfaces
Authors: Christoph M. Hoffmann, John E. Hopcroft
Venue:  (1985)

NOT SUPPLIED
Planar Strong Connectivity Helps In Parallel Depth-First Search
Authors: Ming Kao
Venue:  (1992)

This paper shows that for a strongly connected planar directed graph of size $n$, a depth-first search tree rooted a specified vertex can be computed in $O(\log^{5}n)$ time using $n$ processors. Previously, for planar directed graphs that may not be strongly connected, the best depth-first search algorithm runs in $O(\log^{10}n)$ time using $n$ processors. Both algorithms run on a parallel random access machine that allows concurrent reads and concurrent writes in its shared memory, and in case of a write conflict, permits an arbitrary processor to succeed. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
User''s Manual for the SMART Information Retrieval System
Authors: Joel Zumoff
Venue:  (1971)

NO SUPPLIED
Honey, I Shrunk the Beowulf!
Authors: W. Feng, M. Warren, E. Weigle
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

In this paper, we present a novel twist on the Beowulf cluster ¿ the Bladed Beowulf. Designed by RLX Technologies and integrated and configured at Los Alamos National Laboratory, our Bladed Beowulf consists of compute nodes made from commodity off-the-shelf parts mounted on motherboard blades measuring 14.7'' × 4.7'' × 0.58''. Each motherboard blade (node) contains a 633-MHz Transmeta TM5600¿ CPU, 256-MB memory, 10-GB hard disk, and three 100-Mb/s Fast Ethernet network interfaces. Using a chassis provided by RLX, twenty-four such nodes mount side-by-side in a vertical orientation to fit in a rack-mountable 3U space, i.e., 19'' in width and 5.25'' in height.A Bladed Beowulf can reduce the total cost of ownership (TCO) of a traditional Beowulf by a factor of three while providing Beowulf-like performance. Accordingly, rather than use the traditional definition of price-performance ratio where price is the cost of acquisition, we introduce a new metric called ToPPeR: Total Price-Performance Ratio, where total price encompasses TCO. We also propose two related (but more concrete) metrics: performance-space ratio and performance-power ratio.
Environment pi J for Visual Programming in Java
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Authoring tool "J" (piJ) is based on original results in ureas of visual languages and programming technology. It is developed 2 main versions: (a) a tool to program in Java (as stay-alone tool, as add-on for MS FrontPage, and as component of our MetaCulc environment), (b) add-on for MS FrontPage to develop fragments in JavaScript. The sofntaare supports churt versions of Java and JavaScript in Prokhorov's structured n-chart, flow-chart, and Nessie-Shneiderrnann structure grams. "J" includes tools to convert a plain Java text to chart and back. The tool ~110~s user to change textual representation of any structured part of a program to graphic one and back.. The tool realizes technology of extension/ cutting of user language and technology of linking with external languages. A version of a tool supports programming of microprocessor 28 in visual assembler. The tool can be used in software design, education, web design, supercomputing, und another areas The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Outsourcing IT advice: a success prediction model
Authors: G. G. Gable
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

The paper presents an economical prediction model of client success when outsourcing IT advice. Through case studies and statistical evaluation of empirical survey data, the paper identifies those criteria that have broad predictive value as well as those criteria whose predictive value is contingent upon the client's rationale for seeking outside assistance. Client and consultant views on the importance of 10 reasons for outsourcing IT expertise (e.g. objectivity, lack of appropriate skills in-house, company politics) and 15 consultant selection criteria (e.g. price, prior experience, profile, proposal, personalities) are also compared and disparities interpreted.
Native Mode Functional Self-Test Generation for Systems-on-Chip
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

With the rapid increase in the functionality of a single chip, the generation of high quality manufacturing tests which can be applied at-speed has become a serious issue. The problem is further compounded with an increasing level of integration in the case of Systems-On-Chip (SOCs), for which existing test generation tools are inadequate. Many of the peripherals in a SOC design may not include testability features, which renders conventional design for testability (DFT) approaches ineffective. Functional tests applied at-speed in the native mode of a microprocessor have been shown to be effective in detecting realistic defects. A novel approach to adopt this strategy to generate test patterns for SOCs is presented in this paper. This approach utilizes the core processor's instruction set to test its own functionality and that of the peripheral components. A SOC based on a model of the Intel 8085 processor is used to show the effectiveness of this approach.
Communicative acts and interaction protocols in a distributed information system
Authors: Mariusz Nowostawski, Daniel Carter, Stephen Cranefield, Martin Purvis
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In FIPA-style multi-agent systems, agents coordinate their activities by sending messages representing particular communicative acts (or performatives). Agent communication languages must strike a balance between simplicity and expressiveness by defining a limited set of communicative act types that fit the communication needs of a wide set of problems. More complex requirements for particular problems must then be handled by defining domain-specific predicates and actions within ontologies. This paper examines the communication needs of a multi-agent distributed information retrieval system and discusses how well these are met by the FIPA ACL.
Building Theories in Nuprl
Authors: David A. Basin
Venue:  (1988)

This paper provides an account of how mathematical knowledge is represented, reasoned about, and used computationally in a mechanized constructive theorem proving environment. We accomplish this by presenting a particular theory developed in the Nuprl proof development system: finite set theory culminating in Ramsey''s theorem. We believe that this development is interesting as a case study in the relationship between constructive mathematics and computer science. Moreover, the aspects we emphasize-the high-level development of definitions and lemmas, the use of tactics to automate reasoning, and the use of type theory as a programming logic-are not restricted in relevance to this particular theory, and indicate the promise of our approach for other branches of constructive mathematics.
Configurable Mobile Agent and Its Fault-Tolerance Mechanism
Authors: Chenggang Wu, Shaohui Liu, Bo Wang, Zhongzhi Shi, Hua Gu
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

The idea of performing client-server computing by transmission of executable programs between clients and servers has become highly popular among researchers and developers who are engaged in intelligent network services. Computing based on mobile agents is an important aspect of this idea. This paper focuses on researching the migration process of agents. A model based on modules is devised for constructing agents. A concurrent schedulemethod is presented, with which the agent migration can be easily implemented. Most of unnecessary transmission of codes and data can be avoided by module reuse. Consequently, the executing period of mobile agents is reduced and their efficiency is improved. Additionally, a Fault-tolerance mechanism is designed in the system to ensure that the agent can work even when some faults occur in the network or in the host.
Tailoring the Permanent Formula to Problem Instances
Authors: Eric Bax
Venue:  (1996)

A parameterized set of finite difference formulas have been developed for the permanent. One parameter setting produces Ryser''s [2] inclusion and exclusion formula. Other parameter settings yield formulas that can be computed more efficiently. One group of settings introduces symmetry, so only half the terms need to be computed. Some of these settings produce formulas that have many zero-valued terms when applied to matrices drawn from random distributions. Gathering the zero-valued terms and removing them from the computation substantially reduces the time required to compute the permanent [1]. This paper explores methods to tailor the parameter settings to specific matrices, choosing the formula based on the problem instance to increase the number of zero-valued terms.
Analysis of the Relation between the Complexity of Agents and the Complexity of a Market in an Artificial Market
Authors: Kiyoshi Izumi
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

In this study we analyzed the relation between the dynamics of market prices and market participants' prediction formula using an artificial market model.As a result, we found that (a) complexity of markets was not fixed, but changed with complexity of agents, and that (b) when agents increased the complexity of their prediction methods, structure of dynamic patterns of market price didn't disappear, but it can't be described by equation of any dimensions.Moreover, we found that the convergence of agents' forecast formula prevented the rate divergence.
Fault diagnosis system based on sensitivity analysis and fuzzy logic
Authors: L. J. de Miguel, M. Mediavilla, J. R. Peran
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

This paper describes three ways of building a decision system for model-based fault diagnosis. The aim is the management of uncertain and redundant information provided by a parity equation fault diagnosis method. Although any residual generation method may be considered, the input-output parity equation approach has been used. Sensitivity analysis is the key point in the evaluation of fault symptoms in order to obtain a final diagnosis. With this method, sensitivity estimates are easily obtainable by direct observation of the parity equations. Three ways to solve the decision problem are described: fuzzy logic-based, direct weighting of symptoms and directional properties. A simple simulated case has been used to prove its performance. Moreover, the fuzzy approach, that has showed to be the most robust of them, has been tested on a real laboratory equipment with similar results.
Spatial similarity-based retrievals and image indexing by hierarchical decomposition
Authors: I. Ahmad, W. I. Grosky
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

For efficient search and spatial similarity based retrieval of image contents, the paper introduces a new symbolic image representation and indexing technique. In this technique, an image is recursively decomposed into a spatial arrangement of feature points while preserving the spatial relationships among its various component. Quadtrees are used to manage the decomposition hierarchy and help in quantifying the measure of similarity. This scheme is incremental in nature and can be adopted to find a match at various levels of details, from coarse to fine. This approach is translation, rotation and scale independent. For search and retrieval, a two phase indexing scheme based on image signatures and quadtree matching is introduced. For a given query image, a facility is provided to rank order the retrieved spatially similar images from the image database against a given query image for subsequent browsing and user selection.
Evolutionary Neural Networks: A Robust Approach to Software Reliability Problems
Authors: R. Hochman, J. P. Hudepohl, E. B. Allen, T. M. Khoshgoftaar
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

In this empirical study, from a large data set of software metrics for program modules, thirty distinct partitions into training and validation sets are automatically generated with approximately equal distributions of fault-prone and not-fault-prone modules. Thirty classification models are built for each of the two approaches considered -- discriminant analysis and the evolutionary neural network (ENN) approach -- and their performances on corresponding data sets are compared. The lower error proportions for ENNs on fault-prone, not-fault-prone, and overall classification were found to be statistically significant. The robustness of ENNs follows from their superior performance on the range of data configurations used. It is suggested that ENNs can be effective in other software reliability problem domains, where they have been largely ignored.
Polynomial-Time Algorithms for Permutation Groups
Authors: Merrick Furst, John E. Hopcroft, Eugene Luks
Venue:  (1980)

A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation since many problems such as membership testing, equality testing, and inclusion testing are decidable in polynomial time. In addition, we demonstrate that the normal closure of a subgroup can be computed in polynomial time, and that this procedure can be used to test a group for solvability. We also describe an approach to computing the intersection of two groups. The procedures and techniques have wide applicability and have recently been used to improve many graph isomorphism algorithms.
A Lower Bound for Randomized Algebraic Decision Trees
Authors: Dima Grigoriev, Marek Karpinski, Friedhelm M Heide
Venue:  (1996)

We extend the lower bounds on the depth of algebraic decision trees to the case of {\em randomized} algebraic decision trees (with two-sided error) for languages being finite unions of hyperplanes and the intersections of halfspaces, solving a long standing open problem. As an application, among other things, we derive, for the first time, an $\Omega(n^2)$ {\em randomized} lower bound for the {\em Knapsack Problem} which was previously only known for deterministic algebraic decision trees. It is worth noting that for the languages being finite unions of hyperplanes our proof method yields also a new elementary technique for deterministic algebraic decision trees without making use of Milnor''s bound on Betti number of algebraic varieties.