ppxscal/embedding_network huggingface dataset:
A Direct Method for 3D Factorization of Nonrigid Motion Observed in 2D
Authors: Matthew Brand
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

The nonrigid structure-from-motion (NSFM) problem seeks to recover a sequence of 3D shapes, shape articulation parameters, and camera view matrices from 2D correspondence data. Factorization approaches relate the principal subspaces of the data matrix to the desired parameters through a linear corrective transform. Current methods for finding this transform are heuristic or depend on strong assumptions about the data. We show how to solve for this transform by directly minimizing deviation from the required orthogonal structure of the projection/articulation matrix. The solution is exact for noiseless data and an order of magnitude more accurate than state-of-the-art methods for noisy data.
On maximizing the lifetime of distributed information in ad-hoc networks with individual constraints
Authors: Cédric Westphal
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

Ad-Hoc Networks and in particular sensor networks are networks of nodes with limited battery and limited processing capacity. As such, a single node carries an incentive to limit the amount of data it contains. This leads to the expiration of the data carried by the node after a period of time, due for instance, to a re-boot after an off period in the duty cycle, or to older information being "pushed" out by new data received by the mobile node. On the other hand, some data is critical to the functioning of the whole network. For instance, the existence and position of a gateway towards the infrastructure network should be kept somewhere in the network, so that nodes are able to recover this information when needed. In this paper, we study the trade-off between the finite lifetime of a piece of information at each node, and the survival of this information indefinitely within the network. We consider a simple dissemination process for the information akin to an AODV-based information request/reply mechanism. We show that the maximum number of hops in a request is a critical parameter to ensure the survivability indefinitely of any information within the network. We identify the parameter which minimizes the load on the network, for two typical ad-hoc network topologies: a square lattice, which accurately models the distribution of the nodes in a fixed and organized ad hoc or sensor network, and a n-ary tree, which models ad hoc networks for which routing is constructed so as to have no routing loops.
From the Editor in Chief: Water Music
Authors: Robert E. Filman
Venue: IEEE Internet Computing (2005)

I worry about many things - among them, the Internet. Although its bidirectional availability means anyone can be a publisher, for a quite modest price, several forces threaten the kingdom, including vandals, governments, and economics.
Hardware Support for Prescient Instruction Prefetch
Authors: Tor M. Aamodt, Paul Chow, Per Hammarlund, Hong Wang, John P. Shen
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

This paper proposes and evaluates hardware mechanisms for supporting prescient instruction prefetch ¿ an approach to improving single-threaded application performance by using helper threads to perform instruction prefetch. We demonstrate the need for enabling store-to-load communication and selective instruction execution when directly pre-executing future regions of an application that suffer I-cache misses. Two novel hardware mechanisms, safe-store and YAT-bits, are introduced that help satisfy these requirements. This paper also proposes and evaluates .nite state machine recall, a technique for limiting pre-execution to branches that are hard to predict by leveraging a counted I-prefetch mechanism. On a research Itanium®SMT processor with next line and streaming I-prefetch mechanisms that incurs latencies representative of next generation processors, prescient instruction prefetch can improve performance by an average of 10.0% to 22% on a set of SPEC 2000 benchmarks that suffer significant I-cache misses. Prescient instruction prefetch is found to be competitive against even the most aggressive research hardware instruction prefetch technique: fetch directed instruction prefetch.
Marker-Controlled Perception-Based Mesh Segmentation
Authors: Chi Zhang, Ning Zhang, Chengjun Li, Guoping Wang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper introduces an interactive marker-controlled mesh segmentation algorithm. In many applications, we need to partition a given mesh according to human perception or particular requirements. The algorithm presented in this paper is based on Fast Marching Watersheds. We refer to the experience of image segmentation area and introduce interactive marker selection. Thus we obviously overcome the difficulty in intuitional segmentation control, and improve the quality of segmentation. The output results show the effectiveness and practicability of the algorithm.
Benefit of Limited Time Sharing in the Presence of Very Large Parallel Jobs
Authors: Su-Hui Chiang, Chuyong Fu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

This paper provides a comprehensive performance evaluation of job scheduling policies for parallel systems on which large jobs require the maximum or close to the maximum resource available on the system. A wide range of policies are evaluated, including nonpreemptive Backfill policies, time-sharing with Gang Scheduling, and dynamic Equi-spatial policies. Through detailed performance analysis, key problems of each class of policies are identified. As a simpler alternative to Gang Scheduling and Equi-spatial, we propose using a short runtime limit (e.g., one hour as opposed to 10's hours) for Backfill policies. Our simulation results show that applying a short runtime limit on jobs that request a sufficiently large number of processors has the potential to significantly improve FCFS-Backfill policies for all job classes in most workloads studied.
Natural language project: Istituto di Psicologia, Roma, Italy
Authors: Cristiano Castelfranchi, Domenico Parisi, Oliviero Stock
Venue: Issue 79 (January 1982) (1982)

(1) Explicit and detailed specification of performance to be obtained and of input to system. (2) "Occam's Razor: Do not introduce anything on the basis of tradition or a priori philosophy (e.g. NP, [for all] x, extension vs. intension). Introduce only such structure as is necessary to produce the performance to be obtained. (3) Do not restrict excessively the range of linguistic facts to be considered. The system must comprehend or produce at least 75% of a page in a newspaper. (4) Do not try to obtain directly overall and "deep" comrehension. First get literal comprehension, close to linguistic input. Obtain the rest with successive processes. (5) Avoid "cosmetics": e.g. in production don't have the machine produce expressions that "ape" human behavior but that the machine does not understand. (6) Stay close to natural logic: vagueness, contradictions, natural language quantifiers, not absolute and not metric time, etc.
Performance Evaluation of a Bandwidth Requirements Reduction Technique Based on Timely State Update
Authors: Wentong Cai, Stephen John Turner, Suiping Zhou, Junhu Wei, Wenbo Zong
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

An important issue in distributed real-time simulation is to reduce the amount of data transmitted amongst distributed simulation nodes so that the state updates of simulation entities can be sent to other simulation nodes in a timely manner. To address this issue, we have previously proposed a consistency model to determine the update interval of entities based on their relative importance, a utility model to compute the relative importance of entities, and a flexible state update mechanism to ensure updating within these intervals and to balance the number of updates in each simulation frame. In this paper, we focus on the performance evaluation of these timely state update mechanisms. Using a battlefield benchmark, the performance is evaluated in terms of the total amount of data exchanged, the number of simulation frames skipped, and the number ofGo-Through-Accidents occurring during the simulation. The performance results indicate that the mechanisms can significantly reduce the bandwidth requirements while maintaining or even improving the consistency of the simulation.
On exploring inter-iteration parallelism within rate-balanced multirate multidimensional DSP algorithms
Authors: Dongming Peng, Mi Lu
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2005)

Although the notion of the parallelism in multidimensional applications has existed for a long time, it is so far unknown what the bound (if any) of inter-iteration parallelism in multirate multidimensional digital signal processing (DSP) algorithms is, and whether the maximum inter-iteration parallelism can be achieved for arbitrary multirate data flow algorithms. This paper explores the bound of inter-iteration parallelism within rate-balanced multirate multidimensional DSP algorithms and proves that this parallelism can always be achieved in hardware system given the availability of a large number of processors and the interconnections between them.
Reason 3 Power!
Authors: Catherine Karayanis
Venue:  (2005)

Coverage includes- Matt Piper has indulged his passion for music technology as a recording engineer, music producer, studio owner, musician/composer, and experimental music promoter since moving to Los Angeles in 1991. Piper can currently be found in music venues around town playing with the multi-laptop improvisational group Remote Viewing. Michael Prager has been involved with music technology for over 10 years and has worked for such companies as Cakewalk, Steinberg, Disney Interactive, Spectrasonics, Q Up Arts, Sony Classical, audioMIDI.com, the Columbia College Hollywood, and Keyboard Magazine. Prager has worked on various ArtistPro instructional DVDs and is the author of several books and CD-ROMs from Thomson Course Technology PTR, including Reason 2.5 Power!, Reason CSi Starter, Reason CSi Master, and Sampling and Soft Synth Power! In-depth explanation of Reason's functionalities provides readers with a complete understanding of the software. Includes a Limited Edition CSi CD-ROM which offers tutorials from "Reason 3 CSi Starter" and "Reason 3 CSi Master". Covering the most up-to-date version of Reason, this book is the next edition to the successful "Reason 2.5 Power" (1-59200-138-6). Geared toward intermediate users of Reason who are seeking a better overall understanding of this powerful application. New series look and feel offers an effective and easy-to-follow layout to improve the learning experience for loyal as well as new Power! series readers.
End-to-End Quality of Service Management for Distributed Real-Time Embedded Applications
Authors: Prakash Manghwani, Joseph Loyall, Praveen Sharma, Matthew Gillen, Jianming Ye
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

Many of the world's most critical systems are distrib-uted real-time embedded (DRE) systems, with mission-critical quality of service (QoS) requirements. However, because of theirnature - heterogeneous nodes and links, shared and constrained resources, and deploymentin dy-namic environments - providing QoS requires coordi-nated QoS management throughout the system of multiple end-to-end application streams competing for shared re-sources. It requires dynamic resource allocation to these end-to-end application streams based on potentially changing mission requirements and shaping application behaviors to effectively use the resources that are allocated. In this paper, we describe the issues involved with providing end-to-end QoS management in DRE systems, an architecture we have designed to support system-wide end-to-end QoS management, and a multi-UAV surveillance and target tracking application we are using to evaluate these technologies.
Tools and techniques for rapid porting
Authors: Joe McCarthy
Venue: Proceedings of the 5th conference on Message understanding (1993)

Each of the four presentations in this special topic session focused on issues that arise in porting an information extraction system to a new domain or on specific tools that are used to accomplish this task.
A proposed classification scheme for computer program libraries
Authors: John Bolstad
Venue: ACM SIGNUM Newsletter (1975)

Most computer installations maintain a subroutine library to support the needs of their users. As these libraries grow larger, it becomes increasingly evident that some sort of organization of them is needed--even more than a library of books. One aid in organizing software inventories is a classification scheme, and the most widely used such system is the "old" SHARE system. However, this system has several major defects. A new scheme is proposed which attempts to remedy these defects, and which maintains some degree of compatibility with the present scheme.
Second order smoothness over extraordinary vertices
Authors: Charles Loop
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

Catmull & Clark subdivision is now a standard for smooth free-form surface modeling. These surfaces are everywhere curvature continuous except at points corresponding to vertices not incident on four edges. While the surface has a continuous tangent plane at such a point, the lack of curvature continuity presents a severe problem for many applications. Topologically, each n-valent extraordinary vertex of a Catmull & Clark limit surface corresponds to an n-sided hole in the underlying 2-manifold represented by the control mesh. The problem we address here is: How to fill such a hole in a Catmull & Clark surface with exactly n tensor product patches that meet the surrounding bicubic patch network and each other with second order continuity. We convert the problem of filling the hole with n tensor product patches in the spatial domain into the problem of filling the hole in the n frequency modes with a single bidegree 7 tensor product patch.
Privacy and proportionality: adapting legal evaluation techniques to inform design in ubiquitous computing
Authors: Giovanni Iachello, Gregory D. Abowd
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

We argue that an analytic proportionality assessment balancing usefulness and burden on individual or group privacy must be conducted throughout the design process to create acceptable ubiquitous computing (ubicomp) applications and services. We introduce the principle of proportionality, which originates within the legal and data protection communities. Inspired by this principle, we develop a design method for ubicomp applications, based on our own experience, and aimed at HCI practitioners and designers. We discuss the method in relation to real-world examples, user inquiry techniques and requirements engineering models. Finally, we report a sample application of the method, involving a ubiquitous, personal memory aid tool.
Evaluating paper prototypes on the street
Authors: David G. Hendry, Sara Mackenzie, Ann Kurth, Freya Spielberg, Jim Larkin
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The evaluation of paper prototypes is normally conducted in controlled settings such as a usability lab. This paper, in contrast, reports on a study where evaluations of a paper prototype were performed on the street with young adults. We discuss the merits of this approach and how it impacted the design process. A key finding is that the street location can enfranchise people who may otherwise be under-represented in design. We conclude that evaluating paper prototypes in public, street settings is feasible and informative.
Impact analysis of a vertical flared back bridge rail-to-guardrail transition structure using simulation
Authors: Ali O. Atahan, Omer F. Cansiz
Venue: Finite Elements in Analysis and Design (2005)

Bridge rail-to-guardrail transitions are designed to shield unprotected ends of bridge rails, which are fixed-obstacle hazards. These structures should provide an effective transition between longitudinal barriers with different lateral stiffness and contain and redirect impacting vehicles without any contact with the rigid sections of the system. Recently, a full-scale crash test was performed on a vertical flared back concrete bridge rail-to-guardrail transition design to evaluate its compliance with the NCHRP Report 350 test level 3 requirements. Due to vehicle rollover the design failed to meet the requirements. To gain an insight about the crash test details, a finite element simulation study was performed. Accuracy of the simulation was verified using qualitative and quantitative comparisons. Based on in-depth examination of crash test and simulation recordings, W-beam height of 685 mm was determined to be the main cause for vehicle rollover. In the light of this finding, the current transition model was modified to have 810 mm top rail height. Subsequent simulation results predict that the improved model performs much better in containing and redirecting the impacting vehicle in a stable manner. No wheel snagging was observed due to increased rail height. The overall performance of the transition design was so good that consideration is given to testing it to next level of testing, test level 4. Therefore, a follow up finite element simulation study is recommended.
Finding feasible mold parting directions using graphics hardware
Authors: Rahul Khardekar, Greg Burton, Sara McMains
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

We present new programmable graphics hardware accelerated algorithms to test the castability of geometric parts and assist with part redesign. These algorithms efficiently identify and graphically display undercuts and minimum and insufficient draft angles. Their running times grow only linearly with respect to the number of facets in the solid model, making them efficient subroutines for our algorithms that test whether a tessellated CAD model can be manufactured in a two-part mold. We have developed and implemented two such algorithms to choose candidate directions to test for castability using accessibility analysis and Gauss maps. The efficiency of these algorithms lies in that they identify groups of candidate directions such that if any one direction in the group is not castable, none are, or if any one is castable, all are. We examine trade-offs between the algorithms' speed, accuracy, and whether they guarantee that a castable direction will be found for a part if one exists.
Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
Authors: Josef Dick, Gunther Leobacher, Friedrich Pillichshammer
Venue: SIAM Journal on Numerical Analysis (2005)

We introduce a new construction method for digital nets which yield point sets in the s-dimensional unit cube with low star discrepancy. The digital nets are constructed using polynomials over finite fields. It has long been known that there exist polynomials which yield point sets with low (unweighted) star discrepancy. This result was obtained by Niederreiter by the means of averaging over all polynomials. Hence concrete examples of good polynomials were not known in many cases. Here we show that good polynomials can be found by computer search. The search algorithm introduced in this paper is based on minimizing a quantity closely related to the star discrepancy.It has been pointed out that many integration problems can be modeled by weighted function spaces and it has been shown that in this case point sets with low weighted discrepancy are required. Hence it is particularly useful to be able to adjust a point set to some given weights. We are able to extend our results from the unweighted case to show that this can be done using our construction algorithms. This way we can find point sets with low weighted star discrepancy, making such point sets especially useful for many applications.
On best rational approximation of analytic functions
Authors: V. A. Prokhorov
Venue: Journal of Approximation Theory (2005)

This paper contains some theorems related to the best approximation ρn(f; E) to a function f in the uniform metric on a compact set E ⊂ C- by rational functions of degree at most n. We obtain results characterizing the relationship between ρn(f; K) and ρn(f; E) in the case when complements of compact sets K and E are connected, K is a subset of the interior Ω of E, and f is analytic in Ω and continuous on E.
SERAT: SEcure role mApping technique for decentralized secure interoperability
Authors: Mohamed Shehab, Elisa Bertino, Arif Ghafoor
Venue: Proceedings of the tenth ACM symposium on Access control models and technologies (2005)

Multi-domain application environments where distributed domains interoperate with each other are becoming a reality in internet-based and web-services based enterprise applications. The secure interoperation in a multidomain environment is a challenging problem. In this paper, we propose a distributed secure interoperability protocol that ensures secure interoperation of the multiple collaborating domains without compromising the security of collaborating domains. We introduce the idea of access paths and access paths constraints. Furthermore, we device a path discovery algorithm that is capable of querying interoperating domains for the set of secure access paths between different domains.
Deriving Systems Level Security Properties of Component Based Composite Systems
Authors: Khaled M. Khan, Jun Han
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

This paper proposes an approach of defining systems-level security properties of component-based composite systems. It argues that the security properties of a composite system can be viewed either from the end-usersý point of view, or from the software integratorsý point of view. End users look more for the ultimate security goals achieved in the composite system, whereas software integrators are more interested in the compositional security properties of the system in terms of the required and ensured properties. Software integrators need to know how a composite system could be assembled further as a coarse-grained component with other applications. It is equally important for the end user of the system to know the actual security objectives achieved at the systems-level.
Development of Haptic Rendering Methods of Rigidity Distribution for Tool-Handling Type Haptic Interface
Authors: Hiroaki Yano, Masaki Nudejima, Hiroo Iwata
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper describes a haptic rendering method for perception of rigidity distribution using a tool-handing type haptic interface. Since the data of rigidity distribution is different from cardinal number data measured with CT or MRI, we can only perceive rigidity value only when we deform it. We developed a rigidity data mapping method like a spring model by considering cross-section of 3D rigidity distribution. We confirmed that our method is effective for rigidity distribution perception.