ppxscal/embedding_network huggingface dataset:
Approximation orders of shift-invariant subspaces of W2s(Rd)
Authors: Olga Holtz, Amos Ron
Venue: Journal of Approximation Theory (2005)

We extend the existing theory of approximation orders provided by shift-invariant subspaces of L2 to the setting of Sobolev spaces, provide treatment of L2 cases that have not been covered before, and apply our results to determine approximation order of solutions to a refinement equation with a higher-dimensional solution space.
Privacy in e-commerce: stated preferences vs. actual behavior
Authors: Bettina Berendt, Oliver Günther, Sarah Spiekermann
Venue: Communications of the ACM (2005)

In times of ubiquitous electronic communication and increasing industry pressure for standard electronic authentication, the maintenance of privacy, or "the right to be left alone" becomes a subject of increasing concern. The possibility of a "transparent human," whose vital information is up for grabs, can most easily be envisioned in the realm of e-commerce, due in part to the large amounts of data available, and in part to the high payoffs expected from using this data for marketing purposes.
An Improved Low Computation Cost User Authentication Scheme for Mobile Communication
Authors: Chia-Yin Lee, Chu-Hsing Lin, Chin-Chen Chang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Most of existing user authentication schemes require high computation cost of exponentiation operations for the purpose of security. However, it is not suitable for mobile devices. In this article, we propose a low computation cost user authentication scheme for mobile communication. Our scheme uses only one-way hash functions and smart cards and can be implemented efficiently. The proposed scheme not only resolves the weakness appeared in existing methods but also suits for mobile communication.
Web data cleansing for information retrieval using key resource page selection
Authors: Yiqun Liu, Canhui Wang, Min Zhang, Shaoping Ma
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

With the page explosion of WWW, how to cover more useful information with limited storage and computation resources becomes more and more important in web IR research. Using web page non-content feature analysis, we proposed a clustering-based method to select high quality pages from the whole page set. Although the result page set contains only 44.3% of the whole collection, it is related with more than 98% of links and covers about 90% of key information. Link property and retrieval affects are also observed and experiment results show that key resource selection method is more suitable for the job of data cleansing and the result page set outperforms the whole collection by smaller size and better retrieval performance.
A critical and integrated view of the yeast interactome: Research Articles -- November 2004&ndash;January 2005
Authors: Michael Cornell, Norman W. Paton, Stephen G. Oliver
Venue: Comparative and Functional Genomics (2004)

Global studies of protein&ndash;protein interactions are crucial to both elucidating gene function and producing an integrated view of the workings of living cells. High-throughput studies of the yeast interactome have been performed using both genetic and biochemical screens. Despite their size, the overlap between these experimental datasets is very limited. This could be due to each approach sampling only a small fraction of the total interactome. Alternatively, a large proportion of the data from these screens may represent false-positive interactions. We have used the Genome Information Management System (GIMS) to integrate interactome datasets with transcriptome and protein annotation data and have found significant evidence that the proportion of false-positive results is high. Not all high-throughput datasets are similarly contaminated, and the tandem affinity purification (TAP) approach appears to yield a high proportion of reliable interactions for which corroborating evidence is available. From our integrative analyses, we have generated a set of verified interactome data for yeast. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Structure from Motion using SIFT Features and the PH Transform with Panoramic Imagery
Authors: Mark Fiala
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Omni-directional sensors are useful in obtaining a 360° field of view of a scene for robot navigation, scene modeling, and telepresence.A method is presented to recover 3D scene structure and camera motion from a sequence of multiple images captured by an omnidirectional catadioptric camera.This 3D model is then used to localize other panoramic images taken in the vicinity.This goal is achieved by tracking the trajectories of SIFT keypoints, and finding the path they travel by utilizing a Hough Transform technique modified for panoramic imagery. This technique is applied to spatio-temporal feature extraction in the three-dimensional space of an image sequence, as that scene points trace a horizontal line trajectory relative to the camera. SIFT (Scale Invariant Feature Transform) keypoints are distinctive image features which can be identified between images invariant to scale and rotation. Together these methods are applied to reconstruct a three-dimensional model from a sequence of panoramic images, where the panoramic camera was translating in a straight line horizontal path.Only the camera/mirror geometry is known a priori.The camera positions and the world model is determined, up to a scale factor.Experimental results of model building and camera localization using this model are shown.
Distributed Artificial Neural Network Architectures
Authors: David Calvert, Jiawen Guan
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

The computational cost of training Artificial Neural Network (ANN) algorithms limits the use of large systems capable of processing complex problems. Implementing ANNs on a parallel or distributed platform to improve performance is therefore desirable. This work illustrates a method to predict and evaluate the performance of distributed ANN algorithms by analyzing the performance of the comparatively simple mathematical operations which are used to construct the ANN. The ANN algorithms are divided into simple components: matrix and vector multiplication, matrix processed through a function, competition in a matrix. These basic operational parts are examined individually and it is demonstrated that the computation processes of distributed Neural Networks can be derived from the composition of these basic operations. Three popular network architectures are examined: Multi-Layer Perceptrons withBack-Propagation learning, Self-Organizing Map, and Radial Basis Functions network.
Approaches to self-assessment of computer science departments and programs
Authors: Adel M. Abunawass, Barbara Boucher Owens, Laura Baker, Meledath Damodaran, Deborah Whitfield, Frances Bailie
Venue: Journal of Computing Sciences in Colleges (2004)

Colleges are struggling with the increasing demand for more assessment of programs and departments. This panel will address the approaches that several diverse institutions are taking to meet that challenge. The panelists will describe the development, design, and implementation of program assessment in the various institutions. The panelists will also share their experiences with regard to the effectiveness of the various program assessment approaches. The panelists will discuss and respond to questions of the audience as well as solicit the audience for input on the topic.
Shape Localization Based on Statistical Method Using Extended Local Binary Pattern
Authors: Xiangsheng Huang, Stan Z. Li, Yangsheng Wang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Accurate localization of representative points of a face is crucial to many face analysis and synthesis problems. Active Shape Model (ASM) is a powerful statistical tool for face alignment. However, it suffers from variations of pose, illumination and expressions. In this paper, we analyze the mechanism of Active Shape Model and realize that the ability of profiles normal to describe local appearance pattern is very limited. For efficient appearance pattern representation, local binary pattern is used and extended to describe local patterns of facial key points. For the purpose of retaining spatial information, sub-images of key points are divided into several regions, which are combined to define the extended local binary pattern (ELBP) histogram. Then we propose an improved ASM method framework, ELBP-ASM, in which local appearance patterns of key points are modelled using extended local binary pattern. Experimental results demonstrate that ELBP-ASM achieves more accurate results compared with original method used in ASM.
A MC-CDMA Mobile Communication System Employing Pre-Rake and Transmit Diversity
Authors: Emad K. Al-Hussaini, Hebat-Allah M. Mourad, Fatma A. Newagy
Venue: Wireless Personal Communications: An International Journal (2004)

In this paper, a multi-carrier code division multiple access (MC-CDMA) downlink mobile communication system employing pre-rake and dual transmit diversity is proposed. It combines high spectral efficiency with an immunity to channel dispersion and fading. It also ensures small size, cost and power consumption of the terminal. Theoretical and simulation results for the system under consideration are obtained. Depicted results show appreciable improvements of the proposed system over those previously known.
Animating song: Research Articles
Authors: Scott A. King, Richard E. Parent
Venue: Computer Animation and Virtual Worlds (2004)

We describe techniques used to create animations of song. Modifications to a text-to-audiovisual-speech system have been made to take the extra information of timing and frequency of the lyrics from a MIDI file. Lip-synchronized animations of song are then produced. We discuss differences between the production of speech and the production of song. Copyright &copy; 2004 John Wiley & Sons, Ltd.
An algebraic attack on the improved summation generator with 2-bit memory
Authors: Daewan Han, Moonsik Lee
Venue: Information Processing Letters (2005)

Recently algebraic attacks on stream ciphers have received much attention. In this paper we apply an algebraic attack to the improved summation generator with 2-bit memory, which was presented by Lee and Moon in order to give the original summation generator correlation immunity. We show that the initial state of the generator can be recovered within O(n5.6) bit operations from O(n2) regular output bits, where n is the total length of LFSRs. We could recover the initial key bits in practice within 3 minutes on a PC even for the case n = 256. Our result is a good example that shows how powerful algebraic attacks are in the analysis of stream ciphers.
Strictly Nonblocking Multirate logd(N,m,p) Networks
Authors: Frank K. Hwang, Yong He, Yang Wang
Venue: SIAM Journal on Computing (2005)

We give necessary and sufficient conditions for the d-nary multilog network to be strictly nonblocking under the discrete multirate model, and we give sufficient conditions for the same under the continuous multirate model.
Optimizing compilation of constraint handling rules in HAL
Authors: Christian Holzbaur, Maria Garcia De La Banda, Peter J. Stuckey, Gregory J. Duck
Venue: Theory and Practice of Logic Programming (2005)

In this paper we discuss the optimizing compilation of Constraint Handling Rules (CHRs). CHRs are a multi-headed committed choice constraint language, commonly applied for writing incremental constraint solvers. CHRs are usually implemented as a language extension that compiles to the underlying language. In this paper we show how we can use different kinds of information in the compilation of CHRs to obtain access efficiency, and a better translation of the CHR rules into the underlying language, which in this case is HAL. The kinds of information used include the types, modes, determinism, functional dependencies and symmetries of the CHR constraints. We also show how to analyze CHR programs to determine this information about functional dependencies, symmetries and other kinds of information supporting optimizations.
User Centric Walk: An Integrated Approach for Modeling the Browsing Behavior of Users on the Web
Authors: Susanne Burklen, Pedro Jose Marron, Serena Fritsch, Kurt Rothermel
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

The performance evaluation of Web applications usually requires the analysis of sequences of user requests for specific Web pages. These sequences can be obtained, for example, by applying empirical methods (recording the real sequence of requests), or by applying a formal model for generating synthetic results. In this paper, we present our Web Browsing Model and and its implementation as part of our novel User Centric Walk algorithm. By taking into account the hyperlink structure as well as the different user behavior on the Web, User Centric Walk allows us to generate accurate synthetic data that can be used instead of empirically obtained requests. Additionally, in this paper we show using empirical data that the probability of choosing some hyperlink from a given page as well as the probability of a user leaving a page without following a hyperlink is best characterized by a power-law. Finally, we show the flexibility and applicability of our model by performing the required correlations to empirical data, in order to validate our approach.
Cost sharing in a job scheduling problem using the Shapley value
Authors: Debasis Mishra, Bharath Rangarajan
Venue: Proceedings of the 6th ACM conference on Electronic commerce (2005)

A set of jobs need to be served by a single server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The jobs share their costs through compensation using monetary transfers. We characterize the Shapley value rule for this model using fairness axioms. Our axioms include a bound on the cost share of jobs in a group, efficiency, and some independence properties on the the cost share of a job.
Book review: LISP LORE: A Guide to Programming the LISP Machine, (2nd Edition) by Hank Bromley and Richard Lamson (Kluwer Academic Publishers)
Venue: Issue 103 (Jan., 1988) (1988)

Machine Learning: A Guide to Current Research provides a collection of current research papers mostly collected form participants at the Third International Machine Learning Workshop held in 1985. These 77 separate papers were collected and reformatted at Rutgers to produce a consistent format and a common bibliography. The range of learning topics include (taken from the preface): analogy, conceptual clustering, explanation-based generalization, incremental learning, inductive inference, learning apprentice systems, machine discovery, theoretical models, and applications. All of these topics, except incremental and apprentice systems are included as heading in the index. Other useful index headings include research institution (a few are missing, primarily those where the several authors are from more than one place) and program name. The papers are short; the average length of five pages per paper, based on the number of papers and the length of the book, overstates their length because of blank pages due to formatting considerations. In the short space for each paper it is not possible to explain in detail how anything is done. There is space only to say what is being done by the system. Thus, the bibliographic references become important for a deeper understanding of individual techniques. 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
High order accurate solution of the incompressible Navier-Stokes equations
Authors: Arnim Brüger, Bertil Gustafsson, Per Lötstedt, Jonas Nilsson
Venue: Journal of Computational Physics (2005)

High order methods are of great interest in the study of turbulent flows in complex geometries by means of direct simulation. With this goal in mind, the incompressible Navier-Stokes equations are discretized in space by a compact fourth order finite difference method on a staggered grid. The equations are integrated in time by a second order semi-implicit method. Stable boundary conditions are implemented and the grid is allowed to be curvilinear in two space dimensions. The method is extended to three dimensions by a Fourier expansion. In every time step, a system of linear equations is solved for the velocity and the pressure by an outer and an inner iteration with preconditioning. The convergence properties of the iterative method are analyzed. The order of accuracy of the method is demonstrated in numerical experiments. The method is used to compute the flow in a channel, the driven cavity and a constricted channel.
Two-frequency-dependent Gauss quadrature rules
Authors: Kyung Joong Kim
Venue: Journal of Computational and Applied Mathematics (2005)

We construct two-frequency-dependent Gauss quadrature rules which can be applied for approximating the integration of the product of two oscillatory functions with different frequencies β1 and β1 of the forms, yi(x) = fi,1(x)cos(βix) + fi,2(x)sin(βix), i = 1,2, where the functions fi,j(x) are smooth. A regularization procedure is presented to avoid the singularity of the Jacobian matrix of nonlinear system of equations which is induced as one frequency approaches the other frequency. We provide numerical results to compare the accuracy of the classical Gauss rule and one- and two-frequency-dependent rules.
Generating Huffman sequences
Authors: Dean Hoffman, Peter Johnson, Nadine Wilson
Venue: Journal of Algorithms (2005)

An easy algorithm is described a special case of which will generate a list of all n-ary Huffman sequences of length m, for any given integers m ≥ 1, n ≥ 2.
ARTag, a Fiducial Marker System Using Digital Techniques
Authors: Mark Fiala
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Fiducial marker systems consist of patterns that are mounted in the environment and automatically detected in digital camera images using an accompanying detection algorithm. They are useful for Augmented Reality (AR), robot navigation, and general applications where the relative pose between a camera and object is required. Important parameters for such marker systems is their false detection rate (false positive rate), their inter-marker confusion rate, minimal detection size (in pixels) and immunity to lighting variation. ARTag is a marker system that uses digital coding theory to get a very low false positive and inter-marker confusion rate with a small required marker size, employing an edge linking method to give robust lighting variation immunity. ARTag markers are bi-tonal planar patterns containing a unique ID number encoded with robust digital techniques of checksums and forward error correction (FEC). This proposed new system, ARTag has very low and numerically quantifiable error rates, does not require a greyscale threshold as does other marker systems, and can encode up to 2002 different unique IDýs with no need to store patterns. Experimental results are shown validating this system.
Data extraction as text categorization: an experiment with the MUC-3 corpus
Authors: David D. Lewis
Venue: Proceedings of the 3rd conference on Message understanding (1991)

The data extraction systems studied in the MUC-3 evaluation perform a variety of subtasks in filling out templates. Some of these tasks are quite complex, and seem to require a system to represent the structure of a text in some detail to perform the task successfully. Capturing reference relations between slot fillers, distinguishing between historic and recent events, and many other subtasks appear to have this character.
A Load Balancing Approach Based on a Genetic Machine Learning Algorithm
Authors: M. A. R. Dantas, A. R. Pinto
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

Cluster configurations are a cost effective scenarios which are becoming common options to enhance several classes of applications in many organizations. In this article, we present a research work to enhance the load balancing, on dedicated and non-dedicated cluster configurations, based on a genetic machine learning algorithm. Our approach is characterized by an on time assignment scheme using a classifier system. Classifier systems are learning machine algorithms, based on high adaptable genetic algorithms. We developed a software package which was designed to test the proposed scheme in a master-slave Cow (Cluster of Workstation) and Now (Network of Workstation) environment. Experimental results, from two different operating systems, indicate the enhanced capability of our load balancing approach to adapt in cluster configurations.
Mambo: a full system simulator for the PowerPC architecture
Authors: Patrick Bohrer, James Peterson, Mootaz Elnozahy, Ram Rajamony, Ahmed Gheith, Ron Rockhold, Charles Lefurgy, Hazim Shafi, Tarun Nakra, Rick Simpson, Evan Speight, Kartik Sudeep, Eric Van Hensbergen, Lixin Zhang
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

Mambo is a full-system simulator for modeling PowerPC-based systems. It provides building blocks for creating simulators that range from purely functional to timing-accurate. Functional versions support fast emulation of individual PowerPC instructions and the devices necessary for executing operating systems. Timing-accurate versions add the ability to account for device timing delays, and support the modeling of the PowerPC processor microarchitecture. We describe our experience in implementing the simulator and its uses within IBM to model future systems, support early software development, and design new system software.
Visual specification and analysis of use cases
Authors: Deepali Kholkar, G. Murali Krishna, Ulka Shrotri, R. Venkatesh
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

Unified Modelling Language (UML) is popular mainly due to the various visual notations it provides for specifying large systems. In UML the details of a use case are specified in natural language using standard templates [Cockburn 2000]. This is a critical gap leading to detailed requirements of an application being specified in natural language. As a result, inadequate analysis of business requirements is a source of many defects in software application development. Here we propose to bridge this gap by extending the set of UML diagrams with three new diagrams that enable rigorous specification, analysis and simulation of requirements.The above is achieved by modelling business policies as global invariants and operational tasks as user interactions. We propose visual notations to specify both the global invariants as well as the user interactions. The two specifications are checked for consistency using the model checker, SAL. Inconsistencies detected by the model checker are then presented back to the analyst in the form of easy to understand diagrams. These inconsistencies help detect incompleteness in the functional specification of an application as well as help in making the functional specifications rigorous and detailed. This simplifies the task of the designers and implementers. SAL is also used to simulate the system and generate some sample runs. These sample runs are presented back to the developer in visual form enabling better understanding of the behaviour of the system. The advantages of this approach are demonstrated through our experiences with a case study as well as a project executed at Tata Consultancy Services(TCS).