ppxscal/embedding_network huggingface dataset:
DEMON: Mining and Monitoring Evolving Data
Authors: Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishnan
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Data mining algorithms have been the focus of much research recently. In practice, the input data to a data mining process resides in a large data warehouse whose data is kept up-to-date through periodic or occasional addition and deletion of blocks of data. Most data mining algorithms have either assumed that the input data is static, or have been designed for arbitrary insertions and deletions of data records. In this paper, we consider a dynamic environment that evolves through systematic addition or deletion of blocks of data. We introduce a new dimension, called the data span dimension, which allows user-defined selections of a temporal subset of the database. Taking this new degree of freedom into account, we describe efficient model maintenance algorithms for frequent itemsets and clusters. We then describe a generic algorithm that takes any traditional incremental model maintenance algorithm and transforms it into an algorithm that allows restrictions on the data span dimension. We also develop an algorithm for automatically discovering a specific class of interesting block selection sequences. In a detailed experimental study, we examine the validity and performance of our ideas on synthetic and real datasets.
Computer Science in Japanese Universities
Authors: David Notkin, Richard D. Schlichting, James R. Larus
Venue: Computer (1993)

It is argued that despite associating Japan with high technology, most Western scientists know little about computer science in Japan. Many factors contribute to this phenomenon, including language and cultural differences, a shortage of readily available information, and a degree of technical chauvinism. On the basis of observations made during sabbaticals in Japan, the authors provide an informal portrait of computer science in Japanese universities in the hope that enhanced awareness and increased interaction will result. They look specifically at departmental structure, faculty career paths, the student population, and research activity.
Sensory-Augmented Computing: Wearing the Museum's Guide
Venue: IEEE Micro (2001)

A wearable computing device that perceives its surroundings and presents multimedia information through a heads-up display can behave like an intelligent assistant to fulfill the promise of personal computing.
Unified Interprocedural Parallelism Detection
Authors: Jay P. Hoeflinger, Yunheung Paek, Kwang Yi
Venue: International Journal of Parallel Programming (2001)

In this paper, we outline a new way of detecting parallelism interprocedurally within a program. Our method goes beyond mere dependence testing, to embrace methods of removing dependences as well, namely privatization, induction recognition and reduction recognition. This method is based on a combination of techniques: a &ldquo;universal&rdquo; form for representing memory accesses within a section of code (the Linear Memory Access Descriptor), a technique for classifying memory locations based on the accesses made to them by the code (Memory Classification Analysis), and a dependence test (the Access Region Test). The analysis done with Linear Memory Access Descriptors is based on an intersection operation, for which we present an algorithm. Linear Memory Access Descriptors are independent of any declarations that may exist in a program, so they are subroutine- and language-independent. This makes them ideal for use in interprocedural analysis. Our experiments indicate that this test is highly effective for parallelizing loops containing very complex subscript expressions.
Techniques and Systems for Image and Video Retrieval
Authors: Y. Alp Aslandogan, Clement T. Yu
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Storage and retrieval of multimedia has become a requirement for many contemporary information systems. These systems need to provide browsing, querying, navigation, and, sometimes, composition capabilities involving various forms of media. In this survey, we review techniques and systems for image and video retrieval. We first look at visual features for image retrieval such as color, texture, shape, and spatial relationships. The indexing techniques are discussed for these features. Nonvisual features include captions, annotations, relational attributes, and structural descriptions. Temporal aspects of video retrieval and video segmentation are discussed next. We review several systems for image and video retrieval including research, commercial, and World Wide Web-based systems. We conclude with an overview of current challenges and future trends for image and video retrieval.
When to Test Less
Authors: Tim Menzies, Bojan Cukic
Venue: IEEE Software (2000)

The authors argue that, for many small-scale projects, a small number of randomly selected tests will adequately probe the software. They discuss how a program's shape can help determine whether rapid testing with limited resources will be as effective as elaborate and expensive testing regimes.
Collaborative environments as border agents
Authors: Eunice R. Young
Venue: ACM SIGGROUP Bulletin (2000)

What information do entities within an enterprise need to share in order to be considered collaborating? How do those entities make decisions? Is this process one that can be captured and implemented in software or stored for future learning? These questions are typical of those asked at the onset of process modeling or for gathering user requirements, but recent work at the US/Mexico border to understand import/export procedures cast them in a new framework. A more critical question may be how does an organization, as typified by their culture, perceive and therefore manage technology?Cultural differences in software development are not always as easily perceived as those at an international border, yet they are just as strong. On one hand, there are "code jocks" that feel that developing software is intensely personal and should not be constrained by a pre-defined process. On the other, "process weenies" that test and accept software for corporate use and wish for order and consistency in how we develop our products. Who is right? They both are. A challenge to collaborative environments is managing the expectations of both. 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
Adaptive data parallel methods for ecosystem monitoring
Authors: Charles J. Turner, Jennifer G. Turner
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Biological diversity is decreasing at an alarming rate worldwide. Improved ecosystem monitoring can help detect problems in time to intervene. Earth orbiting satellites, collecting terabytes of imagery daily, can support effective monitoring of many habitats. Data parallelism is ideal for many automated image analysis algorithms, but less natural for the complex spatial structure of most ecosystems. This paper presents a coarse-to-fine processing framework based on a set of spatial transformations, that compact disconnected regions to achieve more efficient nested data parallelism. Experiments with a montane island ecosystem in southeast Arizona use Landsat TM data to characterize the processing framework, the spatial transformations, and the feature extraction algorithms.
An Introduction to Object-Oriented Programming with Java, 2nd edition
Authors: C. Thomas Wu
Venue:  (2003)

:This is an introductory text for beginners with no background in programming. The text teaches students how to write object-oriented programs. The book covers both Java applets and applications. Students will learn the fundamentals of object-oriented programming through the use of predefined objects supplied with the book. By using these predefined objects,the students will learn both the concepts of object-oriented programming and also how to later design their own objects by example. Students will learn how to define their own objects and how to develop programs using object-oriented design methodology. In addition,students will learn modern programming topics such as event-driven and GUI (Graphic User Interface) programming.
Geometric Description of Vakonomic and Nonholonomic Dynamics. Comparison of Solutions
Authors: J. Cortés, M. de León, D. Martínde Diego, S. Martínez
Venue: SIAM Journal on Control and Optimization (2002)

We treat the vakonomic dynamics with general constraints within a new geometric framework, which can be useful in the study of optimal control problems. We compare our formulation with the one of Vershik and Gershkovich in the case of linear constraints. We show how nonholonomic mechanics also admits a new geometrical description which allows us to develop an algorithm of comparison between the solutions of both dynamics. Examples illustrating the theory are treated.
Rule-Induction and Case-Based Reasoning: Hybrid Architectures Appear Advantageous
Authors: Nick Cercone, Aijun An, Christine Chan
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Researchers have embraced a variety of machine learning (ML) techniques in their efforts to improve the quality of learning programs. The recent evolution of hybrid architectures for machine learning systems has resulted in several approaches that combine rule-induction methods with case-based reasoning techniques to engender performance improvements over more-traditional one-representation architectures. We briefly survey several major rule-induction and case-based reasoning ML systems. We then examine some interesting hybrid combinations of these systems, and explain their strengths and weaknesses as learning systems. We present a balanced approach to constructing a hybrid architecture, along with arguments in favor of this balance and mechanisms for achieving a proper balance. Finally, we present some initial empirical results from testing our ideas and draw some conclusions based on those results.
An hp-Analysis of the Local Discontinuous Galerkin Method for Diffusion Problems
Authors: Ilaria Perugia, Dominik Schötzau
Venue: Journal of Scientific Computing (2002)

We present an hp-error analysis of the local discontinuous Galerkin method for diffusion problems, considering unstructured meshes with hanging nodes and two- and three-dimensional domains. Our estimates are optimal in the meshsize h and slightly suboptimal in the polynomial approximation order p. Optimality in p is achieved for matching grids and polynomial boundary conditions.
Symbolic algebra and timing driven data-flow synthesis
Authors: Armita Peymandoust, Giovanni De Micheli
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

The growing market of multi-media applications has required the development of complex ASICs with significant data-path portions. Unfortunately, most high-level synthesis tools and methods cannot automatically synthesize data paths such that complex arithmetic library blocks are intelligently used. Symbolic computer algebra has been previously used to automate mapping data flow into a minimal set of complex arithmetic components. In this paper, we present extensions to the previous methods in order to find the minimal critical path delay (CPD) mapping. A new algorithm is proposed that incorporates symbolic manipulations such as tree-height-reduction, factorization, expansion, and Horner transformation. Such manipulations are used as guidelines in initial library element selection. Furthermore, we demonstrate how substitution can be used for multi-expression component sharing and critical path delay optimization.
Goal-Directed Evaluation of Binarization Methods
Authors: Øivind Due Trier, Anil K. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This paper presents a methodology for evaluation of low-level image analysis methods, using binarization (two-level thresholding) as an example. Binarization of scanned gray scale images is the first step in most document image analysis systems. Selection of an appropriate binarization method for an input image domain is a difficult problem. Typically, a human expert evaluates the binarized images according to his/her visual criteria. However, to conduct an objective evaluation, one needs to investigate how well the subsequent image analysis steps will perform on the binarized image. We call this approach goal-directed evaluation, and it can be used to evaluate other low-level image processing methods as well. Our evaluation of binarization methods is in the context of digit recognition, so we define the performance of the character recognition module as the objective measure. Eleven different locally adaptive binarization methods were evaluated, and Niblack¿s method gave the best performance.
Approximation algorithms for the covering Steiner problem
Authors: Goran Konjevod, R. Ravi, Aravind Srinivasan
Venue: Random Structures Algorithms (2002)

The covering Steiner problem is a generalization of both the k-MST and the group Steiner problems: given an edge-weighted graph, with subsets of vertices called the groups, and a nonnegative integer value (called the requirement) for each group, the problem is to find a minimum-weight tree spanning at least the required number of vertices of every group. When all requirements are equal to 1, this becomes the group Steiner problem, while if there is only one group which contains all vertices of the graph the problem reduces to k-MST with k equal to the requirement of this unique group. We discuss two different (but equivalent) linear relaxations of the problem for the case when the given graph is a tree and construct polylogarithmic approximation algorithms based on randomized LP rounding of these relaxations. By using a probabilistic approximation of general metrics by tree metrics due to Bartal, our algorithms also solve the covering Steiner problem on general graphs with a further polylogarithmic worsening in the approximation ratio.
A Computation Method for Providing Statistical Performance Guarantee to an ATM Switch1
Authors: Joseph Kee-Yin Ng, Shibin Song, Bihai Tang
Venue: Real-Time Systems (2002)

ATM is a connection-oriented technology and messages are divided into fixed size packet called cells to facilitate communications. However, before two hosts can communicate, a connection has to be established between them. Consider a real-time communication application running on top of an ATM network. In order to provide the real-time service, we require the network to provide a performance guarantee for the connection. There are two types of performance guarantees: deterministic and statistical guarantees. While a deterministic guarantee provides an absolute bound on the worst case cell delay experienced in an ATM switch, a statistical guarantee provides a probabilistic bound on the worst case cell delay. In this paper, we use a self-similar stochastic process to characterize the arrival of the real-time traffic. Extending from our previous work on deterministic delay guarantee, we provide methods for determinating the statistical delay bound for the worst case cell delay in an ATM switch with various output port controllers. We conclude this paper with two case studies: one based on ordinary LAN traffic and one on the variable bit-rate MPEG video transmission of the movie &ldquo;Star Wars&rdquo;. To show the effectiveness of our statistical delay guarantee, we compare it with the delay derived by Cruz as well as the actual cell delay determined by the two traffic traces.
Synthesis of Circuits with Low-Cost Concurrent Error Detection Based on Bose-Lin Codes
Authors: Debaleena Das, Nur A. Touba
Venue: Journal of Electronic Testing: Theory and Applications (1999)

This paper presents a procedure for synthesizing sequential machines with concurrent error detection based on Bose-Lin codes. Bose-Lin codes are an efficient solution for providing concurrent error detection as they are separable codes and have a fixed number of check bits, independent of the number of information bits. Furthermore, Bose-Lin code checkers have a simple structure as they are based on modulo operations. Procedures are described for synthesizing circuits in a way that their structure ensures that all single-point faults can only cause errors that are detected by a Bose-Lin code. This paper presents an efficient scheme for concurrent error detection in sequential circuits with no constraint on the state encoding. Concurrent error detection for both the state bits and the output bits is based on a Bose-Lin code and their checking is combined such that one checker suffices. Results indicate low area overhead. The cost of concurrent error detection is reduced significantly compared to other methods based on other codes.
Parasitic Authentication To Protect Your E-Wallet
Authors: Tim Ebringer, Peter Thorne, Yuliang Zheng
Venue: Computer (2000)

The electronic wallet (e-wallet) has received much attention lately. It promises to consolidate many of the personal items carried around by the modern individual: wallet, phone, pager, diary, and keys. In fact, Nokia's 9001 Communicator already combines the phone, pager, and diary into one unit. The question arises, however, of how to provide user authentication. Traditional protection mechanisms require users to enter a PIN or password every time they wish to perform a transaction. More sophisticated techniques include using a biometric device, such as a fingerprint scanner, which is integrated into the e-wallet. Both of these options have disadvantages. Usability problems due to authentication are a significant barrier to the adoption of e-wallets. In this article, the authors present some uses of existing protocols whereby a concealable, wireless, and portable device can temporarily act as an authentication proxy for the user. The e-wallet then becomes a parasite-feeding off the small device for required authentication and identification information. Parasitic authentication attempts to provide handheld computers with security without reducing convenience.
Spectral method for constrained linear-quadratic optimal control
Authors: Hussein Jaddu
Venue: Mathematics and Computers in Simulation (2002)

A computational method based on Chebyshev spectral method is presented to solve the linear-quadratic optimal control problem subject to terminal state equality constraints and state-control inequality constraints. The method approximates each of the system state variables and each of the control variables by a finite Chebyshev series of unknown parameters. The method converts the optimal control problem into a quadratic programming problem which can be solved more easily than the original problem. This paper gives explicit results that simplify the implementation of the method. To show the numerical behavior of the proposed method, the simulation results of an example are presented.
How to Staff Business-Critical Maintenance Projects
Authors: Ramkumar Ramaswamy
Venue: IEEE Software (2000)

A maintenance project's team size depends on the rate at which maintenance requests arrive and the importance of servicing each request quickly. The author presents a five-step method for staffing maintenance projects based on this idea. The method uses results from a queuing model that are presented as a lookup table for ease of use. This result is then refined using experiential and qualitative inputs to yield a useful and practical staffing estimate. The author illustrates the method using data from an actual project.
Matrix integrals and the counting of tangles and links
Authors: P. Zinn-Justin, J.-B. Zuber
Venue: Discrete Mathematics (2002)

Using results on the counting of planar Feynman diagrams derived in matrix models, recent results of Sundberg and Thistlethwaite on the counting of alternating tangles and links are reproduced.
Does Open Source Improve System Security?
Authors: Brian Witten, Carl Landwehr, Michael Caloyannides
Venue: IEEE Software (2001)

Most commercial software producers guard access to the source code of their systems, making it difficult for anyone outside their organizations to apply a variety of measures that could potentially improve system security. But since an attacker could also examine public source code to find flaws, would source code access be a net gain or loss for security? The question goes beyond the technical issues involved because publishing source code reveals intellectual property and therefore affects the producer's business model. We consider this question from several perspectives and tentatively conclude that having source code available should on balance work in favor of system security.
Reducing Iteration Time When Result Digit is Zero for Radix 2 SRT Division and Square Root with Redundant Remainders
Authors: P. Montuschi, L. Ciminiera
Venue: IEEE Transactions on Computers (1993)

A new architecture is presented for shared radix 2 division and square root whose main characteristic is the ability to avoid any addition/subtraction, when the digit 0 has been selected. The solution presented uses a redundant representation of the partial remainder, while keeping the advantages of classical solutions. It is shown how the next digit of the result can be selected even when the remainder is not updated, and the subsequent tradeoff is presented. The proposed architecture is also extended in order to consider other implementations.
Chain: A Delay-Insensitive Chip Area Interconnect
Authors: John Bainbridge, Steve Furber
Venue: IEEE Micro (2002)

The increasing complexity of system-on-a-chip designs exposes the limits imposed by the standard synchronous bus. the authors propose a mixed system as a solution.
A Specification-Driven Architectural Design Environment
Authors: Oryal Tanir, Vinod K. Agarwal, P. C. P. Bhatt
Venue: Computer (1995)

In this paper we describe a support environment for architectural level design exploration and rapid prototyping of telecommunication systems. DASE is a design analysis and synthesis environment that accepts design descriptions in a Design Specification Language (DSL) and evolves it into a hardware and software system. Design space exploration is achieved through selections from pre-defined, generic, DSL library modules as templates. The design is validated by simulations. Yet at another level DASE supports behavioral synthesis by generating corresponding VHDL output. While only one case study is presented here, a table is given depicting a range of other studies carried out. A library supported environment can be reconfigured by an appropriate substitution of its library to cater to a different end-application. To that extent DASE is a domain independent framework.