ppxscal/embedding_network huggingface dataset:
DigiBox: a self-protecting container for information commerce
Authors: Olin Sibert, David Bernstein, David Van Wie
Venue: Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1 (1995)

Information Commerce is a business activity carried out among several parties in which information carries value and is treated as a product. The information may be content, it may be returned usage and marketing data, and it may be representative of financial transactions. In each of these cases the information is valuable and must be kept secure and private. Traditional approaches secure the transmission of that information from one point to another; there are no persistent protections. Protection of all of these components of information commerce for all parties in a transaction value chain is necessary for a robust electronic infrastructure. A prerequisite to such an environment is a cryptographically protected container for packaging information and controls that enforce information rights. This paper describes such a container, called the DigiBoxTM. EPR has submitted initial specifications for the DigiBox container to the ANSI IISP Electronic Publishing Task Force (EPUB) within the User/Content Provider Standards Working Group (WG4).
Dynamic analysis of constraint-variable dependencies to guide SAT diagnosis
Authors: V. Durairaj, P. Kalla
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

An important aspect of the Boolean satisfiability problem is to derive an ordering of variables such that branching on that order results in a faster, more efficient search. Contemporary techniques employ either variable-activity or clause-connectivity based heuristics, but not both, to guide the search. This paper advocates for simultaneous analysis of variable-activity and clause-connectivity to derive an order for SAT search. Preliminary results demonstrate that the variable order derived by our approach can significantly expedite the search. As the search proceeds, clause database is updated due to added conflict clauses. Therefore, the variable activity and connectivity information changes dynamically. Our technique analyzes this information and recomputes the variable order whenever the search is restarted. Preliminary experiments show that such a dynamic analysis of constraint-variable relationships significantly improves the performance of the SAT solvers. Our technique is very fast and this analysis time is a negligible (in milliseconds) even for instances that contain a large number of variables and constraints. This paper presents preliminary experiments, analyzes the results and comments upon future research directions.
Subspace state space model identification for speech enhancement
Authors: E. Grivel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper deals with Kalman filter-based enhancement of a speech signal contaminated by a white noise, using a single microphone system. Such a problem can be stated as a realization issue in the framework of identification. For such a purpose we propose to identify the state space model by using subspace non-iterative algorithms based on orthogonal projections. Unlike estimate-maximize (EM)-based algorithms, this approach provides, in a single iteration from noisy observations, the matrices related to state space model and the covariance matrices that are necessary to perform Kalman filtering. In addition no voice activity detector is required unlike existing methods. Both methods proposed here are compared with classical approaches.
Software Licensing: A Classification and Case Study
Authors: Sathiamoorthy Manoharan, Jesse Wu
Venue: Proceedings of the First International Conference on the Digital Society (2007)

Software licensing schemes are controls put in software to grant or deny the use of the software. It plays an important part in the distribution and the control of software. This paper reviews some of the technologies behind software licensing schemes and presents a classification and a case study.
Blind wideband spatial filtering based on higher-order cyclostationarity properties
Authors: G. Gelli
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

In this paper, a new method for blind spatial signal filtering is proposed. It utilizes the selectivity property of the higher-order cyclostationary statistics exhibited by the signal of interest to accurately estimate its unknown steering vector, also in the presence of strong frequency-overlapped interfering signals, which would render the standard stationarity-based techniques ineffective. The method is useful when the desired signal cannot be accurately extracted by exploiting its second-order cyclostationarity properties, as proposed in Schell and Gardner (1993). A performance analysis, carried out by computer simulations in the case of QAM-modulated signals with partially overlapping bands, substantiates the effectiveness of the proposed method.
Design and DfT of a high-speed area-efficient embedded asynchronous FIFO
Authors: Paul Wielage, Erik Jan Marinissen, Michel Altheimer, Clemens Wouters
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Embedded First-In First-Out (FIFO) memories are increasingly used in many IC designs. We have created a new full-custom embedded ripple-through FIFO module with asynchronous read and write clocks. The implementation is based on a micropipeline architecture and is at least a factor two smaller than SRAM-based and standard-cell-based counterparts. This paper gives an overview of the most important design features of the new FIFO module and describes its test and design-for-test approach.
Multimediated curricular development applications
Authors: A. Kagan
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

The study approaches the issue of integrated system and management applications within the engineering curriculum using multimediated technologies for classroom delivery. Three components of the technology are used in this approach: client/server systems are used to build information literacy across the engineering curriculum; multimediated applications and examples including the use of the Internet for functional management related topics within the systems curriculum are developed; expanded use of rapid data retrieval applications for image storage and graphical application development are implemented.
Enabling technologies for ultrasound imaging in computer-assisted intervention
Authors: Gabor Fichtinger, Gregory D. Hager, Russell H. Taylor
Venue:  (2007)

There has been an increasing interest in minimally invasive US-guided interventions that require precise placement of a surgical tool (needle, tissue ablator, etc.) to the anatomical target. To address this problem, I have developed a collection of novel technologies and integrated those in prototype systems. I introduce multiple system embodiments that involve robotics, tracking, anatomical modeling, ultrasound image processing, and elasticity monitoring. The underlying themes in these systems are (1) simultaneous tracking of surgical tool with respect to the US images and (2) monitoring physiological changes, specifically tissue coagulation, throughout the procedure.My main contribution to the first theme is inventing a robust method for 2D and 3D ultrasound probe calibration with a closed-form solution. As a result, one can discern the unknown spatial transformation between image pixels and tracker coordinates in real-time, in-vivo while the patient is being scanned. I also introduced a novel methodology for in-vivo quality control of tracked US systems, by capturing system errors that manifest in changes of calibration parameters. The concept, mathematical formulation, and experimental evaluation are presented and demonstrated in-vitro experiments.With respect to the second theme, I presented a rapid US-based approach to monitor ablative therapy by optimizing shape parameters. My method involves the integration of a biomechanical computational model of the tissue, a correlation approach to estimate and track tissue deformation, and an optimization method to solve the inverse problem of recovering the shape parameters in the volume of interest. I demonstrate convergence and reliability on simulated data and present successful monitoring of tissue ablation of ex-vivo bovine liver samples.
A Taxonomic Approach to Topology Control in Ad Hoc and Wireless Networks
Authors: Matthias R. Brust, Steffen Rothkugel
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Topology Control (TC) aims at tuning the topology of highly dynamic networks to provide better control over network resources and to increase the efficiency of communication. Recently, many TC protocols have been proposed. The protocols are designed for preserving connectivity, minimizing energy consumption, maximizing the overall network coverage or network capacity. Each TC protocol makes different assumptions about the network topology, environment detection resources, and control capacities. This circumstance makes it extremely difficult to comprehend the role and purpose of each protocol. To tackle this situation, a taxonomy for TC protocols is presented throughout this paper. Additionally, some TC protocols are classified based upon this taxonomy.
A project oriented approach to teaching software-hardware integration of microcontroller-based systems
Authors: J. L. Cruz-Rivera
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

The microprocessor interfacing course offered at the University of Puerto Rico-Mayaguez is a core course for all computer engineering majors and a technical elective course for electrical engineering majors specializing in the electronics technical area. Students enrolled in the microprocessor interfacing course have traditionally been required to complete a major design project in the area of microcomputer/microcontroller systems. However, it has only been recently that the physical implementation of the student's design has been stressed as a requisite of the course. In addition, the course has been restructured to stress teamwork, communication and project management skills. A major aspect of the course is the extensive use of the World Wide Web (WWW) for student portfolio development and for the paperless conduction of the course. This paper presents various aspects regarding the new course structure, the laboratory facilities developed to facilitate prototype implementation and the use of the WWW. Also, an overview of a typical project design is provided. 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
A Unified Energy Efficient Cluster ID based Routing Scheme for Wireless Sensor Networks - A more Realistic Analysis
Authors: Irfan Ahmed, Mugen Peng, Wenbo Wang
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

This paper presents an energy efficient cluster ID based routing scheme with maximum residual node energy as one of routing metrics. The uneven load in network is minimized by cluster size adaptation technique. Our new routing protocol CIDRSN (Cluster ID based Routing in Sensor Networks) takes the cluster ID as next hop address instead of cluster-head ID in routing table and eliminate the cluster formation phase and routing phase from being executed in each round. Both cluster formation and routing phases are only executed during the initialization of network, which reduces the energy consumption and increases the network life to about 16%.. Robustness is increased by multi-path routing. Simulation results show that CIDRSN outperforms the preceding hierarchical routing protocols.
Confidence-based Trustworthiness of Acquaintance Peers in Peer-to-Peer Overlay Networks
Authors: Kenichi Watanabe, Yoshio Nakajima, Naohiro Hayashibara, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

In this paper, we discuss a peer-to-peer (P2P) based fully distributed system where each peer process autonomously makes a decision by itself using information obtained from its acquaintance peers without any centralized coordinator. An acquaintance of a peer p is another peer about whose service p knows and with which p can directly communicate. Here, it is critical to discuss how much a peer can trust each acquaintance peer. In this paper, the trustworthiness of an acquaintance peer is defined in terms of the satisfiability and ranking factor with confidence. The trustworthiness depends on how much a peer is satisfied by an acquaintance for each service request and how much each acquaintance peer is trusted by others, i.e. satisfiability and ranking factor of an acquaintance, respectively. In addition, it is significant to discuss how confident a peer is of its own information, satisfiability and ranking factor of an acquaintance. We present a simple auction system as an example in this paper.
Image display in teaching image processing .I. Monochrome images
Authors: H. J. Trussell
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

The concentration of most image processing courses is on the various algorithms used to alter an input image or data to produce a desired output image. Little effort is expended on teaching the appropriate display methods that are required to accurately demonstrate the effectiveness of the processing algorithms under investigation. This paper reviews the fundamentals of image display that every student should know before displaying the homework and project results that are assigned in those courses.
A novel method based on sampling theory to recover block losses for JPEG compressed images
Authors: S. Talebi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

A new method to recover (8/spl times/8) block losses for JPEG compressed images is proposed, which can be used in wireless UMTS and asynchronous transfer mode (ATM) networks. The problem of image reconstruction with (8/spl times/8) block losses is transformed to a system of linear equations using two-dimensional trigonometric polynomials. The simulation results show the feasibility of this method. The sensitivity analysis of the proposed method shows that this method is robust against additive noise.
A level-set subgradient projection algorithm for non-differentiable signal restoration with multiple constraints
Authors: Jian Luo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

An new adaptive level-set subgradient projection algorithm is proposed to solve non-differentiable signal recovery problems with multiple convex constraints. The algorithm is described, its convergence is established, and its implementation is discussed. Applications to constrained total variation signal restoration and denoising are demonstrated.
CrystalDome: A Projected Hemispherical Display with a Gestural Interface
Authors: Francis T. Marchese, Jonas Borjesson, Josh Rose
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

CrystalDome is an inexpensive alternative to a volumetric display based on video projector technology that supports omni-directional viewing (Figure 1). It can show mapped spherical surfaces, such as globes, and scenes composed of threedimensional objects. In the latter case, an algorithm was developed to perform hidden surface elimination in the hemisphere's reference frame. Participants can sit around the hemisphere, which is built into a low table. Sensors capture hand movements near the hemisphere for adjustment of the position, orientation and size of the objects that are projected from below onto the inside of the display.
Accept() scalability on Linux
Authors: Stephen P. Molloy, Chuck Lever
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

This report explores the possible effects of a "thundering herd" problem associated with the Linux implementation of the POSIX accept() system call. We discuss the nature of the problem and how it may affect the scalability of the Linux kernel. In addition, we identify candidate solutions and considerations to keep in mind. Finally, we present a solution and benchmark it, giving a description of the benchmark methodology and the results of the benchmark.
Gaussian Golomb Codes
Authors: Seishi TAKAMURA, Yoshiyuki YASHIMA
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Gaussian sources are observed in vast wide areas. Contrarily to what happens for the geometric and double-sided geometric distributions, there is no simple, instantaneous code for the normal distribution.
Performance comparison of EKF and particle filtering methods for maneuvering targets
Authors: Mónica F. Bugallo, Shanshan Xu, Petar M. Djurić
Venue: Digital Signal Processing (2007)

Online tracking of maneuvering targets is a highly nonlinear and challenging problem that involves, at every time instant, the estimation not only of the unknown state in the dynamic model describing the evolution of the target, but also the underlying model accounting for the regime of movement. In this paper we review and compare several sequential estimation procedures, that use appropriate strategies for coping with various models that account for the different modes of operation. We focus on the application of the recently proposed cost-reference particle filtering (CRPF) methodology, which aims at the estimation of the system state without using probability distributions. The resulting method has a more robust performance when compared to standard particle filtering (SPF) algorithms or the interactive multiple model (IMM) algorithm based on the use of the well known extended Kalman filter (EKF). Advantages and disadvantages of the considered algorithms are illustrated and discussed through computer simulations.
Bigtable: a distributed storage system for structured data
Authors: Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, Robert E. Gruber
Venue: Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7 (2006)

Bigtable is a distributed storage system for managing structured data that is designed to scale to a very large size: petabytes of data across thousands of commodity servers. Many projects at Google store data in Bigtable, including web indexing, Google Earth, and Google Finance. These applications place very different demands on Bigtable, both in terms of data size (from URLs to web pages to satellite imagery) and latency requirements (from backend bulk processing to real-time data serving). Despite these varied demands, Bigtable has successfully provided a flexible, high-performance solution for all of these Google products. In this paper we describe the simple data model provided by Bigtable, which gives clients dynamic control over data layout and format, and we describe the design and implementation of Bigtable.
On the Contributions of an End-to-End AOSD Testbed
Authors: Phil Greenwood, Alessandro Garcia, Awais Rashid, Eduardo Figueiredo, Claudio Sant'Anna, Nelio Cacho, Americo Sampaio, Sergio Soares, Paulo Borba, Marcos Dosea, Ricardo Ramos, Uira Kulesza, Thiago Bartolomei, Monica Pinto, Lidia Fuentes, Nadia Gamez, Ana Moreira, Joao Araujo, Thais Batista, Ana Medeiros, Francisco Dantas, Lyrene Fernandes, Jan Wloka, Christina Chavez, Robert France, Isabel Brito
Venue: ICSEW (2007)

Aspect-Oriented Software Development (AOSD) techniques are gaining increased attention from both academic and industrial organisations. In order to promote a smooth adoption of such techniques it is of paramount importance to perform empirical analysis of AOSD to gather a better understanding of its benefits and limitations. In addition, the effects of aspect-oriented (AO) mechanisms on the entire development process need to be better assessed rather than just analysing each development phase in isolation. As such, this paper outlines our initial effort on the design of a testbed that will provide end-to-end systematic comparison of AOSD techniques with other mainstream modularisation techniques. This will allow the proponents of AO and non- AO techniques to compare their approaches in a consistent manner. The testbed is currently composed of: (i) a benchmark application, (ii) an initial set of metrics suite to assess certain internal and external software attributes, and (iii) a "repository" of artifacts derived from AOSD approaches that are assessed based on the application of (i) and (ii). This paper mainly documents a selection of techniques that will be initially applied to the benchmark. We also discuss the expected initial outcomes such a testbed will feed back to the compared techniques. The applications of these techniques are contributions from different research groups working on AOSD.
Finite state hierarchical table-lookup vector quantization for images
Authors: N. Chaddha
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

This paper presents an algorithm for image compression using finite state hierarchical table-lookup vector quantization. Finite state vector quantizers are vector quantizers with memory. Finite state vector quantization (FSVQ) takes advantage of the correlation between adjacent blocks of pixels in an image and also helps in overcoming the complexity problem of block memoryless VQ for large block sizes by using smaller block sizes for similar performance. FSVQ algorithms typically try to preserve edge and gray scale gradient continuity across block boundaries in images in order to reduce blockiness. Our algorithm combines FSVQ with hierarchical table-lookup vector quantization. Thus the full-search encoder in an FSVQ is replaced by a table-lookup encoder. In these table lookup encoders, input vectors to the encoder are used directly as addresses in code tables to choose the code-words. In order to preserve manageable table sizes for large dimension VQs, we use hierarchical structures to quantize the vector successively in stages. Since both the encoder and decoder are implemented by table lookups, there are no arithmetic computations required in the final system implementation. To further improve the subjective quality of compressed images we use block transform based finite-state table-lookup vector quantizers with subjective distortion measures. There is no need to perform the forward or reverse transforms as they are implemented in the tables.
Paths of Trains with Two-Wheeled Cars
Authors: Luis Montejano, Jorge Urrutia
Venue: Discrete Computational Geometry (2007)

In this paper we study the following simple and mind-puzzling problem: Can a model train car, which runs along an intricate track, complete a full cycle around it? In our paper a track will be represented by a simple closed curve, and the cars of our model train by segments whose endpoints lie on the curve.