ppxscal/embedding_network huggingface dataset:
MultiView: spatially faithful group video conferencing
Authors: David Nguyen, John Canny
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

MultiView is a new video conferencing system that supports collaboration between remote groups of people. MultiView accomplishes this by being spatially faithful. As a result, MultiView preserves a myriad of nonverbal cues, includ-ing gaze and gesture, in a way that should improve com-munication. Previous systems fail to support many of these cues because a single camera perspective warps spatial char-acteristics in group-to-group meetings. In this paper, we present a formal definition of spatial faithfulness. We then apply a metaphor-based design methodology to help us spec-ify and evaluate MultiView's support of spatial faithfulness. We then present results from a low-level user study to mea-sure MultiView's effectiveness at conveying gaze and ges-ture perception. MultiView is the first practical solution to spatially faithful group-to-group conferencing, one of the most common applications of video conferencing.
Do we need a separate assembly language programming course?
Authors: Krishna K. Agarwal, Achla Agarwal
Venue: Journal of Computing Sciences in Colleges (2004)

Assembly language programming has been taught within the computer science curriculum as a separate course at most universities over the past several decades. Recent advances of the Internet has forced the introduction of several new courses in this arena leaving less time for traditional courses such as computer architecture and assembly language programming. We examine the changing role of assembly language in the present day computer science curriculum.
The case for using Bridge Certificate Authorities for Grid computing: Research Articles
Authors: Marty Humphrey, Jim Basney, Jim Jokl
Venue: Software&mdash;Practice Experience (2005)

As Grid deployments increase, the challenge remains to create a scalable, multi-organizational authentication infrastructure. Public key infrastructures (PKIs) are widely used for authentication in Grids, due in large part to the success of the Globus toolkit, despite the challenges and difficulties both for PKI administrators and users. The Bridge Certificate Authority (CA) is a compromise between a strictly hierarchical PKI and a mesh PKI and achieves many of the benefits of the hierarchical PKI and mesh PKI but has been untested for use with Grid software. This paper reports on the use of a Bridge CA with two representative Grid software packages: the Globus Toolkit v2 and WSRF.NET. We find that both packages support Bridge CAs sufficiently today to be usable in Grid software architectures, although not without limitations. In this paper, and through these experiments, we build the case for using Bridge CAs for Grid computing. Copyright &copy; 2005 John Wiley & Sons, Ltd.
DoCoMo's challenge towards new mobile services
Authors: Kiyoyuki Tsujimura
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

NTT DoCoMo, the provider of "i-mode" mobile Internet service, which accommodates over 40 million subscribers in Japan, is now working to create new types of mobile communications services featuring visual content and contactless IC technology. 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
Supporting the Evolution of a Software Visualization Tool Through Usability Studies
Authors: Andrian Marcus, Denise Comorski, Andrey Sergeyev
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

The paper presents a usability study conducted with graduate and undergraduate computer science students, designed to evaluate the effectiveness of a software visualization tool named sv3D, and to provide necessary user data for the evolution of the system. Sv3D is a software visualization tool for comprehension of large software, capable of displaying source code and associated metrics in three dimensions. The participants in the study answered two types of questions: one set provided objective measurements to support the formulated hypotheses with respect to the accuracy and speed of the users answering questions using sv3D; the second set of questions provided subjective measurements that were used to support the evolution of sv3D. We formulated two null hypotheses with respect to accuracy and time respectively. The collected data supported one hypothesis and rejected the other.
Student communities in a distance-learning environment
Authors: Thierry Isckia, Charles Delalonde
Venue: ACM SIGGROUP Bulletin (2003)

Distance Education (DE) is becoming increasingly important as its rapid growth rates demonstrate. However, recent statistics on DE show low retention rates and a poor return on investment (ROI) in various programs. We need a better understanding of what are the critical success factors for DE environments for all constituencies (students, instructors, and institutions). We still misinterpret the reality of this kind of practice, both from the teacher's and the learner's point of view [1]. In this article, we focus on the collective dimension of the learning environments. In fact, entering a virtual learning community appears as a rational choice for the students to retrieve information more rapidly [3] and examine with available peers the actual content. But, students occasionally express a natural anxiety about sharing their difficulties with strangers, which partially explains the barriers in establishing trusting and caring learning communities [2]. Well-sequenced pedagogical courses and frequent contacts with the professor seem to strengthen the cohesion and integration of the students in a group. Consequently, educational choices and the global architecture of the course, by influencing the formation of these groups, try to compensate --- at least partially --- for the deficiencies of DE. The goal of this paper is to propose solutions to overcome low retention rates and ROI in order to deploy an efficient DE program using the key solution of a web-based course in an American public university.
A Low-Complexity Iterative Detector for COFDM in Mobile Channels
Authors: Shu-Ming Tseng, Teng-Chuan Lin, Kuan-Fu Huang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Recently, it has been shown that the received signal in the OFDM systems can be viewed as the synchronous code-division multiple access (SCDMA) signal in receiver after some mathematical manipulation, and the ICI term in the OFDM system is equivalent to the multiple access interference (MAI) term in Synchronous CDMA system. They proposed a successive interference cancellation multicarrier detector and it performs better than conventional single -carrier detection schemes in time-varying multiple channel (Dopple ¿ 0). To further improve the performance of OFDM systems in the presence of ICI, we propose to use a soft-in soft-out (SISO) multicarrier detector and a SISO convolutional decoder in an iterative (turbo) way. The simulation results show that the first iteration of the proposed scheme demonstrates 2-3 dB gain compared to the previous multicarrier detection schemes.
Review of "Principles of Artificial Intelligence by Nils J. Nilsson", Tioga Publishing Co.
Authors: Elaine Kant
Venue: Issue 72 (July 1980) (1980)

Nils Nilsson's new book, (Principles of Artificial Intelligence) (Tioga Publishing Co., 1980) discusses some basic ideas underlying different applications of AI. The book, designed as a text for a senior or first-year graduate course, aims to fill a gap between theory and practice. It succeeds in building a good solid arch outward from the shore of theory, but only a few support beams anchor the bridge to the shore of practice.
Maran Illustrated Excel 2003
Authors: Ruth Maran
Venue:  (2005)

Coverage includes- Features a unique two-page spread, over 500 full-color screen shots, illustrations, and useful tips that appeal to and engage visual learners and simplify the learning process. Provides extensive coverage of the latest version of Microsoft's spreadsheet program, Excel 2003, including new features such as the research pane, side-by-side comparisons, list functionality, and information protection. Uses simple, easy-to-understand, and concise text and covers over 140 essential topics, making it a great reference for all skill levels. Written using "Visual Grammar," a proven method that combines instructions with full-color screen shots to provide the best synergistic learning experience available. All examples contained in the book are available for download at www.maran.com.
Cache conscious dynamic memory allocation
Authors: Christopher Cyll
Venue: Journal of Computing Sciences in Colleges (2004)

Today, almost all software relies on dynamic memory allocation. In some programming languages, it is impossible to even write "Hello World!" without implicitly calling the allocator. Yet the effect of dynamic memory allocation on cache performance is relatively unstudied. In addition, the code produced by the leading researchers, Chilimbi et al., to investigate this phenomenon appears to be proprietary, making it difficult to study and build upon their work. 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
On the feasibility of low-rank approximation for personalized PageRank
Authors: András A. Benczúr, Károly Csalogány, Tamás Sarlós
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized PageRank on the fly are either limited to a restricted choice of page selection or believed to behave well only on sparser regions of the Web. In this paper we show the feasibility of computing personalized PageRank by a k < 1000 low-rank approximation of the Page-Rank transition matrix; by our algorithm we may compute an approximate personalized Page-Rank by multiplying an n x k, a k x n matrix and the n-dimensional personalization vector. Since low-rank approximations are accurate on dense regions, we hope that our technique will combine well with known algorithms.
Digital photo similarity analysis in frequency domain and photo album compression
Authors: Yang Lu, Tien-Tsin Wong, Pheng-Ann Heng
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

With the increasing popularity of digital camera, organizing and managing the large collection of digital photos effectively are therefore required. In this paper, we study the techniques of photo album sorting, clustering and compression in DCT frequency domain without having to decompress JPEG photos into spatial domain firstly. We utilize the first several non-zero DCT coefficients to build our feature set and calculate the energy histograms in frequency domain directly. We then calculate the similarity distances of every two photos, and perform photo album sorting and adaptive clustering algorithms to group the most similar photos together. We further compress those clustered photos by a MPEG-like algorithm with variable IBP frames and adaptive search windows. Our methods provide a compact and reasonable format for people to store and transmit their large number of digital photos. Experiments prove that our algorithm is efficient and effective for digital photo processing.
Covering Things with Things
Authors: Stefan Langerman, Pat Morin
Venue: Discrete Computational Geometry (2005)

An abstract NP-hard covering problem is presented and fixed-parameter tractable algorithms for this problem are described. The running times of the algorithms are expressed in terms of three parameters: $n$, the number of elements to be covered, $k$, the number of sets allowed in the covering, and $d$, the combinatorial dimension of the problem. The first algorithm is deterministic and has a running time of $O&#x2019;(k^{dk}n)$. The second algorithm is also deterministic and has a running time of $O&#x2019;(k^{d(k+1)}+n^{d+1})$. The third is a Monte-Carlo algorithm that runs in time $O&#x2019;(\runtime)$ and is correct with probability $1-n^{-c}$. Here, the $O&#x2019;$ notation hides factors that are polynomial in $d$. These algorithms lead to fixed-parameter tractable algorithms for many geometric and non-geometric covering problems.
Characterizing the two-tier gnutella topology
Authors: Daniel Stutzbach, Reza Rejaie
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Characterizing the properties of peer-to-peer (P2P) overlay topologies in file-sharing applications is essential for understanding their impact on the network, identifying their performance bottlenecks in practice, and evaluating their performance via simulation. Such characterization requires accurate snapshots of the overlay topology which is difficult to capture due to the large size and dynamic nature. Previous studies characterizing overlay topologies not only are outdated but also rely on partial or potentially distorted snapshots. In this extended abstract, we briefly present the first characterization of two-tier Gnutella topologies based on recent and accurate snapshots.
Virtual reality training and EMG control of the MANUS hand prosthesis
Authors: J. L. Pons, R. Ceres, E. Rocon, S. Levin, I. Markovitz, B. Saro, D. Reynaerts, W. Van Moorleghem, L. Bueno
Venue: Robotica (2005)

The design of multifunctional upper limb prosthetics has been investigated in recent years. Several areas or research need to be developed for successful implementation of dextrous upper limb prosthesis, in particular better EMG interfaces for implementing command languages.This article introduces a novel three-bit EMG command language concept as a user interface for the multifunctional MANUS prosthesis prototype. Following the global approach proposed by MANUS, a training process and the supporting Virtual Reality training software are also presented. The last section describes the evaluation process and the results.
On-Chip Spectrum Analyzer for Analog Built-In Self Test
Authors: Anup P. Jose, Keith A. Jenkins, Scott K. Reynolds
Venue: Proceedings of the 23rd IEEE VLSI Test Symposium (2005)

This paper presents the design of an on-chip spectrum analyzer. A novel architecture is used to mitigate the problems encountered in trying to implement architectures employed in conventional stand-alone instruments on a chip. Specifically, it makes use of a very-low IF architecture, which leads to a highly compact design, that can be used for measuring the frequency content of high frequency on-chip signals. The architecture and design considerations along with an implementation in a 0.18 µm CMOS process is described. The design takes up an area of approximately 0.384 mm^2 with a simulated frequency range of 33 MHz to 3 GHz and a dynamic range of 60 dB.
Deciding Knowledge in Security Protocols under (Many More) Equational Theories
Authors: Martin Abadi, Veronique Cortier
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue the study of these two relations. We establish general decidability theorems for both. These theorems require only loose, abstract conditions on the equational theory for messages. They subsume previous results for a syntacticallydefined class of theories that allows basic equations for functions such as encryption, decryption, and digital signatures. They also apply to many other useful theories, for example with blind digital signatures, homomorphic encryption, XOR, and other associative-commutative functions.
Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars
Authors: Jochen Mundinger, Jean-Yves Le Boudec
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

Using decentralized reputation systems is a promising approach to ensuring cooperation and fairness in Mobile Ad-Hoc Networks. However, they are vulnerable to liars and robustness has not been analyzed in detail. With our work, we provide a first step to the analysis of a reputation system based on a deviation test. Nodes accept second hand information only if this does not differ too much from their reputation values. Whereas our earlier paper [13] dealt with a simplified one-dimensional model, we now consider the original two-dimensional system. We show that the system exhibits a phase transition: In the subcritical regime, it is robust and lying has no effect. In the supercritical regime, lying does have an impact. We compute the critical values via a mean-field approach and use simulations to verify our results. Thus, we obtain conditions for the deviation test to make the reputation system robust and provide guidelines for a good choice of parameters.
Constrained Declustering
Authors: Ali Saman Tosun
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Declustering have attracted a lot of interest over the last few years.Except for a few cases it is not possible to find declustering schemes that are optimal for all spatial range queries.As a result of this, most of the research on declustering have focused on finding schemes with low worst case additive error.However, additive error based schemes have many limitations including lack of progressive guarantees and existence of small nonoptimal queries.In this paper, we take a different approach and investigate schemes that provide progressive guarantees.We investigate the threshold k such that all spatial range queries with ¿ k buckets are optimal. By dividing a query into nonoverlapping rectangles each with ¿ k buckets, the guarantees of threshold can be extended to larger queries.Theoretical analysis shows that threshold k is bounded above by N/2 for N-by-N declustering system with N disks.We propose a number-theoretic threshold algorithm.Experimental results show that proposed algorithm returns schemes with high threshold and low worst-case additive error.
RFID: Not Quite Prime Time, But Dawdle at Your Own Risk
Authors: Greg Goth
Venue: IEEE Distributed Systems Online (2005)

The next wave of RFID, known as passive RFID, features cheaper nonenergized tags and is just poking into the marketplace.
A short proof of Ramanujan's famous 1ψ1 summation formula
Authors: Song Heng Chan
Venue: Journal of Approximation Theory (2005)

We present a new proof of Ramanujan's 1ψ1 summation formula.
Bayesian 3D Modeling from Images Using Multiple Depth Maps
Authors: Pau Gargallo, Peter Sturm
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

This paper addresses the problem of reconstructing the geometry and color of a Lambertian scene, given some fully calibrated images acquired with wide baselines. In order to completely model the input data, we propose to represent the scene as a set of colored depth maps, one per input image. We formulate the problem as a Bayesian MAP problem which leads to an energy minimization method. Hidden visibility variables are used to deal with occlusion, reflections and outliers. The main contributions of this work are: a prior for the visibility variables that treats the geometric occlusions; and a prior for the multiple depth maps model that smoothes and merges the depth maps while enabling discontinuities. Real world examples showing the efficiency and limitations of the approach are presented.
Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
Venue: ACM International Conference Proceeding Series; Vol. 72 (2004)

The past few years have seen substantial amounts of computer science research on sensor networks. Other subfields have had a number of workshops on the topic (e.g., the Workshop on Wireless Sensor Networks and Applications (WSNA) in 2002 and 2003 and the Sensor Networks Protocols and Applications (SNPA) Workshop in 2002 and 2003, both of which are systems/networking focused). Furthermore, there are now at least two major conferences -- the Conference on Information Processing in Sensor Networks (IPSN), started in 2002, and the ACM Conference on Sensor Systems (SenSys), started in 2003. These conferences have published a small number of database papers, but there is no forum for discussion on early and innovative work on data management in sensor networks.We believe that the Workshop on Data Management for Sensor Networks (DMSN'04) fills a significant gap in the database community by bringing interested researchers together to identify research challenges and opportunities. Specifically, the workshop focuses on data processing and management in networks of remote, wireless, battery-powered sensing devices (sensor networks). The power-constrained, lossy, noisy, distributed, and remote nature of such networks means that traditional data management techniques often cannot be applied without significant re-tooling. Furthermore, new challenges associated with acquisition and processing of live sensor data mean that completely new database techniques must also be developed.The workshop represents a wide range of topics, including: data replication and consistency in noisy and lossy environments, database languages for sensor tasking, distributed data storage and indexing, energyefficient data acquisition and dissemination, in-network query processing, integration of sensor network data into traditional and streaming data management systems, networking support for data processing, techniques for managing loss, uncertainty, and noise, query optimization, and privacy protection for sensory data.As a response to the Call for Papers, the DMSN'04 workshop received 38 abstracts, of which 25 materialized as full papers by the submission deadline. During the review process, each paper was reviewed by at least three PC members or external reviewers, resulting in the acceptance of 15 papers.
A system for identifying named entities in biomedical text: how results from two evaluations reflect on both the system and the evaluations: Conference Papers
Authors: Shipra Dingare, Malvina Nissim, Jenny Finkel, Christopher Manning, Claire Grover
Venue: Comparative and Functional Genomics (2005)

We present a maximum entropy-based system for identifying named entities (NEs) in biomedical abstracts and present its performance in the only two biomedical named entity recognition (NER) comparative evaluations that have been held to date, namely BioCreative and Coling BioNLP. Our system obtained an exact match F-score of 83.2&percnt; in the BioCreative evaluation and 70.1&percnt; in the BioNLP evaluation. We discuss our system in detail, including its rich use of local features, attention to correct boundary identification, innovative use of external knowledge resources, including parsing and web searches, and rapid adaptation to new NE sets. We also discuss in depth problems with data annotation in the evaluations which caused the final performance to be lower than optimal. Copyright &copy; 2005 John Wiley & Sons, Ltd.