ppxscal/embedding_network huggingface dataset:
No-Hole L(2,1)-Colorings
Authors: Fishburn Peter C., Roberts Fred S.
Venue:  (2001)

An L(2,1)-coloring of a graph G is a coloring of G''s vertices with integers in {0,1, ..., k} so that adjacent vertices'' colors differ by at least two and colors of distance-two vertices differ. We refer to an L(2,1)-coloring as a coloring. The span \lambda(G) of G is the smallest k for which G has a coloring, a span coloring is a coloring whose greatest color is \lambda (G), and the hole index \rho (G) of G is the minimum number of colors in {0,1, ..., \lambda (G) } not used in a span coloring. We say that G is full-colorable if \rho (G) =0. More generally, a coloring of G is a no-hole coloring if it uses all colors between 0 and its maximum color. Both colorings and no-hole colorings were motivated by channel assignment problems. We define the no-hole span \mu (G) of G as \infty if G has no no-hole coloring; otherwise \mu (G) is the minimum k for which G has a no-hole coloring using colors in {0,1, ..., k}. We prove that G is full-colorable if it has \lambda (G) +1 vertices. In addition, if G is not full-colorable and if it has at least \lambda (G) +2 vertices, then \mu (G) \le \lambda (G) + \rho (G). Moreover, for each m <= 1 there is a graph with \rho (G) = m and \mu (G) = \lambda (G) + \rho (G).
Term Relevance Weights in On-Line Information Retrieval
Authors: Gerard Salton, R. K. Waldstein
Venue:  (1977)

Considerable evidence exists to show that the use of term relevance weights is beneficial in interactive information retrieval. Various term weighting systems are reviewed. An experiment is then described in which information retrieval users are asked to rank query terms in decreasing order of presumed importance prior to actual search and retrieval. The experimental design is examined, and various relevance ranking systems are evaluated, including fully automatic systems based on inverse document frequency parameters, human rankings performed by the user population, and combinations of the two.
Ontology Construction for Information Selection
Authors: Latifur Khan, Feng Luo
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Technology in the field of digital media generates huge amounts of non-textual information, audio, video, and images, along with more familiar textual information. The potential for exchange and retrieval of information is vast and daunting. The key problem in achieving efficient and user-friendly retrieval is the development of a search mechanism to guarantee delivery of minimal irrelevant information (high precision) while insuring relevant information is not overlooked (high recall). The traditional solution employs keyword-based search. The only documents retrieved are those containing user specified keywords. But many documents convey desired semantic information without containing these keywords. One can overcome this problem by indexing documents according to meanings rather than words, although this will entail a way of converting words to meanings and the creation of ontology. We have solved the problem of an index structure through the design and implementation of a concept-based model using domain-dependent ontology. Ontology is a collection of concepts and their interrelationships, which provide an abstract view of an application domain. We propose a new mechanism that can generate ontology automatically in order to make ourapproach scalable. For this we modify the existing self-organizing tree algorithm (SOTA) that constructs a hierarchy from top to bottom. Furthermore, in order to find an appropriate concept for each node in the hierarchy we propose an automatic concept selection algorithm from WordNet called linguistic ontology.To illustrate the effectiveness of our automatic ontology construction method, we have explored our ontology construction in text documents. The Reuters21578 text document corpus has been used. We have observed that our modified SOTA outperforms hierarchical agglomerative clustering (HAC).
Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons in the Presence of Obstacles
Authors: Yi Chiang, Roberto Tamassia
Venue:  (1994)

We present efficient algorithms for shortest-path and minimum-link-path queries between two convex polygons inside a simple polygon $P$, which acts as an obstacle to be avoided. Let $n$ be the number of vertices of $P$, and $h$ the total number of vertices of the query polygons. We show that shortest-path queries can be performed optimally in time $O(\log h +\log n)$ (plus $O(k)$ time for reporting the $k$ edges of the path) using a data structure with $O(n)$ space and preprocessing time, and that minimum-link-path queries can be performed in optimal time $O(\log h+\log n)$ (plus $O(k)$ to report the $k$ links), with $O(n^3)$ space and preprocessing time. We also extend our results to the dynamic case, and give a unified data structure that supports both queries for convex polygons in the same region of a connected planar subdivision $\cal S$. The update operations consist of insertions and deletions of edges and vertices. Let $n$ be the current number of vertices in $\cal S$. The data structure uses $O(n)$ space, supports updates in $O(\log^2 n)$ time, and performs shortest-path and minimum-link-path queries in times $O(\log h +\log^2 n)$ (plus $O(k)$ to report the $k$ edges of the path) and $O(\log h+k\log^2 n)$, respectively. Performing shortest-path queries is a variation of the well-studied {\em separation} problem, which has not been efficiently solved before in the presence of obstacles. Also, it was not previously known how to perform minimum-link-path queries in a dynamic environment, even for two-point queries.
Measure-Adaptive State-Space Construction
Authors: W. Douglas Obal Ii, William H. Sanders
Venue: Proceedings of the 4th International Computer Performance and Dependability Symposium (2000)

Measure-adaptive state-space construction is the process of exploiting symmetry in high-level model and performance measure specifications to automatically construct reduced state-space Markov models that support the evaluation of the performance measure. This paper describes a new reward variable specification technique, which, combined with recently developed state-space construction techniques, will allow us to build tools capable of measure-adaptive state-space construction. That is, these tools will automatically adapt the size of the state space to constraints derived from the system model and the user-specified reward variables.The work described in this paper extends previous work in two directions. First, standard reward variable definitions are extended to allow symmetry in the reward variable to be identified and exploited. Then, symmetric reward variables are further extended to include the set of path-based reward variables described in earlier work. In addition to the theory, several examples are introduced to demonstrate these new techniques.
Formal Limits on Determining Reliabilities of Component-Based Software Systems
Authors: Martin Kappes, Chandra M. R. Kintala, Reinhard P. Klemm
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

We present a model for analyzing the reliability of component-based software systems. Each software component is described as a finite state machine whose transitions have failure probabilities that reflect the unreliable execution of elementary component operations. Alternatively, we model a component as a finite state machine with an associated reliability figure that expresses the overall reliability of the component. Using our model, we prove that there is no algorithm that can accurately calculate the reliability of a system of finite state machines with known or estimated overall reliabilities or transition failure probabilities. The same negative result holds even if we only want to approximate the system reliability.
Pattern-Oriented Analysis and Design: Composing Patterns to Design Software Systems
Authors: Sherif Yacoub, Hany Ammar
Venue:  (2003)

:Design patterns are immensely powerful, but to build large-scale robust systems, you need more. Pattern-Oriented Analysis and Design introduces a methodology for "composing" proven design patterns into reliable, robust large-scale software systems. Using POAD, you can quickly build systems that are far more robust, scalable, and maintainable-using UML class diagrams as your building blocks. POAD: What it is, how it works, and what problems it solves Structural and behavioral approaches to design pattern composition Design models and UML techniques for pattern composition POAD processes: in depth coverage of analysis, design, and design refinement A systematic process to compose design patterns 4 chapter-length case studies: feedback control, customer behavior simulation, digital content processing, and distributed medical informatics Building on POAD: advanced trends and research Pattern-Oriented Analysis and Design takes design patterns to the next level. Whether you're an architect, designer, developer, or manager, it will help you build better software systems faster.
On Temporal Planning as CSP
Authors: Amol Dattatraya Mali
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Recent advances in constraint satisfaction and heuristic search have made it possible to solve classical planning problems significantly faster. There is an increasing amount of work on extending these advances to solving more expressive planning problems which contain metric time, quantifiers and resource quantities. One can broadly classify classical planners into two categories: (i) planners doing refinement search and (ii) planners iteratively processing a representation of finite size like a SAT encoding or planning graph or a constraint satisfaction problem (CSP). One key challenge in the development of planners casting planning as SAT or CSP is the identification of constraints which are satisfied if and only if there is a plan of k steps. This task is even more complex for planners handling metric timeand/or resource quantities and/or quantifiers. In this paper we show how such a SAT encoding can be synthesized for temporal planning. This encoding contains twenty kindsof constraints. We show how this encoding can be simplified. The set of constraints we identify makes it easier to develop temporal planners casting planning as a constraintsatisfaction problem other than SAT, like integer linear programming (ILP). The SAT encoding can be easily adapted to more complex cases of temporal planning like the one in which different preconditions and effects of an action may be true at different times during its execution. We also discuss two additional SAT encodings of temporal planning. The encoding schemes make it easier to exploit progress in SAT and CSP solving to solve temporal planning problems.
Timed Reachability Analysis Method for EFSM-based Communication Protocols and Its Experimental Evaluation
Authors: Shin'ichi Nagano, Yoshinori Hatakeyama, Yoshiaki Kakuda, Tohru Kikuno
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

We propose a timed reachability analysis method in order to generate system states of two classes of EFSM-based communication protocols; one class C1 consists of events such that the lower and upper bounds are all the same and the other class C2 consists of events such that they may be different. The proposed method enumerates only sequences of system states that are obtained through parallel execution of all possible events. Then, in order to evaluate the efficiency of the proposed method, we develop a verification tool based on the proposed method, and then apply the tool to a broadcasting protocol. The experimental results show that the total number of states generated by the proposed method is much less than that by the previous method.
Processes for systematic software reuse
Authors: S. Doublait, C. Lissoni
Venue: Proceedings of the 10th International Software Process Workshop (1996)

This paper presents a best practice of software reuse, achieved through adoption of specifically-designed engineering and management processes at Sodalia. Our company is a software development joint venture between Bell Atlantic and Telecom Italia which has embraced systematic reuse as a key strategic imperative to reach its objectives of high-quality, rapidly deployed telecommunications software applications. We describe the various processes that have been defined and applied in the context of our corporate reuse program, and summarize results from their adoption. Our experience has shown that the existence of carefully designed processes combined with a sound organizational structure are major enablers for making reuse a systematic practice in an organization.
Single n-gram stemming
Authors: James Mayfield, Paul McNamee
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Stemming can improve retrieval accuracy, but stemmers are language-specific. Character n-gram tokenization achieves many of the benefits of stemming in a language independent way, but its use incurs a performance penalty. We demonstrate that selection of a single n-gram as a pseudo-stem for a word can be an effective and efficient language-neutral approach for some languages.
Outlier Detection Algorithms in Data Mining Systems
Authors: M. I. Petrovskiy
Venue: Programming and Computing Software (2003)

The paper discusses outlier detection algorithms used in data mining systems. Basic approaches currently used for solving this problem are considered, and their advantages and disadvantages are discussed. A new outlier detection algorithm is suggested. It is based on methods of fuzzy set theory and the use of kernel functions and possesses a number of advantages compared to the existing methods. The performance of the algorithm suggested is studied by the example of the applied problem of anomaly detection arising in computer protection systems, the so-called intrusion detection systems.
Management of Communicable Memory and Lazy Barriers for Bulk Synchronous Parallelism in BSPk
Authors: Amr Fahmy, Abdelsalam Heddaya
Venue:  (1996)

Abstract Communication and synchronization stand as the dual bottlenecks in the performance of parallel systems, and especially those that attempt to alleviate the programming burden by incurring overhead in these two domains. We formulate the notions of communicable memory and lazy barriers to help achieve efficient communication and synchronization. These concepts are developed in the context of BSPk, a toolkit library for programming networks of workstations---and other distributed memory architectures in general---based on the Bulk Synchronous Parallel (BSP) model. BSPk, whose design is the subject of this paper, emphasizes efficiency in communication by minimizing local memory-to-memory copying, and in barrier synchronization by not forcing a process to wait unless it needs remote data. Both the message passing (MP) and distributed shared memory (DSM) programming styles are supported in BSPk, for the former helps processes exchange short-lived unnamed data values, while the latter permits communication through long-lived named variables.
GEO-WASA-combining GIS technology with workflow management
Authors: C. B. Medeiros, G. Vossen, M. Weske
Venue: Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering (1996)

Geoprocessing environments require the cooperation of experts in different fields, using heterogeneous, distributed data, by means of specialized tools, among which GIS-geographic information systems-play a prominent role. However the coordination of such work is time-consuming and error-prone, since a considerable amount of data is processed in parallel, and tools are not integrated, requiring human intervention for process communication. The paper presents GEO-WASA, an environment that helps to solve this problem, by combining the GIS data-oriented view of geoprocessing with the process-centered philosophy of a workflow management system.
Approximative conjunctions processing by multi-valued logic
Authors: H. Akdag, M. Mokhtari
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

We study a knowledge base composed of facts and rules of a linguistic nature. We attribute a linguistic degree to each proposition which represents its veracity. A problem encountered is the following: "When the premise part of a production rule is a conjunction of several propositions and when we observe each of these propositions with some degree, what global degree should we attribute to the observation, so that we can infer via the rule? We propose a method in order to express the neighbourhood degree between a rule and an observation evaluated on the same scale or on two different scales.
Transition Aware Global Signaling (TAGS)
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

We propose a new receiver to reduce the number of repeaters used in global wiring. The receiver stores the next state of the line while quiet. Upon detection of a transition at the end of the line the output is temporarily driven by the stored next state. Transitions at the output of the receiver are much faster than at the end of the line since they are generated locally. Using the TAGS receiver we can run a 15mm line (180nm node) at 800 MHz with no repeaters. The same line requires three repeaters with a traditional receiver and consumed more power and area. The TAGS receiver also outperforms a standard inverter at the 70nm technology node. A noise analysis at the two technology nodes shows that the receiver maintains good functional noise immunity.
Creating Generative Models from Range Images
Authors: Ravi Ramamoorthi
Venue:  (1998)

We describe a new approach for creating concise high-level generative models from one or more approximate range images. Using simple acquisition techniques and a user-defined class of models, our method produces a simple and intuitive object description that is relatively insensitive to noise and is easy to manipulate and edit. The algorithm has two inter-related phases -- recognition, which chooses an appropriate model within a given hierarchy, and parameter estimation, which adjusts the model to fit the data. We give a simple method for automatically making tradeoffs between simplicity and accuracy to determine the best model. We also describe general techniques to optimize a specific generative model. In particular, we address the problem of creating a suitable objective function that is sufficiently continuous for use with finite-difference based optimization techniques. Our technique for model recovery and subsequent manipulation and editing is demonstrated on real objects -- a spoon, bowl, ladle, and cup -- using a simple tree of possible generative models. We believe that higher-level model representations are extremely important, and their recovery for actual objects is a fertile area of research towards which this thesis is a step. However, our work is preliminary and there are currently several limitations. The user is required to create a model hierarchy (and supply methods to provide an initial guess for model parameters within this hierarchy); the use of a large pre-defined class of models can help alleviate this problem. Further, we have demonstrated our technique on only a simple tree of generative models. While our approach is fairly general, a real system would require a tree that is significantly larger. Our methods work only where the entire object can be accurately represented as a single generative model; future work could use constructive solid geometry operations on simple generative models to represent more complicated shapes. We believe that many of the above limitations can be addressed in future work, allowing us to easily acquire and process three-dimensional shape in a simple, intuitive and efficient manner.
A Hybrid Agent Model: a Reactive and Cognitive Behavior
Authors: Zahia Guessoum
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

To model complex systems, sofiware agents need to combine cognitive abilities to reason about complex situations, and reactive abilities to meet hard deadlines. We propose an operational hybrid agent model which mixes well known paradigms (objects, actors, production rules and ATN) and real-time peflonnances. This agent model combines cognitive and reactive modules. The cognitive module uses a rule-based system and is provided with a synchronization mechanism to avoid the possible inconsistencies of the asynchronous execution of several rule bases. The reactive asynchronous perception and communication modules allow the agent to dynamically adapt its behavior to changes in the environment. To manage the interactions between these fundamentally diflerent modules (reactive and cognitive), we use an ATiV-based module.
A Method for the Specification, Composition, and Testing of Distributed Object Systems
Authors: Paolo A. G Sivilotti
Venue:  (1997)

The formation of a distributed system from a collection of individual components requires the ability for components to exchange syntactically well-formed messages. Several technologies exist that provide this fundamental functionality, as well as the ability to locate components dynamically based on syntactic requirements. The formation of a correct distributed system requires, in addition, that these interactions between components be semantically well-formed. The method presented in this thesis is intended to assist in the development of correct distributed systems. We present a specification methodology based on three fundamental operators from temporal logic: initially, next, and transient. From these operators we derive a collection of higher-level operators that are used for component specification. The novel aspect of our specification methodology is that we require that these operators be used in the following restricted manner: (i) A specification statement can refer only to properties that are local to a single component; (ii) A single component must be able to guarantee unilaterally the validity of the specification statement for any distributed system of which it is a part. Specification statements that conform to these two restrictions we call certificates. The first restriction is motivated by our desire for these component specifications to be testable in a relatively efficient manner. In fact, we describe a set of simplified certificates that can be translated into a testing harness by a simple parser with very little programmer intervention. The second restriction is motivated by our desire for a simple theory of composition: If a certificate is a property of a component, that certificate is also a property of any system containing that component. Another novel aspect of our methodology is the introduction of a new temporal operator that combines both safety and progress properties. The concept underlying this operator has been used implicitly before, but by extracting this concept into a first-class operator, we are able to prove several new theorems about such properties. We demonstrate the utility of this operator and of our theorems by using them to simplify several proofs. The restrictions imposed on certificates are severe. Although they have pleasing consequences as described above, they can also lead to lengthy proofs of system properties that are not simple conjunctions. To compensate for this difficulty, we introduce collections of certificates that we call services. Services facilitate proof reuse by encapsulating common component interactions used to establish various system properties. We experiment with our methodology by applying it to several extended examples. These experiments illustrate the utility of our approach and convince us of the practicality of componentbased distributed system development. This thesis addresses three parts of the development cycle for distributed object systems: (i) the specification