ppxscal/embedding_network huggingface dataset:
A novel non-intrusive eye gaze estimation using cross-ratio under large head motion
Authors: Dong Hyun Yoo, Myung Jin Chung
Venue: Computer Vision and Image Understanding (2005)

Eye gaze estimation systems calculate the direction of human eye gaze. Numerous accurate eye gaze estimation systems considering a user's head movement have been reported. Although the systems allow large head motion, they require multiple devices and complicate computation in order to obtain the geometrical positions of an eye, cameras, and a monitor. The light-reflection-based method proposed in this paper does not require any knowledge of their positions, so the system utilizing the proposed method is lighter and easier to use than the conventional systems. To estimate where the user looks allowing ample head movement, we utilize an invariant value (cross-ratio) of a projective space. Also, a robust feature detection using an ellipse-specific active contour is suggested in order to find features exactly. Our proposed feature detection and estimation method are simple and fast, and shows accurate results under large head motion.
Integrating WebCT into the computer science curriculum
Authors: Deborah L. Dunn, Dennis Lingerfelt
Venue: Journal of Computing Sciences in Colleges (2004)

Course Management Systems (CMS), such as WebCT, are becoming increasingly popular for presenting and managing web-based courses. These CMSs are used fairly extensively in disciplines outside of computer science. However, they are also being used in the computer science discipline to enhance course presentation and otherwise manage courses. At this institution, WebCT is being used significantly in the Introduction to Information Processing Systems course. This course has been structured such that even the most techno-phobic student begins to utilize WebCT on the first day. However, we are also experimenting with the use of WebCT in some of the introductory programming and upper-level computer science courses in an attempt to enhance student motivation and learning.
Impact of Java Compressed Heap on Mobile/Wireless Communication
Authors: Mayumi Kato, Chia-Tien Dan Lo
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

M-commerce has shown up as e-commerce in mobile and wireless communication, and now deals with on-line banking, stock trading, auctions, transactions, and mobile media. M-commerce applications are implemented with, for example, Java technology that supports a client-and-server model and cross-platform mobile applications. They are attractive, but, need a large heap space, which may slow down the execution, lead to poor interactive response, and sometimes cause "out of memory" failure.We propose a Java computation mechanism with heap de/compression modules that reduce memory demand and allow client applications and embedded devices to take the advantage of compression techniques. Results show the impact in space and time efficiency of the proposed mechanism. The space efficiency is 1.80 to 2.50 and the speed is competitive with that of original Java technology. We believe that the proposed mechanism provides a good runtime environment for mobile/wireless computing.
An agent-mediated approach to the support of knowledge sharing in organizations
Authors: Virginia Dignum, Frank Dignum, John-Jules Meyer
Venue: The Knowledge Engineering Review (2004)

The realization that knowledge management (KM) is primarily a management science and not a computer science implies a different role for technology in KM. This role is concerned with supporting and extending human interaction and learning, and has therefore the need for intelligence-enhanced, integrated and personalized solutions including agent-based approaches. A people-centered view of KM requires support systems that enable the flexible integration of organizational and individual requirements and objectives. This paper introduces the OperA model for organizations that supports individual initiative and collaboration while prescribing a formal structure for organizational processes. The paper introduces the main aspects of the model and describes a case study where OperA is applied to the development of a knowledge-sharing support system.
Optimal Controlled Flooding Search in a Large Wireless Network
Authors: Nicholas B. Chang, Mingyan Liu
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flooding search strategies where query/search packets are broadcast and propagated in the network until a preset TTL (time-to-live) value carried in the packet expires. Every unsuccessful search attempt results in an increased TTL value (i.e., larger search area) and the same process is repeated. We derive search strategies that minimize the search cost in the worst-case, via a performance measure in the form of the competitive ratio between the average search cost of a strategy and that of an omniscient observer. This ratio is shown in prior work to be lower bounded by 4 among all deterministic search strategies. In this paper we show that by using randomized strategies this ratio is lower bounded by e. We derive an optimal strategy that achieves this lower bound, and discuss its performance under other performance criteria.
Effective and Efficient Communication in Grid Computing with an Extension of ProActive Groups
Authors: Laurent Baduel, Francoise Baude, Nadia Ranaldo, Eugenio Zimeo
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5 - Volume 06 (2005)

Grid applications typically deal with huge amount of data and often the same data have to be transferred and processed on many resources. Nevertheless, the majority of existing middleware platforms for Grid computing do not provide suitable programming and communication models to make easy software development and to improve communication performances when a large set of receivers is involved. Some middlewares for wide area network computing, such as ProActive, provide the group abstraction to transparently deal with a number of similar receivers. We propose an extension of such a mechanism in order to improve its features for Grid environments. In particular, ProActive native groups have been extended both at programming and communication levels in order to support both different internal behaviors and high performance communication based on IP multicast. A case study shows the effectiveness of the new mechanism and its efficiency compared with the original one.
Comparing Metaheuristic Algorithms for Sonet Network Design Problems
Authors: Roberto Aringhieri, Mauro Dell'Amico
Venue: Journal of Heuristics (2005)

This paper considers two problems that arise in the design of optical telecommunication networks when a ring-based topology is adopted, namely the SONET Ring Assignment Problem and the Intraring Synchronous Optical Network Design Problem. We show that these two network topology problems correspond to graph partitioning problems with capacity constraints: the first is a vertex partitioning problem, while the latter is an edge partitioning problem. We consider solution methods for both problems, based on metaheuristic algorithms. We first describe variable objective functions that depend on the transition from one solution to a neighboring one, then we apply several diversification and intensification techniques including Path Relinking, eXploring Tabu Search and Scatter Search. Finally we propose a diversification method based on the use of multiple neighborhoods. A set of extensive computational results is used to compare the behaviour of the proposed methods and objective functions.
Concise descriptions of subsets of structured sets
Authors: Ken Q. Pu, Alberto O. Mendelzon
Venue: ACM Transactions on Database Systems (TODS) (2005)

We study the problem of economical representation of subsets of structured sets, which are sets equipped with a set cover or a family of preorders. Given a structured set U, and a language L whose expressions define subsets of U, the problem of minimum description length in L (L-MDL) is: &ldquo;given a subset V of U, find a shortest string in L that defines V.&rdquo; Depending on the structure and the language, the MDL-problem is in general intractable. We study the complexity of the MDL-problem for various structures and show that certain specializations are tractable. The families of focus are hierarchy, linear order, and their multidimensional extensions; these are found in the context of statistical and OLAP databases. In the case of general OLAP databases, data organization is a mixture of multidimensionality, hierarchy, and ordering, which can also be viewed naturally as a cover-structured ordered set. Efficient algorithms are provided for the MDL-problem for hierarchical and linearly ordered structures, and we prove that the multidimensional extensions are NP-complete. Finally, we illustrate the application of the theory to summarization of large result sets and (multi) query optimization for ROLAP queries.
Incorporating contextual information in recommender systems using a multidimensional approach
Authors: Gediminas Adomavicius, Ramesh Sankaranarayanan, Shahana Sen, Alexander Tuzhilin
Venue: ACM Transactions on Information Systems (TOIS) (2005)

The article presents a multidimensional (MD) approach to recommender systems that can provide recommendations based on additional contextual information besides the typical information on users and items used in most of the current recommender systems. This approach supports multiple dimensions, profiling information, and hierarchical aggregation of recommendations. The article also presents a multidimensional rating estimation method capable of selecting two-dimensional segments of ratings pertinent to the recommendation context and applying standard collaborative filtering or other traditional two-dimensional rating estimation techniques to these segments. A comparison of the multidimensional and two-dimensional rating estimation approaches is made, and the tradeoffs between the two are studied. Moreover, the article introduces a combined rating estimation method, which identifies the situations where the MD approach outperforms the standard two-dimensional approach and uses the MD approach in those situations and the standard two-dimensional approach elsewhere. Finally, the article presents a pilot empirical study of the combined approach, using a multidimensional movie recommender system that was developed for implementing this approach and testing its performance.
OWL DL vs. OWL flight: conceptual modeling and reasoning for the semantic Web
Authors: Jos de Bruijn, Rubén Lara, Axel Polleres, Dieter Fensel
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

The Semantic Web languages RDFS and OWL have been around for some time now. However, the presence of these languages has not brought the breakthrough of the Semantic Web the creators of the languages had hoped for. OWL has a number of problems in the area of interoperability and usability in the context of many practical application scenarios which impede the connection to the Software Engineering and Database communities. In this paper we present OWL Flight, which is loosely based on OWL, but the semantics is grounded in Logic Programming rather than Description Logics, and it borrows the constraint-based modeling style common in databases. This results in different types of modeling primitives and enforces a different style of ontology modeling. We analyze the modeling paradigms of OWL DL and OWL Flight, as well as reasoning tasks supported by both languages. We argue that different applications on the Semantic Web require different styles of modeling and thus both types of languages are required for the Semantic Web.
Securing QKD Links in the Full Hilbert Space
Authors: Deborah J. Jackson, George M. Hockney
Venue: Quantum Information Processing (2005)

Many quantum key distribution QKD analyses examine the link security in a subset of the full Hilbert space that is available to describe the system. In reality, information about the photon state can be embedded in correlations between the polarization space and other dimensions of the full Hilbert space in such a way that Eve can determine the polarization of a photon without affecting it. This paper uses the concept of suitability Hockney et al. "Suitability versus Fidelity for Rating Single Photon Guns" to quantify the available information for Eve to exploit, and demonstrate how it is possible for Alice and Bob to fool themselves into thinking they have a highly secure link.
Approaches to self-assessment of computer science departments and programs
Authors: Adel M. Abunawass, Barbara Boucher Owens, Laura Baker, Meledath Damodaran, Deborah Whitfield, Frances Bailie
Venue: Journal of Computing Sciences in Colleges (2005)

Colleges are struggling with the increasing demand for more assessment of programs and departments. This panel will address the approaches that several diverse institutions are taking to meet that challenge. The panelists will describe the development, design, and implementation of program assessment in the various institutions. The panelists will also share their experiences with regard to the effectiveness of the various program assessment approaches. The panelists will discuss and respond to questions of the audience as well as solicit the audience for input on the topic.
Design and implementation of data sharing architecture for multifunctional robot development
Authors: Yosuke Matsusaka, Kentaro Oku, Tetsunori Kobayashi
Venue: Systems and Computers in Japan (2004)

In this paper, we designed and implemented an intermodule connection architecture, which is required for the development of modules for a multifunctional robot. The proposed and implemented architecture is a dual bus architecture characterized by the fact that a composite blackboard and publish&sol;subscribe service for realizing flat relationships among modules and the dynamic switching of information flows by the modules themselves can be compatible with tight integration and a guarantee of scalability. Through an implementation of conversational tasks, which used speech, acoustic, and image information in an integrated manner, it is confirmed that a tightly integrated system can be developed in a short period. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(8): 54&ndash;65, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10585
Tired by Forth?: you should be!
Authors: Paul Frenger
Venue: ACM SIGPLAN Notices (2005)

You're traveling through another dimension, a dimension not only of sight and sound but of mind; a journey into a wondrous land whose boundaries are that of the imagination. Next stop: the Forth Zone [1].
Collective communication for the HPJava programming language: Research Articles
Authors: Sang Boem Lim, Bryan Carpenter, Geoffrey Fox, Han-Ku Lee
Venue: Concurrency and Computation: Practice Experience (2005)

This paper addresses functionality and implementation of a HPJava version of the Adlib collective communication library for data parallel programming. We begin by illustrating typical use of the library, through an example multigrid application. Then we describe implementation issues for the high-level library. At a software engineering level, we illustrate how the primitives of the HPJava language assist in writing library methods whose implementation can be largely independent of the distribution format of the argument arrays. We also describe a low-level API called mpjdev, which handles basic communication underlying the Adlib implementation. Finally we present some benchmark results, and some conclusions. Copyright &copy; 2005 John Wiley & Sons, Ltd.
iCheck Series: Microsoft Office 2003, Advanced, Student Edition, 1 edition
Venue:  (2005)

iCheck Series: Microsoft Office 2003 — Advanced is the second of this new, two-volume series. This advanced book covers Microsoft Office Expert objectives for Word 2003 and Excel 2003 and Specialist objectives for Outlook 2003. Unit 4 focuses on integrating all four main applications: Word, Excel, Access, and PowerPoint. An Annotated Teacher’s Edition provides point of use instruction and helpful teaching strategies for all student skill levels. iCheck Series: Microsoft Office 2003 — Advanced was written specifically for high school students. It is age-level and interest-level appropriate. The student edition also integrates basic language arts and mathematics skills.
Dependency Algebra: A Theoretical Framework for Dependency Management in Real-Time Control Systems
Authors: Hui Ding, Kihwal Lee, Lui Sha
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

The large and complex dependency relationship between software components is at the root of system instability. A seemingly minor fault can propagate along dependency chains and bring down the system. Therefore, the first step in the development of a robust system is the management and control of dependency relations between software components. The two contributions of this paper are: 1) a refinement of the commonly used failure semantics in the context of a real time control system; 2) the development of a Dependency Algebra. Component dependency relationships can be described in terms of a set of refined failure semantics mappings, enabling differentiation and comparison of different relationships and designs. The system-wide evaluation and tracking of these dependency relationships are performed using Dependency Algebra.
Fully Localized A posteriori Error Estimators and Barrier Sets for Contact Problems
Authors: Ricardo H. Nochetto, Kunibert G. Siebert, Andreas Veeser
Venue: SIAM Journal on Numerical Analysis (2004)

We derive novel pointwise a posteriori error estimators for elliptic obstacle problems which, except for obstacle resolution, completely vanish within the full-contact set (localization). We then construct a posteriori barrier sets for free boundaries under a natural stability (or nondegeneracy) condition. We illustrate localization properties as well as reliability and efficiency for both solutions and free boundaries via several simulations in 2 and 3 dimensions.
Collusion-free protocols
Authors: Matt Lepinksi, Silvio Micali, abhi shelat
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

Secure protocols attempt to minimize the injuries to privacy and correctness inflicted by malicious participants who collude during run-time. They do not, however, prevent malicious parties from colluding and coordinating their actions in the first place!Eliminating such collusion of malicious parties during the execution of a protocol is an important and exciting direction for research in Cryptography. We contribute the first general result in this direction: (1) We provide a rigorous definition of what a collusion-free protocol is; and (2) We prove that, under standard physical and computational assumptions ---i.e., plain envelopes and trapdoor permutations---collusion-free protocols exist for all finite protocol tasks with publicly observable actions. (Note that such tasks are allowed to have secret global state, and thus include Poker, Bridge, and other such games.Our solution is tight in the sense that, for a collusion-free protocol to exist, each of (a) the finiteness of the game of interest, (b) the public observability of its actions, and (c) the use of some type of physically private channel is provably essential.
Perception of Short Tactile Pulses Generated by a Vibration Motor in a Mobile Phone
Authors: Topi Kaaresoja, Jukka Linjama
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper describes an experimental setup and results of user tests focusing on the perception of temporal characteristics of vibration of a mobile device. The experiment consisted of six vibration stimuli of different length. We asked the subjects to score the subjective perception level in a five point Lickert scale. The results suggest that the optimal duration of the control signal should be between 50 and 200 ms in this specific case. Longer durations were perceived as being irritating.
Space-time alignment for asynchronous interference suppression in MIMO OFDM cellular communications: Research Articles
Authors: Mark B. Breinholt, Hyejung Jung, Michael D. Zoltowski
Venue: Wireless Communications Mobile Computing (2004)

Future broadband cellular wireless communication systems will be characterized by high delay spread and the need to maximize the system capacity. One method of increasing capacity, aggressive frequency reuse, subjects mobiles to high levels of interference from neighboring basestations. Receiver interference suppression algorithms that work well for conventional MIMO systems may not be appropriate for suppressing interference in multiple-input-multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) cellular systems, since differing propagation delays and channel lengths can destroy the alignment of the cyclic prefixes, making the interference asynchronous. This work presents MIMO algorithms for cyclic prefix based systems that are suitable for scenarios where the interferer's cyclic prefix is not time-aligned with the desired signal's cyclic prefix. Specifically, we present several space-time partial equalization techniques for the alignment of cyclic prefixes for aiding in interference suppression. We use a two-stage architecture with partial equalization for cyclic-prefix alignment in the time domain followed by simple channel equalization in the frequency domain. We consider interference suppression in both domains and demonstrate the efficacy of the two-stage architecture over both zero-forcing (ZF) and per frequency bin minimum mean squared error (MMSE) equalization. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Embedded Reading Device for Blind People: A User-Centred Design
Authors: Jean-Pierre Peters, Celine Thillou, Silvio Ferreira
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

A handheld PDA-based system is being developed to help blind people in their daily tasks. The design combines in a continuous process Users' involvement and Engineers' effort. This interaction is made efficient thanks to a specialist able to communicate with both parties and to extract useful knowledge for them. The system can be viewed as a main loop including the User taking the snapshot, Text/Picture detection, Optical character recognition, Text-to-speech synthesis, Feedback to the User, until a useful output is reached. Each task is carried out by algorithms integrating both technical performance and user requirements.
A groupware environment for transient virtual organization building
Authors: Olivier Delotte, Bertrand David, René Chalon
Venue: Proceedings of the 15th French-speaking conference on human-computer interaction on 15eme Conference Francophone sur l'Interaction Homme-Machine (2003)

In this paper we describe an environment and a process for the design and evolution of context-sensitive collaborative systems. Contextualisation and adaptation are the main characteristics of this environment. The initial design is based on scenarios, which are converted into a global behaviour model. This model is then mapped on the 3-level software architecture (application level, generic collaborative support, network infrastructure). The AMF-C architecture model is used for modelling the application level in order to obtain an adaptable collaborative system. This adaptation is based on a library of patterns and software components and by taking into account new scenarios which modify the behaviour model as well as the software architecture.