ppxscal/embedding_network huggingface dataset:
Monocular Perception of Biological Motion Detection and Labeling
Authors: Yang Song, Luis Goncalves, Enrico Di Bernardo, Pietro Perona
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

Computer perception of biological motion is key to developing convenient and powerful human-computer inter-faces. Successful body tracking algorithms have been developed; however, initialization is done by hand.We propose a method for detecting a moving human body and for labeling its parts automatically. It is based on maximizing the joint probability density function (PDF) of the position and velocity of the body parts. The PDF is estimated from training data. Dynamic programming is used for calculating efficiently the best global labeling on an approximation of the PDF. The computational cost is on the order of N 4 where N is the number of features detected.We explore the performance of our method with experiments carried on a variety of periodic and non-periodic body motions viewed monocularly for a total of approximately 30,000 frames. Point-markers were strapped to the joints of the subject for facilitating image analysis. We find an average of 2.3% labeling error; the experiments also suggest a high degree of viewpoint-invariance.
Multiple sequence alignment using the quasi-concave function optimization based on the DIALIGN combinatorial structures
Authors: Shvartser Leonid, Kulikowski Casimir, Muchnik Ilya
Venue:  (2001)

Multiple sequence alignment is usually considered as an optimization problem, which has a statistical and a structural component. It is known that in the problem of protein sequence alignment a processed sample is too small and not representative in the statistical sense though this information can be sufficient if an appropriate structural model is used. In order to utilize this information a new structural description of the pairwise alignment results union has been developed. It is shown that if the structure is restored then Multiple Sequence Alignment is achieved. Introduced structure represents the set of local maximums of quasi-concave set function on a lower semi lattice, which in turn is a union of the set-theoretical intervals. This union is a set of the consistent subsets of diagonals, introduced by B. Morgenstern, A. Dress, and T. Werner (1996). Algorithm for local maximums search on proposed structure has been developed. It consists of an alternation of the Forward and Backward passes. The Backward pass in this algorithm is a rigorous while the Forward pass is based on heuristics. Multiple alignment of 5 protein sequences are used as an illustration of the proposed algorithm.
Learning with Queries Corrupted by Classification Noise
Authors: Jeffrey Jackson, Eli Shamir, Clara Shwartzman
Venue: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97) (1997)

Kearns introduced the "statistical query" (SQ) model as a general method for producing learning algorithms which are robust against classification noise. We extend this approach in several ways, in order to tackle algorithms that use ``membership queries", focusing on the more stringent model of "persistent noise". The main ingredients in the general analysis are: 1. Smallness of dimension of both the targets' class and the queries' class. 2. Independence of the noise variables. Persistence restricts independence, forcing repeated invocation of the same point x to give the same label. We apply the general analysis and ad-hoc considerations to get a noise-robust version of Jackson's Harmonic Sieve, which learns DNF under the uniform distribution. This corrects an error in his earlier analysis of noise tolerant DNF learning.
Fuzzy control of ABR traffic flow in ATM LANs
Authors: Y. A. Sekercioglu, A. Pitsillides
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

High-speed LANs are beginning to migrate from shared media to switch based configurations (commonly based on ATM architectures). Because of the characteristics of ATM networks and nature of LAN traffic, there is a need for effective congestion control strategies to be developed in order to maintain the network utilization and throughput at optimum levels. We describe and report the simulation results of a novel congestion control strategy based on the principles of fuzzy logic control for the management of ABR traffic in ATM LANs. We propose that fuzzy logic control is an effective scheme for designing congestion control mechanisms in ATM LANs. Our simulations show that, proposed fuzzy backward congestion notification (FBCN) method is effective in minimizing cell losses at the switch queues and prevents time consuming packet retransmissions which can dramatically degrade the network throughput.
Efficient Point Location in a Convex Spatial Cell Complex
Authors: Franco P. Preparata, Roberto Tamassia
Venue:  (1989)

In this paper we propose a new approach to point location in a three-dimensional cell complex {\em P}, which may be viewed as a nontrivial generalization of a corresponding two-dimensional technique due to Sarnak and Tarjan. Specifically, in a space-sweep of {\em P}, the intersections of the sweep-plane with {\em P} occurring in a slab, i.e., between two consecutive vertices, are topologically conformal planar subdivisions. If we view the sweep direction as time, the descriptions of the various slabs are distinct ``versions'''' of a two-dimensional point location data structure, dynamically updated each time we sweep a vertex. Combining the persistence-addition techniques of Driscoll {\em et al.}. with our recently discovered dynamic structure for planar point location in monotone subdivisions, we obtain a method with query time $O( \log ^ 2 N)$ and space $O( N \log ^2 N)$ for point location in a convex cell complex with {\em N} facets.
An Adaptive Multihop Clustering Scheme for Highly Mobile Ad Hoc Networks
Authors: Tomoyuki Ohta, Shinji Inoue, Yoshiaki Kakuda
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

A clustering scheme for ad hoc networks is aimed at managing a number of mobile devices by utilizing hierarchical structure of the networks. In order to construct and maintain an effective hierarchical structure in ad hoc networks where mobile devices may move at high mobility, thefollowing requirements must be satisfied. (1) The role of each mobile device for the hierarchical structure is adaptive to dynamic change of the topology of the ad hoc networks. The role of each mobile device should thus change autonomously based on the local information. (2) The overhead for management of the hierarchical structure is small. The number of mobile devices in each cluster should thus be almost equivalent. This paper proposes an adaptive multi-hopclustering scheme for highly mobile ad hoc networks. The results obtained by extensive simulation experiments show that the proposed scheme does not depend on mobility and node degree of mobile devices in the network, which satisfy the above requirements.
A Fundamental Failure Model for Fault-Tolerant Protocols
Authors: Klaus Echtle, Asif Masum
Venue: Proceedings of the 4th International Computer Performance and Dependability Symposium (2000)

The application area of distributed systems determines the extent to which protocols must provide fault detection and/or fault tolerance. Highest dependability cannot be obtained without the cost of a substantial overhead. In order to reduce the message number and the time consumption, protocols should be tailored best to application requirements and system properties.This paper presents a novel failure classification as an instrument to limit fault detection and tolerance features to a reasonable failure set. Evaluation of protocols shows that just exclusion of "exotic" failures, which are most unlikely to occur, enable a drastic increase in efficiency. Unlike other approaches, our failure classification is based on a completely functional model and on the definition of so-called failure capabilities. This overcomes the limitations of strictly hierarchic and time/value-based models. The new approach provides a framework to precisely specify common failure assumptions as well as very specialized scenarios - in particular so-called non-cooperative Byzantine failures.
Mapping asynchronous parallel simulation on a network of workstations
Authors: Seng Chuan Tay, Yong Meng Teo
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

This paper examines the performance of mapping schemes used in parallel simulation on a network of workstations. A conservative parallel simulation of multistage interconnection networks is used as an example in our analytical model. Performance metrics such as elapsed time, speedup and simulation bandwidth associated with different schemes for partitioning/mapping parallel simulation onto physical processors are evaluated. Our studies show that a perfectly balanced workload distribution may not necessary translate into better performance. We also show in both analytical and implementation results that inter-processors communication overheads incurred in a balanced mapping may occasionally cause dominant aggravation to the program elapsed time.
On neighbors in geometric permutations
Authors: Micha Sharir, Shakhar Smorodinsky
Venue: Discrete Mathematics (2003)

We introduce a new notion of 'neighbors' in geometric permutations. We conjecture that the maximum number of neighbors in a set S of n pairwise disjoint convex bodies in Rd is O(n), and we prove this conjecture for d = 2. We show that if the set of pairs of neighbors in a set S is of size N, then S admits at most O(Nd-1) geometric permutations. Hence, we obtain an alternative proof of a linear upper bound on the number of geometric permutations for any finite family of pairwise disjoint convex bodies in the plane.
Integrating Functional and Imperative Parallel Programming: C++ Solutions to the Salishan Problems
Authors: John Thornley
Venue:  (1993)

We investigate the practical integration of functional and imperative parallel programming in the context of a popular sequential object-based language. As the basis of our investigation, we develop solutions to the Salishan Problems, a set of problems intended as a standard by which to compare parallel programming notations. The language that we use is CC++, C++ extended with single- assignment variables, parallel composition, and atomic functions. We demonstrate how deterministic parallel programs can be written that are identical--except for the addition of a few keywords--to sequential programs that satisfy the same specifications.
Visualization in Detection of Intrusions and Misuse in Large Scale Networks
Venue: Proceedings of the International Conference on Information Visualisation (2000)

The Internet is quickly becoming entrenched in the communication and commercial sectors of everyday life. With this movement away from traditional fixed infrastructure, we are also moving away from the traditional securities placed within fixed infrastructure. This has led to increasing numbers of attacks designed to infiltrate or disrupt the activities being performed by companies and individuals on the Internet. We are exploring the applicability of visualization techniques in conjunction with a well-known intrusion detection system (Hummer) for the detection and analysis of misuse of computer systems connected to the Internet. The visualization techniques will allow users to identify the behavior of users connecting to the system and identify those whose intentions are unwelcome.
An Application for the T-20: A Vector Interpreter
Authors: Donna Bergmark
Venue:  (1986)

An FPS T-20 hypercube has been on site at Cornell University since the end of May, 1986. We have been porting an existing Fortran application to this machine. This report describes that work, and should be of interest to others engaged in the challenge of programming the T-series. The first section of this report discusses the program being ported, and its potential for parallelism. Subsequent sections deal with individual issues as they came up, design decisions taken and why, and performance tuning. The final section consists of some conclusions which can be made about doing applications on the T-Series.
Solving Lp-Norm Problems and Applications
Authors: Yuying Li
Venue:  (1993)

The lp norm discrete estimation problem (formula omitted) has been solved in many data analysis applications, e.g., geophysical modeling. Recently, a new globally convergent Newton method (called GNCS) has been proposed for solving lp problems with 1>p>2 [5]. This method is much faster than the widely used IRLS method when 1>p1.5. In this paper, modification is made to the line search procedure so that the GNCS method is applicable forlp problems with 1>p>(infinity). The global convergence results for l1 problems are obtained under weaker assumptions than required in [2]. In addition, the usefulness of lp norm solution with 1>p>2 is demonstrated by applying the GNCS algorithm to a synthetic geophysical tomographic inversion problem. Additional numerical results are included to support the efficiency of GNCS. 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
Multicomponent, Multiphase Thermodynamics of Swelling Porous Media with Electroquasistatics: II. Constitutive Theory
Authors: L. S. Bennethum, J. H. Cushman
Venue:  (2000)

In Part I macroscopic field equations of mass, linear and angular momentum, energy, and the quasistatic form of Maxwell''s equations for a multiphase, multicomponent medium were derived. Here we exploit the entropy inequality to obtain restrictions on constitutive relations at the macroscale for a 2-phase, multiple-constituent, polarizable mixture of fluids and solids. Specific emphasis is placed on charged porous media in the presence of electrolytes. The governing equations for the stress tensors of each phase, flow of the fluid through a deforming medium, and diffusion of constituents through such a medium are derived. The results have applications in swelling clays (smectites), biopolymers, biological membranes, pulsed electrophoresis, chromotography, drug delivery, and other swelling systems.
Testing Nondeterminate Systems
Authors: Tim Menzies, Bojan Cukic, Harhsinder Singh, John Powell
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

The behavior of nondeterminate systems can be hard to predict, since similar inputs at different times can generate different outputs. In other words, the behavior seen during testing process may not be seen at runtime. Due to the uncertainties associated with nondeterminism, the standard view is that we should avoid such nondeterminate systems, especially for systems requiring high reliability. While this is a valid guideline, at least in two application areas such nondeterminacy is unavoidable. Early life cycle requirements and AI software are becoming widely used. Yet, both are imprecise and may exhibit nondeterminate behaviour if explored rigorously by a test device. Based on a literature review and some theoretical studies, we argue that many stable properties exist within the space of all possible nondeterminate behaviors. However, we also show that seemingly trivial changes to a nondeterministic system can turn an easily testable system into an impossibly hard system to test. Finally, we stress that this analysis does not imply a correlation between stable zones of nondeterminate testability and the ultimate maintainability of nondeterminate systems. That is, while we are optimistic about testing nondeterminate systems we remain cautious about the maintenance of such systems.
A Compact Intermediate Format for SimICS
Authors: Peter S. Magnusson, David Samuelsson
Venue:  (1994)

Instruction set architecture (ISA) simulators are an increasingly popular class of tools for both research and commercial purposes. Common applications include trace generation, program development, and compatibility support. A major concern with ISA simulators is performance and memory overhead. A common technique for achieving good performance is to use threaded code, which involves translating the target object code to an intermediate format which is subsequently interpreted. We describe such an internal format, which we call the 64-bit format, that is compact and meets a range of requirements in terms of flexibility and simplicity. We show how a simulator using this format can be implemented efficiently by taking advantage of extensions to the C language supported by the GNU C compilers. We have used the format to write the core interpreter in SimICS, a system level multiprocessor simulator that supports the Motorola 88110 and the SPARC V8 instruction sets.
Using coordination to parallelize sparse-grid methods for 3D CFD problems
Authors: C. T.H. Everaars, Barry Koren
Venue:  (1997)

The good parallel computing properties of sparse-grid solution techniques are investigated. For this, an existing sequential CFD code for a standard 3D problem from computational aerodynamics is restructured into a parallel application. The restructuring is organized according to a master/slave protocol. The coordinator modules developed thereby are implemented in the coordination language Manifold and are generally applicable. Performance results are given for both the sequential and parallel version of the code. The results are promising, the paper contributes to the state-of-the-art in improving the efficiency of large-scale computations. Also a theoretical analysis is made of speed-up through parallelization in a multi-user single-machine environment.
Hacker's Guide to Visual FoxPro 7.0, 3 edition
Authors: Tamar E. Granor, Ted Roche, Steven M. Black, Della Martin, Doug Hennig
Venue:  (2002)

:An irreverent look at how Visual FoxPro really works, this guide gives developers insight into every command, function, event, and method of version 7.0, including Service Pack One. Recognized within the FoxPro developer community as the indispensable resource for serious FoxPro development, this updated edition covers Visual FoxPro's Power Tools and the various components of the language, including Xbase traditions and assumptions. Also included are hardware tips and optimization guidelines. Subjects such as Active technologies as they relate to VFP, the Class Browser and Component Gallery, VFP's Builder and Wizard technologies, and VFP's version of IntelliSense are covered in detail.Author Biography: Tamar E. Granor is a FoxPro and Visual FoxPro developer and has served as the editor of FoxPro Advisor. She lives in Elkins Park, Pennsylvania. Ted Roche is the coauthor of Hacker's Guide to Visual FoxPro 6.0 and a seven-time winner of the Microsoft Support Most Valuable Professional Award. He lives in Contoocook, New Hampshire. Doug Hennig is the coauthor of What's New in Visual FoxPro 7 and writes the monthly Reusable Tools column in FoxTalk. He lives in Regina, Saskatchewan. Della Martin is the co-author of Microsoft Office Automation with Visual FoxPro, has written for FoxPro Advisor and served as a judge for the 1998 and 1999 Visual FoxPro Excellence Awards. She lives in Cary, North Carolina.
Work Efficient Hashing on Parallel and Vector Computers
Authors: Thomas J. Sheffler, Randal E. Bryant
Venue:  (1992)

Hashing techniques have long been used to efficiently store and locate data indexed by key. Recently, parallel hashing algorithms have been developed that allow table insertion of many keys in a few parallel steps. The analyses of these algorithms have focused on the expected number of steps required, ignoring the issue of work complexity. As a result, these algorithms have not been work efficient. In this paper, we present a parallel hashing algorithm that is shown to be work efficient because it performs no more work than its serial counterpart. An analysis of its behavior shows that it performs S = O(log n) expected parallel steps and W = O(n) expected work. Many parallel algorithms can make use of hashing as a core step. Procedures such as histogramming, set difference, keyed reduction and dictionary lookup can be formulated using a general hash routine. Thus, parallel hashing is an important fundamental parallel operation. The above applications may also be implemented using sorting as the core step. While the use of parallel hashing has been generally accepted in the folklore of parallel computing, a dearth of literature about the expected performance of such algorithms has led many to favor the use of sorting. This paper sheds light on the performance that may be achieved using parallel hashing algorithms and should lend credibility to their use. Performance data collected from an implementation of our algorithms on the Connection Machine CM-2 and CRAY Y-MP show that it is faster than sorting by up to a factor of four on both machines. These data show that the total time required by the algorithm is more closely related to the amount of work performed, rather than the parallel step count. Our results indicate that work efficiency is an important consideration when trying to achieve high performance on parallel machines.
Application of Collaborative Supported Frame Accurate Animation for Bridge Construction Project
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

During a civil engineering construction process many types of professionals are involved, such as engineers, constructors, designers, clients and so forth. To provide mutual understanding among construction workers and unify their ideas is necessary the creation of an effective presentation. In addition, the construction process have to work relatively in harmony with the situation of the construction site. Moreover, the use of Computer Graphics (CG) can help to visualize clearly sequences of the construction process, simulate changes in the execution of the project and make it possible to be carried out smoothly before the construction begins. The paper introduces the application of Frame Accurate Animation (FAA) as an important implement for the construction management. Also explains the use of FAA in an illustrative example of the Sashiki Bridge (provisional name) construction project in Kumamoto. Our main expectation is for the work environmental become more cooperative, efficient and safely.
Understanding the Sources of Software Defects: A Filtering Approach
Authors: Claes Wohlin, Martin Höst, Magnus C. Ohlsson
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

This paper presents a method proposal of how to use product measures and defect data to enable understanding and identification of design and programming constructs that contribute more than expected to the defect statistics. The paper describes a method that can be used to identify the most defect-prone design and programming constructs and the method proposal is illustrated on data collected from a large software project in the telecommunication domain. The example indicates that it is feasible, based on defect data and product measures, to identify the main sources of defects in terms of design and programming constructs. Potential actions to be taken include less usage of particular design and programming constructs, additional resources for verification of the constructs and further education into how to use the constructs.
Scalable storage for a DBMS using transparent distribution
Authors: Jonas S. Karlsson, Martin L. Kersten
Venue:  (1997)

Scalable Distributed Data Structures (SDDSs) provide a self-managing and self-organizing data storage of potentially unbounded size. This stands in contrast to common distribution schemas deployed in conventional distributed DBMS. SDDSs, however, have mostly been used in synthetic scenarios to investigate their properties.