ppxscal/embedding_network huggingface dataset:
Video retrieval using spatio-temporal descriptors
Authors: Daniel DeMenthon, David Doermann
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

This paper describes a novel methodology for implementing video search functions such as retrieval of near-duplicate videos and recognition of actions in surveillance video. Videos are divided into half-second clips whose stacked frames produce 3D space-time volumes of pixels. Pixel regions with consistent color and motion properties are extracted from these 3D volumes by a threshold-free hierarchical space-time segmentation technique. Each region is then described by a high-dimensional point whose components represent the position, motion and, when possible, color of the region. In the indexing phase for a video database, these points are assigned labels that specify their video clip of origin. All the labeled points for all the clips are stored into a single binary tree for efficient $k$-nearest neighbor retrieval. The retrieval phase uses video segments as queries. Half-second clips of these queries are again segmented to produce sets of points, and for each point the labels of its nearest neighbors are retrieved. The labels that receive the largest numbers of votes correspond to the database clips that are the most similar to the query video segment. We illustrate this approach for video indexing and retrieval and for action recognition. First, we describe retrieval experiments for dynamic logos, and for video queries that differ from the indexed broadcasts by the addition of large overlays. Then we describe experiments in which office actions (such as pulling and closing drawers, taking and storing items, picking up and putting down a phone) are recognized. Color information is ignored to insure independence to people's appearance. One of the distinct advantages of using this approach for action recognition is that there is no need for detection or recognition of body parts.
Several remarks on acceleration of convergence using generalized linear methods of summability
Authors: Ivar Tammeraid
Venue: Journal of Computational and Applied Mathematics (2003)

Some acceleration theorems for generalized linear summability methods A = (Ank), where Ank are linear bounded operators from Banach space (B-space) X into B-space Y are derived. These results are proved by the method of summability with given rapidity. For this purpose some problems of summability with given rapidity are discussed.
Estimating focus of attention based on gaze and sound
Authors: Rainer Stiefelhagen, Jie Yang, Alex Waibel
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

Estimating a person's focus of attention is useful for various human-computer interaction applications, such as smart meeting rooms, where a user's goals and intent have to be monitored. In work presented here, we are interested in modeling focus of attention in a meeting situation. We have developed a system capable of estimating participants' focus of attention from multiple cues. We employ an omnidirectional camera to simultaneously track participants' faces around a meeting table and use neural networks to estimate their head poses. In addition, we use microphones to detect who is speaking. The system predicts participants' focus of attention from acoustic and visual information separately, and then combines the output of the audio- and video-based focus of attention predictors. We have evaluated the system using the data from three recorded meetings. The acoustic information has provided 8% error reduction on average compared to using a single modality.
Being playful: learning from children
Authors: Alan Dix
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

This paper explores children's understanding as a resource and inspiration for interface design and beyond. From children we can understand innate intelligences and skills, including a sense of number and the nature of play. Play is possibly one of the origins of imagination, which in turn is essential for our own creative thought. Surprisingly few adults engage in creative play, but it is when adult-like rationality and child-like imagination meet that we can best produce effective and innovative solutions. Even writing a paper has aspects of playfulness, such as the puzzle of phrasing an abstract in exactly one hundred words... or so.
The Scalability Problem
Authors: Dean Macri
Venue: Queue (2004)

Back in the mid-1990s, I worked for a company that developed multimedia kiosk demos. Our biggest client was Intel, and we often created demos that appeared in new PCs on the end-caps of major computer retailers such as CompUSA. At that time, performance was in demand for all application classes from business to consumer. We created demos that showed, for example, how much faster a spreadsheet would recalculate (you had to do that manually back then) on a new processor as compared with the previous year’s processor. The differences were immediately noticeable to even a casual observer—and it mattered. Having to wait only 10 seconds for something that previously took 20 or more was a major improvement and led many consumers and businesses to upgrade their PCs.
IT Employment Prospects in 2004: A Mixed Bag
Authors: Fred Niederman
Venue: Computer (2004)

Since 1999--when US business magazine cover stories described IT positions going unfilled and extensive congressional lobbying to increase quotas for overseas workers to fill them the US IT job market has changed drastically, losing more than a million jobs. For US workers, this change raisestwo different but complementary questions. First, what are the prospects for the global IT workforce in the near and longer term? Second, how will IT jobs be distributed among competing labor markets around the world?
SharpSpider: Spidering the Web through Web Services
Authors: Ken Moody, Marco Palomino
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

Web search engines have become an indispensable utility for Internet users. In the near future, however, Web search engines will not only be expected to provide quality search results, but also to enable applications to search and exploit their index repositories directly. We present here SharpSpider, a distributed, C# spider designed to address the issues of scalability, decentralisation and continuity of a Web crawl. Fundamental to the design of SharpSpider is the publication of an API for use by other services on the network. Such an API grants access to a constantly refreshed index built after successive crawls of the Web.
Performance Model of an Optical Switch using Fiber Delay Lines for Resolving Contentions
Authors: Ayman G. Fayoumi, Anura P. Jayasumana
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

The performance of an optical switch that handles contentionresolution using a fiber delay line (FDL) is modeledand evaluated. We propose using a simple optical bufferthat contains only a single FDL for contention resolution.The analytical model derived for the performance of anoptical switch based on this buffer is verified using simulations.The analytical model can be utilized with bothpacket and burst switching schemes to characterize the performanceof switches augmented with this FDL architecture.
Using Predeclaration for Efficient Read-Only Transaction Processing in Wireless Data Broadcast
Authors: SangKeun Lee, Chong-Sun Hwang, Masaru Kitsuregawa
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

Wireless data broadcast allows a large number of users to retrieve data simultaneously in mobile databases, resulting in an efficient way of using the scarce wireless bandwidth. However, the efficiency of data access methods is limited by an inherent property that data can only be accessed strictly sequentially by users. To properly cope with the inherent property, this paper presents three predeclaration-based transaction processing methods that yield a significant performance improvement in wireless data broadcast.
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
Authors: Jianer Chen, Iyad A. Kanj
Venue: Journal of Computer and System Sciences (2003)

Motivated by the research in reconfigurable memory array structures, this paper studies the complexity and algorithms for the constrained minimum vertex cover problem on bipartite graphs (NIN-CVCB) defined as follows: given a bipartite graph G = (V, E) with vertex bipartition V = U ∪ L and two integers ku and kl, decide whether there is a minimum vertex cover in G with at most ku vertices in U and at most kl vertices in L. It is proved in this paper that the MIN-CVCB problem is NP-complete. This answers a question posed by Hasan and Liu. A parameterized algorithm is developed for the problem, in which classical results in matching theory and recently developed techniques in parameterized computation theory are nicely combined and extended. The algorithm runs in time O(1.26ku + kl + (ku + kl) |G|) and significantly improves previous algorithms for the problem.
Visiome: neuroinformatics research in vision project
Authors: Shiro Usui
Venue: Neural Networks (2003)

The coordinated efforts within Japan's Neuroinformatics Research in Vision (NRV) program to build a neuroinformatics portal for vision science in Japan, the 'Visiome' (Vision + Ome) Platform is presented. We introduce the general concepts underlying of the NRV Project and an example of a specific neuroinformatics study on the vertebrate retina, as developed in Visiome.
The Use of Wavelets in the Operator Expansion Method for Time-Dependent Acoustic Obstacle Scattering
Authors: Maria Cristina Recchioni, Francesco Zirilli
Venue: SIAM Journal on Scientific Computing (2003)

We present a generalization of the "operator expansion method" developed in [Mecocci et al., J. Acoust. Soc. Amer., 107 (2000), pp. 1825--1840]. Let $\Omega\subset{\bf R}^3$ be a bounded simply connected domain with locally Lipschitz boundary $\partial\Omega$. The boundary $\partial\Omega$ is characterized by a given boundary acoustic impedance not necessarily constant. The operator expansion method has been used to solve the exterior boundary value problem for the Helmholtz equation in ${\bf R}^3\setminus\Omega$ via a "perturbative series." This perturbative series is built using two auxiliary "reference" surfaces $\partial\Omega_c$ and $\partial\Omega_r$. The new formulation proposed here involves more general reference surfaces, and a more general choice of the coordinate system used to build the expansion than the choices in the Mecocci et al. article. Dense linear systems must be solved to compute the terms of the perturbative series associated with the operator expansion. These linear systems are large in cases of practical interest; however, an expansion reference surface well suited to the wavelet transform can be appropriately chosen. A suitable basis of wavelets [G. Beylkin, R. R. Coifman, and V. Rokhlin, Comm. Pure. Appl. Math., 44 (1991), pp. 141--183] is used. The use of this basis reduces the solution of the dense linear systems mentioned above to the solution of very sparse linear systems. The numerical method obtained combining these ideas to solve the exterior boundary value problem for the Helmholtz equation is very well suited for parallel computation and is a practical tool for solving the time-dependent scattering problem when the wave equation with suitable conditions is considered. We show some numerical experiments obtained using a parallel implementation of the computational method proposed. The speed-up factor obtained as a function of the number of processors used in the computation is shown. In the numerical experiments "realistic" objects are considered. The numerical results obtained are discussed from both qualitative and quantitative points of view.
Generalized multipartitioning of multi-dimensional arrays for parallelizing line-sweep computations
Authors: Alain Darte, John Mellor-Crummey, Robert Fowler, Daniel Chavarría-Miranda
Venue: Journal of Parallel and Distributed Computing (2003)

Multipartitioning is a strategy for decomposing multi-dimensional arrays into tiles and mapping the resulting tiles onto a collection of processors. This class of partitionings enables efficient parallelization of "line-sweep" computations that solve one-dimensional recurrences along each dimension of a multi-dimensional array. Multipartitionings yield balanced parallelism for line sweeps by assigning each processor the same number of data tiles to compute at each step of a sweep along any array dimension. Also, they induce only coarse-grain communication.This paper considers the problem of computing generalized multipartitionings, which decompose d-dimensional arrays, d ≥ 2, onto an arbitrary number of processors. We describe an algorithm that computes an optimal multipartitioning onto all of the processors for this general case. We use a cost model to select the dimensionality of the best partitioning and the number of cuts to make along each array dimension; then, we show how to construct a mapping that assigns the resulting data tiles to each of the processors. The assignment of tiles to processors induced by this class of multipartitionings corresponds to an instance of a latin hyper-rectangle, a natural extension of latin squares, which have been widely studied in mathematics and statistics.Finally, we describe how we extended the Rice dHPF compiler for High Performance Fortran to generate code that employs our strategy for generalized multipartitioning and show that the compiler's generated code for the NAS SP computational fluid dynamics benchmark achieves scalable high performance.
Determining radii of meromorphy via orthogonal polynomials on the unit circle
Authors: D. Barrios Rolanía, G. López Lagomasino, E. B. Saff
Venue: Journal of Approximation Theory (2003)

Using a convergence theorem for Fourier-Padé approximants constructed from orthogonal polynomials on the unit circle, we prove an analogue of Hadamard's theorem for determining the radius of m-meromorphy of a function analytic on the unit disk and apply this to the location of poles of the reciprocal of Szegö functions.
A machine learning method for extracting symbolic knowledge from recurrent neural networks
Authors: A. Vahed, C. W. Omlin
Venue: Neural Computation (2004)

Neural networks do not readily provide an explanation of the knowledge stored in their weights as part of their information processing. Until recently, neural networks were considered to be black boxes, with the knowledge stored in their weights not readily accessible. Since then, research has resulted in a number of algorithms for extracting knowledge in symbolic form from trained neural networks. This article addresses the extraction of knowledge in symbolic form from recurrent neural networks trained to behave like deterministic finite-state automata (DFAs). To date, methods used to extract knowledge from such networks have relied on the hypothesis that networks' states tend to cluster and that clusters of network states correspond to DFA states. The computational complexity of such a cluster analysis has led to heuristics that either limit the number of clusters that may form during training or limit the exploration of the space of hidden recurrent state neurons. These limitations, while necessary, may lead to decreased fidelity, in which the extracted knowledge may not model the true behavior of a trained network, perhaps not even for the training set. The method proposed here uses a polynomial time, symbolic learning algorithm to infer DFAs solely from the observation of a trained network's input-output behavior. Thus, this method has the potential to increase the fidelity of the extracted knowledge.
Existence Verification for Higher Degree Singular Zeros of Nonlinear Systems
Authors: R. Baker Kearfott, Jianwei Dian
Venue: SIAM Journal on Numerical Analysis (2003)

Finding approximate solutions to systems of n nonlinear equations in n real variables is a much studied problem in numerical analysis. Somewhat more recently, researchers have developed numerical methods to provide mathematically rigorous error bounds on such solutions. (We say that we "verify" existence of the solution within those bounds on the variables.) However, when the Jacobi matrix is singular at the solution, no computational techniques to verify existence can handle the general case. Nonetheless, computational verification that one or more solutions exists within a region in complex space containing the real bounds is possible by computing the topological degree. In a previous paper, we presented theory and algorithms for the simplest case, when the rank-defect of the Jacobian matrix at the solution is 1 and the topological index is 2. Here, we generalize that result to arbitrary topological index $d\ge2$: We present theory, algorithms, and experimental results. We also present a heuristic for determining the degree, obtaining a value that we can subsequently verify with our algorithms. Although execution times are slow compared to corresponding bound verification processes for nonsingular systems, the order with respect to system size is still cubic.
Relying Party Credentials Framework
Authors: Amir Herzberg, Yosi Mass
Venue: Electronic Commerce Research (2004)

We present architecture for a relying-party to manage credentials, and in particular to map different credentials into common format and semantics. This will allow use of simple, widely available credentials as well as more advanced credentials such as public key certificates, attribute certificates and &lsquo;negative&rsquo; credentials (which result in reduced trust) such as certificate revocation lists (CRL). The core of the architecture is a Credential Manager who collects credentials, and maps them to common format and semantics.
Computing all integer solutions of a genus 1 equation
Authors: R. J. Stroeker, N. Tzanakis
Venue: Mathematics of Computation (2003)

The elliptic logarithm method has been applied with great success to the problem of computing all integer solutions of equations of degree 3 and 4 defining elliptic curves. We extend this method to include any equation f(u,v) = 0, where f ∈ Z[u,v] is irreducible over oQ, defines a curve of genus 1, but is otherwise of arbitrary shape and degree. We give a detailed description of the general features of our approach, and conclude with two rather unusual examples corresponding to equations of degree 5 and degree 9.
P for pragmatic: a note relating to Beck's concern for work place democracy, arguing for IT design skills to become part of public education
Authors: Ellen Christiansen
Venue: Scandinavian Journal of Information Systems (2003)

It is argued that both the demand on professional IT designers to be able to live democracy and the demand on IT end users to be able to design presents a challenge to the public educational system: IT design skills have to become part of the common standard curriculum!
An integrated layout system for sea-of-gates module generation
Authors: P. Duchene, M. Declercq, S. M. Kang
Venue: Proceedings of the conference on European design automation (1991)

This paper presents a sea-of-gates layout system able to design medium-size logic circuits in a true channelless fashion. The methodology relies on flexible leaf cell generation, systematic cell terminal abutment, a global routing scheme using integer linear programming methods, and a step-wise compaction-rerouting refinement. Modules up to several hundred transistors have been laid out compactly with more than 80% transistor utilization with two layers of metal. With top-down hierarchy, those modules can be used as macrocells.
Proceedings of the 35th SIGCSE technical symposium on Computer science education
Venue: Technical Symposium on Computer Science Education (2004)

Each year, the SIGCSE Symposium represents a most exciting time for computing educators. This year's event continues that wonderful tradition with a wide array of talks, sessions, workshops, exhibits, and opportunities for dialog.Congratulations to Mordechai Ben-Ari, winner of SIGCSE's Award for Contributions to Computer Science Education, and to Bruce Klein, winner of SIGCSE's Award for Lifetime Service! Many, many thanks for the entire SIGCSE 2004 Committee for its marvelous work in putting so many pieces together! Special thanks go to Daniel Joyce and Deborah Knox for their outstanding leadership as Symposium Co-Chairs. This annual event requires leaders with insight, creativity, dedication, organizational ability, collaborative skill, and considerable hard work, and these leaders have done an outstanding job. Special thanks also to Wanda Dann and Thomas Naps as Program Co-chairs for their terrific leadership, energy, sense of balance, and communicative abilities in shaping the record number of session proposals into a rich and varied program.These Proceedings represent a stimulating guide for attendees to the Symposium. I welcome conference participants to this energizing event where you will attend sessions, catch up with old friends, and meet new colleagues.These Proceedings also represent a great resource for all SIGCSE members, with thought-provoking papers, descriptions, and references. Happy reading to all! Even with this event upon us, it is worthwhile to look ahead to coming activities. SIGCSE is a vibrant and growing organization due to the contributions of all its members, and I encourage you to participate in events and to help SIGCSE develop even further. Every three years, SIGCSE elects officers to help guide the organization. The next election will take place this spring, and in March or April SIGCSE members should receive by mail information on an outstanding list of candidates. I encourage all SIGCSE members to vote! Each summer, SIGCSE sponsors a European conference. This year, please join us June 28-30, 2004, at ITiCSE 2004 at the University of Leeds, England. For more details, please see http://www.iticse04.leeds.ac.uk/
Clustering intrusion detection alarms to support root cause analysis
Authors: Klaus Julisch
Venue: ACM Transactions on Information and System Security (TISSEC) (2003)

It is a well-known problem that intrusion detection systems overload their human operators by triggering thousands of alarms per day. This paper presents a new approach for handling intrusion detection alarms more efficiently. Central to this approach is the notion that each alarm occurs for a reason, which is referred to as the alarm's root causes. This paper observes that a few dozens of rather persistent root causes generally account for over 90&percnt; of the alarms that an intrusion detection system triggers. Therefore, we argue that alarms should be handled by identifying and removing the most predominant and persistent root causes. To make this paradigm practicable, we propose a novel alarm-clustering method that supports the human analyst in identifying root causes. We present experiments with real-world intrusion detection alarms to show how alarm clustering helped us identify root causes. Moreover, we show that the alarm load decreases quite substantially if the identified root causes are eliminated so that they can no longer trigger alarms in the future.