ppxscal/embedding_network huggingface dataset:
Movies and Actors: Mapping the Internet Movie Database
Authors: Bruce W. Herr, Weimao Ke, Elisha Hardy, Katy Borner
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper presents the results of an analysis and visualization of 428,440 movies from the Internet Movie Database (IMDb) provided for the Graph Drawing 2005 contest. Simple statistics are presented as well as a tapestry of all movies with an overlay of the giant component of the co-actor network. Academy award winners are highlighted. Major insights are discussed.
Algorithm 867: QUADLOG&mdash;a package of routines for generating Gauss-related quadrature for two classes of logarithmic weight functions
Authors: Nelson H. F. Beebe, James S. Ball
Venue: ACM Transactions on Mathematical Software (TOMS) (2007)

A collection of subroutines and examples of their uses are described for the quadrature method developed in the companion article. These allow the exact evaluation (up to computer truncation and rounding errors) of integrals of polynomials with two general types of logarithmic weights, and also with the corresponding nonlogarithmic weights. The recurrence coefficients for the related nonclassical orthogonal polynomials with logarithmic weight functions can also be obtained. Tests of accuracy on various platforms are presented. The routines are usable from Fortran, C, and C&plus;&plus; programs conforming to any of at least six international programming-language standards.
Book Review: An Authentic Breakthrough
Authors: Arturo Ortiz-Tapia
Venue: IEEE Distributed Systems Online (2006)

A review of Computer Viruses and Malware by John Aycock
A Projection-Based Approach to General-Form Tikhonov Regularization
Authors: Misha E. Kilmer, Per Christian Hansen, Malena I. Espan&tilde;ol
Venue: SIAM Journal on Scientific Computing (2007)

We present a projection-based iterative algorithm for computing general-form Tikhonov regularized solutions to the problem $\min_x\{\| Ax-b \|_2^2+\lambda^2\| Lx \|_2^2\}$, where the regularization matrix $L$ is not the identity. Our algorithm is designed for the common case where $\lambda$ is not known a priori. It is based on a joint bidiagonalization algorithm and is appropriate for large-scale problems when it is computationally infeasible to transform the regularized problem to standard form. By considering the projected problem, we show how estimates of the corresponding optimal regularization parameter can be efficiently obtained. Numerical results illustrate the promise of our projection-based approach.
Knowledge Management in Decision Making: Instance-Based Cognitive Mapping
Authors: Natalie M. Steiger, David M. Steiger
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Knowledge management deals with explicit knowledge and tacit (or implicit) knowledge. One form of tacit knowledge is an individual's mental model-a hypothetical knowledge structure that integrates the ideas, assumptions, relationships, insights, facts, and misconceptions that together shape the way an individual views and interacts with reality. The purpose of this paper is to explore these mental models, why they need to be made explicit, and how such externalization can be accomplished. Specifically, after a review of the mental model theory, we propose a new technique for determining an individual's mental model based on his/her decisions in several selected situations within a specific decision domain.
Fingerprint image enhancement using a binary angular representation
Authors: T. R. Randolph
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We explore a novel approach to enhancing fingerprint images using a new binary directional filter bank (DFB). Automated fingerprint identification systems (AFIS) are used to classify a fingerprint in a large volume of images. Many approaches to AFIS have been suggested, most sharing in common the idea of extracting discriminate feature representations. As part of that process, the raw fingerprints are often smoothed, converted to binary and thinned. Conventional directional methods, which have been used successfully in the past, provide representations that delineate the directional components in the fingerprint image enabling separation, and enhancement. Our binary DFB receives a binary input and outputs a binary image set comprised of directional components. Through proper weighting and manipulation of the subbands, specific features within the fingerprint can be enhanced. We propose a new enhancement approach that remains in the binary domain for the entire process. This paper provides a description of a new binary DFB and its application to fingerprint pre-processing.
Dynamic learning based scan chain diagnosis
Authors: Yu Huang
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Scan chain defect diagnosis is important to silicon debug and yield enhancement. Traditional simulation-based chain diagnosis algorithms may take long run time if a large number of simulations are required. In this paper, a novel dynamic learning based scan chain diagnosis is proposed to speedup the diagnosis run time. Experimental results illustrate that by using the proposed dynamic learning techniques, the diagnosis run time can be reduced about 10Xon average.
Explicit control a batch-aware distributed file system
Authors: John Bent, Douglas Thain, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Miron Livny
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

We present the design, implementation, and evaluation of the Batch-Aware Distributed File System (BAD-FS), a system designed to orchestrate large, I/O-intensive batch workloads on remote computing clusters distributed across the wide area. BAD-FS consists of two novel components: a storage layer that exposes control of traditionally fixed policies such as caching, consistency, and replication; and a scheduler that exploits this control as necessary for different workloads. By extracting control from the storage layer and placing it within an external scheduler, BAD-FS manages both storage and computation in a coordinated way while gracefully dealing with cache consistency, fault-tolerance, and space management issues in a workload-specific manner. Using both microbenchmarks and real workloads, we demonstrate the performance benefits of explicit control, delivering excellent end-to-end performance across the wide-area.
Pose-Invariant 3D Object Recognition Using Linear Combination of 2D Views and Evolutionary Optimisation
Authors: Vasileios Zografos, Bernard F. Buxton
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

In this work, we present a method for model-based recognition of 3d objects from a small number of 2d intensity images taken from nearby, but otherwise arbitrary viewpoints. Our method works by linearly combining images from two (or more) viewpoints of a 3d object to synthesise novel views of the object. The object is recognised in a target image by matching to such a synthesised, novel view. All that is required is the recovery of the linear combination parameters, and since we are working directly with pixel intensities, we suggest searching the parameter space using an evolutionary optimisation algorithm in order to efficiently recover the optimal parameters and thus recognise the object in the scene.
Reflections on teaching discrete math for the first time
Authors: Peter B. Henderson
Venue: ACM SIGCSE Bulletin (2007)

You may recall that the guest authors for the last Math CountS column were Rachelle DeCoste and Kevin L. Huggins, United States Military Academy at West Point. Rachelle and Kevin were each teaching, for the first time, a section of discrete mathematics for cadets majoring in computer science. Their contribution, "Teaching Discrete Math for the First Time" described their thoughts and methods of preparing to teach this course for the Fall 2006 team. That was to be the first of two columns they will be contributing --- before and after. Well, the "after" column was a bit longer than anticipated, so they have submitted it as a regular SIGCSE inroads paper entitled "Reflections on Teaching Discrete Math for the First Time". Please look for it in this issue, and I hope you will take some time to read the article. You will find it very interesting and informative.
Division of a Region into Equal Areas Using Additively Weighted Power Diagrams
Authors: Takashi Ohyama
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

In this paper, we apply an additively weighted power diagram to divide a region such that the area of influence of public facilities is equalized in order to achieve equality. The weights of the power diagram were changed using Newton's method in order to divide the region into equal areas and obtain its weights and partitions such that the areas are equal.
Effective e-Government Process Monitoring and Interoperation: A Case Study on the Removal of Unauthorized Building Works in Hong Kong
Authors: Jenny Y. Y. Wong, Dickson K. W. Chiu, Kai Pan Mark
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Recent advances in information and communication technologies (ICT) have redefined citizens' expectations of the government and its services. Prompted by citizens' demand for a more responsive government, public sector has been grappling with how best to utilize ICT to deliver public services. This paper analyzes the existing workflow arrangement for the removal of unauthorized building works in Hong Kong and proposes to improve the performance of e-government process monitoring and interoperation through more efficient inter-organizational collaboration by deployment of Web services and alert management. The process interoperation requirements are defined in a uniform Event-Condition-Action Rule format for workflow interoperation and exception handling. We have proposed to use an Alert Management System (AMS) to monitor urgent and important tasks to ensure that they have been properly attended. The progress of the whole process is monitored to ensure timeliness of services.
Distributed and Collaborative Soft Computing: An Emerging Development Environment
Authors: Witold Pedrycz
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

There is a rapidly emerging need to deal with distributed sources of data (sensors, web sites, databases). By recognizing their limited accessibility while acknowledging benefits of pursuing collaborative processing, we propose a concept of a distributed and collaborative framework of Computational Intelligence (CI). The variety of possible mechanisms of interaction is organized into a setting of the C^3 (communication -- collaboration -- consensus) paradigm. This helps us offer taxonomy of various schemes of interaction which in the sequel leads to a suite of detailed algorithms. The role of granular information and granular computing in the establishing the mechanisms of interaction is emphasized and investigated.
Reasoning about Cryptographic Protocols in Observational Theories
Authors: Imen Zaabar, Narjes Berregeb
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

A lot of models have been applied to the analysis of cryptographic protocols. Some of them formalize security properties as reachability and some others express them as observational equivalences. In this paper, our intent is to present the main ideas for reasoning about cryptographic protocols in the framework of observational theories. We model protocols by Term Rewriting systems and express secrecy and authentication properties by observational equivalences, in a way close to spi-calculus [3].
Grid Web Services Facilitating Access to Vocational Training for Job Rotation
Authors: Nikolaos V. Karadimas, Alessandra Orsoni, Nikolaos P. Papastamatiou
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

The paper presents how the Grid/Web Services architecture can constitute a knowledge Grid that will facilitate access to vocational training courses in the framework of a job-rotation e-service implementing the job-rotation model. The Job-Rotation e-service is an integrated on-line system that links training policy with employment policy. On one hand it supports Enterprises to find the proper training for their employees and on the other it supports them to find adequate unemployed resources to replace their own while on training. All involved parties benefit from this rotation. The main problem of the job rotation e-service, and generally of systems providing information on vocational training, is the lack of up to date information on running courses due to large administrative costs. The Grid /Web Services solution can solve these problems by providing accurate information, directly from the organizations who offer the courses, and reducing administrative costs for the job rotation e-service.
Reconfigurable platform design for wireless protocol processors
Authors: Tim Tuan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Low-energy protocol processing is a crucial issue in next generation wireless systems. In modern wireless system design, this problem is tightly coupled with the signal processing needs. Fierce market competition and inventive wireless applications are imposing stricter design requirements in energy consumption, cost, size, and flexibility. To deal with these unique constraints, we incorporate the platform-based design methodology to deal with these constraints by advocating reusability. This paper presents this methodology, and its application on PicoRadio, a cutting-edge wireless system. In particular, we describe the design of a reconfigurable architecture optimized for protocol processing.
Towards a unified theory of spoken language processing
Authors: R. K. Moore
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

Spoken language processing is arguably the most sophisticated behavior of the most complex organism in the known universe and, unsurprisingly, scientists still have much to learn about how it works. Meanwhile, automated spoken language processing systems have begun to emerge in commercial applications, not as a result of any deep insights into the way in which humans process language, but largely as a consequence of the introduction of a 'data-driven' approach to building practical systems. At the same time, computational models of human spoken language processing have begun to emerge but, although this has given rise to a greater interest in the relationship between human and machine behavior, the performance of the best models appears to be asymptoting some way short of the capabilities of the human listener/speaker. This paper discusses these issues, and presents an argument in favor of the derivation of a 'unifying theory' that would be capable of explaining and predicting both human and machine spoken language processing behavior, and hence serve both communities as well as representing a long-term 'grand challenge' for the scientific community in the emerging field of 'cognitive informatics'.
An Integrated Methodology for the Verification of Directory-Based Cache Protocols
Authors: Fong Pong, Michel Dubois
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

The complexity of directory based protocols has motivated us to build a hardware emulator or testbed for the rapid prototyping of various protocols under various memory consistency models for CC-NUMA architectures. To implement and verify new protocols rapidly on the testbed, we have developed an overall methodology around a set of tools applicable to different aspects of the verification of a protocol, i.e., protocol-intrinsic errors, memory access ordering errors and protocol implementation errors. These tools include formal verification techniques, architecture simulators and hardware mechanisms implemented in the FPGAs of the testbed.
Single frame image super-resolution: should we process locally or globally?
Authors: C. V. Jiji, Subhasis Chaudhuri, Priyam Chatterjee
Venue: Multidimensional Systems and Signal Processing (2007)

In this paper we study the usefulness of different local and global, learning-based, single-frame image super-resolution reconstruction techniques in handling three specific tasks, namely, de-blurring, de-noising and alias removal. We start with the global, iterative Papoulis---Gerchberg method for super-resolving a scene. Next we describe a PCA-based global method which faithfully reproduces a super-resolved image from a blurred and noisy low resolution input. We also study several multi-resolution processing schemes for super-resolution where the best edges are learned locally from an image database. We show that the PCA-based global method is efficient in handling blur and noise in the data. The local methods are adept in capturing the edges properly. However, both local and global approaches cannot properly handle the aliasing present in the low resolution observation. Hence we propose an alias removal technique by designing an alias-free upsampling scheme. Here the unknown high frequency components of the given partially aliased (low resolution) image is generated by minimizing the total variation of the interpolant subject to the constraint that part of alias free spectral components in the low resolution observation are known precisely and under the assumption of sparsity in the data.
When conset meets synset: a preliminary survey of an ontological lexical resource based on Chinese characters
Authors: Shu-Kai Hsieh, Chu-Ren Huang
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

This paper describes an on-going project concerning with an ontological lexical resource based on the abundant conceptual information grounded on Chinese characters. The ultimate goal of this project is set to construct a cognitively sound and computationally effective character-grounded machine-understandable resource. Philosophically, Chinese ideogram has its ontological status, but its applicability to the NLP task has not been expressed explicitly in terms of language resource. We thus propose the first attempt to locate Chinese characters within the context of ontology. Having the primary success in applying it to some NLP tasks, we believe that the construction of this knowledge resource will shed new light on theoretical setting as well as the construction of Chinese lexical semantic resources.
Staircase Connected Sets
Authors: Evelyn Magazanik, Micha A. Perles
Venue: Discrete Computational Geometry (2007)

A compact set $S \subset {\Bbb R}^2$ is staircase connected if every two points $a,b \in S$ can be connected by a polygonal path with sides parallel to the coordinate axes, which is both x-monotone and y-monotone. $\xi(a,b)$ denotes the smallest number of edges of such a path. $\xi(\cdot,\cdot)$ is an integer-valued metric on S. We investigate this metric and introduce stars and kernels. Our main result is that the r-th kernel is nonempty, compact and staircase connected provided $r \ge \frac{1}{2} \cdot {\it stdiam}(S) +1$.
Rotation invariant multiresolution texture classification
Authors: Hamid Soltanian-Zadeh, Farshad Fotouhi
Venue:  (2006)

Texture analysis is an important issue in image processing with many applications including medical imaging, remote sensing, content-based image retrieval, and document segmentation. Over the last three decades, texture analysis has been widely studied and many techniques have been proposed in the literature. Ideally, texture analysis should be invariant to rotation. However, many of the proposed techniques assume that texture has the same orientation, which is not always the case. In this thesis, two new rotation invariant texture classification techniques using Radon and wavelet transforms are proposed. The first technique utilizes the Radon transform to convert the rotation to translation and then applies a translation invariant wavelet transform to the result to extract texture features. A k-nearest neighbors (k-NN) classifier is employed to classify texture patterns. A method to find the optimal number of projections for the Radon transform is proposed. It is shown that the extracted features generate an efficient orthogonal feature space. It is also shown that the proposed features extract both of the local and directional information of the texture patterns. The proposed method is robust in the presence of additive white noise as a result of summing pixel values to generate projections in the Radon transform step. The second proposed technique benefits from the fact that most of the texture patterns either have directionality (anisotropic textures) or are not with a specific direction (isotropic textures). The wavelet energy features of the directional textures change significantly when the image is rotated. However, for the isotropic images, the wavelet features are not sensitive to rotation. Therefore, for the directional textures it is essential to calculate the wavelet features along a specific direction. In the proposed approach, the Radon transform is first employed to detect the principal direction of the texture. Then, the texture is rotated to place its principal direction at 0&deg;. A wavelet transform is applied to the rotated image to extract texture features. This approach provides a features space with small intra-class variability and therefore good separation between different classes. The performances of the proposed methods are evaluated using three data sets of textures. Experimental results show the superiority of the proposed approaches and their robustness to additive white noise compared with some recent texture classification methods.
Surviving to Errors in Multi-Core Environments
Authors: Xavier Vera, Jaume Abella
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

The continuous shrinkage of CMOS technologies and higher current densities make devices degrade much faster. The great challenge for future technologies is building reliable systems on top of unreliable components, which will degrade and even fail during the normal lifetime of the processor. Devising new approaches so that processors are resilient to lifetime degradation in a transparent manner for the users is crucial to reduce guardbands, and thus, achieve higher performance at lower power cost.