ppxscal/embedding_network huggingface dataset:
A new multifilter design property for multiwavelet image compression
Authors: Lixin Shen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Approximation order, linear phase symmetry, time-frequency localization, regularity, and stopband attenuation are some criteria that are widely used in wavelet filter design. We propose a new criterion called good multifilter properties (GMPs) for the design and construction of multiwavelet filters targeting image compression applications. We first provide the definition of GMPs, followed by a necessary and sufficient condition for an orthonormal multiwavelet system to have a GMP order of at least 1. We then present an algorithm to construct orthogonal multiwavelets possessing GMPs, starting from any length-2N scalar CQPs. Image compression experiments are performed to evaluate the importance of GMPs for image compression, as compared to other common filter design criteria. Our results confirmed that multiwavelets that possess GMPs not only yield superior PSNR performances, but also require much lower computations in their transforms. 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
Optimal estimation of non-stationary phase and amplitude processes
Authors: C. Andrieu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In this paper, we address the problem of on-line optimal estimation of signals modelled as the sum of sinusoids with time-varying amplitudes and phases. This is a complex optimal filtering problem. We present some efficient and original simulation-based methods to solve it. The posterior Cramer-Rao lower bound for this state estimation problem is also derived.
Control situations in high-speed craft operation
Authors: Cato Alexander Bj&#x00f8;rkli, Kjell Ivar &#x00d8;verg&#x00e5;rd, Bjarte Knappen R&#x00f8;ed, Thomas Hoff
Venue: Cognition, Technology and Work (2007)

The control situation framework presented by Petersen (Cogn Technol Work 6(4):266&#x2013;274, 2004) is elaborated upon in the context of military high-speed craft navigation. An observational study was done on a military navigational exercise in Indre Folda, a stretch of particularly demanding confined waters in Norway. The concept of control strategies is presented as a term related to how navigators choose to take out the control possibilities present in the system. Control actions are viewed as actions that fix the control demands and control possibilities over longer time-scales. Control strategies are different from control actions in that they continuously alter the control demands and control possibilities through its execution.
IEEE Software Engineering Standards: A Student's Version
Authors: Richard Hall Thayer, Andrew D. McGettrick
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

This paper describes the uses of software engineering standards in a university curriculum. The paper points out the importance of software engineering standards, the issues relating to their use in software engineering and computer science courses, and which of these courses would benefit from using these standards. This information is documented in a new textbook, the IEEE Software Engineering Standards: A Students' Version published by the IEEE Computer Society Press in 2007. This textbook lists the standards necessary to support the software engineering laboratory and other software courses. The book also provides a detailed description of each of these listed standards that have been tailored to match the requirements of a university course in software development. These tailored standards are based on the "look and feel" of as well as the structure of the IEEE's commercial software engineering standards. In addition, the book is "salted" with stories from both software development work places and the university classroom, both of which provide illustrations relating to some of the problems in developing software, and in some cases solutions to these problems.
Positive hybrid sampling in wavelet subspaces
Authors: G. G. Walter
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

It is well known that the Shannon sampling theorem can be put into a wavelet context. But it has also been shown that for most wavelets, a non-negative summability function for the associated subspaces exists. Translation of these are used in a series with sampling coefficients to get a "hybrid" series each of whose terms is non-negative. Such series converge, avoid integration, and eliminate the Gibbs phenomenon.
Domain-based administration of identity-based cryptosystems for secure email and IPSEC
Authors: D. K. Smetters, Glenn Durfee
Venue: Proceedings of the 12th conference on USENIX Security Symposium - Volume 12 (2003)

Effective widespread deployment of cryptographic technologies such as secure email and IPsec has been hampered by the difficulties involved in establishing a large scale public key infrastructure, or PKI. Identity-based cryptography (IBC) can be used to ameliorate some of this problem. However, current approaches to using IBC for email or IPsec require a global, trusted key distribution center. In this paper, we present DNSIBC, a system that captures many of the advantages of using IBC, without requiring a global trust infrastructure. The resulting system can be configured to require almost no user intervention to secure both email and IP-based network traffic. We have built a preliminary implementation of this system in Linux.
Synthesizing "Verification Aware" Models: Why and How?
Authors: Malay K. Ganai, Akira Mukaiyama, Aarti Gupta, Kazutoshi Wakabayshi
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Design-For-Verification (DFV) methodology i.e., exporting designer's intent to verification tools has been quite effective in improving verification efforts. We take one step further in improving the verification efforts, by separating the design optimized for performance, area and power from the design optimized for correctness, thereby reducing the verification burden. We propose a new paradigm Synthesis-For-Verification (SFV) which involves synthesizing "verification-aware" designs that are more suitable for functional verification. SFV methodology should be applied along with DFV methodology to obtain the full benefit of verification efforts. Note, this SFV paradigm requires support only from automated synthesis approaches, e.g. High Level Synthesis (HLS), and can be easily automated. This is in contrast to DFV methodology, which requires designers' reliable insights. As part of SFV methodology, we first identify the effect of various design entities on the performance of model checkers. By guiding the use of such entities in existing behavioral synthesis techniques, we propose to obtain "verification friendly" models that are relatively easier to model check. We demonstrate effectiveness of such a paradigm using existing industry tools and designs.
Quality of service aware distributed object systems
Authors: Svend Frølund, Jari Koistinen
Venue: Proceedings of the 5th conference on USENIX Conference on Object-Oriented Technologies & Systems - Volume 5 (1999)

Computing systems deliver their functionality at a certain level of performance, reliability, and security. We refer to such non-functional aspects as quality-of-service (QoS) aspects. Delivering a satisfactory level of QoS is very challenging for systems that operate in open, resource varying environments such as the Internet or corporate intranets. A system that operates in an open environment may rely on services that are deployed under the control of a different organization, and it cannot per se make assumptions about the QoS delivered by such services. Furthermore, since resources vary, a system cannot be built to operate with a fixed level of available resources. To deliver satisfactory QoS in the context of external services and varying resources, a system must be QoS aware so that it can communicate its QoS expectations to those external services, monitor actual QoS based on currently available resources, and adapt to changes in available resources. A QoS-aware system knows which level of QoS it needs from other services and which level of QoS it can provide. To build QoS-aware systems, we need a way to express QoS requirements and properties, and we need a way to communicate such expressions. In a realistic system, such expressions can become rather complex. For example, they typically contain constraints over user-defined domains where constraint satisfaction is determined relative to a user-defined ordering on the domain elements. To cope with this complexity we are developing a specification language and accompanying runtime representation for QoS expressions. This paper introduces our language but focuses on the runtime representation of QoS expressions. We show how to dynamically create new expressions at runtime and how to use comparison of expressions as a foundation for building higher-level QoS components such as QoS-based traders.
WCET-Directed Dynamic Scratchpad Memory Allocation of Data
Authors: Jean-Francois Deverge, Isabelle Puaut
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

Many embedded systems feature processors coupled with a small and fast scratchpad memory. To the difference with caches, allocation of data to scratchpad memory must be handled by software. The major gain is to enhance the predictability of memory accesses latencies. A compile-time dynamic allocation approach enables eviction and placement of data to the scratchpad memory at runtime. Previous dynamic scratchpad memory allocation approaches aimed to reduce average-case program execution time or the energy consumption due to memory accesses. For real-time systems, worst-case execution time is the main metric to optimize. In this paper, we propose a WCET-directed algorithm to dynamically allocate static data and stack data of a program to scratchpad memory. The granularity of placement of memory transfers (e.g. on function, basic block boundaries) is discussed from the perspective of its computation complexity and the quality of allocation.
Establishing latch correspondence for embedded circuits of PowerPC microprocessors
Authors: H. Anand, J. Bhadra, A. Sen, M. S. Abadir
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2005. on Tenth IEEE International (2005)

A mutation-based validation paradigm that can handle complete high-level microprocessor implementations is presented. First, a control-based coverage measure is presented that is aimed at exposing design errors that incorrectly set control signal values. A method of automatically generating a complete set of modeled errors from this coverage metric is presented such that the instantiated modeled errors harness the rules of cause-and-effect that define mutation-based error models. Finally, we introduce an automatic test pattern generation technique for high-level hardware descriptions that solves multiple concurrent constraints and is empowered by concurrent programming.
Are Buchberger's criteria necessary for the chain condition?
Authors: Hoon Hong, John Perry
Venue: Journal of Symbolic Computation (2007)

Buchberger's Grobner basis theory plays a fundamental role in symbolic computation. The resulting algorithms essentially carry out several S-polynomial reductions. In his Ph.D. thesis and later publication Buchberger showed that sometimes one can skip S-polynomial reductions if the leading terms of polynomials satisfy certain criteria. A question naturally arises: Are Buchberger's criteria also necessary for skipping S-polynomial reductions? In this paper, after making the question more precise (in terms of a chain condition), we show the answer to be ''almost, but not quite'': necessary when there are four or more polynomials, but not necessary when there are exactly three polynomials. For that case, we found an extension to Buchberger's criteria that is necessary as well as sufficient.
Exploiting Proximity in Cooperative Download of Large Files in Peer-to-Peer Networks
Authors: Lei Zhang, Jogesh K. Muppala, Wanqing Tu
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Peer-to-peer networks have long being used for file-sharing among the connected peers. Recently, the popular BitTorrent tool has permitted the exchange of large sized files by dividing it into fragments, and enabling the peers to exchange the fragments amongst themselves through an overlay network. Each file requires the establishment of a separate overlay among the peers. In this paper, we explore the use of proximity both in the construction of the overlay network, and the efficient exchange of the file fragments, mainly aimed at reducing the download time for the peers and reducing resource usage (esp. link bandwidth) in the underlying network. We give some analytical and simulation results to show the improvement that can be achieved using proximity.
Design process supporting simulations on wafer level packages
Authors: J.-P. Sommer, O. Wittler, D. Manessis, B. Michel
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

The design process of innovative and advanced microelectronic systems requires the mechanical behaviour to be taken into account in order to achieve a high level of reliability from the very beginning of the electronic design. In this respect, all essential thermal and mechanical influences during manufacturing as well as operation need to be considered. The influence of design and process parameters on thermomechanical stresses is analysed numerically and pre-optimised for two different types of packages for wireless communication applications in the high frequency range. As a result, design and process improvements can be recommended for assembly levels 1 (wafer level) and 2 (interactions with the carrier and other components).
Linux device driver emulation in mach
Authors: Shantanu Goel, Dan Duchamp
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

We describe the design and performance of code added to the Mach microkernel (Mach 4.0, version UK02p21) that permits one to build a Mach kernel that includes unmodified Linux device drivers. We have written emulation code to support all Linux 1.3.35 network and SCSI drivers for the ISA and PCI I/O buses. Emulation increases latency, but very little. The degree depends on both device and operation, and varies from 2 microseconds for receiving small (60 byte) network packets up to 197 microseconds for writing 16KB to an ISA SCSI device.
Learning classifier systems: a survey
Authors: Olivier Sigaud, Stewart W. Wilson
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

Learning classifier systems (LCSs) are rule- based systems that automatically build their ruleset. At the origin of Holland&#x2019;s work, LCSs were seen as a model of the emergence of cognitive abilities thanks to adaptive mechanisms, particularly evolutionary processes. After a renewal of the field more focused on learning, LCSs are now considered as sequential decision problem-solving systems endowed with a generalization property. Indeed, from a Reinforcement Learning point of view, LCSs can be seen as learning systems building a compact representation of their problem thanks to generalization. More recently, LCSs have proved efficient at solving automatic classification tasks. The aim of the present contribution is to describe the state-of- the-art of LCSs, emphasizing recent developments, and focusing more on the sequential decision domain than on automatic classification.
Letters: Training T-S norm neural networks to refine weights for fuzzy if-then rules
Authors: Xi-Zhao Wang, Chun-Ru Dong, Tie-Gang Fan
Venue: Neurocomputing (2007)

This correspondence proposes an approach to learning weights of weighted fuzzy if-then rules. According to a given T-S norm-based reasoning mechanism, this approach first maps a set of weighted fuzzy if-then rules into a feed-forward T-S norm network in which connection weights are just the weights of weighted fuzzy if-then rules, and then trains the T-S norm neural network by a derived gradient descent algorithm. Numerical experiments show that the proposed approach is feasible and quite effective. The main contribution of this correspondence is that the mapping relationship between a set of weighted fuzzy if-then rules and a T-S norm neural network is discovered so that the difficult problem of weight acquisition in weighted fuzzy if-then rules can be converted into the training of a T-S norm neural network. A comparison between our T-S norm neural network system and a similar model (NEFCLASS) is made.
Evolutionary approaches for statistical modelling
Authors: T. Minerva, S. Paterlini
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

In this paper, we describe some evolutionary approaches based on genetic algorithms to deal with the statistical model selection problem using completely data-driven algorithms. First, we propose an approach to select multivariate linear regression models as well as to build ARMA time-series models. Then we introduce a methodology to tackle the clustering problem in a model-based framework. We report the results from several applications and from simulated data sets, and we compare the evolutionary approaches with some classical ones.
WAEX: Web Accessibility Evaluator in a Single XSLT File
Authors: Vicente Luque Centeno, Carlos Delgado Kloos, Martin Gaedke, Martin Nussbaumer
Venue: Proceedings of the 2nd Int'l. Workshop on Automated Specification and Verification of Web Systems (2006)

Web accessibility rules, i.e., the conditions to be met by Web sites in order to be considered as accessible for all, can be (partially) checked automatically in many different ways. Monolitic applications built on top of procedural programming languages like C, Java, Perl or PHP have been developed during the last years. These applications usually provide their own interpretation of the W3C guidelines, so it is easy to obtain different evaluation results when different evaluation tools are applied to a common sample page. Since most accessibility rules are involved with the markup of Web sites and XSLT can be applied to any selectable-by-condition markup, we have developed WAEX as a Web Accessibility Evaluator in a single XSLT file. Such XSLT file contains 50+ singular accessibility rules and XHTML-specific conditions that are in the prose of the XHTML specification because they could not be included in the grammar specification (the DTD or the XML Schemas). This approach of using XSLT as a declarative repository of accessibility rules has lead to a portable and reusable style sheet that generates rather complete (if compared with already existing evaluation tools) accessibility reports for any Web page.
Perturbation Analysis: A Static Analysis Approach for the Non-Intrusive Monitoring of Distributed Programs
Authors: Madalene Spezialetti, Rajiv Gupta
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Programs written in distributed programming languages are often non-deterministic in nature and hence the execution of such programs is not only dependent upon the program input, but also on the timing of the execution. Thus, an attempt to monitor the run-time behavior of a non-deterministic distributed program through code instrumentation, such as during debugging, can potentially alter the program's behavior. In this paper we introduce notions of non-intrusion that are useful for the monitoring of non-deterministic programs. We develop static perturbation analysis techniques to analyze the affect of run-time monitoring activities on the outcome of a non-deterministic event and identify points in a program at which monitoring activities can be performed non-intrusively.
Compare-by-hash: a reasoned analysis
Authors: J. Black
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

Compare-by-hash is the now-common practice used by systems designers who assume that when the digest of a cryptographic hash function is equal on two distinct files, then those files are identical. This approach has been used in both real projects and in research efforts (for example rysnc [16] and LBFS [12]). A recent paper by Henson criticized this practice [8]. The present paper revisits the topic from an advocate's standpoint: we claim that compare-by-hash is completely reasonable, and we offer various arguments in support of this viewpoint in addition to addressing concerns raised by Henson.
Development of a computer-based training in electric circuits
Authors: N. Al-Holou
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Summary form only given. The advances in computer technologies have led educators in both schools and industry to look at different ways to educate students and employees. The new method is known as CBT (computer-based training), or CBI (computer-based instruction). We demonstrate the development of a computer-based training material on electric circuits using Authorware Professional for Windows (Macromedia, San Francisco, CA). Authorware is an object-oriented authoring tool that supports the incorporation of text, graphics, animation audio, and video. This project is funded by NSF through Greenfield Coalition.
The Klee&ndash;Minty random edge chain moves with linear speed
Authors: József Balogh, Robin Pemantle
Venue: Random Structures Algorithms (2007)

An infinite sequence of 0's and 1's evolves by flipping each 1 to a 0 exponentially at rate 1. When a 1 flips, all bits to its right also flip. Starting from any configuration with finitely many 1's to the left of the origin, we show that the leftmost 1 moves right with bounded speed. Upper and lower bounds are given on the speed. A consequence is that a lower bound for the run time of the random-edge simplex algorithm on a Klee&ndash;Minty cube is improved so as to be quadratic, in agreement with the upper bound. &copy; 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007
Robustness and Security Hardening of COTS Software Libraries
Authors: Martin Susskraut, Christof Fetzer
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

COTS components, like software libraries, can be used to reduce the development effort. Unfortunately, many COTS components have been developed without a focus on robust- ness and security. We propose a novel approach to harden software libraries to improve their robustness and security. Our approach is automated, general and extensible and consists of the following stages. First, we use a static anal- ysis to prepare and guide the following fault injection. In the dynamic analysis stage, fault injection experiments exe- cute the library functions with both usual and extreme input values. The experiments are used to derive and verify one protection hypothesis per function (for instance, function foo fails if argument 1 is a NULL pointer). In the hard- ening stage, a protection wrapper is generated from these hypothesis to reject unrobust input values of library func- tions. We evaluate our approach by hardening a library used by Apache (a web server).