ppxscal/embedding_network huggingface dataset:
Information extraction from structured documents using k-testable tree automaton inference
Authors: Raymond Kosala, Hendrik Blockeel, Maurice Bruynooghe, Jan Van den Bussche
Venue: Data Knowledge Engineering (2006)

Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, such as HTML or XML, uses learning techniques that are based on strings, such as finite automata induction. These methods do not exploit the tree structure of the documents. A natural way to do this is to induce tree automata, which are like finite state automata but parse trees instead of strings. In this work, we explore induction of k-testable ranked tree automata from a small set of annotated examples. We describe three variants which differ in the way they generalize the inferred automaton. Experimental results on a set of benchmark data sets show that our approach compares favorably to string-based approaches. However, the quality of the extraction is still suboptimal.
Is Production Pulling Knowledge Work to China? A study of the Notebook PC Industry
Authors: Jason Dedrick, Kenneth L. Kraemer
Venue: Computer (2006)

China is now the world's largest computer hardware producer and, as a study of notebook PC companies reveals, is beginning to pull knowledge work along with production to its key manufacturing centers. This trend has major implications for employment and competition in large-scale industries both in the US and abroad.
QoS-oriented negotiation in disk subsystems
Authors: Konstantina Stoupa, Athena Vakali
Venue: Data Knowledge Engineering (2006)

Quality of service (QoS) has emerged as a new term in relation to adding innovation criteria in large scale applications such as network based services, multimedia applications, storage services, etc. QoS has been proposed in storage management towards effective disk space utilization and request servicing. This paper presents a QoS based storage model for effective client negotiation in terms of performance, cost and reliability. Clients can create their own profile with respect to certain QoS attributes in order to specify their profile and requirements. A QoS negotiation model is proposed based on an available disk simulator which is experimented under artificial request workload towards proposing improved system's responsiveness, performance and functionality. Certain remarks and conclusions are raised with respect to meeting the clients's QoS requirements under the negotiated scheduling algorithms, the redundancy scheme and the capacity available to the client's environment according to the client's QoS requirements.
Chain Code Distribution-Based Image Retrieval
Authors: Junding Sun, Xiaosheng Wu
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

The direction chain code has been widely used in image retrieval for its simplicity and low storage requirement. One problem with the chain code is that it lacks of the spatial information of the image content, which limits its use in image retrieval. In this paper, two novel methods, called Chain Code Coherence Vector (CCCV) and Chain Code Distribution Vector (CCDV) are presented, which not only have the advantages of being invariant to the position, rotation and scaling but also contain the spatial information of the image content. In the end, two different distance measures are presented to measure the similarity of shape information embedded in the CCCV and CCDV. Experiment demonstrates the efficiency of our proposed algorithms.
A New Improved Maxnet Based on a Hybrid Neural Network That Does Not Need to be Trained
Authors: Jose Barahona da Fonseca
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The maximum of a set is the element that is greater or equal to all the remaining ones. This seams obvious but it is this idea that is behind our Maxnet based on an Hybrid Neural Network with multiplication units. Although this approach does not need training it implies N2 hard limit perceptrons, N analog switches units and one linear neuron for a set of N elements. In a first approach we consider the simpler case where we only want to get the order of the input variable(s) that is/are the maximum(s), in a second approach we consider the case where we want to get the value(s) of the maximum(s), in a third approach we solve the same problem but with only one output introducing Mutual Inhibitio and finally we solve the same problem without Mutual Inhibition and introducing a division unit to divide the sum of all maximums by the number of maximums. Finally we compare our Maxnet with the recent published proposals and we show the great advantages of our approach either for software implementation or hardware realization.
A Method for 3D-Scene Generation Using a Human-Like Language
Authors: Ivan Piza, Felix Ramos, Fabiel Zuniga
Venue: Proceedings of the 2006 International Conference on Cyberworlds (2006)

We propose a mechanism by means of which a user with little expertise of programming can easily produce custom-made virtual scenes. A typical scene comprises virtual entities that take decisions in real time in response of perceived environmental changes. The actions performed lead to the fulfillment of one or more goals specified by the scenarist. We have developed an open agent-oriented system. It provides a number of tools useful to create virtual scenes, including a rendering and a scene descriptor. Besides, it allows the addition of new services, like behavior controllers, 3D-object descriptors and virtual worlds. The design of a world not only involves specifying the environment graphical features, but also the rules that control the interaction between entities. This paper deals with the system architecture and the language provided to describe both a scene and a virtual world.
Range Queries in Massively Distributed Data
Authors: Maria-Del-Pilar Villamil, Claudia Roncancio, Cyril Labbe
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Efficient support of semantic location queries in Distributed Hash Table (DHT) P2P systems is a key challenge. It is difficult to handle since object distribution criteria among data providers is not related to a semantic criteria. This paper focus on range queries which are particularly expensive or impose strong restrictions in current proposals. We propose meta-data indexing to support queries involving inequalities and "like" operators in a scalable way. The proposed solution is portable, it can be used on top of any current DHT P2P system.
Integral Invariants for Shape Matching
Authors: Siddharth Manay Daniel Cremers, Byung-Woo Hong Anthony J. Yezzi, Stefano Soatto
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

For shapes represented as closed planar contours, we introduce a class of functionals which are invariant with respect to the Euclidean group and which are obtained by performing integral operations. While such integral invariants enjoy some of the desirable properties of their differential counterparts, such as locality of computation (which allows matching under occlusions) and uniqueness of representation (asymptotically), they do not exhibit the noise sensitivity associated with differential quantities and, therefore, do not require presmoothing of the input shape. Our formulation allows the analysis of shapes at multiple scales. Based on integral invariants, we define a notion of distance between shapes. The proposed distance measure can be computed efficiently and allows warping the shape boundaries onto each other; its computation results in optimal point correspondence as an intermediate step. Numerical results on shape matching demonstrate that this framework can match shapes despite the deformation of subparts, missing parts and noise. As a quantitative analysis, we report matching scores for shape retrieval from a database.
Brooks Automation
Authors: Barbara Culhane
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Decision making in industry has become more complicated in recent years. Customers are more demanding, competition is more fierce, and costs for labor and raw materials continue to rise. Managers need state-of-the-art tools to help in planning, design, and operations of their facilities. Simulation provides a virtual factory where ideas can be tested and performance improved. The AutoMod product suite from Brooks Automation has been used on thousands of projects to help engineers and managers make the best decisions possible. Come see the latest AutoMod release of one of the most widely used simulation software packages. 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
An approximative method for calculating performance measures of Markov processes
Authors: Juha Leino, Jorma Virtamo
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

We present a new approximation method called value extrapolation for Markov processes with large or infinite state spaces. The method can be applied for calculating any performance measure that can be expressed as the expected value of a function of the system state. Traditionally, the state distribution of a system is solved in a truncated state space and then an appropriate function is summed over the states to obtain the performance measure. In our approach, the measure is obtained directly, along with the relative values of the states, by solving the Howard equations in the MDP setting. Instead of a simple state space truncation, the relative values outside the truncated state space are extrapolated using a polynomial function. The Howard equations remain linear, hence there is no significant computational penalty. The accuracy of value extrapolation, even with a heavily truncated state space, is demonstrated using processor sharing systems and data networks as examples.
Semantic Matching to Achieve Web Service Discovery and Composition
Authors: Rama Akkiraju, Anca Ivan, Richard Goodwin, Biplav Srivastava, Tanveer Syeda-Mahmood
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

In this paper, we present a novel algorithm to discover and compose web services in the presence of semantic ambiguity by combining semantic matching and AI planning algorithms. Specifically, we use cues from domain-independent and domain-specific ontologies to compute an overall semantic similarity score between ambiguous terms. This semantic similarity score is used by AI planning algorithms to guide the searching process when composing services. In addition, we integrate semantic and ontological matching with an indexing method, which we call attribute hashing, to enable fast lookup of semantically related concepts.
Imagined Viewer and Object Rotations Dissociated with Event-Related fMRI
Authors: Jeffrey M. Zacks, Jean M. Vettel, Pascale Michelon
Venue: Journal of Cognitive Neuroscience (2003)

Human spatial reasoning may depend in part on two dissociable types of mental image transformations: object-based transformations, in which an object is imagined to move in space relative to the viewer and the environment, and perspective transformations, in which the viewer imagines the scene from a different vantage point. This study measured local brain activity with event-related fMRI while participants were instructed to either imagine an array of objects rotating (an object-based transformation) or imagine themselves rotating around the array (a perspective transformation). Object-based transformations led to selective increases in right parietal cortex and decreases in left parietal cortex, whereas perspective transformations led to selective increases in left temporal cortex. These results argue against the view that mental image transformations are performed by a unitary neural processing system, and they suggest that different overlapping systems are engaged for different image transformations.
Grid-JQA: grid Java based quality of service management by active database
Authors: L. Mohammad Khanli, M. Analoui
Venue: Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54 (2006)

Task scheduling is an integrated component of computing. With the emergence of grid and ubiquitous computing, newer challenges have arisen in task scheduling. Unlike traditional parallel computing, grid is a shared enterprising environment where is no central control. The goal of grid task scheduling is to achieve high system throughput and to match the application needs with the available computing resources. This matching of resources in a non-deterministically shared heterogeneous environment leads to concerns on Quality of Service (QoS). The paper presents a novel solution based on Active database to assure Quality of Services in grid computing systems. Active database accommodates some actions to be done automatically by insert, delete or update transactions. In this reason the best matching is obtained by using the most up to date information. Some comparison with other solutions had been done. As a result, our solution is safe factory and acceptable in the limits of performance.
Wireless Medical Information System Network for Patient ECG Monitoring
Authors: Matthew D'Souza, Montserrat Ros, Adam Postula
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

The emergence of telemedicine developments and the implementation of wireless networks in the medical field has paved the way for research into how we can best harness wireless technology to provide the medical sector with robust, accurate and 'usable' solutions. This paper describes the implementation of a Medical Information System Network that allows medical instrumentation data to be accessed and controlled by handheld devices operated by medical practitioners. Embedded platforms are used for the Medical Information Nodes that communicate with ECG instruments. We explore and compare the performance of implementing real-time acquisition of Patient ECG signals on an FPGA with a software implementation. It was found that the ECG module implemented as custom logic occupied a smaller percentage of the CPU time and also consumed less current than the software implementation.
Complexity Analysis of Group Key Agreement Protocols for Ad Hoc Networks
Authors: Rakesh Chandra Gangwar, Anil K. Sarje
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

Secure and efficient group communication in ad hoc networks is a very challenging task. Due to resource constraints in ad hoc networks, the group key agreement protocols must be efficient in various parameters such as number of rounds, number of messages exchanged, exponential computation performed etc. This paper presents various group key agreement protocols, and compares them for their suitability for ad hoc networks.
An efficient block Newton-type algorithm
Authors: K. Berberidis, S. Theodoridis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The algorithm presented in the paper is an exact block processing counterpart of the fast Newton transversal filtering (FNTF) algorithm [Moustakides and Theodorides, 1991]. The main trait of the new algorithm is that the block processing is done in such a way so that the resulting estimates are mathematically equivalent with the respective estimates of the FNTF algorithm. In cases where the involved filter is of medium to long order the new algorithm offers a substantial saving in computational complexity without sacrificing performance.
Alternatives for the definition and evaluation of resolution thresholds of signal-subspace parameter estimators
Authors: Wenyuan Xu, M. Kaveh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

This paper presents a formal probabilistic definition for the resolution capability of a general class of MUSIC-like direction estimators. An estimator in this class has its structure based on a one-dimensional search of the minima of an optimizing functional, usually termed the estimator null-spectrum. Following a rigorous definition of probability of resolution, various levels of approximation in the statistics employed are used to obtain computable expressions for resolution probabilities of two closely-spaced sources. These approximations are related to previously proposed definitions for resolution probability and in this manner clarify the conditions under which these ad-hoc definitions hold true.
Control-Flow Analysis and Representation for Aspect-Oriented Programs
Authors: Jianjun Zhao
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Aspect-oriented programming (AOP) has been proposed as a technique for improving the separation of concerns in software design and implementation. The field of AOP has, so far, focused primarily on problem analysis, language design, and implementation. Even though the importance of program comprehension and software maintenance is known, it has received little attention in the aspect-oriented paradigm. However, as the software systems coded in AOP languages are accumulated, the development of techniques and tools to support program comprehension and software maintenance tasks for aspect-oriented software will become important. In order to understand and maintain aspect-oriented programs, abstract models for representing these programs are needed. In this paper, we present techniques to construct control-flow representations for aspect-oriented programs, and discuss some applications of the representations in a program comprehension and maintenance environment.
Uplink Shared Channel in 3rd Generation (UMTS) Cellular System: Performance Analysis and Enhancement
Authors: Manju Sarvagya
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

In this paper packet transmission performance of USCH has been investigated. Throughput, delay, collision probability and blocking probability are obtained as function of network load for varied number of users. Effect of various other parameters such as retransmission limit, number of resources etc has been investigated. Two enhancements of the protocol are proposed and results are compared with the standard MAC protocol.
Phase correlation based iris image registration model
Authors: Jun-Zhou Huang, Tie-Niu Tan, Li Ma, Yun-Hong Wang
Venue: Journal of Computer Science and Technology (2005)

Iris recognition is one of the most reliable personal identification methods. In iris recognition systems, image registration is an important component. Accurately registering iris images leads to higher recognition rate for an iris recognition system. This paper proposes a phase correlation based method for iris image registration with sub-pixel accuracy. Compared with existing methods, it is insensitive to image intensity and can compensate to a certain extent the non-linear iris deformation caused by pupil movement. Experimental results show that the proposed algorithm has an encouraging performance.
Non-Linear PML Equations for Time Dependent Electromagnetics in Three Dimensions
Authors: S. Abarbanel, D. Gottlieb, J. S. Hesthaven
Venue: Journal of Scientific Computing (2006)

In this paper we present a new set of non-linear PML equations for the multi-dimensional Maxwell's equation and show that they are strongly well posed and temporally stable. Numerical examples demonstrate the validity of the new method.
Research and Implementation of a User Interface Agent Mobile
Authors: Wei Liu, Junjie Chen
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

It is difficult to users searching information because of the rapid expanding of information resource in Internet. Traditional search engines can't deal with that very well. To aim at the problem, the paper presents Agent, meta-search engine and active services technologies, and makes sure that the combine of them can fit for the demands of personalize and intelligent when users searching information. The article advances a system of intelligent meta-search engine system based on Agent, expounds mainly the work principle of the user interface Agent module. In addition, the article discusses some key technologies of the module such as mode choice and interface embodiment at length.
The transitory evolutionary spectrum
Authors: C. S. Detka, A. El-Jaroudi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Propose a new definition for the time-dependent spectrum of a non-stationary process. The authors show that this spectrum can be considered as the dual of Priestley's (1981) evolutionary spectrum. They demonstrate how this dual spectrum successfully characterizes signals whose components are highly localized in time. They give an estimator of this dual spectrum. Finally, they present examples which demonstrate that the new spectral definition is more suitable than current approaches for many signals. They show that the value of the method depends on the signal under consideration. They also illustrate that if the signal content is not known, then combining estimates of the evolutionary spectrum and its dual yields good results.
A Proposal of Dead Reckoning Protocol in Distributed Virtual Environment based on the Taylor Expansion
Authors: Dai Hanawa, Tatsuhiro Yonekura
Venue: Proceedings of the 2006 International Conference on Cyberworlds (2006)

In this paper, we studied the relationship between the accuracy of the dead reckoning data and the update interval in a distributed virtual environment (DVE).We have already shown that numerical analysis can be applied to the dead reckoning data between frames using parametrics calculated from the data over the last several frames based on polynomial models. Based on the above polynomial models, we proposed the new dead reckoning method to extrapolate the attribute data which arrives at discrete time period. We showed that theoretical models which approximate the statistical error of dead reckoning data can be formulated based on parameters such as the update interval and changes in the data. Theoretical models showed that the average error of proposed method is less than that of current method. Finally, we evaluate the validity of the proposed method with the comparison of current method by conducting experiments with the pen motion of a series of letters written by human. We confirmed that the proposed method can decrease the extrapolation error in comparison with current method in average.