ppxscal/embedding_network huggingface dataset:
Selectivity estimation by batch-query based histogram and parametric method
Authors: Jizhou Luo, Xiaofang Zhou, Yu Zhang, Heng Tao Shen, Jianzhong Li
Venue: Proceedings of the eighteenth conference on Australasian database - Volume 63 (2007)

Histograms are used extensively for selectivity estimation and approximate query processing. Workload-aware dynamic histograms can self-tune itself based on query feedback without scanning or sampling the underlaying datasets in a systematic and comprehensive way. Dynamic histograms allocate more buckets not only for the areas with most skewed data distribution but also according to users' interest. However, it takes long time to 'warm-up' (i.e., a large number of queries need to be processed before the histogram can provide a satisfactory coverage and accuracy). Thus, it is less effective to adapt with workload pattern changes. In this paper, we propose a novel online query scheduling algorithm which can significantly reduce the warm-up time for dynamic histograms. A parametric method is proposed to remedy the problem of inaccurate query selectivity estimation for the areas with poor histogram coverage. Experimental results demonstrate a significant effectiveness and accuracy improvement of our approach.
Managing Conflicts When Using Combination Strategies to Test Software
Authors: Mats Grindal, Jeff Offutt, Jonas Mellin
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Testers often represent systems under test in input parameter models. These contain parameters with associated values. Combinations of parameter values, with one value for each parameter, are potential test cases. In most models, some values of two or more parameters cannot be combined. Testers must then detect and avoid or remove these conflicts. This paper proposes two new methods for automatically handling such conflicts and compares these with two existing methods, based on the sizes of the final conflict-free test suites. A test suite reduction method, usable with three of the four investigated methods is also included in the study, resulting in seven studied conflict handling methods. In the experiment, the number and types of conflicts, as well as the size of the input parameter model and the coverage criterion used, are varied. All in all, 3854 test suites with a total of 929, 158 test cases were generated. Two methods stand out as tractable and complementary. The best method (called the avoid methods) with respect to test suite size is to avoid selection of test cases with conflicts. However, this method cannot always be used. The second best method (called the replace method), removing conflicts from the final test suite, is completely general.
Interpolation of scratches in motion picture films
Authors: T. Bretschneider
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Movie films are often damaged through ageing, chemical changes and contact with mechanical parts of a film projector. In this paper a method for the removal of scratches and undesirable lines in digitised film sequences is discussed. The method assumes the prior knowledge about the position and orientation of the scratches and utilises an iterative method to interpolate the affected pixels. The convergence of the algorithm is guaranteed for the noise free case and the optimal choice of the involved relaxation parameter is demonstrated. The method was validated using sampled movies and proved to be stable even in the presence of noise. Remarkable is the reconstruction result in comparison to standard interpolation techniques like cubic splines.
Porting kernel code to four BSDs and linux
Authors: Craig Metz
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1999)

The U.S. Naval Research Laboratory develops and maintains a freely available IPv6 and IP Security distribution. All of the software builds and runs on BSD/OS, FreeBSD, NetBSD, and OpenBSD, and a growing portion of the software builds and runs on Linux. Each of the four BSDs has evolved significantly from their original 4.4BSD-Lite ancestor, and increasingly more of that evolution is along divergent paths. Linux shares no significant ancestry with the BSDs, but is still a POSIX system, which means that many of the same high-level facilities are available even though their implementation might be completely different. This paper discusses many of the differences and many of the similarities we encountered in the internals of these systems. It also discusses the techniques and glue software that we developed for isolating and abstracting the differences so that we could build a significant base of system code that is portable between all five systems.
Blind deconvolution of reverberated speech signals via regularization
Authors: Juan Liu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This paper explores blind deconvolution of reverberated speech signals in microphone array applications. Two regularization approaches are proposed based on available a priori knowledge. The regularized least-squares (LS) approach uses the speech signal characteristics and the lowpass nature of the reverberation channel; and the regularized cross correlation (CR) approach requires more precise knowledge of reverberation which can be obtained through training. The two methods are robust to the presence of noise.
Multi-tape finite-state transducer for asynchronous multi-stream pattern recognition with application to speech
Authors: James R. Glass
Venue:  (2006)

In this thesis, we have focused on improving the acoustic modeling of speech recognition systems to increase the overall recognition performance. We formulate a novel multi-stream speech recognition framework using multi-tape finite-state transducers (FSTs). The rnulti-dimensional input labels of the multi tape FST transitions specify the acoustic models to be used for the individual feature streams. An additional auxiliary field is used to model the degree of asynchrony among the feature streams. The individual feature streams can be linear sequences such as fixed-frame-rate features in traditional hidden Markov model (HMM) systems, and the feature streams can also be directed acyclic graphs such as segment features in segment-based systems. In a single-tape mode, this multi-stream framework also unifies the frame-based HMM and the segment-based approach. Systems using the multi-stream speech recognition framework were evaluated on an audio-only and an audio-visual speech recognition task. On the Wall Street Journal speech recognition task, the multi-stream framework combined a traditional frame based HMM with segment-based landmark features. The system achieved word error rate (WER) of 8.0%, improved from both the WEB, of 8.8% of the baseline HMM-only system and the WER of 10.4% of the landmark-only system. On the AV-TIMIT audio-visual speech recognition task, the multi-stream framework combined a landmark model, a segment model, and a visual HMM. The system achieved a WER of 0.9%, which also unproved from the baseline systems. These results demonstrate the feasibility and versatility of the multi-stream speech recognition framework. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
A Markov random field approach to Bayesian speaker adaptation
Authors: B. M. Shahshahani
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

Speaker adaptation through Bayesian learning methodology is studied. In order to utilize the cross allophone correlations, a Markov random field model is proposed as the joint prior distribution of the allophones' parameters. Neighborhoods are defined as pairs of parameters between which strong correlations have been observed previously. Maximum a posteriori estimates of the allophones' mean vectors are obtained iteratively. This process is similar to a recursive prediction of the parameters. Further Bayesian smoothing is carried out by utilizing some simplifications on the functional forms of the marginal posterior distributions. Experimental results show rapid improvement of recognition accuracy. 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
An Approach to Comprehending Networked Applications through Analogy
Authors: Maxim Shevertalov, Edward Stehle, Chris Rorres, Spiros Mancoridis, Moshe Kam
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Distributed applications rely on packet-switched networks to connect their various elements. This paper describes a technique that can help software engineers and network administrators characterize unfamiliar networked applications by matching them to a single, or a combination of several, analogous and familiar networked application( s). This matching is based on the size distribution of the packets sent and received by the application undergoing scrutiny.
Capability file names: separating authorisation from user management in an internet file system
Authors: Jude T. Regan, Christian D. Jensen
Venue: Proceedings of the 10th conference on USENIX Security Symposium - Volume 10 (2001)

The ability to access and share information over the Internet has introduced the need for new flexible, dynamic and fine-grained access control mechanisms. None of the current mechanisms for sharing information - distributed file systems and the web - offer adequate support for sharing in a large and highly dynamic group of users. Distributed file systems lack the ability to share information with unauthenticated users, and the web lacks fine grained access controls, i.e. the ability to grant individual users access to selected files. In this paper we present Capability File Names, a new access control mechanism, in which self-certifying file names are used as sparse capabilities that allow a user ubiquitous access to his files and enables him to delegate this right to a dynamic group of remote users. Encoding the capaility in the file name has two major advantages: it is self-supporting and it ensures full compatablity with existing programs. Capability file names have been implemented in a new file system called CapaFS. CapaFS separates user identification from authorisation, thus allowing users to share selected files with remote users without the intervention of a system administrator. The implementation of CapaFS is described and evaluated in this paper
FUSE: lightweight guaranteed distributed failure notification
Authors: John Dunagan, Nicholas J. A. Harvey, Michael B. Jones, Dejan Kostić, Marvin Theimer, Alec Wolman
Venue: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6 (2004)

FUSE is a lightweight failure notification service for building distributed systems. Distributed systems built with FUSE are guaranteed that failure notifications never fail. Whenever a failure notification is triggered, all live members of the FUSE group will hear a notification within a bounded period of time, irrespective of node or communication failures. In contrast to previous work on failure detection, the responsibility for deciding that a failure has occurred is shared between the FUSE service and the distributed application. This allows applications to implement their own definitions of failure. Our experience building a scalable distributed event delivery system on an overlay network has convinced us of the usefulness of this service. Our results demonstrate that the network costs of each FUSE group can be small; in particular, our overlay network implementation requires no additional liveness-verifying ping traffic beyond that already needed to maintain the overlay, making the steady state network load independent of the number of active FUSE groups.
New fast algorithms of multidimensional Fourier and Radon discrete transforms
Authors: E. V. Labunets
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper describes a fast new n-D discrete Radon transform (DRT) and a fast exact inversion algorithm for it, without interpolating from polar to Cartesian coordinates of using the backprojection operator. The new approach is based on the fast Nussbaumer's (1982) polynomial transform (NPT).
Parallelization of the global extremum searching process
Authors: Yu. G. Evtushenko, V. U. Malkova, A. A. Stanevichyus
Venue: Automation and Remote Control (2007)

The parallel algorithm for searching the global extremum of the function of several variables is designed. The algorithm is based on the method of nonuniform coverings proposed by Yu.G. Evtushenko for functions that comply with the Lipschitz condition. The algorithm is realized in the language C and message passing interface (MPI) system. To speed up computations, auxiliary procedures for founding the local extremum are used. The operation of the algorithm is illustrated by the example of atomic cluster structure calculations.
FCPre: Extending the Arora-Kulkarni Method of Automatic Addition of Fault-Tolerance
Authors: Bastian Braun
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Synthesizing fault-tolerant systems from fault-intolerant systems simplifies design of fault-tolerance. Arora and Kulkarni developed a method and a tool to synthesize fault-tolerance under the assumption that specifications are not history-dependent (fusion-closed). Later, Gärtner and Jhumka removed this assumption by presenting a modular extension of the Arora-Kulkarni method. This paper presents an implementation of the Gärtner-Jhumka method which is evaluated on several examples. As additional safety net, we have added automatic verification of the results using the model checker Spin. In the context of this work, a fault in the Gärtner-Jhumkamethod has been found. Though this fault is rare and does not cause incorrect results, there might be no result at all.
Order of explanation should be interface: abstract classes - overriding
Authors: Rudolf Pecinovsky, Jarmila Pavlickova
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

Most textbooks about object-oriented programming start explaining the OOP triumvirate, inheritance - abstract classes - interface, in this order. The article explains why the Design Patterns First methodology changes this order of explanation. It suggests explaining the interface at the beginning of course. After some experience it should follow by explaining abstract classes and inheritance without method overriding and after more experience by explaining inheritance of standard classes and method overriding.
An adaptive data object service for pervasie computing environments
Authors: Christopher K. Hess, Francisco Ballesteros, Roy H. Campbell, M. Dennis Mickunas
Venue: Proceedings of the 6th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 6 (2001)

Workstations and PCs typically are rich in resources, in contrast to palmtop devices, which are generally quite limited. This disparity offers challenges to integrating these heterogeneous devices into a single distributed system. Services must be available to each device, but it may be necessary to modify certain services if the connected device does not have the desired resources. A key component of many distributed systems is remote access to data. Traditional distributed file systems are typically rather static and are not able to adapt to the current available resources of the devices involved. Data files are treated as continuous streams of bytes and the interfaces to access them are designed for unstructured data: they simply transfer buffers of contiguous data. Providing modality and adapting content using these interfaces proves difficult. In this paper, we present an adaptive data object service for pervasive computing environments using distributed objects. Data is manipulated through an object-oriented interface based on containers and iterators. The interface is also used to model data operations, conversions, and proxies. The system is aware of its environment and can instantiate objects in the proper locations to optimize performance.
Towards Reliability and Fault-Tolerance of Distributed Stream Processing System
Authors: Marcin Gorawski, Pawel Marks
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

Not so long ago data warehouses were used to process data sets loaded periodically. We could distinguish two kinds of ETL processes: full and incremental. Now we often have to process real-time data and analyse them almost on-the-fly, so the analysis are always up to date. There are many possible applications for real-time data warehouses. In most cases two features are important: delivering data to the warehouse as quick as possible, and not losing any tuple in case of failures. In this paper we propose an architecture for gathering and processing data from geographically distributed data sources. We present theoretical analysis, mathematical model of a data source, and some rules of system modules configuration. At the end of the paper our future plans are described briefly.
Security analysis of the palm operating system and its weaknesses against malicious code threats
Authors: Kingpin Kingpin, Mudge Mudge
Venue: Proceedings of the 10th conference on USENIX Security Symposium - Volume 10 (2001)

Portable devices, such as Personal Digital Assistants (PDAs), are particularly vulnerable to malicious code threats due to their widespread implementation and current lack of a security framework. Although well known in the security industry to be insecure, PDAs are ubiquitous in enterprise environments and are being used for such applications as one-time-password generation, storage of medical and company confidential information, and e-commerce. It is not enough to assume all users are conscious of computer security and it is crucial to understand the risks of using portable devices in a security infrastructure. Furthermore, it is not possible to employ a secure application on top of an insecure foundation. Palm operating system (OS) devices own nearly 80 percent of the global handheld computing market [11]. It is because of this that the design of the Palm OS and its supporting hardware platform were analyzed. The presented research provides detail into specific scenarios, weaknesses, and mitigation recommendations related to data protection, malicious code, virus storage, and virus propagation. Additionally, this work can be used as a model by users and developers to gain a deeper understanding of the additional security risks that these and other portable devices introduce.
Guest Editor's Introduction: Python: Batteries Included
Authors: Paul F. Dubois
Venue: Computing in Science and Engineering (2007)

Our special theme this issue is the computer programming language Python and the increasing role it plays in scientific projects. Free and universally available, Python comes with a vast standard library containing support for nearly every area of computer science. An even more extensive set of third-party tools and modules covers additional tasks, from managing a Web site to doing a fast Fourier transform to distributed or parallel programming. The Python motto "batteries included" is meant to convey the idea that Python comes with everything you need.
A Time Series Based Approach for Classifying Mass Spectrometry Data
Authors: F. Gullo, G. Ponti, A. Tagarelli, G. Tradigo, P. Veltri
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

This paper presents a methodology to mine spectra data based on time-series analysis. MALDI-TOF spectra are modelled as time series using a compact yet feature-rich representation scheme. Experiments show that classifying mass spectrometry series is effective and can be useful for identifying peaks in spectra that can be associated to discriminant proteins.
Minimization of weighted sensitivity for 2-D state-space digital filters described by the Fornasini-Marchesini second model
Authors: T. Hinamoto
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper considers the problem of minimizing the weighted coefficient sensitivity for 2-D state-space digital filters described by the Fornasini-Marchesini (F-M) second model. First, a simple technique is presented for obtaining a set of filter structure with very low weighted L/sub 1//L/sub 2/-sensitivity. Next, an iterative procedure is applied to obtain the optimal coordinate transformation that minimizes the weighted L/sub 2/-sensitivity measure. This is based on the matrix Riccati differential equation. Finally, a numerical example is given to illustrate the utility of the proposed technique.
GPU Computing: Programming a Massively Parallel Processor
Authors: Ian Buck
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

Many researchers have observed that general purpose computing with programmable graphics hardware (GPUs) has shown promise to solve many of the world's compute intensive problems, many orders of magnitude faster the conventional CPUs. The challenge has been working within the constraints of a graphics programming environment and limited language support to leverage this huge performance potential. GPU computing with CUDA is a new approach to computing where hundreds of on-chip processor cores simultaneously communicate and cooperate to solve complex computing problems, transforming the GPU into a massively parallel processor. The NVIDIA C-compiler for the GPU provides a complete development environment that gives developers the tools they need to solve new problems in computation-intensive applications such as product design, data analysis, technical computing, and game physics. In this talk, I will provide a description of how CUDA can solve compute intensive problems and highlight the challenges when compiling parallel programs for GPUs including the differences between graphics shaders vs. CUDA applications.
Novel Cross-Loopback Based Test Approach for Specification Test of Multi-Band, Multi-Hardware Radios
Authors: V. Natarajan, G. Srinivasan, A. Chatterjee, Craig Force
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

Recent advances in radio systems engineering have enabled the design of multiple RF front ends (transmitters and receivers), each servicing specific RF communication standards across different frequency bands in a single electronic package. While the design aspects of such radios have been rigorously researched, the test aspects are still evolving. This paper proposes a novel "alternate cross-loopback testing' scheme for a multi-hardware radio using an "optimized' multi-tone test input. In this approach, the transmitter corresponding to one RF standard is used to test receivers corresponding to the same or different communication standards and operating frequency bands. The test approach is compatible with half-duplex operation of the transceiver front-ends and works with all the signal modulation and demodulation software turned "off". Cross-loopback is achieved via a broadband mixer, a programmable VCO and attenuator in the loopback path. The multi-sine tests allow accurate prediction of all transmitter and receiver specifications.