ppxscal/embedding_network huggingface dataset:
Automatic Text Decomposition Using Text Segments and Text Themes
Authors: Gerard Salton, Amit Singhal, Chris Buckley, Mandar Mitra
Venue:  (1995)

With the widespread use of full-text information retrieval, passage-retrieval techniques are becoming increasingly popular. Larger texts can then be replaced by important text excerpts, thereby simplifying the retrieval task and improving retrieval effectiveness. Passage-level evidence about the use of words in local contexts is also useful for resolving language ambiguities and improving retrieval output. Two main text decomposition strategies are introduced in this study, including a chronological decomposition into {\em text segments}, and semantic decomposition into {\em text themes}. The interaction between text segments and text themes is then used to characterize text structure, and to formulate specifications for information retrieval, text traversal, and text summarization.
A repetition based measure for verification of text collections and for text categorization
Authors: Dmitry V. Khmelev, William J. Teahan
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

We suggest a way for locating duplicates and plagiarisms in a text collection using an R-measure, which is the normalized sum of the lengths of all suffixes of the text repeated in other documents of the collection. The R-measure can be effectively computed using the suffix array data structure. Additionally, the computation procedure can be improved to locate the sets of duplicate or plagiarised documents. We applied the technique to several standard text collections and found that they contained a significant number of duplicate and plagiarised documents. Another reformulation of the method leads to an algorithm that can be applied to supervised multi-class categorization. We illustrate the approach using the recently available Reuters Corpus Volume 1 (RCV1). The results show that the method outperforms SVM at multi-class categorization, and interestingly, that results correlate strongly with compression-based methods.
Open Distributed Autonomous Multi-Agent Coordination on the Web
Authors: Tarek Helmy, Tsunenori Mine, Guoqiang Zhong, Makoto Amamiya
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Agent technology is becoming more prevalent as the availability of network access, and the demand for the end-uses of agents becomes greater. Intelligent agents for information filtering and retrieval applications and tools are being employed in a variety of ways on the Web. A centralized agent for information discovery has usually limited capabilities for finding diverse and distributed information on-line. The main trust of this paper is to present a framework that allows distributed adaptive information KODAMA agents to work together to browse and retrieve distributed information based on the preexisted hyperlink structure on the Web and how these community of agents can automatically extract meta-information and cooperate to retrieve on-line distributed relevant information. We have developed its software architecture, and a working prototype showing the benefits to the Web of interactive architectures based on the coordination of the hyperlink structure on the network. In this paper, we summarize the current results of the project, and discuss some ideas on our future work.
Model checking the HAVi leader election protocol
Authors: Judi M.T. Romijn
Venue:  (1999)

The HAVi specification proposes an architecture for audio/video interoperability in home networks. Part of the HAVi specification is a distributed leader election protocol. We have modelled this leader election protocol in Promela and Lotos and have checked several properties with the tools Spin and Xtl (from the Caesar/Aldebaran package). It turns out that the protocol does not meet some safety properties and that there are situations in which the protocol may never converge to designate a leader. Our conclusion is that realistic timing requirements on sending and processing of messages should be added to the HAVi specification. Then a (timed) formal verification could give a definite answer with respect to correctness of the leader election protocol.
Streaming Media Bible, 1 edition
Authors: Steve Mack
Venue:  (2002)

:The Streaming Media Bible is the authoritative and comprehensive guide for producing professional-quality streaming media over the Internet. It provides an overview of what streaming media is, how it can be used and the tools and software programs available to consumers and businesses alike. It covers all aspects of streaming media, from the capturing, creation and optimization of source media files, to encoding and serving files over sites using the primary available technologies. Throughout the book, the streaming process is dissected and separated into its component pieces: original media creation, encoding, and serving. All three major streaming media systems (RealNetworks' RealSystem, Apple QuickTime and Microsoft Windows Media) are covered.
Collaborative filtering via gaussian probabilistic latent semantic analysis
Authors: Thomas Hofmann
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Collaborative filtering aims at learning predictive models of user preferences, interests or behavior from community data, i.e. a database of available user preferences. In this paper, we describe a new model-based algorithm designed for this task, which is based on a generalization of probabilistic latent semantic analysis to continuous-valued response variables. More specifically, we assume that the observed user ratings can be modeled as a mixture of user communities or interest groups, where users may participate probabilistically in one or more groups. Each community is characterized by a Gaussian distribution on the normalized ratings for each item. The normalization of ratings is performed in a user-specific manner to account for variations in absolute shift and variance of ratings. Experiments on the EachMovie data set show that the proposed approach compares favorably with other collaborative filtering techniques.
Spatial Color Histograms for Content-Based Image Retrieval
Authors: Aibing Rao, Rohini K. Srihari, Zhongfei Zhang
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Color histogram is an important technique for color image database indexing and retrieving. In this paper, traditional color histogram is modified to capture spatial layout information of each color and three types of spatial color histograms are introduced: annular, angular and hybrid color histograms. Experiments show that with a proper trade-off between the granularity in color dimensions and that in spatial dimensions, the performance of these histograms outperforms the traditional color histogram and some existing histogram refinement such as color coherent vector.
Efficient Simulation of Action Potential Propagation in a Bidomain
Authors: F N Hooke
Venue:  (1992)

Computer simulation is an important tool for investigating the propagation behaviour of electrical excitation in cardiac tissue. When ionic models of cell membrane excitation are combined with the {\em bidomain} model of macroscopic tissue properties, numerical solution of the resulting partial differential equations requires a substantial amount of computation. Thus more efficient numerical methods are needed. One aspect of the computational complexity of this problem is the need for detailed spatial and temporal resolution while the depolarizing front of excitation propagates through the domain. During the subsequent, and more protracted, repolarization phase, the solution changes more slowly and a much doarser discretization would be adequate. Previous approaches have incorporated explicit integration methods whose stability limitations have prevented exploitation of this change in time scales. This study applies a stable implicit integration method which allows the time-step to be controlled, without concern for stability, to obtain a solution of desired accuracy. Using an approximate Newton method to solve the resulting nonlinear algebraic equations, the computational problem is reduced to one of solving a sequence of nonsymmetric linear systems. In a central result, each nonsymmetric matrix is reduced in linear time to a smaller, symmetric positive-definite matrix by a block-LU factorization. The resulting linear systems are solved by preconditioned conjugate gradient-type methods. This approach also applies to equations arising from the simpler {\em monodomain} model of cardiac tissue. Performance comparisons with other methods indicate that this method is competitive for simulations of depolarization, while in simulations of repolarization it can significantly reduce the computational cost. To demonstrate the utility of this approach, some example problems of electrophysiological relevance are addressed. In other studies, the bidomain equations have been manipulated in various ways before discretization for numerical solution. This study also presents a class of linear algebraic transformations that unifies these approaches and allows some comparative analysis. The transformational framework gives insight into the implications of various manipulations on the numerical methods subsequently used to solve the equations.
A Self-Stabilizing Protocol for Pipelined PIF in Tree Networks
Authors: Daisuke KONDOU, Hideo MASUDA, Toshimitsu MASUZAWA
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Self-stabilization is a promising paradigm for achieving fault-tolerance of distributed systems. A self-stabilizing protocol can converge to its intended behavior even when it starts from any system configuration, and, thus, can tolerate any type and any number of transient faults.The PIF (Propagation of Information with Feedback) scheme in a tree network allows the root process to broadcast its information to all other processes and to collect their responses. Many distributed systems utilize the PIF scheme as a fundamental communication scheme.This paper first formalizes the pipelined PIF in tree networks, and proposes a self-stabilizing protocol for the pipelined PIF. The protocol applies the PIF to a sequence of information in a pipelined fashion. The protocol has stabilizing time of O(h) (where h is the height of the tree network). After stabilization, it completes each PIF in O(h) asynchronous rounds and has throughput of O(1). Moreover, the protocol achieves fault-containment: for a complete binary tree network, its expected stabilizing time from 1-faulty configurations is O(1).
A domain decomposition method for a kind of optimization problems
Authors: J.-P. Zeng, S. Z. Zhou
Venue: Journal of Computational and Applied Mathematics (2002)

In this paper, we are concerned with the monotone convergence of a multiplicative method for solving a kind of optimization problems. We show that the iterate sequence produced by the method converges to the solution of the problem monotonically.
Detecting Similarities and Differences in Images Using the PFF and LGG Approaches
Authors: Nikolaos Bourbakis
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

This paper presents two methods for comparison of images and evaluation of visibility of artifacts due to hidden information, changes or noise. The first method is based on the Pixels Flow Functions (PFF) able to detect changes in images by projecting the pixel values vertically, horizontally and diagonally. These projections create "functions" related with the average values of pixels summarized horizontally, vertically and diagonally. These functions represent image signatures. The comparison of image signatures defines differences in images. The second method is based on a heuristic graph model, known as Local-Global Graph (LGG), for evaluating visibility of modifications in digital images. The LGG is based on segmentation and comparing the segments while thresholding the differences in their attributes. The methods have been implemented in C++ and their performance is presented.
Formal Semantics for Computational Engineering: A Case Study on Dynamic Fault Trees
Authors: David Coppit, Kevin J. Sullivan, Joanne Bechta Dugan
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

Computational modeling tools are critical to engineering. In the absence of a sufficiently complete, mathematically precise, abstract specification of the semantics of the modeling framework supported by such a tool, rigorous validation of the framework and of models built using it is impossible; there is no sound basis for program implementation, verification or documentation; the scientific foundation of the framework remains weak; and significant conceptual errors in framework definition and implementation are likely. Yet, such specifications are rarely defined. We present an approach based on the use of formal specification and denotational semantics techniques from software engineering and programming language design. To illustrate the approach, we present elements of a formal semantics for a dynamic fault tree framework that promises to aid reliability analysis. No such specification of the meaning of dynamic fault trees has been defined previously. The approach revealed important shortcomings in the previous, informal definitions of the framework, and thus led to significant improvements, suggesting that formally specifying framework semantics is critical to effective framework design.
Which Models and Architectures of Distributed Real-Time Computing Systems Suit which Application Area?
Authors: H. Kopetz
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

A real-time system must produce the intended results at the intended points of real-time determined by its environment, otherwise the system has failed (Kopetz 1997). For the purpose of this discussion, we consider two types of environments that contain real-time computer systems:(i) static environments, where the frequency of the service requests on the computer system are constrained by a priori known environmental characteristics. Embedded applications fall into this category, because the external enclosing mechanical subsystem restricts the demands placed on the embedded computer system. For example, an automotive engine that operates at most with 6000 rpm has a minimum time between revolutions of 10 msec.(ii) dynamic environments, where it is possible to specify peak-load-service-request rates probabilistically only, e.g., a military command and control system that has to adapt dynamically to the a priori unknown threats of the enemy.We feel that these two fundamentally different environments of distributed real-time computer systems demand different system models and different implementation strategies. 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
Backward Error Recovery in Redundant Disk Arrays
Authors: Garth A. Gibson
Venue:  (1994)

Redundant disk arrays are single fault tolerant, incorporating a layer of error handling not found in nonredundant disk systems. Recovery from these errors is complex, due in part to the large number of erroneous states the system may reach. The established approach to error recovery in disk systems is to transition directly from an erroneous state to completion. This technique, known as forward error recovery, relies upon the context in which an error occurs to determine the steps required to reach completion, which implies forward error recovery is design specific. Forward error recovery requires the enumeration of all erroneous states the system may reach and the construction of a forward path from each erroneous state. We propose a method of error recovery which does not rely upon the enumeration of erroneous states or the context in which errors occur. When an error is encountered, we advocate mechanized recovery to an error-free state from which an operation may be retried. Using a form of backward error recovery, we are able to manage the complexity of error recovery in redundant disk arrays without sacrificing performance.
A new data abstraction layer required for OODBMS
Authors: Eun-Sun Cho, Sang-Yong Han, Hyoung-Joo Kim
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

A 'class' in the object-oriented paradigm represents both interface and implementation of the class. However, interface and implementation of a class are needed for different purposes, since class interface is shared among most users, while class implementation is used only by the implementers of the class. The authors introduce a new level of data abstraction, called the 'class-implementation level', which is based on separate management of interface and implementation of a class. They also describe a new model for OODBMS which provides users with the abstract view of the class implementation.
Fast Suboptimal Planning with Nexus States
Authors: Will Briggs, Brad Dawson
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

Despite recent advances, general-purpose planning still lags behind domain-specific planning in efficiency. We propose a method for automatic incorporation of domain knowledge into general-purpose planning by the identification of nexus, or well-connected, states in the domain. We present an analysis of under what circumstances this method will be applicable, and show that the method significantly improves planning time in two common benchmark domains, albeit with a measurable loss of plan optimality.
Rich service description for a smarter lifestyle
Authors: Patricia Charlton, Myriam Ribiere
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

A generally portrayed mobile society vision is captured by the idea of Intelligent Personal mobile Lifestyle Assistants that takes on many forms, they help you find your way around the Internet, they might be mobile, they may be socially intelligent and may even communicate emotional responses when you interact with them using learning techniques to filter and match just what you want when you want it. This brings a promise of a better lifestyle supported through efficient and personalised electronic assistants, which brings just what you need when you need it. Imagine a time when people receive their intelligent Personal mobile lifestyle assistant. Perhaps there will be a legal age before you are able to officially use your electronic assistant. Just like learning to drive a car. Different countries will have different legislations about when, how, codes of practice, legal fines, storage costs etc. In order to support this interaction medium requires rich distributed service framework that supports many different aspects of knowledge content for personalization. Here we make an emphasis on lifestyle as the electronic society becomes part of many people's way of life for managing business, services and social opportunities.In this paper we focus on the developments and requirements to provide a core definition and support of service description in order to provide an intelligent middleware that is the backbone of enabling the mobile lifestyle we envision. We draw upon the various research activities that contribute to the development of rich service descriptions and the opportunity for aggregation of services in a dynamic environment that can support context-aware needs of m-lifestyle. We extend the current architectures used to enable a richer service description for a smarter lifestyle.
On Multiplayer Non-Cooperative Games of Incomplete Information: Part 2 - Lower Bounds
Authors: Salman Azhar, Gary Peterson, John Reif
Venue:  (1991)

\indent We extend the alternating machine {\bf (A-TM)} of Chandra, Kozen and Stockmeyer [CKS81], the private and the blind alternating machines of Reif [Reif84] to model multiplayer games of incomplete information. We use these machines to provide matching lower bounds for our decision algorithms described in the first part of this pair of papers [APR91a]. We apply multiple person alternation to other machine types. We show that multiplayer games of incomplete information can be undecidable in general, unless the information is hierarchically arranged (as defined later in this paper). In hierarchical multiplayer games, each additional {\em clique} (subset of players with same information) increases the complexity of the outcome problem by a further exponential. Consequently, if a multiplayer game of incomplete information with {\em k} cliques has a space bound of $S(n)$, then its outcome is {\em k} repeated exponentials harder than games of complete information with the same space bound $S(n)$. This paper proves that this exponential blow-up must occur in the worst case. We define TEAM-PRIVATE-PEEK and TEAM-BLIND-PEEK, extending the previous models of PEEK. These new games can be shown to be complete for their respective classes. We use these games to establish lower bounds on complexity of multiplayer games of incomplete information and blindfold multiplayer games. We analyze time bounded alternating machines, and conclude that time is not a very critical resource for multiperson alternation. We also show {\bf DQBF} (a variant of {\bf QBF}) to be complete in { \sl NEXPTIME}.
Requirements-Related Risks in Critical Systems
Authors: Peter G. Neumann
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

This talk considers some of the roles that requirements engineering plays in computer system development, with particular emphasis on systems with critical requirements such as security, reliability, safety, and survivability. The RISKS archives are littered with cases attributable to requirements problems that propagate throughout development, from which many lessons need to be learned. Various possible remedies are discussed.
A File System for the J-Machine
Authors: Yair Zadik, Stephen Taylor
Venue:  (1993)

No abstract available.
Harry Potter and the Chamber of Secrets
Authors: J. K. Rowling
Venue:  (2003)

:The Dursleys were so mean and hideous that summer that all Harry Potter wanted was to get back to the Hogwarts School for Witchcraft and Wizardry. But just as he's packing his bags, Harry receives a warning from a strange, impish creature named Dobby who says that if Harry Potter returns to Hogwarts, disaster will strike. And strike it does. For in Harry's second year at Hogwarts, fresh torments and horrors arise, including an outrageously stuck-up new professor, Gilderoy Lockheart, a spirit named Moaning Myrtle who haunts the girls' bathroom, and the unwanted attentions of Ron Weasley's younger sister, Ginny. But each of these seem minor annoyances when the real trouble begins, and someone  or something  starts turning Hogwarts students to stone. Could it be Draco Malfoy, a more poisonous rival than ever? Could it possibly be Hagrid, whose mysterious past is finally told? Or could it be the one everyone at Hogwarts most suspects...Harry Potter himself!
An Introduction to Proofs of Program Correctness for Teachers of College-Level Introductory Programming Courses
Authors: David Gries, Jeff Wadkins
Venue:  (1990)

No abstract is available.