ppxscal/embedding_network huggingface dataset:
Merkle tree authentication of HTTP responses
Authors: Roberto J. Bayardo, Jeffrey Sorensen
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We propose extensions to existing web protocols that allow proofs of authenticity of HTTP server responses, whether or not the HTTP server is under the control of the publisher. These extensions protect users from content that may be substituted by malicious servers, and therefore have immediate applications in improving the security of web caching, mirroring, and relaying systems that rely on untrusted machines [2,4]. Our proposal relies on Merkle trees to support 200 and 404 response authentication while requiring only a single cryptographic hash of trusted data per repository. While existing web protocols such as HTTPS can provide authenticity guarantees (in addition to confidentiality), HTTPS consumes significantly more computational resources, and requires that the hosting server act without malice in generating responses and in protecting the publisher's private key.
Physical limitations on the bit-rate of on-chip interconnects
Authors: Noha Mahmoud, Maged Ghoneima, Yehia Ismail
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

It is shown in this paper that contrary to the common conception, widening an on-chip interconnect wire will not cause the wire to behave as a lossless line. It is shown that the energy losses actually increase when widening a wire. The damping factor of the line, which determines the maximum bit rate that can be transmitted on a wire, also does not go to zero for wide wires as in lossless lines. This fact results in a serious physical limitation on the maximum bit rate that can be transmitted on a wire. It is shown that by increasing the cross-sectional width of an interconnect wire, the damping factor will saturate to a certain limit. An expression for this minimum damping factor for very wide wires is derived from fundamental physical constants and used to introduce an expression for the maximum bit rate that can be reached by widening an interconnect wire for a certain technology. It is shown that for current technology numbers, the maximum bit rate on a wire can be quite limiting for longer wires and that scaling trends will even decrease more this maximum bit rate, posing a serious limitation.
Research on the Mathematical Model of Spatiotemporal Dual-Channel Electrotactile Tele-Presence
Authors: Liguo Shuai, Yinghui Kuang
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this paper, the principle and the model of spaciotemporal dual-channel electrotactile representation are described, and the relationship between tolerance limit and the stimulation current is also discussed. The analysis on spatiotemporal dual-channel model in electrotactile tele-presence shows that the whole tactile perception consists of two parts, one is the base volume of tactile perception, and another is the fluctuatuant amount. To obtain a comfortable electrotactile sensation, a limit to the fluctuauant amount is requested.
Scalable Coupling of Multi-Scale AEH and PARADYN Impact Analyses
Authors: Rama Valisetty, Peter Cheung, Raju Namburu
Venue: Proceedings of the 2004 Users Group Conference (2004)

This work describes scalable coupling of two stand alone computer codes for multi-scale impact analysis of composites. An asymptotic expansion homogenization (AEH) based micro-structural code available for modeling micro-structural aspects of modern armor materials is coupled with PARADYN, a parallel explicit Lagrangian finite element code. The first code enables modeling of material micro-structures in simple loading situations in stand alone form. The coupling of this code to PARADYN, which is a parallel version of the Lawrence Livermore National Laboratory (LLNL)'s serial DYNA3D, enables a micro-macro type multi-scale analysis of large elastic-plastic deformation response of structures under generalized three dimensional impact conditions. Three sets of results are presented to demonstrate: 1) the verification of the AEH-PARADYN model coupling to PARADYN, 2) validation of the AEH, and 3) the scalability of the coupled model.
On the Impact of Replica Placement to the Reliability of Distributed Brick Storage Systems
Authors: Qiao Lian, Wei Chen, Zheng Zhang
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Data reliability of distributed brick storage systems critically depends on the replica placement policy, and the two governing forces are repair speed and sensitivity to multiple concurrent failures. In this paper, we provide an analytical framework to reason and quantify the impact of replica placement policy to system reliability. The novelty of the framework is its consideration of the bounded network bandwidth for data maintenance. We apply the framework to two popular schemes, namely sequential placement and random placement, and show that both have drawbacks that significantly degrade data reliability. We then propose the stripe placement scheme and find the near-optimal configuration parameter such that it provides much better reliability. We further discuss the possibility of addressing the problem of correlated brick failures in our analytical framework.
Sharing of precompiled database statements in J2EE applications
Authors: Roberto Latorre, Francisco López, Antonio E. Martínez
Venue: Software&mdash;Practice Experience (2005)

This paper presents a mechanism to optimize the access to a database for Java 2 Platform Enterprise Edition &lpar;J2EE&rpar; applications. This mechanism was used in the migration of a PHP application to the J2EE platform to solve the limitations found in the standard database access. The proposed mechanism is optimal for applications with complex database queries and&sol;or a high number of them per time unit. It presents an alternative to the traditional access, which can produce a database overhead in applications with these characteristics. The proposed database access mechanism is based on the idea of sharing precompiled statements and connections between different users. When a part of the application wants to execute an SQL statement, either a new object is created representing it, or an existing one, created previously, is reused. Copyright &copy; 2004 John Wiley & Sons, Ltd.
EyeWindows: evaluation of eye-controlled zooming windows for focus selection
Authors: David Fono, Roel Vertegaal
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

In this paper, we present an attentive windowing technique that uses eye tracking, rather than manual pointing, for focus window selection. We evaluated the performance of 4 focus selection techniques: eye tracking with key activation, eye tracking with automatic activation, mouse and hotkeys in a typing task with many open windows. We also evaluated a zooming windowing technique designed specifically for eye-based control, comparing its performance to that of a stan-dard tiled windowing environment. Results indicated that eye tracking with automatic activation was, on average, about twice as fast as mouse and hotkeys. Eye tracking with key activation was about 72% faster than manual conditions, and preferred by most participants. We believe eye input performed well because it allows manual input to be provided in parallel to focus selection tasks. Results also suggested that zooming windows outperform static tiled windows by about 30%. Furthermore, this performance gain scaled with the number of windows used. We conclude that eye-controlled zooming windows with key activation pro-vides an efficient and effective alternative to current focus window selection techniques.
Counting connected graphs inside-out
Authors: Boris Pittel, Nicholas C. Wormald
Venue: Journal of Combinatorial Theory Series B (2005)

The theme of this work is an "inside-out" approach to the enumeration of graphs. It is based on a well-known decomposition of a graph into its 2-core, i.e. the largest subgraph of minimum degree 2 or more, and a forest of trees attached. Using our earlier (asymptotic) formulae for the total number of 2-cores with a given number of vertices and edges, we solve the corresponding enumeration problem for the connected 2-cores. For a subrange of the parameters, we also enumerate those 2-cores by using a deeper inside-out notion of a kernel of a connected 2-core.Using this enumeration result in combination with Caley's formula for forests, we obtain an alternative and simpler proof of the asymptotic formula of Bender, Canfield and McKay for the number of connected graphs with n vertices and m edges, with improved error estimate for a range of m values.As another application, we study the limit joint distribution of three parameters of the giant component of a random graph with n vertices in the supercritical phase, when the difference between average vertex degree and 1 far exceeds n-1/3. The three parameters are defined in terms of the 2-core of the giant component, i.e. its largest subgraph of minimum degree 2 or more. They are the number of vertices in the 2-core, the excess (#edges - #vertices) of the 2-core, and the number of vertices not in the 2-core. We show that the limit distribution is jointly Gaussian throughout the whole supercritical phase. In particular, for the first time, the 2-core size is shown to be asymptotically normal, in the widest possible range of the average vertex degree.
Book review: Universal Subgoaling and Chunking: The automatic generation and learning of goal hierarchies by John Laird, Paul Rosenbloom, and Alan Newell
Venue: Issue 100 (April 1987) (1987)

This book is two Ph.D theses bound together in one volume. The first thesis is by John Laird and is on "Universal Subgoaling" and the second thesis is on "The chunking of goal hierarchies" by Paul Rosenbloom. Alan Newell, their Ph.D advisor has an interesting preface, explaining how the respective thesis topics came into being. The first part (thesis) of the book is on developing a generalized problem solving architecture. The second part (thesis) is to develop a generalized learning system. The concluding section ties the loose ends together.
Interlingua-based broad-coverage Korean-to-English translation in CCLINC
Authors: Young-Suk Lee, Wu Sok Yi, Stephanie Seneff, Clifford J. Weinstein
Venue: Proceedings of the first international conference on Human language technology research (2001)

At MIT Lincoln Laboratory, we have been developing a Korean-to-English machine translation system CCLINC (Common Coalition Language System at Lincoln Laboratory). The CCLINC Korean-to-English translation system consists of two core modules, language understanding and generation modules mediated by a language neutral meaning representation called a semantic frame. The key features of the system include: (i) Robust efficient parsing of Korean (a verb final language with over case markers, relatively free word order, and frequent omissions of arguments). (ii) High quality translation via word sense disambiguation and accurate word order generation of the target language. (iii) Rapid system development and porting to new domains via knowledge-based automated acquisition of grammars. Having been trained on Korean newspaper articles on "missiles" and "chemical biological warfare," the system produces the translation output sufficient for content understanding of the original document.
Optimizing the migration of virtual computers
Authors: Constantine P. Sapuntzakis, Ramesh Chandra, Ben Pfaff, Jim Chow, Monica S. Lam, Mendel Rosenblum
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

This paper shows how to quickly move the state of a running computer across a network, including the state in its disks, memory, CPU registers, and I/O devices. We call this state a capsule. Capsule state is hardware state, so it includes the entire operating system as well as applications and running processes.We have chosen to move x86 computer states because x86 computers are common, cheap, run the software we use, and have tools for migration. Unfortunately, x86 capsules can be large, containing hundreds of megabytes of memory and gigabytes of disk data. We have developed techniques to reduce the amount of data sent over the network: copy-on-write disks track just the updates to capsule disks, "ballooning" zeros unused memory, demand paging fetches only needed blocks, and hashing avoids sending blocks that already exist at the remote end. We demonstrate these optimizations in a prototype system that uses VMware GSX Server virtual machine monitor to create and run x86 capsules. The system targets networks as slow as 384 kbps.Our experimental results suggest that efficient capsule migration can improve user mobility and system management. Software updates or installations on a set of machines can be accomplished simply by distributing a capsule with the new changes. Assuming the presence of a prior capsule, the amount of traffic incurred is commensurate with the size of the update or installation package itself. Capsule migration makes it possible for machines to start running an application within 20 minutes on a 384 kbps link, without having to first install the application or even the underlying operating system. Furthermore, users' capsules can be migrated during a commute between home and work in even less time.
Full Body Tracking from Multiple Views Using Stochastic Sampling
Authors: Roland Kehl, Matthieu Bray, Luc Van Gool
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We present a novel approach for full body pose tracking using stochastic sampling. A volumetric reconstruction of a person is extracted from silhouettes in multiple video images. Then, an articulated body model is fitted to the data with stochastic meta descent (SMD) optimization. By comparing even a simplified version of SMD to the commonly used Levenberg-Marquardt method, we demonstrate the power of stochastic compared to deterministic sampling, especially in cases of noisy and incomplete data. Moreover, color information is added to improve the speed and robustness of the tracking. Results are shown for several challenging sequences, with tracking of 24 degrees of freedom in less than 1 second per frame.
A Haptic System with Interchangeable Constraints for the Analysis of Skillful Human Movements
Authors: Igor Goncharenko, Mikhail Svinin, Soju Matsumoto, Yutaka Kanou, Shigeyuki Hosoe
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

A distributed system with interchangeable constraints for studying skillful human movements via haptic displays is presented. A unified interface provides easy linking of various physical models with spatial constraints, and the graphical contents related to the models as well. Theoretical and experimental kinematic profiles are compared for several cases of basic reaching rest-to-rest tasks: curve-constrained motions, flexible object control, and cooperative two-hand movements. The experimental patterns exhibit the best agreement with the optimal control models based on force-change minimization criteria.
UMAR: Ubiquitous Mobile Augmented Reality
Authors: Anders Henrysson, Mark Ollila
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

In this paper we discuss the prospects of using marker based Augmented Reality for context aware applications on mobile phones. We also present the UMAR, a conceptual framework for developing Ubiquitous Mobile Augmented Reality applications which consists of research areas identified as relevant for successfully bridging the physical world and the digital domain using Mobile Augmented Reality. A step towards this we have successfully ported the ARToolkit to consumer mobile phones running on the Symbian platform and present results around this. We also present three sample applications based on UMAR and future case study work planned.
kNR-tree: a novel R-tree-based index for facilitating spatial window queries on any k relations among N spatial relations in mobile environments
Authors: Anirban Mondal, Anthony K. H. Tung, Masaru Kitsuregawa
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

The ever-increasing popularity of mobile applications coupled with the prevalence of spatial data has created the need for efficient processing of spatial queries in mobile environments. While different types of spatial queries (e.g., spatial select queries, spatial join queries and nearest neighbour queries) need to be addressed in mobile environments, this work specifically addresses the processing of spatial select queries (i.e., window queries) on any k relations among N spatial relations. We designate such window queries on any k relations among N spatial relations as kNW queries. Notably, the processing of kNW queries is much more challenging in mobile environments than in traditional environments primarily due to the mobility of the clients which issue the queries to the respective base stations. The main contribution of this work is the proposal of the kNR-tree, a single integrated novel R-tree-based structure for indexing objects from N different spatial relations. Notably, the kNR-tree facilitates efficient processing of kNW queries. Our performance evaluation demonstrates that our proposed technique, which is based on the kNR-tree, is indeed effective in reducing the response times of kNW queries in mobile environments.
Semantic Grid - Interoperability Solution for Construction VO?
Authors: Ziga Turk, Matevz Dolenc, Vlado Stankovski, Etiel Petrinja
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Construction activities take place in what can be called a dynamic virtual organization (VO). VOs require a secure, reliable, scalable information infrastructure that allows collaboration and the sharing of information, computation and human resources. They need an infrastructure that would ensure the interoperability of their information systems while maintaining the privacy of their data, rapid joining and parting a VO and provide a higher quality of service, more information, faster computation, than available their own infrastructure. Grid technologies have been providing unpreceded computing and storage power. The paradigm is spinning off and is becoming the workhorse of networked business - something that the Web promised to become but failed to deliver. Construction industry is one of the most demanding users of VO infrastructures and could potentially enormously benefit from grid computing. In this position paper we present the state of the art and outline a research agenda. We propose a particular focusing of the research work on semantic grid technology and the coupling of the ontology and structured information exchange work into all layers of the grid- thereby making the grid infrastructure not only technically robust and secure but also aware of the business processes that take place in construction.
Farsite: federated, available, and reliable storage for an incompletely trusted environment
Authors: Atul Adya, William J. Bolosky, Miguel Castro, Gerald Cermak, Ronnie Chaiken, John R. Douceur, Jon Howell, Jacob R. Lorch, Marvin Theimer, Roger P. Wattenhofer
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

Farsite is a secure, scalable file system that logically functions as a centralized file server but is physically distributed among a set of untrusted computers. Farsite provides file availability and reliability through randomized replicated storage; it ensures the secrecy of file contents with cryptographic techniques; it maintains the integrity of file and directory data with a Byzantine-fault-tolerant protocol; it is designed to be scalable by using a distributed hint mechanism and delegation certificates for pathname translations; and it achieves good performance by locally caching file data, lazily propagating file updates, and varying the duration and granularity of content leases. We report on the design of Farsite and the lessons we have learned by implementing much of that design.
A time-optimal delaunay refinement algorithm in two dimensions
Authors: Sariel Har-Peled, Alper Üngör
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

We propose a new refinement algorithm to generate size-optimal quality-guaranteed Delaunay triangulations in the plane. The algorithm takes O(n log n + m) time, where n is the input size and m is the output size. This is the first time-optimal Delaunay refinement algorithm.
Post Disney experience paradigm?: some implications for the development of content to mobile tourist services
Authors: Lars Bojen Nielsen
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

This paper presents and discusses a conceptual framework for a location based mobile ICT system for the tourist industry. The issues presented originates from ideas and intentions in a specific Danish tourism project "Mobile Digital City and Nature Walks - development of content and software for a mobile tourism device".The article outlines how mobile ICT services can add value to the tourism experience and to the visitor destinations in the proposed project. Some implications for the development of content for mobile tourist services is presented: a) the good tourism experience according to the industry and b) experiences from qualitative studies of tourism. Finally the paper outlines main challenges in the project in terms of content development, technology and tourism industry. The contours of a new experience paradigm, when convergent and pervasive technologies have been implemented in 5-10 years, is also presented.
HIVED " A Passive System for Haptic Interaction and Visualization of Elastic Deformations
Authors: F. Tavakkoli Attar, R. V. Patel, M. Moallem
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper presents a system for Haptic Interaction and Visualization of Elastic Deformations (HIVED). The system represents a platform for modeling various mechanical properties of deformable objects and is developed based on the key concept of passivity in haptic environments. Estimation of force reflection to the userýs hand, based on the law of energy conservation, creates a physically-based method that adds realism to humanhaptic interaction. Implementation of the HIVED system is accomplished using GHOST SDK¿ libraries on a PHANToM¿ haptic device, and simulation experiments on a variety of geometries with different material properties are conducted.
Review of "Routeing according to a Structured Biplanar Scheme in Printed Boards, by G. Alia, G. Frosini and P. Maestrini", Computer Aided Design (July 1973).
Authors: Rob Smith
Venue: ACM SIGDA Newsletter (1974)

The problem described involves placement and interconnection of a single module type on two layer boards. Modules are assigned to one side of the board, with the legal locations forming a uniform grid. A channel-type routine scheme is used, with horizontal and vertical channels on separate layers. 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