ppxscal/embedding_network huggingface dataset:
Pen Computing: Digital Ink and Printed Document
Authors: Jian Wang
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Pen Computing is integral to the vision of natural user interface. This talk presents research work on pen computing at Microsoft Research Asia in the areas of digital handwriting ink and digital printed document. Working in harmony with existing computers, digital ink and printed document combines the naturalness, convenience and mobility of the "analog pen with the power of the digital world to bring computing to all the places where people are still doing things in non-digital ways. At MSR Asia, we have been researching and developing core technology, and architecting the system to make this happen. Digital ink is a human-centric technology for a rich and natural human-computer interaction. It combines the expressive power of human handwriting with the power of a tablet PC. To make digital ink a first-class user experience, our researches are focusing on handwriting ink parsing, ink annotation and ink manipulation. With these technologies, unstructured handwriting noted are turned into structured and daily tasks such as note-taking and editing can be managed entirely in the ink domain, using a natural and friendly user interface. Our system can recognize the following handwriting structures: 1) Automatic language script recognition; 2) Layout (word, line and paragraph); 3) Shape, diagram and table recognition. 3) Mathematics.
Controlling a pinball machine using Linux
Authors: John R. Bork
Venue: Linux Journal (2005)

The mechanical parts are bulletproof, but the 1980s electronics are beyond repair. Embedded Linux to the rescue.
Sharing Classifiers among Ensembles from Related Problem Domains
Authors: Yi Zhang, W. Nick Street, Samuel Burer
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

A classification ensemble is a group of classifiers that all solve the same prediction problem in different ways. It is well-known that combining the predictions of classifiers within the same problem domain using techniques like bagging or boosting often improves the performance. This research shows that sharing classifiers among different but closely related problem domains can also be helpful. In addition, a semi-definite programming based ensemble pruning method is implemented in order to optimize the selection of a subset of classifiers for each problem domain. Computational results on a catalog dataset indicate that the ensembles resulting from sharing classifiers among different product categories generally have larger AUCs than those ensembles trained only on their own categories. The pruning algorithm not only prevents the occasional decrease of effectiveness caused by conflicting concepts among the problem domains, but also provides a better understanding of the problem domains and their relationships.
Lattice-based adaptive random testing
Authors: Johannes Mayer
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Adaptive Random Testing (ART) denotes a family of testing algorithms that have a better performance compared to pure random testing with respect to the number of test cases necessary to detect the first failure. Many of these algorithms, however, are not very efficient regarding runtime. A new ART algorithm is presented that has a better performance than all other ART methods for the block failure pattern. Its runtime is linear in the number of test cases selected, which is nearly as efficient as pure random testing, as opposed to most other ART methods. This new ART algorithm selects the test cases based on a lattice.
An immersed boundary method with direct forcing for the simulation of particulate flows
Authors: Markus Uhlmann
Venue: Journal of Computational Physics (2005)

We present an improved method for computing incompressible viscous flow around suspended rigid particles using a fixed and uniform computational grid. The main idea is to incorporate Peskin's regularized delta function approach [Acta Numerica 11 (2002) 1] into a direct formulation of the fluid-solid interaction force in order to allow for a smooth transfer between Eulerian and Lagrangian representations while at the same time avoiding strong restrictions of the time step. This technique was implemented in a finite-difference and fractional-step context. A variety of two- and three-dimensional simulations are presented, ranging from the flow around a single cylinder to the sedimentation of 1000 spherical particles. The accuracy and efficiency of the current method are clearly demonstrated.
Utilizing Indexes for Approximate and On-Line Nearest Neighbor Queries
Authors: King-Ip Lin, Mike Nolen, Koteswara Kommeneni
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

We explore using index structures for effective approximate and on-line nearest neighbor queries. While many index structures have showed to suffer from the dimensionality curse, we believe that indexes can still be useful in providing quick approximate solutions to the nearest neighbor queries. Moreover, the information provided by the indexes can provide certain bounds that can be invaluable for on-line nearest neighbor queries. This paper explores the idea of applying current R-tree based indexes to approximate and on-line nearest neighbors with bounds. We experiment with various heuristics and compare the trade-off between accuracy and efficiency. Our results are compared to locality sensitive hashing (LSH) and they show the effectiveness of the proposed scheme. We also provide guidelines on how this can be useful in a practical sense.
A Scalable Overlay Multicast Congestion Control for Multimedia Streaming
Authors: Jun Lu, Qiuqi Ruan, Rongrong Ni
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

This paper presents a scalable overlay multicast congestion control scheme (OverlayTFMRC) for multimedia streaming over Internet. The scheme seeks to extend multicast scalability within our previous TCP-Friendly unicast congestion control scheme streamTFRC using multiple time-scale prediction for multimedia QoS transport. Besides efficient QoS transport support based on our previous work, OverlayTFMRC implements multicast scalability design into session rate control, feedback compression and data forward respectively by fully considering overlay network characteristics. Compared with TFMCC, simulation experiments illustrate that our scheme achieves not only better session scalability performance in terms of session throughput and its smoothness, but also better TCP-Friendly performance in terms of intraprotocol and inter-protocol fairness and smoothness.
Incorporating a Secure Coprocessor in the Database-as-a-Service Model
Authors: Einar Mykletun, Gene Tsudik
Venue: Proceedings of the Innovative Architecture on Future Generation High-Performance Processors and Systems (2005)

In this paper we suggest an extension to the Database-as-a-Service (DAS) model that introduces a secure coprocessor (SC) at an untrusted database service provider in order to overcome drawbacks in the plain DAS model. The processor serves as a neutral party between the clients and service providers with the goal of increasing security of outsourced data. Additionally, it supports a much broader range of queries performed and reduces both bandwidth and computational burdens on the client. We expect these improvements to make the DAS model more viable and attractive from a client's perspective.
Planning and Composition of Web Services with Dynamic Constraints Using Situation Calculus
Authors: Ken Nariai, Incheon Paik, Mitsuteru Shinozawa
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Web service composition enables the creation of new and more valuable services to combine and link existing services. However, the treatment of user constraints (as user demands) is important to provide users with a more intelligent service. It is difficult for existing services to fully satisfy users' constraints, as user demands change dynamically, depending on user preference or environment. We have produced an intelligent infrastructure that can deal with dynamic user constraints for Web service planning and composition. To realize this intelligent system, we analyzed the pattern of exceptions to manage the user constraints that can occur during planning through the creation of a scenario, and then we extracted important ideas for the detection and improvement of the exceptions. We also considered the system architecture using exceptional patterns and situation calculus theory in the first-order logic language to deduce the planning procedure. Our simple prototype used IndiGolog, which is a high-level programming language for robot, and applied situation calculus theory. Using this intelligent infrastructure enabled us to easily design a complex plan.
Review of "Probability and Statistics with Reliability, Queueing and Computer Science Application, by K. S. Trivedi"
Authors: Ashok K. Agrawala
Venue: ACM SIGSIM Simulation Digest (1982)

Probability and Statistical techniques are of significant importance in many fields and are taught to the students with varying backgrounds and interest. An instructor can provide strong motivation by selecting relevant examples suitable for the students. In most of the traditional fields such as electrical engineering, physics, and economics a number of texts are available at nearly all levels of undergraduate/graduate programs. As the use of probability and stochastic processes is relatively new in computer science, the book "Probability and Statistics with Reliability, Queueing and Computer Science Application", Prentice-Hall 1982, by Professor K. S. Trivedi seems to meet a strong need. 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
Quality of service support in tdma-based mobile ad hoc networks
Authors: Jie Wu
Venue:  (2005)

With the continuing advances in computing and wireless technologies, mobile ad hoc networks (MANETs) are expected to become an indispensable part of the computing environment in the near future. Wireless devices are constantly growing in computing speed, memory, communication capabilities and features, while shrinking in weight and size. With this growth and the proliferation of these devices in every aspect of society, the need for such devices to communicate in a seamless manner is becoming increasingly essential. Multiple routing protocols have been developed for MANETs [51]. As MANETs gain popularity, their need to support real time and multimedia applications is growing as well. Such applications have stringent quality of service (QoS) requirements such as bandwidth, delay, and delay fitter. Design and development of routing algorithms with QoS support is experiencing increased research interest. Several approaches which propose various routing algorithms with QoS support for MANETs have been presented in research. This dissertation addresses the issues and challenges of QoS routing in MANETS and presents three new protocols which provide QoS support for this environment. First, a brief classification of existing QoS routing algorithms is provided. Then, the three new protocols for QoS routing support in MANETs are presented. These protocols focus on resource reservation for QoS provisioning in TDMA-based MANETs. The first protocol improves QoS support by eliminating racing conditions during multiple reservations of QoS paths. The second protocol is a new protocol for resource reservation for QoS support in TDMA-based MANETs using directional antennas. The last protocol provides dynamic range resource reservation for QoS support in MANETs and represents an extension of the previous protocols.
VNS: a virtual network simulator
Authors: Walter F. Domka, Michael J. Freiling
Venue: ACM SIGSIM Simulation Digest (1984)

A software system to study network algorithms was implemented on UNIX. Each part of a network algorithm can be written as a single C program which becomes a virtual node in the network. During a simulation all virtualized nodes run as separate processes on a single PDP 11/44. Internode communication is carried out with procedures local to each node, to send and receive inter-node messages to and from a message queuing process. Communication between nodes is effected by use of virtual links which are specified in the simulated network's topology. The links are implemented on inter-process pipes between the message queuing process and the node processes. Run-time support routines include communication facilities and a mechanism for recording communication histories.
Mill: An Information Management and Retrieval Method Considering Geographical Location on Ubiquitous Environment
Authors: MATSUURA Satoshi, FUJIKAWA Kazutoshi, SUNAHARA Hideki
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

To leverage location-related information is useful to get an in-depth perspective on environmental circumstances, traffic situations and/or other problems. To handle the large number of information and queries communication devices issue, some scalable mechanism must be required. In this paper, we propose a peer-to-peer network system called "Mill" which can efficiently handle information related to the geographical location. To simplify the management of the location related information, we convert two dimensional coordinates into one dimensional circumference. Using this technique, Mill can search information by O(logN). Some DHT networks achieve the same performance. However, DHTs support only exact match lookups. The exact match is not suitable for searching information of a particular region. Mill provides an effective region search, by which users can search flexibly location-related information from small regions to large regions.
A statistical physics approach for modelling P2P systems
Authors: Giovanna Carofiglio, Rossano Gaeta, Michele Garetto, Paolo Giaccone, Emilio Leonardi, Matteo Sereno
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

We apply basic concepts of statistical physics to devise an approximate model describing the dynamics of content diffusion in large peer-to-peer networks. Our approach is based on fluid-diffusive equations, whose solution can be obtained by numerical evaluation with a complexity independent of the number of users and contents, thus allowing to analyze very large systems. The model is general and modular, and can incorporate the effect of both search and download processes.
Camera Based Automatic Calibration for the Varrier-System
Authors: Jinghua Ge, Dan Sandin, Tom Peterka, Todd Margolis, Tom DeFanti
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

Varrier is a head-tracked, 35-panel tiled autostereoscopic display system which is produced by The Electronic Visualization Laboratory (EVL) at the University of Illinois at Chicago (UIC). Varrier produces autostereoscopic imagery through a combination of a physical parallax barrier and a virtual barrier, so that the stereoscopic images are directed correctly into the viewer¿s eyes. Since a small amount of rotation and translation between physical and virtual barriers can cause large-scale effects, registration is critical for correct stereo viewing. The process is automated by examining image frames of two video cameras separated by the interocular distance as a simulation of human eyes. Three registration parameters for each panel are calibrated in the process. An arbitrary start condition is allowed and a robust stopping criterion is used to end the process and report results. Instead of exhaustive three dimensional searching, an efficient two phase calibration method is introduced. The combination of a heuristic rough calibration and an adaptive fine calibration guarantees a fast searching process with the best solution.
On the 3-Terminal Cut Polyhedron
Authors: Mohamed Didi Biha
Venue: SIAM Journal on Discrete Mathematics (2005)

Given $G=(V,E)$ an undirected graph and $A=\{n_1,n_2,n_3\}\subseteq V$ a specified set of terminal nodes, a 3-terminal cut is a subset of edges whose removal disconnects each terminal from the rest. Given a nonnegative cost vector $c\in{\mathbb R}^{|E|}_{+}$, the optimal 3-terminal cut problem is to find a 3-terminal cut of minimum cost. In this paper we consider the polyhedron LP($G,A$), the linear relaxation of the 3-terminal cuts polyhedron P($G,A$). We give a characterization of the pairs $(G,A)$ for which LP($G,A$) is integer. This result was conjectured by Cunningham in [{\it Reliability of Compter and Communications Networks}, AMS, Providence, RI, 1991, pp. 105--120].
Computational Coronary Artery Bypass Grafting
Authors: P. Eklund, J. Karlsson, J. Rauch, M. Simunek
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

Multimedia in health care is a topic of growing interest. Guideline presentation, utility and adherence require intelligence and multimedia to interact in decision support environments. In this paper we aim at identifying guideline logic during statistical analysis. The case study is drawn from a regional perspective on analysis and production of data, information and knowledge.
Fusion of Methods for Keystroke Dynamic Authentication
Authors: Sylvain Hocquet, Jean-Yves Ramel, Hubert Cardot
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

In this article, we present three methods for the keystroke dynamic authentication problem. We use in the first method, the average and the standard deviation, in the second the rhythm of striking and in the third, a comparison of the times order. After having presented these methods, we propose to realize a fusion of them. The results obtained indicate good performance of each method alone, as well as a significant improvement of performance with fusion, from 3.43% of EER for the best method alone down-to 1.8% with fusion.
Optimization of a Bus-based Test Data Transportation Mechanism in System-on-Chip
Authors: Anders Larsson, Erik Larsson, Petru Eles, Zebo Peng
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

The increasing amount of test data needed to test SOC (System-on-Chip) entails efficient design of the TAM (test access mechanism), which is used to transport test data inside the chip. Having a powerful TAM will shorten the test time, but it costs large silicon area to implement it. Hence, it is important to have an efficient TAM with minimal required hardware overhead. We propose a technique that makes use of the existing bus structure with additional buffers inserted at each core to allow test application to the cores and test data transportation over the bus to be performed asynchronously. The non-synchronization of test data transportation and test application makes it possible to perform concurrent testing of cores while test data is transported in a sequence. We have implemented a Tabu search based technique to optimize our test architecture, and the experimental results indicate that it produces high quality results at low computational cost.
QoS Signaling Across Heterogeneous Wired/Wireless Networks: Resource Management in Diffserv Using the NSIS Protocol Suite
Authors: Attila Bader, Georgios Karagiannis, Lars Westberg, Cornelia Kappler, Tom Phelan, Hannes Tschofenig, Geert Heijenk
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

Reservation-based Quality of Service (QoS) in a mixed wireless and wireline environment requires an end-to-end signaling protocol that is capable of adapting to the idiosyncrasies of the different networks. The QoS NSIS Signaling Protocol (QoSNSLP) has been created by the Next Steps In Signaling working group at the IETF to fulfill this need for an adaptive reservation protocol. It allows reservation requests to be interpreted by equipment implementing different QoS models along the path between a data sender and a data receiver. This paper describes the QoS-NSLP, and an example of a particular QoS model that is based on Resource Management in Diffserv (RMD). RMD provides a scalable dynamic resource management method for Diffserv networks. RMD has two basic functions to control the traffic load in a Diffserv domain: it provides admission control for flows entering the network and it has an algorithm that terminates the required amount of flows in case of congestion caused by failures (e.g. link or router) bandwidth and require per-flow reservations. On the other hand, the wireline networks tend to form the backbones and have relatively abundant bandwidth and carry a large number of flows, where aggregation is necessary since per-flow reservations suffer from scalability constraints.
Natural video browsing
Authors: Cai-Zhi Zhu, Tao Mei, Xian-Sheng Hua
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this demonstration, we show a novel system, Video Booklet, which enables nature personal video browsing and searching. Firstly representative thumbnails of video segments are selected and reshaped by a set of pre-trained personalized shape templates, and then printed out on a real booklet. When we want to watch the segment indicated by a certain thumbnail in the booklet, we are able to use camera phones or similar devices to capture the corresponding thumbnail, and send it to a computer via wireless network. Thereafter, the target thumbnail is accurately located by a Self-Trained Active Shape Model algorithm, and then the distortion of the captured image is corrected. Finally the Video Booklet system will automatically find the most similar thumbnail to the corrected one and begin to play the corresponding segment in the video library for us. Thereby, Video Booklet builds a seamless bridge between digital videos and analog albums.
Effective Pre-Processing Strategies for Functional Clustering of a Protein-Protein Interactions Network
Authors: Duygu Ucar, Srinivasan Parthasarathy, Sitaram Asur, Chao Wang
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

In this article we present novel preprocessing techniques, based on topological measures of the network, to identify clusters of proteins from Protein-protein interaction (PPI) networks wherein each cluster corresponds to a group of functionally similar proteins. The two main problems with analyzing Protein-protein interaction networks are their scale-free property and the large number of false positive interactions that they contain. Our preprocessing techniques use a key transformation and separate weighting functions to effectively eliminate suspect edges, potential false positives, from the graph. A useful side-effect of this transformation is that the resulting graph is no longer scale free. We then examine the application of two well-known clustering techniques, namely Hierarchical and Multilevel Graph Partitioning on the reduced network. We define suitable statistical metrics to evaluate our clusters meaningfully. From our study, we discover that the application of clustering on the pre-processed network results in significantlyimproved, biologically relevant and balanced clusters when compared with clusters derived from the original network. We strongly believe that our strategies would prove invaluable to future studies on prediction of protein functionality from PPI networks.