ppxscal/embedding_network huggingface dataset:
Support of Decision Making by Business Intelligence Tools
Authors: Milena Tvrdikova
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

Issues of business intelligence applications are discussed. Main parts of business intelligence tools are briefly described. The attention is paid to the data warehouses and to a new tool in this field, to the operational data stores. These technologies enable to get the data of first-rate quality. Some new features of operational data stores' applications are proposed. The role of users in the design of metadata is explained and its influence on the efficiency of information systems is emphasized. Business intelligence tools are the necessary conditions for applications of data mining, an efficient tool for getting new information from large datasets.
Efficient indexing for strongly similar subimage retrieval
Authors: Gerhard Roth, William Scott
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

Strongly similar subimages contain different views of the same object. In subimage search, the user selects an image region and the retrieval system attempts to find matching subimages in an image database that are strongly similar. Solutions have been proposed using salient features or "interest points that have associated descriptor vectors. However, searching large image databases by exhaustive comparison of interest point descriptors is not feasible. To solve this problem, we propose a novel off-line indexing scheme based on the most significant bits (MSBs) of these descriptors. On-line search uses this index file to limit the search to interest points whose descriptors have the same MSB value, a process up to three orders of magnitude faster than exhaustive search. It is also incremental, since the index file for a union of a group of images can be created by merging the index files of the individual image groups. The effectiveness of the approach is demonstrated experimentally on a variety of image databases.
On-line signature verification algorithm incorporating pen position, pen pressure and pen inclination trajectories
Authors: D. Sakamoto
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

A new algorithm is proposed for pen-input on-line signature verification incorporating pen-position, pen-pressure and pen-inclinations trajectories. Preliminary experimental result looks encouraging.
Scale and performance in the CoBlitz large-file distribution service
Authors: KyoungSoo Park, Vivek S. Pai
Venue: Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3 (2006)

Scalable distribution of large files has been the area of much research and commercial interest in the past few years. In this paper, we describe the CoBlitz system, which efficiently distributes large files using a content distribution network (CDN) designed for HTTP. As a result, CoBlitz is able to serve large files without requiring any modifications to standard Web servers and clients, making it an interesting option both for end users as well as infrastructure services. Over the 18 months that CoBlitz and its partner service, CoDeploy, have been running on PlanetLab, we have had the opportunity to observe its algorithms in practice, and to evolve its design. These changes stem not only from observations on its use, but also from a better understanding of their behavior in real-world conditions. This utilitarian approach has led us to better understand the effects of scale, peering policies, replication behavior, and congestion, giving us new insights into how to better improve their performance. With these changes, CoBlitz is able to deliver in excess of 1 Gbps on PlanetLab, and to outperform a range of systems, including research systems as well as the widely-used BitTorrent.
Basic Training for Digital Artists in the Texas A&M Visualization Program
Authors: Vinod Srinivasan, Donald House, Mary Saslow, Carol LaFayette
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

We provide an overview of the Master of Science in Visualization Sciences program offered at Texas A&M University. Central to this program is the intermixing of concepts, students, and faculty from art, computer science, architecture, and engineering. We explain the structure of the curriculum, and then focus on a detailed analysis of foundation courses that have been designed to make it possible for students from such diverse backgrounds to share the same advanced coursework. Illustrations are drawn from a number of examples of student project work in these foundation courses. We present practical guidelines for those seeking to implement similar courses in their programs.
Speeding Up Effect-Cause Defect Diagnosis Using a Small Dictionary
Authors: Wei Zou, Wu-Tung Cheng, Sudhakar M. Reddy, Huaxing Tang
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

In this paper we present a new technique to speed up the effect-cause defect diagnosis by using a dictionary of very small size. In the proposed method, a dictionary of small size is used to reduce the number of events (gate evaluations) during the simulation of failing patterns and also a procedure to select a subset of passing patterns for simulation. Although the dictionary size is smaller, experimental results show speed up of effect-cause diagnosis by up to 156X. Experimental results from industrial designs validate the effectiveness of the proposed method.
2007 Special Issue: Nonlinear analog predictor analysis: A coupled neural network/analog model for climate downscaling
Authors: Alex J. Cannon
Venue: Neural Networks (2007)

Synoptic downscaling models are used in climatology to predict values of weather elements at one or more stations based on values of synoptic-scale atmospheric circulation variables. This paper presents a hybrid method for climate prediction and downscaling that couples an analog, i.e., k-nearest neighbor, model to an artificial neural network (ANN) model. In the proposed method, which is based on nonlinear principal predictor analysis (NLPPA), the analog model is embedded inside an ANN, forming its output layer. Nonlinear analog predictor analysis (NLAPA) is a flexible model that maintains the ability of the analog model to preserve inter-variable relationships and model non-normal and conditional variables (such as precipitation), while taking advantage of NLPPA's ability to define an optimal set of analog predictors that maximize predictive performance. Performance on both synthetic and real-world hydroclimatological benchmark tasks indicates that the NLAPA model is capable of outperforming other forms of analog models commonly used in synoptic downscaling.
A statistical complexity measure and its applications to the analysis of heart rate variability
Authors: W. J. Pei
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Statistical complexity measures are proposed as general indicators of structure or correlation. Lopez-Ruiz (1995) introduced another measure of statistical complexity C/sub LMC/ that, like others, satisfies the boundary conditions of vanishing in the extreme ordered and disordered limits. Feldman examined some properties of C/sub LMC/ and found that it is neither an intensive nor extensive thermodynamic variable, and proposed a simple alteration of C/sub LMC/ that renders it extensive. However the remedy results in a quantity that is a trivial function of the entropy density and hence of no use as a measure of structure or memory. We alter the disequilibrium term by the information of time irreversibility (information of nonlinear dynamics) and present a novel statistical complexity measure which is used to quantify the complexity caused by nonlinear dynamics. This statistical complexity measure allows reliable detection of periodic, quasi-periodic, linear stochastic and chaotic dynamics. When applied to the analysis of heart rate data, correlational structure in heart rate series is found, and the estimated statistical complexity appears to be correlated with different cardiac dynamics.
A class of stochastic resonance systems for signal processing applications
Authors: H. C. Papadopoulos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

The class of stochastic resonance systems based on M-level quantizer maps is developed. We derive expressions for the output invariant density and autocorrelation function of these maps when they are driven by a square wave in noise. These systems are shown to provide signal-to-noise ratio enhancement and robustness to noise characteristics. These properties render the quantizer maps potentially appealing for a wide range of signal processing applications such as interference suppression and robust communication. A framework for the analysis of more general discrete-time stochastic resonance systems is also presented, which is based on approximating these systems via quantizer maps.
Joint anti-diagonalization for blind source separation
Authors: A. Belouchrani
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We address the problem of blind source separation of non-stationary signals of which only instantaneous linear mixtures are observed. A blind source separation approach exploiting both auto-terms and cross-terms of the time-frequency (TF) distributions of the sources is considered. The approach is based on the simultaneous diagonalization and anti-diagonalization of spatial TF distribution matrices made up of, respectively, auto-terms and cross-terms. Numerical simulations are provided to demonstrate the effectiveness of the proposed approach and compare its performances with existing TF-based methods.
The Effect of Individual Needs, Trust and Identification in Explaining Participation Intentions in Virtual Communities
Authors: Juan Juan Han, Raymond Jun Zheng, Yunjie Xu
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper studied individuals' intentions to participate in virtual communities. In order to assess what influences participation intentions, we studied individual-based factors (members' social needs and self expression needs), trust and identification. We found that although needs deficiency-based motivation theory is useful to explain participation intentions, trust and identification play an important moderating role.
Independent component analysis applied to digital image watermarking
Authors: F. J. Gonzalez-Serrano
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The authors propose a new solution to the watermarking of digital images. This approach uses independent component analysis (ICA) to project the image into a basis with its components as statistically independent as possible. The watermark is then introduced in this representation of the space. Thus, the change of basis is the key of the steganography problem. The algorithm applied to the fragile watermarking problem locates any change in the image since it also applies to the watermark. The problem of robust watermarking is also addressed from this new point of view. Some results are included to illustrate the method.
Ring-Based Virtual Private Network Supporting a Large Number of VPNs
Authors: Osamu Honda, Hiroyuki Ohsaki, Makoto Imase, Kazuhiro Matsuda
Venue: Proceedings of the Sixth International Conference on Networking (2007)

In this paper, we propose a simple but effective VPN mechanism called RING-VPN (Ring-based Virtual Private Network) that realizes a high scalability in terms of the number of VPNs. The key idea of our RING-VPN is to logically connect nodes in a ring topology for minimizing the number of IPsec tunnels. In our RING-VPN, each VPN node operates autonomously, making VPNs robust even in case of node and/or link failures. We also quantitatively evaluate the performance of our RING-VPN using mathematical analysis. We derive several important performance metrics of RING-VPN, such as VPN construction time, and VPN recovery time, as well as user-level performance metrics, such as minimum TCP throughput, round-trip time and packet loss probability. Furthermore, we validate our analysis by comparing numerical examples with simulation results. Through several numerical examples, we quantitatively demonstrate effectiveness of our RING-VPN in several network configurations.
Predictable Paging in Real-Time Systems: A Compiler Approach
Authors: Isabelle Puaut, Damien Hardy
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

Conventionally, the use of virtual memory in real-time systems has been avoided, the main reason being the difficulties it provides to timing analysis. However, there is a trend towards systems where different functions are implemented by concurrent processes. Such systems need spatial separation between processes, which can be easily implemented via the use of the Memory Management Unit (MMU) of commercial processors. In addition, some systems have a limited amount of physical memory available. So far, attempts to provide real-time address spaces have focused on the predictability of virtual to physical address translation and do not implement demand-paging. In this paper we propose a compiler approach to introduce a predictable form of paging, in which page-in and page-out points are selected at compile-time. The problem under study can be formulated as a graph coloring problem, as in register allocation within compilers. Since the graph coloring problem is NP-complete for more than three colors, we define a heuristic, which in contrast to those used for register allocation, aim at minimizing worst-case performance instead of average-case performance. Experimental results applied on tasks code show that predictability does not come at the price of performance loss as compared to standard (dynamic) demand paging.
Understanding and addressing blocking-induced network server latency
Authors: Yaoping Ruan, Vivek Pai
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

We investigate the origin and components of network server latency under various loads and find that filesystem-related kernel queues exhibit head-of-line blocking, which leads to bursty behavior in event delivery and process scheduling. In turn, these problems degrade the existing fairness and scheduling policies in the operating system, causing requests that could have been served in memory, with low latency, to unnecessarily wait on disk-bound requests. While this batching behavior only mildly affects throughput, it severely degrades latency. This problem manifests itself in fairness and service quality degradation, a phenomenon we call service inversion. We show a portable solution that avoids these problems without kernel or filesystem modifications, We modify two different Web servers to use this approach, and demonstrate a qualitatively different change in their latency profiles, generating more than an order of magnitude reduction in latency. The resulting systems are able to serve most requests without being tied to disk performance, and they scale better with improvements in processor speed. These results are not dependent on server software architecture, and can be profitably applied to experimental and production servers.
Detecting Patch Submission and Acceptance in OSS Projects
Authors: Christian Bird, Alex Gourley, Prem Devanbu
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

The success of open source software (OSS) is completely dependent on the work of volunteers who contribute their time and talents. The submission of patches is the major way that participants outside of the core group of developers make contributions. We argue that the process of patch submission and acceptance into the codebase is an important piece of the open source puzzle and that the use of patch-related data can be helpful in understanding how OSS projects work. We present our methods in identifying the submission and acceptance of patches and give results and evaluation in applying these methods to the Apache webserver, Python interpreter, Postgres SQL database, and (with limitations) MySQL database projects. In addition, we present valuable ways in which this data has been and can be used.
Industry University Government Roundtable for Enhancing Engineering Education
Authors: T. Okiishi
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Summary form only given. The Industry University Government Roundtable for Enhancing Engineering Education (IUGREEE) evolved from Boeing Company university workshops beginning in 1994 into a national group of company, university and government representatives. IUCREEE sponsors national workshops and leads initiatives related to improving engineering education. The affiliated companies, engineering colleges, and government units involved are held together by a Memorandum of Understanding (MOU) signed by appropriate unit leaders. The MOU serves as an agreement in principle to cooperate in addressing major issues identified by studies sponsored by the American Society for Engineering Education (ASEE), National Research Council (NRC), and others. A unique aspect of the IUGREEE is that it is industry led. 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
Liquid simulation on lattice-based tetrahedral meshes
Authors: Nuttapong Chentanez, Bryan E. Feldman, François Labelle, James F. O'Brien, Jonathan R. Shewchuk
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

We describe a method for animating incompressible liquids with detailed free surfaces. For each time step, semi-Lagrangian contouring computes a new fluid boundary (represented as a fine surface triangulation) from the previous time step's fluid boundary and velocity field. Then a mesh generation algorithm called isosurface stuffing discretizes the region enclosed by the new fluid boundary, creating a tetrahedral mesh that grades from a fine resolution at the surface to a coarser resolution in the interior. The mesh has a structure, based on the body centered cubic lattice, that accommodates graded tetrahedron sizes but is regular enough to aid efficient point location and to save memory used to store geometric properties of identical tetrahedra. Although the mesh is warped to conform to the liquid boundary, it has a mathematical guarantee on tetrahedron quality, and is generated very rapidly. Each successive time step entails creating a new triangulated liquid surface and a new tetrahedral mesh. Semi-Lagrangian advection computes velocities at the current time step on the new mesh. We use a finite volume discretization to perform pressure projection required to enforce the fluid's incompressibility, and we solve the linear system with algebraic multigrid. A novel thickening scheme prevents thin sheets and droplets of liquid from vanishing when their thicknesses drop below the mesh resolution. Examples demonstrate that the method captures complex liquid motions and fine details on the free surfaces without suffering from excessive volume loss or artificial damping.
Quantized discrete cosine transform: a combination of DCT and scalar quantization
Authors: Khanh Nguyen-Phi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

A typical MPEG-2 video encoder requires that DCT and quantization be performed in most cases. In this paper we show how to combine these two steps, reducing substantially the number of computations. The new nonlinear transform is called the quantized discrete cosine transform, or QDCT. We also introduce a new method to trade-off the computational complexity and the precision of the QDCT. Although the QDCT is independent of the input data, better trade-offs can be obtained by making it data dependent, which is appropriate in multimedia applications such as MPEG-2 video coding. The results presented in this paper can also be extended to other linear transforms and/or other coding methods.
A freshman programming course: two challenging sets of students, one solution
Authors: J. L. Murtagh
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

This paper identifies two categories of students who pose a significant teaching challenge in a college freshman programming class, and then discusses one effective way to improve their performance. The most challenging students are those who do not readily adopt a systematic approach to software development. These students tend to fall into two categories: (a) The High School "Hackers"; (b) The Haphazard "Never-Evers" High School Hackers do not use (and might not acknowledge the value of) a systematic approach to software development. Haphazard Never-Evers have trouble adhering to the systematic approach they are trying to learn. Providing these students with a one-page summary which includes the steps of a structured software development methodology-enhanced by detailed instructions for writing the source code-is a very effective way to help them learn and adhere to the systematic approach so critical to their success.
Dynamic Class-based Control for Improving Perceived Voice Quality
Authors: Yan Bai
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Traditional network-level Quality of Service (QoS) techniques are efficient from a network perspective, but they have not provided a QoS that is satisfactory to users. This paper proposes a Dynamic Class-based scheme to enhance user-perceived voice quality. Its main strength lies in its careful consideration of users' perception of quality and mapping it to specific values of multiple network parameters such as delay and packet loss rate. It then dynamically assigns higher priority to voice traffic that are closer to delay and loss tolerance so as to improve their chances of meeting deadlines and loss constraints, which in turn increases the quality of voice traffic transmission over IP network yielding QoS satisfaction both for VoIP users and service providers.
eduComponents: a component-based e-learning environment
Authors: Mario Amelung, Michael Piotrowski, Dietmar Rösner
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

We present the eduComponents, a component-based approach to e-learning system architecture. In contrast to typical "integrated" platforms, the eduComponents are implemented as extension modules for a general-purpose content management system (CMS). The components can be used individually, together, and in combination with other modules. The use of a general-purpose (i.e., note-learning-specific) CMS means that a single platform can be used for e-learning and other Web content, providing the advantages of a uniform user interface, reduced system administration overhead, and extensive code reuse.