ppxscal/embedding_network huggingface dataset:
Tilt to Scroll: Evaluating a Motion Based Vibrotactile Mobile Interface
Authors: Ian Oakley, Sile O'Modhrain
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The increasing complexity and pervasiveness of handheld devices is demanding the development of interaction techniques explicitly tailored for mobile scenarios. This paper examines one such technique: the use of device orientation to navigate through one dimensional lists or menus. We describe a novel input mapping, directly relating list position to device orientation, and two studies quantifying user performance with this system. We believe vibrotactile feedback will be significant in movement-based mobile interfaces, and also examine its influence. Our results indicate that both our input mapping and the inclusion of vibrotactile feedback positively affect user performance and experience. We conclude by discussing the design implications of this work.
A note on maximum independent set and related problems on box graphs
Authors: Andrzej Lingas, Martin Wahlen
Venue: Information Processing Letters (2005)

A box graph is the intersection graph of orthogonal rectangles in the plane. We show that maximum independent set and minimum vertex cover on box graphs can be solved in subexponential time, more precisely, in time 2O(√nlogn), by applying Miller's simple cycle planar separator theorem [J. Comput. System Sci. 32 (1986) 265-279] (in spite of the fact that the input box graph might be strongly non-planar).
Automatic recognition of vigilance state by using a wavelet-based artificial neural network
Authors: Abdulhamit Subasi, Kemal Kiymik, Mehmet Akin, Osman Erogul
Venue: Neural Computing and Applications (2005)

In this study, 5-s long sequences of full-spectrum electroencephalogram (EEG) recordings were used for classifying alert versus drowsy states in an arbitrary subject. EEG signals were obtained from 30 healthy subjects and the results were classified using a wavelet-based neural network. The wavelet-based neural network model, employing the multilayer perceptron (MLP), was used for the classification of EEG signals. A multilayer perceptron neural network (MLPNN) trained with the Levenberg&#x2013;Marquardt algorithm was used to discriminate the alertness level of the subject. In order to determine the MLPNN inputs, spectral analysis of EEG signals was performed using the discrete wavelet transform (DWT) technique. The MLPNN was trained, cross-validated, and tested with training, cross-validation, and testing sets, respectively. The correct classification rate was 93.3% alert, 96.6% drowsy, and 90% sleep. The classification results showed that the MLPNN trained with the Levenberg&#x2013;Marquardt algorithm was effective for discriminating the vigilance state of the subject.
Sterling software: an NLToolset-based system for MUC-6
Authors: Richard Lee
Venue: Proceedings of the 6th conference on Message understanding (1995)

For a little over two years, Sterling Software ITD has been developing the Automatic Templating System (ATS) [1] for automatically extracting entity and event data in the counter-narcotics domain from military messages. This system, part of the Counter Drug Intelligence System (CDIS), was built around the NLToolset [2], which was originally developed by GE and is now being developed and supported by Lockheed-Martin. Early results showed that the system was performing better than the human analysts in all aspects.
The RUS parsing system and PSI-KLONE semantic interface: Bolt, Beranek, and Newman
Authors: Rusty Bobrow, Madeleine Bates, Boanie Webber
Venue: Issue 79 (January 1982) (1982)

The RUS parsing system provides a practical framework for natural language processing that is as flexible and extensible as a modular syntactic/semantic processor (such as LUNAR) and as efficient as a semantic grammar (such as the SOPHIE parser). RUS combines a large ATN grammar for English (with coverage greater than that of the LUNAR parser) with an interface that permits semantic interpretation to be performed efficiently during the parsing process. The interaction between the parser and the interpreter takes the form of a cascade [2] in which the interpreter receives information about syntactic constituents incrementally during the parsing process, and provides immediate feedback to the parser about the semantic acceptability of proposed syntactic structures. This results in an extremely efficient parser that has the advantages of both a syntax-first and a semantics-first approach.
A personal system for web image retrieval
Authors: Noriyuki Fujimoto, Kenichi Hagihara
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

This paper describes the design, implementation, and evaluation of a novel Web image search engine software. The hardware resources required by our engine are only one commodity personal computer (PC for short) and only one Internet connection with a few Mbps. For a given query and a given time interval, our engine retrieves Web pages relevant to the query during the time interval. Then, our engine analyzes the collected Web pages and finally enumerates images in the Web pages in the descending order of score for the query. We evaluated our engine on 2.4GHz Intel Pentium 4 PC with 512MB RAM and 4.28Mbps effective bandwidth to the Internet. Our experiments show that due to our sophisticated Web crawling algorithm, image discard algorithm, and image scoring algorithm, our engine can typically select 349 images of 2205 images in 192 Web pages in 33.38 seconds.
Web service interfaces
Authors: Dirk Beyer, Arindam Chakrabarti, Thomas A. Henzinger
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

We present a language for specifying web service interfaces. A web service interface puts three kinds of constraints on the users of the service. First, the interface specifies the methods that can be called by a client, together with types of input and output parameters; these are called signature constraints. Second, the interface may specify propositional constraints on method calls and output values that may occur in a web service conversation; these are called consistency constraints. Third, the interface may specify temporal constraints on the ordering of method calls; these are called protocol constraints. The interfaces can be used to check, first, if two or more web services are compatible, and second, if a web service A can be safely substituted for a web service B. The algorithm for compatibility checking verifies that two or more interfaces fulfill each others' constraints. The algorithm for substitutivity checking verifies that service A demands fewer and fulfills more constraints than service B.
User transparency: a fully sequential programming model for efficient data parallel image processing: Research Articles
Authors: F. J. Seinstra, D. Koelma
Venue: Concurrency and Computation: Practice Experience (2004)

Although many image processing applications are ideally suited for parallel implementation, most researchers in imaging do not benefit from high-performance computing on a daily basis. Essentially, this is due to the fact that no parallelization tools exist that truly match the image processing researcher's frame of reference. As it is unrealistic to expect imaging researchers to become experts in parallel computing, tools must be provided to allow them to develop high-performance applications in a highly familiar manner. In an attempt to provide such a tool, we have designed a software architecture that allows transparent (i.e. sequential) implementation of data parallel imaging applications for execution on homogeneous distributed memory MIMD-style multicomputers. This paper presents an extensive overview of the design rationale behind the software architecture, and gives an assessment of the architecture's effectiveness in providing significant performance gains. In particular, we describe the implementation and automatic parallelization of three well-known example applications that contain many fundamental imaging operations: (1) template matching; (2) multi-baseline stereo vision; and (3) line detection. Based on experimental results we conclude that our software architecture constitutes a powerful and user-friendly tool for obtaining high performance in many important image processing research areas. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Digital backchannels in shared physical spaces: experiences at an academic conference
Authors: Joseph F. McCarthy, danah m. boyd
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

There are a variety of digital tools for enabling people who are physically separated by time and space to communicate and collaborate. Widespread use of some of these tools, such as instant messaging and group chat, coupled with the increasingly availability of wireless Internet access, have created new opportunities for using these collaboration tools by people sharing physical spaces in real time. Such 'digital backchannels' affect interactions and experiences in a variety of ways, depending on the spaces, the participants, and the relationships among them. We focus on the space of an academic conference, a physical space designed for voluntary participation by people with shared interests, seeking to share knowledge and connect with others. We present and analyze system logs and interview data from a recent conference, highlight some of the advantages and disadvantages experienced both by those who used the tools and by those who did not, and discuss implications and considerations for future use and research.
Swarmed Feature Selection
Authors: Hiram A. Firpi, Erik Goodman
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Feature selection is an important part of pattern recognition, helping to overcome the curse of dimensionality problem with classifiers, among other systems. In this work, we introduce a feature selection method using particle swarm optimization. Experiments using data of others and hyperspectral remote sensed data will be used to measure the performance of the algorithm. Its comparison with a genetic algorithm will be also shown.
The groupthink specification exercise
Authors: Michael D. Ernst, John Chapin
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Teaching students to read and write specifications is difficult. It is even more difficult to motivate specifications---to convince students of the value of specifications and make students eager to use them. This paper describes the Groupthink specification exercise. Groupthink is a fun group activity, in the style of a game show, that teaches students about specifications (the difficulty of writing them, techniques for getting them right, and criteria for evaluating them), teamwork, and communication. Specifications are not used as an end in themselves, but are motivated to students as a means to solving realistic problems that involve understanding system behavior. Students enjoy the activity, and it improves their ability to read and write specifications. The two-hour, low-prep activity is self-contained, scales from classes of ten to hundreds of students, and is freely available to other instructors.
What's on Your Hard Drive?
Authors: Jim Maurer
Venue: Queue (2005)

Echoing a recent editor&rsquo;s note, it&rsquo;s fun to imagine a future where software development is abstracted to the point where we just say, &ldquo;Hey, Deep Thought, build me this call-center application. Marvin, here, will get you the specs,&rdquo; and voila, the software is designed, developed, tested, and deployed. Until then, however, we&rsquo;re stuck using these darn development tools. Being of human derivation (and therefore imperfect), they are perfect targets for our frustration&mdash;and praise (when they play nicely). So head to acmqueue.com and voice your opinions. If we print your submission we&rsquo;ll send you a stylish, yet highly functional Queue coffee mug.
Improving information extraction by modeling errors in speech recognizer output
Authors: David D. Palmer, Mari Ostendorf
Venue: Proceedings of the first international conference on Human language technology research (2001)

In this paper we describe a technique for improving the performance of an information extraction system for speech data by explicitly modeling the errors in the recognizer output. The approach combines a statistical model of named entity states with a lattice representation of hypothesized words and errors annotated with recognition confidence scores. Additional refinements include the use of multiple error types, improved confidence estimation, and multipass processing. In combination, these techniques improve named entity recognition performance over a text-based baseline by 28%.
Interactive tv: dispelling misconceptions in the media
Authors: Lydia Loizides
Venue: Computers in Entertainment (CIE) (2005)

Interactive television has been on the brink of taking off since the mid-1980s. Unfortunately, downward economic shifts, social resistance, and technological failure have hampered the growth of iTV. Is the current status of iTV any better? Can iTV shed its tattered image? Moreover, are there revenue-generating opportunities for content owners, distributors, aggregators, agencies, and advertisers? The answer, by all accounts, is yes.
A Mediation Framework for Web Services in a Distributed Healthcare Information System
Authors: Michael Mrissa, Djamal Benslimane, Chirine Ghedira, Zakaria Maamar
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

Conceptualizing distributed Healthcare Information System is an important step toward the enhancement of clinical decision support system.In this paper, we propose a semantic mediation of Web Services interfaces for distributed healthcare system.Our proposal is an approach based on Web Services technology and their mediation in a Peer to Peer environment.This approach constitutes the foundation for the set-up of a mediation framework built around the JXTA P2P architecture applied to cardiology domain in collaboration with the National Institute of Health and Medical Research (INSER ERM 107).To achieve our goal, we used the OWL-S language as a means of describing semantics of Web Services interfaces, and the JXTA distributed architectures.
The role of trust in distributed design
Authors: Niek J. E. Wijngaards, Hidde M. Boonstra, Frances M. T. Brazier
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2004)

Automated support of design teams, consisting of both human and automated systems, requires an understanding of the role of trust in distributed design processes. By explicating trust, an individual designer's decisions become better understood and may be better supported. Each individual designer has his or her private goals in a cooperative design setting, in which requirement conflicts and resource competitions abound. However, there are group goals that also need to be reached. This paper presents an overview of research related to trust in the context of agents and design, a computational knowledge-level model of trust based on the seven beliefs distinguished by Castelfranchi and Falcone, and an example of the use of the trust model in a specific design process, namely, Website design from the perspective of a single designer. The results are discussed in the context of distributed design in open systems.
Maximizing the Lifetime of Dominating Sets
Authors: Thomas Moscibroda, Roger Wattenhofer
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task under rigid energy restrictions that forces the designers to impose a judicious power management and scheduling. For the purpose of saving energy, dominating set based clustering has turned out to be a useful and generic concept in such networks. In data gathering applications, for example, only nodes in the dominating set must be active, while all other nodes can remain in the energy-efficient sleep mode. Prolonging the duration of such a dominating set based clustering is a key algorithmic challenge. In this paper, we define the maximum cluster-lifetime problem which asks for a schedule that maximizes the time the network is clustered by a dominating set. We give approximation algorithms with an approximation ratio of O(log n) for several variants of the maximum cluster-lifetime problem. Our approach is based on results given in a paper by Feige, Halldórsson, Kortsarz, and Srinivasan on the domatic partition problem.
Reliability for NSWAP
Authors: America Holloway, Jennifer Barry, Heather Jones
Venue: Journal of Computing Sciences in Colleges (2005)

We present reliability schemes for network swapping enabled Linux clusters. As processor speeds have continued to increase, disk speeds have failed to keep pace, resulting in application performance being restricted by slow disk access. This problem can be alleviated in cluster systems by using idle RAM of other nodes as swap space, a strategy known as network swapping. Nswap, a network swapping system, allows each node in the cluster to either swap-out pages or swap-in pages, according to its current workload. However, the failure of one node in the cluster can harm processes running on other nodes whose pages were stored on the failed node. Furthermore, as the size of the cluster grows, the mean time to failure decreases. Thus, reliability is essential. Our reliability scheme uses a RAID-like approach with parity logging and dynamic parity groups to implement reliability for network swapping systems that support migration of swapped pages. Furthermore, our reliability scheme adds little overhead to the swap-out and swap-in protocols, and minimizes the amount of network traffic.
Using top-ranking sentences to facilitate effective information access: Book Reviews
Authors: Ryen W. White, Joemon M. Jose, Ian Ruthven
Venue: Journal of the American Society for Information Science and Technology (2005)

Web searchers typically fail to view search results beyond the first page nor fully examine those results presented to them. In this article we describe an approach that encourages a deeper examination of the contents of the document set retrieved in response to a searcher's query. The approach shifts the focus of perusal and interaction away from potentially uninformative document surrogates (such as titles, sentence fragments, and URLs) to actual document content, and uses this content to drive the information seeking process. Current search interfaces assume searchers examine results document-by-document. In contrast our approach extracts, ranks, and presents the contents of the top-ranked document set. We use query-relevant top-ranking sentences extracted from the top documents at retrieval time as fine-grained representations of top-ranked document content and, when combined in a ranked list, an overview of these documents. The interaction of the searcher provides implicit evidence that is used to reorder the sentences where appropriate. We evaluate our approach in three separate user studies, each applying these sentences in a different way. The findings of these studies show that top-ranking sentences can facilitate effective information access. &copy; 2005 Wiley Periodicals, Inc.
Iso-charts: stretch-driven mesh parameterization using spectral analysis
Authors: Kun Zhou, John Synder, Baining Guo, Heung-Yeung Shum
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

We describe a fully automatic method, called iso-charts, to create texture atlases on arbitrary meshes. It is the first to consider stretch not only when parameterizing charts, but also when forming charts. The output atlas bounds stretch by a user-specified constant, allowing the user to balance the number of charts against their stretch. Our approach combines two seemingly incompatible techniques: stretch-minimizing parameterization, based on the surface integral of the trace of the local metric tensor, and the "isomap" or MDS (multi-dimensional scaling) parameterization, based on an eigen-analysis of the matrix of squared geodesic distances between pairs of mesh vertices. We show that only a few iterations of nonlinear stretch optimization need be applied to the MDS parameterization to obtain low-stretch atlases. The close relationship we discover between these two parameterizations also allows us to apply spectral clustering based on MDS to partition the mesh into charts having low stretch. We also novelly apply the graph cut algorithm in optimizing chart boundaries to further minimize stretch, follow sharp features, and avoid meandering. Overall, our algorithm creates texture atlases quickly, with fewer charts and lower stretch than previous methods, providing improvement in applications like geometric remeshing. We also describe an extension, signal-specialized atlas creation, to efficiently sample surface signals, and show for the first time that considering signal stretch in chart formation produces better texture maps.
Automatic 3D to 2D Registration for the Photorealistic Rendering of Urban Scenes
Authors: Lingyun Liu, Ioannis Stamos
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

This paper presents a novel and efficient algorithm for the 3D range to 2D image registration problem in urban scene settings. Our input is a set of unregistered 3D range scans and a set of unregistered and uncalibrated 2D images of the scene. The 3D range scans and 2D images capture real scenes in extremely high detail. A new automated algorithm calibrates each 2D image and computes an optimized transformation between the 2D images and 3D range scans. This transformation is based on a match of 3D with 2D features that maximizes an overlap criterion. Our algorithm attacks the hard 3D range to 2D image registration problem in a systematic, efficient, and automatic way. Images captured by a high-resolution 2D camera, that moves and adjusts freely, are mapped on a centimeter-accurate 3D model of the scene providing photorealistic renderings of high quality. We present results from experiments in three different urban settings.
Cohomologies of restricted Lie algebras of Hamiltonian vector fields: Computer analysis
Authors: V. V. Kornyak
Venue: Programming and Computing Software (2005)

Restricted algebras, or Lie p-algebras, of vector fields are finite-dimensional analogs of the corresponding classical algebras defined over fields of positive characteristic p. Our computations of p-algebras of Lie vector fields that preserve the symplectic structure (i.e., Hamiltonian and Poisson algebras) revealed important and interesting specific features of the structure of their cohomologies. Explanations of these specific features are presented.