ppxscal/embedding_network huggingface dataset:
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems
Authors: Roy Friedman
Venue: IEEE Transactions on Dependable and Secure Computing (2005)

This paper is on the Consensus problem in asynchronous distributed systems where (up to f) processes (among n) can exhibit a Byzantine behavior, i.e., can deviate arbitrarily from their specification. One way to solve the Consensus problem in such a context consists of enriching the system with additional oracles that are powerful enough to cope with the uncertainty and unpredictability created by the combined effect of Byzantine behavior and asynchrony. This paper presents two kinds of Byzantine asynchronous Consensus protocols using two types of oracles, namely, a common coin that provides processes with random values and a failure detector oracle. Both allow the processes to decide in one communication step in favorable circumstances. The first is a randomized protocol for an oblivious scheduler model that assumes n>5f. The second one is a failure detector-based protocol that assumes n>6f. These protocols are designed to be particularly simple and efficient in terms of communication steps, the number of messages they generate in each step, and the size of messages. So, although they are not optimal in the number of Byzantine processes that can be tolerated, they are particularly efficient when we consider the number of communication steps they require to decide and the number and size of the messages they use. In that sense, they are practically appealing.
Friction Modeling and Compensation for Haptic Interfaces
Authors: Nicholas L. Bernstein, Dale A. Lawrence, Lucy Y. Pao
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Friction cancellation and high gain force feedback are studied for their relative benefits in mitigating the effects of friction in haptic interfaces. Although either technique alone is capable of significant improvements, we find that a combination of approximate cancellation coupled with variable-gain low-bandwidth force feedback provides excellent friction reduction and is more robust. This improves the feel of the haptic interface, and provides significant linearization of the interface dynamics for more accurate model-based control.
A Framework for Dynamic Service Adaptation in the Grid: Next Generation Software Program Progress Report
Authors: Jon B. Weissman, Seonho Kim, Darin England
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

This project addresses the problem of dynamic service adaptation in the Grid. The need for adaptation arises due to both resource and service demand uncertainty. With NGS support, we are tackling several key issues in this problem space: (1) a dynamic OGSA-based Grid service architecture to support dynamic service hosting - where to host and re-host a service within the Grid in response to service demand and resource fluctuation, (2) resource management middleware that dynamically decides how many resources to allocate to a request and where a request should run, (3) a dynamic leasing framework that decides how many resources to lease to a service to handle future requests, (4) and a new model of service robustness that can describe the sensitivity of a service to Grid fluctuations. In this short report, we present material on (1) and (3) in the interest of brevity. Papers describing all aspects of the project are contained in the bibliography.
Current trends in the integration of searching and browsing
Authors: Andrei Z. Broder, Yoelle S. Maarek, Krishna Bharat, Susan Dumais, Steve Papa, Jan Pedersen, Prabhakar Raghavan
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Searching and browsing are the two basic information discovery paradigms, since the early days of the Web. After more than ten years down the road, three schools seem to have emerged: (1) The search-centric school argues that guided navigation is superfluous since free form search has become so good and the search UI so common, that users can satisfy all their needs via simple queries (2) The taxonomy navigation school claims that users have difficulties expressing informational needs and (3) The meta-data centric school advocates the use of meta-data for narrowing large sets of results, and is successful in e-commerce where it is known as "multi faceted search". This panel brings together experts and advocates for all three schools, who will discuss these approaches and share their experiences in the field. We will ask the audience to challenge our experts with real information architecture problems.
Full-Fledged Algebraic XPath Processing in Natix
Authors: Matthias Brantner, Sven Helmer, Carl-Christian Kanne, Guido Moerkotte
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

We present the first complete translation of XPath into an algebra, paving the way for a comprehensive, state-of-the-art XPath (and later on, XQuery) compiler based on algebraic optimization techniques. Our translation includes all XPath features such as nested expressions, position-based predicates and node-set functions. The translated algebraic expressions can be executed using the proven, scalable, iterator-based approach, as we demonstrate in form of a corresponding physical algebra in our native XML DBMS Natix. A first glance at performance results shows that even without further optimization of the expressions, we provide a competitive evaluation technique for XPath queries.
Note on the homogeneous set sandwich problem
Authors: Celina M. H. de Figueiredo, Vinícius G. P. de Sá
Venue: Information Processing Letters (2005)

A homogeneous set is a non-trivial module of a graph, i.e., a non-unitary, proper subset H of a graph's vertices such that all vertices in H have the same neighbors outside H. Given two graphs G1(V, E1), G2(V, E2), the Homogeneous Set Sandwich Problem asks whether there exists a sandwich graph GS(V, ES), E1 ⊆ ES ⊆ E2, which has a homogeneous set. Recently, Tang et al. [Inform. Process. Lett. 77 (2001) 17-22] proposed an interesting O(Δ1 ċ n2) algorithm for this problem, which has been considered its most efficient algorithm since. We show the incorrectness of their algorithm by presenting three counterexamples.
Efficient algorithms for large-scale topology discovery
Authors: Benoit Donnet, Philippe Raoult, Timur Friedman, Mark Crovella
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

There is a growing interest in discovery of internet topology at the interface level. A new generation of highly distributed measurement systems is currently being deployed. Unfortunately, the research community has not examined the problem of how to perform such measurements efficiently and in a network-friendly manner. In this paper we make two contributions toward that end. First, we show that standard topology discovery methods (e.g., skitter) are quite inefficient, repeatedly probing the same interfaces. This is a concern, because when scaled up, such methods will generate so much traffic that they will begin to resemble DDoS attacks. We measure two kinds of redundancy in probing (intra- and inter-monitor) and show that both kinds are important. We show that straightforward approaches to addressing these two kinds of redundancy must take opposite tacks, and are thus fundamentally in conflict. Our second contribution is to propose and evaluate Doubletree, an algorithm that reduces both types of redundancy simultaneously on routers and end systems. The key ideas are to exploit the tree-like structure of routes to and from a single point in order to guide when to stop probing, and to probe each path by starting near its midpoint. Our results show that Doubletree can reduce both types of measurement load on the network dramatically, while permitting discovery of nearly the same set of nodes and links.
A student model for object-oriented design and programming
Authors: Fang Wei, Sally H. Moritz, Shahida M. Parvez, Glenn D. Blank
Venue: Journal of Computing Sciences in Colleges (2005)

"Objects-first" is an increasingly popular strategy for teaching object-oriented programming by introducing the concepts of objects, classes, and instances before procedural elements of a programming language. Learning object-oriented design and programming is a challenging task for many beginning students. We represent CIMEL ITS, which is an intelligent tutoring system that provides one-on-one tutoring to help beginners learn object-oriented analysis and design, using elements of UML before implementing any code. We also present a three-layered Student Model which supports adaptive tutoring by inferring the problem-specific knowledge state from student solutions, the historical knowledge state of the student and cognitive reasons about why the student makes an error.
Dependencies evaluation in superscalar processors
Authors: Vladimir Lazarov, Maria Marinova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The superscalar processor is instruction-level parallel (ILP) machine, capable to issue and execute simultaneously several instructions in parallel. The main limitations for the superscalar performance advantage come from the dependencies between instructions. In this paper we evaluate the influence of the different kinds of dependencies between instructions over the performance of the superscalar processors, using SIMAN simulation environment. Description of the model and simulation results are reported. Conclusions and direction for possible future work are given.
Discovering interpretable muscle activation patterns with the temporal data mining method
Authors: Fabian Mörchen, Alfred Ultsch, Olaf Hoos
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

The understanding of complex muscle coordination is an important goal in human movement science. There are numerous applications in medicine, sports, and robotics. The coordination process can be studied by observing complex, often cyclic movements, which are dynamically repeated in an almost identical manner. In this paper we demonstrate how interpretable temporal patterns can be discovered within raw EMG measurements collected from tests in professional In-Line Speed Skating. We show how the Temporal Data Mining Method, a general framework to discover knowledge in multivariate time series, can be used to extract such temporal patterns. This representation of complex muscle coordination opens up new possibilities to optimize, manipulate, or imitate the movements.
Collective composition: the case of Edison Studio
Authors: Alessandro Cipriani, Fabio Cifariello Ciardi, Luigi Ceccarelli, Mauro Cardi
Venue: Organised Sound (2004)

This article describes the collective experiences of the four composers at Edison Studio, who have recently been working on the soundtracks for two silent movies &ndash; four artists involved in the same discipline, working with the same skills and in the same roles. It describes their composition methods, ways in which problems are resolved, the new awareness and understanding they have acquired and the results of work created out of a re-evaluation of individual ways of operating, that seeks to bring together and strengthen the common ground between them.
One-dimensional selections for feature-based data exchange
Authors: Ari Rappoport, Steven Spitz, Michal Etzion
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

In the parametric feature based design paradigm, most features possess arguments that are subsets of the boundary of the current model, subsets defined interactively by user selection of boundary entities. Any system for feature-based data exchange (FBDE) must support the exchange of such selections. In this paper we describe in detail an algorithm for supporting one-dimensional selections (sets of edges and curves) for FBDE. The algorithm is applicable to a wide class of FBDE architectures, including the Universal Product Representation (UPR) and the STEP parametrics specification.
Volume catcher
Authors: Shigeru Owada, Frank Nielsen, Takeo Igarashi
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

It is difficult to obtain a specific region within unsegmented volume data (region of interest, ROI). The user must first segment the volume, a task which itself involves significant user intervention, and then chooses a desired target within the 3D space. This paper proposes a simple and intuitive user interface for the task: the user traces the contour of the target region using a 2D free form stroke on the screen, and the system instantly returns a plausible 3D region inside the stroke by applying a segmentation algorithm. The main contribution is that the system infers the depth information of the ROI automatically by analyzing the data, whereas existing systems require the user to provide the depth information explicitly. Our system first computes the 3D location of the user-specified 2D stroke based on the assumption that the user traced the silhouette of the ROI, that is, the curve where the gradient is perpendicular to the viewing direction. The system then places constraint points around the 3D stroke to guide the following segmentation. Foreground constraints are placed inside the stroke and background constraints are placed outside the stroke. We currently use the statistical region-merging algorithm of Nock et al. [Nock and Nielsen 2004a] to perform the segmentation. We tested our system with real-world examples to verify the effectiveness of our approach.
Navigation in 3D Game by Markov Model Based Head Pose Estimating
Authors: Peng Lu, XiangYong Zeng, Xiangsheng Huang, Yangsheng Wang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Keyboards, mice, and joysticks are the most popular controlling and navigation devices in current 3D game. However, they are quite unnatural. In this paper, we propose a novel scheme to estimate the userýs head pose and the estimation result is used for navigating in game. The novel scheme based on Markov model fusing appearance, color and motion information. The experimental results demonstrate that the proposed approach which is used for 3D game controlling is real-time and robust, and can give players more immersiveness.
SOBA Fabric: a framework for Business Services Networks <h3>Due to copyright restrictions full text for this article is not available</h3>
Authors: Matt Sanchez, Abhoy Bhaktwatsalam, Akshay Sabhikhi, Jay M. Tenenbaum, Manoj Saxena
Venue: Proceedings of the IEEE EEE05 international workshop on Business services networks (2005)

We introduce SOBA (Service Oriented Business Applications) Fabric, an architectural framework for Business Services Networks (BSN). BSNs extend the enterprise service bus concept beyond the boundaries of a single enterprise, enabling companies to build on each other's applications and create new loosely-coupled, network-centric business models. SOBA Fabric facilitates dynamic integration of people, processes, and information across business and technology boundaries by providing: 1) Dynamic provisioning and service personalization so that subscribers can quickly customize a business process to work with their systems and processes; 2) Industry-specific Service Level Agreements; 3) An industry-specific business services catalog supporting dynamic discovery and composition; 4) Business Process Management tools interface tailored to industry requirements; and 5) Visibility and exception handling across the BSN. Most importantly, SOBA Fabric provides industry-specific semantic "dial tones" that enable applications to plug and play at the business process level, using standardized XML business vocabularies. We describe the SOBA Architecture and present a case study from a successful deployment in the Insurance sector.
Investigating web dynamics
Authors: Joy Kamunyori
Venue: Journal of Computing Sciences in Colleges (2004)

Brownian motion is the random movement of particles in solution, as a result of their being bombarded by other particles. It was discovered by the biologist Robert Brown in 1827, and was verified by Albert Einstein in 1905. Brownian motion is significant today because it is used to simulate molecular interactions in important domains such as biochemistry and drug design. However, simulating Brownian motion by brute force is a time-consuming process because the simulator must move each individual particle at every time step. In addition, interesting events, such as two particles colliding in a certain way, only happen infrequently, and a lot of time can be spent waiting for these events of interest to occur. 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
A Multiple Associative Model to Support Branches in Data Parallel Applications using the Manager-Worker Paradigm
Authors: Wittaya Chantamas, Johnnie W. Baker
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 14 - Volume 15 (2005)

ASC (Associative Computing Model) and MASC (Multiple Associative Computing Model) have long been studied in the Department of Computer Science at Kent State University While the previous studies provide the background and the basic definition of the model, the description of the interactions between the instruction streams (ISs) is very brief, high level, and incomplete. One change here is that we specify the interaction between ISs and consider that all of the ISs operate on the same clock in order to support predictable worst case computation times, while earlier the ISs were assumed to interact in a MIMD type fashion. This paper provides a detailed explanation as to how these interactions can be supported in the case where only a few ISs are supported.
Seeing the Trees before the Forest
Authors: Daniel C. Asmar, John S. Zelek, Samer M. Abdallah
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

In this paper, we propose an algorithm that detects and locates natural objects in an outdoor environment using local descriptors. Interest points inside images are detected with a Difference of Gaussian (DoG) filter and are then represented using scale invariant local descriptors. Our algorithm learns objects in a weakly supervised manner by clustering similar descriptors together and using those clusters as object classifiers. The intent is to identify stable objects to be used as landmarks for Simultaneous Localization and Mapping (SLAM) of robots. The robot milieu is first identified using a fast environment recognition algorithm and then landmarks are suggested for SLAM that are appropriate for that environment. In our experiments we test our theory on the detection of trees that belong to the plantae.pinophyta (pine family). Initial results show that out of 200 test images, our classification yields 85 correct positives, 15 false negatives, 73 correct negatives and 27 false positives.
Sams Teach Yourself Unix in 10 Minutes (2nd Edition) (Sams Teach Yourself in 10 Minutes)
Authors: Robert Shimonski
Venue:  (2005)

If you're in need of a quick, concise tutorial to learn Unix and get on your way, this is it. Sams Teach Yourself UNIX in 10 Minutes, Second Edition will help you quickly and easily learn UNIX essentials and review UNIX features and functions. You will master components of UNIX programming through clear, concise learning modules and step-by-step instructions without having to wade through a lot of fluff and theory. You will learn to: Get onto the system and use the command line Move about the file system Create, move, rename and delete files and directories Slice and dice command pipe data Use the vi Editor Print in the UNIX environment And more!Whatever your expertise level, Sams Teach Yourself UNIX in 10 Minutes will get you up and running with UNIX in no time.
Hybrid Joint-Separable Multibody Tracking
Authors: Oswald Lanz, Roberto Manduchi
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Statistical models for tracking different moving bodies must be able to reason about occlusions in order to be effective. Representing the joint statistics across different bodies is computationally hard, since the size of the representation grows exponentially with the number of bodies being tracked. Separable tracking, with one tracker per body, cannot deal with occlusions effectively. We propose a new model, dubbed Hybrid Joint-Separable (HJS), that uses a representation size that grows linearly with the number of bodies, and a computational complexity that grows quadratically. This model can reason explicitly about occlusions. We describe a particle filter implementation of this model, and present promising experimental results.
A New Approach of Color Quantization Based On Ant Colony Clustering Algorithm
Authors: Xinrong Hu, Tianzhen Wang, Dehua Li
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Color quantization is wildly exploited for many applications especially in the fields of computer graphics and image processing. After studying the approaches of color clustering, a new approach based on ant colony clustering algorithm applied in color image quantization is proposed in the paper. According to the picking up-dropping theory, a promoted ant algorithm is applied to group colors into certain clusters in RGB space. It finishes color quantization after colors mapping of every pixel. Our experiment shows that the algorithm proposed in this paper has rather good performance with an excellent robustness, a less time consumption, and a simple realization.
All-IPv6 service interworking gateway
Authors: Jiann-Liang Chen, Wen-Hao Chen, Sy-Yen Kuo
Venue: International Journal of Network Management (2005)

Improvements of inter-operability, interface IP and dual mobility function must be investigated to move toward full IP and seamless multimedia applications. An All-IPv6 service architecture that consists of cellular systems and Wireless LAN networks has been constructed. A GPRS/WLAN interworking gateway with an IPv6 facility has been designed and its performance examined in terms of queue length, system throughput, loss rate and delay. The results of the simulation of a 1Mbps WLAN and 144kbps GPRS interworking system show that: (1) the queue length is directly proportional to the traffic load (the length increases to 100 packets in 61 seconds at a rate of increase of around 50% per 30 seconds); (2) if the size of the queue is increased to 100 packets, then the loss rate declines to 0.017, (a longer queue corresponds to a lower loss rate); (3) the size of the queue only weakly influences the system throughput when the queue length is increased; and (4) the average delay is approximately 0.83 second/bit, when the queue size is 100 packets. The delay doubles as the queue size doubles.
Prototyping: generating ideas or cargo cult designs?
Authors: Lars Erik Holmquist
Venue: interactions (2005)

They believe that planes come from paradise---their ancestors sent them. But the white man, a crafty pirate, manages to get his hands on them by attracting them into a big trap of an airport. You build your plane too, and wait with faith. Sooner of later, your ancestors will discover the white man's trap and will guide the planes on your landing strip. Then you will be rich and happy.---Narration from the film Mondo Cane, 1962
Usability grows up: the great debate
Authors: Aaron Marcus
Venue: interactions (2005)

Is usability ready for primetime? Two industry leaders go head-to-head on this issue