ppxscal/embedding_network huggingface dataset:
A Robust Frequency Domain Audio Watermarking Scheme for Monophonic and Stereophonic PCM Formats
Authors: David Megias, Jordi Herrera-Joancomarti, Julia Minguillon
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

In this paper, a watermarking scheme for both monophonic and stereophonic audio files is presented. The suggested method uses MPEG 1 Layer 3 compression to determine where and how the embedded mark must be introduced. The results show that the suggested watermarking scheme is robust against the attacks of the audio Stirmark benchmark and compression attacks using the Sound Quality Assessment Material as the experimental corpus set.
Enhancing Product Recommender Systems on Sparse Binary Data
Authors: Ayhan Demiriz
Venue: Data Mining and Knowledge Discovery (2004)

Commercial recommender systems use various data mining techniques to make appropriate recommendations to users during online, real-time sessions. Published algorithms focus more on the discrete user ratings instead of binary results, which hampers their predictive capabilities when usage data is sparse. The system proposed in this paper, e-VZpro, is an association mining-based recommender tool designed to overcome these problems through a two-phase approach. In the first phase, batches of customer historical data are analyzed through association mining in order to determine the association rules for the second phase. During the second phase, a scoring algorithm is used to rank the recommendations online for the customer. The second phase differs from the traditional approach and an empirical comparison between the methods used in e-VZpro and other collaborative filtering methods including dependency networks, item-based, and association mining is provided in this paper. This comparison evaluates the algorithms used in each of the above methods using two internal customer datasets and a benchmark dataset. The results of this comparison clearly show that e-VZpro performs well compared to dependency networks and association mining. In general, item-based algorithms with cosine similarity measures have the best performance.
Quality Aware MPEG-2 Stream Adaptation in Resource Constrained Systems
Authors: Damir Isovic, Gerhard Fohler
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

A number of algorithms have been presented for handlingsoftware decoding of MPEG-2 streams based onbuffering or rate adjustment focusing on providing good averagequality. The potentially arising drops in quality aretolerated, e.g., in transmissions over the Internet; they cannotbe accepted in high quality consumer products: thesemandate real-time methods. When resources, such as processingpower or network bandwidth, are limited and notall frames can be handled, best effort decoders incur unnecessaryquality decrease while wasting resources.In this paper, we present a method for quality awareframe selection for MPEG decoding under limited resources,based on realistic timing constraints for the decodingof MPEG streams. Given that not all frames can beprocessed, it selects those which will provide the best picturequality while matching the available resources, startingonly such decoding, which is guaranteed to be completed.We formulate the method as real-time scheduling problemand present its application in an example scheduling algorithm.Results from study based on realistic MPEG-2 videounderline the effectiveness of our approach.
Inferring Genetic Networks from Microarray Data
Authors: Shawn Martin, George Davidson, Elebeoba May, Jean-Loup Faulon, Margaret Werner-Washburne
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

In theory, it should be possible to infer realistic genetic networks from time series microarray data. In practice, however, network discovery has proved problematic. The three major challenges are 1) inferring the network; 2) estimating the stability of the inferred network; and 3) making the network visually accessible to the user. Here we describe a method, tested on publicly available time series microarray data, which addresses these concerns.
On-Line Robotic Interception Planning Using a Rendezvous-Guidance Technique
Authors: Farhad Agah, Mehran Mehrandezh, Robert G. Fenton, Beno Benhabib
Venue: Journal of Intelligent and Robotic Systems (2004)

A novel method for online, robotic interception of moving objects using visual feedback is proposed in this paper. No prior knowledge of the motion of the object is assumed. Since such objects might depart quickly from the workspace of the robot, fast interception is a critical issue. Thus, a novel time-optimal rendezvous-guidance technique that takes the dynamic limitations of the robot into account has been developed. In the proposed methodology, first, a parallel-navigation rule, originally introduced in the missile-guidance literature, is applied to generate a set of instantaneous task-space velocity commands, which, if executed, would keep the end-effector on a collision course with the object. Subsequently, a rendezvous-guidance method is utilized to reduce the original command set to one with velocity-matching capability. Finally, the fastest velocity command in the reduced set is chosen such that the dynamic limitations of the actuators of the robot are not violated. The proposed algorithm results in a fast and robust interception as shown by several simulation examples in 2D and 3D workspace.
Life sciences grid in EUROGRID and GRIP projects
Authors: Jarosław Wypychowski, Jarosław Pytliński, Łukasz Skorwider, Mirosław Nazaruk, Krzysztof Benedyczak, Michal Wroński, Piotr Bała
Venue: New Generation Computing (2004)

In this paper we describe deployment of most important life sciences applications on the grid. The build grid is heterogenous and consist of systems of different architecture as well as operating systems and various middleware. We have used UNICORE infrastructure as framework for development dedicated user interface to the number of existing computational chemistry codes and molecular biology databases. Developed solution allows for access to the resources provided with UNICORE as well as Globus with exactly the same interface which gives access to the general grid functionality such as single login, job submission and control mechanism.
Towards a continuous personalization experience
Authors: Johan Schuurmans, Ellis Zijlstra
Venue: Proceedings of the conference on Dutch directions in HCI (2004)

The aim of this paper is to stimulate the discussion about the broader application of user profiling. For this we present the research questions and some preliminary results from the project called AlterEgo [1]. This is a research project in which a number of Dutch companies and organizations participate.Our observation is that there are too many different and isolated user profiles and users have too little control over them [2]. This leads to a fragmented personalization experience.We believe in the need for a cross-domain profile that is under control of the individual (user). In this paper we motivate our approach and introduce the most important user requirements that will lead to a continuous personalization experience when using products and services.
New training strategies for constructive neural networks with application to regression problems
Authors: L. Ma, K. Khorasani
Venue: Neural Networks (2004)

Regression problem is an important application area for neural networks (NNs). Among a large number of existing NN architectures, the feedforward NN (FNN) paradigm is one of the most widely used structures. Although one-hidden-layer feedforward neural networks (OHLFNNs) have simple structures, they possess interesting representational and learning capabilities. In this paper, we are interested particularly in incremental constructive training of OHL-FNNs. In the proposed incremental constructive training schemes for an OHL-FNN, input-side training and output-side training may be separated in order to reduce the training time. A new technique is proposed to scale the error signal during the constructive learning process to improve the input-side training efficiency and to obtain better generalization performance. Two pruning methods for removing the input-side redundant connections have also been applied. Numerical simulations demonstrate the potential and advantages of the proposed strategies when compared to other existing techniques in the literature.
An Improvement of SAINV and RIF Preconditionings of CG Method by Double Dropping Strategy
Authors: Seiji Fujino, Yusuke Ikeda
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

Preconditioning based on incomplete factorization of the matrix A is among the best known and most popular methods for solving a linear system of equations with symmetric positive definite coefficient matrix. However, the existence of an incomplete factorization is a delicate issue which must be overcame if one has a desire to design reliable preconditioning. Stabilized AINV (Approximate IN-Verse) and RIF (Robust Incomplete Factorization) preconditionings with single dropping have been proposed. Dropping procedure is a key to improvement of efficiency of computation. In this paper new dropping strategy for improvement of both SAINV and RIF preconditionings will be proposed. Moreover comparisons with other incomplete factorization and original SAINV and RIF preconditionings using challenging linear systems from realistic structural analysis are presented. We discuss double dropping strategy in the context of computation time of CG method with preconditioning for successful convergence and memory requirement for factorization.
A stopping criterion for the conjugate gradient algorithm in a finite element method framework
Authors: M. Arioli
Venue: Numerische Mathematik (2004)

The Conjugate Gradient method has always been successfully used in solving the symmetric and positive definite systems obtained by the finite element approximation of self-adjoint elliptic partial differential equations. Taking into account recent results [13, 19, 20, 22] which make it possible to approximate the energy norm of the error during the conjugate gradient iterative process, we adapt the stopping criterion introduced in [3]. Moreover, we show that the use of efficient preconditioners does not require to change the energy norm used by the stopping criterion. Finally, we present the results of several numerical tests that experimentally validate the effectiveness of our stopping criterion.
A comparison of sequential consistency with home-based lazy release consistency for software distributed shared memory
Authors: Vadim Iosevich, Assaf Schuster
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

A Distributed Shared Memory (DSM) system provides a distributed application with a shared virtual address space. Choosing a memory consistency model is one of the main decisions in designing a DSM system. While Sequential Consistency provides a simple and intuitive programming model, relaxed consistency models allow memory accesses to be parallelized, improving runtime performance. We implement the home-based lazy release consistency (HLRC) protocol that supports preemptive multithreading and compare its performance with the efficient multithreaded SC protocol. We perform an "apple-to-apple'' comparison on the same testbed environment and benchmark suite, and investigate the effectiveness and scalability of both these protocols.
A Proposal of a Streaming Video System Adapting to Various System Environments and Its Implementation
Authors: Yuka Kato, DongMei Jiang, Katsuya Hakozaki
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper proposes a streaming video system adapting to various system environments. Until now, many studies of adapting QoS (Quality of Service) control methods have been made in the area of streaming video technologies in the Internet. However, these methods have not been able to provide sufficient service quality to system users under recent diversification of system environments. We therefore design the system based on three ideas. First, the system conducts switching of streaming servers. This switching makes it possible to combine multiple control mechanisms and to use the combination for QoS control. Second, the system adopts simple estimation methods of network conditions. Estimation accuracy is gradually modified while users are watching streams. Third, the system notifies information of network conditions to system users. This makes it possible to provide streaming services with high level of user satisfaction. We conducted implementation experiments using the proto-type system. From these experimental results, we found out that the proposed system was adaptable to various system environments and that the QoS notification decreased the level of user dissatisfaction of service quality.
Robust Feature Detection and Local Classification for Surfaces Based on Moment Analysis
Authors: Ulrich Clarenz, Martin Rumpf, Alexandru Telea
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

The stable local classification of discrete surfaces with respect to features such as edges and corners or concave and convex regions, respectively, is as quite difficult as well as indispensable for many surface processing applications. Usually, the feature detection is done via a local curvature analysis. If concerned with large triangular and irregular grids, e.g., generated via a marching cube algorithm, the detectors are tedious to treat and a robust classification is hard to achieve. Here, a local classification method on surfaces is presented which avoids the evaluation of discretized curvature quantities. Moreover, it provides an indicator for smoothness of a given discrete surface and comes together with a built-in multiscale. The proposed classification tool is based on local zero and first moments on the discrete surface. The corresponding integral quantities are stable to compute and they give less noisy results compared to discrete curvature quantities. The stencil width for the integration of the moments turns out to be the scale parameter. Prospective surface processing applications are the segmentation on surfaces, surface comparison, and matching and surface modeling. Here, a method for feature preserving fairing of surfaces is discussed to underline the applicability of the presented approach.
A column generation approach to the coalition formation problem in multi-agent systems
Authors: Önder Tombus, Taner Bilgiç
Venue: Computers and Operations Research (2004)

The goal of this paper is to provide a computational study of the coalition formation problem in multi-agent systems. The coalition formation problem, as formulated here, is based on social welfare maximizing criteria, which aims to increase the total value of coalition structures in a multi-agent system. Value of each coalition depends only on the participating members. Pairwise relationships of coalition members determine the value of a coalition.In this study, the problem is formulated as a set partitioning problem and a column generation approach is proposed to solve it. Assuming that the coalition forming agents have computational capabilities, the algorithm is also extended to a parallel algorithm where all agents share the computational burden of coming up with a coalition. The proposed algorithms are implemented and tested in three types of environments, where expected pairwise relationship values are positive, zero or negative. Based on the test results, we highlight the coalition environments where parallel column generation technique is viable.
A reconfigurable logic-based processor for the SCAN image and video encryption algorithm
Authors: C. Kachris, N. Bourbakis, A. Dollas
Venue: International Journal of Parallel Programming (2003)

This paper presents a detailed architecture and a reconfigurable logic based hardware design of the SCAN algorithm. This architecture can be used to encrypt high resolution images in real-time. Although the SCAN algorithm is a block cipher algorithm with arbitrarily large blocks, the present design is for 64 × 64 pixel blocks in order to provide real-time image encryption throughput. The architecture was initially targeted at the Xilinx XCV-1000 FPGA, for which design and performance results are presented in the paper.
Analysis of the electron traps at the 4H-SiC/SiO2 interface using combined CV/thermally stimulated current measurements
Authors: T. E. Rudenko, H. Ö. Ólafsson, E. Ö. Sveinbjörnsson, I. P. Osiyuk, I. P. Tyagulski
Venue: Microelectronic Engineering (2004)

The interface traps at the 4H-SiC/SiO2 interface are studied using thermally stimulated current (TSC) and CVtechniques. We demonstrate that the electron traps near the 4H-SiC conduction band edge at the 4H-SiC/SiO2 interface are composed of two groups of trapping levels differing by their mechanisms of the electron exchange with the semiconductor. These two groups of traps are found for a variety of differently prepared thermal oxides. It is assumed that both groups of traps are caused by the same interfacial defect distributed from interface into the oxycarbide transition region.
The divisibility of the Smarandache combinatorial sequence of degree two
Authors: Maohua Le
Venue: Smarandache Notions Journal (2004)

In this paper we prove that there has only the consecutive terms of the Smarandache combinatorial sequence of degree two are pairwise coprime.
Eye-tracking analysis of user behavior in WWW search
Authors: Laura A. Granka, Thorsten Joachims, Geri Gay
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

We investigate how users interact with the results page of a WWW search engine using eye-tracking. The goal is to gain insight into how users browse the presented abstracts and how they select links for further exploration. Such understanding is valuable for improved interface design, as well as for more accurate interpretations of implicit feedback (e.g. clickthrough) for machine learning. The following presents initial results, focusing on the amount of time spent viewing the presented abstracts, the total number of abstract viewed, as well as measures of how thoroughly searchers evaluate their results set.
The Diameter of a Scale-Free Random Graph
Authors: B&#x00e9;laa Bollob&#x00e1;s, Oliver Riordan
Venue: Combinatorica (2004)

We consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number m of earlier vertices, where each earlier vertex is chosen with probability proportional to its degree. This process was introduced by Barab&#x00e1;si and Albert [3], as a simple model of the growth of real-world graphs such as the world-wide web. Computer experiments presented by Barab&#x00e1;si, Albert and Jeong [1,5] and heuristic arguments given by Newman, Strogatz and Watts [23] suggest that after n steps the resulting graph should have diameter approximately logn. We show that while this holds for m=1, for m&#x2265;2 the diameter is asymptotically log n/log logn.
Constrained synthesis of textural motion for articulated characters
Authors: Shmuel Moradoff, Dani Lischinski
Venue: The Visual Computer: International Journal of Computer Graphics (2004)

Obtaining high-quality, realistic motions of articulated characters is both time consuming and expensive, necessitating the development of easy-to-use and effective tools for motion editing and reuse. We propose a new simple technique for generating constrained variations of different lengths from an existing captured or otherwise animated motion. Our technique is applicable to textural motions, such as walking or dancing, where the motion sequence can be decomposed into shorter motion segments without an obvious temporal ordering among them. Inspired by previous work on texture synthesis and video textures, our method essentially produces a reordering of these shorter segments. Discontinuities are eliminated by carefully choosing the transition points and applying local adaptive smoothing in their vicinity, if necessary. The user is able to control the synthesis process by specifying a small number of simple constraints.
Computer animation festival trailer
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

Each year, the Computer Animation Festival Chair produces a number of different high-energy pieces consisting of clips from some of the most visually stimulating work accepted into the program. These pieces are shared with international and national media bureaus, used to advertise the Animation Theater at the conference, and used to generally stimulate interst in the festival. The trailer included on this year's DVD is a reflection of the various trailers that were cut for the show. Copyright held by creator. 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
Structural Analysis of FGFR1 Kinase Activation through Molecular Dynamics Simulation
Authors: Peng Wang, Zhengchang Su, Juntao Guo, Ying Xu
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Receptor tyrokine kinases are critical regulators of signal transduction pathways mediating cellular homeostasis. Enhanced kinase activities via mutation and other genetic alternations have been observed in many human cancers. We performed a 4 ns molecular dynamics (MD) simulation of the kinase domain of fibroblast growth factor receptor 1 (FGFR1) to study the mechanism that controls its activation. Our simulation revealed the key atomic events that allow substrate access and kinase activation. This dynamic information will facilitate the design of new inhibitors for use in the treatment of cancer.
In-Building Positioning: Modeling Location for Indoor World
Authors: Kris Kolodziej, Jose Danado
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The combination of location positioning technologies such as GPS and initiatives like the US Federal Communications Commission's E911 telecommunication has generated a lot of interest in applications and services that are a function of a user's location, referred to as location-based services (LBS). A multitude of applications and services would also benefit from indoor (in-building) positioning and navigation. However, despite GPS technology and the positioning capabilities of cellular networks such as GSM, millions of square meters of indoor space are out of reach of these systems. Fortunately, over the past decade, advances in location positioning technology have made it possible to locate objects indoors. These alternative technologies are now being introduced to the market enabling many kinds of indoor LBS applications. The argument/exploration of this paper is that in order for indoor LBS to become widely used, there is a need for the infrastructure investment.