ppxscal/embedding_network huggingface dataset:
An adaptive filtering algorithm with parameter acceleration
Authors: M. Gerken
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We introduce a novel fast discrete-time algorithm for adaptive filtering applications. It is based on a tuner used in adaptive control that sets the second derivative of the parameter estimates. For colored input signals the proposed algorithm presents a more favorable compromise between convergence speed and steady-state estimation error than the LMS or NLMS algorithms, a property obtained at the cost of a moderate increase in computational complexity. We provide a deterministic convergence proof and present simulation results.
Resource management strategies for remote virtual laboratory experimentation
Authors: H. H. Saliah
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The paper presents a software system for resource management designed for remote virtual laboratory experimentation. This resource management system is part of a joint effort called SynchroMedia involving researchers from INRS (Institut National de Recherche Scientifique), UQAM (Universite' du Quebec a Montreal) TELUQ (Tele-Universite), ETI (Ecole de Technologie de l'Information) and ETS (Ecole de Technologie Superieure), educational and research institutes, to integrate new multimedia technologies in post-secondary teaching methodology. Besides traditional videoconferencing and data sharing, a special emphasis is given to virtual laboratories where students can perform experimentation remotely using either a local area network (LAN), wide area network (WAN) or standard Internet and intranet communication links. A distributed resource management system is being proposed to simplify the tasks involved in the preparation and execution of remote laboratory experimentation.
ASTLOG: a language for examining abstract syntax trees
Authors: Roger F. Crew
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

We desired a facility for locating/analyzing syntactic artifacts in abstract syntax trees of C/C++ programs, similar to the facility grep or awk provides for locating artifacts at the lexical level. Prolog, with its implicit pattern-matching and backtracking capabilities, is a natural choice for such an application. We have developed a Prolog variant that avoids the overhead of translating the source syntactic structures into the form of a Prolog database; this is crucial to obtaining acceptable performance on large programs. An interpreter for this language has been implemented and used to find various kinds of syntactic bugs and other questionable constructs in real programs like Microsoft SQL server (450Klines) and Microsoft Word (2Mlines) in time comparable to the runtime of the actual compiler. The model in which terms are matched against an implicit current object, rather than simply proven against a database of facts, leads to a distinct "inside-out functional" programming style that is quite unlike typical Prolog, but one that is, in fact, well-suited to the examination of trees. Also, various second-order Prolog set-predicates may be implemented via manipulation of the current object, thus retaining an important feature without entailing that the database be dynamically extensible as the usual implementation does.
Applications of a Neural Network to Estimate Watermark Embedding Strength
Authors: Cong Jin, Shihui Wang
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

Digital watermarking technology has the advantages of easy implementation and capability of providing wide security services such as copyright protection, authentication and secret communication. In this paper, a digital watermarking scheme using neural network is proposed. Firstly, the original image is divided into some 8×8 blocks, and then neural networks according to different textural features and luminance of each block decide adaptively different embedding strengths. The watermark detection adopts correlation technology. Experimental results show that the proposed scheme has good imperceptibility and high robustness to common image processing operators.
Implementation of an enhanced fixed point variable bit-rate MELP vocoder on TMS320C549
Authors: A. E. Ertan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

In this paper, a fixed point variable bit-rate (VBR) mixed excitation linear predictive coding (MELP/sup TM/) vocoder is presented. The VBR-MELP vocoder is also implemented on a TMS320C54x and it achieves virtually indistinguishable federal standard MELP quality at bit-rates between 1.0 to 1.6 kb/s. The backbone of VBR-MELP vocoder is similar to that of federal standard MELP. It utilizes a novel sub-band based voice activity detector in the back-end of encoder to discriminate background noise from speech activity. Since proposed detector uses only parameters extracted in the encoder, its computational complexity is very low.
A mixed-mode interface circuit for gas sensor control and measure
Authors: J. L. Merino, R. Casanova, A. Dieguez, S. A. Bota, J. Samitier
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

A mixed-mode interface circuit for monolithically integrated gas sensor arrays has been developed. Circuitry includes the heater driver for the temperature control, interface electronics for inspection of up to four sensors array and interface logic for smart control. Because of its characteristics as robustness, small, size, low price and future capabilities with the adequate signal processing the system composed by the sensor and the application specific integrated circuit would be able to cover most of today markets considered for gas sensors.
On Coercion-Resistant Electronic Elections with Linear Work
Authors: Stefan G. Weber, Roberto Araujo, Johannes Buchmann
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Remote electronic voting over the Internet is a promising concept to afford convenience to voters and to increase election turnouts. However, before employing electronic voting systems in regular elections, problems such as coercion and vote selling have to be solved. Recently, Juels, Catalano and Jakobsson introduced a strong security requirement that deals with theses concerns. Coercion resistance improves on the former security notion of receipt freeness by taking additional real-life threats into account. In this paper, we present a coercion-resistant election scheme with a linear work factor. The scheme is based on the previous proposal of Juels et al., which exhibited a quadratic work factor, and employs Smith's idea to achieve a speedup to linear work. It, however, overcomes the drawbacks of these preceding solutions. We also present an evaluation of the scheme and identify the drawbacks and the real world aspects related to the scheme.
The Challenges of Deploying Educational Games in Hong Kong Schools: a developer's perspective
Authors: Frankie Tam, John Milton
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

This paper outlines the rationale and discusses issues related to the development and marketing of a digital educational video game. The concept, theme and design of the game are aimed at topical socioenvironmental issues important to local (Hong Kong) students. This experience illustrates some of the primary challenges in the development and deployment of educational video game software.
A new approach for fuzzy information retrieval based on weighted power-mean averaging operators
Authors: Won-Sin Hong, Shi-Jay Chen, Li-Hui Wang, Shyi-Ming Chen
Venue: Computers Mathematics with Applications (2007)

An information retrieval system can help users to retrieve documents relevant to the users' queries. In recent years, some researchers used averaging operators (i.e., Infinite-One operators, Waller-Kraft operators, P-Norm operators and GMA operators) to handle ''AND'' and ''OR'' operations of users' fuzzy queries for fuzzy information retrieval, but they still have some drawbacks, e.g., sometimes query results do not coincide with the intuition of the human being. In this paper, we present new averaging operators, called weighted power-mean averaging (WPMA) operators, based on the weighted power mean for dealing with fuzzy information retrieval to overcome the drawbacks of the existing methods. Furthermore, we also extend the proposed WPMA operators into the extended WPMA operators to handle weighted fuzzy queries for fuzzy information retrieval. The proposed WPMA operators are more flexible and more intelligent than the existing averaging operators to handle users' fuzzy queries for fuzzy information retrieval.
Embedding Information Security into the Organization
Authors: M. Eric Johnson, Eric Goetz
Venue: IEEE Security and Privacy (2007)

Risk and business have always been inseparable, but new information security risks pose unknown challenges. How should firms organize and manage to improve enterprise security? Here, the authors describe how CISOs are working to build secure organizations.
Development of FPGA based adaptive image enhancement filter system using genetic algorithms
Authors: J. Riget
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

In this paper, a genetic algorithm-based adaptive image enhancement filtering scheme is proposed and implemented on an FPGA board. In contrast to conventional filter systems, the proposed system can find an optimal combination of filters, as well as their sequent order and parameter values, adaptively under unknown noise types using structured genetic algorithms. For evaluation, three types of noise were used, and the experimental results showed that the proposed scheme can generate an optimal set of filters adaptively without a-priori noise information. 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
Improving English subcategorization acquisition with diathesis alternations as heuristic information
Authors: Xiwu Han, Tiejun Zhao, Xingshang Fu
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Automatically acquired lexicons with subcategorization information have already proved accurate and useful enough for some purposes but their accuracy still shows room for improvement. By means of diathesis alternation, this paper proposes a new filtering method, which improved the performance of Korhonen's acquisition system remarkably, with the precision increased to 91.18% and recall unchanged, making the acquired lexicon much more practical for further manual proofreading and other NLP uses.
Robust envelope and small-signal simulation algorithms for oscillatory systems
Authors: Jaijeet Roychowdhury
Venue:  (2006)

Oscillators are building blocks in many electrical and physical systems. The simulation of oscillatory systems presents unique challenges; for example, conventional SPICE-like transient simulation can be very inefficient. The fundamental reason is that small numerical errors in phase can accumulate unboundedly during oscillator transient simulation, resulting in unacceptable inaccuracy unless extremely small time steps are taken. As a result, most simulation tasks related to oscillators, and particularly "envelope simulation", suffer from a poor tradeoff between computation and accuracy. In this thesis, we present theoretical formulations and numerical techniques to improve this tradeoff. First, we present an oscillator envelope-following approach that is robust and efficient when both fast and slow behaviors are presented in the system. Traditional envelope-following methods face special challenges when applied to oscillators because of their dynamically changing frequencies. Our technique introduces two extra system unknowns, as well as two extra "phase condition" equations, to track quantities related to dynamical frequency/time-period changes. Furthermore, we show that a modification of our technique, based on least square solution, can extend its applicability to non-autonomous circuits. We also present a novel AC (small signal) analysis method for oscillators. Standard small signal analysis breaks down for oscillators since small perturbations result in arbitrarily large changes at output. In our approach, we use a general equation formulation, termed the GeMPDE, which results in small output changes when oscillators are perturbed by small inputs. Finally, we also present investigations into a variety of other aspects of oscillatory system simulation, such as steady state methods and their extensions to phase-domain macromodels of oscillatory systems.
Rational Bezier patch differentiation using the rational forward difference operator
Authors: X. Chen, R. F. Riesenfeld, E. Cohen
Venue: Proceedings of the Computer Graphics International 2005 (2005)

This paper introduces the rational forward difference operator for differential computation on a rational Bezier patch based on its control mesh. With this rational version of the forward difference operator, and by ignoring the appropriate dependent (on lower order derivatives) terms of various derivatives, the derivatives themselves have the same expressions as their polynomial counterparts; the curvature and torsion, and the first and second fundamental forms, all have very similar expressions as those equations from classical differential geometry. This new approach also allows straightforward generalization to higher dimensional rational Bezier patches, the special co-dimension 1 case of which is treated with the result of the first and second fundamental forms.
FLF4DoS. Dynamic DDoS Mitigation based on TTL field using fuzzy logic.
Authors: J. Cesar Covarrubias Rodriguez, Alejandro Parra Briones, Juan Arturo Nolazco
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

DoS is an attack which overwhelm victims servers and services. Distributed DoS attacks do not let legitimate users to access services provided by servers. Several techniques have been proposed to mitigate such attacks. Prentive techniques have proven their effectiveness. However,most of those techniques require historic data and training. We propose a dynamic algorithm based on the concept of fuzzy logic applied to Hop-count filtering technique to mitigate Distributed DoS. Very promising results of this technique is shown through this paper.
Subband adaptive filters with zero alias component constraints
Authors: S. Zimmermann
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Critically decimated subband adaptive filters (SBAF) require filtering across bands to cancel aliasing effects. The addition of the cross-band filters can slow down the convergence rate and increase the asymptotic mean square error. In this paper, a SBAF which constrains the parameters of the cross-band filters to suppress the aliasing is proposed. The cross-band parameters depend on the in-band filters, so that only the in-band parameters need to be adapted. The procedure to assemble the constrained SBAF is discussed in detail. The resulting expressions provide a quantitative basis for deciding which filters across the bands are important to include in the subband filter. The adaptive algorithm, and its the computational cost are discussed. Experiments show that this new SBAF have improved convergence rate and asymptotic mean square error when compared with standard SBAF approaches.
Investigating Properties of Code Transformations
Authors: Deborah Whitfield, Mary Lou Soffa
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Creating highly optimized code for parallel machines is a difficult task, as the efficiency of the transformed the code depends of the types of tranformations applied.
Weakly compressible SPH for free surface flows
Authors: Markus Becker, Matthias Teschner
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

We present a weakly compressible form of the Smoothed Particle Hydrodynamics method (SPH) for fluid flow based on the Tait equation. In contrast to commonly employed projection approaches that strictly enforce incompressibility, time-consuming solvers for the Poisson equation are avoided by allowing for small, user-defined density fluctuations. We also discuss an improved surface tension model that is particularly appropriate for single-phase free-surface flows. The proposed model is compared to existing models and experiments illustrate the accuracy of the approach for free surface flows. Combining the proposed methods, volume-preserving low-viscosity liquids can be efficiently simulated using SPH. The approach is appropriate for medium-scale and small-scale phenomena. Effects such as splashing and breaking waves are naturally handled.
PAV and the ROC convex hull
Authors: Tom Fawcett, Alexandru Niculescu-Mizil
Venue: Machine Learning (2007)

Classifier calibration is the process of converting classifier scores into reliable probability estimates. Recently, a calibration technique based on isotonic regression has gained attention within machine learning as a flexible and effective way to calibrate classifiers. We show that, surprisingly, isotonic regression based calibration using the Pool Adjacent Violators algorithm is equivalent to the ROC convex hull method.
Images Reconstruction with Use of a Genetic Algorithm
Authors: Anna Piwonska, Urszula Grycuk
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

In this paper we investigate the task of images reconstruction with use of a genetic algorithm (GA). We consider two kinds of images: colored and black-and- white. Each kind of images requires different coding for a GA. In the case of colored images we base on the RGB color model. When black-and-white images are considered, we use binary coding. A genetic algorithm evolves an initial randomly generated population of individuals (images). The aim of a GA is to find a solution as similar to a reconstructed image as possible. We show results of computer experiments and formulate conclusions arising from them.
Access Control Strategies for Virtualized Environments in Grid Computing Systems
Authors: Anna Cinzia Squicciarini, Elisa Bertino, Sebastien Goasguen
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

The development of adequate security solutions and in particular of authentication and authorization techniques for grid computing systems is a challenging task. Challenges arise from the heterogeneity of users, the presence of multiple security administration entities, the heterogeneity of security techniques used at the various grid hosts, the scalability requirements, and the need for high-level policies concerning resource sharing. Recent trends, like accessing grid through science gateways and the use of virtual organizations (VO) for managing user communities, further complicate the problem of security for grid computing systems. Currently, the GSI component developed as part of the Globus Toolkit, the de-facto standard for grid infrastructures is not fully suited to meet those challenges. The main drawback of such an approach is that it relies on a low level identity-based authorization scheme. .A low-level access control policy maps a user's identity (distinguished name) to a local account. Such approach does not scale and does not address many of the outlined requirements. We thus need security solutions that go beyond the simple solutions currently in use. The goal of this paper is to make a first step towards such solutions. The paper discusses and analyzes authentication and authorization solutions that better fit novel grid infrastructures characterized by virtual organizations and science gateways. Some of these solutions derive from ongoing work in current grid infrastructure projects; others are new proposals that we think worthy of discussion. In particular, we analyze the solutions proposed as part of the GridShib and the VO Privilege projects
Broadcast Approach for UMTS Mobility Database Recovery
Authors: Sok-Ian Sou, Yi-Bing Lin
Venue: IEEE Transactions on Mobile Computing (2007)

The Universal Mobile Telecommunications System (UMTS) provides high bandwidth packet data services to mobile users. To support mobility management, an MM context is established for every mobile station in its corresponding Serving GPRS Support Node (SGSN). When the SGSN fails, all MM contexts in the SGSN are corrupted. These MM contexts must be recovered or data delivery to the mobile stations will fail. This paper describes a broadcast approach that allows the MS to detect lost MM context in SGSN and therefore speeds up the process for SGSN recovery. We propose an analytic model to evaluate the performance of the broadcast approach. The analytic model is validated against simulation experiments. Based on our study, the network operator can select the appropriate parameter values in the broadcast approach for various traffic conditions.
A Fast Algorithm for Approximate Quantiles in High Speed Data Streams
Authors: Qi Zhang, Wei Wang
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

We present a fast algorithm for computing approx- imate quantiles in high speed data streams with deter- ministic error bounds. For data streams of size N where N is unknown in advance, our algorithm par- titions the stream into sub-streams of exponentially increasing size as they arrive. For each sub-stream which has a fixed size, we compute and maintain a multi-level summary structure using a novel algorithm. In order to achieve high speed performance, the algo- rithm uses simple block-wise merge and sample oper- ations. Overall, our algorithms for fixed-size streams and arbitrary-size streams have a computational cost of O(N log( \frac{1} { \in } log \in N)) and an average per-element update cost of O(log logN) if \in is fixed.
A Correlated Kalman Filtering Model for Subband Coding over Noisy Channels.
Authors: Fabrice Labeau
Venue: Proceedings of the Second International Conference on Digital Telecommunications (2007)

In this paper, we extend a framework for optimal reconstruction from noisy subband samples based on Kalman filtering to the case where some of the signals at hand are correlated, for an application to the reconstruction of a signal from quantized subband samples that have been subject to transmission noise, modeled here as bit errors. The application space envisioned for this research is the reconstruction of multimedia signals after compression and transmission on a noisy channel: decomposition of a signal in subbands, followed by quantization, is a common tool for compression, and it is thus of high interest to be able to reconstruct the original signal from its noisy, quantized subband samples. Our results show a significant improvement in PSNR on the signal samples thanks to our method, as compared to traditional reconstruction through synthesis filters.