the Probabilistic Orienteering Problem is a stochastic optimization problem about the delivery or goods to customers. Only a subset of the customer can be served in the given time, so the problem consists in the selec...
详细信息
ISBN:
(纸本)9781538626344;9781538626337
the Probabilistic Orienteering Problem is a stochastic optimization problem about the delivery or goods to customers. Only a subset of the customer can be served in the given time, so the problem consists in the selection of the customers providing more revenues and in the optimization of a truck tour to serve them. the presence of the customers is however stochastic, and this has to be taken into account while evaluating the objective function of each solution. Due to the high computational complexity of such an objective function, Monte Carlo sampling method is used to estimate it in a fast way. there is one crucial parameter in a Monte Carlo sampling evaluator which is the number of samples to be used. More samples mean high precision, less samples mean high speed. An instance-dependent trade-off has to be found. the topic of this paper is a Machine Learning-based method to estimate the best number of samples, given the characteristics of an instance. Two methods are presented and compared from an experimental point of view. In particular, it is shown that a less intuitive and slightly more complex method is able to provide more precise estimations.
Recently, Japan has been experiencing a declining birthrate and an increasingly aging population;as a result, the number of dementia patients is increasing. Current medical science has no way to treat dementia complet...
详细信息
ISBN:
(纸本)9783319585246;9783319585239
Recently, Japan has been experiencing a declining birthrate and an increasingly aging population;as a result, the number of dementia patients is increasing. Current medical science has no way to treat dementia completely after onset. therefore, it is necessary to detect mild cognitive impairment (MCI) in the early stage just before dementia develops. It is clear that MCI patients who exhibit subtle deficits in daily living behavior (in this study, micro-errors (MEs)) have declining cognitive function associated with cognitive impairment. Virtual reality (VR) technology has been actively utilized in rehabilitation and therapy, and here we use an application known as Virtual Kitchen (VK). In this work, we analyze how ME happens. We use finger movement data and subtask information from VK. Our methodology proposes a combination of inductivelogicprogramming (ILP) and the sliding window algorithm. Because ILP can extract expressive rules but is susceptible to noise and memory hog, it is difficult to use sensor data directly for learning. Sliding window is used as its ability to reduce the amount of data while holding the shape of original time series data. From preliminary experiments, we obtained some rules of ME occurrence that are related to differences in speed, time interval, and subtask. We obtained results that explain how ME occurrence is generally related to subtask and finger speed. In the future, we will use more positive samples and conduct more experiments to obtain better and more accurate results.
the proceedings contain 14 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: Eliminating irrelevant non determinism in functional logic programs;canonic...
ISBN:
(纸本)9783319516752
the proceedings contain 14 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: Eliminating irrelevant non determinism in functional logic programs;canonicalizing high-level constructs in picat;integrating answer set programming with object-oriented languages;extending answer set programs with interpreted functions as first-class citizens;lowering the learning curve for declarative programming;overlapping patterns for property-based testing;Boltzmann samplers for closed simply-typed lambda terms;selection equilibria of higher-order games;principles and prototype implementation;declarative programming of full-fledged musical applications;a domain-specific language for software-defined radio;a declarative DSL for customizing ASCII art and using iterative deepening for probabilistic logic inference.
the proceedings contain 20 papers. the topics discussed include: ethical issues in data management;programming by examples: applications, algorithms, and ambiguity resolution;environments and the complexity of abstrac...
ISBN:
(纸本)9781450352918
the proceedings contain 20 papers. the topics discussed include: ethical issues in data management;programming by examples: applications, algorithms, and ambiguity resolution;environments and the complexity of abstract machines;conditional narrowing modulo SMT and axioms;attribute grammars with set attributes and global constraints as a unifying framework for planning domain models;shrink fast correctly!;function definitions for compound values in object-oriented languages;verifiable semantic difference languages;theory learning with symmetry breaking;copattern-matchings and first-class observations in OCaml, with a macro;practical evaluation of the lasp programming model at large scale - an experience report;selective unification in constraint logicprogramming;causally consistent reversible choreographies: a monitors-as-memories approach;machine fusion: merging merges, more or less;alpha-renaming of higher-order meta-expressions;characterization of strong normalizability for a sequent lambda calculus with co-control;defunctionalisation as modular closure conversion;a core calculus for provenance for provenance inspection;and expressive and strongly type-safe code generation.
We consider the problem of checking whether a proposed invariant phi expressed in first-order logic with quantifier alternation is inductive, i. e. preserved by a piece of code. While the problem is undecidable, moder...
详细信息
ISBN:
(纸本)9783662545775;9783662545768
We consider the problem of checking whether a proposed invariant phi expressed in first-order logic with quantifier alternation is inductive, i. e. preserved by a piece of code. While the problem is undecidable, modern SMT solvers can sometimes solve it automatically. However they employ powerful quantifier instantiation methods that may diverge, especially when phi is not preserved. A notable difficulty arises due to counterexamples of infinite size. this paper studies Bounded-Horizon instantiation, a natural method for guaranteeing the termination of SMT solvers. the method bounds the depth of terms used in the quantifier instantiation process. We show that this method is surprisingly powerful for checking quantified invariants in uninterpreted domains. Furthermore, by producing partial models it can help the user diagnose the case when phi is not inductive, especially when the underlying reason is the existence of infinite counterexamples. Our main technical result is that Bounded-Horizon is at least as powerful as instrumentation, which is a manual method to guarantee convergence of the solver by modifying the program so that it admits a purely universal invariant. We show that with a bound of 1 we can simulate a natural class of instrumentations, without the need to modify the code and in a fully automatic way. We also report on a prototype implementation on top of Z3, which we used to verify several examples by Bounded-Horizon of bound 1.
the proceedings contain 66 papers. the special focus in this conference is on HCI in Business, Government and Organizations. the topics include: Sharing economy versus access economy;employing relation visualizations ...
ISBN:
(纸本)9783319584836
the proceedings contain 66 papers. the special focus in this conference is on HCI in Business, Government and Organizations. the topics include: Sharing economy versus access economy;employing relation visualizations to enhance the shopping experience on a used car trading platform;the effects of scarcity messages on online impulsive purchase;a survey based on the octalysis framework;priming and context effects of banner ads on consumer based brand equity;effect of timing and source of online product recommendations;optimize the coupon face value for online sellers;acceptance of personalization in omnichannel retailing;eye-tracking analysis of gender-specific online information research and buying behavior;participation in collaborative consumption;dueling for trust in the online fantasy sports industry;a longitudinal analysis;a theoretical model of incorporating gamification design into on-line marketing;extracting important knowledge from multiple markets using transfer learning;numbers speak where words fail;perceptions from security guards;the duality of envy in online social information consumption;context sensitive digital marketing;encouraging the participation in mobile collaborative consumption using gamification design;development of an online checklist for the assessment of alarm systems and alarm management in process control;impact of mobile it consumerization on organizations;a review on neuropsychophysiological correlates of flow;contract visualisation and a transaction cost equilibrium analysis on overlap between emergency response task groups.
We address the problem of diagnosing and repairing specifications for hybrid systems, formalized in signal temporal logic (STL). Our focus is on automatic synthesis of controllers from specifications using model predi...
详细信息
ISBN:
(纸本)9781450339551
We address the problem of diagnosing and repairing specifications for hybrid systems, formalized in signal temporal logic (STL). Our focus is on automatic synthesis of controllers from specifications using model predictive control. We build on recent approaches that reduce the controller synthesis problem to solving one or more mixed integer linear programs (MILPs), where infeasibility of an MILP usually indicates unrealizability of the controller synthesis problem. Given an infeasible STL synthesis problem, we present algorithms that provide feedback on the reasons for unrealizability, and suggestions for making it realizable. Our algorithms are sound and complete relative to the synthesis algorithm, i.e., they provide a diagnosis that makes the synthesis problem infeasible, and always terminate with a non-trivial specification that is feasible using the chosen synthesis method, when such a solution exists. We demonstrate the effectiveness of our approach on controller synthesis for various cyber-physical systems, including an autonomous driving application and an aircraft electric power system.
this paper studies different semantics of logic programs with first order formulae under the lens of argumentation framework. It defines the notion of an argumentation-based answer set and the notion of an argumentati...
详细信息
ISBN:
(纸本)9783319448329;9783319448312
this paper studies different semantics of logic programs with first order formulae under the lens of argumentation framework. It defines the notion of an argumentation-based answer set and the notion of an argumentation-based well-founded model for programs with first order formulae. the main ideas underlying the new approach lie in the notion of a proof tree supporting a conclusion given a program and the observation that proof trees can be naturally employed as arguments in an argumentation framework whose stable extensions capture the program's well justified answer semantics recently introduced in [23]. the paper shows that the proposed approach to dealing with programs with first order formulae can be easily extended to a generalized class of logic programs, called programs with FOL-representable atoms, that covers various types of extensions of logicprogramming proposed in the literature such as weight constraint atoms, aggregates, and abstract constraint atoms. For example, it shows that argumentation-based well-founded model is equivalent to the well-founded model in [27] for programs with abstract constraint atoms. Finally, the paper relates the proposed approach to others and discusses possible extensions.
We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring, whose elements can be understood as logic programs or sets of rewriting rules ove...
详细信息
ISBN:
(纸本)9783662496305;9783662496299
We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring, whose elements can be understood as logic programs or sets of rewriting rules over first-order terms. this construction stems from an interactive interpretation of the cut-elimination procedure of linear logic known as the geometry of interaction. this framework is restricted to terms (logic programs, rewriting rules) using only unary symbols, and this restriction is shown to be complete for polynomial time computation by encoding pushdown automata. Soundness w. r. t. Ptime is proven thanks to a saturation method similar to the one used for pushdown systems and inspired by the memoization technique. A Ptime-completeness result for a class of logicprogramming queries that uses only unary function symbols comes as a direct consequence.
the proceedings contain 27 papers. the special focus in this conference is on Early Innovation Short Papers and Social Science Extended Abstracts. the topics include: Intercultural collaboration and support systems: a...
ISBN:
(纸本)9783319448312
the proceedings contain 27 papers. the special focus in this conference is on Early Innovation Short Papers and Social Science Extended Abstracts. the topics include: Intercultural collaboration and support systems: a brief history;argumentation for practical reasoning;an axiomatic approach;argumentation-based semantics for logic programs with first-order formulae;resistance to corruption of general strategic argumentation;spread of cooperation in complex agent networks based on expectation of cooperation;semantic reasoning with uncertain information from unreliable sources;a collaborative framework for 3D mapping using unmanned aerial vehicles;heuristics on the data-collecting robot problem with immediate rewards;verifying real-time properties of multi-agent systems via SMT-based bounded model checking;balancing rationality and utility in logic-based argumentation with classical logic sentences and belief contraction;individually rational strategy-proof social choice with exogenous indifference sets;offer evaluation and trade-off making in automated negotiation based on intuitionistic fuzzy constraints;analyzing topics and trends in the prima literature;sequence semantics for normative agents;revenue maximizing markets for zero-day exploits;distant group responsibility in multi-agent systems;competitive VCG redistribution mechanism for public project problem;coalition structure formation using anytime dynamic programming;demand response integration through agent-based coordination of consumers in virtual power plants;a multi agent system for understanding the impact of technology transfer offices in green-IT;modeling organizational and institutional aspects in renewable and natural resources management context and generalising social structure using interval type-2 fuzzy sets.
暂无评论