Filtry
wszystkich: 6036
-
Katalog
- Publikacje 4011 wyników po odfiltrowaniu
- Czasopisma 13 wyników po odfiltrowaniu
- Konferencje 1 wyników po odfiltrowaniu
- Osoby 62 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Aparatura Badawcza 1 wyników po odfiltrowaniu
- Kursy Online 32 wyników po odfiltrowaniu
- Wydarzenia 3 wyników po odfiltrowaniu
- Dane Badawcze 1912 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: SYNCHRONOUS TREE
-
Lower bound on the weakly connected domination number of a tree
PublikacjaPraca dotyczy dolnego ograniczenia liczby dominowania słabo spójnego w drzewach (ograniczenie ze względu na ilość wierzchołków i ilość wierzchołków końcowych w drzewie).
-
Lower bound on the distance k-domination number of a tree
PublikacjaW artykule przedstawiono dolne ograniczenie na liczbę k-dominowania w drzewach oraz scharakteryzowano wszystkie grafy ekstremalne.
-
Gossiping by energy-constrained mobile agents in tree networks
PublikacjaEvery node of an edge-weighted tree network contains a data packet. At some nodes are placed mobile agents, each one possessing an amount of energy (not necessarily the same for all agents). While walking along the network, the agents spend the energy proportionally to the distance traveled and collect copies of the data packets present at the visited network nodes. An agent visiting a node deposits there copies of all currently...
-
Study of prototype multi-pole non-salient field winding for high speed brushless synchronous generator
PublikacjaIn this paper a non-salient field winding for a brushless synchronous generator working with high speed in an autonomous energy generation system (e.g. airplane power grid) has been presented. A conception of a six-pole cylindrical-rotor with distributed field winding has been proposed. Comparison study of salient and prototype non-salient field winding has been carried out. Chosen simulation and measurement results of the generator...
-
Development of an emulation platform for synchronous machine power generation system using a nonlinear functional level model
PublikacjaThe article presents the Power Hardware in the Loop (PHIL) approach for an autonomous power system analysis based on the synchronous generator model incorporating magnetic saturation effects. The model was prepared in the MATLAB/Simulink environment and then compiled into the C language for the PHIL platform implementation. The 150 kVA bidirectional DC/AC commercial-grade converter was used to emulate the synchronous generator....
-
Critical Review on Robust Speed Control Techniques for Permanent Magnet Synchronous Motor (PMSM) Speed Regulation
PublikacjaThe permanent magnet synchronous motor (PMSM) is a highly efficient energy saving machine. Due to its simple structural characteristics, good heat radiation capability, and high efficiency, PMSMs are gradually replacing AC induction motors in many industrial applications. The PMSM has a nonlinear system and lies on parameters that differ over time with complex high-class dynamics. To achieve the excessive performance operation...
-
Study of the Operation of Synchronous Generator Voltage Regulator During the Creation of Post Blackout Start-up Path
PublikacjaThis paper presents the influence of automatic voltage regulator (AVR) of synchronous generator on the process of creation of post black-out start-up path. Two elements of AVR have a significant impact on this process: underexcitation limiter (UEL) and load compensation (LC). The authors present a theoretical investigation and simulation results that illustrate how the mentioned elements of AVR affect voltage levels in a power...
-
Modelling of the High Speed Multi-Pole Synchronous Generator for Application in More Electric Aircraft Power Systems
PublikacjaIn this paper different models of the synchronous generator are presented. The simulation results compared with the measurements are shown. Certain physical phenomena are included in described models for the porpoise of adequate analysis of the more electric aircraft power system. For different modelling levels, such as functional level or behavioural level, different physical phenomena have been included. Simulation results for...
-
An upper bound for the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...
-
A lower bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
An upper bound on the 2-outer-independent domination number of a tree
PublikacjaA 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
An upper bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
A lower bound on the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
An algorithm for listing all minimal double dominating sets of a tree
PublikacjaWe provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.
-
An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree
PublikacjaWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3248n) . This implies that every tree has at most 1.3248 n minimal 2-dominating sets. We also show that this bound is tigh.
-
Analysis of Cogging Torque Reduction Method Effectiveness on the Example of a Surface Mounted Permanent Magnet Synchronous Motor Model
Publikacja -
Comparative Analysis of Salient and Non-Salient Pole Brushless Synchronous Generator for Application in Autonomous Electric Power System
PublikacjaThis paper presents a comparative study of two types of brushless synchronous generator for application in autonomous electric power systems (e.g. airplane power grid). Commercially used salient pole and a prototype non-salient pole high speed multi-pole brushless synchronous generator (BSG) have been presented. Comparative analysis of both types of the generator has been performed. Chosen simulation (using FEM and circuit models)...
-
Hybridized PWM Strategy for Three- and Multiphase Three-Level NPC Inverters
PublikacjaA simple hybridized pulsewidth modulation (PWM) algorithm for three- and multiphase three-level neutral point clamped (NPC) inverters is proposed. The proposed solution is based on classical space vector PWM (SVPWM) algorithms for two-level inverters but can also be based on sinusoidal PWM with min–max injection. An additional level of output voltage is obtained by modifying the resulting switching patterns taking into account...
-
Preserving Trees in Automata
PublikacjaWe present a method to store additional information in a minimal automaton so that it is possible to compute a corresponding tree node number for a state. The number can then be used to retrieve additional information. The method works for minimal (and any other) deterministic acyclic finite state automata (DFAs). We also show how to compute the inverse mapping.
-
Paired bondage in trees
PublikacjaW pracy zdefiniowano pojęcie liczby zniewolenia parami jako moc najmniejszego zbioru krawędzi, którego usunięcie z grafu spowoduje wzrost liczby dominowania parami. W szczególności scharakteryzowane są wszystkie drzewa, w których liczba zniewolenia wynosi 0, czyli takie, w których usunięcie dowolnego podzbioru krawędzi nie zwiększy liczby dominowania parami.
-
On the partition dimension of trees
PublikacjaGiven an ordered partition Π={P1,P2,…,Pt} of the vertex set V of a connected graph G=(V,E), the partition representation of a vertex v∈V with respect to the partition Π is the vector r(v|Π)=(d(v,P1),d(v,P2),…,d(v,Pt)), where d(v,Pi) represents the distance between the vertex vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...
-
Isocyanate-Free Polyurethanes
PublikacjaIsocyanate-free polyurethanes (also called non-isocyanate polyurethanes, or NIPUs) are alternatives to the conventional (commercially used) polyurethanes synthesized using di- or polyisocyanates, polyols, and chain extenders with low molecular weight. The major routes of NIPUs’ synthesis involve polyaddition of cyclic carbonates and di- or polyamines, polycondensation of carbamates, and diols. The most important intermediates are...
-
Three Seas Economic Journal
Czasopisma -
Switching Regulation in the Control of 5-Phase Permanent Magnet Synchronous Motor Fed by 3×5 Direct Matrix Converter
PublikacjaMatrix converter is an AC-AC direct power converter comprising of an array of bi- directional switches. It does not require an intermediate DC-link and allows sinusoidal output waveforms with varying amplitudes and frequencies. The configuration of these bi- directional switches decides the number of inputs and outputs...
-
Thermal analysis and experimental verification of permanent magnet synchronous motor by combining lumped-parameter thermal networks with analytical method
Publikacja -
Multiple reference frame theory in the synchronous generator model considering harmonic distortions caused by nonuniform pole shoe saturation
PublikacjaThe paper describes a synchronous generator model developed based on the multiple reference frame theory. The main physical phenomena included in the model are the machine armature non-sinusoidal voltage waveform and the influence of armature current in load conditions on the armature voltage waveform higher harmonic components. The modified multiple reference frame theory model is proposed. In this modified theory model the field...
-
Perfect hashing with pseudo-minimal bottom-up deterministic tree automata
PublikacjaWe describe a technique that maps unranked trees to their hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to techniques implemented with minimal tree automata, our procedure builds a pseudo-minimal DTA. Pseudo-minimal automata are larger than the minimal ones but in turn the mapping can be arbitrary, so it can be determined prior to the automaton construction. We also provide procedures to build incrementally...
-
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
PublikacjaW pracy rozważa się rozproszony model obliczeń, w którym struktura systemu jest reprezentowana przez graf bezpośrednich połączeń komunikacyjnych. W tym modelu podajemy nowy samostabilizujący algorytm znajdowania drzewa spinającego. Zgodnie z naszą wiedzą jest to pierwszy algorytm dla tego problemu z gwarantowaną wielomianową liczbą ruchów.
-
Empirical analysis of tree-based classification models for customer churn prediction
PublikacjaCustomer churn is a vital and reoccurring problem facing most business industries, particularly the telecommunications industry. Considering the fierce competition among telecommunications firms and the high expenses of attracting and gaining new subscribers, keeping existing loyal subscribers becomes crucial. Early prediction of disgruntled subscribers can assist telecommunications firms in identifying the reasons for churn and...
-
Critical Case Stochastic Phylogenetic Tree Model via the Laplace Transform
PublikacjaBirth–and–death models are now a common mathematical tool to describe branching patterns observed in real–world phylogenetic trees. Liggett and Schinazi (2009) is one such example. The authors propose a simple birth–and–death model that is compatible with phylogenetic trees of both influenza and HIV, depending on the birth rate parameter. An interesting special case of this model is the critical case where the birth rate equals the...
-
A city is not a tree: a multi-city study on street network and urban life
PublikacjaChristopher Alexander, a British-American scholar, differentiated an old (natural) city from a new (planned) one by structure. The former resembles a “semilattice”, or a complex system encompassing many interconnected sub-systems. The latter is shaped in a graph-theoretical “tree”, which lacks the structural complexity as its sub-systems are compartmentalized into a single hierarchy. This structural distinction explains why, or...
-
Analyses of influence of the rotor slots' skew on inductances of the stator and rotor windings of a squirell-cage asynchronous motor
PublikacjaObwodowy model matematyczny silnika asynchronicznego klatkowego ujęty w osiach naturalnych zawiera indukcyjności zależne od kąta położenia wirnika. Indukcyjności te zawierają szereg wyższych harmonicznych zależnych od układu geometrycznego strefy przyszczelinowej. Jednym z elementów tego układu jest skos żłobków wirnika. W referacie przedstawiono wyniki obliczeń elektromagnetycznych silnika magnesowanego pojedynczą cewką uzwojenia...
-
Fatigue fracture surface metrology of thin-walled tubular austenitic steel specimens after asynchronous loadings
PublikacjaThis paper aims to study the effect of asynchronous axial-torsional strain-controlled loading histories on fracture surface behavior of thin-walled tubular X5CrNi18-10 (304/304L) austenitic steel specimens. Tests under pure axial loading and pure torsional loading are also conducted to better segregate the effect of multiaxiality. The fractures surface topographies were examined through the profiles over the entire surface with...
-
TDOA versus ATDOA for wide area multilateration system
PublikacjaThis paper outlines a new method of a location service (LCS) in the asynchronous wireless networks (AWNs) where the nodes (base stations) operate asynchronously in relation to one another. This method, called asynchronous time difference of arrival (ATDOA), enables the calculation of the position of the mobile object (MO) through the measurements taken by a set of non-synchronized fixed nodes and is based on the measurement of...
-
Molecular Heterogeneity of Papillary Thyroid Cancer: Comparison of Primary Tumors and Synchronous Metastases in Regional Lymph Nodes by Mass Spectrometry Imaging
Publikacja -
Does diclofenac act like a photosynthetic herbicide on green algae? Chlamydomonas reinhardtii synchronous culture-based study with atrazine as reference
Publikacja -
Modelling of steady state and transient performance of the synchronous generator considering harmonic distortions caused by non-uniform saturation of the pole shoe
PublikacjaIn this paper a synchronous generator model is described. This model is developed on the assumption that in loaded and no load conditions the saturation effect affects the pole shoe in a different way. The developed model is based on the multiple saliency model and is formulated using winding function approach in machine variables. The influence of the non-uniform saturation of the pole shoe in load conditions on the performance...
-
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
PublikacjaW pracy rozważamy problem szukania, dla danego grafu prostego, drzewa spinającego, którego uporządkowana liczba chromatyczna jest minimalna. K.~Miyata i inni dowiedli w [Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem,Discrete Appl. Math. 154 (2006) 2402-2410], że odpowiedni problem decyzyjny jest NP-trudny już w przypadku pytania o istnienie uporządkowanego 4-pokolorowania....
-
Construction of a picewise-linear classifier by applaing discriminant analysis to decision tree induction
PublikacjaArtykuł prezentuje metodę konstrukcji drzew decyzyjnych. W odróżnieniu od większości popularnych algorytmów, które wybierają pojedyncze cechy do budowy reguł decyzyjnych w węzłach drzewa, ta metoda łączy wszystkie cechy. Używa ona wieloklasowego kryterium Fishera do wydzielenia nowych cech, które są liniowa kombinacją cech pierwotnych. Takie drzewa mogą aproksymować złożone regiony decyzyjne używając mniejszej liczby węzłów w porównaniu...
-
Multidimensional Feature Selection and Interaction Mining with Decision Tree Based Ensemble Methods
Publikacja -
INDIVIDUAL TREE DETECTION FROM UAV LIDAR DATA IN A MIXED SPECIES WOODLAND
Publikacja -
Fault Tree Analysis and Failure Diagnosis of Marine Diesel Engine Turbocharger System
Publikacja -
Tree-based homogeneous ensemble model with feature selection for diabetic retinopathy prediction
Publikacja -
Connected searching of weighted trees
PublikacjaW artykule rozważamy problem spójnego przeszukiwania drzew obciążonych. Autorzy w [L. Barriere i inni, Capture of an intruder by mobile agents, SPAA'02 (2002) 200-209] twierdzą, że istnieje wielomianowy algorytm dla problemu obliczania optymalnej strategii przeszukiwania obciążonego drzewa. W niniejszej pracy pokazano, że problem ten jest obliczeniowo trudny nawet dla wierzchołkowo-obciążonych drzew (wagi krawędzi równe 1) oraz...
-
Collision-free network exploration
PublikacjaMobile agents start at different nodes of an n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round two agents may occupy the same node. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest time required to reach a configuration in which each agent has visited all nodes and returned to its starting location. In...
-
The complexity of list ranking of trees
PublikacjaUporządkowane kolorowanie grafu polega na takim etykietowaniu jego wierzchołków, aby każda ścieżka łącząca dwa wierzchołki o tym samym kolorze zawierała wierzchołek o kolorze wyższym. Jeśli każdy wierzchołek posiada dodatkowo listę dozwolonych dla niego etykiet, to mówimy wówczas o uporządkowanym listowym kolorowaniu wierzchołków. W pracy wskazano szereg klas grafów, dla których problem jest trudny: pełne drzewa binarne, drzewa...
-
Connected searching of weighted trees
PublikacjaW pracy pokazano, że problem spójnego przeszukiwania drzew ważonych jest silnie NP-zupełny. Problem pozostaje trudnym dla drzew z jednym wierzchołkiem o stopniu większym niż 2. Ponadto, przedstawiony został wielomianowy optymalny algorytm dla klasy drzew z ograniczonym stopniem.
-
Three-fast-searchable graphs
PublikacjaIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
Collision-Free Network Exploration
PublikacjaA set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...