ppxscal/embedding_network huggingface dataset:
Symmetric Stereo Matching for Occlusion Handling
Authors: Jian Sun, Yin Li, Sing Bing Kang, Heung-Yeung Shum
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper, we propose a symmetric stereo model to handle occlusion in dense two-frame stereo. Our occlusion reasoning is directly based on the visibility constraint that is more general than both ordering and uniqueness constraints used in previous work. The visibility constraint requires occlusion in one image and disparity in the other to be consistent. We embed the visibility constraint within an energy minimization framework, resulting in a symmetric stereo model that treats left and right images equally. An iterative optimization algorithm is used to approximate the minimum of the energy using belief propagation. Our stereo model can also incorporate segmentation as a soft constraint. Experimental results on the Middlebury stereo images show that our algorithm is state-of-the-art.
StudioBRIDGE: using group, location, and event information to bridge online and offline encounters for co-located learning groups
Authors: Susan Yee, Kat S. Park
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

StudioBRIDGE is an awareness system, based on instant messaging (IM), developed for students working in open studio spaces in the Architecture Department at the Massachusetts Institute of Technology (MIT). The goal of StudioBRIDGE is to help students initiate online and offline interactions by giving them an awareness of nearby people, groups, locations, and events of the community. Even when students are working in close proximity to each other, they are often not aware of the activities and expertise of their colleagues nearby. We believe that this integrated awareness could lead to increased peer learning and expertise sharing by encouraging informal social communication, particularly in groups whose members have existing social and physical ties. In this paper, we describe the user community and the motivation, design, and initial pilot deployment of StudioBRIDGE.
An enhanced model for searching in semantic portals
Authors: Lei Zhang, Yong Yu, Jian Zhou, ChenXi Lin, Yin Yang
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

Semantic Portal is the next generation of web portals that are powered by Semantic Web technologies for improved information sharing and exchange for a community of users. Current methods of searching in Semantic Portals are limited to keyword-based search using information retrieval (IR) techniques, ontology-based formal query and reasoning, or a simple combination of the two. In this paper, we propose an enhanced model that tightly integrates IR with formal query and reasoning to fully utilize both textual and semantic information for searching in Semantic Portals. The model extends the search capabilities of existing methods and can answer more complex search requests. The ideas in a fuzzy description logic (DL) IR model and a formal DL query method are employed and combined in our model. Based on the model, a semantic search service is implemented and evaluated. The evaluation shows very large improvements over existing methods.
A single-server finite-capacity queueing system with Markov flow and discrete-time service
Authors: P. P. Bocharov, E. V. Viskova
Venue: Automation and Remote Control (2005)

Concepts of a discrete Markov flow and discrete-time Markov service are defined. A single-server finite-capacity queueing system with Markov flow and discrete-time service is studied. An algorithm for computing the stationary state probability distribution of the system is designed. The main performance characteristics, such as the stationary loss probability and mean waiting time for service, are determined.
Book review: Computational Models of Scientific Discovery and Theory Formation Edited by Jeff Shrager & Pat Langley (Morgan Kaufmann San Mateo, CA, 1990)
Venue: ACM SIGART Bulletin (1992)

This collection of fifteen talks from a 1989 symposium at Stanford comes as a welcome addition to the small literature dealing with scientific and mathematical thinking. Those interested in this subject will want to obtain this book, along with its predecessor (Langley, et al, 1987), an exposition of the topic rather than an edited collection of research reports.
A New Approach to Humanitarian Demining. Part 2: Development and Analysis of Pantographic Manipulator
Authors: Paulo Debenest, Edwardo F. Fukushima, Yuki Tojo, Shigeo Hirose
Venue: Autonomous Robots (2005)

Humanitarian demining is an application in which the use of tele-operated machines and mechanisms has been gaining acceptance recently. Actually, demining is just one among many other field applications that require a high degree of mobility, manipulation of loads, robustness and, above all, high efficiency in terms of energy consumption. This paper will present the development and analysis of Field Arm, a pantographic manipulator especially designed for field works, focusing on its kinematic, static and dynamic properties. The novel features of Field Arm will be presented and discussed with results of simulations and experiments.
Polynomial Runtime in Simulatability Definitions
Authors: Dennis Hofheinz, Jorn Muller-Quade, Dominique Unruh
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

We elaborate on the problem of polynomial runtime in simulatability definitions for multi-party computation. First, the need for a new definition is demonstrated by showing which problems occur with common definitions of polynomial runtime. Then, we give a definition which captures in an intuitive manner what it means for a protocol or an adversary to have polynomial runtime. We show that this notion is suitable for simulatability definitions for multi-party computation. In particular, a composition theorem is shown for this notion.
Review of "Purposive Explanation in Psychology by Margaret A. Boden", Harvard University Press, Cambridge Massachusetts, 1972.
Authors: Kenneth Mark Colby
Venue: Issue 43 (December 1973) (1973)

Artificial Intelligence is a type of theoretical psychology studying mental symbol-processing functions in living and nonliving, real and abstract systems. Psychology's methods have been limited to experimental, survey, mathematical, interview, and participant-observation approaches. AI adds a new formal method in which theories are cast in the formalism of a programming language. Many workers in AI lack knowledge about psychological theories relevant to their interest. This is the perfect book for them.
Parallel Ant Colony Optimization for 3D Protein Structure Prediction using the HP Lattice Model
Authors: D. Chu, M. Till, A. Zomaya
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07 (2005)

The Protein Folding Problem studies the way in which a protein - a chain of amino acids - will 'fold' into its natural state. Predicting the way in which various proteins fold can be fundamental in developing treatments of diseases such as Alzeihmers and Systic Fibrosis. Classical solutions to calculating the final conformation of a protein structure are resource-intensive. The Hydrophobic-Hydrophilic (HP) method is one way of simplifying the problem. We introduce a novel method of solving the HP protein folding problem in both two and three dimensions using Ant Colony Optimizations and a distributed programming paradigm. Tests across a small number of processors indicate that the multiple colony distributed ACO (MACO) approach is scalable and outperforms single colony implementations.
Evaluating the quality of light fields computed from hand-held camera images
Authors: Heinrich Niemann, Ingo Scholz
Venue: Pattern Recognition Letters (2005)

Given an image sequence recorded by a hand-held camera we examine the computation of a light field without any further input data. Using structure-from-motion algorithms and optimization techniques camera motion and a 3-D reconstruction of the scene are established. The light field is completed by computing local depth information for each input image. During experimental evaluation a special focus is set on the effects of falsely estimated intrinsic parameters as well as different depth representations on the quality of the resulting light fields.
A price-anticipating resource allocation mechanism for distributed shared clusters
Authors: Michal Feldman, Kevin Lai, Li Zhang
Venue: Proceedings of the 6th ACM conference on Electronic commerce (2005)

In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed market-based resource allocation system. Multiple users decide how to distribute their budget bids) among multiple machines according to their individual preferences to maximize their individual utility. We look at both the efficiency and the fairness of the allocation at the equilibrium, where fairness is evaluated through the measures of utility uniformity and envy-freeness. We show analytically and through simulations that despite being highly decentralized, such a system converges quickly to an equilibrium and unlike the social optimum that achieves high efficiency but poor fairness, the proposed allocation scheme achieves a nice balance of high degrees of efficiency and fairness at the equilibrium.
Indirect assessment of web navigation success
Authors: Jacek Gwizdka, Ian Spence
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Despite much research on hypertext and web navigation, relatively little is known about the relationship between web navigation strategies and success. We present two exploratory studies designed to explore the relationships between several web navigation metrics that are based on similarity to an optimal path to predict task success. The data suggest that the relationships between these measures depend on the particular web navigation task.
A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger
Authors: Gérard Huet
Venue: Journal of Functional Programming (2005)

We present the Zen toolkit for morphological and phonological processing of natural languages. This toolkit is presented in literate programming style, in the Pidgin ML subset of the Objective Caml functional programming language. This toolkit is based on a systematic representation of finite state automata and transducers as decorated lexical trees. All operations on the state space data structures use the zipper technology, and a uniform sharing functor permits systematic maximum sharing as dags. A particular case of lexical maps is specially convenient for building invertible morphological operations such as inflected forms dictionaries, using a notion of differential word. As a particular application, we describe a general method for tagging a natural language text given as a phoneme stream by analysing possible euphonic liaisons between words belonging to a lexicon of inflected forms. The method uses the toolkit methodology by constructing a non-deterministic transducer, implementing rational rewrite rules, by mechanical decoration of a trie representation of the lexicon index. The algorithm is linear in the size of the lexicon. A coroutine interpreter is given, and its correctness and completeness are formally proved. An application to the segmentation of Sanskrit by sandhi analysis is demonstrated.
An update notice on the level 3 BLAS
Authors: Jack Dongarra, Iain Duff, Jeremy DuCroz, Sven Hammarling
Venue: ACM SIGNUM Newsletter (1989)

In April 1987 we published a proposal for a set of Level 3 BLAS [1]. Since then the proposal has been presented and discussed at various meetings, comments have been received, and experience gained in using the Level 3 BLAS to code block-structured algorithms in Linear Algebra. As a result we have decided to make the following changes to the original proposal.
A classification tree analysis of broadband adoption in Australian households
Authors: Steven E. Stern, Shirley Gregor, Michael A. Martin, Sigi Goode, John Rolfe
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Broadband communication technologies offer households many opportunities, including greater access to education, health and government services, entertainment and social connectivity. Australia appears, however, to be lagging behind other nations in adopting broadband.This paper reports on a study of the relative importance of factors affecting broadband uptake and usage by Australian households. A large data set with 23,093 records was analysed using an innovative statistical technique known as classification tree analysis.Important adoption factors, in approximate order of importance, were: Frequency of Internet usage (indicating needs and benefits of use); Location, a factor likely to indicate, in part, the availability of services; Technophilia, a tendency to acquire technologies in general in the household; and Subscription to Pay TV. User needs and benefits, rather than cost, were found to be primary drivers.
STORAGEDB: Enhancing the Storage Sub-System with DBMS Functionalities
Authors: Lin Qiao, Balakrishna R. Iyer, Divyakant Agrawal, Amr El Abbadi, Sandeep Uttamchandani
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

This paper proposes STORAGEDB: a paradigm for implementing storage virtualation using databases. It describes details for storing the logical-to-physical mapping information as tables within the database; handling the incoming I/O requests of the application as database queries; bookkeeping of the I/O operations as database transactions. In addition, STORAGEDB uses built-in DBMS features to support storage virtualization functionalities; as an example we describe how online table space migration can be used to support reallocation of logical disks. Finally, we describe our modifications to a traditional RDBMS implementation, in order to make it light-weight. Improving the performance of a traditional DBMS is critical for the acceptance of STORAGEDB since the performace overheads are considered a primary challenge in replacing existing storage virtualization engines. Our current lightweight RDBMS has a 19 times shorter invocation path length than the original. In comparision to the open-source virtualization software, namely LVM, the extra cost of STORAGEDB is within 20% of LVM in trace-driven tests. (unlike STORAGEDB, LVMdid not have logging overhead). We consider these initial results as the "stepping stone" in the paradigm of applying databases for storage virtualization.
On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
Authors: Valeria Simoncini, Daniel B. Szyld
Venue: SIAM Review (2005)

Krylov subspace methods often exhibit superlinear convergence. We present a general analytic model which describes this superlinear convergence, when it occurs. We take an invariant subspace approach, so that our results apply also to inexact methods, and to nondiagonalizable matrices. Thus, we provide a unified treatment of the superlinear convergence of GMRES, conjugate gradients, block versions of these, and inexact subspace methods. Numerical experiments illustrate the bounds obtained.
A short introduction to failure detectors for asynchronous distributed systems
Authors: Michel Reynal
Venue: ACM SIGACT News (2005)

Since the first version of Chandra and Toueg's seminal paper titled "Unreliable failure detectors for reliable distributed systems" in 1991, the failure detector concept has been extensively studied and investigated. This is not at all surprising as failure detection is pervasive in the design, the analysis and the implementation of a lot of fault-tolerant distributed algorithms that constitute the core of distributed system middleware.The literature on this topic is mostly technical and appears mainly in theoretically inclined journals and conferences. The aim of this paper is to offer an introductory survey to the failure detector concept for readers who are not familiar with it and want to quickly understand its aim, its basic principles, its power and limitations. To attain this goal, the paper first describes the motivations that underlie the concept, and then surveys several distributed computing problems showing how they can be solved with the help of an appropriate failure detector. So, this short paper presents motivations, concepts, problems, definitions, and algorithms. It does not contain proofs. It is aimed at people who want to understand basics of failure detectors.
An implicit enumeration scheme for the batch selection problem
Venue: Networks (2004)

An important problem arising in the management of logistic networks is the following: given a set of activities to be performed, each requiring a set of resources, select the optimal set of resources compatible with the system capacity constraints. This problem is called Batch Selection Problem &lpar;BSP&rpar; from traditional applications to flexible manufacturing. BSP is known to be NP-hard, and is also considered a difficult integer programming problem. In fact, polyhedral approaches to BSP suffer from the poor quality of the bound provided by the linear relaxation, even after strengthening. We devise an implicit enumeration scheme that attempts to overcome this difficulty. It is based on a formulation of BSP, which is equivalent to a stable set problem with one side constraint. This allows to exploit the upper bound, not only for pruning subproblems, but also for controlling the number and the quality of the subproblems generated. We show the effectiveness of the approach by an extensive computational experience on real-sized randomly generated instances. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;2&rpar;, 151&ndash;159 2004
Timeline of a drawing research methodology 1983 - 2004
Authors: Peter Steel
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

I propose to demonstrate the evolution, methodology and current status of my ongoing practice based research into drawing systems, that began in 1983 at Ravensbourne College of Art in the UK.My intention is to use digital media to deliver a Timeline status report on DVD with a connected website and through live presentation and demonstration during C&C 2005. The DVD and website will contain material from the start of the project in 1983 up to 2004 and will incorporate notes, sketchbooks, photographs and scanned drawings in a range of media, video and connected digital art work. The visual material will be supported by contextual information to outline the issues and concerns that have directed my practice during this period, through to its current investigation involving motion capture (mocap) technology, augmented reality, and preparation for and extension to PhD research. Examples of creative projects and work made in conjunction with research into the development of my own drawing practice over a sustained twenty year period are detailed here, as references for what will be included in the complete Timeline documentation and material.
Wide-Baseline Stereo Matching with Line Segments
Authors: Herbert Bay, Vittorio Ferrari, Luc Van Gool
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a new method for matching line segments between two uncalibrated wide-baseline images. Most current techniques for wide-baseline matching are based on viewpoint invariant regions. Those methods work well with highly textured scenes, but fail with poorly textured ones. We show that such scenes can be successfully matched using line segments. Moreover, since line segments and regions provide complementary information, their combined matching allows to deal with a broader range of scenes. We generate an initial set of line segment correspondences, and then iteratively increase their number by adding matches consistent with the topological structure of the current ones. Finally, a coplanar grouping stage allows to estimate the fundamental matrix even from line segments only.
A note on variable order strategies for differential equation solvers
Authors: D. D. Warner
Venue: ACM SIGNUM Newsletter (1976)

In the design of a step-size and order monitor for the numerical solution of ordinary differential equations, the conventional wisdom holds that the monitor should start with a cautious first-order method. For example, Gear [1], Hindmarsh [2], Schryer [3], and Shampine and Gordon [4] require that the initial successful integration be accomplished with a first-order method. Of course these authors have other good reasons for their design besides mere caution. However, for stiff ODE's we will show that this restriction can lead the monitor to abandon perfectly reasonable problems.
Synchronous and Multiplexed Time Slots and Radio Blocks Allocation for Mobile Packet Data Networks
Authors: Chen-Nien Tsai, Kai-Wei Ke, Ho-Ting Wu
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

This paper studies the radio resource allocation for GPRS (General Packet Radio Service) downlink traffic supporting two class of mobile terminals with different bandwidth requirements. We proposed a complete time-slot partitioning and complete radio-block sharing scheme. The allocation strategy can not only characterize the practical multiplexing scheme but also provide high performance. By both theoretical analysis and computer simulation, the result showed that the proposed resource allocation strategy offers high utilization as well as low blocking probability to users under various traffic conditions.
MPISH: A Parallel Shell for MPI Programs
Authors: Narayan Desai, Andrew Lusk, Rick Bradshaw, Ewing Lusk
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 18 - Volume 19 (2005)

While previous work has shown MPI to provide capabilities for system software, actual adoption has not widely occurred. We discuss process management shortcomings in MPI implementations and their impact on MPI usability for system software and managment tasks. We introduce MPISH, a parallel shell designed to address these issues. Keywords: MPI, System Software, System Management, Scalability
Data Driven Similarity Measures for k-Means Like Clustering Algorithms
Authors: Jacob Kogan, Marc Teboulle, Charles Nicholas
Venue: Information Retrieval (2005)

We present an optimization approach that generates k-means like clustering algorithms. The batch k-means and the incremental k-means are two well known versions of the classical k-means clustering algorithm (Duda et al. 2000). To benefit from the speed of the batch version and the accuracy of the incremental version we combine the two in a "ping--pong" fashion. We use a distance-like function that combines the squared Euclidean distance with relative entropy. In the extreme cases our algorithm recovers the classical k-means clustering algorithm and generalizes the Divisive Information Theoretic clustering algorithm recently reported independently by Berkhin and Becher (2002) and Dhillon1 et al. (2002). Results of numerical experiments that demonstrate the viability of our approach are reported.
New books
Authors: Keith Price
Venue: Issue 101 (July 1987) (1987)

This volume is devoted to research, potential applications and implementations of AI (especially knowledge-based/expert systems and natural language interfaces) in economics, banking, financial services, finacial analysis, management, marketing and policy analysis. 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