Recently, public alert using CBS technology is becoming one of the most effective and popular tools for government. In this paper, we present a Republic of Korea (ROK) civilian technical specification for the second-g...
详细信息
ISBN:
(数字)9791188428045
ISBN:
(纸本)9781728149431
Recently, public alert using CBS technology is becoming one of the most effective and popular tools for government. In this paper, we present a Republic of Korea (ROK) civilian technical specification for the second-generation interface between the government alert gateway and mobile service provider alert gateway. The requirements for the gateways and the interface protocol are described along with design philosophy and base specifications and ROK regulations.
We introduce a logic to reason about strategic abilities in finite games under imperfect information. We interpret Alternating-time Temporal logic on interpreted systems with final states, where agents only have parti...
详细信息
ISBN:
(纸本)9783030337926;9783030337919
We introduce a logic to reason about strategic abilities in finite games under imperfect information. We interpret Alternating-time Temporal logic on interpreted systems with final states, where agents only have partial observability of the system's global state. We consider the model checking problem in this setting. We prove that the complexity results available for the case of infinite traces carry over to the finite traces case. We show that when only public actions are allowed, the verification problem under perfect recall becomes decidable.
The present article is devoted to a logical treatment of some fundamental concepts involved in responsibility attribution. We specify a theoretical framework based on a language of temporal deontic logic with agent-re...
详细信息
ISBN:
(纸本)9783030337926;9783030337919
The present article is devoted to a logical treatment of some fundamental concepts involved in responsibility attribution. We specify a theoretical framework based on a language of temporal deontic logic with agent-relative operators for deliberate causal contribution. The framework is endowed with a procedure to solve normative conflicts which arise from the assessment of different normative sources. We provide a characterization result for a basic system within this framework and illustrate how the concepts formalized can be put at work in the analysis of examples of legal reasoning.
Casa dos Marcos is the largest specialized medical and residential center for rare diseases in the Iberian Peninsula. The large number of patients and the uniqueness of their diseases demand a considerable amount of d...
详细信息
ISBN:
(数字)9783030166922
ISBN:
(纸本)9783030166915;9783030166922
Casa dos Marcos is the largest specialized medical and residential center for rare diseases in the Iberian Peninsula. The large number of patients and the uniqueness of their diseases demand a considerable amount of diverse and highly personalized therapies, that are nowadays largely managed manually. This paper aims at catering for the emergent need of efficient and effective artificial intelligence systems for the support of the everyday activities of centers like Casa dos Marcos. We present six predictive data models developed with a genetic programming based system which, integrated into a web-application, enabled data-driven support for the therapists in Casa dos Marcos. The presented results clearly indicate the usefulness of the system in assisting complex therapeutic procedures for children suffering from rare diseases.
This paper investigates the satisfiability problem for Separation logic with k record fields, with unrestricted nesting of separating conjunctions and implications, for prenex formula with quantifier prefix there exis...
详细信息
ISBN:
(数字)9783030171278
ISBN:
(纸本)9783030171278;9783030171261
This paper investigates the satisfiability problem for Separation logic with k record fields, with unrestricted nesting of separating conjunctions and implications, for prenex formula with quantifier prefix there exists*for all*. In analogy with first-order logic, we call this fragment Bernays-Schonfinkel-Ramsey Separation logic [BSR(SLk)]. In contrast to existing work in Separation logic, in which the universe of possible locations is assumed to be infinite, both finite and infinite universes are considered. We show that, unlike in first-order logic, the (in)finite satisfiability problem is undecidable for BSR(SLk). Then we define two non-trivial subsets thereof, that are decidable for finite and infinite satisfiability respectively, by controlling the occurrences of universally quantified variables within the scope of separating implications, as well as the polarity of the occurrences of the latter. Beside the theoretical interest, our work has natural applications in program verification, for checking that constraints on the shape of a data-structure are preserved by a sequence of transformations.
The proceedings contain 25 papers. The special focus in this conference is on Fundamental Approaches to Software Engineering. The topics include: Deepfault: Fault localization for deep neural networks;Variability abst...
ISBN:
(纸本)9783030167219
The proceedings contain 25 papers. The special focus in this conference is on Fundamental Approaches to Software Engineering. The topics include: Deepfault: Fault localization for deep neural networks;Variability abstraction and refinement for game-based lifted model checking of full CTL;formal verification of safety & security related timing constraints for a cooperative automotive system;checking observational purity of procedures;structural and nominal cross-language clone detection;SL2SF: Refactoring simulink to stateflow;metric temporal graph logic over typed attributed graphs;KUPC: A formal tool for modeling and verifying dynamic updating of C programs;business process privacy analysis in pleak;CLTestcheck: Measuring test effectiveness for GPU kernels;tool support for correctness-by-construction;Implementing SOS with active objects: A case study of a multicore memory system;optimal and automated deployment for microservices;a data flow model with frequency arithmetic;coVeriTest: Cooperative verifier-based testing;PARDIS: Priority aware test case reduction;Automatically identifying sufficient object builders from module APIs;automatic modeling of opaque code for javascript static analysis;SMT-based bounded schedulability analysis of the clock constraint specification language;a hybrid dynamic logic for event/data-based systems;pyro: Generating domain-specific collaborative online modeling environments;efficient model synchronization by automatically constructed repair processes;offline delta-driven model transformation with dependency injection;a logic-based incremental approach to graph repair.
The proceedings contain 23 papers. The special focus in this conference is on Information Security. The topics include: When the Attacker Knows a Lot: The GAGA Graph Anonymizer;mitigation Techniques for Attacks on 1-D...
ISBN:
(纸本)9783030302146
The proceedings contain 23 papers. The special focus in this conference is on Information Security. The topics include: When the Attacker Knows a Lot: The GAGA Graph Anonymizer;mitigation Techniques for Attacks on 1-Dimensional Databases that Support Range Queries;getting Under Alexa’s Umbrella: Infiltration Attacks Against Internet Top Domain Lists;truth in Web Mining: Measuring the Profitability and the Imposed Overheads of Cryptojacking;lightSense: A Novel Side Channel for Zero-permission Mobile User Tracking;Robust Covert Channels Based on DRAM Power Consumption;barnum: Detecting Document Malware via Control Flow Anomalies in Hardware Traces;an Analysis of Malware Trends in Enterprise Networks;l(a)ying in (Test)Bed: How Biased Datasets Produce Impractical Results for Actual Malware Families’ Classification;full Database Reconstruction with Access and Search Pattern Leakage;automated Reconstruction of Control logic for Programmable logic Controller Forensics;secure Stern Signatures in Quantum Random Oracle Model;adding Linkability to Ring Signatures with One-Time Signatures;cryptographic Authentication from the Iris;Cube Cryptanalysis of Round-Reduced ACORN;auditable Compressed Storage;decentralized Evaluation of Quadratic Polynomials on Encrypted Data;Robust Distributed Pseudorandom Functions for mNP Access Structures;can Today’s Machine Learning Pass Image-Based Turing Tests?;PD-ML-Lite: Private Distributed Machine Learning from Lightweight Cryptography;Code-Based Zero Knowledge PRF Arguments.
The proceedings contain 30 papers. The special focus in this conference is on Foundations of Software Science and Computation Structures. The topics include: Universal Graphs and Good for Games Automata: New Tools for...
ISBN:
(纸本)9783030171261
The proceedings contain 30 papers. The special focus in this conference is on Foundations of Software Science and Computation Structures. The topics include: Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games;rewriting Abstract Structures: Materialization Explained Categorically;two-Way Parikh Automata with a Visibly Pushdown Stack;kleene Algebra with Hypotheses;trees in Partial Higher Dimensional Automata;the Bernays-Schönfinkel-Ramsey Class of Separation logic on Arbitrary Domains;Continuous Reachability for Unordered Data Petri Nets is in PTime;optimal Satisfiability Checking for Arithmetic µ-Calculi;constructing Inductive-Inductive Types in Cubical Type Theory;causal Inference by String Diagram Surgery;higher-Order Distributions for Differential Linear logic;resource-Tracking Concurrent Games;languages Ordered by the Subword Order;strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces;a Sound and Complete logic for Algebraic Effects;equational Axiomatization of Algebras with Structure;towards a Structural Proof Theory of Probabilistic µ-Calculi;partial and Conditional Expectations in Markov Decision Processes with Integer Weights;equational Theories and Monads from Polynomial Cayley Representations;A Dialectica-Like Interpretation of a Linear MSO on Infinite Words;deciding Equivalence of Separated Non-nested Attribute Systems in Polynomial Time;justness: A Completeness Criterion for Capturing Liveness Properties (Extended Abstract);change Actions: Models of Generalised Differentiation;path Category for Free: Open Morphisms from Coalgebras with Non-deterministic Branching;coalgebra Learning via Duality;tight Worst-Case Bounds for Polynomial Loop Programs;a Complete Normal-Form Bisimilarity for State;identifiers in Registers: Describing Network Algorithms with logic;the Impatient May Use Limited Optimism to Minimize Regret.
Salient Object Detection (SOD) aims to model human visual attention system to cope with the complex natural scene which contains various objects at different scales. Over the past two decades, a wide range of saliency...
详细信息
ISBN:
(数字)9783030166922
ISBN:
(纸本)9783030166915;9783030166922
Salient Object Detection (SOD) aims to model human visual attention system to cope with the complex natural scene which contains various objects at different scales. Over the past two decades, a wide range of saliency features have been introduced in the SOD field, however feature selection has not been widely investigated for selecting informative, non-redundant, and complementary features from the existing features. In SOD, multi-level feature extraction and feature combination are two fundamental stages to compute the final saliency map. However, designing a good feature combination framework is a challenging task and requires domain-expert intervention. In this paper, we propose a genetic programming (GP) based method that is able to automatically select the complementary saliency features and generate mathematical function to combine those features. The performance of the proposed method is evaluated using four benchmark datasets and compared to nine state-of-the-art methods. The qualitative and quantitative results show that the proposed method significantly outperformed, or achieved comparable performance to, the competitor methods.
A regression random forest model taking into account imprecision of the decision tree estimates is proposed. The imprecision stems from conditions of small or noisy training data which may take place in many applicati...
详细信息
ISBN:
(纸本)9781728136028
A regression random forest model taking into account imprecision of the decision tree estimates is proposed. The imprecision stems from conditions of small or noisy training data which may take place in many applications. In fact, a meta-model is proposed to train and to compute optimal weights assigned to decision trees, which control the imprecision in order to get the robust random forest estimates. The imprecision of the tree estimations is defined by means of interval models, for example, by using confidence intervals. The weights are computed by solving standard quadratic optimization problem with linear constraints. Numerical examples illustrate the proposed robust model which provides outperforming results for noisy and small data in comparison with the standard random forest.
暂无评论