the proceedings contain 26 papers. the topics discussed include: measuring reproduciblity of machine learning methods for medical diagnosis;data-driven assessment of dementia caregivers’ burden: one size does not fit...
ISBN:
(纸本)9781665471848
the proceedings contain 26 papers. the topics discussed include: measuring reproduciblity of machine learning methods for medical diagnosis;data-driven assessment of dementia caregivers’ burden: one size does not fit all;effectiveness of deep learning for erasing satellite streaks in astronomical photos;a hybrid approach for automatic feedback generation in natural language programming;generating natural language explanations for black-box predictions;neural network modeling of HIV acute and chronic phases with and without antiretroviral intervention;leveraging differences in entropy for password generating models;extensions to generalized annotated logic and an equivalent neural architecture;inclusion and exclusion criteria for automating adherence to scope of conference calls for papers;a language model identifies population-level features of the T cell receptor via self-supervised learning;and multimodal recommender system in the prediction of disease comorbidity.
Weighted Markov decision processes (MDPs) have long been used to model quantitative aspects of systems in the presence of uncertainty. However, much of the literature on such MDPs takes a monolithic approach, by model...
详细信息
Weighted Markov decision processes (MDPs) have long been used to model quantitative aspects of systems in the presence of uncertainty. However, much of the literature on such MDPs takes a monolithic approach, by modelling a system as a particular MDP;properties of the system are then inferred by analysis of that particular MDP. In contrast in this paper we develop compositional methods for reasoning about weighted MDPs, as a possible basis for compositional reasoning about their quantitative behaviour. In particular we approach these systems from a process algebraic point of view. For these we define a coinductive simulation-based behavioural preorder which is compositional in the sense that it is preserved by structural operators for constructing weighted MDPs from components. For finitary convergent processes, which are finite-state and finitely branching systems without divergence, we provide two characterisations of the behavioural preorder. the first uses a novel quantitative probabilistic logic, while the second is in terms of a novel form of testing, in which benefits are accrued during the execution of tests. (C) 2013 Elsevier B.V. All rights reserved.
Modern equipment such as unmanned CNC has replaced traditional manual operations, which would greatly increase the production capacity of the production line. the key factor determining the efficiency of a manufacture...
详细信息
ISBN:
(纸本)9781728162973
Modern equipment such as unmanned CNC has replaced traditional manual operations, which would greatly increase the production capacity of the production line. the key factor determining the efficiency of a manufacture system is the operating logic. therefore, studying this topic is of great significance to industries. this paper firstly introduces a specific smart manufacture system and analysis the factors which would influence the efficiency. then 0-1 integer programming is adopted to find the optimal queue. Because of the complexity of the model is too high, Monte Carlo and some more limitations are applied to the independent variable matrix to simplify the model. At last, the simulation based on greedy algorithm is designed to find the optimal dynamic scheduling strategy and one overall empirical formula is generated through it.
Observability and reachability are important concepts for formal software development. While observability concepts are used to specify the required observable behavior of a program or system, reachability concepts ar...
详细信息
Observability and reachability are important concepts for formal software development. While observability concepts are used to specify the required observable behavior of a program or system, reachability concepts are used to describe the underlying data in terms of datatype constructors. In this paper we first reconsider the observational logic institution which provides a logical framework for dealing with observability. then we develop in a completely analogous way the constructor-based logic institution which formalizes a novel treatment of reachability. Both institutions are tailored to capture the semantically correct realizations of a specification from either the observational or the reachability point of view. We show that there is a methodological and even formal duality between both frameworks. In particular, we establish a correspondence between observer operations and datatype constructors, observational and constructor-based algebras, fully abstract and reachable algebras, and observational and inductive consequences of specifications. the formal duality between the observability and reachability concepts is established in a category-theoretic setting. (C) 2002 Elsevier Science B.V. All rights reserved.
Industrial Process Control is constantly expand, regarding their control more and more solutions are presently in the market. these include mature methods like Petri nets, and standardized languages, which are commonl...
详细信息
this paper addresses the notion of declarative goals as used in agent programming. Declarative goals describe desirable states, and semantics of these goals in an agent programming context can be defined in various wa...
详细信息
this paper addresses the notion of declarative goals as used in agent programming. Declarative goals describe desirable states, and semantics of these goals in an agent programming context can be defined in various ways. this paper defines two semantics for goals, with one based on default logic. the semantics are partly motivated by an analysis of other proposals that have been done in the literature. Further, we establish relations between and properties of these semantics. Copyright 2005 ACM.
Incomplete information is a problem in many aspects of actual environments. In many sceneries the knowledge is not represented in a crisp way. It is common to find fuzzy concepts or problems with some level of uncerta...
详细信息
ISBN:
(纸本)8476538723
Incomplete information is a problem in many aspects of actual environments. In many sceneries the knowledge is not represented in a crisp way. It is common to find fuzzy concepts or problems with some level of uncertainty. It is dificult to find practical systems which handle fuzziness and uncertainty and the few examples that we can find are minority. To extend a popular system (which many of programmers are using) withthis hability seems to be an interesting issue. Our first work (Fuzzy Prolog [1]) was a language that models B([0;1])-valued Fuzzy logic. In the Borel Algebra, B([0;1]), truth value is represented using unions of intervals of real numbers. It subsumed former approaches because it was more general in truth value representation and propagation than them. Now, we enhance our former approach by using default knowledge to represent incomplete information in logicprogramming. We also provide the implementation of this new framework. this new release of Fuzzy Prolog handles incomplete information and it has a complete semantics (the before one was incomplete as Prolog) which we discuss. New Fuzzy Prolog is more expressive to represent real world.
P2P network can be reduced into a system of fuzzy relation inequalities with addition-min composition. In this paper we introduce multi-variable-term latticized linear programming subject to this system. Firstly, we i...
详细信息
ISBN:
(纸本)9783319462066;9783319462059
P2P network can be reduced into a system of fuzzy relation inequalities with addition-min composition. In this paper we introduce multi-variable-term latticized linear programming subject to this system. Firstly, we introduce some properties on the minimal solution of the system. Next we define the minimal intervals of the system. Meanwhile, We prove that the optimal solution of the programming is the minimal solution of the system. Finally, we get algorithm for the programming by translating it into some linear programming problems with minimal intervals constraint. An example is given to show the efficiency and feasibility of the algorithm.
the proceedings contain 13 papers. the topics discussed include: how tests and proofs impede one another: the need for always-on static and dynamic feedback;myths in software engineering: from the other side;testing f...
ISBN:
(纸本)3642139760
the proceedings contain 13 papers. the topics discussed include: how tests and proofs impede one another: the need for always-on static and dynamic feedback;myths in software engineering: from the other side;testing first-order logic axioms in program verification;proving and visualizing OCL invariant independence by automatically generated test cases;generating regression unit tests using a combination of verification and capture & replay;DyGen: automatic generation of high-coverage tests via mining gigabytes of dynamic traces;combining static analysis and test generation for C program debugging;generating high-quality tests for Boolean circuits by treating tests as proof encoding;relational analysis of (Co)inductive predicates, (Co)algebraic datatypes, and (Co)recursive functions;combining theorem proving and narrowing for rewriting-logic specifications;and building a test-ready abstraction of a behavioral model using CLP.
Flow interception problem is concerned with how to locate facilities with fixed numbers to serve the maximum bypassing customer flows. this paper mainly investigates this problem with stochastic customer flows. Custom...
详细信息
ISBN:
(纸本)0769528740
Flow interception problem is concerned with how to locate facilities with fixed numbers to serve the maximum bypassing customer flows. this paper mainly investigates this problem with stochastic customer flows. Customer flows's path-choosing behavior is to maximize possibility of obtaining serve on the condition of satisfying the fuzzy trip cost threshold level. Consequentially, chance-constrained bi-level programming model for this problem is designed. Genetic algorithm, simplex method, stochastic simulation and fuzzy simulation algorithm are integrated to seek the approximate best solution of the model.
暂无评论