ppxscal/embedding_network huggingface dataset:
A Framework for Assessing eParticipation Projects and Tools
Authors: Efthimios TAMBOURIS, Naoum LIOTAS, Konstantinos TARABANIS
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

An increasing number of governments worldwide understand the importance of electronic participation (eParticipation) i.e. the importance of the use of Information and Communication Technologies (ICTs) to more actively engage citizens in democratic processes. As a result, the number of eParticipation projects and relevant tools is rapidly growing. This makes the need for recording and reviewing such projects and tools both timely and critical. In this paper we present a framework for assessing eParticipation projects and tools. The proposed framework is based on distinguishing between participation areas and ICT support for these areas and suggests assessment to be performed using specific templates that are developed for this purpose. We further apply this framework in order to assess 19 relevant European Commission co-funded research projects. The preliminary results suggest that research in the domain of eParticipation is at its early stages. More specifically, the results suggest that projects focus on the more elementary eParticipation areas, such as information provision and opinion polling, while there is a trend for using multiple access channels, e.g. mobile technologies.
Modeling Time-Varying Population for Biometric Authentication
Authors: Vandana Roy, C. V. Jawahar
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Population size plays a major role in determining the performance of any biometric authentication system, particularly when such systems are used for civilian applications. In this paper, we propose to improve the performance of a biometric authentication system by modeling the variation in the population participating in the process. We show that this technique is helpful when the number of users enrolled into the system is very large as compared to the number of users which actually participate in the process. We show results on aperiodically and periodically varying population using Markov models.
Penalty approximation method for a class of elliptic variational inequality problems
Authors: Y. S. Huang, Y. Y. Zhou
Venue: Computers Mathematics with Applications (2007)

In this paper, two existence results of solutions for a class of elliptic variational inequalities are obtained by considering the approximations of the solutions to a class of penalized differential equations.
Incident Detection and Analysis in Communication and Information Systems by Fuzzy Logic
Authors: Tomasz Walkowiak, Tomasz Wilk
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

The paper presents the model of automatic detection system which uses fuzzy logic methodology for intrusion detection and analysis in sophisticated distributed system. The proposed system functions are to detect the occurrence of intrusions, their severity and impact on the system work. The authors indicate that the current system reveals to be experimental in nature. We propose the hierarchical agent architecture to increase the detection response speed and scalability of the system.
Efficient Moment Computation over Polygonal Domains with an Application to Rapid Wedgelet Approximation
Authors: F. Friedrich, L. Demaret, H. Fu&uml;hr, K. Wicker
Venue: SIAM Journal on Scientific Computing (2007)

Many algorithms in image processing rely on the computation of sums of pixel values over a large variety of subsets of the image domain. This includes the computation of image moments for pattern recognition purposes, or adaptive smoothing and regression methods, such as wedgelets. In the first part of the paper, we present a general method which allows the fast computation of sums over a large class of polygonal domains. The approach relies on the idea of considering polygonal domains with a fixed angular resolution, combined with an efficient implementation of a discrete version of Green&rsquo;s theorem. The second part deals with the application of the new methodology to a particular computational problem, namely wedgelet approximation. Our technique results in a speedup of $O(10^3)$ by comparison to preexisting implementations. A further attractive feature of our implementation is the instantaneous access to the full scale of wedgelet minimizers. We introduce a new scheme that replaces the locally constant regression underlying wedgelets by basically arbitrary local regression models. Due to the speedup obtained by the techniques explained in the first part, this scheme is computationally efficient and at the same time much more flexible than previously suggested methods such as wedgelets or platelets. In the final section we present numerical experiments showing the increase in speed and flexibility.
Synthesis Of Optimal-Cost Dynamic Observers for Fault Diagnosis of Discrete-Event Systems
Authors: Franck Cassez, Stavros Tripakis, Karine Altisen
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

Fault diagnosis consists in synthesizing a diagnoser that observes a given plant through a set of observable events, and identifies faults which are not observable as soon as possible after their occurrence. Existing literature on this problem has considered the case of static observers, where the set of observable events does not change during execution of the system. In this paper, we consider dynamic observers, where the observer can switch sensors on or off, thus dynamically changing the set of events it wishes to observe. We define a notion of cost for such dynamic observers and show that (i) the cost of a given dynamic observer can be computed and (ii) an optimal dynamic observer can be synthesized.
Specification and verification challenges for sequential object-oriented programs
Authors: Gary T. Leavens, K. Rustan M. Leino, Peter M&#x00fc;ller
Venue: Formal Aspects of Computing (2007)

The state of knowledge in how to specify sequential programs in object-oriented languages such as Java and C# and the state of the art in automated verification tools for such programs have made measurable progress in the last several years. This paper describes several remaining challenges and approaches to their solution.
Industrial Measurement Application Development Using Case-Based Reasoning
Authors: Miroslav Sveda
Venue: Proceedings of the Second International Conference on Systems (2007)

The paper deals with design and stepwise development of a dedicated LAN-based industrial measurement application. The conception of this development stems from a knowledge preserving, graceful conversion of the original enterprise practice into a co-operative work supporting arrangement. The principal paradigm employed for this conversion is case-based reasoning (CBR) augmented by rule-based support. The paper presents a technique based on CBR for reusing the amassed domain knowledge with an industrial measurement system whose architecture and service level were radically changed. While CBR represents the techniques' principal paradigm, the overall strategy is augmented by rule-based reasoning and supporting mechanisms. Using this strategy, the knowledge-based subsystem can learn and follow the previously developed measurement processes. The original, manually controlled measurement process is carefully monitored by the subsystem in initial stages when the subsystem is actually taught by a practicing engineer. After that, the learned subsystem can continue almost autonomously, controlling not only the same but also the majority of similar measurements. The computer integrated measurement project for the test department of an electric motor manufacturer offers an environment for the case study exemplifying this strategy.
Theoretical noise reduction limits of the generalized sidelobe canceller (GSC) for speech enhancement
Authors: J. Bitzer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We present an analysis of the generalized sidelobe canceller (GSC). It can be shown that the theoretical limits of the noise reduction performance depend only on the auto- and cross-spectral densities of the input signals. Furthermore, we compute the limits of the noise reduction performance for the theoretically determined diffuse noise field, which is an approximation for reverberant rooms. Our results show that the GSC cannot reduce noise further than 1 dB. These results were verified by simulation of reverberant environments. Only in sound-proof rooms with a reverberation time less than 100 ms the GSC performs well.
Interpolation and the chirp transform: DSP meets optics
Authors: D. C. Munson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

This paper considers the problem of interpolating a signal from one uniformly-spaced grid to another, where the grid spacings may be related by an arbitrary, irrational factor. Noting that interpolation is the digital equivalent of magnification, we begin by reviewing optical systems for magnification and "computation" of the chirp Fourier transform. This route suggests several analog schemes for magnification, which can be discretized to produce algorithms for interpolation. We then derive one of these algorithms from first principles, using a digital signal processing perspective. The result is an important, but forgotten, algorithm for interpolation first suggested as an application of the chirp-z transform by Rabiner, Schafer, and Rader (1969). Unlike the earlier derivation, our approach is direct-we do not make use of Bluestein's trick of completing the square. In addition, our approach identifies parameters under user control that can be optimized for best performance.
How to Ensure a Faithful Polynomial Evaluation with the Compensated Horner Algorithm
Authors: Philippe Langlois, Nicolas Louvet
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

The compensated Horner algorithm improves the accuracy of polynomial evaluation in IEEE-754 floating point arithmetic: the computed result is as accurate as if it was computed with the classic Horner algorithm in twice the working precision. Since the condition number still governs the accuracy of this computation, it may return an arbitrary number of inexact digits. We address here how to compute a faithfully rounded result, that is one of the two floating point neighbors of the exact evaluation. We propose an a priori sufficient condition on the condition number to ensure that the compensated evaluation is faithfully rounded. We also propose a validated and dynamic method to test at the running time if the compensated result is actually faithfully rounded. Numerical experiments illustrate the behavior of these two conditions and that the associated running time over-cost is really interesting.
Modelling Mobility in High-level Petri Nets
Authors: Raymond Devillers, Hanna Klaudel, Maciej Koutny
Venue: Proceedings of the Seventh International Conference on Application of Concurrency to System Design (2007)

We propose a structural translation of terms from a variant of the KLAIM process algebra which includes arbitrary tuples of data values as well as conditionals into behaviourally equivalent high-level Petri nets. This defines a semantics for mobility allowing one to deal directly with concurrency and causality.
A framework for dynamic terrain with application in off-road ground vehicle simulations
Authors: Ying Zhu, G. Scott Owen
Venue:  (2006)

The dissertation develops a framework for the visualization of dynamic terrains for use in interactive real-time 3D systems. Terrain visualization techniques may be classified as either static or dynamic. Static terrain solutions simulate rigid surface types exclusively; whereas dynamic solutions can also represent non-rigid surfaces. Systems that employ a static terrain approach lack realism due to their rigid nature. Disregarding the accurate representation of terrain surface interaction is rationalized because of the inherent difficulties associated with providing runtime dynamism. Nonetheless, dynamic terrain systems are a more correct solution because they allow the terrain database to be modified at run-time for the purpose of deforming the surface. Many established techniques in terrain visualization rely on invalid assumptions and weak computational models that hinder the use of dynamic terrain. Moreover, many existing techniques do not exploit the capabilities offered by current computer hardware. In this research, we present a component framework for terrain visualization that is useful in research, entertainment, and simulation systems. In addition, we present a novel method for deforming the terrain that can be used in real-time, interactive systems. The development of a component framework unifies disparate works under a single architecture. The high-level nature of the framework makes it flexible and adaptable for developing a variety of systems, independent of the static or dynamic nature of the solution. Currently, there are only a handful of documented deformation techniques and, in particular, none make explicit use of graphics hardware. The approach developed by this research offloads extra work to the graphics processing unit; in an effort to alleviate the overhead associated with deforming the terrain. Off-road ground vehicle simulation is used as an application domain to demonstrate the practical nature of the framework and the deformation technique. In order to realistically simulate terrain surface interactivity with the vehicle, the solution balances visual fidelity and speed. Accurately depicting terrain surface interactivity in off-road ground vehicle simulations improves visual realism; thereby, increasing the significance and worth of the application. Systems in academia, government, and commercial institutes can make use of the research findings to achieve the real-time display of interactive terrain surfaces.
Educating the Next Generation of Mobile Game Developers
Authors: Michael Zyda, Dhruv Thukral, Sumeet Jakatdar, Jonathan Engelsma, James Ferrans, Mat Hans, Larry Shi, Fred Kitson, Venu Vasudevan
Venue: IEEE Computer Graphics and Applications (2007)

Almost every major publisher and developer in the game industry is dedicating a major part of their effort on mobile games. Realizing that there is a huge foreseeable demand for mobile game developers, Motorola has formed a partnership with GamePipe Labs at the University of Southern California. The purpose of this partnership is to provide a platform to train the next generation of mobile game developers using design principles unique to mobile games. The authors describe the process, challenges, and results of this effort from both the technical and design aspects.
On Semismooth Newton's Methods for Total Variation Minimization
Authors: Michael K. Ng, Liqun Qi, Yu-Fei Yang, Yu-Mei Huang
Venue: Journal of Mathematical Imaging and Vision (2007)

In [2], Chambolle proposed an algorithm for minimizing the total variation of an image. In this short note, based on the theory on semismooth operators, we study semismooth Newton's methods for total variation minimization. The convergence and numerical results are also presented to show the effectiveness of the proposed algorithms.
Dynamic Fault Tree Analysis Using Input/Output Interactive Markov Chains
Authors: Hichem Boudali, Pepijn Crouzen, Marielle Stoelinga
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Dynamic Fault Trees (DFT) extend standard fault trees by allowing the modeling of complex system components' behaviors and interactions. Being a high level model and easy to use, DFT are experiencing a growing success among reliability engineers. Unfortunately, a number of issues still remains when using DFT. Briefly, these issues are (1) a lack of formality (syntax and semantics), (2) limitations in modular analysis and thus vulnerability to the state-space explosion problem, and (3) lack in modular model-building. We use the input/output interactiveMarkov chain (I/O-IMC) formalism to analyse DFT. I/O-IMC have a precise semantics and are an extension of continuous-timeMarkov chains with input and output actions. In this paper, using the I/OIMC framework, we address and resolve issues (2) and (3) mentioned above. We also show, through some examples, how one can readily extend the DFT modeling capabilities using the I/O-IMC framework.
Note: The simple exceptional group G2(q), q even, and two-character sets
Authors: Antonio Cossidente, Hendrik Van Maldeghem
Venue: Journal of Combinatorial Theory Series A (2007)

When q is even the simple exceptional group G"2(q) is a subgroup of PSp"6(q). We study the action of the group G"2(q)
Switched prediction and quantization of LSP frequencies
Authors: H. Zarrinkoub
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We present new results on switched prediction and quantization of the line spectral frequencies applicable to high-quality coding of speech at rates below 8 kb/s. The predictor-quantizer exploits both the temporal inter-frame correlations among the line-spectral frequency vectors of successive frames as well as the spatial within-frame correlations. Best results are obtained by separately training two split vector quantizers, one on predictable frames and one on non-predictable frames. Line-frequency differences are found to yield the lowest quantization error for both the high and low order quantizers for the non-predictable condition, as well as the low order quantizer of the predictable condition. With 10 ms frame separation, 18 bit split VQs, one for each mode, with 1-bit mode indication yield a mean spectral distortion near 1 dB. With 20 ms frame separation, 20 bit quantizers are required.
Collaborative system construction with networked appliances and networked sensors
Authors: T. Yamazaki, M. Yamauchi, Y. Tajika
Venue: Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors (2005)

A collaborative system with networked appliances and networked sensors has been developed at a real-life testbed. The networked appliances are connected by the middleware that establishes a service using distributed function elements on the networked appliances. The networked sensors are connected by IEEE 802.15.4 and work collaboratively with the networked appliances. We show a prototype implementation of the collaborative system.
Towards network awareness
Authors: Evan Hughes, Anil Somayaji
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

Network and system administrators need to analyse network traffic for maintenance, security, and planning purposes. The volume of data on modern networks, however, make such analysis extremely difficult using existing open source tools. In this paper we argue that administrators need tools that will allow them to be more aware of the state of their networks, and we describe our vision for tools that would support such "network awareness" by analysing and visualising packet aggregations that are defined by both packet headers and payloads. As a first step towards such tools, we have developed a library called qcap, a framework for packet and stream reconstruction that allows applications to tap packets at all layers of the network stack: from network, to transport, to the application layer. qcap is fast, able to process network data at speeds of 120 megabytes per second on commodity hardware; it is easy to use, providing a simple API that requires only a few lines of code to perform complex parsing tasks; and it is extensible, using BNF-like grammars to describe TCP protocols. We believe that qcap can provide the foundation for tools that will support greater network awareness for system administrators.
Inductive Time-Space Lower Bounds for Sat and Related Problems
Authors: Ryan Williams
Venue: Computational Complexity (2006)

We improve upon indirect diagonalization arguments for lower bounds on explicit problems within the polynomial hierarchy. Our contributions are summarized as follows.1. We present a technique that uniformly improves upon most known nonlinear time lower bounds for nondeterminism and alternating computation, on both subpolynomial (n o(1)) space RAMs and sequential one-tape machines with random access to the input. We obtain improved lower bounds for Boolean satisfiability (SAT), as well as all NP-complete problems that have efficient reductions from SAT, and k-SAT, for constant k 2. For example, SAT cannot be solved by random access machines using time and subpolynomial space.2. We show how indirect diagonalization leads to time-space lower bounds for computation with bounded nondeterminism. For both the random access and multitape Turing machine models, we prove that for all k 1, there is a constant c k > 1 such that linear time with n 1/k nondeterministic bits is not contained in deterministic $$n^{{c}_{k}}$$ time with subpolynomial space. This is used to prove that satisfiability of Boolean circuits with n inputs and n k size cannot be solved by deterministic multitape Turing machines running in $${n^{{k \cdot {c}}_{k}}}$$ time and subpolynomial space.
Modified Stability Checking for On-line Error Detection
Authors: Satish Yada, Bharadwaj Amrutur, Rubin A. Parekhji
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

We propose a unified error detection technique, based on stability checking, for on-line detection of delay, crosstalk and transient faults in combinational circuits and SEUs in sequential elements. Our method, called Modified Stability Checking (MSC), overcomes the limitations of the earlier stability checking methods. We also propose a novel checker circuit to realize this scheme. The checker is self-checking for a wide set of realistic internal faults including transient faults. Extensive circuit simulations have been done to characterize the checker circuit. A prototype checker circuit for a 1mm2 standard cell array has been implemented in a 0.13um process.
Subbands audio signal recovering using neural nonlinear prediction
Authors: G. Cocchi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Audio signal recovery is a common problem in the digital audio restoration field, because of corrupted samples that must be replaced. In this paper a subband architecture is presented for audio signal recovery, using neural nonlinear prediction based on adaptive spline neural networks. The experimental results show the mean square reconstruction error, and maximum error obtained with increasing gap length, from 200 to 5000 samples. The method gives good results allowing the reconstruction of over 100 ms of signal with low audible effects in overall quality.