ppxscal/embedding_network huggingface dataset:
Embedding partial totally symmetric quasigroups
Authors: Darryn Bryant, Melinda Buchanan
Venue: Journal of Combinatorial Theory Series A (2007)

This paper concerns the embedding problem for partial totally symmetric quasigroups. For all n>=9, it is shown that any partial totally symmetric quasigroup of order n can be embedded in a totally symmetric quasigroup of order v if v is even and v>=2n+4, and this is the best possible such inequality.
The Sisyphus Continuous Integration System
Authors: Tijs van der Storm
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Integration hell is a prime example of software evolution gone out of control. The Sisyphus continuous integration system is designed to prevent this situation in the context of component-based software configuration management. We show how incremental and backtracking techniques are applied to strike a balance between maximal feedback and being up-to-the-minute, and how these techniques enable automation of release and delivery.
Agent Alliances: A Means for Practical Threshold Signature
Authors: Regine Endsuleit, Christoph Amma
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

In [7] we have proposed a model for the robust and private evaluation of a function within a group of cooperating mobile agents, called an agent Alliance. The model has been given abstractly and is based on a cryptographic protocol for secure multi-party computation. This paper aims on the investigation of the complexity of a threshold signature performed within the Alliance model. The goal is to achieve a practical security model in which agents can be allowed to act fully autonomously in their users name without relying on a trusted authority.
Managing Benefits from IS/IT Investments: An Empirical Investigation into Current Practice
Authors: John Ward, Steven De Hertogh, Stijn Viaene
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In 1996 Ward et al reported the results of their UK study into the state of practice in evaluating and realizing benefits from IS/IT investments. This paper presents new empirical evidence from a survey performed in the Benelux and the UK on the state of practice in managing benefits from IS/IT investments. The paper revisits the background and concepts of the benefits management process model introduced by Ward et al, assesses the current state of practice, and compares it to ten years ago. The results show some positive evolutions in the adoption of formal methodologies and certain structured practices. Nevertheless, the results point towards ample room for improvement for most organizations. The findings also support the claims of the benefits management process model that organizations which are more successful at delivering benefits from their IS/IT investment projects are more likely to have a comprehensive approach to managing benefits from them.
Computer-Generated Marbling Textures: A GPU-Based Design System
Authors: Xiaogang Jin, Shaochun Chen, Xiaoyang Mao
Venue: IEEE Computer Graphics and Applications (2007)

A computer system for interactively creating marbling textures is built on the physical model of the traditional marbling process. The approach generates marbling designs as the result of color advection in the 2D flow fields obtained by numerically solving the Navier-Stokes equations on the GPU with a multigrid solver.
MATLAB based codesign framework for wireless broadband communication DSPs
Authors: V. Aue
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

We provide an overview of a MATLAB/sup TM/ based hardware-software design flow that has been applied to the design of a platform based SoC for the HiperLAN/2 and IEEE 802.11 wideband wireless communication standards. Starting from a high-level algorithmic description, the MATLAB/sup TM/ environment serves as a "golden model" and universal, cycle-true testbench for the embedded hardware and software implementation. A universal interface concept allows the exchange of modules with different abstraction levels in a cosimulation. This way, a high confidence level for the design validation is achieved, and both design and validation time is substantially reduced.
Quantifying Failure for Risk Based Decision Making in Digital Business Ecosystem Interactions
Authors: Omar Khadeer Hussain, Elizabeth Chang, Farookh Khadeer Hussain, Tharam S. Dillon
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Due to technological advancement of the internet, conducting e-commerce transactions have become a part of our daily lives. In a financial interaction to be carried over the digital business ecosystem domain, it is rational for an agent instigating the interaction to analyse beforehand the possible risk in interacting with any other agent. Doing so would give the instigating agent an idea of direction in which its interaction might head and also help it to make an informed decision of its future course of action with that particular agent. For risk analysis, the instigating agent has to determine beforehand the probability of failure and the possible consequences of failure in interacting with an agent. In this paper, we propose such a methodology by which the instigating agent quantifies the probability of failure beforehand in interacting with an agent according to the demand of its future interaction with it.
The National Programme for Information Technology in the UK Health Service: Dependability Challenges and Strategies
Authors: Brian Randell
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

The National Health Service (NHS) provides the majority of health-care in the UK. Its main section, that for England, serves a population of over 50 million, employs 40,000 general practitioners (family physicians), 80,000 other doctors, and 350,000 nurses, and includes over 300 hospitals. Its National Programme for Information Technology (NPfIT) is the largest civil IT project in the world. (Estimates of its total cost have ranged from £6.2 billion up to £20 billion.) This project, which was launched in 2002, aims to implement electronic care records for all patients and to provide a reliable and secure information service, for medical records, radiography, patient administration, etc., for all the hospitals, and all general practitioners' premises, to which all the NHS health professionals in England will have strictly-controlled access. This Special Plenary Session will provide an overview of NPfIT, and its dependability challenges and strategies. Speakers will, it is hoped, include representatives of Connecting for Health (the NHS Agency responsible for NPfIT), the medical profession, and the dependability research community.
A roughness measure for 3D mesh visual masking
Authors: Guillaume Lavoué
Venue: Proceedings of the 4th symposium on Applied perception in graphics and visualization (2007)

3D models are subject to a wide variety of processing operations such as compression, simplification or watermarking, which introduce slight geometric modifications on the shape. The main issue is to maximize the compression/simplification ratio or the watermark strength while minimizing these visual degradations. However few algorithms exploit the human visual system to hide these degradations, while perceptual attributes could be quite relevant for this task. Particularly, the Masking Effect defines the fact that a signal can be masked by the presence of another signal with similar frequency or orientation. In this context we introduce the notion of roughness for a 3D mesh, as a local measure of geometric noise on the surface. Indeed, a textured (or rough) region is able to hide geometric distortions much better than a smooth one. Our measure is based on curvature analysis on local windows of the mesh and is independent of the resolution/connectivity of the object. An application to Visual Masking is presented and discussed.
Vision in HCI: embodiment, multimodality and information capacity
Authors: David Powers
Venue: Proceedings of the HCSNet workshop on Use of vision in human-computer interaction - Volume 56 (2006)

Almost all Human Computer Interfaces involve vision and Pedagogical research encourages the use of multiple modalities including vision. The combination of visual and other modalities, as well as the many submodalities of vision, has both advantages and pitfalls. The work presented here connects psychological research into human cognitive and perceptual processes and limitations, to evaluation and optimization of multimodal HCI.
Comparison and Performance Evaluation of Mobile Agent Platforms
Authors: Raquel Trillo, Sergio Ilarri, Eduardo Mena
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Mobile agents are considered a very interesting technology to develop applications for mobile, pervasive, and distributed computing. Thus, they present a combination of unique features, such as their autonomy and capability to move to remote computers to process data there and save remote communications. Many mobile agent platforms have been developed since the late nineties. While some of them have been abandoned, others continue releasing new versions that fix bugs detected or offer new interesting features. Moreover, other new platforms have appeared in the last few years. So, a common problem when one wants to benefit from mobile agent technology to develop distributed applications is the decision about which platform to use. In this paper, we provide an up-to-date evaluation of existing mobile agent platforms. We compare them qualitatively and evaluate their performance.
The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code
Authors: Ben Hardekopf, Calvin Lin
Venue: ACM SIGPLAN Notices (2007)

Pointer information is a prerequisite for most program analyses, and the quality of this information can greatly affect their precision and performance. Inclusion-based (i.e. Andersen-style) pointer analysis is an important point in the space of pointer analyses, offering a potential sweet-spot in the trade-off between precision and performance. However, current techniques for inclusion-based pointer analysis can have difficulties delivering on this potential. We introduce and evaluate two novel techniques for inclusion-based pointer analysis---one lazy, one eager1---that significantly improve upon the current state-of-the-art without impacting precision. These techniques focus on the problem of online cycle detection, a critical optimization for scaling such analyses. Using a suite of six open-source C programs, which range in size from 169K to 2.17M LOC, we compare our techniques against the three best inclusion-based analyses--described by Heintze and Tardieu [11], by Pearce et al. [21], and by Berndl et al. [4]. The combination of our two techniques results in an algorithm which is on average 3.2 xfaster than Heintze and Tardieu's algorithm, 6.4 xfaster than Pearce et al.'s algorithm, and 20.6 faster than Berndl et al.'s algorithm. We also investigate the use of different data structures to represent points-to sets, examining the impact on both performance and memory consumption. We compare a sparse-bitmap implementation used in the GCC compiler with a BDD-based implementation, and we find that the BDD implementation is on average 2x slower than using sparse bitmaps but uses 5.5x less memory.
Ultrasound video coding using a three-dimensional subband decomposition
Authors: A. Docef
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

This paper addresses the problem of transmission of real-time cardiology ultrasound video over telephone and ISDN lines. The high compression ratios needed for this application are achieved using a nonlinear model-based decomposition of the ultrasound sequence into structure and text are components. These components are encoded using a three-dimensional subband coder and an entropy-constrained residual vector quantizer, respectively. The new algorithm is implementable in real time on currently available hardware and achieves more than two-fold quality improvement over H.263.
A parallel symmetric block-tridiagonal divide-and-conquer algorithm
Authors: Yihua Bai, Robert C. Ward
Venue: ACM Transactions on Mathematical Software (TOMS) (2007)

We present a parallel implementation of the block-tridiagonal divide-and-conquer algorithm that computes eigensolutions of symmetric block-tridiagonal matrices to reduced accuracy. In our implementation, we use mixed data/task parallelism to achieve data distribution and workload balance. Numerical tests show that our implementation is efficient, scalable and computes eigenpairs to prescribed accuracy. We compare the performance of our parallel eigensolver with that of the ScaLAPACK divide-and-conquer eigensolver on block-tridiagonal matrices.
Large vocabulary continuous speech recognition of an inflected language using stems and endings
Authors: Toma Rotovnik, Mirjam Sepesy Maučec, Zdravko Kačič
Venue: Speech Communication (2007)

In this article, we focus on creating a large vocabulary speech recognition system for the Slovenian language. Currently, state-of-the-art recognition systems are able to use vocabularies with sizes of 20,000 to 100,000 words. These systems have mostly been developed for English, which belongs to a group of uninflectional languages. Slovenian, as a Slavic language, belongs to a group of inflectional languages. Its rich morphology presents a major problem in large vocabulary speech recognition. Compared to English, the Slovenian language requires a vocabulary approximately 10 times greater for the same degree of text coverage. Consequently, the difference in vocabulary size causes a high degree of OOV (out-of-vocabulary words). Therefore OOV words have a direct impact on recognizer efficiency. The characteristics of inflectional languages have been considered when developing a new search algorithm with a method for restricting the correct order of sub-word units, and to use separate language models based on sub-words. This search algorithm combines the properties of sub-word-based models (reduced OOV) and word-based models (the length of context). The algorithm also enables better search-space limitation for sub-word models. Using sub-word models, we increase recognizer accuracy and achieve a comparable search space to that of a standard word-based recognizer. Our methods were evaluated in experiments on a SNABI speech database.
A Theoretical Consideration on Artificial Imitation Based on Mental Image Directed Semantic Theory
Authors: Masao Yokota
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In artificial or robotic imitation, it is extremely difficult for an artifact to understand what in human demonstration is significant or not because there are too many things to attend to as it is. The Mental Image Directed Semantic Theory (MIDST) has proposed an omnisensory mental image model and its description language L_md intended to facilitate intuitive human-artifact interaction such that happens between non-expert people and home robots. This paper presents a brief sketch of L_md and a theoretical consideration on artificial imitation of human action driven by human suggestion interpreted in L_md, controlling the artificial attention mechanism efficiently.
Real-valued fast discrete Fourier transform and cyclic convolution algorithms of highly composite even length
Authors: H. Murakami
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper introduces a new recursive factorization of the polynomial, 1-z/sup N/, over the real numbers when N is an even composite integer. The recursive factorization is applied for efficient computation of the discrete Fourier transform (DFT) and the cyclic convolution of real sequences with highly composite even length.
Design and development of a hybrid instruction model for a new teaching paradigm
Authors: O. Marques
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

In recent years, many universities have sought to develop distance learning courses and programs that are delivered through the Web. The promising results achieved by many of these projects lead to a question: how can we integrate the best features of Web-based learning into a conventional classroom-based model of instruction? To answer this question, the Department of Computer Science and Engineering and the Department of Languages and Linguistics at Florida Atlantic University, USA, are jointly working on a pilot project that integrates conventional classroom teaching and Web-based distance learning technologies to form a hybrid instruction model for a teaching paradigm that can be easily applied toward learner-centered education. This paper explains the motivation for this project and describes its main technical aspects. A number of the pedagogical and practical issues related to the proposed model are reviewed and the results obtained in its first trial are discussed. Conclusions drawn from a student exit survey and from classroom experience are presented at the end of the article with recommendations for future implementations of a hybrid instructional model.
Verifying the CICS File Control API with Z/Eves: An Experiment in the Verified Software Repository
Authors: Leo Freitas, Konstantinos Mokos, Jim Woodcock
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

Parts of the CICS transaction processing system were modelled formally in the 1980s in a collaborative project between IBM Hursley Park and Oxford University Computing Laboratory. Z was used to capture a precise description of the behaviour of various modules as a means of communicating requirements and design intentions. These descriptions were not mechanically verified in any way: proof tools for Z were not considered mature, and no business case was made for effort in this area. We report a recent experiment on using the Z/Eves mechanical theorem prover to construct a machine-checked analysis of one of the CICS modules: the File Control API. This work was carried out as part of the international Grand Challenge in Verified Software, and our results are recorded in the Verified Software Repository. We give a brief description of the other modules, and propose them as challenge problems for the verification community.
Vector-wavelet based scalable indexing and retrieval system for large color image archives
Authors: E. Albuz
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper presents an efficient content based indexing and retrieval mechanism based on vector wavelet coefficients of color images. We use highly decorrelated wavelet coefficient planes to acquire a search efficient feature space. The feature space is subsequently indexed using properties of the all the images in the database. Therefore the feature key of an image does not only correspond to the content of the image itself but also how much the image is different from the other images being stored in the database. The search time depends only on the number of images similar to the query image but not on the size of the entire database. The system is scalable and provides fast retrievals. We show that in a database of 1000 images, query search takes less than 50 msec, on a 266 MHz Pentium processor compared to several seconds of retrieval time in the earlier systems proposed in the literature.
Mixed-Mode Adaptation in Distributed Systems: A Case Study
Authors: Karun N. Biyani, Sandeep S. Kulkarni
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

An adaptation in a distributed system involves changes to multiple processes. Since the adaptation cannot happen atomically (instantaneously), the changes to multiple processes need to be synchronized to ensure correctness of adaptation. The service interruption time and communication overhead during adaptation depend on the synchronization required when changing multiple processes. In this paper we consider mixed-mode adaptation that helps in reducing the synchronization requirements during adaptation, thereby improving the service interruption time and communication overhead. However, there are challenges in mixed-mode adaptation due to overlapping of behavior during adaptation. In this paper, we identify various challenges in mixed-mode adaptation and discuss how we address some of them using a case study.
Exponential separations for one-way quantum communication complexity, with applications to cryptography
Authors: Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We give an exponential separation between one-way quantum and classical communication protocols for twopartial Boolean functions, both of which are variants of the Boolean Hidden Matching Problem of Bar-Yossef et al. Earlier such an exponential separation was known only for a relational version of the Hidden Matching Problem. Our proofs use the Fourier coefficients inequality of Kahn, Kalai, and Linial. We give a number of applications of this separation. In particular, in the bounded-storage model of cryptography we exhibita scheme that is secure against adversaries with a certain amount of classical storage, but insecure against adversaries with a similar (or even much smaller) amount of quantum storage; in the setting of privacy amplification, we show that there are strong extractors that yield a classically secure key, but are insecure against a quantum adversary.
Design of a guided-asynchronous graduate course in multimedia signal processing
Authors: V. Stonick
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

This paper describes the design of a new guided-asynchronous graduate course in multimedia signal processing (MMSP). MMSP expertise is increasingly critical for many working engineers from diverse disciplines. Targeted students have some prior DSP-related experience, but need an introduction to MMSP fundamentals before participating in more specialized courses. A modular structure, asynchronous design and application focus are used to meet the educational and logistical needs of working engineers. Industry and university partners use MMSP technologies to provide remote access to pre-configured laboratory experiments and educational resources, and support for distributed collaboration and guided learning. Thus hands-on experience with MMSP technologies is integrated with learning about underlying MMSP concepts. A central element of the course design are on-line, multimedia topical learning modules which provide evaluation of student level of expertise, guidance in choosing course activities to effectively meet learning goals, student practice and projects, and feedback and evaluation of student performance.