name stringlengths 5 6 | title stringlengths 8 144 | abstract stringlengths 0 2.68k | fulltext stringlengths 1.78k 95k | keywords stringlengths 22 532 |
|---|---|---|---|---|
592966 | Continuous Data Block Placement in and Elevation from Tertiary Storage in Hierarchical Storage Servers. | Given the cost of memories and the very large storage and bandwidth requirements of large-scale multimedia databases, hierarchical storage servers (which consist of disk-based secondary storage and tape-library-based tertiary storage) are becoming increasingly popular. Such server applications rely upon tape libraries ... | Introduction
Future multimedia information systems are likely to contain large collections
of delay sensitive data objects (e.g. audio and video) with various lengths and
requirements. Some of the main data characteristics which
present serious challenges when building multimedia servers are: their large size,
the dela... | tape libraries;video playback;hierarchical storage servers;placement algorithms |
592967 | Cactus Tools for Grid Applications. | Cactus is an open source problem solving environment designed for scientists and engineers. Its modular structure facilitates parallel computation across different architectures and collaborative code development between different groups. The Cactus Code originated in the academic research community, where it has been ... | Introduction
Cactus [1], [2] is an open source problem solving environment designed to
provide a unied modular and parallel computational framework for physicists
and engineers. The Cactus Code was originally developed to provide a framework
for the numerical solution of Einstein's Equations [3], one of the most comple... | grid portals;cactus;grid computing |
592973 | Event Services in High Performance Systems. | The Internet and the Grid are changing the face of high performance computing. Rather than tightly-coupled SPMD-style components running in a single cluster, on a parallel machine, or even on the Internet programmed in MPI, applications are evolving into sets of cooperating components scattered across diverse computati... | Introduction
area distributed computing has been a strong
focus of research in high performance computing, resulting
in the development of software infrastructures
like PVM, MPI, and Globus, and in the creation of
the National Machine Room and the Grid by DOE and
NCSA/Alliance researchers. Increasingly, research focus
... | publish/subscribe communication;event services;component architectures;middleware;dynamic extensibility |
592978 | Scalable Session Locking for a Distributed File System. | File systems provide an interface for applications to obtain exclusive access to files, in which a process holds privileges to a file that cannot be preempted and restrict the capabilities of other processes. Local file systems do this by maintaining information about the privileges of current file sessions, and checki... | Introduction
Distributed file systems have become the principal method for sharing data in distributed applications. Programmers
understand file system semantics well, and use them to easily gain access to shared data. For
exactly the same reason that distributed file systems are easy to use, they are difficult to impl... | session locking;distributed file systems;concurrency control;lock evaluation |
592979 | Web Proxy Acceleration. | Numerous studies show that miss ratios at forward proxies are typically at least 4050%. This paper proposes and evaluates a new approach for improving the throughput of Web proxy systems by reducing the overhead of handling cache misses. Namely, we propose to front-end a Web proxy with a high performance node that filt... | Introduction
Proxy caches for large Internet Service Providers can receive high request
volumes.
Numerous studies show that miss ratios are often at least 40%-50%, even for
large proxy caches [7,9,12]. Consequently, a reduction of the cache miss overheads
can result in significant throughput improvements for proxy cach... | web performance;proxy cache;hints |
592983 | A Comparison of Protocols for Updating Location Information. | Detailed location information of mobile objects, for example that of a user with a mobile computer or phone, is an important input for many location-aware applications. However, constantly updating the location information for thousands of mobile objects is not feasible. Therefore, special update protocols for location... | Introduction
As detailed information about the location of a mobile device
or user has become widely available, mainly through
the satellite positioning system GPS, more and more applications
are using this information. Examples are car navigation
or fleet management systems, as well as location-aware
information servi... | location-awareness;location update protocols;location service |
593003 | Organized Terminode Routing. | We consider the problem of routing in a wide area mobile ad hoc network called Network. Routing in this network is designed with the following objectives. First, it should scale well in terms of the number of nodes and geographical coverage; second, routing should have scalable mechanisms that cope with the dynamicity ... | Introduction
We focus on the problem of routing in a large
mobile ad-hoc network that we call terminode net-
work. We call nodes in a terminode network,
terminodes, because they act as network nodes
and terminals at the same time. Our routing solution
is designed with three requirements in mind:
rstly, it should scale ... | self organized routing;mobile;wide-area network;ad hoc |
593175 | A Controlled Skip Parser. | Real-world natural language sentences are often long and complex, and contain unexpected grammatical constructions. They even include noise and ungrammaticality. This paper describes the Controlled Skip Parser, a program that parses such real-world sentences by skipping some of the words in the sentence. The new featur... | Introduction
Parsing real-world natural language text is a difficult task. The difficulty comes from several
sources. One is that a real-world sentences are long and complex, especially in newspaper articles.
The average length of a sentence is 20 to 30 words, and it often exceeds 100 words. The sentence
structure is c... | skip parser;n-grams;bigrams;syntactic parser;statistical natural language processing;robust processing |
593299 | How to Determine the Expressive Power of Constraints. | Some constraint languages are more powerful than others because they allow us to express a larger collection of problems. In this paper, we give a precise meaning to this concept of expressive power for constraints over finite sets of values. The central result of the paper is that the expressive power of a given set o... | Introduction
Some constraint languages are more powerful than others because they allow us to
express a larger collection of problems. For example, if we are dealing with applications
involving real-valued variables, then it is possible to express more numerical
relationships using arbitrary polynomial equations than i... | constraint satisfaction problem;complexity;NP-completeness;relational algebra;indicator problem |
593308 | A Methodological View of Constraint Solving. | Constraints are an effective tool to define sets of data by means of logical formulae. Our goal here is to survey the notion of constraint system and to give examples of constraint systems operating on various domains, such as natural, rational or real numbers, finite domains, and term domains. We classify the differen... | Introduction
Constraints allow to define sets of data by means of logical formulae. For example,
the set of even numbers y given in extension as the set f0; 2; can be described
in comprehension by the formula fy stating that there
exists a natural number x such that y is twice x. In this formula, the subformula
x is th... | constraint solving;rule based solving;constraint satisfiability;unification |
593311 | Localizer. | Local search is a traditional technique to solve combinatorial search problems which has raised much interest in recent years. The design and implementation of local search algorithms is not an easy task in general and may require considerable experimentation and programming effort. However, contrary to global search, ... | Introduction
Most combinatorial search problems are solved through global or local search. In global
search, a problem is divided into subproblems until the subproblems are simple enough to
be solved directly. In local search, an initial configuration is generated and the algorithm
moves from the current configuration ... | incremental algorithms;modeling language;local search |
593313 | Ordering Constraints over Feature Trees. | Feature trees are the formal basis for algorithms manipulating record like structures in constraint programming, computational linguistics and in concrete applications like software configuration management. Feature trees model records, and constraints over feature trees yield extensible and modular record descriptions... | Introduction
Feature constraints have been used for describing records in constraint programming
[2, 24, 23] and record like structures in computational linguistics [13, 12, 20, 18, 19].
Following [3, 5, 4] we consider feature constraints as predicate logic formulae that are
interpreted in the structure of feature tree... | weak subsumption;feature constraints;complexity;tree orderings;satisfiability;entailment |
593316 | Solving Various Weighted Matching Problems with Constraints. | This paper studies the resolution of (augmented) weighted matching problems within a constraint programming (CP) framework. The first contribution of the paper is a set of techniques that improves substantially the performance of branch-and-bound algorithms based on constraint propagation and the second contribution is... | Introduction
Constraint Logic Programming (CLP) and more generally Constraint-based
Programming (CP), has become an interesting approach for solving combinatorial
optimization problems [VH 89]. For instance, on problems such as jobshop
scheduling it has shown to be as efficient as more traditional approaches based on
O... | weighted matching;resource allocation;global constraint;hungarian method |
593353 | A Constraint-Based Interactive Train Rescheduling Tool. | In this paper, we report the design and implementation of a constraint-based interactive train rescheduling tool, a project in collaboration with the International Institute for Software Technology, United Nations University (UNU/IIST), Macau. We formulate train rescheduling as constraint satisfaction and describe a co... | Introduction
The PRaCoSy (People's Republic of China Railway Computing System)
project [10] is undertaken by the International Institute for Software Technol-
ogy, United Nations University (UNU/IIST). The aim of the project is to develop
skills in software engineering for automation in the Chinese Railways. A
specific... | search heuristics;constraint propagation;train rescheduling |
593354 | Fourier Elimination for Compiling Constraint Hierarchies. | Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring that a pane occupy the leftmost 1/3 of a window, or preferring that an object be contained within a rectangle if possible. For interactive use,... | Introduction
Constraints are a natural tool for user interface toolkits and other kinds of interactive
graphical systems. Some important uses in this application area include
specifying layout and other geometric information, maintaining consistency between
application data and a view of that data, and maintaining cons... | linear arithmetic constraints;fourier elimination algorithm;user interfaces;hierarchical constraints;constraint compilation |
593358 | Consistency Techniques in Ordinary Differential Equations. | This paper takes a fresh look at the application of interval analysis to ordinary differential equations and studies how consistency techniques can help address the accuracy problems typically exhibited by these methods, while trying to preserve their efficiency. It proposes to generalize interval techniques into a two... | Introduction
Differential equations (DE) are important in many scientific applications in areas such as physics, chemistry,
and mechanics to name only a few. In addition, computers play a fundamental role in obtaining solutions to
these systems.
The Problem A (first-order) ordinary differential equation (ODE) system O ... | differential equations;consistency;continuous problems |
593360 | Excluding Symmetries in Constraint-Based Search. | We introduce a new method, called i>symmetry excluding search (SES), for excluding symmetries in constraint based search. To our knowledge, it is the first declarative method that can be applied to i>arbitrary symmetries. The SES-method is based on the notion of symmetric constraints, which are used in our modification... | Introduction
In many search problems, one is faced with the existence of symmetries. Symmetries
give rise to many dierent solutions found by the search procedure, which
are all considered to be "similar". Often, one is not interested in also getting all
the symmetric solutions to every found solution. Without exclusion... | geometric symmetries;permutation symmetries;symmetry excluding search SES;symmetry exclusion;constraint-based search |
593397 | Design of Extensible Component-Based Groupware. | Tailoring is identified as a key requirement for CSCW applications. One major tailoring mechanism is the extension of an application at run-time to change its behavior.This article shows how synchronous CSCW component-based applications can be designed to be extensible at run-time. We propose to split the act of tailo... | Introduction
Human beings interact in different situations and their cooperative
actions depend on the context. Rather than following a predefined
schedule of events, people tend to act spontaneously in creative phases.
In general, it is not foreseeable how people work together; therefore, it is
not always possible to ... | java beans;tailoring;customization;design pattern;extensibility |
593444 | Mathematical Programming in Data Mining. | Mathematical programming approaches to three fundamental problems will be described: feature selection, clustering and robust representation. The feature selection problem considered is that of discriminating between two sets while recognizing irrelevant and redundant features and suppressing them. This creates a lean ... | Introduction
Mathematical programming, that is optimization subject to constraints, is a broad discipline that
has been applied to a great variety of theoretical and applied problems such as operations research
[29, 54], network problems [60, 53], game theory and economics [71, 35], engineering mechanics
[57, 37] and m... | robust representation;mathematical programming;clustering;feature selection |
593449 | Discovery of Frequent Episodes in Event Sequences. | Sequences of events describing the behavior and actions of users or systems can be collected in several domains. An episode is a collection of events that occur relatively close to each other in a given partial order. We consider the problem of discovering frequently occurring episodes in a sequence. Once such episodes... | Introduction
Most data mining and machine learning techniques are adapted towards the
analysis of unordered collections of data. However, there are important application
areas where the data to be analyzed consists of a sequence of events.
Examples of such data are alarms in a telecommunication network, user interface
... | frequent episodes;event sequences;sequence analysis |
593450 | Adaptive Fraud Detection. | One method for detecting fraud is to check for suspicious changes in user behavior. This paper describes the automatic design of user profiling methods for the purpose of fraud detection, using a series of data mining techniques. Specifically, we use a rule-learning program to uncover indicators of fraudulent behavior ... | Introduction
In the United States, cellular fraud costs the telecommunications industry hundreds
of millions of dollars per year (Walters and Wilkinson 1994; Steward 1997). One
kind of cellular fraud called cloning is particularly expensive and epidemic in major
cities throughout the United States. Cloning fraud causes... | rule learning;constructive induction;intrusion detection;profiling;fraud detection;applications |
593453 | Parallel Algorithms for Discovery of Association Rules. | Discovery of association rules is an important data mining task. Several parallel and sequential algorithms have been proposed in the literature to solve this problem. Almost all of these algorithms make repeated passes over the database to determine the set of frequent itemsets (a subset of database items), thus incur... | Introduction
With recent progress in automated data gathering, and the availability of cheap
storage, a lot of businesses have routinely started collecting massive amounts of
data on various facets of the organization. The eventual goal of this data gathering
is to be able to use this information to gain a competitive ... | lattice traversal;parallel data mining;maximal hypergraph cliques;association rules |
593455 | High Performance OLAP and Data Mining on Parallel Computers. | On-Line Analytical Processing (OLAP) techniques are increasingly being used in decision support systems to provide analysis of data. Queries posed on such systems are quite complex and require different views of data. Analytical models need to capture the multidimensionality of the underlying data, a task for which mul... | Introduction
On-line Analytical Processing (OLAP) [1] systems enable analysts and managers to gain insight into the
performance of an enterprise through a wide variety of views of data organized to reflect the multidimensional
nature of the enterprise data. OLAP gives insight into data through fast, consistent, interac... | high performance;attribute focusing;data mining;parallel computing;data cube |
593470 | A Microeconomic View of Data Mining. | We present a rigorous framework, based on optimization, for evaluating data mining operations such as associations and clustering, in terms of their utility in decision-making. This framework leads quickly to some interesting computational problems related to sensitivity analysis, segmentation and the theory of games. | Introduction
Data mining is about extracting interesting patterns from raw data. There is some agreement
in the literature on what qualifies as a "pattern" (association rules and correlations [1, 2, 3, 5,
6, 12, 20, 21] as well as clustering of the data points [9], are some common classes of patterns
but only disjointe... | clustering;optimization;market segmentation |
593484 | Parallel Formulations of Decision-Tree Classification Algorithms. | Classification decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud detection, etc. Highly parallel algorithms for constructing classification decision trees are desirable for dealing with large data sets in reasonable amount of time. Algorithms for buildi... | Introduction
Classification is an important data mining problem. A classification problem has
an input dataset called the training set which consists of a number of examples
each having a number of attributes. The attributes are either continuous, when
the attribute values are ordered, or categorical, when the attribut... | data mining;classification;scalability;decision trees;parallel processing |
593486 | Effect of Data Distribution in Parallel Mining of Associations. | Association rule mining is an important new problem in data mining. It has crucial applications in decision support and marketing strategy. We proposed an efficient parallel algorithm for mining association rules on a distributed share-nothing parallel system. Its efficiency is attributed to the incorporation of two po... | Introduction
Association rule discovery has attracted a lot of attention from the research and business communities [1, 2, 4].
An association rule is a rule which implies certain association relationships among a set of objects (such as "occur
together" or "one implies the other") in a database. The intuitive meaning o... | data skewness;data mining;workload balance;parallel mining;association rules;parallel computing |
593499 | Scalable Techniques for Mining Causal Structures. | Mining for association rules in market basket data has proved a fruitful area of research. Measures such as conditional probability (confidence) and correlation have been used to infer rules of the form the existence of item A implies the existence of item B. However, such rules indicate only a statistical relationship... | Introduction
In this paper we consider the problem of determining casual relationships, instead of mere as-
sociations, when mining market basket data. We discuss ongoing research in Bayesian learning
where techniques are being developed to infer casual relationships from observational data, and
we identify one line of... | data mining;association rules;text mining;causality;market basket |
593514 | Scaling Kernel-Based Systems to Large Data Sets. | In the form of the support vector machine and Gaussian processes, kernel-based systems are currently very popular approaches to supervised learning. Unfortunately, the computational load for training kernel-based systems increases drastically with the size of the training data set, such that these systems are not ideal... | Introduction
Kernel-based systems such as the support vector machine (SVM) and
Gaussian processes (GP) are powerful and currently very popular approaches
to supervised learning. Kernel-based systems have demonstrated
very competitive performance on several applications and data
sets. Kernel-based systems also have grea... | gaussian processes;support vector machine;massive data sets;kernel-based systems;committee machines |
593526 | Adaptive Sampling Methods for Scaling Up Knowledge Discovery Algorithms. | Scalability is a key requirement for any KDD and data mining algorithm, and one of the biggest research challenges is to develop methods that allow to use large amounts of data. One possible approach for dealing with huge amounts of data is to take a random sample and do data mining on it, since for many data mining ap... | Introduction
Scalability is a key requirement for any knowledge discovery and data mining algorithm.
It has been previously observed that many well known machine learning algorithms do
not scale well. Therefore, one of the biggest research challenges is to develop new methods
that allow to use machine learning techniqu... | data mining;concentration bounds;scalability;adaptive sampling;knowledge discovery |
593551 | A Discrete Event Systems Approach for Protocol Conversion. | A protocol mismatch occurs when heterogeneous networks try to communicate with each other. Such mismatches are inevitable due to the proliferation of a multitude of networking architectures, hardware, and software on one hand, and the need for global connectivity on the other hand. In order to circumvent this problem t... | Introduction
There is a growing need for global communication over networks of computers. However,
the heterogeneity of existing networks does not allow direct and consistent communication
and results in mismatch of protocols. Such mismatches are inevitable due to the proliferation
of differing hardware, software and n... | observability;controllability;protocol conversion;discrete event systems;progress;normality;supervisory control;synchronous composition;safety |
593691 | Structuring Acyclic Petri Nets for Reachability Analysis and Control. | The incidence matricesfrom places to transitions and vice versaof an acyclic Petri net can obtain a block-triangular structure by reordering their rows and columns. This allows the efficient solution of some reachability problems for acyclic Petri nets. This result is further used in supervisory control of Petri nets; ... | on-line computations for implementing the feedback controller are reduced signicantly and properties
of the closed-loop system can be studied using standard techniques for Petri nets. For Petri nets in
which all transitions are controllable and observable, and legal markings have to satisfy a conjunction
of linear ineq... | uncontrollable transitions;acyclic Petri net;petri net;supervisory control |
593697 | Regular Ordering and Applications in Control Policies. | In this paper we introduce the notion of regular ordering for periodic sequences based on the gaps between the entries. We define the notion of regular preserving functions using Schur convexity. This is used to extend some optimization results in queuing control problems. In particular, we show that the maximal travel... | Introduction
A classical problem in the control of queues is to compute the optimal routing policy of a stream
of incoming customers into several queues in parallel. Often, the goal is to minimize the average
waiting time of the customers or the average load of the system.
When the number of queues is not larger than t... | admission control;regular ordering balanced sequences;schur convexity;plus algebra |
593969 | Fusion Via a Linear Combination of Scores. | We present a thorough analysis of the capabilities of the linear combination (LC) model for fusion of information retrieval systems. The LC model combines the results lists of multiple IR systems by scoring each document using a weighted sum of the scores from each of the component systems. We first present both empiri... | Introduction
In the past, neural network models which have been
applied to the Information Retrieval problem have typ-
Research was supported by UC Senate Bridge Grant #RW252G/B.
ically used the very large feature vectors (document and
query vectors) which are traditionally used in IR systems
(see for example, [Crestan... | routing;fusion;performance evaluation;neural networks;linear combination |
593983 | Simple Bayesian Model for Bitmap Compression. | Bitmaps are a useful, but storage voracious, component of many information retrieval systems. Earlier efforts to compress bitmaps were based on models of bit generation, particularly Markov models. While these permitted considerable reduction in storage, the short memory of Markov models may limit their compression eff... | Introduction
This paper continues a series of papers (Bookstein et al. 1992, 1994, 1997) that
apply advanced statistical models to compress bitmaps. The earliest models assumed
that the 1-bits of a bitmap occur independently (Bookstein et al. 1992).
In several environments, however, the independence assumption is not v... | markov modelling;bitmap compression;concordances;IR models |
593994 | Matching Index Expressions for Information Retrieval. | The INN system is a dynamic hypertext tool for searching and exploring the WWW. It uses a dynamically built ancillary layer to support easy interaction. This layer features the subexpressions of index expressions that are extracted from rendered documents. Currently, the INN system uses keyword based matching. The effe... | Introduction
Searching large and dynamic information spaces is a di-cult task. Many authors have opted for an
approach combining browsing and searching in a hypertext environment (see e.g. [12, 21, 5]). The
motivated renements. In this overview, the hyperindex, navigation is used for query formulation.
After formulatio... | matching;index expressions;similarity;information retrieval |
593997 | Skeleton Trees for the Efficient Decoding of Huffman Encoded Texts. | A new data structure is investigated, which allows fast decoding of texts encoded by canonical Huffman codes. The storage requirements are much lower than for conventional Huffman trees, O(log^2 n) for trees of depth O(log n), and decoding is faster, because a part of the bit-comparisons necessary for the decoding may ... | Introduction
The importance and usefulness of Data Compression for Information Retrieval (IR) Systems is
today well-established, and many authors have commented on it [1, 17, 31, 27]. Large full-text
IR Systems are indeed voracious consumers of storage space realtive to the size of the raw
textual database, because not... | canonical Huffman codes;skeleton trees;huffman trees;decoding |
594016 | Measuring Search Engine Quality. | The effectiveness of twenty public search engines is evaluated using TREC-inspired methods and a set of 54 queries taken from real Web search logs. The World Wide Web is taken as the test collection and a combination of crawler and text retrieval system is evaluated. The engines are compared on a range of measures deri... | Introduction
Publication of accurate and meaningful evaluation of the quality of results returned by public Web
search engines not only enables informed consumer choice but also assists and encourages search
engine operators to improve their standard of service. Since many search engines claim to be using
novel techniq... | evaluation;search engines;web search |
594035 | Some Formal Analysis of Rocchio''s Similarity-Based Relevance Feedback Algorithm. | Rocchio's similarity-based Relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised learning algorithm from examples. In spite of its popularity in various applications there is little rigorous analysis of its learning complexity i... | Introduction
Research on relevance feedback in information retrieval has a long history
(Baeza-Yates and Ribeiro-Neto, 1999; Frakes and Baeza-Yates,
1992; Ide, 1971b; Ide, 1971a; Raghavan and Wong, 1986; J.J. Rocchio,
Salton, 1989). It is regarded as the most popular query reformation
strategy (Baeza-Yates and Ribeiro-... | relevance feedback;similarity;supervised learning;lower bound;vector space |
594068 | Spectral Sequences on Combinatorial Simplicial Complexes. | The goal of this paper is twofold. First, we give an elementary introduction to the usage of spectral sequences in the combinatorial setting. Second we list a number of applications.In the first group of applications the simplicial complex is the nerve of a poset; we consider general posets and lattices, as well a... | Introduction
In this paper we use spectral sequences to compute homology groups of combinatorially
given simplicial complexes, whether they come as nerves of posets or
with an explicit combinatorial description of the cell structure.
This idea is not new, in fact spectral sequences have been used for that purpose
in a ... | shellability;homology groups;posets;spectral sequences;graphs |
594153 | Fast Subsumption Checks Using Anti-Links. | The concept of anti-link is defined (an anti-link consists of two occurrences of the same literal in a formula), and useful equivalence-preserving operations based on anti-links are introduced. These operations eliminate a potentially large number of subsumed paths in a negation normal form formula. Those anti-links th... | Introduction
The logical consequences of a ground formula, expressed as minimal implied clau-
ses, are useful in certain approaches to non-monotonic reasoning (Kean and Tsi-
knis, 1992; Przymusinski, 1989; Reiter and de Kleer, 1987), where all consequences
of a formula set (e.g., the support set for a proposed commonse... | anti-links;subsumption |
594161 | The Use of Lemmas in the Model Elimination Procedure. | When the model elimination (ME) procedure was first proposed, the notion of lemma was put forth as a promising augmentation to the basic complete proof procedure. Here the lemmas that are used are also discovered by the procedure in the same proof run. Several implementations of ME now exist, but only a 1970s implement... | Introduction
The Model Elimination (ME) procedure was defined in the 1960's [17, 18]
nearly coincident with the Resolution procedure [22]. There was little early
This work is supported in part by NSF grants CCR-8900383 and CCR-9116203.
experimentation with ME, so the procedure received relatively little attention.
(How... | lemma;METEOR;model elimination |
594176 | Testing Positiveness of Polynomials. | Many problems in mathematics, logic, computer science, and engineering can be reduced to the problem of testing positiveness of polynomials (over real numbers). Although the problem is decidable (shown by Tarski in 1930), the general decision methods are not always practically applicable because of their high computati... | Introduction
Many problems in mathematics, logic, computer science, and
engineering can be reduced to the problem of testing positiveness
of polynomials. In 1930, Tarski [33, 34] showed that the
problem is decidable. In fact, he gave a decision method for
a more general problem than just testing positiveness. Since
man... | termination proofs;positiveness of polynomials;term rewrite systems |
594182 | The Design of the CADE-13 ATP System Competition. | Running a competition for automated theorem proving (ATP) systems is a difficult and arguable venture. However, the potential benefits of such an event by far outweigh the controversial aspects. The motivations for running the CADE-13 ATP System Competition were to contribute to the evaluation of ATP systems, to stimul... | Introduction
Running a competition for Automated Theorem Proving (ATP) systems 1 is a difficult and
arguable venture. The reasons for this are that existing ATP systems are based on different
logics, are designed for different types of reasoning, require different amounts of user interaction,
have different input forma... | automated theorem proving;competition;design |
594200 | The TPTP Problem Library. | This paper provides a detailed description of the CNF part of the TPTP Problem Library for automated theorem-proving systems. The library is available via the Internet and forms a common basis for development and experimentation with automated theorem provers. This paper explains the motivations and reasoning behind th... | Introduction
This paper describes the TPTP (Thousands of Problems for Theorem Provers)
Problem Library. The TPTP is a library of problems for automated theorem
proving (ATP) systems, for 1st order logic. The TPTP is comprehensive, and
thus provides an overview, and a simple, unambiguous reference mechanism for
problems... | problem library;TPTP;experimental evaluation |
594215 | What You Always Wanted to Know about Rigid E-Unification. | This paper solves an open problem posed by a number of researchers: the construction of a complete calculus for matrix-based methods with rigid E-unification. The use of rigid E-unification and simultaneous rigid E-unification for such methods was proposed by Gallier et al., in 1987. After our proof of the undecidabili... | Introduction
Algorithms for theorem-proving based on matings or tableaux in first-order logic
without equality comprise two kinds of rules. Rules of the first kind construct
matrices or tableaux from a given formula using a suitable amplification. Rules
of the second kind try to close paths or branches using substituti... | equality reasoning;tableau method;rigid E-unification |
594229 | Integrating Computer Algebra into Proof Planning. | Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two different tasks proving and calculating. Even more important, proof and computation are often interwoven and not easily separable.In this article ... | Introduction
The computer and the development of high-level programming languages
made possible the mechanisation of logic as well as the realisa-
M. KERBER, M. KOHLHASE, V. SORGE.
tion of mechanical symbolic calculations, we could witness in the last
forty years. This has lead to two rather disjoint academic fields: m... | computer algebra;proof checking;hierarchical proof planning;mechanized reasoning |
594248 | Ordered Semantic Hyper-Linking. | The ordered semantic hyper-linking strategy is complete for first-order logic and accepts a user-specified natural semantics that guides the search for a proof. Any semantics in which the meanings of the function and predicate symbols are computable on ground terms may be used. This instance-based strategy is efficient... | Introduction
There are at least two basic approaches to the study of automated deduction. One
approach concentrates on solving hard problems, especially those of interest to
human mathematicians. There have been some notable successes in this area, and
even some proofs of hitherto unproven conjectures. This has served ... | automated theorem proving;hyper-linking;semantics |
594258 | Semi-Thue Systems with an Inhibitor. | A i>semi-Thue system with an inhibitor is one having a special symbol, called an i>inhibitor, that appears on the right side of every rule but does not appear on the left side of any rule. The main result of this paper is that the uniform halting problem is decidable for the class of such systems. The concept of i>inhi... | April, 1998 (revised)
1. Introduction, notation and terminology. Semi-Thue systems constitute a
universal model of computation, in the sense that any decision problem about
computations is reducible to a problem about semi-Thue systems. Every recursively
enumerable language is the language of some semi-Thue system. (E.... | string rewriting;uniform termination;well behaved derivation;semi-Thue system;termination |
594264 | Efficient Algorithms to Detect and Restore Minimality, an Extension of the Regular Restriction of Resolution. | A given binary resolution proof, represented as a binary tree, is said to be i>minimal if the resolutions cannot be reordered to generate an irregular proof. Minimality extends Tseitin"s regularity restriction and still retains completeness. A linear-time algorithm is introduced to decide whether a given proof is minim... | Introduction
The regular restriction of binary resolution [14] states that a resolution
step resolving on a given literal should not be used to deduce a clause
containing that literal. In other words, that resolution step should not
be an ancestor of such a clause in the binary derivation tree. We extend
this restricti... | clause tree;resolution;binary tree;regularity;theorem proving |
594272 | A Full Formalization of SLD-Resolution in the Calculus of Inductive Constructions. | This paper presents a full formalization of the semantics of definite programs, in the calculus of inductive constructions. First, we describe a formalization of the proof of first-order terms unification: this proof is obtained from a similar proof dealing with quasi-terms, thus showing how to relate an inductive set ... | Introduction
This paper is concerned with programming languages semantics. Its aim is
to formalize SLD-resolution in the calculus of inductive constructions (Coq).
First, terms and substitutions are dened, and the unication theorem, constantly
used in the denition of the semantics of denite programs, is proved
from a s... | calculus of inductive constructions;SLD-resolution;standardization apart;formal proofs;semantics of logic programs |
594273 | Some Lambda Calculus and Type Theory Formalized. | We survey a substantial body of knowledge about lambda calculus and Pure Type Systems, formally developed in a constructive type theory using the LEGO proof system. On lambda calculus, we work up to an abstract, simplified proof of standardization for beta reduction that does not mention redex positions or residuals. T... | Introduction
"This paper is about our hobby." That is the first sentence of [MP93],
the first report on our formal development of lambda calculus and
type theory, written in autumn 1992. We have continued to pursue
this hobby on and off ever since, and have developed a substantial
body of formal knowledge, including Ch... | type theory;LEGO proof checker;formal mathematics;lambda calculus;Pure Type Systems |
594296 | New Worst-Case Upper Bounds for SAT. | In 1980 Monien and Speckenmeyer proved that satisfiability of a propositional formula consisting of i>K clauses (of arbitrary length) can be checked in time of the order 2i>K / 3. Recently Kullmann and Luckhardt proved the worst-case upper bound 2i>L / 9, where i>L is the length of the input formula. The algorithms lea... | Introduction
.
SAT (the problem of satisability of a propositional formula in conjunctive normal
can be easily solved in time of the order 2 N , where N is the number of variables in the
input formula. In the early 1980s this trivial bound was reduced for formulas in 3-CNF by
Monien and Speckenmeyer [20] (see also [22]... | SAT;worst-case upper bounds |
594333 | Alternative Translation Techniques for Propositional and First-Order Modal Logics. | We describe and analyze techniques, other than the standard relational/functional methods, for translating validity problems of modal logics into first-order languages. For propositional modal logics we summarize the □-as-Pow method, a complete and automatic translation into a weak set theory, and then describe an ... | Introduction
Translation techniques have oered valuable aid for the study and development
of theorem provers for non-classical logics, and their nave
use can be ascribed to tradition. The rst systematic study of the relational
translation was carried out within Correspondence Theory (van
Benthem, 1983). In later years ... | first-order modal logics;computable set theories;translation methods |
594334 | Checking Simple Properties of Transition Systems Defined by Thue Specifications. | In (possibly infinite) deterministic labeled transition systems defined by Thue congruences, labels are considered as functions of states into states. This paper provides a method for computing domains of such functions for a large class of transition systems. The latter are related to model checking of transition syst... | Introduction
Countable transition systems can model any software or digital hardware system and appear
as one of the most fundamental structures in computer science. While the research on finite
transition systems has a long tradition (see e.g. [1] for further references), infinite transition
systems have only recently... | automated deduction;infinite-state systems;formal verification;string-rewriting |
594344 | SAT-Based Decision Procedures for Classical Modal Logics. | We present a set of SAT-based decision procedures for various classical modal logics. By SAT based, we mean built on top of a SAT solver. We show how the SAT-based approach allows for a modular implementation for these logics. For some of the logics we deal with, we are not aware of any other implementation. For the ot... | Introduction
Propositional reasoning is a fundamental problem in many areas of
Computer Science. Many researchers have put, and still put, years of
eort in the design and implementation of new and more powerful SAT
solvers. Most importantly, the source code of many of these implementations
is freely available and can b... | modal logic;SAT-based decision procedure |
594390 | Fundamental Laws and Assumptions of Software Maintenance. | Researchers must pay far more attention to discovering and validating the principles that underlie software maintenance and evolution. This was one of the major conclusions reached during the International Workshop on Empirical Studies of Software Maintenance. This workshop, held in November 1996 in Monterey, Californi... | Introduction
All software systems evolve [1]. As they evolve they undergo numerous, successive changes - to fix errors,
improve performance or other attributes, and to adapt to new environments. The longer a system stays in
service, the larger maintenance costs are, and, therefore, it's not surprising that maintenance ... | theory development;software maintenance;empirical studies;interdisciplinary research |
594421 | Further Experiences with Scenarios and Checklists. | Software inspection is one of the best methods of verifying software documents. Software inspection is a complex process, with many possible variations, most of which have received little or no evaluation. This paper reports on the evaluation of one component of the inspection process, detection aids, specifically usin... | Introduction
Software inspection is a method for statically verifying documents. It was first
described by Michael Fagan in 1976 [6]. Since then there have been many variations
and experiences described, but a typical inspection involves a team of
three to five people reviewing and understanding a document to find defe... | partial replication;experiments;software inspection;defect detection aids |
594454 | A Function Point-Like Measure for Object-Oriented Software. | We present a method for estimating the size, and consequently effort and duration, of object oriented software development projects. Different estimates may be made in different phases of the development process, according to the available information. We define an adaptation of traditional function points, called Obje... | Introduction
Cost and effort estimation is an important aspect of the management
of software development projects. Experience shows that accurate estimation
is difficult: an average error of 100% may be considered "good"
and an average error of 32% "outstanding" (Vicinanza, Mukhopadhyay
and Prietula 1991).
Most methods... | design metrics;function points;object oriented;size estimation |
594739 | Efficient Window Block Retrieval in Quadtree-Based Spatial Databases. | An algorithm is presented to answer window queries in a quadtree-based spatial database environment by retrieving all of the quadtree blocks in the underlying spatial database that cover the quadtree blocks that comprise the window. It works by decomposing the window operation into sub-operations over smaller window pa... | Introduction
Spatial data consists of spatial objects made up of points, lines, regions, rectangles, sur-
faces, volumes, and even data of higher dimension which includes time. Examples of
spatial data range from locations of cities, rivers, roads, to the areas that are spanned
by counties, states, crop coverages, moun... | window block retrieval;active border;spatial databases;range query;design of algorithms;data structures;databases;quadtree space decomposition;clipping |
594780 | A Multi-Resolution Content-Based Retrieval Approach for Geographic Images. | Current retrieval methods in geographic image databases use only pixel-by-pixel spectral information. Texture is an important property of geographical images that can improve retrieval effectiveness and efficiency. In this paper, we present a content-based retrieval approach that utilizes the texture features of geogra... | Introduction
Satellite remote sensing development generated huge amount of image data during the last two
decades. With the launch of the new breed of high spatial resolution satellite systems, the volume
This research is partially supported by Xerox Corporation and NCGIA at Buffalo.
of digital image data will signific... | texture features;multi-resolution wavelet transform;hierarchical clustering;geographical image retrieval |
594788 | An Object Model of Direction and Its Implications. | Direction is an important spatial concept that is used in many fields such as geographic information systems(GIS) and image interpretation. It is also frequently used as a selection condition in spatial queries. Previous work has modeled direction as a relational predicate between spatial objects. Conversely, in this p... | Introduction
1.1 Modeling Direction
Direction is a common spatial concept that is used everywhere in daily life. When people communicate
about a geographic space, for example, giving route descriptions, direction is necessary to convey the
information. Direction is also frequently used as a selection condition in spati... | orientation;oriented spatial object;open object;direction |
594792 | Compressing Triangulated Irregular Networks. | We address the problem of designing compact data structures for encoding a Triangulated Irregular Network (TIN). In particular, we study the problem of compressing connectivity, i.e., the information describing the topological structure of the TIN, and we propose two new compression methods which have different purpose... | Introduction
Huge terrain datasets are increasingly available in GIS. This fact gives
rise to challenging problems in storage, transmission, and visualization
of terrain models. In particular, the design of compact structures for
encoding a terrain model as a sequential bitstream is important to reduce
the amount of ti... | geometric compression;data structures;triangulated irregular networks;terrain modeling |
594830 | Progressive Transmission of Vector Map Data over the World Wide Web. | Within distributed computing environments, access to very large geospatial datasets often suffers from slow or unreliable network connections. To allow users to start working with a partially delivered dataset, progressive transmission methods are a viable solution. While incremental and progressive methods have been a... | Figure
1: Roads belonging to different layers.
In the second case, the file is composed of a single layer and entities having different
semantic and thematic meaning coexist in it. In this case, it is assumed that the original
composing set of entities has been overlayed, i.e., there are no intersections between pairs... | progressive transmission;multiple representations;vector map data |
594869 | Bayesian Methods for Efficient Genetic Programming. | A Bayesian framework for genetic programming (GP) is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs and thus the information gained in the previous generation can be used in the next generation. The Bayesian GP makes use of Bayes theorem to e... | Table
1. A summary of previous efforts for upscaling genetic programming
Subjects Selected references
Angeline w3x Banzhaf w7x
Bloat Landgon w22x Nordin w27x
Wu w39x Zhang w44x
Blickle w10x Iba w18x
Parsimony Kinnear w19x Rosca w31x
Soule w36x Zhang w44, 45x
Andre w1x Angeline w2x
Modularity Koza w21x O'Reilly w28x
Sp... | bayesian genetic programming;incremental data inheritance;adaptive Occam's razor;probabilistic evolution;parsimony pressure;data subset selection |
594976 | Graph Coloring with Adaptive Evolutionary Algorithms. | This paper presents the results of an experimental investigation on solving graph coloring problems with Evolutionary Algorithms (EAs). After testing different algorithm variants we conclude that the best option is an asexual EA using order-based representation and an adaptation mechanism that periodically changes the ... | Introduction
The main goal of this paper is to present the results of an experimental study on solving graph
coloring problems by Evolutionary Algorithms (EAs). In particular we show the working of a
new, problem independent adaptive mechanism for constraint handling in EAs. In Section 2 a
brief overview of graph color... | adaptive parameters;genetic algorithms;constraint satisfaction;penalty functions;evolutionary algorithms;graph coloring;grouping problem |
594977 | Tabu Search for Frequency Assignment in Mobile Radio Networks. | The main goal of the Frequency Assignment Problem in mobile radio networks consists of assigning a limited number of frequencies to each radio cell in a cellular network while minimizing electromagnetic interference due to the reuse of frequencies. This problem, known to be NP-hard, is of great importance in practice s... | Introduction
The Frequency Assignment Problem (FAP) is one of the key applications in mobile radio
networks engineering 1 . Although different versions of the FAP can be defined, the main
purpose is to assign a limited number of available frequencies to each cell in a mobile radio
network while minimizing electro-magne... | constraints;optimization;frequency;tabu search;assignment |
595008 | A Constraint Programming Framework for Local Search Methods. | We propose in this paper a novel integration of local search algorithms within a constraint programming framework for combinatorial optimization problems, in an attempt to gain both the efficiency of local search methods and the flexibility of constraint programming while maintaining a clear separation between the cons... | Introduction
Local search methods in Operations Research (or) date back to over thirty years
ago [13]. Applied to difficult combinatorial optimization problems, this heuristic
approach yields high-quality solutions by iteratively considering small modifications
(called local moves) of a good solution in the hope of fin... | personnel scheduling problem;interface constraints;constraint programming;traveling salesman problem with time windows;neighborhood model;local search;tabu search |
595043 | Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics. | Constraint Programming typically uses the technique of depth-first branch and bound as the method of solving optimization problems. Although this method can give the optimal solution, for large problems, the time needed to find the optimal can be prohibitive. This paper introduces a method for using local search techni... | Introduction
This paper describes the use of iterative improvement techniques and meta-heuristics as
the search engine within a Constraint Programming framework (ILOG Solver) and its application
to the Vehicle Routing Problem (VRP).
The VRP is a practical problem that has been studied widely in the literature [10]. The... | vehicle routing;constraint programming;tabu search;Guided Local Search |
595077 | Constraint Logic Programming and Generalized Shortest Path Problems. | In this paper we study the relationship between Constraint Programming (CP) and Shortest Path (SP) problems. In particular, we show that classical, multicriteria, partially ordered, and modality-based SP problems can be naturally modeled and solved within the Soft Constraint Logic Programming (SCLP) framework, where lo... | Introduction
Shortest Path (SP) problems [4, 11] are among the most studied network optimization
problems. They are mainly used to represent and solve transportation
problems, where the optimization may involve dierent criteria, says cost, time,
resources, etc. Most interesting is the multi-criteria case, where the opt... | shortest path problems;soft constraints;constraint logic programming |
595085 | Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming. | In this paper, a greedy heuristic and two local search algorithms, 1-opt local search and k-opt local search, are proposed for the unconstrained binary quadratic programming problem (BQP). These heuristics are well suited for the incorporation into meta-heuristics such as evolutionary algorithms. Their performance is c... | is given, and a binary vector of length n is searched, such that the quantity
is maximized. This problem is also known as the (unconstrained) quadratic bivalent programming
problem, the (unconstrained) quadratic zero{one programming problem, or the (uncon-
strained) quadratic (pseudo-) Boolean programming problem (Beas... | local search;greedy heuristics;unconstrained quadratic binary programming |
595086 | Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem. | For hard optimization problems, it is difficult to design heuristic algorithms which exhibit uniformly superior performance for all problem instances. As a result it becomes necessary to tailor the algorithms based on the problem instance. In this paper, we introduce the use of a cooperative problem solving team of heu... | Introduction
One of the major goals of a production facility is to utilize its inventory in the best possible
way to satisfy demand. In make-to-order production systems, such as the process
industry, a surplus inventory accumulates due to cancellations of orders and rejection
of production units for failing to satisfy ... | cooperation;bicriteria;multiple knapsack;multiple heuristics;asynchronous teams |
595245 | Lightweight Reasoning about Program Correctness. | Automated verification tools vary widely in the types of properties they are able to analyze, the complexity of their algorithms, and the amount of necessary user involvement. In this paper we propose a framework for step-wise automatic verification and describe a lightweight scalable program analysis tool that combine... | Introduction
Recent years have seen an increasing interest in computer-supported
techniques for analyzing correctness of software
artifacts. In particular, this interest is caused by the effectiveness
and potential of lightweight formal methods [18].
In this approach, verification consists of automated checking
of an a... | program analysis;CTL;abstract interpretation;model checking |
595282 | A KDD framework to support database audit. | Understanding data semantics from real-life databases is considered following an audit perspective: it must help experts to analyse what properties actually hold in the data and support the comparison with desired properties. This is a typical problem of knowledge discovery in databases (KDD) and it is specified wi... | Introduction
We are interested in understanding data semantics from real-life databases.
This process is considered following an audit perspective in the following sense:
it must help experts to analyse what properties actually hold in the data and
support the comparison with desired properties. This research paper tak... | reverse engineering;data mining;integrity constraint |
595383 | Robot Pose Estimation in Unknown Environments by Matching 2D Range Scans. | A mobile robot exploring an unknown environment has no absolute frame of reference for its position, other than features it detects through its sensors. Using distinguishable landmarks is one possible approach, but it requires solving the object recognition problem. In particular, when the robot uses two-dimensional la... | Introduction
Previous research in mobile robotics has typically addressed several types of problems. The first
is path planning in the case of a perfectly known environment and perfect sensing. The optimality
criterion in this class of problems is the minimization of the cost for traversal between a start
and an end po... | rotation search;robot pose estimation;reference scan;aligning scans |
595863 | Temporalizing Epistemic Default Logic. | We present an epistemic default logic, based on the metaphore of a meta-level architecture. Upward reflection is formalized by a nonmonotonic entailment relation, based on the objective facts that are either known or unknown at the object level. Then, the meta (monotonic) reasoning process generates a number of default... | Introduction
In [MH93a,b] a nonmonotonic logic was introduced, called Epistemic Default Logic (EDL). It
is based on the metaphor of a meta-level architecture. It already has been established in
how upward reflection can be formalized by a nonmonotonic entailment based on
states, and the meta-level process by a (monoton... | default reasoning;temporal models;meta-level architectures;epistemic states |
595884 | Definability of Polyadic Lifts of Generalized Quantifiers. | We study generalized quantifiers on finite structures. With every function f : we associate a quantifier Q_f by letting Q_fx &phis; say there are at least f(n) elementsx satisfying &phis;, where n is the size of the universe. This is the general form of what is known as a monotone quantifier of type 1 . We study so ca... | to a given logic? Such questions can be quite hard. On finite models,
Partially supported by a grant from the University of Helsinki. This research was initiated
while the first author was a Junior Researcher at the Academy of Finland.
answering some of these questions would mean solving notoriously difficult open
prob... | resumption;ramsey quantifier;branching;finite model theory;generalized quantifier |
595891 | Reasoning about Information Change. | In this paper we introduce Dynamic Epistemic Logic, which is a logic for reasoning about information change in a multi-agent system. The information structures we use are based on non-well-founded sets, and can be conceived as bisimulation classes of Kripke models. On these structures, we define a notion of information... | Introduction
Recently the notions of information and information change have gained a
prominent place in several fields of scientific research, such as philosophy, the
formal semantics of natural language and computer science. The present paper
highlights two of such developments, namely the update semantics of Veltman... | dynamic logic;epistemic logic;non-well-founded set theory;information exchange |
595905 | Contexts in Dynamic Predicate Logic. | In this paper we introduce a notion of context for Groenendijk & Stokhofs Dynamic Predicate Logic DPL. We use these contexts to give a characterization of the relations on assignments that can be generated by composition from tests and random resettings in the case that we are working over an infinite domain. These rel... | Introduction
Dynamic Predicate Logic (DPL) was invented by Jeroen Groenendijk and Martin Stokhof (see [1], see
also our section 2) as a specification language (or better: as a module for a specification language)
of meanings for fragments of natural language. Most of the research concerning DPL has gone into
integratin... | variable;expressability;predicate logic;resetting;dynamics;context;register;relation;definability |
595906 | Communication across Viewpoints. | A case situation arising in a normal interaction among people is the baseline for discussing properties of the theory of viewpoints. In particular we consider how to ensure agreement on the meaning of certain utterances by agents who have different perspectives on the situation, while maintaning other knowledge as priv... | Introduction
When several agents interact, their understanding of each other behaviour depends on some common
knowledge they all share as well as on assumptions about each other private knowledge. The
question arises then of how such common knowledge comes about. Communication between agents
seems to involve two aspect... | metalevel theories;contexts;reflective theories;viewpoints;natural deduction |
595925 | Off-Line Parsability and the Well-Foundedness of Subsumption. | Typed feature structures are used extensively for the specification of linguistic information in many formalisms. The subsumption relation orders TFSs by their information content. We prove that subsumption of acyclic TFSs is well founded, whereas in the presence of cycles general TFS subsumption is not well founded. W... | Introduction
Feature structures serve as a means for the specification of linguistic information in current
linguistic formalisms such as LFG (Kaplan and Bresnan, 1982), HPSG (Pollard and Sag,
1994) or (some versions of) Categorial Grammar (Haddock, Klein, and Morill, 1987). This
paper focuses on typed feature structur... | parsing;computational linguistics;feature structures;unification |
595932 | Group Theory and Computational Linguistics. | There is currently much interest in bringing together the tradition of categorial grammar, and especially the Lambek calculus, with the recent paradigm of linear logic to which it has strong ties. One active research area is designing non-commutative versions of linear logic (Abrusci, 1995; Retor, 1993) which can be se... | Introduction
There is currently much interest in bringing together the tradition of categorial
grammar, and especially the Lambek calculus [10], with the more recent
paradigm of linear logic [8] to which it has strong ties. One active research area
concerns the design of non-commutative versions of linear logic [1, 14]... | parsing;generation;group theory;diagrams |
595959 | On Automating Diagrammatic Proofs of Arithmetic Arguments. | Theorems in automated theorem proving are usually proved by formal logical proofs. However, there is a subset of problems which humans can prove by the use of geometric operations on diagrams, so called diagrammatic proofs. Insight is often more clearly perceived in these proofs than in the corresponding algebraic proo... | Introduction
It requires only basic secondary school knowledge of mathematics to
realise that the diagram above is a proof of a theorem about the sum
of odd naturals.
It is an interesting property of diagrams that allows us to "see" and
understand so much just by looking at a simple diagram. Not only do
Portions of thi... | automated reasoning;theorem proving;diagrammatic reasoning |
595967 | A New Criterion for Comparing Fuzzy Logics for Uncertain Reasoning. | A new criterion is introduced for judging the suitability of various fuzzy logics for practical uncertain reasoning in a probabilistic world and the relationship of this criterion to several established criteria, and its consequences for truth functional belief, are investigated. | Introduction
It is a rather widespread assumption in uncertain reasoning, and one that we
shall make for the purpose of this paper, that a piece of uncertain knowledge
can be adequately captured by attaching a real number (signifying the degree of
uncertainty) on some scale to some unequivocal statement or conditional,... | uncertain reasoning;truth functional belief;fuzzy logic;probability logic |
595997 | Beyond the Turing Test. | The main factor of intelligence is defined as the ability to comprehend, formalising this ability with the help of new constructs based on descriptional complexity. The result is a comprehension test, or C-test, which is exclusively defined in computational terms. Due to its absolute and non-anthropomorphic charact... | Introduction
iThe original question, 'Can machines think?' I believe to be too meaningless
to deserve discussionj (Turing 1950). Turing's intention was to leave behind
that question and motivate the endeavour for making machines intelligent.
Fifty years of philosophical discussions have shown that his goal has not
been... | comprehension;measurement of intelligence;descriptional complexity;AI's anthropomorphism;inductive Inference;turing test;psychometrics |
596040 | The Constraint Language for Lambda Structures. | This paper presents the Constraint Language for Lambda Structures (CLLS), a first-order language for semantic underspecification that conservatively extends dominance constraints. It is interpreted over lambda structures, tree-like structures that encode -terms. Based on CLLS, we present an underspecified, uniform anal... | Introduction
Underspecication is a recent approach to the issue of combinatorial
explosion caused by ambiguity. Its key idea is to derive a single, compact
description of all readings instead of the (exponential number
of) readings themselves. For as long as possible, later processing steps
operate on these description... | underspecification;ellipsis;anaphora;tree descriptions;scope ambiguity |
596041 | Towards the Use of Automated Reasoning in Discourse Disambiguation. | In this paper, we claim that the disambiguation of referring expressions in discourse can be formulated in terms automated reasoners can address. Specifically, we show that consistency, informativity and minimality are criteria which (i) can be implemented using automated reasoning tools and (ii) can be used to disambi... | Introduction
It has long been thought that much of the burden of Natural Language
understanding and generation in automated systems could be carried
by inference. The most obvious early example of this is Winograd's
SHRDLU system (1973), implemented in PLANNER (Hewitt, 1969),
the earliest logic programming language. SH... | automated reasoning;discourse;semantics |
596141 | On the Complexity of Semidefinite Programs. | We show that the feasibility of a system of m linear inequalities over the cone of symmetric positive semidefinite matrices of order n can be tested in mn^O(min{m,n^2}) arithmetic operations with ln^O(min{m,n^2})-bit numbers, where l is the maximum binary size of the input coefficients. We also show that any feasible s... | Introduction
This paper is concerned with the general semidefinite feasibility problem
Given integral n \Theta n symmetric matrices A
whether there exists a real n \Theta n symmetric matrix X such that
where A ffl denotes the standard inner product on the space of real symmetric
matrices and the notation (\Delta) - 0 i... | complexity;bounds on solutions;semidefinite programming |
596157 | A Stochastic/Perturbation Global Optimization Algorithm for Distance Geometry Problems. | We present a new global optimization approach for solving exactly or inexactly constrained distance geometry problems. Distance geometry problems are concerned with determining spatial structures from measurements of internal distances. They arise in the structural interpretation of nuclear magnetic resonance data and ... | Introduction
Distance geometry problems, which are concerned with determining spatial
structures from measurements of internal distances, arise in the structural
interpretation of nuclear magnetic resonance data and in the prediction of
protein structure. Methods of calculating the conformations of biological
molecules... | lennard-jones cluster;global optimization;molecular conformation |
596192 | A Constraint Satisfaction Approach to a Circuit Design Problem. | A classical circuit-design problem from Ebers and Moll (1954) features a system of nine nonlinear equations in nine variables that is very challenging both for local and global methods. This system was solved globally using an interval method by Ratschek and Rokne (1993) in the box [0, 10]^9. Their algorithm had enormo... | Introduction
The transistor modeling problem of Ebers and Moll [6] is the system of nonlinear equations
where the constants g ik are given by
5.2095 10.0677 22.9274 20.2153
28.5132 111.8467 134.3884 211.4823
The problem is very challenging both for local and global methods because small variations in
the inputs produce... | interval methods;branch and prune;constraint satisfaction;transistor modelling;electrical circuit;global zero search |
596220 | Comparing Nonsmooth Nonconvex Bundle Methods in Solving Hemivariational Inequalities. | Hemivariational inequalities can be considered as a generalization of variational inequalities. Their origin is in nonsmooth mechanics of solid, especially in nonmonotone contact problems. The solution of a hemivariational inequality proves to be a substationary point of some functional, and thus can be found by the no... | Introduction
Hemivariational inequalities introduced by Panagiotopoulos are generalizations
of variational inequalities. By means of them problems involving
nonmonotone and multivalued constitutive laws and boundary conditions
can be defined mathematically. In many cases hemivariational
inequalities can be reformulated... | bundle methods;hemivariational inequalities;nondifferentiable programming;nonmonotone contact problems;substationary points |
596236 | Global Optimization by Multilevel Coordinate Search. | Inspired by a method by Jones et al. (1993), we present a global optimization algorithm based on multilevel coordinate search. It is guaranteed to converge if the function is continuous in the neighborhood of a global minimizer. By starting a local search from certain good points, an improved convergence result is obta... | Introduction
Problems involving global optimization (traditionally usually minimization) of a multivariate
function are widespread in the mathematical modeling of real world systems
for a broad range of applications (see, e.g., Pint' er [18]). Many problems
can be described only by nonlinear relationships, which introd... | local optimization;coordinate search;global optimization;bound constraints |
596237 | Efficient and Adaptive Lagrange-Multiplier Methods for Nonlinear Continuous Global Optimization. | Lagrangian methods are popular in solving continuous constrained optimization problems. In this paper, we address three important issues in applying Lagrangian methods to solve optimization problems with inequality constraints.First, we study methods to transform inequality constraints into equality constraints. An exi... | Introduction
Many applications in engineering, decision science and operation research are formulated as optimization
problems. These applications include digital signal processing, structure optimization,
engineering design, neural-network learning, computer-aided design for VLSI, and chemical control
processing. High... | trace-based search method;adaptive weights;lagrange-multiplier method;oscillations;convergence speed;local search;nonlinear continuous constrained optimization;inequality constraints;global search |
596250 | A Geometric Approach to Global Optimization. | In this paper we consider the problem of optimizing a piecewise-linear objective function over a non-convex domain. In particular we do not allow the solution to lie in the interior of a prespecified region R. We discuss the geometrical properties of this problems and present algorithms based on combinatorial arguments... | Introduction
The solution of piecewise linear programs has always played a special role in
optimization.
In general, piecewise-linearities are often employed to give a more realistic description
of costs than can be achieved by linear terms alone. Also in worst case
analysis piecewise linearity arises naturally.
Furthe... | discretization;piecewise linear programs;reverse convex constraints;geometric approach |
596347 | Solving the Sum-of-Ratios Problem by an Interior-Point Method. | We consider the problem of minimizing the sum of a convex function and of p1 fractions subject to convex constraints. The numerators of the fractions are positive convex functions, and the denominators are positive concave functions. Thus, each fraction is quasi-convex. We give a brief discussion of the problem and pro... | Introduction
Nonlinear programming problems often involve objective functions that
can be expressed in terms of one or several ratios. Exploiting the special
structure of such fractional programs has been the subject of extensive
studies in the last few decades. For an overview of fractional program-
ming, we refer the... | convex subproblem;interior-point method;sum of ratios;knapsack problem;cNcP-completeness;fractional programming;global optimum |
596351 | On Copositive Programming and Standard Quadratic Optimization Problems. | A standard quadratic problem consists of finding global maximizers of a quadratic form over the standard simplex. In this paper, the usual semidefinite programming relaxation is strengthened by replacing the cone of positive semidefinite matrices by the cone of completely positive matrices (the positive semidefinite ma... | Introduction
A standard quadratic problem (standard QP) consists of nding global maximizers of a
quadratic form over the standard simplex, i.e. we consider global optimization problems
of the form
subject to x 2 ; (1)
Paper presented at the GO99 conference, Firenze, Sept. 28{Oct. 2, 1999. I.M.B. and M.D. thank
M. Loca... | positive semidefinite matrices;copositive programming;standard quadratic optimization;global maximization |
596362 | Global Optimization of Marginal Functions with Applications to Economic Equilibrium. | We discuss the applicability of the cutting angle method to global minimization of marginal functions. The search of equilibrium prices in the exchange model can be reduced to the global minimization of certain functions, which include marginal functions. This problem has been approximately solved by the cutting angle ... | Introduction
Marginal functions, that is, functions of the form
where a is a set-valued mapping, have been intensively studied by many researches, (see,
for example, [11, 16, 14] and references therein).
Note, that the so-called max function:
is the simplest example of a marginal function. Here Y can be considered as t... | global optimization;exchange model;cutting angle method;marginal function;economic equilibrium |
596473 | Solving Standard Quadratic Optimization Problems via Linear, Semidefinite and Copositive Programming. | The problem of minimizing a (non-convex) quadratic function over the simplex (the standard quadratic optimization problem) has an exact convex reformulation as a copositive programming problem. In this paper we show how to approximate the optimal solution by approximating the cone of copositive matrices via systems of ... | Introduction
A standard quadratic optimization problem (standard QP) consists of nding global minimizers of a
quadratic form over the standard simplex, i.e. we consider global optimization problems of the form
x > Qx (1)
where Q is an arbitrary symmetric n n matrix; a > denotes transposition; and is the standard
simp... | linear matrix inequalities;approximation algorithms;stability number;standard quadratic optimization;semidefinite programming;copositive cone |
596513 | Active Management Framework for Distributed Multimedia Systems. | The successful deployment of next-generation distributed multimedia systems is significantly dependent on the efficient management support that improves the performance and reliability of such applications at run-time. In this paper, we describe an active management framework based on programmable monitoring agents and... | Introduction
The next-generation distributed multimedia systems are large-scale, resource intensive and
highly dynamic. With the increasing demands of deploying large-scale distributed multi-media
(LDM) systems, an efficient on-line monitoring and control has become an essential
service for improving the performance an... | multimedia systems;application steering;active networks;event correlation;distributed systems management |
596514 | Open Extensible Network Control. | Network control is decomposed in six parts: switch control, resource partitioning, virtual network building, virtual network control, generic services, and data-path components. Each of these parts can benefit from support for dynamically loadable code, which allows users to extend and customize the basic functionality... | Introduction
Recent years have seen a flurry of papers on new directions in network control, either by opening
up network control [1, 2], or by allowing packets on the data-path to program the network nodes, as
proposed by the active networks community [3, 4]. Drawing from experience in both of these areas,
we designed... | policing;virtual networks;active networks;open control;elastic control |
596687 | Edge Provisioning and Fairness in VPN-DiffServ Networks. | Customers of Virtual Private Networks (VPNs) over Differentiated Services (DiffServ) infrastructure are most likely to demand not only security but also guaranteed Quality-of-Service (QoS) in pursuance of their desire to have leased-line-like services. However, expectedly they will be unable or unwilling to predict the... | INTRODUCTION
There is a growing demand that since private networks built on using
dedicated lines offer guaranteed bandwidth and latency, similar guarantees
be provided in IP based Virtual Private Networks (VPNs) [9], [14].
While the internet has not been designed to deliver performance guar-
antees, with the advent of... | fairness;resource provisioning;Bandwidth Broker BB;connection admission;dynamic configuration;Service Level Agreement SLA;Virtual Private Network VPN;Quality-of-Service QoS;Differentiated Services DiffServ |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.