ppxscal/embedding_network huggingface dataset:
Red Opal: product-feature scoring from reviews
Authors: Christopher Scaffidi, Kevin Bierhoff, Eric Chang, Mikhael Felker, Herman Ng, Chun Jin
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

Online shoppers are generally highly task-driven: they have a certain goal in mind, and they are looking for a product with features that are consistent with that goal. Unfortunately, finding a product with specific features is extremely time-consuming using the search functionality provided by existing web sites.In this paper, we present a new search system called Red Opal that enables users to locate products rapidly based on features. Our fully automatic system examines prior customer reviews, identifies product features, and scores each product on each feature. Red Opal uses these scores to determine which products to show when a user specifies a desired product feature. We evaluate our system on four dimensions: precision of feature extraction, efficiency of feature extraction, precision of product scores, and estimated time savings to customers. On each dimension, Red Opal performs better than a comparison system.
Ambiguities in Sketch-Based Interfaces
Authors: Danilo Avola, Maria Chiara Caschera, Fernando Ferri, Patrizia Grifoni
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Sketch-based interaction is an intuitive, simple communication method. However, it has several critical aspects, due to difficulties during the interpretation step by the computer side. These mainly derive from the semantic gap between the user's communicative intention and how he/she is able to convey it. The interpretation must also consider the deletion and over-tracing actions. This introduces further ambiguities that make it difficult to interpret the user's communicative intention. To deal with these problems, this paper provides a classification of ambiguities for sketch-based interfaces, based on experimental observations from a group of users. Ambiguities are caused by inaccuracy, approximation of the represented reality, user's indecision and deletion or retracing of parts of the sketch. This paper presents some useful situations to give an overview on ambiguities by considering information strictly related to the user's behaviour, considering spatial and temporal information in the drawing process and the user's intention.
Twinned meshes for dynamic triangulation of implicit surfaces
Authors: Antoine Bouthors, Matthieu Nesme
Venue: Proceedings of Graphics Interface 2007 (2007)

We introduce a new approach to mesh an animated implicit surface for rendering. Our contribution is a method which solves stability issues of implicit triangulation, in the scope of real-time rendering. This method is robust, moreover it provides interactive and quality rendering of animated or manipulated implicit surfaces. This approach is based on a double triangulation of the surface, a mechanical one and a geometric one. In the first triangulation, the vertices are the nodes of a simplified mechanical finite element model. The aim of this model is to uniformly and dynamically sample the surface. It is robust, efficient and prevents the inversion of triangles. The second triangulation is dynamically created from the first one at each frame. It is used for rendering and provides details in regions of high curvature. We demonstrate this technique with skeleton-based and volumetric animated surfaces.
Software Security
Authors: Jeannette M. Wing
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

Security vulnerabilities are increasingly due to software. While we focus much of our attention today on code-level vulnerabilities, such as buffer overflows, we should be paying more attention to design-level vulnerabilities. Independently designed and implemented components may individually behave properly, but when put together, unanticipated interactions may occur. An unanticipated interaction between two software components is an opportunity for an attacker to exploit.
Jacobi's method for massive parallel wave digital filter algorithm
Authors: T. Felderhoff
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

While every linear system can be described by a realizable wave digital (WD) algorithm, it is possible that delay-free directed loops (DFDLs) may occur by a WD simulation of nonlinear systems. A method is presented which is very similar to the well-known Jacobi's method for solving a system of equations numerically. With the aid of this method it is possible to cut all DFDLs. It can also be used to systematically generate a massive parallel algorithm, and thus it is significant to simulate one- or multidimensional, linear or nonlinear systems in an acceptable computer time. To show the efficiency of this combination of Jacobi's method and WD principles a nonlinear lossless transmission line model is presented. 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
Fuzzy clustering approach for accurate embedding dimension identification in chaotic time series
Authors: Xiaomo Jiang, Hojjat Adeli
Venue: Integrated Computer-Aided Engineering (2003)

The dynamics of many physically complex systems cannot be represented by a set of differential equations. Measured sensor signals in the form of time-series can be used to investigate complexities and chaotic behavior in such systems. In order to characterize the chaotic behavior of a time series, a state space is constructed from the observed time series which requires the selection of its embedding dimension. In this article, first three existing methods for determining the embedding dimension are investigated using three different examples with available analytical equations where the exact value of the optimum embedding dimension is known. They are the fill-factor method, the average integral local deformation method, and the false nearest neighbors method. Next, a fuzzy c-means clustering approach is proposed for finding the optimum embedding dimension accurately. The time lag index obtained from the average mutual information method is used as the number of clusters. The reconstructed state space vectors are clustered using the fuzzy c-means clustering approach. It is shown that the proposed approach yields the exact answer in all three examples. The proposed approach does not require the arbitrary or trial-and-error selection of parameters and is computationally efficient. It can be used effectively for chaos analysis of complex real-life time series such as electroencephalographs, cardiological arrhythmias, weather patterns, and traffic congestions where the underlying physical phenomenon cannot be described analytically.
AutoInstall for NT: complete NT installation over the network
Authors: Robert Fulmer, Alex Levine
Venue: Proceedings of the 1998 Conference on Large Installation System Administration of Windows NT (1998)

This paper describes how we take a bare PC and turn it into a fully functioning NT desktop machine with a standard set of applications in less than 30 minutes. In 1996 we identified OS and application loading as a significant portion of our workload. Loading NT, loading our standard suite of applications, and configuring each of them to our specifications took 4 to 8 hours. This process was prone to errors that were not detected until months later. We automated the process so that an SA with our special boot disk can do the entire process in 30 minutes (60 minutes on a slow network). We do an actual NT installation. We do not clone. With our new system, a single SA can deploy up to 20 PC's per day as opposed to just 1 or 2 per day.
Tcl-DP name server
Authors: Peter T. Liu, Brian Smith, Lawrence Rowe
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

This paper describes a general purpose name server for Tcl-DP. This name server maintains host addresses and port numbers of services running in a distributed environment and allows clients to query about them. It starts services on demand so services are guaranteed to be available, and it provides a simple authentication protocol for better security. The Tcl-DP name server is also designed to be fault-tolerant. Multiple backup servers can be started on different hosts, and a failover occurs when the main server goes down. In addition, the name server provides mechanisms to interface with external modules for extending its functionality.
A Formal Model of Service-Oriented Design Structure
Authors: Mikhail Perepletchikov, Caspar Ryan, Keith Frampton, Heinz W. Schmidt
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Service-Oriented Computing (SOC) is a promising paradigm for developing enterprise software systems. The initial concepts of service-orientation have been described in the research and industry literature and software tools for assisting in the development of Service-Oriented (SO) applications are becoming more widely used. Nonetheless, a precise description of what constitutes a SO system is yet to be formally defined, and the design principles of SOC are not well understood. Therefore, this paper proposes a formal mathematical model covering design artefacts in service-oriented systems and their structural and behavioural properties. This model promotes a better understanding of SO concepts, and in particular, enables the definition of structural software metrics in an unambiguous, formal manner. Finally, although the proposed model is generic, it can be customised to support particular technologies as shown in this paper where the model was tailored for BPEL4WS implementation.
Safe worst-case execution time analysis by abstract interpretation of executable code
Authors: Daniel Kaestner
Venue: ACM SIGPLAN Notices (2007)

To verify that a safety-critical application meets all requirements lies in the responsibility of the system designers. Classical software validation methods like code review and testing with debugging are expensive and cannot really guarantee the absence of errors. In constrast, abstract interpretation provides a methodology for static program analysis that yields statements valid for all program runs with all inputs. Employing static analyzers is thus orthogonal to classical testing. A possible cause of catastrophic failure is the violation of timing constraints. Recent trends, e.g. in automotive industries (X-by-wire, time-triggered protocols) require knowledge on the Worst-Case Execution Time (WCET) of each task. Yet WCET determination is a difficult problem because of the characteristics of modern software and hardware. This talk focuses on AbsInt's tool aiT that combines abstract interpretation and integer linear programming to determine upper bounds for the WCETs of code snippets given as routines in executables. The hardware architecture of the underlying processor is precisely taken into account, including cache and pipeline behavior. Bounds are determined without the need to change the code and hold for all executions. aiT is used among others by Airbus in the development of various safety-critical applications for the A380.
Fast range and Doppler estimation for narrowband active sonar
Authors: S. R. Dooley
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We present a computationally simple algorithm suitable for fast, high resolution estimation of time delays and Doppler shifts (which are necessary for target localization and tracking) between narrowband signals in an active sonar system. The algorithm uses a modulated Lagrange interpolation filter and an LMS-type algorithm. The problem of delay and Doppler estimation is reduced to a linear regression problem. Convergence and performance analysis of the method is studied both analytically and through simulation. It is demonstrated that the method provides estimates close to the Cramer-Rao lower bound.
Creating Strategic Value from Supply Chain Visibility- the Dynamic Capabilities View
Authors: Hsiao-Lan Wei, Eric T. G. Wang
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

To understand the role of supply chain visibility in creating strategic value, this study applies the dynamic capabilities view to investigate the nature of supply chain visibility. This research identifies four important measurable constructs of supply chain visibility that are proposed to drive supply chain reconfigurability and improve supply chain performance. They are sensing for visibility, learning for visibility, coordinating for visibility, and integrating for visibility. Implications for better understanding the nature and the role of supply chain visibility are provided based on the research model and survey results.
Interactive wavelet processing and techniques applied to digital mammography
Authors: I. Koren
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

We present an interactive scheme for processing of digital mammograms relying upon a steerable dyadic wavelet transform. Coefficients of the translation and rotation-invariant transform are interactively processed before an inverse transform is applied. Analysis is carried out at dyadic scales and along arbitrary orientations. Local orientation is computed at each level of scale and spatial position and formulated into criteria for including or excluding specific orientations for contrast enhancement and enhancing locally radiating structures. Transform coefficients that were selected for contrast enhancement are modified by a piecewise linear enhancement function. The presented scheme is flexible enough to enable efficient position, scale, and orientation based interactive processing and analysis.
Encoding of image partitions using a standard technique for lossless image compression
Authors: A. J. Pinho
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Recently, a new technique for the lossless encoding of boundary maps was introduced, which is based on the concept of "transition points". In this paper we show that, using a simple representation for the transition points, it is possible to use the JBIG image coding standard for the encoding of image partitions. Moreover, this new approach outperforms, in most cases, differential chain-coding both in efficiency and simplicity of implementation.
Experience using Web-based media in distance learning
Authors: D. A. Gustafson
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Distance learning is experiencing tremendous growth. The demand for continuing education among employed software engineers is increasing. Universities need to improve the environment and delivery of the course material for distance learning. The Computing and Information Science department at Kansas State University has experimented with the use of Web based media to replace video tapes for distance learning courses in its Masters of Software Engineering program. The experiences of the instructors and students are discussed.
Improved motion-compensated temporal filtering (mctf) for scalable video coding
Authors: Nam Ling
Venue:  (2006)

Scalable video coding (SVC) is currently being developed as the new MPEG standardization effort of H.264/AVC scalable extension, a.k.a., Joint Scalable Video Model (JSVM). One key element of such scalable video codec is the hierarchical prediction structure for temporal scalability realized either by the lifting-based motion-compensated temporal filtering (MCTF), or by the hierarchical B pictures alternatively. In this dissertation, we focus on three important goals for scalabilities realized by MCTF. The first goal is to thoroughly review the recent development of MCTF framework, which includes the inherent drift problem faced by conventional hybrid video coder to support scalability efficiently, the importance of motion compensation in the new light of MCTF framework, and the challenges of efficient MCTF implementation. The second goal is to find the optimized update steps to improve the SVC coding efficiency. To this end, we propose a class of new MCTF update step schemes, which improves the JSVM update steps in two ways: first, generating the accurate update step motion information via motion vector (MV) correlation analysis; secondly, incorporating chrominance information of video sequence to adaptively perform update steps. Furthermore, we enhance the proposed methods by an efficient content adaptive analysis. Our third focus concerns the effect of update steps on the MCTF coding efficiency. In this regard, we present a theoretical model and study of the MCTF coding efficiency measured in terms of peak-signal-to-noise ratio (PSNR) of the reconstructed sequence. We investigate the effect of update steps on MCTF coding efficiency when skipping update step at both encoder and decoder sides; when performing update step at the encoder side only; and the contribution of non-linear adaptive update control to the overall reconstruction error. By our theoretical model in this dissertation, we show that the MCTF update step at the decoder side does not contribute significantly to the coding efficiency, except at high spatial-temporal resolutions with high bit rates. Consequently, our study provides a theoretical justification for not including MCTF update steps at the decoder side for the current SVC development.
Image-Based Streamline Generation and Rendering
Authors: Liya Li, Han-Wei Shen
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Seeding streamlines in 3D flow fields without considering their projections in screen space can produce visually cluttered rendering results. Streamlines will overlap or intersect with each other in the output image, which makes it difficult for the user to perceive the underlying flow structure. This paper presents a method to control the seeding and generation of streamlines in image space to avoid visual cluttering and allow a more flexible exploration of flow fields. In our algorithm, 2D images with depth maps generated by a variety of visualization techniques can be used as input from which seeds are placed and streamlines are generated. The density and rendering styles of streamlines can be flexibly controlled based on various criteria to improve visual clarity. With our image space approach, it is straightforward to implement the level of detail rendering, depth peeling, and stylized rendering of streamlines to allow for more effective visualization of 3D flow fields.
Design of the ARM VFP11 Divide and Square Root Synthesisable Macrocell
Authors: Neil Burgess, Chris N. Hinds
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

This paper presents the detailed design of the ARM VFP11 Divide and Square Root synthesisable macrocell. The macrocell was designed using the minimum-redundancy radix-4 SRT digit recurrence algorithm, and this paper describes a novel acceleration technique employed to achieve the required processor clock frequency of up to 750MHz in 90nm CMOS. Logical Effort theory is used to provide a delay analysis of the unit, which demonstrates the balanced nature of the two critical paths therein.
A rootfinding algorithm for line spectral frequencies
Authors: J. Rothweiler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

Published techniques for computing line spectral frequencies (LSFs) generally avoid rootfinding methods because of concerns about convergence and complexity. However, this paper shows that stable predictor polynomials have properties that make rootfinding an attractive approach. It is well known that the problem of finding the LSFs for an N'th order predictor polynomial can be reduced to the problem of finding the roots of a pair of polynomials of order N/2 with real roots. The author extends this result by showing that these polynomials have the following properties: 1. It is possible to select starting points for a Newton's rootfinding method such that the iteration will converge monotonically to the largest root. 2. The Newton iteration can be modified to speed up the process while still maintaining good convergence properties. In this paper, the author presents the rootfinding procedures with proofs of their good convergence properties. Finally, he presents experimental results showing that this procedure performs well on speech signals, and that it can be implemented on fixed-point DSPs. 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
Algorithms for Nearest Neighbor Search on Moving Object Trajectories
Authors: Elias Frentzos, Kostas Gratsias, Nikos Pelekis, Yannis Theodoridis
Venue: Geoinformatica (2007)

Nearest Neighbor (NN) search has been in the core of spatial and spatiotemporal database research during the last decade. The literature on NN query processing algorithms so far deals with either stationary or moving query points over static datasets or future (predicted) locations over a set of continuously moving points. With the increasing number of Mobile Location Services (MLS), the need for effective k-NN query processing over historical trajectory data has become the vehicle for data analysis, thus improving existing or even proposing new services. In this paper, we investigate mechanisms to perform NN search on R-tree-like structures storing historical information about moving object trajectories. The proposed (depth-first and best-first) algorithms vary with respect to the type of the query object (stationary or moving point) as well as the type of the query result (historical continuous or not), thus resulting in four types of NN queries. We also propose novel metrics to support our search ordering and pruning strategies. Using the implementation of the proposed algorithms on two members of the R-tree family for trajectory data (namely, the TB-tree and the 3D-R-tree), we demonstrate their scalability and efficiency through an extensive experimental study using large synthetic and real datasets.
Reservoir Sampling over Memory-Limited Stream Joins
Authors: Mohammed Al-Kateb, Byung Suk Lee, X. Sean Wang
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over memory-limited stream joins. We present two sampling algorithms, Reservoir Join-Sampling (RJS) and Progressive Reservoir Join-Sampling (PRJS). RJS is designed straightforwardly by using a fixed-size reservoir sampling on a join-sample (i.e., random sample of a join output stream). Anytime the sample in the reservoir is used, RJS always gives a uniform random sample of the original join output stream. With limited memory, however, the available memory may not be large enough even for the join buffer, thereby severely limiting the reservoir size. PRJS alleviates this problem by increasing the reservoir size during the join-sampling 1. This increasing is possible since the memory requirement by the join-sampling algorithm decreases over time. A larger reservoir provides a closer representation of the original join output stream. However, it comes with a negative impact on the probability of the sample being uniform. Through experiments we examine the tradeoffs and compare the two algorithms in terms of the aggregation error on the reservoir sample.