Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
36,807 | Qualitative shape representation based on the qualitative relative
direction and distance calculus eOPRAm | cs.AI | This document serves as a brief technical report, detailing the processes
used to represent and reconstruct simplified polygons using qualitative spatial
descriptions, as defined by the eOPRAm qualitative spatial calculus. | computer science |
36,808 | Quantifying Natural and Artificial Intelligence in Robots and Natural
Systems with an Algorithmic Behavioural Test | cs.AI | One of the most important aims of the fields of robotics, artificial
intelligence and artificial life is the design and construction of systems and
machines as versatile and as reliable as living organisms at performing high
level human-like tasks. But how are we to evaluate artificial systems if we are
not certain how... | computer science |
36,809 | Quantum Structure in Cognition and the Foundations of Human Reasoning | cs.AI | Traditional cognitive science rests on a foundation of classical logic and
probability theory. This foundation has been seriously challenged by several
findings in experimental psychology on human decision making. Meanwhile, the
formalism of quantum theory has provided an efficient resource for modeling
these classical... | computer science |
36,810 | A Novel Design of a Parallel Machine Learnt Generational Garbage
Collector | cs.PL | The Generational Garbage collection involves organizing the heap into
different divisions of memory space in-order to filter long-lived objects from
short-lived objects through moving the surviving object of each generation
Garbage Collection cycle to another memory space updating its age and
reclaiming space from the ... | computer science |
36,811 | Evidential-EM Algorithm Applied to Progressively Censored Observations | cs.AI | Evidential-EM (E2M) algorithm is an effective approach for computing maximum
likelihood estimations under finite mixture models, especially when there is
uncertain information about data. In this paper we present an extension of the
E2M method in a particular case of incom-plete data, where the loss of
information is d... | computer science |
36,812 | Median evidential c-means algorithm and its application to community
detection | cs.AI | Median clustering is of great value for partitioning relational data. In this
paper, a new prototype-based clustering method, called Median Evidential
C-Means (MECM), which is an extension of median c-means and median fuzzy
c-means on the theoretical framework of belief functions is proposed. The
median variant relaxes... | computer science |
36,813 | Autonomous Fault Detection in Self-Healing Systems using Restricted
Boltzmann Machines | cs.AI | Autonomously detecting and recovering from faults is one approach for
reducing the operational complexity and costs associated with managing
computing environments. We present a novel methodology for autonomously
generating investigation leads that help identify systems faults, and extends
our previous work in this are... | computer science |
36,814 | Improving image watermarking based on Tabu search by Chaos | cs.MM | With the fast development of communication and multimedia technology, the
rights of the owners of multimedia products is vulnerable to the unauthorized
copies and watermarking is one of the best known methods for proving the
ownership of a product. In this paper we prosper the previous watermarking
method which was bas... | computer science |
36,815 | Belief Hierarchical Clustering | cs.AI | In the data mining field many clustering methods have been proposed, yet
standard versions do not take into account uncertain databases. This paper
deals with a new approach to cluster uncertain data by using a hierarchical
clustering defined within the belief function framework. The main objective of
the belief hierar... | computer science |
36,816 | Social Participation Ontology: community documentation, enhancements and
use examples | cs.CY | Participatory democracy advances in virtually all governments and especially
in South America which exhibits a mixed culture and social predisposition. This
article presents the "Social Participation Ontology" (OPS from the Brazilian
name \emph{Ontologia de Participa\c{c}\~ao Social}) implemented in compliance
with the... | computer science |
36,817 | MultiGain: A controller synthesis tool for MDPs with multiple
mean-payoff objectives | cs.AI | We present MultiGain, a tool to synthesize strategies for Markov decision
processes (MDPs) with multiple mean-payoff objectives. Our models are described
in PRISM, and our tool uses the existing interface and simulator of PRISM. Our
tool extends PRISM by adding novel algorithms for multiple mean-payoff
objectives, and ... | computer science |
36,818 | Does Learning Imply a Decrease in the Entropy of Behavior? | cs.RO | Shannon's information entropy measures of the uncertainty of an event's
outcome. If learning about a system reflects a decrease in uncertainty, then a
plausible intuition is that learning should be accompanied by a decrease in the
entropy of the organism's actions and/or perceptual states. To address whether
this intui... | computer science |
36,819 | Slice Sampling for Probabilistic Programming | cs.AI | We introduce the first, general purpose, slice sampling inference engine for
probabilistic programs. This engine is released as part of StocPy, a new
Turing-Complete probabilistic programming language, available as a Python
library. We present a transdimensional generalisation of slice sampling which
is necessary for t... | computer science |
36,820 | Designing a Belief Function-Based Accessibility Indicator to Improve Web
Browsing for Disabled People | cs.HC | The purpose of this study is to provide an accessibility measure of
web-pages, in order to draw disabled users to the pages that have been designed
to be ac-cessible to them. Our approach is based on the theory of belief
functions, using data which are supplied by reports produced by automatic web
content assessors tha... | computer science |
36,821 | Belief Approach for Social Networks | cs.AI | Nowadays, social networks became essential in information exchange between
individuals. Indeed, as users of these networks, we can send messages to other
people according to the links connecting us. Moreover, given the large volume
of exchanged messages, detecting the true nature of the received message
becomes a chall... | computer science |
36,822 | What do we learn about development from baby robots? | cs.AI | Understanding infant development is one of the greatest scientific challenges
of contemporary science. A large source of difficulty comes from the fact that
the development of skills in infants results from the interactions of multiple
mechanisms at multiple spatio-temporal scales. The concepts of "innate" or
"acquired... | computer science |
36,823 | Big Data: How Geo-information Helped Shape the Future of Data
Engineering | cs.DB | Very large data sets are the common rule in automated mapping, GIS, remote
sensing, and what we can name geo-information. Indeed, in 1983 Landsat was
already delivering gigabytes of data, and other sensors were in orbit or ready
for launch, and a tantamount of cartographic data was being digitized. The
retrospective pa... | computer science |
36,824 | Maximin Safety: When Failing to Lose is Preferable to Trying to Win | cs.AI | We present a new decision rule, \emph{maximin safety}, that seeks to maintain
a large margin from the worst outcome, in much the same way minimax regret
seeks to minimize distance from the best. We argue that maximin safety is
valuable both descriptively and normatively. Descriptively, maximin safety
explains the well-... | computer science |
36,825 | A Separation Theorem for Chain Event Graphs | stat.ME | Bayesian Networks (BNs) are popular graphical models for the representation
of statistical problems embodying dependence relationships between a number of
variables. Much of this popularity is due to the d-separation theorem of Pearl
and Lauritzen, which allows an analyst to identify the conditional independence
statem... | computer science |
36,826 | User Clustering in Online Advertising via Topic Models | cs.AI | In the domain of online advertising, our aim is to serve the best ad to a
user who visits a certain webpage, to maximize the chance of a desired action
to be performed by this user after seeing the ad. While it is possible to
generate a different prediction model for each user to tell if he/she will act
on a given ad, ... | computer science |
36,827 | Monte Carlo Localization in Hand-Drawn Maps | cs.RO | Robot localization is a one of the most important problems in robotics. Most
of the existing approaches assume that the map of the environment is available
beforehand and focus on accurate metrical localization. In this paper, we
address the localization problem when the map of the environment is not present
beforehand... | computer science |
36,828 | On mining complex sequential data by means of FCA and pattern structures | cs.AI | Nowadays data sets are available in very complex and heterogeneous ways.
Mining of such data collections is essential to support many real-world
applications ranging from healthcare to marketing. In this work, we focus on
the analysis of "complex" sequential data by means of interesting sequential
patterns. We approach... | computer science |
36,829 | RDF annotation of Second Life objects: Knowledge Representation meets
Social Virtual reality | cs.AI | We have designed and implemented an application running inside Second Life
that supports user annotation of graphical objects and graphical visualization
of concept ontologies, thus providing a formal, machine-accessible description
of objects. As a result, we offer a platform that combines the graphical
knowledge repr... | computer science |
36,830 | Data Science and Ebola | cs.AI | Data Science---Today, everybody and everything produces data. People produce
large amounts of data in social networks and in commercial transactions.
Medical, corporate, and government databases continue to grow. Sensors continue
to get cheaper and are increasingly connected, creating an Internet of Things,
and generat... | computer science |
36,831 | Computing Horn Rewritings of Description Logics Ontologies | cs.AI | We study the problem of rewriting an ontology O1 expressed in a DL L1 into an
ontology O2 in a Horn DL L2 such that O1 and O2 are equisatisfiable when
extended with an arbitrary dataset. Ontologies that admit such rewritings are
amenable to reasoning techniques ensuring tractability in data complexity.
After showing un... | computer science |
36,832 | Graphlet-based lazy associative graph classification | cs.DS | The paper addresses the graph classification problem and introduces a
modification of the lazy associative classification method to efficiently
handle intersections of graphs. Graph intersections are approximated with all
common subgraphs up to a fixed size similarly to what is done with graphlet
kernels. We explain th... | computer science |
36,833 | Visual analytics in FCA-based clustering | cs.IR | Visual analytics is a subdomain of data analysis which combines both human
and machine analytical abilities and is applied mostly in decision-making and
data mining tasks. Triclustering, based on Formal Concept Analysis (FCA), was
developed to detect groups of objects with similar properties under similar
conditions. I... | computer science |
36,834 | Formalizing Preference Utilitarianism in Physical World Models | cs.CY | Most ethical work is done at a low level of formality. This makes practical
moral questions inaccessible to formal and natural sciences and can lead to
misunderstandings in ethical discussion. In this paper, we use Bayesian
inference to introduce a formalization of preference utilitarianism in physical
world models, sp... | computer science |
36,835 | Distinguishing Cause from Effect Based on Exogeneity | cs.AI | Recent developments in structural equation modeling have produced several
methods that can usually distinguish cause from effect in the two-variable
case. For that purpose, however, one has to impose substantial structural
constraints or smoothness assumptions on the functional causal models. In this
paper, we consider... | computer science |
36,836 | Allocating Indivisible Items in Categorized Domains | cs.GT | We formulate a general class of allocation problems called categorized domain
allocation problems (CDAPs), where indivisible items from multiple categories
are allocated to agents without monetary transfer and each agent gets at least
one item per category.
We focus on basic CDAPs, where the number of items in each c... | computer science |
36,837 | Security Games with Information Leakage: Modeling and Computation | cs.GT | Most models of Stackelberg security games assume that the attacker only knows
the defender's mixed strategy, but is not able to observe (even partially) the
instantiated pure strategy. Such partial observation of the deployed pure
strategy -- an issue we refer to as information leakage -- is a significant
concern in pr... | computer science |
36,838 | From End-User's Requirements to Web Services Retrieval: A Semantic and
Intention-Driven Approach | cs.SE | In this paper, we present SATIS, a framework to derive Web Service
specifications from end-user's requirements in order to opera-tionalise
business processes in the context of a specific application domain. The aim of
SATIS is to provide to neuroscientists, which are not familiar with computer
science, a complete solut... | computer science |
36,839 | Verification of Generalized Inconsistency-Aware Knowledge and Action
Bases (Extended Version) | cs.AI | Knowledge and Action Bases (KABs) have been put forward as a semantically
rich representation of a domain, using a DL KB to account for its static
aspects, and actions to evolve its extensional part over time, possibly
introducing new objects. Recently, KABs have been extended to manage
inconsistency, with ad-hoc verif... | computer science |
36,840 | Frugal Bribery in Voting | cs.AI | Bribery in elections is an important problem in computational social choice
theory. However, bribery with money is often illegal in elections. Motivated by
this, we introduce the notion of frugal bribery and formulate two new pertinent
computational problems which we call Frugal-bribery and Frugal- $bribery to
capture ... | computer science |
36,841 | Manipulation is Harder with Incomplete Votes | cs.AI | The Coalitional Manipulation (CM) problem has been studied extensively in the
literature for many voting rules. The CM problem, however, has been studied
only in the complete information setting, that is, when the manipulators know
the votes of the non-manipulators. A more realistic scenario is an incomplete
informatio... | computer science |
36,842 | A Novel Energy Aware Node Clustering Algorithm for Wireless Sensor
Networks Using a Modified Artificial Fish Swarm Algorithm | cs.AI | Clustering problems are considered amongst the prominent challenges in
statistics and computational science. Clustering of nodes in wireless sensor
networks which is used to prolong the life-time of networks is one of the
difficult tasks of clustering procedure. In order to perform nodes clustering,
a number of nodes a... | computer science |
36,843 | Quizz: Targeted crowdsourcing with a billion (potential) users | cs.AI | We describe Quizz, a gamified crowdsourcing system that simultaneously
assesses the knowledge of users and acquires new knowledge from them. Quizz
operates by asking users to complete short quizzes on specific topics; as a
user answers the quiz questions, Quizz estimates the user's competence. To
acquire new knowledge,... | computer science |
36,844 | Fast Generation of Best Interval Patterns for Nonmonotonic Constraints | cs.AI | In pattern mining, the main challenge is the exponential explosion of the set
of patterns. Typically, to solve this problem, a constraint for pattern
selection is introduced. One of the first constraints proposed in pattern
mining is support (frequency) of a pattern in a dataset. Frequency is an
anti-monotonic function... | computer science |
36,845 | Risk-Sensitive and Robust Decision-Making: a CVaR Optimization Approach | cs.AI | In this paper we address the problem of decision making within a Markov
decision process (MDP) framework where risk and modeling errors are taken into
account. Our approach is to minimize a risk-sensitive conditional-value-at-risk
(CVaR) objective, as opposed to a standard risk-neutral expectation. We refer
to such pro... | computer science |
36,846 | Adversarial patrolling with spatially uncertain alarm signals | cs.AI | When securing complex infrastructures or large environments, constant
surveillance of every area is not affordable. To cope with this issue, a common
countermeasure is the usage of cheap but wide-ranged sensors, able to detect
suspicious events that occur in large areas, supporting patrollers to improve
the effectivene... | computer science |
36,847 | New Results for Domineering from Combinatorial Game Theory Endgame
Databases | cs.AI | We have constructed endgame databases for all single-component positions up
to 15 squares for Domineering, filled with exact Combinatorial Game Theory
(CGT) values in canonical form. The most important findings are as follows.
First, as an extension of Conway's [8] famous Bridge Splitting Theorem for
Domineering, we ... | computer science |
36,848 | Query-Answer Causality in Databases: Abductive Diagnosis and
View-Updates | cs.DB | Causality has been recently introduced in databases, to model, characterize
and possibly compute causes for query results (answers). Connections between
query causality and consistency-based diagnosis and database repairs (wrt.
integrity constrain violations) have been established in the literature. In
this work we est... | computer science |
36,849 | Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between
Computational Time and Information Value | cs.LO | We show that strategies implemented in automatic theorem proving involve an
interesting tradeoff between execution speed, proving speedup/computational
time and usefulness of information. We advance formal definitions for these
concepts by way of a notion of normality related to an expected (optimal)
theoretical speedu... | computer science |
36,850 | ASPMT(QS): Non-Monotonic Spatial Reasoning with Answer Set Programming
Modulo Theories | cs.AI | The systematic modelling of \emph{dynamic spatial systems} [9] is a key
requirement in a wide range of application areas such as comonsense cognitive
robotics, computer-aided architecture design, dynamic geographic information
systems. We present ASPMT(QS), a novel approach and fully-implemented prototype
for non-monot... | computer science |
36,851 | SAT-based Analysis of Large Real-world Feature Models is Easy | cs.SE | Modern conflict-driven clause-learning (CDCL) Boolean SAT solvers provide
efficient automatic analysis of real-world feature models (FM) of systems
ranging from cars to operating systems. It is well-known that solver-based
analysis of real-world FMs scale very well even though SAT instances obtained
from such FMs are l... | computer science |
36,852 | Why Bother With Syntax? | cs.AI | This short note discusses the role of syntax vs. semantics and the interplay
between logic, philosophy, and language in computer science and game theory. | computer science |
36,853 | Early Predictions of Movie Success: the Who, What, and When of
Profitability | cs.AI | This paper proposes a decision support system to aid movie investment
decisions at the early stage of movie productions. The system predicts the
success of a movie based on its profitability by leveraging historical data
from various sources. Using social network analysis and text mining techniques,
the system automati... | computer science |
36,854 | Emergence of synchrony in an Adaptive Interaction Model | cs.HC | In a Human-Computer Interaction context, we aim to elaborate an adaptive and
generic interaction model in two different use cases: Embodied Conversational
Agents and Creative Musical Agents for musical improvisation. To reach this
goal, we'll try to use the concepts of adaptation and synchronization to
enhance the inte... | computer science |
36,855 | Automated Assignment of Backbone NMR Data using Artificial Intelligence | cs.AI | Nuclear magnetic resonance (NMR) spectroscopy is a powerful method for the
investigation of three-dimensional structures of biological molecules such as
proteins. Determining a protein structure is essential for understanding its
function and alterations in function which lead to disease. One of the major
challenges of... | computer science |
36,856 | Smart Pacing for Effective Online Ad Campaign Optimization | cs.AI | In targeted online advertising, advertisers look for maximizing campaign
performance under delivery constraint within budget schedule. Most of the
advertisers typically prefer to impose the delivery constraint to spend budget
smoothly over the time in order to reach a wider range of audiences and have a
sustainable imp... | computer science |
36,857 | Scientific Discovery by Machine Intelligence: A New Avenue for Drug
Research | cs.AI | The majority of big data is unstructured and of this majority the largest
chunk is text. While data mining techniques are well developed and standardized
for structured, numerical data, the realm of unstructured data is still largely
unexplored. The general focus lies on information extraction, which attempts to
retrie... | computer science |
36,858 | Bisimulation and expressivity for conditional belief, degrees of belief,
and safe belief | cs.AI | Plausibility models are Kripke models that agents use to reason about
knowledge and belief, both of themselves and of each other. Such models are
used to interpret the notions of conditional belief, degrees of belief, and
safe belief. The logic of conditional belief contains that modality and also
the knowledge modalit... | computer science |
36,859 | Dynamic Bayesian Ontology Languages | cs.AI | Many formalisms combining ontology languages with uncertainty, usually in the
form of probabilities, have been studied over the years. Most of these
formalisms, however, assume that the probabilistic structure of the knowledge
remains static over time. We present a general approach for extending ontology
languages to h... | computer science |
36,860 | Automated Matchmaking to Improve Accuracy of Applicant Selection for
University Education System | cs.AI | The accurate applicant selection for university education is imperative to
ensure fairness and optimal use of institutional resources. Although various
approaches are operational in tertiary educational institutions for selecting
applicants, a novel method of automated matchmaking is explored in the current
study. The ... | computer science |
36,861 | Managing Autonomous Mobility on Demand Systems for Better Passenger
Experience | cs.AI | Autonomous mobility on demand systems, though still in their infancy, have
very promising prospects in providing urban population with sustainable and
safe personal mobility in the near future. While much research has been
conducted on both autonomous vehicles and mobility on demand systems, to the
best of our knowledg... | computer science |
36,862 | Twist your logic with TouIST | cs.CY | SAT provers are powerful tools for solving real-sized logic problems, but
using them requires solid programming knowledge and may be seen w.r.t.\ logic
like assembly language w.r.t.\ programming. Something like a high level
language was missing to ease various users to take benefit of these tools. {\sc
\texttt {TouIST}... | computer science |
36,863 | Lift-Based Bidding in Ad Selection | cs.GT | Real-time bidding (RTB) has become one of the largest online advertising
markets in the world. Today the bid price per ad impression is typically
decided by the expected value of how it can lead to a desired action event
(e.g., registering an account or placing a purchase order) to the advertiser.
However, this industr... | computer science |
36,864 | Support Vector Machine in Prediction of Building Energy Demand Using
Pseudo Dynamic Approach | cs.AI | Building's energy consumption prediction is a major concern in the recent
years and many efforts have been achieved in order to improve the energy
management of buildings. In particular, the prediction of energy consumption in
building is essential for the energy operator to build an optimal operating
strategy, which c... | computer science |
36,865 | Optimizing Phylogenetic Supertrees Using Answer Set Programming | cs.CE | The supertree construction problem is about combining several phylogenetic
trees with possibly conflicting information into a single tree that has all the
leaves of the source trees as its leaves and the relationships between the
leaves are as consistent with the source trees as possible. This leads to an
optimization ... | computer science |
36,866 | A Review of Network Traffic Analysis and Prediction Techniques | cs.NI | Analysis and prediction of network traffic has applications in wide
comprehensive set of areas and has newly attracted significant number of
studies. Different kinds of experiments are conducted and summarized to
identify various problems in existing computer network applications. Network
traffic analysis and predictio... | computer science |
36,867 | Decision Maker based on Atomic Switches | cs.AI | We propose a simple model for an atomic switch-based decision maker (ASDM),
and show that, as long as its total volume of precipitated Ag atoms is
conserved when coupled with suitable operations, an atomic switch system
provides a sophisticated "decision-making" capability that is known to be one
of the most important ... | computer science |
36,868 | Generalized Totalizer Encoding for Pseudo-Boolean Constraints | cs.LO | Pseudo-Boolean constraints, also known as 0-1 Integer Linear Constraints, are
used to model many real-world problems. A common approach to solve these
constraints is to encode them into a SAT formula. The runtime of the SAT solver
on such formula is sensitive to the manner in which the given pseudo-Boolean
constraints ... | computer science |
36,869 | Towards a Better Understanding of CAR, CDR, CADR and the Others | cs.AI | This paper describes the IBM 704 architecture and the genesis of the names
for CAR, and CDR, which, as it turns out, probably don't quite make sense. The
paper suggests that this may not be all bad, as the names lend themselves to
compounding. Indeed that the compound function names , such as CADR, or even
CADADR, etc.... | computer science |
36,870 | Taming Primary Key Violations to Query Large Inconsistent Data | cs.AI | Consistent query answering over a database that violates primary key
constraints is a classical hard problem in database research that has been
traditionally dealt with logic programming. However, the applicability of
existing logic-based solutions is restricted to data sets of moderate size.
This paper presents a nove... | computer science |
36,871 | Learning (Predictive) Risk Scores in the Presence of Censoring due to
Interventions | cs.AI | A large and diverse set of measurements are regularly collected during a
patient's hospital stay to monitor their health status. Tools for integrating
these measurements into severity scores, that accurately track changes in
illness severity, can improve clinicians ability to provide timely
interventions. Existing appr... | computer science |
36,872 | Computation of Stackelberg Equilibria of Finite Sequential Games | cs.GT | The Stackelberg equilibrium solution concept describes optimal strategies to
commit to: Player 1 (termed the leader) publicly commits to a strategy and
Player 2 (termed the follower) plays a best response to this strategy (ties are
broken in favor of the leader). We study Stackelberg equilibria in finite
sequential gam... | computer science |
36,873 | Belief and Truth in Hypothesised Behaviours | cs.AI | There is a long history in game theory on the topic of Bayesian or "rational"
learning, in which each player maintains beliefs over a set of alternative
behaviours, or types, for the other players. This idea has gained increasing
interest in the artificial intelligence (AI) community, where it is used as a
method to co... | computer science |
36,874 | Systematic Verification of the Modal Logic Cube in Isabelle/HOL | cs.LO | We present an automated verification of the well-known modal logic cube in
Isabelle/HOL, in which we prove the inclusion relations between the cube's
logics using automated reasoning tools. Prior work addresses this problem but
without restriction to the modal logic cube, and using encodings in first-order
logic in com... | computer science |
36,875 | Neuro-Fuzzy Algorithmic (NFA) Models and Tools for Estimation | cs.SE | Accurate estimation such as cost estimation, quality estimation and risk
analysis is a major issue in management. We propose a patent pending soft
computing framework to tackle this challenging problem. Our generic framework
is independent of the nature and type of estimation. It consists of neural
network, fuzzy logic... | computer science |
36,876 | Extending SROIQ with Constraint Networks and Grounded Circumscription | cs.LO | Developments in semantic web technologies have promoted ontological encoding
of knowledge from diverse domains. However, modelling many practical domains
requires more expressiveness than what the standard description logics (most
prominently SROIQ) support. In this paper, we extend the expressive DL SROIQ
with constra... | computer science |
36,877 | Mining for Causal Relationships: A Data-Driven Study of the Islamic
State | cs.CY | The Islamic State of Iraq and al-Sham (ISIS) is a dominant insurgent group
operating in Iraq and Syria that rose to prominence when it took over Mosul in
June, 2014. In this paper, we present a data-driven approach to analyzing this
group using a dataset consisting of 2200 incidents of military activity
surrounding ISI... | computer science |
36,878 | Fuzzy Logic Based Direct Torque Control Of Induction Motor With Space
Vector Modulation | cs.SY | The induction motors have wide range of applications for due to its
well-known advantages like brushless structures, low costs and robust
performances. Over the past years, many kind of control methods are proposed
for the induction motors and direct torque control has gained huge importance
inside of them due to fast ... | computer science |
36,879 | Decomposition and Identification of Linear Structural Equation Models | cs.AI | In this paper, we address the problem of identifying linear structural
equation models. We first extend the edge set half-trek criterion to cover a
broader class of models. We then show that any semi-Markovian linear model can
be recursively decomposed into simpler sub-models, resulting in improved
identification power... | computer science |
36,880 | Answering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy
Ontologies | cs.LO | Fuzzy Description Logics (DLs) provide a means for representing vague
knowledge about an application domain. In this paper, we study fuzzy extensions
of conjunctive queries (CQs) over the DL $\mathcal{SROIQ}$ based on finite
chains of degrees of truth. To answer such queries, we extend a well-known
technique that reduc... | computer science |
36,881 | OOASP: Connecting Object-oriented and Logic Programming | cs.AI | Most of contemporary software systems are implemented using an
object-oriented approach. Modeling phases -- during which software engineers
analyze requirements to the future system using some modeling language -- are
an important part of the development process, since modeling errors are often
hard to recognize and co... | computer science |
36,882 | Beyond-Quantum Modeling of Question Order Effects and Response
Replicability in Psychological Measurements | cs.AI | A general tension-reduction (GTR) model was recently considered to derive
quantum probabilities as (universal) averages over all possible forms of
non-uniform fluctuations, and explain their considerable success in describing
experimental situations also outside of the domain of physics, for instance in
the ambit of qu... | computer science |
36,883 | Reflective Oracles: A Foundation for Classical Game Theory | cs.AI | Classical game theory treats players as special---a description of a game
contains a full, explicit enumeration of all players---even though in the real
world, "players" are no more fundamentally special than rocks or clouds. It
isn't trivial to find a decision-theoretic foundation for game theory in which
an agent's c... | computer science |
36,884 | Multi-agent Reinforcement Learning with Sparse Interactions by
Negotiation and Knowledge Transfer | cs.MA | Reinforcement learning has significant applications for multi-agent systems,
especially in unknown dynamic environments. However, most multi-agent
reinforcement learning (MARL) algorithms suffer from such problems as
exponential computation complexity in the joint state-action space, which makes
it difficult to scale u... | computer science |
36,885 | Unsatisfiable Cores and Lower Bounding for Constraint Programming | cs.LO | Constraint Programming (CP) solvers typically tackle optimization problems by
repeatedly finding solutions to a problem while placing tighter and tighter
bounds on the solution cost. This approach is somewhat naive, especially for
soft-constraint optimization problems in which the soft constraints are mostly
satisfied.... | computer science |
36,886 | A Neuro-Fuzzy Method to Improving Backfiring Conversion Ratios | cs.SE | Software project estimation is crucial aspect in delivering software on time
and on budget. Software size is an important metric in determining the effort,
cost, and productivity. Today, source lines of code and function point are the
most used sizing metrics. Backfiring is a well-known technique for converting
between... | computer science |
36,887 | Computing Stable Coalitions: Approximation Algorithms for Reward Sharing | cs.GT | Consider a setting where selfish agents are to be assigned to coalitions or
projects from a fixed set P. Each project k is characterized by a valuation
function; v_k(S) is the value generated by a set S of agents working on project
k. We study the following classic problem in this setting: "how should the
agents divide... | computer science |
36,888 | Real-time Top-K Predictive Query Processing over Event Streams | cs.DB | This paper addresses the problem of predicting the k events that are most
likely to occur next, over historical real-time event streams. Existing
approaches to causal prediction queries have a number of limitations. First,
they exhaustively search over an acyclic causal network to find the most likely
k effect events; ... | computer science |
36,889 | A Comparison Between Decision Trees and Decision Tree Forest Models for
Software Development Effort Estimation | cs.SE | Accurate software effort estimation has been a challenge for many software
practitioners and project managers. Underestimation leads to disruption in the
projects estimated cost and delivery. On the other hand, overestimation causes
outbidding and financial losses in business. Many software estimation models
exist; how... | computer science |
36,890 | GR2RSS: Publishing Linked Open Commerce Data as RSS and Atom Feeds | cs.IR | The integration of Linked Open Data (LOD) content in Web pages is a
challenging and sometimes tedious task for Web developers. At the same moment,
most software packages for blogs, content management systems (CMS), and shop
applications support the consumption of feed formats, namely RSS and Atom. In
this technical rep... | computer science |
36,891 | Building a Truly Distributed Constraint Solver with JADE | cs.AI | Real life problems such as scheduling meeting between people at different
locations can be modelled as distributed Constraint Satisfaction Problems
(CSPs). Suitable and satisfactory solutions can then be found using constraint
satisfaction algorithms which can be exhaustive (backtracking) or otherwise
(local search). H... | computer science |
36,892 | Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk
Measures | math.OC | In this paper, we consider a finite-horizon Markov decision process (MDP) for
which the objective at each stage is to minimize a quantile-based risk measure
(QBRM) of the sequence of future costs; we call the overall objective a dynamic
quantile-based risk measure (DQBRM). In particular, we consider optimizing
dynamic ... | computer science |
36,893 | C3: Lightweight Incrementalized MCMC for Probabilistic Programs using
Continuations and Callsite Caching | cs.AI | Lightweight, source-to-source transformation approaches to implementing MCMC
for probabilistic programming languages are popular for their simplicity,
support of existing deterministic code, and ability to execute on existing fast
runtimes. However, they are also slow, requiring a complete re-execution of the
program o... | computer science |
36,894 | The World of Combinatorial Fuzzy Problems and the Efficiency of Fuzzy
Approximation Algorithms | cs.AI | We re-examine a practical aspect of combinatorial fuzzy problems of various
types, including search, counting, optimization, and decision problems. We are
focused only on those fuzzy problems that take series of fuzzy input objects
and produce fuzzy values. To solve such problems efficiently, we design fast
fuzzy algor... | computer science |
36,895 | On Reasoning with RDF Statements about Statements using Singleton
Property Triples | cs.AI | The Singleton Property (SP) approach has been proposed for representing and
querying metadata about RDF triples such as provenance, time, location, and
evidence. In this approach, one singleton property is created to uniquely
represent a relationship in a particular context, and in general, generates a
large property h... | computer science |
36,896 | Efficient Task Collaboration with Execution Uncertainty | cs.AI | We study a general task allocation problem, involving multiple agents that
collaboratively accomplish tasks and where agents may fail to successfully
complete the tasks assigned to them (known as execution uncertainty). The goal
is to choose an allocation that maximises social welfare while taking their
execution uncer... | computer science |
36,897 | A Simulated Annealing Approach to Bayesian Inference | stat.CO | A generic algorithm for the extraction of probabilistic (Bayesian)
information about model parameters from data is presented. The algorithm
propagates an ensemble of particles in the product space of model parameters
and outputs. Each particle update consists of a random jump in parameter space
followed by a simulation... | computer science |
36,898 | Class Association Rules Mining based Rough Set Method | cs.DB | This paper investigates the mining of class association rules with rough set
approach. In data mining, an association occurs between two set of elements
when one element set happen together with another. A class association rule set
(CARs) is a subset of association rules with classes specified as their
consequences. W... | computer science |
36,899 | Proceedings Thirteenth International Workshop on the ACL2 Theorem Prover
and Its Applications | cs.LO | This volume contains the proceedings of the Thirteenth International Workshop
on the ACL2 Theorem Prover and Its Applications, ACL2 2015, a two-day workshop
held in Austin, Texas, USA, on October 1-2, 2015. ACL2 workshops occur at
approximately 18-month intervals and provide a major technical forum for
researchers to p... | computer science |
36,900 | Visual Generalized Coordinates | cs.RO | An open problem in robotics is that of using vision to identify a robot's own
body and the world around it. Many models attempt to recover the traditional
C-space parameters. Instead, we propose an alternative C-space by deriving
generalized coordinates from $n$ images of the robot. We show that the space of
such image... | computer science |
36,901 | Backdoors into Heterogeneous Classes of SAT and CSP | cs.AI | In this paper we extend the classical notion of strong and weak backdoor sets
for SAT and CSP by allowing that different instantiations of the backdoor
variables result in instances that belong to different base classes; the union
of the base classes forms a heterogeneous base class. Backdoor sets to
heterogeneous base... | computer science |
36,902 | Exploiting Reduction Rules and Data Structures: Local Search for Minimum
Vertex Cover in Massive Graphs | cs.DS | The Minimum Vertex Cover (MinVC) problem is a well-known NP-hard problem.
Recently there has been great interest in solving this problem on real-world
massive graphs. For such graphs, local search is a promising approach to
finding optimal or near-optimal solutions. In this paper we propose a local
search algorithm tha... | computer science |
36,903 | Hybrid Optimization Algorithm for Large-Scale QoS-Aware Service
Composition | cs.AI | In this paper we present a hybrid approach for automatic composition of Web
services that generates semantic input-output based compositions with optimal
end-to-end QoS, minimizing the number of services of the resulting composition.
The proposed approach has four main steps: 1) generation of the composition
graph for ... | computer science |
36,904 | Boolean Hedonic Games | cs.GT | We study hedonic games with dichotomous preferences. Hedonic games are
cooperative games in which players desire to form coalitions, but only care
about the makeup of the coalitions of which they are members; they are
indifferent about the makeup of other coalitions. The assumption of dichotomous
preferences means that... | computer science |
36,905 | Quantification of sand fraction from seismic attributes using
Neuro-Fuzzy approach | cs.CE | In this paper, we illustrate the modeling of a reservoir property (sand
fraction) from seismic attributes namely seismic impedance, seismic amplitude,
and instantaneous frequency using Neuro-Fuzzy (NF) approach. Input dataset
includes 3D post-stacked seismic attributes and six well logs acquired from a
hydrocarbon fiel... | computer science |
36,906 | CRDT: Correlation Ratio Based Decision Tree Model for Healthcare Data
Mining | cs.AI | The phenomenal growth in the healthcare data has inspired us in investigating
robust and scalable models for data mining. For classification problems
Information Gain(IG) based Decision Tree is one of the popular choices.
However, depending upon the nature of the dataset, IG based Decision Tree may
not always perform w... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.