ppxscal/embedding_network huggingface dataset:
Organizational Forms of Data Warehousing: An Explorative Analysis
Authors: Mario Klesse, Robert Winter
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In business practice, data warehousing can be implemented on the basis of different architecture designs as well as being positioned within a company's organization in different ways. Although data warehousing is practiced by a large number of big companies, as yet no standardized organizational form has emerged as a recognized best practice. Instead, the implemented organizational forms vary enormously in some cases. This paper sets out to systematize the various organizational forms based on an empirical investigation among 96 enterprises which operate data warehouses. The identified clusters are characterized, and the consequences and challenges which arise are outlined.
Keywords given by authors of scientific articles in database descriptors
Authors: Isidoro Gil-Leiva, Adolfo Alonso-Arroyo
Venue: Journal of the American Society for Information Science and Technology (2007)

In this article, the authors analyze the keywords given by authors of scientific articles and the descriptors assigned to the articles to ascertain the presence of the keywords in the descriptors. Six-hundred forty INSPEC (Information Service for Physics, Engineering, and Computing), CAB (Current Agriculture Bibliography) abstracts, ISTA (Information Science and Technology Abstracts), and LISA (Library and Information Science Abstracts) database records were consulted. After detailed comparisons, it was found that keywords provided by authors have an important presence in the database descriptors studied; nearly 25&percnt; of all the keywords appeared in exactly the same form as descriptors, with another 21&percnt; though normalized, still detected in the descriptors. This means that almost 46&percnt; of keywords appear in the descriptors, either as such or after normalization. Elsewhere, three distinct indexing policies appear, one represented by INSPEC and LISA (indexers seem to have freedom to assign the descriptors they deem necessary); another is represented by CAB (no record has fewer than four descriptors and, in general, a large number of descriptors is employed). In contrast, in ISTA, a certain institutional code exists towards economy in indexing because 84&percnt; of records contain only four descriptors. &copy; 2007 Wiley Periodicals, Inc.
An Empirical Measurement of the Coding Efficiency in Scalable Video Coding
Authors: M. F. Lopez, V. G. Ruiz, I. Garcia
Venue: Proceedings of the Geometric Modelling and Imaging (2007)

Video compression techniques can be classified into scalable and non-scalable. Scalable coding is more suitable in variable band-width scenarios because it improves the quality of the reconstructed video. On the other hand, the scalability has a cost in terms of coding efficiency and complexity. This paper describes a JPEG2000-and- MCTF-based fully scalable video codec (FSVC) and analyzes a set of experiments to measure the cost of the scalability, comparing two different FSVC encoders, called open-loop FSVC and closed-loop FSVC. In the open-loop version of FSVC, the encoder uses the original images to make the predictions. The closed-loop version generates the predictions with reference images identical to those obtained by the decoder at a given bit-rate. Numerical and visual results demonstrate a small loss of the coding efficiency for the open-loop scheme. Moreover, the inclusion of the closed-loop loop increases the complexity of the encoder and produces poor performance at high bit-rates.
Dynamic Segment Trees for Ranges and Prefixes
Authors: Yeim-Kuan Chang, Yung-Chieh Lin
Venue: IEEE Transactions on Computers (2007)

In this paper, we develop a segment tree data structure for solving dynamic table lookup problems. The proposed dynamic segment tree (DST) uses all of the distinct end points of ranges as the keys based on a new range end point scheme. The new end point scheme generates fewer end points than the traditional end point scheme. DST is implemented as a balanced binary search tree augmented with a range set in each node. The performance of accessing and updating the ranges stored in each node is improved by an efficient range set data structure that combines the priority queue and the interval tree. Based on the proposed data structures, the time complexities of search, insertion, and deletion in a set of N arbitrary ranges are O(\log N), O(\log N \times \log Max), and O(Max \times \log N \times \log Max), respectively, where Max is the maximum number of ranges covering any address. In practical routing tables, Max is a small constant (six for the routing tables we tested). The memory requirement for DST is O(N\log N). The experimental results using real Internet Protocol version 4 (IPv4) routing tables show that both the DST and prefix binary tree on binary tree (PBOB) by Lu et al. (2004) perform much better than the multiway range tree (MRT) by Warkhede et al. (2004) and prefix in B-tree (PIBT) by Lu et al. (2005) in terms of update speed and memory consumption, but DST performs much better than PBOB and a little slower than MRT and PIBT in terms of search speed.
BlueTable: connecting wireless mobile devices on interactive surfaces using vision-based handshaking
Authors: Andrew D. Wilson, Raman Sarin
Venue: Proceedings of Graphics Interface 2007 (2007)

Associating and connecting mobile devices for the wireless transfer of data is often a cumbersome process. We present a technique of associating a mobile device to an interactive surface using a combination of computer vision and Bluetooth technologies. Users establish the connection of a mobile device to the system by simply placing the device on a table surface. When the computer vision process detects a phone-like object on the surface, the system follows a handshaking procedure using Bluetooth and vision techniques to establish that the phone on the surface and the wirelessly connected phone are the same device. The connection is broken simply by removing the device. Furthermore, the vision-based handshaking procedure determines the precise position of the device on the interactive surface, thus permitting a variety of interactive scenarios which rely on the presentation of graphics co-located with the device. As an example, we present a prototype interactive system which allows the exchange of automatically downloaded photos by selecting and dragging photos from one cameraphone device to another.
User validation for mobile telephones
Authors: M. J. Carey
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

A combination of text-independent speaker verification and user profiling as a new biometric for crime prevention on mobile telephones is proposed, The verification carried out on the speech throughout the call hence obviates the need for direct user involvement while providing high impostor rejection. Low user rejection is achieved by monitoring the pattern of numbers called. While the pattern is substantially unchanged the speaker verification threshold is low minimising the level of false rejections. The threshold is raised if the calling pattern deviates from the normal. Analysis of a limited number of user call records shows that the users tend to call a small set of numbers repetitively and that deviation from this pattern are infrequent. Tests of a Gaussian mixture model based speaker verification system on an appropriate database gave an equal error rate of 4% showing that a text independent system can approach the performance of a text dependent system.
Dirty Electricity
Authors: David Alan Grier
Venue: Computer (2007)

Debugging has been one of the crucial skills of computer science.
A robust M-estimate adaptive filter for impulse noise suppression
Authors: Yuexian Zou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

In this paper, a robust M-estimate adaptive filter for impulse noise suppression is proposed. The objective function used is based on a robust M-estimate. It has the ability to ignore or down weight large signal error when certain thresholds are exceeded. A systematic method for estimating such thresholds is also proposed. An advantage of the proposed method is that its solution is governed by a system of linear equations. Therefore, fast adaptation algorithms for traditional linear adaptive filters can be applied. In particular, a M-estimate recursive least square (M-RLS) adaptive algorithm is studied in detail. Simulation results show that it is more robust against individual and consecutive impulse noise than the MN-LMS and the N-RLS algorithms. It also has fast convergence speed and a low steady state error similar to its RLS counterpart.
Deconvolution: a wavelet frame approach
Authors: Anwei Chai, Zuowei Shen
Venue: Numerische Mathematik (2007)

This paper devotes to analyzing deconvolution algorithms based on wavelet frame approaches, which has already appeared in Chan et&#x00a0;al. (SIAM J. Sci. Comput. 24(4), 1408&#x2013;1432, 2003; Appl. Comput. Hormon. Anal. 17, 91&#x2013;115, 2004a; Int. J. Imaging Syst. Technol. 14, 91&#x2013;104, 2004b) as wavelet frame based high resolution image reconstruction methods. We first give a complete formulation of deconvolution in terms of multiresolution analysis and its approximation, which completes the formulation given in Chan et&#x00a0;al. (SIAM J. Sci. Comput. 24(4), 1408&#x2013;1432, 2003; Appl. Comput. Hormon. Anal. 17, 91&#x2013;115, 2004a; Int. J. Imaging Syst. Technol. 14, 91&#x2013;104, 2004b). This formulation converts deconvolution to a problem of filling the missing coefficients of wavelet frames which satisfy certain minimization properties. These missing coefficients are recovered iteratively together with a built-in denoising scheme that removes noise in the data set such that noise in the data will not blow up while iterating. This approach has already been proven to be efficient in solving various problems in high resolution image reconstructions as shown by the simulation results given in Chan et&#x00a0;al. (SIAM J. Sci. Comput. 24(4), 1408&#x2013;1432, 2003; Appl. Comput. Hormon. Anal. 17, 91&#x2013;115, 2004a; Int. J. Imaging Syst. Technol. 14, 91&#x2013;104, 2004b). However, an analysis of convergence as well as the stability of algorithms and the minimization properties of solutions were absent in those papers. This paper is to establish the theoretical foundation of this wavelet frame approach. In particular, a proof of convergence, an analysis of the stability of algorithms and a study of the minimization property of solutions are given.
Autonomous robot navigation via intrinsic evolution
Authors: K. C. Tan, C. M. Chew, K. K. Tan, L. F. Wang, Y. J. Chen
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper presents the design and implementation of an evolvable hardware based autonomous robot navigation system using intrinsic evolution. Distinguished from the traditional evolutionary approaches based on software simulation, an evolvable robot controller at the hardware gate-level that is capable of adapting dynamic changes in the environments is implemented. In our approach, the concept of Boolean function is used to construct the evolvable controller implemented on an FPGA-based robot turret, and evolutionary computing is applied as a learning tool to guide the artificial evolution at the hardware level. The effectiveness of the proposed evolvable autonomous robotic system is confirmed with the physical real-time implementation of robot navigation behaviors on light source following and obstacle avoidance using a robot with traction fault.
Formal verification of pipelined processors with load-value prediction
Authors: M. N. Velev
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

The formal verification of pipelined processors with load-value prediction is studied. The formal verification is done by abstractions with the logic of equality with uninterpreted functions and memories (EUFM), using an automatic tool flow. Applying special abstractions in previous work had resulted in EUFM correctness formulas where most of the terms (abstract word-level values) appear in only positive equations (equality comparisons) or as arguments of uninterpreted functions and uninterpreted predicates, allowing us to treat such terms as distinct constants - a property we call positive equality. That property resulted in orders of magnitude speedup. However, the mechanism for correcting load-value mispredictions introduces both positive and negated equations between the actual and predicted load values, thus reducing significantly the potential for exploiting positive equality. The contributions of the paper are: 1) modeling and formal verification of a pipelined processor with load-value prediction and a fully implemented mechanism for correcting load-value mispredictions, and comparison with the formal verification of a variant of the design where the load values are not predicted, such that the data hazards are avoided by stalling the dependent instruction; and 2) a way to abstract the mechanism for detecting load-value mispredictions, thus allowing the use of positive equality, at the cost of enriching the specification processor with the abstracted mechanism for detecting load-value mispredictions.
HiPEC: high performance external virtual memory caching
Authors: Chao-Hsien Lee, Meng Chang Chen, Ruei-Chuan Chang
Venue: Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation (1994)

Traditional operating systems use a fixed LRU-like page replacement policy and centralized frame pool that cannot properly serve all types of memory access patterns of various applications As a result many memory-intensive applications such as databases multimedia applications and scientific simulators induce excessive page faults and page replacement when running on top of existing operating systems. This paper presents a High Performance External virtual memory Caching mechanism (HiPEC) to provide applications with their own specific page replacement management. The user specific policy programmed in the HiPEC command set is stored in user address space. When a page fault occurs the kernel fetches and interprets the corresponding policy commands to perform the user specific page replacement management. Experimental results show that HiPEC induces little overhead and can significantly improve performance for memory-intensive applications.
Robust microphone array using subband adaptive beamformer and spectral subtraction
Authors: R. Seshadri, N. Grbic, S. Nordholm
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

This paper presents a new robust microphone array to enhance speech signal under the influence of noise and jammer(s). The proposed structure comprises of a soft constrained subband beamformer, a blocking system and a non-coherent processing technique. The soft constrained beamformer enhances the desired speech signal in a specified region by suppressing all side-lobes. This enhanced signal is then used as a reference signal by the blocking system to estimate the interference spectrum. Finally, the beamformer's output is spectral subtracted using the estimated interference spectrum. Simulations in a real office environment show higher interference suppression level compared to those obtained using the soft constrained beamformer only. Most importantly. this is achieved with negligible expense on target signal distortion.
Continuum: A Hybrid Time/Space Communications Paradigm for k-ary n-cubes
Authors: Andrew C. Flavell, Yoshizo Takahashi
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

Although major advances have been made in improving the performance of interconnection networks for parallel systems, this area continues to be an active avenue of research. This is primarily due to the important role that interconnection network performance plays in determining the overall performance of a system. In this paper we introduce the Continuum communications paradigm, which utilizes multiple, unidirectional, register-insertion buses to provide a hybrid time/space division network. A discussion of the register-insertion bus is presented, along with its extension to k-ary n-cubes. An evaluation of the Continuum paradigm by simulation is given and it is found it to provide an effective model for general inter processor communication.
A processing model for the optimal querying of encrypted XML documents in XQuery
Authors: Tao-Ku Chang, Gwan-Hwan Hwang
Venue: Proceedings of the eighteenth conference on Australasian database - Volume 63 (2007)

XQuery is a powerful and convenient language that is designed for querying the data in XML documents. In this paper, we address how to optimally query encrypted XML documents using XQuery, with the key point being how to eliminate redundant decryption so as to accelerate the querying. We propose a processing model that can automatically and appropriately translate the XQuery statements for encrypted XML documents. Furthermore, we show that XML schema is significantly associated with queries over XML documents. The implementation and experimental results demonstrate the practicality of the proposed model.
A New Efficient Simulation Equivalence Algorithm
Authors: Francesco Ranzato, Francesco Tapparo
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

It is well known that simulation equivalence is an appropriate abstraction to be used in model checking because it strongly preserves ACTL* and provides a better space reduction than bisimulation equivalence. However, computing simulation equivalence is harder than computing bisimulation equivalence. A number of algorithms for computing simulation equivalence exist. Let \Sigma denote the state space, \to the transition relation and P_sim the partition of \Sigma induced by simulation equivalence. The algorithms by Henzinger, Henzinger, Kopke and by Bloom and Paige run in O(|\Sigma| |\to|)-time and, as far as time-complexity is concerned, they are the best available algorithms. However, these algorithms have the drawback of a quadratic space complexity that is bounded from below by \Omega(|\Sigma|^2). The algorithm by Gentilini, Piazza, Policriti appears to be the best algorithm when both time and space complexities are taken into account. Gentilini et al.'s algorithm runs in O(|Psim|^2|\to|)-time while the space complexity is in O(|P_sim|^2 + |\Sigma| log(|P_sim|)). We present here a new efficient simulation equivalence algorithm that is obtained as a modification of Henzinger et al.'s algorithm and whose correctness is based on some techniques used in recent applications of abstract interpretation to model checking. Our algorithm runs in O(|P_sim| |\to|)-time and O(|P_sim| |\Sigma|)-space. Thus, while retaining a space complexity which is lower than quadratic, our algorithm improves the best known time bound.
Explicit Cook-Toom algorithm for linear convolution
Authors: Y. Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

The short length linear convolution, conventionally computed by the Cook-Toom algorithm, is important since it is the building block of large convolution algorithms. To compute the linear convolution of N and M points, the Cook-Toom algorithm computes the Lagrange interpolation at L=N+M-1 real numbers. However, the computation is often tedious and has only been carried out for special integers. We present an explicit general formula for linear convolutions which calculates the interpolation at L-2 general non-zero points. We further investigate the linear convolution from VLSI implementation point of view.
Class relationships and user extensibility in solid geometric modeling
Authors: James R. Miller
Venue: Proceedings of the 2nd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 2 (1996)

Solid Geometric Modeling is an important enabling technology in Computer-Aided Design and Manufacturing. Open, extensible architectures which foster efficient construction and manipulation of models are important to design engineers. We describe the architecture of the cryph Solid Modeler, focusing on aspects of the design which maximize flexibility and enable user-extensibility of primitive modeling shapes.
Parameter Estimation for a Model with Both Imperfect Test and Repair
Authors: Simon Wilson, Ben Flood, Suresh Goyal, Jim Mosher, Susan Bergin, Joseph O'Brien, Robert Kennedy
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

We describe estimation of the parameters of a manufacturing test and repair model using data available from that test. The model allows imperfect testing and imperfect repair. The principal problem that we address is of parameter identification, given insufficient data, that we address by making conservative assumptions on the property being measured and the associated parameter values. Several cases of commonly occurring test types, in the manufacture of electronic products, are considered.
Gradual Release: Unifying Declassification, Encryption and Key Release Policies
Authors: Aslan Askarov, Andrei Sabelfeld
Venue: Proceedings of the 2007 IEEE Symposium on Security and Privacy (2007)

Information security has a challenge to address: enabling information-flow controls with expressive information release (or declassification) policies. Existing approaches tend to address some aspects of information release, exposing the other aspects for possible attacks. It is striking that these approaches fall into two mostly separate categories: revelation-based (as in information purchase, aggregate computation, moves in a game, etc.) and encryption-based declassification (as in sending encrypted secrets over an untrusted network, storing passwords, etc.). This paper introduces gradual release, a policy that unifies declassification, encryption, and key release policies. We model an attacker's knowledge by the sets of possible secret inputs as functions of publicly observable outputs. The essence of gradual release is that this knowledge must remain constant between releases. Gradual release turns out to be a powerful foundation for release policies, which we demonstrate by formally connecting revelation-based and encryption-based declassification. Furthermore, we show that gradual release can be provably enforced by security types and effects.
Porting commercial file systems to Linux
Authors: Jim Mostek
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

Recently, SGI and Veritas have announced that they intend to port their advanced file system technologies to Linux. Veritas' VxFS and SGI's XFS file system both employ journaling and scalable internal data structures that allow very large files and directories to be supported. VxFS and XFS both use the vnode/vfs interface structure popularized in System V UNIX. The vnode interface differs from Linux's virtual file system in several respects, and these differences must be overcome in porting vnode-based file systems to Linux. In this paper and talk, the authors will describe their efforts in porting SGI's XFS file system to Linux. This port is an on-going joint effort between SGI, the GFS Group at the University of Minnesota, and Sistina Software, a firm developing storage management software for Linux. Issues addressed will include integrating vnode-like features into Linux's vfs interface, buffer and page cache integration, journaling, volume management, and achievable performance.