ppxscal/embedding_network huggingface dataset:
Adaptive Caching for Continuous Queries
Authors: Shivnath Babu, Kamesh Munagala, Jennifer Widom, Rajeev Motwani
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

We address the problem of executing continuous multiway join queries in unpredictable and volatile environments. Our query class captures windowed join queries in data stream systems as well as conventional maintenance of materialized join views. Our adaptive approach handles streams of updates whose rates and data characteristics may change over time, as well as changes in system conditions such as memory availability. In this paper we focus specifically on the problem of adaptive placement and removal of caches to optimize join performance. Our approach automatically considers conventional tree-shaped join plans with materialized subresults at every intermediate node, subresult-free MJoins, and the entire spectrum between them. We provide algorithms for selecting caches, monitoring their cost and benefits in current conditions, allocating memory to caches, and adapting as conditions change. All of our algorithms are implemented in the STREAM prototype Data Stream Management System and a thorough experimental evaluation is included.
Optimizing aggregate array computations in loops
Authors: Yanhong A. Liu, Scott D. Stoller, Ning Li, Tom Rothamel
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2005)

An aggregate array computation is a loop that computes accumulated quantities over array elements. Such computations are common in programs that use arrays, and the array elements involved in such computations often overlap, especially across iterations of loops, resulting in significant redundancy in the overall computations. This article presents a method and algorithms that eliminate such overlapping aggregate array redundancies and shows analytical and experimental performance improvements. The method is based on incrementalization, that is, updating the values of aggregate array computations from iteration to iteration rather than computing them from scratch in each iteration. This involves maintaining additional values not maintained in the original program. We reduce various analysis problems to solving inequality constraints on loop variables and array subscripts, and we apply results from work on array data dependence analysis. For aggregate array computations that have significant redundancy, incrementalization produces drastic speedup compared to previous optimizations; when there is little redundancy, the benefit might be offset by cache effects and other factors. Previous methods for loop optimizations of arrays do not perform incrementalization, and previous techniques for loop incrementalization do not handle arrays.
A Method of Security Measurement of the Network Data Transmission
Authors: Hanping Hu, Wenxuan Guo, Baoliang Zhang, Xiang Chen
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18 (2005)

The paper puts forward a method to measure the security of network data transmission as well as determine attack category. Based on the self-similarity of network traffic and fuzzy decision making, the model is constructed to determine the attack category as follows: sample the network traffic with time intervals following Poisson distribution; Divide the obtained data series of traffic into several sub series of equal size, and compute the confidence interval of Hurst parameter for each sub series with Whittle Estimation method; Compare with the confidence intervals of Hurst parameter of known attack traffics, which have already been worked out with the same method, and thereby find out what the unknown attack is. On this basis, we propose an approach of security measurement of the network data transmission. According to the number of times that the routers on the transmission path are attacked, corresponding attack properties and the damage weight value of each attack which suggests the attack's destructivity, quantitative analysis of the security of network transmission can be accomplished. The results of the experiments show that this method not only helps make the policy of network data transmission accurately and efficiently, but also guarantees the security of the network data transmission.
Nonlinear operator integration factor splitting for the shallow water equations
Authors: Amik St-Cyr, Stephen J. Thomas
Venue: Applied Numerical Mathematics (2005)

The purpose of this paper is to explore an alternative to the traditional interpolation based semi-Lagrangian time integrators employed in atmospheric models. A novel aspect of the present study is that operator splitting is applied to a purely hyperbolic problem rather than the incompressible Navier-Stokes equations. The underlying theory of operator integration factor splitting is reviewed and the equivalence with semi-Lagrangian schemes is established. A nonlinear variant of integration factor splitting is proposed where the advection operator is expressed in terms of the relative vorticity and kinetic energy. To preserve stability, a fourth order Runge-Kutta scheme is applied for sub-stepping. An analysis of splitting errors reveals that OIFS is compatible with the order conditions for linear multi-step methods. The new scheme is implemented in a spectral element shallow water model using an implicit second order backward differentiation formula for Coriolis and gravity wave terms. Numerical results for standard test problems demonstrate that much larger time steps are possible.
Augmented disjoint switch boxes for FPGAs
Authors: Hongbing Fan, Yu-Liang Wu, Catherine L. Zhou
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

Disjoint switch boxes have been used in island-style Field Programmable Gate Arrays (FPGAs) such as Xilinx series FPGAs. However, a disjoint switch box is neither hyper-universal (routable for every set of multi-pin net routing requirements, nor universal (routable for every set of 2-pin net routing requirements). In this paper we present a new type of hyper-universal switch box designs, which is constructed from a disjointed switch box by adding a few switches. This type of switch boxes can be easily fabricated and adopted to the existing FPGA designs, and result in a significant improvement on routability.
Video with Ground-Truth for Validation of Visual Registration, Tracking and Navigation Algorithms
Authors: Rustam Stolkin, Alistair Greig, John Gilby
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

A fundamental task in computer vision is that of determining the position and orientation of a moving camera relative to an observed object or scene. Many such visual tracking algorithms have been proposed in the computer vision, artificial intelligence and robotics literature over the past 30 years. Predominantly, these remain unvalidated since the ground-truth camera positions and orientations at each frame in a video sequence are not available for comparison with the outputs of the proposed vision systems. A method is presented for generating real visual test data with complete underlying ground-truth. The method enables the production of long video sequences, filmed along complicated six degree of freedom trajectories, featuring a variety of objects, in a variety of different visibility conditions, for which complete ground-truth data is known including the camera position and orientation at every image frame, intrinsic camera calibration data, a lens distortion model and models of the viewed objects.
BER Performance of Wireless BPSK Communication System in Tunnels With and Without Traffic
Authors: Chien-Hung Chen, Chien-Ching Chiu, Shi-Cheng Hung, Chien-Hung Lin
Venue: Wireless Personal Communications: An International Journal (2004)

The bit error rate (BER) performance for high-speed personal communication service in tunnels with and without traffic is investigated. The impulse responses of tunnels for any transmitter--receiver location are computed by shooting and bouncing ray/image techniques. By using the impulse responses of these multipath channels, the BER performance of BPSK (binary phase shift keying) system with phase and timing recovery circuits are calculated. Numerical results have shown that the multipath effect by the vehicles in the tunnel is an important factor for BER performance. In addition, the effect of space diversity techniques and decision feedback equalizer on mitigating the multipath fading is also investigated.
Reconfigurable Hardware for Addition Chains Based Modular Exponentiation
Authors: Luiza de Macedo Mourelle, Nadia Nedjah
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In several public-key cryptosystems, the main operation consists of the modular exponentiation, which is performed using successive modular multiplications. The size of the operands that are used in these cryptosystems is considerably large (1024 bits), consuming a considerable amount of time. This impacts on the performance of the cryptosystems, specially in real time applications. In order to reduce the execution time in these cryptosystems, the total number of modular multiplications must be reduced. There are several methods that attempt to reduce this number either by partitioning the exponent in windows or by reducing the number of elements to be multiplied. In this paper, we propose a fast and compact reconfigurable hardware for computing modular exponentiation using the additionchain methods.
Clustering Aggregation
Authors: Aristides Gionis, Heikki Mannila, Panayiotis Tsaparas
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

We consider the following problem: given a set of clusterings, find a clustering that agrees as much as possible with the given clusterings. This problem, clustering aggregation, appears naturally in various contexts. For example, clustering categorical data is an instance of the problem: each categorical variable can be viewed as a clustering of the input rows. Moreover, clustering aggregation can be used as a meta-clustering method to improve the robustness of clusterings. The problem formulation does not require a-priori information about the number of clusters, and it gives a naturalway for handlingmissing values. We give a formal statement of the clustering-aggregation problem, we discuss related work, and we suggest a number of algorithms. For several of the methods we provide theoretical guarantees on the quality of the solutions. We also show how sampling can be used to scale the algorithms for large data sets. We give an extensive empirical evaluation demonstrating the usefulness of the problem and of the solutions.
When models cross the border: adapting IT competencies of business managers
Authors: Marius Duedahl, Jostein Andersen, Maung K. Sein
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

Much of the moving beyond the bust to boom has been fuelled by the increasing internationalization of organizations. More and more businesses are becoming global in nature with several US-based firms establishing subsidiaries or partners in other countries. At the same time, information technology (IT) is becoming more ubiquitous and an integral part of business processes. As organizations become increasingly more dependent on IT to survive in competitive environments, the need increases for IT competent business managers. The intersection of these two trends leads to a vital question: how can we use concepts and guidelines related to assessing the IT-competence of business managers that are developed in one country to the context of another country In this paper, we examine this issue by adapting a model of IT competence developed and validated in Canada to the Norwegian context. Using a multi-method approach based on interviews conducted in several organizations, and a questionnaire survey, we made several changes to the model.
Self-configuring components approach to product variant development
Authors: Michele Germani, Ferruccio Mandorli
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2004)

The use of modularity in the design of a new product or the adoption of a product platform, as the base to define new solutions within a product family, offers the company a chance to meet diverse customer needs at low cost because of economies of scale in all phases of the product's life cycle. At present, the concept of modularity in product design is becoming widely used in many industries such as automobiles and consumer electronics. However, if modularity and mass customization have attracted the interest of industries and researchers, the greatest efforts have been focused on the theoretical aspect whereas the related design support technologies have been only partially implemented. In this context, our intent is to develop highly reusable models, which are able to reconfigure themselves on the basis of new functional requirements. The proposed approach is based on the definition of what we call self-configuring components and multiple-level functions. To describe the approach, a practical example related to the design of modules for woodworking machines is reported.
Team projects throughout the curriculum: course management, teaching initiatives and outreach
Authors: Debra L. Smarkusky, Harold H. Smith
Venue: Journal of Computing Sciences in Colleges (2004)

With current undergraduate, computer science and information systems curricula, students graduate with technical skills, but lack the understanding of an organizational structure, a team project experience and the impact of information technology on a global community. We believe the approach to our degree program in Information Sciences and Technology (IST) will benefit students, faculty and industry through academic initiatives and outreach. Students will learn more, retain more and have better communication skills by the use of problem-based learning, team projects, and real-world applications. This paper presents the course management framework, teaching initiatives, and outreach opportunities that evolved from a curriculum that requires team projects in each course.
Bluetooth as an Enabling Technology in Mobile Transactions
Authors: Sojen Pradhan, Elaine Lawrence, Agnieszka Zmijewska
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Mobile Commerce promises to deliver e-commerce services directly into the consumers' hands - anytime, anywhere - using wireless technologies. Applying mobile access to computing creates both tremendous commercial opportunities and complexity, which will make computing globally pervasive and ubiquitous. Customers prefer a choice in the channels through which they do business and the same applies to transactions as well. This paper reports on a project which explored the current state of mobile financial transactions globally using Bluetooth as an enabling technology.
Requirements interaction management in an eXtreme programming environment: a case study
Authors: D. M. Woit
Venue: Proceedings of the 27th international conference on Software engineering (2005)

This work reports experience applying the process of Requirements Interaction Management (RIM) within the context of developing a commercial, internet-based software application in an industrial venue, employing the eXtreme Programming (XP) methodology. We describe our means of managing the interactions -- by extending the standard XP requirements process while maintaining consistency with the principles of XP itself. We outline our rationale for modifying the XP requirements process, and provide a temporal comparison showing that, for this project, modified process is essential to successful application of RIM.
On the Relation Between Dependence and Diversity in Multiple Classifier Systems
Authors: Dechang Chen, Dong Hua, Konstantinos Sirlantzis, Xiaobin Ma
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In this paper we investigate the issues of independence and diversity among individual classifiers participating in a multiple classifier fusion scheme. First we present a formal definition of statistically independent classifiers. Then we focus on testing the independence between two classifiers. Dependence of two classifiers leads to the conclusion that every ensemble of classifiers in which they participate is not an independent scheme. Previous studies have argued that independence of the classifiers infuses diversity in the multi-classifier system, which is directly related to improved performance. Consequently, we introduce a measure for the degree of diversity as expressed by the agreement among the classifiers' outputs in such an ensemble. A number of examples drawn from diverse domains in pattern recognition are also given to illustrate the relation between classifier dependence and diversity estimation. Our results suggest the measurement of the classifiers' decisions agreement as an informative measure of the strength of association among dependent classifiers.
Image Primitive Signatures
Authors: Jason M. Kinser
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Image signatures are generated from the comparison of segments contained within an image to a database of segments collected over a large variety of images. It is impossible to retain all of the segments from all of the images so the segments are clustered becomes an image primitive as each cluster contains a unique set of similar segments. The size of the image signature is NK where N is the number of segments and K is the number of clusters. These numbers are significantly smaller than the dimensions of the image and so a signature is a condensed representation of the contents of the image.
Book review: Philosophical Logic and Artificial Intelligence. Edited by Richmond H. Thomason (Kluwer Academic Publishers, 1989)
Venue: ACM SIGART Bulletin (1990)

This book represents a welcome departure from the past. Many readers in AI avoid looking at books on philosophy and artificial intelligence, at least after seeing one or two of the genre. The reason for this disinterest is aptly captured by Thomason in his introduction to the present volume, which expands on a special issue of the Journal of Philosophical Logic published in 1988.
Exact minkowski sums of convex polyhedra
Authors: Efi Fogel, Dan Halperin
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

We present an exact imp ementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R3. Our implementation is complete in the sense that it does not assume general position, namely, it can handle degenerate input, and produces exact results. Our software also includes applications of the Minkowski-sum computation to answer collision and proximity queries about the relative placement of two convex polyhedra in R3. The algorithms use a dual representation of convex polyhedra,and their implementation is mainly based on the Arrangement package of Cgal the Computational Geometry Algorithm Library. We compare our Minkowski-sum construction with a naïve approach that computes the convex hull of the pairwise sums of vertices of two convex polyhedra.Our method is significantly faster. The video demonstrates the techniques used on simple cases as well as on degenerate cases. The relevant programs, source code, data sets, and documentation are available at http://www.cs.tau.ac.il/~efif/CD Inparticular this site contains a detailed report [3 ]on our algorithms and their implementation including the experimental comparison with the convex-hull approach.
An adjustable algorithm for color quantization
Authors: Zhou Bing, Shen Junyi, Peng Qinke
Venue: Pattern Recognition Letters (2004)

Color quantization is an important technique in digital image processing. Generally it involves two steps. The first step is to choose a proper color palette. The second step is to reconstruct an image by replacing original colors with the most similar palette colors. However a problem exists while choosing palette colors. That is how to choose the colors with different illumination intensities (we call them color layers) as well as the colors that present the essential details of the image. This is an important and difficult problem. In this paper, we propose a novel algorithm for color quantization, which considers both color layers and essential details by assigning weights for pixel numbers and color distances. Also this algorithm can tune the quantization results by choosing proper weights. The experiments show that our algorithm is effective for adjusting quantization results and it also has very good quality of quantization.
Federal Web Site Accessibility for People with Disabilities
Authors: Eleanor T. Loiacono, Scott McCoy, William Chin
Venue: IT Professional (2005)

Although US government entities must make Web sites accessible to people with disabilities, sites really comply. However, most accessibility barriers are fairly easy to resolve.
A 14.6 billion degrees of freedom, 5 teraflops, 2.5 terabyte earthquake simulation on the Earth Simulator
Authors: Dimitri Komatitsch, Seiji Tsuboi, Chen Ji, Jeroen Tromp
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

We use 1944 processors of the Earth Simulator to model seismic wave propagation resulting from large earthquakes. Simulations are conducted based upon the spectral-element method, a high-degree finite-element technique with an exactly diagonal mass matrix. We use a very large mesh with 5.5 billion grid points (14.6 billion degrees of freedom). We include the full complexity of the Earth, i.e., a three-dimensional wave-speed and density structure, a 3-D crustal model, ellipticity as well as topography and bathymetry. A total of 2.5 terabytes of memory is needed. Our implementation is purely based upon MPI, with loop vectorization on each processor. We obtain an excellent vectorization ratio of 99.3%, and we reach a performance of 5 teraflops (30% of the peak performance) on 38% of the machine. The very high resolution of the mesh allows us to perform fully three-dimensional calculations at seismic periods as low as 5 seconds.
SemCast: Semantic Multicast for Content-Based Data Dissemination
Authors: Olga Papaemmanouil, Ugur Cetintemel
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

We address the problem of content-based dissemination of highly-distributed, high-volume data streams for stream-based monitoring applications and large-scale data delivery. Existing content-based dissemination approaches commonly rely on distributed filtering trees that require filtering at all brokers on the tree. We present a new semantic multicast approach that eliminates the need for content-based filtering at interior brokers and facilitates fine-grained control over the construction of efficient dissemination trees. The central idea is to split the incoming data streams (based on their contents, rates, and destinations) and then spread the pieces across multiple channels, each of which is implemented as an independent dissemination tree. We present the basic design and evaluation of SemCast, an overlay-network based system that implements this semantic multicast approach. Through a detailed simulation study and realistic network topologies, we demonstrate that SemCast significantly improves the efficiency of dissemination compared to traditional approaches.