Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
35,806 | Knowledge Discovery System For Fiber Reinforced Polymer Matrix Composite
Laminate | cs.AI | In this paper Knowledge Discovery System (KDS) is proposed and implemented
for the extraction of knowledge-mean stiffness of a polymer composite material
in which when fibers are placed at different orientations. Cosine amplitude
method is implemented for retrieving compatible polymer matrix and
reinforcement fiber whi... | computer science |
35,807 | Similarity Measuring Approuch for Engineering Materials Selection | cs.AI | Advanced engineering materials design involves the exploration of massive
multidimensional feature spaces, the correlation of materials properties and
the processing parameters derived from disparate sources. The search for
alternative materials or processing property strategies, whether through
analytical, experimenta... | computer science |
35,808 | Markov Equivalence Classes for Maximal Ancestral Graphs | cs.AI | Ancestral graphs are a class of graphs that encode conditional independence
relations arising in DAG models with latent and selection variables,
corresponding to marginalization and conditioning. However, for any ancestral
graph, there may be several other graphs to which it is Markov equivalent. We
introduce a simple ... | computer science |
35,809 | Coordinates: Probabilistic Forecasting of Presence and Availability | cs.HC | We present methods employed in Coordinate, a prototype service that supports
collaboration and communication by learning predictive models that provide
forecasts of users s AND availability.We describe how data IS collected about
USER activity AND proximity FROM multiple devices, IN addition TO analysis OF
the content ... | computer science |
35,810 | CFW: A Collaborative Filtering System Using Posteriors Over Weights Of
Evidence | cs.IR | We describe CFW, a computationally efficient algorithm for collaborative
filtering that uses posteriors over weights of evidence. In experiments on real
data, we show that this method predicts as well or better than other methods in
situations where the size of the user query is small. The new approach works
particular... | computer science |
35,811 | Efficient Nash Computation in Large Population Games with Bounded
Influence | cs.GT | We introduce a general representation of large-population games in which each
player s influence ON the others IS centralized AND limited, but may otherwise
be arbitrary.This representation significantly generalizes the class known AS
congestion games IN a natural way.Our main results are provably correct AND
efficient... | computer science |
35,812 | Polynomial Value Iteration Algorithms for Detrerminstic MDPs | cs.AI | Value iteration is a commonly used and empirically competitive method in
solving many Markov decision process problems. However, it is known that value
iteration has only pseudo-polynomial complexity in general. We establish a
somewhat surprising polynomial bound for value iteration on deterministic
Markov decision (DM... | computer science |
35,813 | Modelling Information Incorporation in Markets, with Application to
Detecting and Explaining Events | cs.AI | We develop a model of how information flows into a market, and derive
algorithms for automatically detecting and explaining relevant events. We
analyze data from twenty-two "political stock markets" (i.e., betting markets
on political outcomes) on the Iowa Electronic Market (IEM). We prove that,
under certain efficienc... | computer science |
35,814 | Particle Filters in Robotics (Invited Talk) | cs.RO | This presentation will introduce the audience to a new, emerging body of
research on sequential Monte Carlo techniques in robotics. In recent years,
particle filters have solved several hard perceptual robotic problems. Early
successes were limited to low-dimensional problems, such as the problem of
robot localization ... | computer science |
35,815 | Similarity Assessment through blocking and affordance assignment in
Textual CBR | cs.IR | It has been conceived that children learn new objects through their
affordances, that is, the actions that can be taken on them. We suggest that
web pages also have affordances defined in terms of the users' information need
they meet. An assumption of the proposed approach is that different parts of a
text may not be ... | computer science |
35,816 | Knowledge Sharing: A Model | cs.SI | We know anything because we learn about it, there is anything we ever share
about it, but now a lot of media that can represent how it happened as
infrastructure of the knowledge sharing. This paper aims to introduce a model
for understanding a problem in knowledge sharing based on interaction. | computer science |
35,817 | A Logic Programming Approach to Integration Network Inference | cs.DB | The discovery, representation and reconstruction of (technical) integration
networks from Network Mining (NM) raw data is a difficult problem for
enterprises. This is due to large and complex IT landscapes within and across
enterprise boundaries, heterogeneous technology stacks, and fragmented data. To
remain competiti... | computer science |
35,818 | SPARC - Sorted ASP with Consistency Restoring Rules | cs.PL | This is a preliminary report on the work aimed at making CR-Prolog -- a
version of ASP with consistency restoring rules -- more suitable for use in
teaching and large applications. First we describe a sorted version of
CR-Prolog called SPARC. Second, we translate a basic version of the CR-Prolog
into the language of DL... | computer science |
35,819 | Eliminating Unfounded Set Checking for HEX-Programs | cs.LO | HEX-programs are an extension of the Answer Set Programming (ASP) paradigm
incorporating external means of computation into the declarative programming
language through so-called external atoms. Their semantics is defined in terms
of minimal models of the Faber-Leone-Pfeifer (FLP) reduct. Developing native
solvers for ... | computer science |
35,820 | Two New Definitions of Stable Models of Logic Programs with Generalized
Quantifiers | cs.LO | We present alternative definitions of the first-order stable model semantics
and its extension to incorporate generalized quantifiers by referring to the
familiar notion of a reduct instead of referring to the SM operator in the
original definitions. Also, we extend the FLP stable model semantics to allow
generalized q... | computer science |
35,821 | Lloyd-Topor Completion and General Stable Models | cs.LO | We investigate the relationship between the generalization of program
completion defined in 1984 by Lloyd and Topor and the generalization of the
stable model semantics introduced recently by Ferraris et al. The main theorem
can be used to characterize, in some cases, the general stable models of a
logic program by a f... | computer science |
35,822 | Extending FO(ID) with Knowledge Producing Definitions: Preliminary
Results | cs.LO | Previous research into the relation between ASP and classical logic has
identified at least two different ways in which the former extends the latter.
First, ASP program typically contain sets of rules that can be naturally
interpreted as inductive definitions, and the language FO(ID) has shown that
such inductive defi... | computer science |
35,823 | Object-oriented Bayesian networks for a decision support system for
antitrust enforcement | cs.AI | We study an economic decision problem where the actors are two firms and the
Antitrust Authority whose main task is to monitor and prevent firms' potential
anti-competitive behaviour and its effect on the market. The Antitrust
Authority's decision process is modelled using a Bayesian network where both
the relational s... | computer science |
35,824 | Fuzzy Soft Set Based Classification for Gene Expression Data | cs.AI | Classification is one of the major issues in Data Mining Research fields. The
classification problems in medical area often classify medical dataset based on
the result of medical diagnosis or description of medical treatment by the
medical practitioner. This research work discusses the classification process
of Gene E... | computer science |
35,825 | FCA - An Approach On LEACH Protocol Of Wireless Sensor Networks Using
Fuzzy Logic | cs.NI | In order to gather information more efficiently, wireless sensor networks are
partitioned into clusters. The most of the proposed clustering algorithms do
not consider the location of the base station. This situation causes hot spots
problem in multi-hop wireless sensor networks. In this paper, we propose a
fuzzy clust... | computer science |
35,826 | An Approach for Classification of Dysfluent and Fluent Speech Using K-NN
And SVM | cs.SD | This paper presents a new approach for classification of dysfluent and fluent
speech using Mel-Frequency Cepstral Coefficient (MFCC). The speech is fluent
when person's speech flows easily and smoothly. Sounds combine into syllable,
syllables mix together into words and words link into sentences with little
effort. Whe... | computer science |
35,827 | Efficient Approximation for Triangulation of Minimum Treewidth | cs.DS | We present four novel approximation algorithms for finding triangulation of
minimum treewidth. Two of the algorithms improve on the running times of
algorithms by Robertson and Seymour, and Becker and Geiger that approximate the
optimum by factors of 4 and 3 2/3, respectively. A third algorithm is faster
than those but... | computer science |
35,828 | Pre-processing for Triangulation of Probabilistic Networks | cs.AI | The currently most efficient algorithm for inference with a probabilistic
network builds upon a triangulation of a network's graph. In this paper, we
show that pre-processing can help in finding good triangulations
forprobabilistic networks, that is, triangulations with a minimal maximum
clique size. We provide a set o... | computer science |
35,829 | Instrumentality Tests Revisited | cs.AI | An instrument is a random variable thatallows the identification of
parameters inlinear models when the error terms arenot uncorrelated.It is a
popular method used in economicsand the social sciences that reduces theproblem
of identification to the problemof finding the appropriate instruments.Few
years ago, Pearl intr... | computer science |
35,830 | Using Bayesian Networks to Identify the Causal Effect of Speeding in
Individual Vehicle/Pedestrian Collisions | cs.AI | On roads showing significant violations of posted speed limits, one measure
of the safety effect of speeding is the difference between the road's actual
accident count and the count that would have occurred if the posted speed limit
had been strictly obeyed. An estimate of this accident reduction can be had by
computin... | computer science |
35,831 | Efficient Stepwise Selection in Decomposable Models | cs.AI | In this paper, we present an efficient way of performing stepwise selection
in the class of decomposable models. The main contribution of the paper is a
simple characterization of the edges that canbe added to a decomposable model
while keeping the resulting model decomposable and an efficient algorithm for
enumerating... | computer science |
35,832 | Robust Combination of Local Controllers | cs.AI | Planning problems are hard, motion planning, for example, isPSPACE-hard. Such
problems are even more difficult in the presence of uncertainty. Although,
Markov Decision Processes (MDPs) provide a formal framework for such problems,
finding solutions to high dimensional continuous MDPs is usually difficult,
especially w... | computer science |
35,833 | A Clustering Approach to Solving Large Stochastic Matching Problems | cs.AI | In this work we focus on efficient heuristics for solving a class of
stochastic planning problems that arise in a variety of business, investment,
and industrial applications. The problem is best described in terms of future
buy and sell contracts. By buying less reliable, but less expensive, buy
(supply) contracts, a ... | computer science |
35,834 | Graphical Models for Game Theory | cs.GT | In this work, we introduce graphical modelsfor multi-player game theory, and
give powerful algorithms for computing their Nash equilibria in certain cases.
An n-player game is given by an undirected graph on n nodes and a set of n
local matrices. The interpretation is that the payoff to player i is determined
entirely ... | computer science |
35,835 | Direct and Indirect Effects | cs.AI | The direct effect of one eventon another can be defined and measured
byholding constant all intermediate variables between the two.Indirect effects
present conceptual andpractical difficulties (in nonlinear models), because
they cannot be isolated by holding certain variablesconstant. This paper shows
a way of defining... | computer science |
35,836 | A Mixed Graphical Model for Rhythmic Parsing | cs.AI | A method is presented for the rhythmic parsing problem: Given a sequence of
observed musical note onset times, we estimate the corresponding notated rhythm
and tempo process. A graphical model is developed that represents the
simultaneous evolution of tempo and rhythm and relates these hidden quantities
to observations... | computer science |
35,837 | Airport Gate Scheduling for Passengers, Aircraft, and Operation | cs.SY | Passengers' experience is becoming a key metric to evaluate the air
transportation system's performance. Efficient and robust tools to handle
airport operations are needed along with a better understanding of passengers'
interests and concerns. Among various airport operations, this paper studies
airport gate schedulin... | computer science |
35,838 | Learning Stable Group Invariant Representations with Convolutional
Networks | cs.AI | Transformation groups, such as translations or rotations, effectively express
part of the variability observed in many recognition problems. The group
structure enables the construction of invariant signal representations with
appealing mathematical properties, where convolutions, together with pooling
operators, bring... | computer science |
35,839 | Fast Planning in Stochastic Games | cs.GT | Stochastic games generalize Markov decision processes (MDPs) to a multiagent
setting by allowing the state transitions to depend jointly on all player
actions, and having rewards determined by multiplayer matrix games at each
state. We consider the problem of computing Nash equilibria in stochastic
games, the analogue ... | computer science |
35,840 | Game Networks | cs.GT | We introduce Game networks (G nets), a novel representation for multi-agent
decision problems. Compared to other game-theoretic representations, such as
strategic or extensive forms, G nets are more structured and more compact; more
fundamentally, G nets constitute a computationally advantageous framework for
strategic... | computer science |
35,841 | Combinatorial Optimization by Learning and Simulation of Bayesian
Networks | cs.AI | This paper shows how the Bayesian network paradigm can be used in order to
solve combinatorial optimization problems. To do it some methods of structure
learning from data and simulation of Bayesian networks are inserted inside
Estimation of Distribution Algorithms (EDA). EDA are a new tool for
evolutionary computation... | computer science |
35,842 | Probabilistic Models for Query Approximation with Large Sparse Binary
Datasets | cs.AI | Large sparse sets of binary transaction data with millions of records and
thousands of attributes occur in various domains: customers purchasing
products, users visiting web pages, and documents containing words are just
three typical examples. Real-time query selectivity estimation (the problem of
estimating the numbe... | computer science |
35,843 | When you talk about "Information processing" what actually do you have
in mind? | cs.AI | "Information Processing" is a recently launched buzzword whose meaning is
vague and obscure even for the majority of its users. The reason for this is
the lack of a suitable definition for the term "information". In my attempt to
amend this bizarre situation, I have realized that, following the insights of
Kolmogorov's... | computer science |
35,844 | Applying machine learning techniques to improve user acceptance on
ubiquitous environement | cs.IR | Ubiquitous information access becomes more and more important nowadays and
research is aimed at making it adapted to users. Our work consists in applying
machine learning techniques in order to adapt the information access provided
by ubiquitous systems to users when the system only knows the user social
group, without... | computer science |
35,845 | From Quantitative Spatial Operator to Qualitative Spatial Relation Using
Constructive Solid Geometry, Logic Rules and Optimized 9-IM Model, A Semantic
Based Approach | cs.CG | The Constructive Solid Geometry (CSG) is a data model providing a set of
binary Boolean operators such as Union, Difference and Intersection. In this
work, these operators are used to compute topological relations between objects
defined by the constraints of the nine Intersection Model (9-IM) from
Egenhofer. With the ... | computer science |
35,846 | From 3D Point Clouds To Semantic Objects An Ontology-Based Detection
Approach | cs.CG | This paper presents a knowledge-based detection of objects approach using the
OWL ontology language, the Semantic Web Rule Language, and 3D processing
built-ins aiming at combining geometrical analysis of 3D point clouds and
specialist's knowledge. This combination allows the detection and the
annotation of objects con... | computer science |
35,847 | Integration of knowledge to support automatic object reconstruction from
images and 3D data | cs.CG | Object reconstruction is an important task in many fields of application as
it allows to generate digital representations of our physical world used as
base for analysis, planning, construction, visualization or other aims. A
reconstruction itself normally is based on reliable data (images, 3D point
clouds for example)... | computer science |
35,848 | Computational Aspects of the Calculus of Structure | cs.LO | Logic is the science of correct inferences and a logical system is a tool to
prove assertions in a certain logic in a correct way. There are many logical
systems, and many ways of formalizing them, e.g., using natural deduction or
sequent calculus. Calculus of structures (CoS) is a new formalism proposed by
Alessio Gug... | computer science |
35,849 | Toward the Automatic Generation of a Semantic VRML Model from
Unorganized 3D Point Clouds | cs.CG | This paper presents our experience regarding the creation of 3D semantic
facility model out of unorganized 3D point clouds. Thus, a knowledge-based
detection approach of objects using the OWL ontology language is presented.
This knowledge is used to define SWRL detection rules. In addition, the
combination of 3D proces... | computer science |
35,850 | Identifying Playerś Strategies in No Limit Texas Holdém Poker
through the Analysis of Individual Moves | cs.AI | The development of competitive artificial Poker playing agents has proven to
be a challenge, because agents must deal with unreliable information and
deception which make it essential to model the opponents in order to achieve
good results. This paper presents a methodology to develop opponent modeling
techniques for P... | computer science |
35,851 | Ontology-based Data Access: A Study through Disjunctive Datalog, CSP,
and MMSNP | cs.DB | Ontology-based data access is concerned with querying incomplete data sources
in the presence of domain-specific knowledge provided by an ontology. A central
notion in this setting is that of an ontology-mediated query, which is a
database query coupled with an ontology. In this paper, we study several
classes of ontol... | computer science |
35,852 | An Application of Uncertain Reasoning to Requirements Engineering | cs.SE | This paper examines the use of Bayesian Networks to tackle one of the tougher
problems in requirements engineering, translating user requirements into system
requirements. The approach taken is to model domain knowledge as Bayesian
Network fragments that are glued together to form a complete view of the domain
specific... | computer science |
35,853 | Continuous Value Function Approximation for Sequential Bidding Policies | cs.AI | Market-based mechanisms such as auctions are being studied as an appropriate
means for resource allocation in distributed and mulitagent decision problems.
When agents value resources in combination rather than in isolation, they must
often deliberate about appropriate bidding strategies for a sequence of
auctions offe... | computer science |
35,854 | Quantifier Elimination for Statistical Problems | cs.AI | Recent improvement on Tarski's procedure for quantifier elimination in the
first order theory of real numbers makes it feasible to solve small instances
of the following problems completely automatically: 1. listing all equality and
inequality constraints implied by a graphical model with hidden variables. 2.
Comparing... | computer science |
35,855 | Attention-Sensitive Alerting | cs.AI | We introduce utility-directed procedures for mediating the flow of
potentially distracting alerts and communications to computer users. We present
models and inference procedures that balance the context-sensitive costs of
deferring alerts with the cost of interruption. We describe the challenge of
reasoning about such... | computer science |
35,856 | Bayesian Poker | cs.AI | Poker is ideal for testing automated reasoning under uncertainty. It
introduces uncertainty both by physical randomization and by incomplete
information about opponents hands.Another source OF uncertainty IS the limited
information available TO construct psychological models OF opponents, their
tendencies TO bluff, pla... | computer science |
35,857 | Expected Utility Networks | cs.GT | We introduce a new class of graphical representations, expected utility
networks (EUNs), and discuss some of its properties and potential applications
to artificial intelligence and economic theory. In EUNs not only probabilities,
but also utilities enjoy a modular representation. EUNs are undirected graphs
with two ty... | computer science |
35,858 | Learning Finite-State Controllers for Partially Observable Environments | cs.AI | Reactive (memoryless) policies are sufficient in completely observable Markov
decision processes (MDPs), but some kind of memory is usually necessary for
optimal control of a partially observable MDP. Policies with finite memory can
be represented as finite-state automata. In this paper, we extend Baird and
Moore's VAP... | computer science |
35,859 | The Decision-Theoretic Interactive Video Advisor | cs.IR | The need to help people choose among large numbers of items and to filter
through large amounts of information has led to a flood of research in
construction of personal recommendation agents. One of the central issues in
constructing such agents is the representation and elicitation of user
preferences or interests. T... | computer science |
35,860 | Inference Networks and the Evaluation of Evidence: Alternative Analyses | cs.AI | Inference networks have a variety of important uses and are constructed by
persons having quite different standpoints. Discussed in this paper are three
different but complementary methods for generating and analyzing probabilistic
inference networks. The first method, though over eighty years old, is very
useful for k... | computer science |
35,861 | An Update Semantics for Defeasible Obligations | cs.AI | The deontic logic DUS is a Deontic Update Semantics for prescriptive
obligations based on the update semantics of Veltman. In DUS the definition of
logical validity of obligations is not based on static truth values but on
dynamic action transitions. In this paper prescriptive defeasible obligations
are formalized in u... | computer science |
35,862 | Bayesian Control for Concentrating Mixed Nuclear Waste | cs.AI | A control algorithm for batch processing of mixed waste is proposed based on
conditional Gaussian Bayesian networks. The network is compiled during batch
staging for real-time response to sensor input. | computer science |
35,863 | Query Expansion in Information Retrieval Systems using a Bayesian
Network-Based Thesaurus | cs.IR | Information Retrieval (IR) is concerned with the identification of documents
in a collection that are relevant to a given information need, usually
represented as a query containing terms or keywords, which are supposed to be a
good description of what the user is looking for. IR systems may improve their
effectiveness... | computer science |
35,864 | Psychological and Normative Theories of Causal Power and the
Probabilities of Causes | cs.AI | This paper (1)shows that the best supported current psychological theory
(Cheng, 1997) of how human subjects judge the causal power or influence of
variations in presence or absence of one feature on another, given data on
their covariation, tacitly uses a Bayes network which is either a noisy or gate
(for causes that ... | computer science |
35,865 | The Lumiere Project: Bayesian User Modeling for Inferring the Goals and
Needs of Software Users | cs.AI | The Lumiere Project centers on harnessing probability and utility to provide
assistance to computer software users. We review work on Bayesian user models
that can be employed to infer a users needs by considering a user's background,
actions, and queries. Several problems were tackled in Lumiere research,
including (1... | computer science |
35,866 | Implementing Resolute Choice Under Uncertainty | cs.GT | The adaptation to situations of sequential choice under uncertainty of
decision criteria which deviate from (subjective) expected utility raises the
problem of ensuring the selection of a nondominated strategy. In particular,
when following the suggestion of Machina and McClennen of giving up
separability (also known a... | computer science |
35,867 | Dealing with Uncertainty on the Initial State of a Petri Net | cs.AI | This paper proposes a method to find the actual state of a complex dynamic
system from information coming from the sensors on the system himself, or on
its environment. The nominal evolution of the system is a priori known and can
be modeled (by an expert, for example), by different methods. In this paper,
the Petri ne... | computer science |
35,868 | Switching Portfolios | cs.AI | A constant rebalanced portfolio is an asset allocation algorithm which keeps
the same distribution of wealth among a set of assets along a period of time.
Recently, there has been work on on-line portfolio selection algorithms which
are competitive with the best constant rebalanced portfolio determined in
hindsight. By... | computer science |
35,869 | Toward a Dynamic Programming Solution for the 4-peg Tower of Hanoi
Problem with Configurations | cs.PL | The Frame-Stewart algorithm for the 4-peg variant of the Tower of Hanoi,
introduced in 1941, partitions disks into intermediate towers before moving the
remaining disks to their destination. Algorithms that partition the disks have
not been proven to be optimal, although they have been verified for up to 30
disks. This... | computer science |
35,870 | Efficient Partial Order CDCL Using Assertion Level Choice Heuristics | cs.AI | We previously designed Partial Order Conflict Driven Clause Learning
(PO-CDCL), a variation of the satisfiability solving CDCL algorithm with a
partial order on decision levels, and showed that it can speed up the solving
on problems with a high independence between decision levels. In this paper, we
more thoroughly an... | computer science |
35,871 | Entanglement Zoo I: Foundational and Structural Aspects | cs.AI | We put forward a general classification for a structural description of the
entanglement present in compound entities experimentally violating Bell's
inequalities, making use of a new entanglement scheme that we developed
recently. Our scheme, although different from the traditional one, is
completely compatible with s... | computer science |
35,872 | Entanglement Zoo II: Examples in Physics and Cognition | cs.AI | We have recently presented a general scheme enabling quantum modeling of
different types of situations that violate Bell's inequalities. In this paper,
we specify this scheme for a combination of two concepts. We work out a quantum
Hilbert space model where 'entangled measurements' occur in addition to the
expected 'en... | computer science |
35,873 | On the definition of a confounder | stat.ME | The causal inference literature has provided a clear formal definition of
confounding expressed in terms of counterfactual independence. The literature
has not, however, come to any consensus on a formal definition of a confounder,
as it has given priority to the concept of confounding over that of a
confounder. We con... | computer science |
35,874 | Coalitional Manipulation for Schulze's Rule | cs.AI | Schulze's rule is used in the elections of a large number of organizations
including Wikimedia and Debian. Part of the reason for its popularity is the
large number of axiomatic properties, like monotonicity and Condorcet
consistency, which it satisfies. We identify a potential shortcoming of
Schulze's rule: it is comp... | computer science |
35,875 | Occupancy Grids: A Stochastic Spatial Representation for Active Robot
Perception | cs.RO | In this paper we provide an overview of a new framework for robot perception,
real-world modelling, and navigation that uses a stochastic tesselated
representation of spatial information called the Occupancy Grid. The Occupancy
Grid is a multi-dimensional random field model that maintains probabilistic
estimates of the... | computer science |
35,876 | A New Approach to Updating Beliefs | cs.AI | We define a new notion of conditional belief, which plays the same role for
Dempster-Shafer belief functions as conditional probability does for
probability functions. Our definition is different from the standard definition
given by Dempster, and avoids many of the well-known problems of that
definition. Just as the c... | computer science |
35,877 | Pattern-Based Constraint Satisfaction and Logic Puzzles | cs.AI | Pattern-Based Constraint Satisfaction and Logic Puzzles develops a pure
logic, pattern-based perspective of solving the finite Constraint Satisfaction
Problem (CSP), with emphasis on finding the "simplest" solution. Different ways
of reasoning with the constraints are formalised by various families of
"resolution rules... | computer science |
35,878 | Simulated Car Racing Championship: Competition Software Manual | cs.AI | This manual describes the competition software for the Simulated Car Racing
Championship, an international competition held at major conferences in the
field of Evolutionary Computation and in the field of Computational
Intelligence and Games. It provides an overview of the architecture, the
instructions to install the... | computer science |
35,879 | Predicting the Likely Behaviors of Continuous Nonlinear Systems in
Equilibrium | cs.SY | This paper introduces a method for predicting the likely behaviors of
continuous nonlinear systems in equilibrium in which the input values can vary.
The method uses a parameterized equation model and a lower bound on the input
joint density to bound the likelihood that some behavior will occur, such as a
state variabl... | computer science |
35,880 | On Appropriate Selection of Fuzzy Aggregation Operators in Medical
Decision Support System | cs.AI | The Decision Support System (DSS) contains more than one antecedent and the
degrees of strength of the antecedents need to be combined to determine the
overall strength of the rule consequent. The membership values of the
linguistic variables in Fuzzy have to be combined using an aggregation
operator. But it is not fea... | computer science |
35,881 | Estimation Procedures for Robust Sensor Control | cs.SY | Many robotic sensor estimation problems can characterized in terms of
nonlinear measurement systems. These systems are contaminated with noise and
may be underdetermined from a single observation. In order to get reliable
estimation results, the system must choose views which result in an
overdetermined system. This is... | computer science |
35,882 | Statistical Mechanics Algorithm for Response to Targets (SMART) | cs.CE | It is proposed to apply modern methods of nonlinear nonequilibrium
statistical mechanics to develop software algorithms that will optimally
respond to targets within short response times with minimal computer resources.
This Statistical Mechanics Algorithm for Response to Targets (SMART) can be
developed with a view to... | computer science |
35,883 | General Quantum Hilbert Space Modeling Scheme for Entanglement | cs.AI | We work out a classification scheme for quantum modeling in Hilbert space of
any kind of composite entity violating Bell's inequalities and exhibiting
entanglement. Our theoretical framework includes situations with entangled
states and product measurements ('customary quantum situation'), and also
situations with both... | computer science |
35,884 | Unveiling the link between logical fallacies and web persuasion | cs.HC | In the last decade Human-Computer Interaction (HCI) has started to focus
attention on forms of persuasive interaction where computer technologies have
the goal of changing users behavior and attitudes according to a predefined
direction. In this work, we hypothesize a strong connection between logical
fallacies (forms ... | computer science |
35,885 | Off-policy Learning with Eligibility Traces: A Survey | cs.AI | In the framework of Markov Decision Processes, off-policy learning, that is
the problem of learning a linear approximation of the value function of some
fixed policy from one trajectory possibly generated by some other policy. We
briefly review on-policy learning algorithms of the literature (gradient-based
and least-s... | computer science |
35,886 | A Fuzzy Logic Based Certain Trust Model for E-Commerce | cs.AI | Trustworthiness especially for service oriented system is very important
topic now a day in IT field of the whole world. There are many successful
E-commerce organizations presently run in the whole world, but E-commerce has
not reached its full potential. The main reason behind this is lack of Trust of
people in e-com... | computer science |
35,887 | Efficient Computation of Mean Truncated Hitting Times on Very Large
Graphs | cs.DS | Previous work has shown the effectiveness of random walk hitting times as a
measure of dissimilarity in a variety of graph-based learning problems such as
collaborative filtering, query suggestion or finding paraphrases. However,
application of hitting times has been limited to small datasets because of
computational r... | computer science |
35,888 | Constraint Satisfaction over Generalized Staircase Constraints | cs.AI | One of the key research interests in the area of Constraint Satisfaction
Problem (CSP) is to identify tractable classes of constraints and develop
efficient solutions for them. In this paper, we introduce generalized staircase
(GS) constraints which is an important generalization of one such tractable
class found in th... | computer science |
35,889 | Interactive POMDP Lite: Towards Practical Planning to Predict and
Exploit Intentions for Interacting with Self-Interested Agents | cs.AI | A key challenge in non-cooperative multi-agent systems is that of developing
efficient planning algorithms for intelligent agents to interact and perform
effectively among boundedly rational, self-interested agents (e.g., humans).
The practicality of existing works addressing this challenge is being
undermined due to e... | computer science |
35,890 | Temporal Description Logic for Ontology-Based Data Access (Extended
Version) | cs.LO | Our aim is to investigate ontology-based data access over temporal data with
validity time and ontologies capable of temporal conceptual modelling. To this
end, we design a temporal description logic, TQL, that extends the standard
ontology language OWL 2 QL, provides basic means for temporal conceptual
modelling and e... | computer science |
35,891 | Local Backbones | cs.CC | A backbone of a propositional CNF formula is a variable whose truth value is
the same in every truth assignment that satisfies the formula. The notion of
backbones for CNF formulas has been studied in various contexts. In this paper,
we introduce local variants of backbones, and study the computational
complexity of de... | computer science |
35,892 | A Markov Model for Ontology Alignment | cs.DB | The explosion of available data along with the need to integrate and utilize
that data has led to a pressing interest in data integration techniques. In
terms of Semantic Web technologies, Ontology Alignment is a key step in the
process of integrating heterogeneous knowledge bases. In this paper, we present
the Edge Co... | computer science |
35,893 | Tight Performance Bounds for Approximate Modified Policy Iteration with
Non-Stationary Policies | math.OC | We consider approximate dynamic programming for the infinite-horizon
stationary $\gamma$-discounted optimal control problem formalized by Markov
Decision Processes. While in the exact case it is known that there always
exists an optimal policy that is stationary, we show that when using value
function approximation, lo... | computer science |
35,894 | Bargaining for Revenue Shares on Tree Trading Networks | cs.GT | We study trade networks with a tree structure, where a seller with a single
indivisible good is connected to buyers, each with some value for the good, via
a unique path of intermediaries. Agents in the tree make multiplicative revenue
share offers to their parent nodes, who choose the best offer and offer part of
it t... | computer science |
35,895 | Commonsense Reasoning and Large Network Analysis: A Computational Study
of ConceptNet 4 | cs.AI | In this report a computational study of ConceptNet 4 is performed using tools
from the field of network analysis. Part I describes the process of extracting
the data from the SQL database that is available online, as well as how the
closure of the input among the assertions in the English language is computed.
This par... | computer science |
35,896 | Decision-Theoretic Troubleshooting: Hardness of Approximation | cs.AI | Decision-theoretic troubleshooting is one of the areas to which Bayesian
networks can be applied. Given a probabilistic model of a malfunctioning
man-made device, the task is to construct a repair strategy with minimal
expected cost. The problem has received considerable attention over the past
two decades. Efficient s... | computer science |
35,897 | Relation-algebraic and Tool-supported Control of Condorcet Voting | cs.GT | We present a relation-algebraic model of Condorcet voting and, based on it,
relation-algebraic solutions of the constructive control problem via the
removal of voters.
We consider two winning conditions, viz. to be a Condorcet winner and to be
in the (Gilles resp. upward) uncovered set. For the first condition the co... | computer science |
35,898 | A Hybrid Rule Based Fuzzy-Neural Expert System For Passive Network
Monitoring | cs.AI | An enhanced approach for network monitoring is to create a network monitoring
tool that has artificial intelligence characteristics. There are a number of
approaches available. One such approach is by the use of a combination of rule
based, fuzzy logic and neural networks to create a hybrid ANFIS system. Such
system wi... | computer science |
35,899 | From Ordinary Differential Equations to Structural Causal Models: the
deterministic case | stat.OT | We show how, and under which conditions, the equilibrium states of a
first-order Ordinary Differential Equation (ODE) system can be described with a
deterministic Structural Causal Model (SCM). Our exposition sheds more light on
the concept of causality as expressed within the framework of Structural Causal
Models, esp... | computer science |
35,900 | Towards Detection of Bottlenecks in Modular Systems | cs.AI | The paper describes some basic approaches to detection of bottlenecks in
composite (modular) systems. The following basic system bottlenecks detection
problems are examined: (1) traditional quality management approaches (Pareto
chart based method, multicriteria analysis as selection of Pareto-efficient
points, and/or m... | computer science |
35,901 | Narrative based Postdictive Reasoning for Cognitive Robotics | cs.AI | Making sense of incomplete and conflicting narrative knowledge in the
presence of abnormalities, unobservable processes, and other real world
considerations is a challenge and crucial requirement for cognitive robotics
systems. An added challenge, even when suitably specialised action languages
and reasoning systems ex... | computer science |
35,902 | Iterated Tabu Search Algorithm for Packing Unequal Circles in a Circle | math.OC | This paper presents an Iterated Tabu Search algorithm (denoted by ITS-PUCC)
for solving the problem of Packing Unequal Circles in a Circle. The algorithm
exploits the continuous and combinatorial nature of the unequal circles packing
problem. It uses a continuous local optimization method to generate locally
optimal pa... | computer science |
35,903 | Finding Academic Experts on a MultiSensor Approach using Shannon's
Entropy | cs.AI | Expert finding is an information retrieval task concerned with the search for
the most knowledgeable people, in some topic, with basis on documents
describing peoples activities. The task involves taking a user query as input
and returning a list of people sorted by their level of expertise regarding the
user query. Th... | computer science |
35,904 | An Algorithm to Find Optimal Attack Paths in Nondeterministic Scenarios | cs.CR | As penetration testing frameworks have evolved and have become more complex,
the problem of controlling automatically the pentesting tool has become an
important question. This can be naturally addressed as an attack planning
problem. Previous approaches to this problem were based on modeling the actions
and assets in ... | computer science |
35,905 | Attack Planning in the Real World | cs.CR | Assessing network security is a complex and difficult task. Attack graphs
have been proposed as a tool to help network administrators understand the
potential weaknesses of their network. However, a problem has not yet been
addressed by previous work on this subject; namely, how to actually execute and
validate the att... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.