the fourth industrial revolution is driven by Software-enabled automation. To fully realize the potential of this digital transformation in a way that is beneficial to society, automation needs to become programmable ...
详细信息
Graphical system sequence diagrams (SSDs), used in Requirements Engineering and Analysis, are hard to draw for larger use cases. However, we wanted to be able to express SSDs for such use cases as well. While we were ...
详细信息
ISBN:
(数字)9783030523060
ISBN:
(纸本)9783030523060;9783030523053
Graphical system sequence diagrams (SSDs), used in Requirements Engineering and Analysis, are hard to draw for larger use cases. However, we wanted to be able to express SSDs for such use cases as well. While we were designing a grammar for textual SSDs, we noted that we needed the same kind of structuring mechanisms as for modeling business processes and programminglanguages. Only the basic building block differs: e.g., an assignment statement for (imperative) programminglanguages and a (basic) interaction step for SSDs. Can we generalize this similarity idea, leading to (uniform) grammars for instruction languages in general, and exploit this? this paper presents a grammar for 'structured' Ws (where W stands for 'Whatever'), leading to grammars for (textual) instruction languages. the general grammar contains constructs necessary for specifying all kinds of instructions. We illustrate our theory with examples from several different application areas. A basic building block might even be a picture or an icon, as we will point out. the main contribution of the paper is a powerful and uniform grammar for instruction languages in general, containing generic constructs for specifying various instructions conveniently. Exploiting the similarity between the structuring mechanisms for modeling business processes, (textual) SSDs, and programminglanguages will ease the translation towards an implementation in a software system. Usually the grammar rules for basic building blocks are domain specific and must be specified and added per application.
Considers the use of various software tools to assess the possibility of obtaining indicators of balance reliability. A fairly new high-level, high-performance free programming language with dynamic typing Julia was u...
详细信息
ISBN:
(纸本)9788055333243
Considers the use of various software tools to assess the possibility of obtaining indicators of balance reliability. A fairly new high-level, high-performance free programming language with dynamic typing Julia was used as a mathematical programming language. Traditional languages are represented by Fortran. the comparison of the speed of obtaining the result. the pros and cons of using each of the options are considered.
the course of parallel programming is becoming more and more important for the education of students majoring in computer science. However, it is not easy to learn parallel programming well due to its high theory and ...
详细信息
We study languagesthat specify Markov Decision Processes with Imprecise Probabilities (MDPIPs) by mixing probabilities and logic programming. We propose a novel language that can capture MDPIPs and Markov Decision Pr...
详细信息
Many real-world applications feature data accesses on periodic domains. Manually implementing the synchronizations and communications associated to the data dependences on each case is cumbersome and error-prone. It i...
详细信息
Many real-world applications feature data accesses on periodic domains. Manually implementing the synchronizations and communications associated to the data dependences on each case is cumbersome and error-prone. It is increasingly interesting to support these applications in high-level parallel programminglanguages or parallelizing compilers. In this paper, we present a technique that, for distributed-memory systems, calculates the specific communications derived from data-parallel codes with or without periodic boundary conditions on affine access expressions. It makes transparent to the programmer the management of aggregated communications for the chosen data partition. Our technique moves to runtime part of the compile-time analysis typically used to generate the communication code for affine expressions, introducing a complete new technique that also supports the periodic boundary conditions. We present an experimental study to evaluate our proposal using several study cases. Our experimental results show that our approach can automatically obtain communication codes as efficient as those found in MPI reference codes, reducing the development effort.
A correspondence between database tuples as causes for query answers in databases and tuple-based repairs of inconsistent databases with respect to denial constraints has already been established. In this work, answer...
详细信息
ISBN:
(纸本)9783319900506;9783319900490
A correspondence between database tuples as causes for query answers in databases and tuple-based repairs of inconsistent databases with respect to denial constraints has already been established. In this work, answer-set programs that specify repairs of databases are used as a basis for solving computational and reasoning problems about causes. Here, causes are also introduced at the attribute level by appealing to a both null-based and attribute-based repair semantics. the corresponding repair programs are presented, and they are used as a basis for computation and reasoning about attribute-level causes.
A novel content-based feedback learning motion retrieval approach is presented. the approach includes two primary stages. (1) In the learning stage, fuzzy clustering is first utilized to get the representative frames ...
详细信息
the proceedings contain 21 papers. the special focus in this conference is on Foundations of Information and Knowledge Systems. the topics include: Probabilistic team semantics;strategic dialogical argumentation using...
ISBN:
(纸本)9783319900490
the proceedings contain 21 papers. the special focus in this conference is on Foundations of Information and Knowledge Systems. the topics include: Probabilistic team semantics;strategic dialogical argumentation using multi-criteria decision making with application to epistemic and emotional aspects of arguments;first-order definable counting-only queries;the power of tarski’s relation algebra on trees;improving the performance of the k rare class nearest neighbor classifier by the ranking of point patterns;preference learning and optimization for partial lexicographic preference forests over combinatorial domains;enumeration complexity of poor man’s propositional dependence logic;refining semantic matching for job recruitment: An application of formal concept analysis;ontodebug: Interactive ontology debugging plug-in for protégé;concatenation, separation, and other properties of variably polyadic relations;a framework for comparing query languages in their ability to express boolean queries;a generalized iterative scaling algorithm for maximum entropy model computations respecting probabilistic independencies;compilation of conditional knowledge bases for computing C-inference relations;characterizing and computing causes for query answers in databases from database repairs and repair programs;inferences from attribute-disjoint and duplicate-preserving relational fragmentations;ASP programs with groundings of small treewidth;rationality and context in defeasible subsumption;haydi: Rapid prototyping and combinatorial objects;argumentation frameworks with recursive attacks and evidence-based supports.
We identify three basic modalities for expressing boolean queries using the expressions of a query language: nonemptiness, emptiness, and containment. For the class of first-order queries, these three modalities have ...
详细信息
ISBN:
(纸本)9783319900506;9783319900490
We identify three basic modalities for expressing boolean queries using the expressions of a query language: nonemptiness, emptiness, and containment. For the class of first-order queries, these three modalities have exactly the same expressive power. For other classes of queries, e.g., expressed in weaker query languages, the modalities may differ in expressiveness. We propose a framework for studying the expressive power of boolean query modalities. Along one dimension, one may work within a fixed query language and compare the three modalities, e.g., we can compare a fixed query language F under emptiness to F under nonemptiness. Here, we identify crucial query features that enable us to go from one modality to another. Furthermore, we identify semantical properties that reflect the lack of these query features to establish separations. Along a second dimension, one may fix a modality and compare different query languages. this second dimension is the one that has already received quite some attention in the literature, whereas in this paper we emphasize the first dimension. Combining both dimensions, it is interesting to compare the expressive power of a weak query language using a strong modality, against that of a seemingly stronger query language but perhaps using a weaker modality. We present some initial results within this theme. As an important auxiliary result, we establish a preservation theorem for monotone containments of conjunctive queries.
暂无评论