ppxscal/embedding_network huggingface dataset:
Rate scalable video coding using a foveation-based human visual system model
Authors: Zhou Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Recently, there have been two interesting trends in image and video coding research. One is to use human visual system (HVS) models to improve the current state-of-the-art coding algorithms by better exploiting the properties of the intended receiver. The other is to design rate-scalable video codecs, which allow the extraction of coded visual information at continuously varying bit rates from a single compressed bitstream. We follow these two trends and propose a foveation scalable video coding (FSVC) algorithm, which supplies good quality-compression performance as well as effective rate scalability to support simple and precise bit rate control. A foveation-based HVS model plays a key role in the algorithm. The algorithm is amenable to the inclusion of various HVS models and adaptable to different video communication applications.
Accurate interconnect modeling for efficient transient simulation in vlsi chip design
Authors: Pinaki Mazumder
Venue:  (2006)

Aggressive VLSI feature size shrinking makes integrated circuits and systems both larger and faster. CMOS integrated circuits are now operating at well more than 3 GHz of clock; nevertheless, it is projected that the VLSI chip speed will enhance in a decade by a factor of four. As the interconnect scaling poses a serious challenge to signal integrity and circuit speed, these interconnects must be represented as distributed RLC transmission lines. The huge number of interconnects within the chip makes the traditional simulators prohibitively slow. Therefore, among other techniques to speed up the simulation, efficient interconnect modeling algorithms are needed to obtain accurate models for efficient circuit simulation in VLSI chip design. Since the Differential Quadrature (DQ) method was invented for solving partial differential equations (PDE's) in 1972, it has been recognized by mathematicians as a computationally efficient approximation technique. The DQ method can accurately compute nonlinear PDE's with ten times less grid points than required by the finite difference (FD) methods. In this research, this key feature of the DQ method is exploited to build faster mathematical modeling tools for solving inter-connect modeling problems in high-speed VLSI chip design and simulation. Passivity preservation is an important criterion for interconnect modeling. Although original DQ methods demonstrate high efficiency, their passivities are not guaranteed. We have adapted DQ methods to interconnect modeling to ensure its passivity. Using the equivalent circuit based on the DQ method to represent interconnects, a speedup of up to six times over HSPICE is demonstrated in the numerical experiments of transient simulation. The Finite Difference Quadrature FDQ method is proposed for transmission line modeling. The FDQ method adapts coarse grid points along the transmission line to compute the finite difference between adjacent grid points by using a global approximation scheme in the form of a weighted sum of quantities beyond the local grid points. Unlike the Gaussian Quadrature method that computes numerical integrals by using global approximation framework, the FDQ method uses global, quadrature method to construct the approximation schemes to compute, however, numerical finite differences. The FDQ method has superior numerical dispersion to the FD method and needs much sparser grid points to achieve comparable accuracy. Numerical results show that FDQ method is an effective way to accurately model transmission lines for fast circuit simulation.
Sampling design for the weak signal non-Gaussian detection problem
Authors: Chao-Tang Yu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

In this paper, we present a sampling design for the weak signal detection in additive non-Gaussian noise. We employ the theory of spherically invariant random processes (SIRP) to express the non-Gaussian noise. Our approach for the design of sampling schemes is based on the class of Ali-Silvey distance measures. A design objective function for this problem is derived and is maximized to obtain the sampling scheme for the detection problem under consideration. Its detection performance is compared with that of the uniform sampling scheme by means of a numerical example. Comparisons show that our sampling design results in a superior performance.
A Test-Data Management Function for Chronic Condition Patients
Authors: Shuichi Toyoda, Noboru Niki, Hiromu Nishitani
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

The number of chronic condition patients has increased rapidly in recent years, with the result that an efficient diagnosis and treatment of these patients is required. Therefore, the attainment of a function that can diagnose chronic condition patients efficiently is the goal of computerized medical treatment. This paper describes "FUJI-Viewer", a clinical decision support system that pays attention to the flow of information for chronic condition patients. FUJI-Viewer creates a test plan for each patient, and manages patient's test plan over time in a consistent manner. FUJI-Viewer also prevents test-item omission errors and duplicate-item errors. The result of integrating these functions in an order entry system and its evaluation is described.
Attractive Feature Reduction Approach for Colon Data Classification
Authors: Mohammed Al-Shalalfa, Reda Alhajj
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01 (2007)

In this paper, we try to identify a set of reduced features capable of distinguishing between two classes by performing double clustering using fuzzy c-means. We decided on using fuzzy c-means because a fuzzy model fits better the gene expression data analysis. Fuzziness parameter m is a major problem in applying fuzzy c-means method for clustering. In this approach, we applied fuzzy c-means clustering using different fuzziness parameters for two forms of microarray data. Support vector machine with different kernel functions are used for classification. As a result of the experiments conducted on the colon dataset, we have observed that CSVM is able to correctly classify the whole training and test sets when the data is log2 transformed and when m is close to 1.5.
Privacy Management for Context Transponders
Authors: Michael Fahrmair, Wassiou Sitou, Bernd Spanfelner
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

While by now feasible solutions to protect privacy for complex ubiquitous applications are available, very small devices, called context transponders (CTP) still lack resources to run sophisticated full scale approaches like DRM and strong encryption. These devices however, will play an important role in the success of ubiquitous computing as they support the idea of pervasiveness (small, mobile etc.). We propose a set of techniques outlined as the CTP-classmark that aims to introduce data avoidance and obfuscation strategies to enable information security in context aware applications. Using this classmark, the users' privacy can be protected even on low resource devices and hence the users' trust in ubicomp applications will rise.
Using production grammars in software testing
Authors: Emin Gün Sirer, Brian N. Bershad
Venue: Proceedings of the 2nd conference on Conference on Domain-Specific Languages - Volume 2 (1999)

Extensible typesafe systems, such as Java, rely critically on a large and complex software base for their overall protection and integrity, and are therefore difficult to test and verify. Traditional testing techniques, such as manual test generation and formal verification, are too time consuming, expensive, and imprecise, or work only on abstract models of the implementation and are too simplistic. Consequently, commercial virtual machines deployed so far have exhibited numerous bugs and security holes. In this paper, we discuss our experience with using production grammars in testing large, complex and safety-critical software systems. Specifically, we describe lava, a domain specific language we have developed for specifying production grammars, and relate our experience with using lava to generate effective test suites for the Java virtual machine. We demonstrate the effectiveness of production grammars in generating complex test cases that can, when combined with comparative and variant testing techniques, achieve high code and value coverage. We also describe an extension to production grammars that enables concurrent generation of certificates for test cases. A certificate is a behavioral description that specifies the intended outcome of the generated test case, and therefore acts as an oracle by which the correctness of the tested system can be evaluated in isolation. We report the results of applying these testing techniques to commercial Java implementations. We conclude that the use of production grammars in combination with other automated testing techniques is a powerful and effective method for testing software systems, and is enabled by a special purpose language for specifying extended production grammars.
Edge-Based Prediction for Lossless Compression of Hyperspectral Images
Authors: Sushil K. Jain, Donald A. Adjeroh
Venue: Proceedings of the 2007 Data Compression Conference (2007)

We present two algorithms for error prediction in lossless compression of hyperspectral images. The algorithms are context-based and non-linear, and use a one-band look-ahead, thus requiring a minimal storage buffer. The first algorithm (NPHI) predicts the pixel in the current band based on the information from its context. Prediction contexts are defined based on the neighboring causal pixels in the current band and the corresponding co-located causal pixels in the reference band. EPHI extends NPHI using edge-based analysis. Prediction is performed by classifying the pixels into edge and non-edge pixels. Each pixel is then predicted using information from pixels in the same edge class within the context. Empirical results show that the proposed methods produce competitive results when compared with other state-of-the-art algorithms with comparable complexity. On average, the edge-based technique (EPHI) produced the best overall result, over the images in the test dataset.
LSP weighting functions based on spectral sensitivity and mel-frequency warping for speech recognition in digital communication
Authors: R. Haeb-Umbach
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

In digital communication networks, a speech recognition system extracts feature parameters after reconstructing speech signals. In this paper, we consider a useful approach of incorporating speech coding parameters into a speech recognizer. Most speech coders employ line spectrum pairs (LSPs) to represent spectral parameters. We introduce weighted distance measures to improve the recognition performance of an LSP-based speech recognizer. Experiments on speaker-independent connected-digit recognition showed that weighted distance measures provide better recognition accuracy than unweighted distance measures do. Compared with a conventional method employing mel-frequency cepstral coefficients, the proposed method achieved higher performance in terms of a recognition accuracy. 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
Comparing Approaches to Mining Source Code for Call-Usage Patterns
Authors: Huzefa Kagdi, Michael L. Collard, Jonathan I. Maletic
Venue: Proceedings of the Fourth International Workshop on Mining Software Repositories (2007)

Two approaches for mining function-call usage patterns from source code are compared. The first approach, itemset mining, has recently been applied to this problem. The other approach, sequential-pattern mining, has not been previously applied to this problem. Here, a call-usage pattern is a composition of function calls that occur in a function definition. Both approaches look for frequently occurring patterns that represent standard usage of functions and identify possible errors. Itemset mining produces unordered patterns, i.e., sets of function calls, whereas, sequential-pattern mining produces partially ordered patterns, i.e., sequences of function calls. The trade-off between the additional ordering context given by sequential-pattern mining and the efficiency of itemset mining is investigated. The two approaches are applied to the Linux kernel v2.6.14 and results show that mining ordered patterns is worth the additional cost.
Is the Open Way a Better Way? Digital Forensics Using Open Source Tools
Authors: Dan Manson, Anna Carlin, Steve Ramos, Alain Gyger, Matthew Kaufman, Jeremy Treichelt
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The subject of digital forensics can be quite challenging. Digital forensics is in its infancy and teaching digital forensics includes the techniques as well as the tools that assist in the process. This article discusses the tools used in computer forensics, compares an open source tool to two commercial tools, and the advantages and disadvantages of all three tools in an academic environment. A team of four senior students sponsored by two faculty members established the project scope and requirements, presented three prototypes, and detailed the considerations of using open source tools. The same image was used to measure the performance of each software tool. The team found that the three tools provided the same results with different degrees of difficulty. The end results indicate that Open Source tools are a very good verification of evidence found using other products and should be included in the academic environment.
The spinning screen: a movable experience between virtual and real
Authors: Hyun-Jean Lee, Ali Mazalek, Kirti Goel
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

In screen-based experiences, the screen itself can become the physical device used for interaction. The "move-ability" of the screen affords interactivity between the screen artifact and the viewer and between the virtual and physical spaces. As a movable screen interface, we have created the spinning screen, a two-sided monitor on a revolving base. This interface invites user interaction through the action of spinning the screen to manipulate media content. By allowing viewers to grasp the interplay between visibility and invisibility, the spinning screen can enrich user experiences of virtual imagery through direct tangible interaction in both playful and practical contexts. We describe an art piece and an application for 3D visualization and modeling.
Parallel Evolutionary Asymmetric Subsethood Product Fuzzy-Neural Inference System: An Island Model Approach
Authors: Lotika Singh, Satish Kumar
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

This paper introduces an Island Model approach for differential evolution (DE) learning in Asymmetric Subsethood Product Fuzzy Neural Inference System (ASuPFuNIS). In the island model, each island executes an independent DE and maintains its own sub-population for search. The migration model scheme has been implemented here to parallelize ASuPFuNIS. The parallelization strategy presented here is compared with the master-slave approach.
Automatic persistent memory management for the spotless javaTM virtual machine on the palm connected organizer
Authors: Daniel Schneider, Bernd Mathiske, Matthias Ernst, Matthew L. Seidl
Venue: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (2001)

Palm organizers are widely used in a multi-tasking fashion. Users switch from one application to another without losing the context established in either of them. Despite its obvious usefulness there is no automatic support for this convenience in the organizer's operating system, PalmOS. Programmers must implement event callbacks that use the PalmOS database API to save and reload specific application state. In this report we describe how this burden can be eliminated. We enhanced the Spotless JavaTM virtual machine for the Palm organizer with transparent multi-tasking support that automates persistence. As a consequence, running Java programs can be transfered between two Palm organizers using the infra-red link. A transfered program will resume on the receiving organizer in the exact same state as it had on the sender. In addition, a HotSync operation can effectively be used to establish a checkpoint for each Java program involved. Originally, the address range available for running programs was restricted to a few tens of KB in the dynamic RAM area. By directly addressing the much larger static RAM area our modified VM supports address ranges of several MB. We provide an easy-to-use protocol that leverages persistent threads for automatic life cycle control of external resources (e.g. windows, forms and databases). When applied at the library level, this protocol maintains complete persistence transparency for the application programmer.
A voice-to-MIDI system for singing melodies with lyrics
Authors: Naoki Itou, Kazushi Nishimoto
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

In this paper, we propose a robust Voice-to-MIDI (V to M) system with which a user can input MIDI sequence data by naturally singing melodies with lyrics. A Voice-to-MIDI system translates singing voices into digital musical data, i.e., MIDI sequence data. Therefore, with such a system, users can input melodies intuitively, which releases them from manual translating memorized melodies into chromatic pitches. However, the quality of translation of ordinary Voice-to-MIDI systems is insufficient. One of the most significant problems is the poor accuracy of the segmentation of notes. We solve this problem by employing "rhythmic tapping" concurrently with singing. We examined the proposed method by the accuracy of the numbers of segmented notes and their pitches. As a result, we confirmed that our system outperformed ordinary Voice-to-MIDI systems. Thus, this system satisfies both of easy and intuitive composition of MIDI sequence data and high accuracy of translation of sung data into MIDI sequence data.
Interactive Illustrative Rendering on Mobile Devices
Authors: Jingshu Huang, Brian Bue, Avin Pattath, David S. Ebert, Krystal M. Thomas
Venue: IEEE Computer Graphics and Applications (2007)

Illustrative rendering is a widely used visualization technique to display conceptual information, describe problems, and give insight to solve them efficiently in science, engineering, and the arts. Providing users with automated tools to generate illustrations at will is a challenging problem. Adapting illustrative rendering techniques from desktop platforms to mobile devices creates many hardware and software issues. The authors discuss adaptations of different illustration techniques for rendering 3D models directly on mobile devices for education and training purposes. The implementations of these illustration techniques address the limitations widely encountered in low-end devices. An interactive mobile graphical and textual rendering system with a toolkit of different illustration modes has been implemented.
Designing Run-Time Fault-Tolerance Using Dynamic Updates
Authors: Ali Ebnenasir
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

We present a framework for designing run-time faulttolerance using dynamic program updates triggered by faults. This is an important problem in the design of autonomous systems as it is often the case that a running program needs to be upgraded to its fault-tolerant version once faults occur. We formally state fault-triggered program updates as a design problem. We then present a sound and complete algorithm that automates the design of faulttriggered updates for replacing a program that does not tolerate faults with a fault-tolerant version thereof at run-time. We also define three classes of fault-triggered dynamic updates that tolerate faults during the update. We demonstrate our approach in the context of a fault-triggered update for the gate controller of a parking lot.
A novel technique to use scratch-pad memory for stack management
Authors: Soyoung Park, Hae-woo Park, Soonhoi Ha
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Extensive work has been done for optimal management of scratch-pad memory (SPM) all assuming that the SPM is assigned a fixed address space. The main target objects to be placed on the SPM have been code and global memory since their sizes and locations are not changed dynamically. We propose a novel idea of dynamic address mapping of SPM with the assistance of memory management unit (MMU). It allows us to use SPM for stack management without architecture modification and complier assistance. The proposed technique is orthogonal to the previous works so can be used at the same time. Experiments results show that the proposed technique results in average performance improvement of 13% and energy savings of 12% observed compared to using only external DRAM. And it also gives noticeable speed up and energy saving against a typical cache solution for stack data.
Prototyping Multiprocessor System-on-Chip Applications: A Platform-Based Approach
Authors: Benaoumeur Senouci, Aimen Bouchhima, Frédéric Rousseau, Frédéric Petrot, Ahmed Jerraya
Venue: IEEE Distributed Systems Online (2007)

Multiprocessor system-on-chip designers face challenges during prototyping, when there is a real need for methods and tools that can easily map applications onto different architectures without tedious redesigning. Such methods and tools must also ensure rapid validation. A new MPSoC prototyping and validation approach uses the Posix 1003 1.C API standard and a reconfigurable multiprocessor hardware platform for fast prototyping of Posix-based applications.
Using disruptive technology for explorative learning
Authors: Iain Oliver, Kristoffer Getchell, Alan Miller, Colin Allison
Venue: ACM SIGCSE Bulletin (2007)

Computer Networking is the subject that enables us to build and understand the Internet which in turn lies at the heart of many social and economic transformations that are central to modern society. At the subject's core are the protocols for sending and receiving packets and reporting errors. Although it is a dynamic and naturally engaging subject there are significant barriers which make it difficult for a student to engage realistically with network protocols. These can be categorised as barriers of time, space and access. From the perspective of time, many of the interactions occur at timescales that are outside of the range of human perception; from the perspective of space, a student will be situated in one location which will often define their view of the network; from the perspective of access, interaction with network protocols is mediated through libraries provided by operating systems which in turn require the use of programming languages to manipulate. This paper advocates the use of disruptive technology, based on the PlanetLab overlay network to support explorative approaches to learning about Computer Networking.