The multilevel inverters (MLIs) are classified into three topologies such as Diode Clamped, Flying Capacitor and Cascade Multilevel Inverter (CMLI). CMLI topologies include two kind of structure that is named symmetri...
详细信息
ISBN:
(纸本)9781467363914
The multilevel inverters (MLIs) are classified into three topologies such as Diode Clamped, Flying Capacitor and Cascade Multilevel Inverter (CMLI). CMLI topologies include two kind of structure that is named symmetric and asymmetric topologies. Asymmetric Cascade MLI (ACMLI) topologies consist of unequal DC sources. Many modulation techniques have been used in ACMLI topology such as Multi-Carrier PWM (MC-PWM), Space Vector PWM and Selective Harmonic PWM. The MC-PWM technique is achieved by four different types. In this study, MC-PWM techniques which are named Phase Disposition PWM, Phase Opposition Disposition PWM, Alternate Phase Opposition Disposition PWM and Phase Shifted PWM have been compared. It is uncovered that Phase Opposition Disposition PWM technique is more convenient in terms of Total Harmonic Distortion of output voltage and current signals and in terms of the quality of power factor in ACMLI which is performed in this study.
We present a novel canonical automaton model for languages over infinite data domains, that is suitable for specifying the behavior of services, protocol components, interfaces, etc. The model is based on register aut...
详细信息
Composition-nominative logics are algebra-based logics of partial predicates constructed in a semantic-syntactic style on the methodological basis, which is common with programming. They can be considered as generaliz...
详细信息
In the paper new logics oriented on hierarchical data are developed. Algebras of partial predicates over such data with special compositions as operations form a semantic base for constructed logics. Characteristic pr...
详细信息
In the paper new logics oriented on hierarchical data are developed. Algebras of partial predicates over such data with special compositions as operations form a semantic base for constructed logics. Characteristic property of such logics is the usage of composite names in their languages. Semantic properties of these logics are studied;corresponding sequent calculi are defined, their soundness and completeness are proved for logics of renominative level.
We investigate algorithms for solving the satisfiability problem in composition-nominative logics of quantifier-equational level. These logics are algebra-based logics of partial predicates constructed in a semantic-s...
详细信息
We investigate algorithms for solving the satisfiability problem in composition-nominative logics of quantifier-equational level. These logics are algebra-based logics of partial predicates constructed in a semantic-syntactic style on the methodological basis, which is common with programming;they can be considered as generalizations of traditional logics on classes of partial predicates that do not have fixed arity. We show the reduction of the problem in hand to the satisfiability problem for classical first-order predicate logic with equality. The proposed reduction requires extension of logic language and logic models with an infinite number of unessential variables. The method developed in the paper enables us to use existent satisfiability checking procedures also for quantifier composition-nominative logic with equality.
Data mining has become an important and active area of research because of theoretical challenges and practical applications associated with the problem of discovering interesting and previously unknown knowledge from...
详细信息
In this paper, we show how to fully automatically infer semantic interfaces of data structures on the basis of systematic testing. Our semantic interfaces are a generalized form of Register Automata (RA), comprising p...
详细信息
An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference betw...
详细信息
An L(0,1)-labelling of a graph G is an assignment of nonnegative integers to the vertices of G such that the difference between the labels assigned to any two adjacent vertices is at least zero and the difference between the labels assigned to any two vertices which are at distance two is at least one. The span of an L(0,1)-labelling is the maximum label number assigned to any vertex of G. The L(0,1)-labelling number of a graph G, denoted by λ0.1(G) is the least integer k such that G has an L(0,1)-labelling of span k. This labelling has an application to a computer code assignment problem. The task is to assign integer control codes to a network of computer stations with distance restrictions. A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we label the vertices of a cactus graph by L(0,1)-labelling and have shown that, △-1≤λ0.1(G)≤△ for a cactus graph, where △ is the degree of the graph G.
Multi-agent approaches can be applied to model behaviour and relations of entities in cyber-physical systems. Here entities frequently compete on insufficient resources (e.g., hardware) at the same time. Hence, resour...
详细信息
The paper gives an overview of research devoted to developing a semi-automatic methodology of building a semantic model of medical diagnostic knowledge. The methodology is based on natural language processing methods ...
详细信息
暂无评论