ppxscal/embedding_network huggingface dataset:
Efficient CELP-based diversity schemes for VoIP
Authors: A. K. Anandakumar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Diversity schemes include information about packet n in future packets or send information about packet n via separate paths. If packet n is lost, it is reconstructed from information included in future packets or information received via separate paths. This paper presents CELP-based diversity schemes for voice over packet applications. The diversity schemes reduce the impact of packet losses while being efficient in terms of both bandwidth requirement and computational complexity. With our diversity schemes, transmission schemes that allocate bandwidth resources among diversity stages during congestion give significantly better performance than schemes that use no diversity during congestion, for the same bandwidth usage.
Super-resolution reconstruction based on linear interpolation of wavelet coefficients
Authors: C. S. Tong, K. T. Leung
Venue: Multidimensional Systems and Signal Processing (2007)

High resolution image reconstruction is an image process to reconstruct a high resolution image from a set of blurred, degraded and shifted low resolution images. In this paper, the reconstruction problem is treated as a function approximation. We use linear interpolation to build up an algorithm to obtain the relationship between the detail coefficients in wavelet subbands and the set of low resolution images. We use Haar wavelet as an example and establish the connection between the Haar wavelet subband and the low resolution images. Experiments show that we can use just 3 low resolution images to obtain a high resolution image which has better quality than Tikhonov least-squares approach and Chan et al. Algorithm 3 in low noise cases. We also propose an error correction extension for our method which can lead to very good results even in noisy cases. Moreover, our approach is very simple to implement and very efficient.
Learner reflection in student self-assessment
Authors: Judy Kay, Lichao Li, Alan Fekete
Venue: Proceedings of the ninth Australasian conference on Computing education - Volume 66 (2007)

Learner reflection is critical to effective, deep, transferable learning, especially in cognitively demanding areas, such as learning programming. This paper presents Reflect, a programming education system, which aims to facilitate student self-assessment and promote learner reflection through scrutable learner models. Reflect sets tasks and presents a set of example answers to read and assess. We report students' use of the system over one semester. Overall Reflect appears to help students understand the teacher's goals for the tasks set and to refine their own work in relation to these goals.
Bridging scale-space to multiscale frame analyses
Authors: Y. Bao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We address a well known problem of nonlinear image diffusion techniques, namely the loss of texture information. We do so by first determining that it is due to unaccounted correlation structure in the image which we subsequently mitigate by proposing a wavelet frame-based technique. This, by the same token, establishes a theoretical bridge between the scale space methodology and the multiscale analysis approach. We provide examples to illustrate the effectiveness of the proposed approach.
SIVP: A Toolkit for Integrating Visualization into Virtual Environment
Authors: Xiaohui Liang, Yinghui Che, Xiaoxiao Wu
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

None-visible data modeling and representation is one of the key topics in virtual reality, since it greatly affects the sense of the user. In this paper we present how to visualize none-visible data in the virtual environment and a toolkit called Synthetic Information Visualization Platform (SIVP) is given. This toolkit includes two processes and the main components of SIVP are describes. Finally, we demonstrate some works base on SIVP.
Autoscan-Invert: An Improved Scan Design without External Scan Inputs or Outputs
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

Autoscan is a design-for-testability approach proposed earlier that uses scan chains without external scan inputs or outputs in order to reduce the test application time and test data volume of scan. We describe three improvements to the basic autoscan design-for-testability approach based on the following observation. Under autoscan, due to the elimination of external scan inputs, the first flip-flop of a scan chain can only receive its value from the corresponding next-state line. Thus, its state cannot be controlled directly by a scan operation. In the improved autoscan approach, we allow the inverted next-state line to drive the first flip-flop of a scan chain during scan operations. We refer to the improved autoscan approach as autoscan-invert. We describe a scan synthesis procedure appropriate for autoscan-invert and present experimental results.
Authenticating Feedback in Multicast Applications Using a Novel Multisignature Scheme Based on Cubic LFSR Sequences
Authors: Saikat Chakrabarti, Santosh Chandrasekhar, Mukesh Singhal, Kenneth L. Calvert
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01 (2007)

The problem of authenticating feedback in overlay multicast applications has only recently been highlighted by the network security research community. The multicast source needs to verify all individual signatures on the acknowledgements (Acks) that it receives from the intended receivers--the funnelling of traffic causes, what we call the signed-Ack implosion problem. In this paper, we propose an efficient and scalable technique to solve this problem. First, we present a novel third-order linear feedback shift register (LFSR) sequence-based, 2-party signature scheme CLFSR-S following a well-known variant of the generalized ElGamal signature scheme. Second, we construct an efficient, single round, tree-based multisignature scheme CLFSR-MS (also the first multisignature based on LFSR sequences) using CLFSR-S. The CLFSR-MS scheme has been engineered to be the most efficient and scalable, tree-based multisignature scheme (owing to the unique construction/ signature format of CLFSR-S) designed to solve the signed-Ack implosion problem in reliable, large-scale, performance sensitive multicast applications. We perform a theoretical analysis including correctness and security of CLFSR-MS and also present a performance (computation and communication costs, storage overhead) comparison of the proposed scheme with existing schemes.
Tangible comics: a performance space with full-body interaction
Authors: Özge Samanci, Yanfeng Chen, Ali Mazalek
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

Tangible Comics is a computer vision based full-body interactive storytelling environment that also functions as a comics generator. Prevailing applications of full-body computer vision have not utilized the full storytelling or performance potential of these environments.allOur aim is to produce an environment that can create a space for redefining the conventions of comics, performance, film, photography, and animation. In relation to that, we are exploring the design problems that can arise when computer vision technology is contextualized in an interactive story telling environment.
Panel - "driving the intelligent testbench: are we there yet?"
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

In this paper we present techniques for comparison between behavioral level and register transfer level (RTL) design descriptions by mapping the designs into virtual controllers and virtual datapaths. We also discuss about how the equivalence between behavioral level and RTL designs can be defined precisely using the proposed "attribute statements" in an interactive fashion. Implementation issues as well as considerations on real life industrial design examples are presented as well. 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
General-purpose digital ticket framework
Authors: Ko Fujimura, Yoshiaki Nakajima
Venue: Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3 (1998)

A digital ticket is a certificate that guarantees certain rights of the ticket owner. There are many applications for digital tickets but the ticket properties vary depending on the application. This variety makes the digital ticket processing system expensive, especially if dedicated systems must be developed for each application. This paper thus addresses issues on developing a common data schema and processing architecture for various types of digital tickets. This paper clarifies requirements for a general-purpose digital ticket and shows four features in contrast to digital cash: 1) parameterization of ticket properties on anonymity, transferability, and divisibility; 2) machine-understandability of ticket contents; 3) state-transitionality of ticket status; and 4) composability of multiple tickets. To achieve parameterization of ticket properties and machine-understandability, we propose a Resource Description Framework (RDF)-based ticket description method. Its metadata facility enables various ticket properties to be defined using multi-layered schemata. To achieve state-transitionality and composability, we propose describing a ticket using a set of signed descriptions linked with restriction-specified incomplete/complete links. Finally, this paper proposes a set of common ticket processing components.
A Type Discipline for Authorization in Distributed Systems
Authors: Cedric Fournet, Andrew Gordon, Sergio Maffeis
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

We consider the problem of statically verifying the conformance of the code of a system to an explicit authorization policy. In a distributed setting, some part of the system may be compromised, that is, some nodes of the system and their security credentials may be under the control of an attacker. To help predict and bound the impact of such partial compromise, we advocate logic-based policies that explicitly record dependencies between principals. We propose a conformance criterion, safety despite compromised principals, such that an invalid authorization decision at an uncompromised node can arise only when nodes on which the decision logically depends are compromised. We formalize this criterion in the setting of a process calculus, and present a verification technique based on a type system. Hence, we can verify policy conformance of code that uses a wide range of the security mechanisms found in distributed systems, ranging from secure channels down to cryptographic primitives, including encryption and public-key signatures.
Data hiding by smart pair toggling for halftone images
Authors: J. Mars
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

There is growing interest in hiding data for authentication and copyright control in halftone images printed in books, newspapers and by computer printers. A previous data hiding method, the data hiding by pair-toggling (DHPT), is reasonably good but introduce considerable visual artifacts. In this paper, we analyze the sources of the artifacts in DHPT and propose an improvement by using smart pair toggling. Simulation results suggest that the proposed data hiding by smart pair-toggling (DHSPT) algorithm can hide the same amount of data while generating halftone images with considerably better visual quality than DHPT.
Bayesian Detection in Bounded Height Tree Networks
Authors: Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win
Venue: Proceedings of the 2007 Data Compression Conference (2007)

We study the asymptotic detection performance of large sensor networks, configured as trees with bounded height, in which information is progressively compressed as it moves towards the root of the tree. We show that the error probability decays exponentially fast, and we provide bounds for the error exponent. We analyze further the case where the tree has certain symmetry properties, and derive simple, easily implementable, suboptimal strategies.
High Performance Computing in the Multi-core Area
Authors: Arndt Bode
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

Multi-core technologies, application specific accelerators and fault tolerance requirements are defining a new hardware basis for high performance computing systems. Multi-core will make evolve parallelism from a niche product in HPC to the standard programming model and, therefore, trigger new developments in languages, environments and tools. Accelerators and dynamic system behaviour from fault tolerance will make virtualization techniques necessary to support programmability. Energy efficiency as a new optimization target for HPCN systems will force future systems to bring all of these techniques together.
CATS benchmark time series prediction by Kalman smoother with cross-validated noise density
Authors: Simo Särkkä, Aki Vehtari, Jouko Lampinen
Venue: Neurocomputing (2007)

This article presents the winning solution to the CATS time series prediction competition. The solution is based on classical optimal linear estimation theory. The proposed method models the long and short term dynamics of the time series as stochastic linear models. The computation is based on a Kalman smoother, in which the noise densities are estimated by cross-validation. In time series prediction the Kalman smoother is applied three times in different stages of the method.
A methodology for verification of digital items in fair exchange protocols with active trustee
Authors: Andrea Bottoni, Gianluca Dini, Tage Stabell-Kulø
Venue: Electronic Commerce Research (2007)

Fair exchange constitutes a fundamental mechanism for electronic commerce. Fair exchange assumes that it is possible to verify the correctness of the digital items to be exchanged. However, when an item is indescribable , i.e., it cannot be formally specified, its verification becomes difficult, if not impossible. This hinders a practical deployment of fair exchange. We propose a methodology for the verification of indescribable digital items. The methodology allows a participant in a fair exchange protocol to personally verify the indescribable item without giving him any practical advantage over the other participant, and therefore without violating the fairness imposed by the protocol.
Adaptive Systems Require Adaptive Support--When Tools Attack!
Authors: Jennifer Baldwin, Yvonne Coady
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In a world where intelligence can be arguably measured by an animal's ability to use tools, are we marking ourselves for natural selection? Software development tools are steadily becoming easier to use, but these same tools are becoming so "helpful" that they can actually do more harm than good. Tools are supposed to help evolve and adapt systems -- ironically however, they are often too rigid to be able to evolve and adapt themselves. This study considers three key approaches that can be simultaneously employed within adaptive system infrastructure: patch files, preprocessor directives, and aspects. Their synergies and interoperability characteristics are outlined, and the design of what we believe to be necessary for integrated tool support is established based on evidence gathered from OS and VM infrastructure software. Interoperable System Infrastructure Support (ISIS) is proposed as a tool that can better evolve and adapt according to a system's needs.
Supporting Mobile Service Usage through Physical Mobile Interaction
Authors: Gregor Broll, Sven Siorpaes, Enrico Rukzio, Massimo Paolucci, John Hamard, Matthias Wagner, Albrecht Schmidt
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications (2007)

Although mobile services can be used ubiquitously, their employment and the interaction with them are still restricted by the constraints of mobile devices. In order to facilitate and leverage mobile interaction with services, we present a generic framework that combines Semantic Web Service technology and Physical Mobile Interaction. This interaction paradigm uses mobile devices to extract information from augmented physical objects and use it for a more intuitive and convenient invocation of associated services. For that purpose, the presented framework exploits Web Service descriptions for the automatic and dynamic generation of customizable user interfaces that support and facilitate Physical Mobile Interaction. This generic approach to mobile interaction with services through the interaction with physical objects promises to meet the complementary development of the Internet of Things. A user study with a prototype application for mobile ticketing confirms our concept and shows its limits.
Resource allocation in the multimedia MC-CDMA system with residual effective bandwidth distribution
Authors: Su Pan
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

In this paper, a combined power and rate control algorithm is proposed and evaluated for a multi-code DS-CDMA integrated service system. Different class of service is allocated with different power level to satisfy its energy to interference ratio requirement. Delay sensitive services are allowed to transmit with their burst rate and a residual effective bandwidth based algorithm is used to control the transmission rate of non-delay sensitive services. Simulation experiments are used to investigate the system performance and show that our resource allocation scheme results in less packet loss probability than the scheme which arbitrarily fixes the bit rate. 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
Haptic Rendering of Point Set Surfaces
Authors: Jae-Kyu Lee, Young J. Kim
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

We present a haptic rendering algorithm for a point set surface. Given a point set, its point set surface is an implicit surface defined by local projection of point sets using the moving least square (MLS) method. Our haptic algorithm is a penalty-based method which requires a calculation of the minimum distance between the haptic interaction point (HIP) and point set surfaces. Thus, a rapid calculation of this distance is the main ingredient of our haptic rendering algorithm. As preprocess, our algorithm builds a bounding volume hierarchy (BVH) of swept sphere volumes (SSV) for each of given point sets. Here, the SSV is defined as volume swept by a moving sphere. Then, at run-time, we find a pair of closest points between the point set and HIP using a SSV hierarchy. We attempt to further refine the distance by projecting the closest pair of point to its local point set surface by using the MLS projection. In order to execute the MLS projection, we need to find points in a local neighborhood of the closest point pair. We again use the SSV hierarchy to find the neighborhood by performing collision detection between a sphere, defining the local neighborhood, and the SSV hierarchy. This results in a highly fast and reliable calculation of closest surface distance between the point set model and HIP. In practice, our algorithm takes 0.2 - 0.3 msec to calculate haptic feedback for a point set consisting of more than 24K points.
A semicircular planar inverted-F antenna with a parasitic element
Authors: T. Okuno, K. Hirasawa
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

A semicircular planar inverted-F antenna with a parasitic element is introduced and its characteristics are investigated numerically and experimentally. By setting the two resonant frequencies close together the VSWR bandwidth of 32% is obtained.
API Changes - How FarWould You Go?
Authors: Ilie Savga, Michael Rudolf, Jacek Sliwerski, Jan Lehmann, Harald Wendel
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Once a software library is deployed, it is extremely difficult to modify published types. Every new version has to preserve backward compatibility with existing applications. This limits the number of changes that may be applied to the public classes defined in the library. We present a tool that assists developers in maintaining the consistency of a shared library with the existing software. It allows for greater flexibility in evolving the library's functionality by supporting a wide range of changes.
Proactive recovery in a Byzantine-fault-tolerant system
Authors: Miguel Castro, Barbara Liskov
Venue: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4 (2000)

This paper describes an asynchronous state-machine replication system that tolerates Byzantine faults, which can be caused by malicious attacks or software errors. Our system is the first to recover Byzantine-faulty replicas proactively and it performs well because it uses symmetric rather than public-key cryptography for authentication. The recovery mechanism allows us to tolerate any number of faults over the lifetime of the system provided fewer than 1/3 of the replicas become faulty within a window of vulnerability that is small under normal conditions. The window may increase under a denial-of-service attack but we can detect and respond to such attacks. The paper presents results of experiments showing that overall performance is good and that even a small window of vulnerability has little impact on service latency.
A multi-objective model for environmental investment decision making
Authors: Andrew J. Higgins, Stefan Hajkowicz, Elisabeth Bui
Venue: Computers and Operations Research (2008)

Investment in landscapes to achieve outcomes that have multiple environmental benefits has become a major priority in many countries. This gives rise to opportunities for mathematical programming methods to provide solutions on where investments could be made on the landscape, to maximise multiple environmental benefits. The problem was formulated as a multi-objective integer programming model, with objective functions representing biodiversity, water run-off and carbon sequestration. We applied a multi-objective Greedy Randomised Adaptive Search Procedure (GRASP) as an evolutionary programming method to find solutions along the Pareto front. This allows the decision maker to explore trade-off's between the objectives. A 142,000ha case study catchment in eastern Australia was used to test the methodology and assess the sensitivity of the different and often competing environmental benefits.