ppxscal/embedding_network huggingface dataset:
Agent Approach for Service Discovery and Utilization
Authors: Paul Palathingal, Sandeep Chandra
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

There is an extensive set of published and usable services on the Internet. Human based approaches to discover and utilize these services is not only time consuming, but also requires continuous user interaction. This paper describes an Agent Approach for Service Discoveryand Utilization (AASDU), which focuses on using light weight autonomous agents built into a multi-agent referral community, and Web Service standards (namely UDDI, SOAP, WSDL andXML). The AASDU approach proposes to use agents that interact with end users by accepting their queries to discover services, and efficiently manage service invocation. AASDU uses intrinsic multiagent properties to allow agents to communicate and cooperate with one another. Each agent conforms to a communication protocol that allows it to send and receive messages from another agent, without needing to know the address of the receiving agent.There is a need for effective and efficient communication among components in a multi-disciplinary, cross-organizational architecture. This has resulted in a proliferation of communication building blocks, or middleware, for distributed scientific computing. The most recent, and quite network-based services, referred to as Web Services. This paper also discusses the interoperability that can be achieved between software components through the use of Web Service standards and protocols in the context of AASDU.
Characteristics of Large Group Support Systems
Authors: Jason Thorpe, Conan C. Albrecht
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

In this paper, we present an evaluation of large group support systems and literature inthree fields: group support systems (GSS), computer supported cooperative work, and online self-organizing social systems. In addition to literature, we investigated over 25 large group systems (18 are presented here).Since GSS research has typically specialized in smaller groups, this research serves tocategorize groupware applications and introduce GSS researchers to large groupware concepts and the large groupware landscape.
Comparative performance evaluation of practical digital watermarking embedding schemes
Authors: Mohammad S. Eyadat
Venue:  (2003)

Digital watermarking is considered a possible solution to the problem of protecting digital material. Many techniques have been proposed for watermarking images and videos. One major difference between these techniques is the actual embedding schema employed to embed data inside the host image; however, the literature lacks an effective comparison of the different embedding approaches. The work presented in this thesis introduces and highlights the technical challenges associated with watermarking. Our concern is to determine the best embedding schema for a watermarking algorithm and to use the Human Visual System (HVS) features for automatic optimization of watermarking embedding schema parameters. We first give an introduction to the watermarking systems, processes, properties, and applications and then an overview of the compression standards as well as a comprehensive survey of current watermarking techniques and approaches. Two different embedding schemes are considered in this thesis. In the first method, a watermark is embedded into the host image and then the watermarked image goes through the compression process. In the second scheme, the cover image goes through the entire compression process and then a watermark is added to the compressed image. For both approaches the JPEG and the wavelet compression standards are employed. The issue of false negative rate and the fidelity level are addressed and we propose a mathematical method of using the human visual system (HVS) features as a solution to a related optimization problem. Also we suggest ways in which the performance of the watermarking algorithms can be improved. Finally, through statistical analysis, we recommended a set of criteria for evaluating our proposed embedding schemes, as well as a mathematical method for using the HVS, which makes novel use of tool-sets not previously proposed. We close with a summary and conclusions and suggest future research directions.
Modeling and validation of pipeline specifications
Authors: Prabhat Mishra, Nikil Dutt
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2004)

Verification is one of the most complex and expensive tasks in the current Systems-on-Chip design process. Many existing approaches employ a bottom-up approach to pipeline validation, where the functionality of an existing pipelined processor is, in essence, reverse-engineered from its RT-level implementation. Our validation technique is complementary to these bottom-up approaches. Our approach leverages the system architect's knowledge about the behavior of the pipelined architecture, through architecture description language (ADL) constructs, and thus allows a powerful top-down approach to pipeline validation. The most important requirement in top-down validation process is to ensure that the specification (reference model) is golden. This paper addresses automatic validation of processor, memory, and coprocessor pipelines described in an ADL. We present a graph-based modeling that captures both structure and behavior of the architecture. Based on this model, we present algorithms to ensure that the static behavior of the pipeline is well formed by analyzing the structural aspects of the specification. We applied our methodology to verify specification of several realistic architectures from different architectural domains to demonstrate the usefulness of our approach.
A Method for the Design of Periodical Notch Filters
Authors: Juan J. Yáñez-Macías, Gordana Jovanovic-Dolecek
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

This paper treats the design of periodical notchfilters with a given fundamental frequency and a givennotch bandwidth. The method used in this work isbased on the design of an allpass filter. The allpassfilter is designed by solving a linear system ofequations. This procedure reduces the complexity ofthe design while guarantees the precision on therejected frequencies. It is also presented a method toimprove the notch bandwidth characteristics of theperiodical notch filter. Finally, it is shown that theresulting filter has a good behaviour whenquantization is applied, if an adequate structure is usedfor the implementation.
An approach to a feature-based comparison of solid models of machined parts
Authors: Vincent A. Cicirello, William C. Regli
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2002)

Solid models are the critical data elements in modern computer-aided design environments, because they describe the shape and form of manufactured artifacts. Their growing ubiquity has created new problems in how to effectively manage the many models that are now stored in the digital libraries for large design and manufacturing enterprises. Existing techniques from the engineering literature and industrial practice, such as group technology, rely on human-supervised encodings and classification; techniques from the multimedia database and computer graphics&sol;vision communities often ignore the manufacturing attributes that are most significant in the classification of models. This paper presents our approach to comparing the manufacturing similarity assessments of solid models of mechanical parts based on machining features. Our technical approach is threefold: perform machining feature extraction, construct a model dependency graph (MDG) from the set of machining features, and partition the models in a database using a measure of similarity based on the MDGs. We introduce two heuristic search techniques for comparing MDGs and present empirical experiments to validate our approach using our testbed, the National Design Repository.
Dual Frame Motion Compensation with Uneven Quality Assignment
Authors: Vijay Chellappa, Pamela C. Cosman, Geoffrey M. Voelker
Venue: Proceedings of the Conference on Data Compression (2004)

Video codecs that use motion compensation have shown PSNR gains from the useof multiple frame prediction, in which more than one past reference frame is availablefor motion estimation. In dual frame motion compensation, one short-term referenceframe and one long-term reference frame are available for prediction. In this paper,we propose a dual frame motion compensation technique that allocates bits unevenlyamong frames to periodically create a high-quality frame that serves as the long-termreference frame for some time. By modifying an MPEG-4 encoder to use this techniqueon a set of video sequences, we show that it outperforms a normal dual framemotion compensation scheme in which the long-term reference frames are regularframes that are not allocated any extra rate.
Efficient implementation of reduce-scatter in MPI
Authors: Massimo Bernaschi, Giulio Iannello, Mario Lauria
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2003)

We discuss the efficient implementation of a collective operation called reduce-scatter, which is defined in the MPI standard. The reduce-scatter is equivalent to the combination of a reduction on vectors of length n with a scatter of the resulting n-vector to all processors.We describe the implementation issues and the performance characterization of two recently proposed algorithms for the reduce-scatter that have been proven to be highly efficient in theory under the assumption of fully connected parallel system.A performance comparison with existing mainstream implementations of the operation is presented which confirms the practical advantage of the new algorithms. Experiments show that the two algorithms have different characteristics which make them complementary in providing a performance gain over standard algorithms.Our study has been carried out on two different platforms: an SP2 and a Myrinet interconnected cluster of Pentium PRO. However, most of the results reported here are not specific for either MPI or the platforms used, and they hold in general for any message passing programming system.
On Compound Poisson Approximation for Sequence Matching
Authors: Marianne Månsson
Venue: Combinatorics, Probability and Computing (2000)

Consider sequences {Xi}mi=1 and {Yj}nj=1 of independent random variables, taking values in a finite alphabet, and assume that the variables X1, X2, &hellip; and Y1, Y2, &hellip; follow the distributions &mu; and v, respectively. Two variables Xi and Yj are said to match if Xi = Yj. Let the number of matching subsequences of length k between the two sequences, when r, 0 &le; r < k, mismatches are allowed, be denoted by W.In this paper we use Stein's method to bound the total variation distance between the distribution of W and a suitably chosen compound Poisson distribution. To derive rates of convergence, the case where E[W] stays bounded away from infinity, and the case where E[W] &rarr; &infin; as m, n &rarr; &infin;, have to be treated separately. Under the assumption that ln n&#x002F;ln(mn) &rarr; &rho; &isin; (0, 1), we give conditions on the rate at which k &rarr; &infin;, and on the distributions &mu; and v, for which the variation distance tends to zero.
Abstract data types in Euclid
Authors: Ernest Chang, Neil E. Kaden, W. David Elliott
Venue: ACM SIGPLAN Notices (1978)

The programming language Euclid provides features that support abstract data types, but does not strictly speaking provide a true data abstraction mechanism. This paper assesses the data abstraction facilities that Euclid does provide, examines the two ways of instantiating Euclid modules, and discusses other features of modules that the designers of Euclid chose not to include. In particular, the paper addresses the issues of (1) enforceable separation between abstract definition and representation, (2) specifying the relationship between abstract definition and representation, (3) type parameters in modules, (4) operator extensions, and (5) scope restrictions on identifiers.
Illuminating Earth's Interior through Advanced Computing
Authors: Andrea Donnellan, John Rundle, John Ries, Geoffrey Fox, Marlon Pierce, Jay Parker, Robert Crippen, Eric DeJong, Ben Chao, Weijia Kuang, Dennis McLeod, Mitsuhiro Matu'ura, Jeremy Bloxham
Venue: Computing in Science and Engineering (2004)

The article examines present computational strategies for modeling the earth's interior structure and dynamics on high-performance computing systems such as the Japanese Earth Simulator. Modeling efforts currently underway focus on problems such as geodynamo and earthquake modeling.
Sensitivity-Based Modeling and Methodology for Full-Chip Substrate Noise Analysis
Authors: Rajeev Murgai, Subodh M. Reddy, Takashi Miyoshi, Takeshi Horie, Mehdi Baradaran Tahoori
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Substrate noise (SN) is an important problem in mixed-signal designs. With increasing design complexity, it is not possible to simulate for SN with a detailed SPICE model that uses an accurate model for each transistor. In this paper, we propose a sensitivity analysis- and static timing analysis-based methodology to derive a reduced model that computes the worst case substrate noise in the design. The reduced model contains only passive components, which are very few, and is very quick to simulate. The main feature of our methodology is that, unlike previous approaches, it is independent of input patterns and does not need to simulate for millions of clock cycles. This lets us apply it to a full-chip design in reasonable CPU time. We validate our reduced model on several benchmark circuits against a detailed and highly accurate reference model. On average, the reduced model is within 16.4% of the reference model and is up to 38 times faster. Finally, we apply our methodology to a mixed-signal switch chip design consisting of 8 million gates and show that it finishes in 17 minutes.
Reducing Signalling Overhead in Cell-Hopping Mobile Wireless Networks using Location Caches
Authors: Jahan Hassan, Sanjay Jha
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

In this paper, we propose and analyze a timer-basedlocation caching scheme to reduce the signalling cost ofon-demand location management in the context of a lightweightcellular wireless network architecture, called a cell-hoppingnetwork. The timer value is the most importantcontrol parameter of the proposed caching scheme. We derivea closed-form expression as a function of the message-to-mobility ratio (MMR), for the optimum timer value thatminimizes signalling cost. Using numerical examples, weshow that the signalling cost can be reduced by as muchas 80% for reasonable MMR values, if the caching timer isset to the optimum value. Conversely, incorrectly selectedtimer values can nullify the use of the location cache.
Application of principles of event related open systems to business process reengineering
Authors: Chandrashekhar Chiplunkar, S. G. Deshmukh, R. Chattopadhyay
Venue: Computers and Industrial Engineering (2003)

This paper is focused on analysing the complete business environment with the help of information technology. It takes into account various interactions between different business processes while conducting BPR exercise. It also provides a framework based on event diagrams to record logical flow and other relevant details, which can be used for design of an information system. The event diagrams are useful for intelligent information system design. This methodology can also be used to develop a system for system design. Each event can be analysed for requirement of data, operations and resources. Interactions between various forces, events, modules, applications can be shown through interaction diagrams. The paper also lists out the driving forces for BPR and their contents.
A model-based road sign recognition system
Authors: Frank P. Ferrie, Denis Gingras
Venue:  (2002)

A road sign recognition system poses a real challenge for machine vision. It must recognize a wide variety of road signs under considerable variations in illumination and imaging geometry&mdash;all in real-time. This thesis presents a modular road sign recognition system relying on modelling for both detection and recognition. It divides into three main stages of processing. The first, concerned with detection, exploits the specific colors of road signs. The color constancy problem caused by the daylight illumination variations is addressed directly with a physics-based model supplemented by a calibration stage using real data. The second stage of processing, devoted to recognizing road signs in regions of interest found in the detection phase, involves a database containing more than 400 road signs arranged in a tree structure, and uses a novel correlation-based template matching technique relying on a bitwise encoding that accounts for both color labels and affine variations in the image formation process, and which also allows to build templates that are able to represent classes of objects. The content of the database used by the recognition algorithm is generated in a deterministic and automated manner by way of geometrical modelling of the image formation process starting with only model images of the road signs to be recognized. The recognition algorithm exploits color as a first logical classification step to direct the search for a road sign in the database, with the later finer steps being driven by correlation scores obtained from template matching. At the third stage of processing, a scene understanding module exploits constraints on the position of road signs along with the spatial relationships they must have in certain cases to other road signs in the image to filter out false positives. During processing, the system incorporates top-down mechanisms that use data fed back by partial recognitions, which allow to progressively gain more information about the identity of a potential road sign, thereby increasing detection and recognition robustness. Experimental results are presented which demonstrate the high overall performance of the system in a real task environment.
A Model for Random Random-Walks on Finite Groups
Authors: Andrew S. Greenhalgh
Venue: Combinatorics, Probability and Computing (1997)

A model for a random random-walk on a finite group is developed where the group elements that generate the random-walk are chosen uniformly and with replacement from the group. When the group is the d-cube Zd2, it is shown that if the generating set is size k then as d &rarr; &infin; with k &minus; d &rarr; &infin; almost all of the random-walks converge to uniform in k ln (k&#x002F;(k &minus; d))&#x002F;4+&rho;k steps, where &rho; is any constant satisfying &rho; > &minus;ln (ln 2)&#x002F;4.
Asynchronous Fast Adaptive Composite-Grid Methods: Numerical Results
Authors: Barry Lee, Stephen F. McCormick, Bobby Philip, linebreak DanielJ. Quinlan
Venue: SIAM Journal on Scientific Computing (2003)

This paper presents numerical results for the asynchronous version of the fast adaptive composite-grid algorithm (AFACx). These results confirm the level-independent convergence bounds established theoretically in a companion paper. These numerical results include the case of AFACx applied to first-order system least-squares finite element discretizations of the stationary Stokes equations on curvilinear adaptive mesh refinement grids.
Characterization Results Based on a Functional Derivative Approach
Authors: R. E. Lillo, M. Martin
Venue: Combinatorics, Probability and Computing (2001)

We introduce a notion of the derivative with respect to a function, not necessarily related to a probability distribution, which generalizes the concept of derivative as proposed by Lebesgue [14]. The differential calculus required to solve linear differential equations using this notion of the derivative is included in the paper. The definition given here may also be considered as the inverse operator of a modified notion of the Riemann&ndash;Stieltjes integral. Both this unified approach and the results of differential calculus allow us to characterize distributions in terms of three different types of conditional expectations. In applying these results, a test of goodness of fit is also indicated. Finally, two characterizations of a general Poisson process are included. Specifically, a useful result for the homogeneous Poisson process is generalized.
Item-based top-N recommendation algorithms
Authors: Mukund Deshpande, George Karypis
Venue: ACM Transactions on Information Systems (TOIS) (2004)

The explosive growth of the world-wide-web and the emergence of e-commerce has led to the development of recommender systems---a personalized information filtering technology used to identify a set of items that will be of interest to a certain user. User-based collaborative filtering is the most successful technology for building recommender systems to date and is extensively used in many commercial recommender systems. Unfortunately, the computational complexity of these methods grows linearly with the number of customers, which in typical commercial applications can be several millions. To address these scalability concerns model-based recommendation techniques have been developed. These techniques analyze the user--item matrix to discover relations between the different items and use these relations to compute the list of recommendations.In this article, we present one such class of model-based recommendation algorithms that first determines the similarities between the various items and then uses them to identify the set of items to be recommended. The key steps in this class of algorithms are (i) the method used to compute the similarity between the items, and (ii) the method used to combine these similarities in order to compute the similarity between a basket of items and a candidate recommender item. Our experimental evaluation on eight real datasets shows that these item-based algorithms are up to two orders of magnitude faster than the traditional user-neighborhood based recommender systems and provide recommendations with comparable or better quality.
Loops, ditopology and deadlocks
Authors: Lisbeth Fajstrup
Venue: Mathematical Structures in Computer Science (2000)

In Fajstrup et al. (1998a) the authors proposed a fast algorithm for deadlock detection, which was based on a geometric model of concurrency. We propose here an extension of this approach to deal with recursive processes (loops) and branchings.
Improving accuracy in word class tagging through the combination of machine learning systems
Authors: Hans van Halteren, Walter Daelemans, Jakub Zavrel
Venue: Computational Linguistics (2001)

We examine how differences in language models, learned by different data-driven systems performing the same NLP task, can be exploited to yield a higher accuracy than the best individual system. We do this by means of experiments involving the task of morphosyntactic word class tagging, on the basis of three different tagged corpora. Four well-known tagger generators (hidden Markov model, memory-based, transformation rules, and maximum entropy) are trained on the same corpus data. After comparison, their outputs are combined using several voting strategies and second-stage classifiers. All combination taggers outperform their best component. The reduction in error rate varies with the material in question, but can be as high as 24.3% with the LOB corpus.