ppxscal/embedding_network huggingface dataset:
Hybrid Model for Knowledge Representation
Authors: Reena T. N. Shetty, Pierre-Michel Riccio, Joel Quinqueton
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

In this paper the fundamental idea is top develop and explore an innovative approach of completing human designed networks with that of machine built word networks. This network forms a hybrid method which combines human precision with that of machine computation to form a knowledge representation model. This model in turn encourages faster and efficient construction of automatic ontology. Our objective is to tackle the problem faced in the field of information retrieval and classification in the current era of information over flow.
Service Pattern Discovery of Web Service Mining in Web Service Registry-Repository
Authors: Qianhui Althea LIANG, Jen-Yao CHUNG, Steven MILLER, Yang OUYANG
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

This paper presents and elaborates the concept of Web service usage patterns and pattern discovery through service mining. We define three different levels of service usage data: i) user request level, ii) template level and iii) instance level. At each level, we investigate patterns of service usage data and the discovery of these patterns. An algorithm for service pattern discovery at the template level is presented. We show the system architecture of a service-mining enabled service registry repository. Web service patterns, pattern discovery and pattern mining supports the discovery and composition of complex services, which in turn supports the application of web services to increasingly complex business processes and applications.
A study of results overlap and uniqueness among major web search engines
Authors: Amanda Spink, Bernard J. Jansen, Chris Blakely, Sherry Koshman
Venue: Information Processing and Management: an International Journal (2006)

The performance and capabilities of Web search engines is an important and significant area of research. Millions of people world wide use Web search engines very day. This paper reports the results of a major study examining the overlap among results retrieved by multiple Web search engines for a large set of more than 10,000 queries. Previous smaller studies have discussed a lack of overlap in results returned by Web search engines for the same queries. The goal of the current study was to conduct a large-scale study to measure the overlap of search results on the first result page (both non-sponsored and sponsored) across the four most popular Web search engines, at specific points in time using a large number of queries. The Web search engines included in the study were MSN Search, Google, Yahoo! and Ask Jeeves. Our study then compares these results with the first page results retrieved for the same queries by the metasearch engine Dogpile.com. Two sets of randomly selected user-entered queries, one set was 10,316 queries and the other 12,570 queries, from Infospace's Dogpile.com search engine (the first set was from Dogpile, the second was from across the Infospace Network of search properties were submitted to the four single Web search engines). Findings show that the percent of total results unique to only one of the four Web search engines was 84.9%, shared by two of the three Web search engines was 11.4%, shared by three of the Web search engines was 2.6%, and shared by all four Web search engines was 1.1%. This small degree of overlap shows the significant difference in the way major Web search engines retrieve and rank results in response to given queries. Results point to the value of metasearch engines in Web retrieval to overcome the biases of individual search engines.
A tool for verified analysis of transient and steady states of queues
Authors: Sebastian Kempken, Wolfram Luther, Gerhard Hasslinger
Venue: Proceeding from the 2006 workshop on Tools for solving structured Markov chains (2006)

In the analysis of queueing systems, many approaches have been developed with different properties regarding the complexity and numerical stability of the computation. We have studied factorization methods, which proved to be efficient for traffic modelling in telecommunication systems as well as classical queueing systems.Since the traffic rate on each transmission link is limited by a constant forwarding capacity, discrete time models with distributions of finite support are then appropriate, including deterministic service as the simplest case. On the other hand, various autocorrelation structures of Internet traffic are taken into account using semi-Markovian modeling.We have developed the InterVerdiKom tool starting with steady state analysis of semi-Markov systems in discrete time based on Wiener-Hopf and polynomial factorization. The tool has been applied to evaluate the performance of switching systems with input from superposed on-off sources and for video traffic. Using approximations of a Gaussian distribution function at stepwise refined discretization granularity, even servers with a first order autoregressive input have been analyzed at a controllable accuracy level.The tool makes use of interval arithmetic for verification of the accuracy of results of the steady state solution methods and has been extended recently to include transient system behavior.
Formal analysis of card-based payment systems in mobile devices
Authors: Vijayakrishnan Pasupathinathan, Josef Pieprzyk, Huaxiong Wang, Joo Yeon Cho
Venue: Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54 (2006)

To provide card holder authentication while they are conducting an electronic transaction using mobile devices, VISA and MasterCard independently proposed two electronic payment protocols: Visa 3D Secure and MasterCard Secure Code. The protocols use pre-registered passwords to provide card holder authentication and Secure Socket Layer/ Transport Layer Security (SSL/TLS) for data confidentiality over wired networks and Wireless Transport Layer Security (WTLS) between a wireless device and a Wireless Application Protocol (WAP) gateway. The paper presents our analysis of security properties in the proposed protocols using formal method tools: Casper and FDR2. We also highlight issues concerning payment security in the proposed protocols.
Efficient nonlinear channel identification using cyclostationary signal analysis
Authors: S. Prakriya, D. Hatzinakos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

A new set of efficient blind nonlinear channel identification methods is presented that exploits the cyclostationary nature of signals in many applications. The methods are of the batch type, use only the cyclic autocorrelation or cyclic cepstrum of the received signal, and can be used for real or complex (causal or noncausal) finite-memory quadratic Volterra models. In most cases, the solutions are direct and no equations need to be solved. Identification of various nonlinear models is discussed with the fractionally spaced impulse data train input. A simple method is considered for estimating the memory in a quadratic Volterra model. It is shown that the proposed methods can identify the nonminimum phase linear subsystems of the nonlinear channel model. Computer simulation results support the theory.
A Zipf-Like Distribution of Popularity and Hits in the Mobile Web Pages with Short Life Time
Authors: Toshihiko Yamakami
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

The mobile Internet quickly penetrates the society. The mobile clickstream is a valuable resource to identify the personal web access behaviors. The author makes an empirical study on the mobile clickstream to identify the difference between the mobile information with limited life time and the traditional PC web information with long life time. The observation shows that the mobile web access indicates a zipf-like distribution even though the each web content has a limited life time. The author discusses the implications of this similarity from the view point of the mobile user behavior characteristics.
Evolution of portals and stability of information ecology on the web
Authors: Seonyoung Shim, Byungtae Lee
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

With the advent of the community-based search, the role of the search portal is evolving. Formerly a gateway, the portal is now becoming a destination. A community-based search delivers content from the knowledge community inside the portal that binds the traffic to the portal instead of allowing it access to external information sites. The Q&A mechanism available to users gives more relevant search results, hence resolving the search limitations inherent in the automated search engine. However, by monopolizing traffic inside the portal, it may of course deprive external sites. We examine how the evolution of the community-based search may affect information ecology on the web from a long-term perspective.
All Talk and No Action: A Transcranial Magnetic Stimulation Study of Motor Cortex Activation during Action Word Production
Authors: Massimiliano Oliveri, Chiara Finocchiaro, Kevin Shapiro, Massimo Gangitano, Alfonso Caramazza, Alvaro Pascual-leone
Venue: Journal of Cognitive Neuroscience (2004)

A number of researchers have proposed that the premotor and motor areas are critical for the representation of words that refer to actions, but not objects. Recent evidence against this hypothesis indicates that the left premotor cortex is more sensitive to grammatical differences than to conceptual differences between words. However, it may still be the case that other anterior motor regions are engaged in processing a word's sensorimotor features. In the present study, we used single- and paired-pulse transcranial magnetic stimulation to test the hypothesis that left primary motor cortex is activated during the retrieval of words (nouns and verbs) associated with specific actions. We found that activation in the motor cortex increased for action words compared with non-action words, but was not sensitive to the grammatical category of the word being produced. These results complement previous findings and support the notion that producing a word activates some brain regions relevant to the sensorimotor properties associated with that word regardless of its grammatical category.
The future of simulation: A field of dreams
Authors: B. Calder, D. Citron, Y. Patt, J. Smith
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

Address translation using the Translation Lookaside Buffer (TLB) consumes as much as 16% of the chip power on some processors because of its high associativity and access frequency. While prior work has looked into optimizing this structure at the circuit and architectural levels, this paper takes a different approach of optimizing its power by reducing the number of data TLB (dTLB) lookups for data references. The main idea is to keep translations in a set of translation registers, and intelligently use them in software to directly generate the physical addresses without going through the dTLB. The software has to work within the confines of the translation registers provided by the hardware, and has to maximize the reuse of such translations to be effective. We propose strategies and code transformations for achieving this in array-based and pointer-based codes, looking to optimize data accesses. Results with a suite of Spec95 array-based and pointer-based codes show dTLB energy savings of up to 73% and 88%, respectively, compared to directly using the dTLB for all references. Despite the small increase in instructions executed with our mechanisms, the approach can in fact provide performance benefits in certain cases.
Efficient agent-based cluster ensembles
Authors: Adrian Agogino, Kagan Tumer
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified clustering. Unfortunately current non-agent-based cluster combining methods do not work in a distributed environment, are not robust to corrupted clusterings and require centralized access to all original clusterings. Overcoming these issues will allow cluster ensembles to be used in fundamentally distributed and failure-prone domains such as data acquisition from satellite constellations, in addition to domains demanding confidentiality such as combining clusterings of user profiles. This paper proposes an efficient, distributed, agent-based clustering ensemble method that addresses these issues. In this approach each agent is assigned a small subset of the data and votes on which final cluster its data points should belong to. The final clustering is then evaluated by a global utility, computed in a distributed way. This clustering is also evaluated using an agent-specific utility that is shown to be easier for the agents to maximize. Results show that agents using the agent-specific utility can achieve better performance than traditional non-agent based methods and are effective even when up to 50% of the agents fail.
Subspace techniques for large-scale feature selection
Authors: L. P. Heck, J. H. McClellan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

A novel feature selection algorithm is presented which outperforms the well-known SFS (sequential forward selection) and SBS (sequential backward selection) algorithms for large-scale problems. The approach utilizes the solution to the similar problem of large-scale feature extraction by choosing a subset of the original measurements that are closest to the space spanned by the extracted (transformed) features. The authors develop a computationally efficient Frobenius subspace distance metric for the subspace comparisons, which reduces the complexity from order N taken k at a time to order N/sup 3/ operations. Finally, sufficient conditions for optimality of the algorithm are presented that demonstrate the relationship between the feature extraction and the feature selection solutions.
Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network
Authors: Jiun-Long Huang, Jui-Nan Lin
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

We propose in this paper a two-phase algorithm, named algorithm Layered-Cutting, to address the problem of broadcast program generation in a multi-system heterogeneous overlayed wireless network. The experimental results show that algorithm Layered-Cutting is able to efficiently generate broadcast programs of high quality for a multisystem heterogeneous overlayed wireless network.
Fluid hierarchies: automated generation of emphatic information graphics
Authors: D. Stott Parker
Venue:  (2006)

Available automated information graphic generation systems create simple graphics by fitting data to predefined formats, based on data characteristics and task specification. However, beyond task and ordering of the data variables, current systems do not support the underlying messages that most information graphics have. These messages can often be conveyed through emphasis, which vary the visual properties of a graphic to direct the viewer's focus. We present a system, based on a fluid hierarchical model, which can automatically generate complex information graphics, not limited to predefined formats and capable of incorporating many emphasis techniques, as well as be modified without complete regeneration. Instead of classifying information graphics as disparate families of formats, our approach capitalizes on their fundamental similarities. We view different graphical formats as different perspectives of the data, a direct mapping from the data structure to the graphical structure. This graphical structure is constructed from a unifying element, the transformable coordinate space (TCS). A TCS is a locally Euclidean spatio-temporal object with its own coordinate system, a definite boundary (shape), and different visual properties (such as color and size) with which to encode data. TCSs can be nested to form a tree structure, by embedding one coordinate system into another. The commonly seen information graphics and their variations can all be described as nested TCS structures. Furthermore, as they are variations of the same structure, graphics that encode the same data can be incrementally transformed into each other. By unifying information graphics into structures built with one type of element, automated generation becomes a simple selection of the visual properties and their transformations. As each visual property is mapped separately to the data variables without being constrained to some predefined combinations, the results are not limited to pre-coded formats as in previous systems. In addition, different emphasis techniques, being variations of visual properties, can be easily added. Morpherspective, a prototype system using the TCS model, can automatically generate many different types of information graphics with minimal user input. Unique to Morpherspective is that the generated graphic can incorporate many different kinds of emphasis techniques, including user-defined ones.
NXS: Native XML processing in Sybase RDBMS
Authors: Anupam Singh, Srikanth Sampath, Vadiraja Bhatt, Francis Pang, Bharat Rane, Phil Shaw, Gajanan Chinchwadkar, Ghazi-Nourdine Benadjaoud
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Sybase's flagship database product, Adaptive Server Enterprise provides Native XML processing (NXS) support. In this paper we present our experience related to query processing and indexing of XML data natively. XML documents are commonly represented as trees. Various tree annotation schemes have been proposed in literature. We use pre-order tree traversal to annotate the tree. This annotation scheme is fundamental part of our approach to native path indexes. We present our industrial strength XPath query engine that exploits the annotation scheme and the path indexes for efficient query processing. One of the key components of the XML engine is an abstract Application Programming Interface(API) named "Path Processor". This API acts as a bridge between query execution engine iterators and access paths. This paper describes the primitives provided by the API on sets of nodes resulting from scans over the XML indexes. The physical query operators in query plans exploit these primitives provided by the path processing API.
Hybrid model decision making processes using knowledge discovery in data describing states
Authors: Feliks Kurp
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

This work presents a general model of a dynamic system, paying particular attention to decision-making processes. The model is established using basic concepts of the semigroup and automata theories. Within the model, a decision is made after considering a set of attribute values which describe states. Based on these data, the system can optimize the selection of successive states. The paper will present a certain application of general model for a logistic problem.
Enhancing Modularity and Feedback in Computer Aided Assessment
Authors: P. Duarte, I. Nunes, J. P. Neto, T. Chambel
Venue: Proceedings of the 15th International Conference on Computing (2006)

We present a model of a computer aided assessment system -- CATS (Computer Assessable Task System) -- for mathematics, which is both modular and has rich feedback. Modular in the sense that elaborated tasks need not be built from scratch but, instead, from already existing tasks. Modules are made general enough to be reusable in many different contexts. As a consequence, the construction and management of multiple-step problems with complex system-user interaction, is facilitated for non-expert users. By rich feedback we mean that the system automatically generates messages explaining errors, whenever students make algebraic manipulation and logical mistakes. This contrasts with current assessment software where feedback must be hard coded by the teacher, therefore constraining feedback richness by the teacher programming skills.
How to extract BGP peering information from the internet routing registry
Authors: Giuseppe Di Battista, Tiziana Refice, Massimo Rimondini
Venue: Proceedings of the 2006 SIGCOMM workshop on Mining network data (2006)

We describe an on-line service, and its underlying methodology, designed to extract BGP peerings from the Internet Routing Registry. Both the method and the service are based on: a consistency manager for integrating information across different registries, an RPSL analyzer that extracts peering specifications from RPSL objects, and a peering classifier that aims at understanding to what extent such peering specifications actually contribute to fully determine a peering. A peering graph is built with different levels of confidence. We compare the effectiveness of our method with the state of the art. The comparison puts in evidence the quality of the proposed method.
Distributed Formulation of Artificial Reconstruction Technique with Reordering of Critical Data Sets
Authors: Boguslaw Butrylo, Marek Tudruj, Lukasz Masko
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

This paper discusses iterative algorithms for reconstruction of 2D images. The formulation of the distributed algorithm and its properties are described. The details of the distributed implementation of the ART (Algebraic Reconstruction Technique) are presented. Parallel implementation in a parallel system based on dynamically configurable clusters is proposed.
When in Doubt, Do it Both Ways: Brain Evidence of the Simultaneous Activation of Conflicting Motor Responses in a Spatial Stroop Task
Authors: M. Catherine Desoto, Monica Fabiani, David C. Geary, Gabriele Gratton
Venue: Journal of Cognitive Neuroscience (2001)

Response competition is often considered an important contributor to the delayed reaction to stimuli for which physical and semantic information are in conflict ("Stroop" effect). Response competition implies that brain areas associated with correct and incorrect responses (e.g., left and right motor cortices) should be simultaneously activated in conflict conditions. However, there is at present little direct evidence of this phenomenon, in part because of the paucity of brain imaging techniques that can independently monitor the time course of activation of adjacent brain areas, such as the motor areas. In the present study, we show that the event-related optical signal (EROS) can provide these types of data. The results confirm the prediction that conflict trials elicit simultaneous activation of both motor cortices, whereas nonconflict trials elicit brain activity only in the contralateral motor cortex. These data support a parallel view of the human information processing system.