Capacity planning is a challenging issue for designing next generation optical core networks. this paper presents a fuzzy linear programming (FLP) approach for capacity planning in optical networks under long-term dem...
详细信息
ISBN:
(纸本)9781424477999
Capacity planning is a challenging issue for designing next generation optical core networks. this paper presents a fuzzy linear programming (FLP) approach for capacity planning in optical networks under long-term demand uncertainty where the information of traffic loads is imprecise by nature. the simplicity of fuzzy logic is integrated with linear programming for capacity planning in optical backbones. the uncertainties in demand matrix are represented by membership functions using a-cut concept to provide a mathematical framework for dealing with non statistical uncertainties. the proposed approach offers the ability of consideration all conditions for decision making in optical networks. Simulation results show the efficiency of fuzzy linear programming method for capacity planning in optical networks. the proposed approach could be extended for considering other uncertainty sources in capacity planning problem of optical networks such as objective function and constraints.
the efficiency of inductive motor can obtain the maximum value in the rating working condition, but will decrease obviously in the light load status. A method in the efficiency optimizing of inductive motor is introdu...
详细信息
ISBN:
(纸本)9784886860675
the efficiency of inductive motor can obtain the maximum value in the rating working condition, but will decrease obviously in the light load status. A method in the efficiency optimizing of inductive motor is introduced in this paper. In the vector controlled inductive motor system, a hybrid energy saving control method is put forward. In this method, neural network, fuzzy logic and Rosenbrock searching algorithm are combined in one system. Compared withthe performance of using these algorithms separately, some problems such as torque variation, local optimization and system divergence can be solved partly in this method. the simulation results show that the system achieves high efficiency operation by using the proposed method, when the load is changed. the energy saving target is obtained.
the impossibility of semantically complete deductive calculi for logics for imperative programs has led to the study of two alternative approaches to completeness: "local" semantic completeness on the one ha...
详细信息
ISBN:
(数字)9783642005961
ISBN:
(纸本)9783642005954
the impossibility of semantically complete deductive calculi for logics for imperative programs has led to the study of two alternative approaches to completeness: "local" semantic completeness on the one hand (Cook's relative completeness, Harel's Arithmetical completeness), and completeness with respect to other forms of reasoning about programs. on the other. However, local semantic completeness is problematic on several counts, whereas proof theoretic completeness results often involve ad hoc ingredients. Such as formal theories for the natural numbers. the notion of inductive completeness, introduced in [18]. provides a generic proof theoretic framework which dispenses with extraneous ingredients. and yields local semantic completeness as a corollary. Here we prove that (first-order) Dynamic logic tor regular programs (DL) is inductively complete: a DL-formula phi is provable in (the first-order variant of) Pratt-Segerberg deductive calculus DL iff phi, is provable in first-order logic from the inductivetheory for program semantics. the method can be adapted to yield the schematic relative completeness of DL: if S is in expressive Structure, then every formula true in S is provable from the axiom-schemas that are valid in S. Harel's Completeness theorem falls out then as a special case.
Secure interoperation is an increasingly important issue for large-scale enterprise applications. In this paper, we investigate, through constraint logicprogramming (CLP), secure interoperation in collaborating envir...
详细信息
In this work a fault diagnosis system for non-linear plants based on fuzzy logic, called VisualBlock-FIR, is presented and applied to an energy generation system based on fuel cells. VisualBlock-FIR runs under the Sim...
详细信息
ISBN:
(纸本)9781607504658;9781607500612
In this work a fault diagnosis system for non-linear plants based on fuzzy logic, called VisualBlock-FIR, is presented and applied to an energy generation system based on fuel cells. VisualBlock-FIR runs under the Simulink framework and enables early fault detection and identification. During fault detection, the fault diagnosis system should recognize that the system is not working properly. During fault identification, it should conclude which type of failure has occurred. the diagnosis results for some of the most frequent faults in fuel cell systems are presented.
Compounds in drug screening-libraries should resemble pharmaceuticals. To operationally test this, we analysed the compounds in terms of known drug-like filters and developed a novel machine learning method to discrim...
详细信息
ISBN:
(纸本)9783642040306
Compounds in drug screening-libraries should resemble pharmaceuticals. To operationally test this, we analysed the compounds in terms of known drug-like filters and developed a novel machine learning method to discriminate approved pharmaceuticals from "drug-like" compounds. this method uses both structural features and molecular properties for discrimination. the method has an estimated accuracy of 91% in discriminating between the Maybridge Hit-Finder library and approved pharmaceuticals, and 99% between the NATDiverse collection (from Analyticon Discovery) and approved pharmaceuticals. these results show that Lipinski's Rule of 5 for oral absorption is not Sufficient to describe "drug-likeness" and be the main basis of screening-library design.
this paper presents a Knowledge Base prospect for FO(ID), in extension of classical logic withinductive definitions. this logic is a natural integration of classical logic and logicprogramming based on the view of a...
详细信息
ISBN:
(纸本)9783540899815
this paper presents a Knowledge Base prospect for FO(ID), in extension of classical logic withinductive definitions. this logic is a natural integration of classical logic and logicprogramming based on the view of a logic program as a definition. We discuss the relationship between inductive definitions and common sense reasoning and the strong similarities mid striking differences with ASP and Abductive LP. We report on inference systems that combine state-of-the-art techniques of SAT and ASP. Experiments show that FO(ID) model expansion systems are competitive withthe best ASP-solvers.
In reinforcement learning problems, an agent has the task of learning a good or optimal strategy from interaction with his environment. At the start of the learning task, the agent usually has very little information....
详细信息
ISBN:
(纸本)9783540784685
In reinforcement learning problems, an agent has the task of learning a good or optimal strategy from interaction with his environment. At the start of the learning task, the agent usually has very little information. therefore, when faced with complex problems that have a large state space, learning a good strategy might be infeasible or too slow to work in practice. One way to overcome this problem, is the use of guidance to supply the agent with traces of "reasonable policies". However, in a lot of cases it will be hard for the user to supply such a policy. In this paper, we will investigate the use of transfer learning in Relational Reinforcement Learning. the goal of transfer learning is to accelerate learning on a target task after training on a different, but related, source task. More specifically, we introduce an extension of the options framework to the relational setting and show how one can learn skills that can be transferred across similar, but different domains. We present experiments showing the possible benefits of using relational options for transfer learning.
We present an approach for the automatic characterisation of the harmony of song sets making use of relational induction of logical rules. We analyse manually annotated chord data available in RDF and interlinked with...
详细信息
ISBN:
(纸本)9780615248493
We present an approach for the automatic characterisation of the harmony of song sets making use of relational induction of logical rules. We analyse manually annotated chord data available in RDF and interlinked with web identifiers for chords which themselves give access to the root, bass, component intervals of the chords. We pre-process these data to obtain high-level information such as chord category, degree and intervals between chords before passing them to an inductivelogicprogramming software which extracts the harmony rules underlying them. this framework is tested over the Beatles songs and the Real Book songs. It generates a total over several experiments of 12,450 harmony rules characterising and differentiating the Real Book (jazz) songs and the Beatles' (pop) music. Encouragingly, a preliminary analysis of the most common rules reveals a list of well-known pop and jazz patterns that could be completed by a more in depth analysis of the other rules.
Updating agents' knowledge bases is an important topic in Artificial Intelligence and a key problem of knowledge representation and reasoning. One of the latest ideas to update logic programs is to use abduction b...
详细信息
ISBN:
(纸本)9780889867550
Updating agents' knowledge bases is an important topic in Artificial Intelligence and a key problem of knowledge representation and reasoning. One of the latest ideas to update logic programs is to use abduction by means of Minimal Generalised Answer Sets (MGAS). MGAS provide a more general and flexible semantics than standard ASP , and we propose it to overcome disadvantages of previous approaches as well as to simplify boththe semantics definition and its implementation. Moreover, the author provides a link to a modest online prototype of the semantics here introduced. this prototype models updates in a well-known Disjunctive Datalog, DLV, which is an implementation (solver) for Answer Set programming. Accordingly, the two-fold contribution of this paper is showing a simpler theoretical framework characterised in DLV's weak constraints, as well as an outline of the basic structure of its implementation, description of the employed technology.
暂无评论