Description logics (DLs) support so-called anonymous objects, which significantly contribute to the expressiveness of these KR languages, but also cause substantial computational challenges. this paper investigates re...
详细信息
Context-aware systems keep on emerging in all of our daily activities. To cope withthis new situation, programming languages were extended to support the notion of context. Although context-oriented programming langu...
详细信息
Converting source code from one programming language to another is a problem that occurs regularly in real life, but has attracted limited attention and has not been investigated systematically. this paper presents th...
详细信息
Many real-world time-sensitive and high-stake applications (e.g., surgical, rescue, and recovery robotics) exhibit sequential nature;thus, applying Recurrent Neural Network (RNN)-based sequential models is an attracti...
详细信息
ISBN:
(纸本)9781665404921
Many real-world time-sensitive and high-stake applications (e.g., surgical, rescue, and recovery robotics) exhibit sequential nature;thus, applying Recurrent Neural Network (RNN)-based sequential models is an attractive approach to detect robotic activity. One limitation of such approaches is data scarcity. As a result, limited training samples may lead to over-fitting, producing incorrect predictions during deployment. Nevertheless, abundant domain knowledge may still be available, which may help formulate logic constraints. In this paper, we propose a novel way to integrate domain knowledge into RNN-based sequential prediction. We build a Markov logic Network (MLN)-based classifier that automatically learns constraint weights from data. We propose two methods to incorporate this MLN-based prediction: (i) PriorLayer, in which the values of the hidden layer of the RNN are combined with weights learned from logic constraints in an additional neural network layer, and (ii) Conflation, in which class probabilities from RNN predictions and constraint weights are combined based on the conflation of class probabilities. We evaluate robotic activity classification methods on a simulated OpenAl Gym environment and a real-world DESK dataset for surgical robotics. We observe that our proposed MLN-based approaches boost the performance of LSTM-based networks. In particular, MLN boosts the accuracy of LSTM from 71% to 84% on the Gym dalaset and from 68% to 72% on the Taurus robot dataset. Furthermore, MLN (i.e., PriorLayer) shows regularization capability where it improves accuracy in initial LSTM training while avoiding over-fitting early, thus improves the linal classification accuracy on unseen data.
Data-driven approaches for modeling human skeletal motion have found various applications in interactive media and social robotics. Challenges remain in these fields for generating high-fidelity samples and robustly r...
详细信息
ISBN:
(纸本)9781665404921
Data-driven approaches for modeling human skeletal motion have found various applications in interactive media and social robotics. Challenges remain in these fields for generating high-fidelity samples and robustly reconstructing motion from imperfect input data, due to e.g. missed marker detection. In this paper, we propose a probabilistic generative model to synthesize and reconstruct long horizon motion sequences conditioned on past information and control signals, such as the path along which an individual is moving. Our method adapts the existing work MoGlow by introducing a new graph-based model. the model leverages the spatial-temporal graph convolutional network (ST-GCN) to effectively capture the spatial structure and temporal correlation of skeletal motion data at multiple scales. We evaluate the models on a mixture of motion capture datasets of human locomotion with foot-step and bone-length analysis. the results demonstrate the advantages of our model in reconstructing missing markers and achieving comparable results on generating realistic future poses. When the inputs are imperfect, our model shows improvements on robustness of generation.
We introduce an efficient method for the complete verification of ReLU-based feed-forward neural networks. the method implements branching on the ReLU states on the basis of a notion of dependency between the nodes. T...
详细信息
ISBN:
(纸本)9780999241196
We introduce an efficient method for the complete verification of ReLU-based feed-forward neural networks. the method implements branching on the ReLU states on the basis of a notion of dependency between the nodes. this results in dividing the original verification problem into a set of sub-problems whose MILP formulations require fewer integrality constraints. We evaluate the method on all of the ReLU-based fully connected networks from the first competition for neural network verification. the experimental results obtained show 145% performance gains over the present state-of-the-art in complete verification.
In this paper we provide the first game semantics for the constructive modal logic CK. We first define arenas encoding modal formulas, we then define winning innocent strategies for games on these arenas, and finally ...
详细信息
ISBN:
(纸本)9783030860592;9783030860585
In this paper we provide the first game semantics for the constructive modal logic CK. We first define arenas encoding modal formulas, we then define winning innocent strategies for games on these arenas, and finally we characterize the winning strategies corresponding to proofs in the logic CK. To prove the full-completeness of our semantics, we provide a sequentialization procedure of winning strategies. We conclude the paper by proving their compositionality and showing how our results can be extend to the constructive modal logic CD.
the proceedings contain 26 papers. the special focus in this conference is on Automated Reasoning with Analytic Tableaux and Related Methods. the topics include: lazyCoP: Lazy Paramodulation Meets Neurally Guided Sear...
ISBN:
(纸本)9783030860585
the proceedings contain 26 papers. the special focus in this conference is on Automated Reasoning with Analytic Tableaux and Related Methods. the topics include: lazyCoP: Lazy Paramodulation Meets Neurally Guided Search;AC Simplifications and Closure Redundancies in the Superposition Calculus;the Role of Entropy in Guiding a Connection Prover;the nanoCoP 2.0 Connection Provers for Classical, Intuitionistic and Modal logics;eliminating Models During Model Elimination;learning theorem Proving Components;a Formally Verified Cut-Elimination Procedure for Linear Nested Sequents for Tense logic;cut-Elimination for Provability logic by Terminating Proof-Search: Formalised and Deconstructed Using Coq;complexity of a Fragment of Infinitary Action logic with Exponential via Non-well-founded Proofs;constraint Tableaux for Two-Dimensional Fuzzy logics;uniform Interpolation from Cyclic Proofs: the Case of Modal Mu-Calculus;cyclic Hypersequent Calculi for Some Modal logics withthe Master Modality;a Focus System for the Alternation-Free μ -Calculus;terminating Calculi and Countermodels for Constructive Modal logics;nested Sequents for Intuitionistic Modal logics via Structural Refinement;game Semantics for Constructive Modal logic;the Došen Square Under Construction: A Tale of Four Modalities;analytic Tableaux for Non-deterministic Semantics;tableaux for Free logics with Descriptions;CEGAR-Tableaux: Improved Modal Satisfiability via Modal Clause-Learning and SAT;proof-theory and Semantics for a theory of Definite Descriptions;basing Sequent Systems on Exclusive-Or;proof Search on Bilateralist Judgments over Non-deterministic Semantics;from Input/Output logics to Conditional logics via Sequents – with Provers.
Temporal logics over finite traces, such as LTLf and its extension LDLf, have been adopted in several areas, including Business Process Management (BPM), to check properties of processes whose executions have an unbou...
详细信息
ISBN:
(纸本)9780999241196
Temporal logics over finite traces, such as LTLf and its extension LDLf, have been adopted in several areas, including Business Process Management (BPM), to check properties of processes whose executions have an unbounded, but finite, length. these logics express properties of single traces in isolation, however, especially in BPM it is also of interest to express properties over the entire log, i.e., properties that relate multiple traces of the log at once. In the case of infinite-traces, HyperLTL has been proposed to express these "hyper" properties. In this paper, motivated by BPM, we introduce HyperLDL(f), a logicthat extends LDL f withthe hyper features of HyperLTL. We provide a sound, complete and computationally optimal technique, based on DFAs manipulation, for the model checking problem in the relevant case where the set of traces (i.e., the log) is a regular language. We illustrate how this form of model checking can be used to specify and verify sophisticated properties within BPM and process mining.
Elastograms suffer from noise and undesirable artifacts, making it necessary to enhance their signal-to-noise ratio (SNR) and contrast-to-noise ratio (CNR) for accurate detection of tissue deformations, determination ...
Elastograms suffer from noise and undesirable artifacts, making it necessary to enhance their signal-to-noise ratio (SNR) and contrast-to-noise ratio (CNR) for accurate detection of tissue deformations, determination of its displacement fields, and representation of tissue characteristics to medical professionals. this research aims to improve the quality of elastograms. Among various displacement estimation methods, the dynamic programming (DP) approach is chosen due to its superior speed, accuracy, and lower computational complexity and cost. the research objectives are defined as enhancing the SNR and CNR metrics and evaluating the resulting improvement in the elastogram quality. To achieve DP refinement, a perturbation is employed. the variables of the DP cost function are evaluated, and finally, the adjustment weight (w) is selected as a suitable criterion for optimization. After assessing different multi-objective optimization algorithms, the Electric Fish optimization algorithm with Non-dominated Sorting (NS-EFO) is chosen. In the designed optimization process, the DP cost function is considered as the objective function, SNR and CNR as objectives, and w as the design variable. To evaluate the improved performance of DP, two RF samples are used, recorded from a CIRS phantom and a Polyvinyl alcohol (PVA) single-layer mammary gland phantom. Following determining the optimal w, the SNR and CNR values are computed for both one-dimensional (ID) and two-dimensional (2D) models under different conditions. the results indicate that the SNR and CNR values for the CIRS phantom, on average, increased respectively by 556.74% and 853.72% in the ID model and by 83.56% and 127.91% in the 2D model, compared to the primitive values. For the single-layer glandular phantom, the SNR and CNR values, on average, increased respectively by 66.98% and 33.03% in the ID model and by 102.67% and 2178.99% in the 2D model, compared to the primary values.
暂无评论