this paper presents the development of an intelligent network performance analysis tool (INPAT) that complements an existing network simulator toolkit. INPAT has the capability of doing network performance evaluation ...
详细信息
ISBN:
(纸本)9780889867345
this paper presents the development of an intelligent network performance analysis tool (INPAT) that complements an existing network simulator toolkit. INPAT has the capability of doing network performance evaluation using a fuzzy logic decision making scheme. INPAT can be beneficial to many people inclusive of students, who are interested in network performance analysis. It provides a technique for further advancement in the network management area. MATLAB's Fuzzy logic Toolbox is used to develop the fuzzy logic engine for data analysis. TCL/TK programming language is used to embed the fuzzy logic engine and data processing program within a single GUI for easy use. Potentially this project will realize the idea of network performance analysis by just a click of a mouse.
In the paper the experimental study of the influence of parameters on the final results of the rule extraction method from neural network for classification problem is described. the method is based on evolutionary ap...
详细信息
ISBN:
(纸本)0769522866
In the paper the experimental study of the influence of parameters on the final results of the rule extraction method from neural network for classification problem is described. the method is based on evolutionary approach, where for each class evolves separate population. the paper starts on the presentation of the basic concepts of the method Next, the results of experiments are described. they examine the influence of genetic parameters. then, the parameters that affect the rule extraction efficiency are tested. All experiments are made with using UCI data sets. At the end, some general conclusion concerning the role of the parameters and their influence on the final results are formulated.
In this paper we present a stepwise refinement based top-down approach to verified imperative data structures. Our approach is modular in the sense that already verified data structures can be used for construction of...
详细信息
ISBN:
(纸本)9781450341271
In this paper we present a stepwise refinement based top-down approach to verified imperative data structures. Our approach is modular in the sense that already verified data structures can be used for construction of more complex data structures. Moreover, our data structures can be used as building blocks for the verification of algorithms. Our tool chain supports refinement down to executable code in various programming languages, and is fully implemented in Isabelle/HOL, such that its trusted code base is only the inference kernel and the code generator of Isabelle/HOL. As a case study, we verify an indexed heap data structure, and use it to generate an efficient verified implementation of Dijkstra's algorithm.
the proceedings contain 9 papers. the topics discussed include: using Linux FIFOs to allow flexible hardware/software communications on reconfigurable systems-on-chip;improved parallelization of legacy embedded softwa...
ISBN:
(纸本)9783800747238
the proceedings contain 9 papers. the topics discussed include: using Linux FIFOs to allow flexible hardware/software communications on reconfigurable systems-on-chip;improved parallelization of legacy embedded software on soft-core MPSoCs through automatic loop transformations;exact mapping of rewritten linear functions to configurable logic;ZUCL: a ZYNQ UltraScale+ framework for OpenCL HLS applications;unfolding and folding: a new approach for code restructuring targeting HLS for FPGAs;HatScheT: a contribution to agile HLS;LeFlow: enabling flexible fpga high-level synthesis of tensorflow deep neural networks;a case study in using OpenCL on FPGAs: creating an open-source accelerator of the AutoDock molecular docking software;and a journey into DSL design using generative programming: FPGA mapping of image border handling through refinement.
this study attempted to carry out interdisciplinary learning activities which integrate computational thinking into language learning. the participants were 56 5th-grade Chinese as a Second Language (CSL) students in ...
详细信息
ISBN:
(数字)9781728160900
ISBN:
(纸本)9781728160900
this study attempted to carry out interdisciplinary learning activities which integrate computational thinking into language learning. the participants were 56 5th-grade Chinese as a Second Language (CSL) students in Singapore. the students were required to learn the ability to apply conditional complex sentences in Chinese language and learn the conditional structural logicthrough coding educational robots to interact with each other in Chinese. the results showed that the students improved significantly in the linguistic knowledge. Furthermore, the computer programming self-efficacy of the students has also promoted significantly in terms of logical thinking, control and debugging. the students had also shown a high level of learning engagement, low anxiety and a high intention in the robot coding activity. this study presented the empirical results of this cross-domain integration of educational robots and language learning, providing a reference and teaching practices for future teachers.
In most programming languages, there are logical operators "logical NOT", "logical AND", "logical OR". there are also logical bitwise operators "bitwise NOT", "bitwise AND&...
详细信息
this paper presents theoretical basis of a language system whose program is described as algebraic expressions and implemented as abstract state machine. the behaviors of the described expressions may be captured (wit...
详细信息
ISBN:
(纸本)9789897584275
this paper presents theoretical basis of a language system whose program is described as algebraic expressions and implemented as abstract state machine. the behaviors of the described expressions may be captured (withtheir models) as causing sequences for state transitions, where composition and alternation for state transitions are mechanized in algebraic structure. Monitoring facilities to the language system may be described with state concepts, as well. With respect to intuitionistic logic and logical program containing negatives, Heyting algebra expressions are taken rather than already established nonmonotonic reasoning programs with negations, where 3-valued domain may be of use for the undefined to be allowable such that positives and negatives may be consistently evaluated, instead of rigid 2-valued settlements. We may have a standard form of Heyting algebra expressions in accordance to logical and AI programming, where the expressions are constrained with states. the states may be regarded as environmental conditions or objects as in object-oriented programming. As regards 3-valued models of given expressions, monotonic mapping cannot be in general associated with, but some ways are presented to approximate fixed points of a mapping for the given expression. then the formal description of programs may be given with reference to state transitions, which is thought of as proposing a language system structure.
Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, tropical analogues of classical linear programming results need to be developed. this moti...
详细信息
Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, tropical analogues of classical linear programming results need to be developed. this motivation leads us to study the tropical analogue of the classical linear-fractional programming problem. We construct an associated parametric mean payoff game problem, and show that the optimality of a given point, or the unboundedness of the problem, can be certified by exhibiting a strategy for one of the players having certain infinitesimal properties (involving the value of the game and its derivative) that we characterize combinatorially. We use this idea to design a Newton-like algorithm to solve tropical linear-fractional programming problems, by reduction to a sequence of auxiliary mean payoff game problems. (C) 2012 Elsevier Ltd. All rights reserved.
作者：
Caires, LuisDI-FCT
Universidade Nova de Lisbon Monte da Caparica2825 Portugal
Due to its ability to handle resources in a finely controlled way, linear logic is being adopted as a foundation of several logicprogramming and specification languages in which some notions of state can be modelled....
详细信息
this system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logicthat supports expressions about sets, multisets, and integers. Constraints over ...
详细信息
ISBN:
(纸本)9783642142024
this system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logicthat supports expressions about sets, multisets, and integers. Constraints over collections and integers are connected using the cardinality operator. Our logic is a fragment of logics of popular interactive theorem provers, and MUNCH is the first fully automated reasoner for this logic. MUNCH reduces input formulas to equisatisfiable linear integer arithmetic formulas. MUNCH reasoner is publicly available. It is implemented in the Scala programming language and currently uses the SMT solver Z3 to solve the generated integer linear arithmetic constraints.
暂无评论