ppxscal/embedding_network huggingface dataset:
Multiframe integration via the projective transformation with automated block matching feature point selection
Authors: R. R. Schulta
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

A subpixel-resolution image registration algorithm based on the nonlinear projective transformation model is proposed to account for camera translation, rotation, zoom, pan, and tilt. Typically, parameter estimation techniques for transformation models require the user to manually select feature points between the images undergoing registration. In this research, block matching is used to automatically select correlated feature point pairs between two images, and these features are used to calculate an iterative least squares solution for the projective transformation parameters. Since block matching is capable of estimating accurate translation motion vectors only in discontinuous edge regions, inaccurate feature point pairs are statistically eliminated prior to computing the least squares parameter estimate. Convergence of the projective transformation model estimation algorithm is generally achieved in several iterations. After subpixel-resolution image registration, a high-resolution video still may be computed by integrating the registered pixels from a short sequence of low-resolution image sequence frames.
User-level resource-constrained sandboxing
Authors: Fangzhe Chang, Ayal Itzkovitz, Vijay Karamcheti
Venue: Proceedings of the 4th conference on USENIX Windows Systems Symposium - Volume 4 (2000)

The popularity of mobile and networked applications has resulted in an increased demand for execution "sandboxes"--environments that impose irrevocable restrictions on resource usage. Existing approaches rely on kernel modification for enforcing quantitative restrictions (e.g., limiting CPU utilization of an application to 25%). However, the general applicability of such approaches is constrained by the difficulty of modifying shrink-wrapped operating systems such as Windows NT. This paper presents a user-level sandboxing approach for enforcing quantitative restrictions on resource usage of applications. Our approach actively monitors an application's interactions with the underlying system, proactively controlling them to enforce the desired behavior. Our approach leverages a core set of user-level mechanisms that are available in most modern operating systems: fine-grained timers, monitoring infrastructure, debugger processes, priority-based scheduling, and page-based memory protection. We describe implementation of a sandbox on Windows NT that imposes quantitative restrictions on CPU, memory, and network usage. Our results show that application usage of system resources can be restricted to within 3% of desired limits with minimal run-time overhead.
Middleware Support for Quality of Context in Pervasive Context-Aware Systems
Authors: Kamran Sheikh, Maarten Wegdam, Marten van Sinderen
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Middleware support for pervasive context-aware systems relieves context-aware applications from dealing with the complexity of context-specific operations such as context acquisition, aggregation, reasoning and distribution. The middleware decouples applications from the underlying heterogeneous context sensors, and offers advantages such as rapid development of context-aware applications and efficient usage of the context sensors. Context sensors have inherent limitations with respect to the quality of the context information they produce. Without breaking the decoupling, the middleware needs to explicitly model and quantify this Quality of Context in order to allow application to adapt their behavior based on the Quality of Context, for efficiency reasons and to enable Quality-of-Context-aware privacy policies. In this paper we identify and define five Quality-of-Context indicators for context-aware middleware, and discuss different alternatives for their quantification. These Quality-of-Context indicators are: precision, freshness, spatial resolution, temporal resolution and probability of correctness.
Enabling scalability and performance in a large scale CMP environment
Authors: Bratin Saha, Ali-Reza Adl-Tabatabai, Anwar Ghuloum, Mohan Rajagopalan, Richard L. Hudson, Leaf Petersen, Vijay Menon, Brian Murphy, Tatiana Shpeisman, Eric Sprangle, Anwar Rohillah, Doug Carmean, Jesse Fang
Venue: Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 (2007)

Hardware trends suggest that large-scale CMP architectures, with tens to hundreds of processing cores on a single piece of silicon, are iminent within the next decade. While existing CMP machines have traditionally been handled in the same way as SMPs, this magnitude of parallelism introduces several fundamental challenges at the architectural level and this, in turn, translates to novel challenges in the design of the software stack for these platforms. This paper presents the "Many Core Run Time" (McRT), a software prototype of an integrated language runtime that was designed to explore configurations of the software stack for enabling performance and scalability on large scale CMP platforms. This paper presents the architecture of McRT and discusses our experiences with the system, including experimental evaluation that lead to several interesting, non-intuitive findings, providing key insights about the structure of the system stack at this scale. A key contribution of this paper is to demonstrate how McRT enables near linear improvements in performance and scalability for desktop workloads such as the popular XviD encoder and a set of RMS (recognition, mining, and synthesis) applications. Another key contribution of this work is its use of McRT to explore non-traditional system configurations such as a light-weight executive in which McRT runs on "bare metal" and replaces the traditional OS. Such configurations are becoming an increasingly attractive alternative to leverage heterogeneous computing uints as seen in today's CPU-GPU configurations.
Process and product in a software engineering course: simulating the real world
Authors: P. Brazier
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

This paper describes a software engineering course which applies the planning aspects, cost estimates, project development activities and deliverables for a software product to all aspects of the course. Students negotiated a course contract outlining timelines, deliverables and grades (budget) as part of the Software Development Plan. The class was viewed as a software company managed by the instructor who, at alternate times, played the role of the client, reviewing activities at appropriate stages of the development life cycle and delivering payment in the form of the course grade. All aspects of the course, with the exception of exams, were done by student teams. Assignment to teams simulated the job application process with the submission of a letter of application and resume. Each team was assigned to serve as software quality assurance group for another team. Using a large project with partial implementation of the design and implementation phases is compared to using a smaller project requiring the full implementation of all phases of the life cycle model. Use of visual languages to support the rapid prototyping model is discussed. Student reactions to the course are included. 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
Media for knowledge creation and dissemination: semantic model and narrations for a new accessibility to cultural heritage
Authors: Stefano Valtolina, Piero Mussio, Giovanna Gianni Bagnasco, Pietro Mazzoleni, Stefano Franzoni, Muriel Geroli, Cristina Ridi
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

This paper is the result of the clashing but fruitful collaboration of experts of two different cultures - Computer Science and Archaeology _ and reports on the design and development of the T.Arc.H.N.A System, a new system of accessibility towards Cultural Heritage of the Etruscan culture. The first important result of the collaboration is the rise of an interdisciplinary team of cultural operators, which emerged from the confrontation of the different experiences acquired in each proper field of common research. As a consequence of such a confrontation process, the team was in need of new tools of expression, and communication. An ontology was defined as a new medium for communication between Computer Scientists and Archeologists. New media to record the results of the archaeological researches were introduced to disseminate knowledge to a large public in a novel, context adaptive way. The setting of these media are the base for the implementation of the working seed of the T.Arc.H.N.A System. The paper presents this open and participatory system where different actors cooperate to create and disseminate knowledge about cultural assets.
Symphony: distributed hashing in a small world
Authors: Gurmeet Singh Manku, Mayank Bawa, Prabhakar Raghavan
Venue: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4 (2003)

We present Symphony, a novel protocol for maintaining distributed hash tables in a wide area network. The key idea is to arrange all participants along a ring and equip them with long distance contacts drawn from a family of harmonic distributions. Through simulation, we demonstrate that our construction is scalable, flexible, stable in the presence of frequent updates and offers small average latency with only a handful of long distance links per node. The cost of updates when hosts join and leave is small.
Fast Archiving and Querying of Heterogeneous Sensor Data Streams
Authors: Ken Q. Pu, Ying Zhu
Venue: Proceedings of the Second International Conference on Digital Telecommunications (2007)

We propose techniques based on bitmap-based indices to efficiently store heterogeneous (i.e., time-varying schema) streaming data, supporting fast archiving and query throughput while being space-efficient. We also present the architecture and performance evaluation of a system implementation.
Multirate Interacting Multiple Model Algorithm Combined with Particle Filter for Nonlinear/Non-Gaussian Target Tracking
Authors: Guixi Liu, Enke Gao, Chunyu Fan
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In this paper, we propose a new interacting multiple model (IMM) algorithm combined with particle filter for nonlinear/non-Gaussian systems, which adopts the multirate technique to improve the computational efficiency. The interacting multiple model (IMM) algorithm is specially designed to track accurately targets, and the particle filter is aim to deal with nonlinear/non-Gaussian problems. But the problem of a particle filter is its expensive computation, especially when it is introduced into the IMM algorithm. Here, the multirate technique is to solve this problem and not making the performance of the algorithm bad. The experimental results show the multirate IMMPF (IMM particle filter) works as well as IMMPF with much lower computation load.
Human Performance in a Knob-Turning Task
Authors: N. Gurari, A. M. Okamura
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Knob turning is a common task that should influence the design of human-machine interfaces such as prosthetic arms, teleoperated robots, and virtual environments. This study examines the following metrics for a specified knob rotation: turning strategy, including arm motions used and number of grasps made, time used to complete the motion, and maximum applied forces and torques. The subjects' task was to rotate a one-degree-of freedom haptic knob at least 270 degrees for two angles of attack (hand parallel versus perpendicular to the plane of the knob), three knob sizes, and three motor gains. Results on the initial 260 degrees of rotation show that a more distal arm motion is used for a parallel angle of attack, decreased knob size, and increased gain. Further, a change in the angle of attack affects each metric, with the exception of the maximum z-axis force and the maximum lateral torque. A variation in the knob size modulates each metric, with the exception of the maximum z-axis torque and the maximum lateral force. A modification of the motor gain influences the outcomes of all of the metrics.
Lessons from the neighborhood viewer: building innovative collaborative applications in Tcl and Tk
Authors: Alex Safonov, Douglas Perrin, Joseph Konstan, John Carlis, John Riedl, Robert Elde
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

This paper discusses the development in Tk of a collaborative browser for scientific image databases. The browser, known as the "neighborhood viewer," allows groups of neuroscientists to explore systematically a large collection of brain images. The paper discusses the application, its development, and a set of lessons learned during development. In particular, it shows how constraints and distributed constraints simplified development, discusses the implementation of a wavelet-based image format, and draws lessons about engineering experimental, evolving systems.
Push vs. pull: implications of protocol design on controlling unwanted traffic
Authors: Zhenhai Duan, Kartik Gopalan, Yingfei Dong
Venue: Proceedings of the Steps to Reducing Unwanted Traffic on the Internet on Steps to Reducing Unwanted Traffic on the Internet Workshop (2005)

In this paper we argue that the difficulties in controlling unwanted Internet traffic, such as email SPAM, stem from the fact that many Internet applications are fundamentally sender-driven and distinctly lack receiver control over traffic delivery. However, since only receivers know what they want to receive, receiver-driven approaches may often have clear advantages in restraining unwanted traffic. In this paper, we re-examine the implications of the two common traffic delivery models: sender-push and receiver-pull. In the sender-push model, a sender can deliver traffic at will to a receiver, who can only passively accept the traffic, such as in the SMTP-based email delivery system. In contrast, in the receiver-pull model, receivers can regulate if and when they wish to retrieve data, such as the HTTP-based web access system. We argue that the problem of unwanted Internet traffic can be mitigated to a great extent if the receiver-pull model is employed by Internet applications, whenever appropriate. Using three popular applications - email, mobile text messages, and asynchronous voice messages - as examples, we demonstrate that asynchronous communication protocols can be easily designed using the receiver-pull communication model to suppress unwanted Internet traffic.
Cross-functional teaming in a capstone engineering design course
Authors: D. T. Rover
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

This paper describes a cross-functional teaming approach used in a computer-engineering capstone design course. Students are grouped into two sets of interdependent teams, "design teams" and "skill teams". While designing a product, students acquire an understanding of the need for lifelong learning and the need to depend upon each other for critical skills and knowledge necessary to ensure overall project success. Design teams are formed for the entire semester. Each team works on a specific engineering design project that involves the collaborative development and evaluation of a "product" containing an embedded computer. Skill teams are formed from representatives of each design team. These team members acquire specific skills and knowledge needed to ensure success within the individual design projects. Skill teams are highly focused. For example, one team learns how to use Microsoft's PowerPoint presentation software tools. These team members take this knowledge back to their design teams, instruct design-team members in PowerPoint basics, and use PowerPoint in team presentations. Other skill teams focus on topics such as: management of class and team activities; browsing the Internet to obtain information about embedded-system hardware components, software, design tools, and third-party suppliers; hardware and software standards related to embedded systems; and programmable-logic-device technologies and trends.
A new highly-efficient routing and wavelength assignment (rwa) algorithm with qos considerations for multi-service mesh topology optical networks
Authors: Kartalopoulos V. Stamatios
Venue:  (2005)

Abstract not available.* *This dissertation is a compound document (contains both a paper copy and a CD as part of the dissertation). The CD requires the following system requirements: Adobe Acrobat.
Remote timing attacks are practical
Authors: David Brumley, Dan Boneh
Venue: Proceedings of the 12th conference on USENIX Security Symposium - Volume 12 (2003)

Timing attacks are usually used to attack weak computing devices such as smartcards. We show that timing attacks apply to general software systems. Specifically, we devise a timing attack against OpenSSL. Our experiments show that we can extract private keys from an OpenSSL-based web server running on a machine in the local network. Our results demonstrate that timing attacks against network servers are practical and therefore security systems should defend against them.
Narratological Constructs in the Gestalt of the 3D Game environment: Aboriginal Knowledge and its Connection to the Data Landscape Metaphor
Authors: Theodor G. Wyeld, Malcolm Pumpa
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper reports on a project federally funded by the Australian CRC for Interaction Design (ACID). It investigates the use of a 3D game engine as a landscape metaphor for hosting Australian Aboriginal knowledge practices based on performed narratives. It communicates some recent findings. Central to these findings is the need to communicate a better understanding of the complex interrelationships indigenous Australian people share with their country, how this is reflected in their narratives, and what this can tell us about digital narrative in general. It is pitched at a broad audience which includes, theorists, practitioners, and technologists. It continues issues raised in another paper presented to the European Information Visualisation conference 2006 (IV'06) (see [1]).
An Efficient Design of Cellular Automata Based Cryptographically Robust One-Way Function
Authors: Debdeep Mukhopadhyay, Pallavi Joshi, Dipanwita RoyChowdhury
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

The paper presents an efficient architecture for a one-way function using Two Predecessor Single Attractor Cellular Automata (TPSA CA). Most of the widely used key establishment algorithms employ one-way functions based on modular exponentiation that are computationally very expensive. However, the implementation of the proposed architecture shows that the TPSA based one-way algorithm can be implemented very efficiently with very less consumption of computational resources like power, area and clock cycles. Such a one-way function can be an ideal replacement of modular exponentiation based one-way functions and thus help to develop fast and secure key establishment protocols.
Requirement progression in problem frames: deriving specifications from requirements
Authors: Robert Seater, Daniel Jackson, Rohit Gheyi
Venue: Requirements Engineering (2007)

A technique is presented for obtaining a specification from a requirement through a series of incremental steps. The starting point is a Problem Frame description, involving a decomposition of the environment into interconnected domains and a formal requirement on phenomena of those domains. In each step, the requirement is moved towards the machine, leaving behind a trail of &#x201c;breadcrumbs&#x201d;&#x2014;partial domain descriptions representing assumptions about the behaviors of those domains. Eventually, the transformed requirement references only phenomena at the interface of the machine and can therefore serve as a specification. Each step is justified by a mechanically checkable implication, ensuring that, if the machine obeys the derived specification and the domain assumptions are valid, the requirement will hold. The technique is formalized in Alloy and demonstrated on two examples.
Secure software updates: disappointments and new challenges
Authors: Anthony Bellissimo, John Burgess, Kevin Fu
Venue: Proceedings of the 1st USENIX Workshop on Hot Topics in Security (2006)

A client can use a content distribution network to securely download software updates. These updates help to patch everyday bugs, plug security vulnerabilities, and secure critical infrastructure. Yet challenges remain for secure content distribution: many deployed software update mechanisms are insecure, and emerging technologies pose further hurdles for deployment. Our analysis of several popular software update mechanisms shows that deployed systems often rely on trusted networks to distribute critical software updates-despite the research progress in secure content distribution. We demonstrate how many deployed systems are susceptible to weak man-in-the-middle attacks. Furthermore, emerging technologies such as mobile devices, sensors, medical devices, and RFID tags present new challenges for secure software updates. Sporadic network connectivity and limited power, computation, and storage require a rethinking of traditional approaches for secure content distribution on embedded devices.
A new adaptive subband structure with critical sampling
Authors: M. R. Petraglia
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

In this paper, a new adaptive subband structure with critical sampling of the subband signals, which yields exact modeling of FIR systems, is derived. An adaptation algorithm, which minimizes the sum of the subband squared-errors, is obtained for the updating of the coefficients of the new subband structure, resulting in significant convergence rate improvement for colored input signals when compared to the full-band LMS algorithm. A simplified version of the adaptation algorithm, with reduced computational complexity, is also presented. An efficient implementation of the proposed subband structure is described, with computational savings of the order of the number of subbands when compared to the full-band LMS. Computer simulations illustrate the convergence behavior of the proposed algorithms.
LensTree: Browsing and Navigating Large Hierarchical Information Structures
Authors: Hongzhi Song, Yu Qi, Lei Xiao, Tonglin Zhu, Edwin P. Curran
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

This paper presents LensTree, a novel browsing and navigation tool for large hierarchical information structures. It enhances traditional indented lists by applying focus + context view to its design. LensTree dynamically changes the sizes of nodes to provide a focal area around the mouse pointer while keeping nodes in the peripheral area in smaller sizes as context. This enables it to display a larger hierarchy than traditional indented lists within the same screen area. Therefore scrolling and expanding/ collapsing are less often used so that it is more efficient for performing browsing and navigation tasks. An informal user test was conducted and the users showed strong interest to LensTree's visual presentation. It suggested that this technique was worth further exploitation.