Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 2430

Search results for: one vertex union of a cycle and a star

2430 The Vertex Degree Distance of One Vertex Union of the Cycle and the Star

Authors: Ying Wang, Haiyan Xie, Aoming Zhang


The degree distance of a graph is a graph invariant that is more sensitive than the Wiener index. In this paper, we calculate the vertex degree distances of one vertex union of the cycle and the star, and the degree distance of one vertex union of the cycle and the star. These results lay a foundation for further study on the extreme value of the vertex degree distances, and the distribution of the vertices with the extreme value in one vertex union of the cycle and the star.

Keywords: degree distance, vertex-degree-distance, one vertex union of a cycle and a star, graph

Procedia PDF Downloads 71
2429 The Load Balancing Algorithm for the Star Interconnection Network

Authors: Ahmad M. Awwad, Jehad Al-Sadi


The star network is one of the promising interconnection networks for future high speed parallel computers, it is expected to be one of the future-generation networks. The star network is both edge and vertex symmetry, it was shown to have many gorgeous topological proprieties also it is owns hierarchical structure framework. Although much of the research work has been done on this promising network in literature, it still suffers from having enough algorithms for load balancing problem. In this paper we try to work on this issue by investigating and proposing an efficient algorithm for load balancing problem for the star network. The proposed algorithm is called Star Clustered Dimension Exchange Method SCDEM to be implemented on the star network. The proposed algorithm is based on the Clustered Dimension Exchange Method (CDEM). The SCDEM algorithm is shown to be efficient in redistributing the load balancing as evenly as possible among all nodes of different factor networks.

Keywords: load balancing, star network, interconnection networks, algorithm

Procedia PDF Downloads 247
2428 Bounds on the Laplacian Vertex PI Energy

Authors: Ezgi Kaya, A. Dilek Maden


A topological index is a number related to graph which is invariant under graph isomorphism. In theoretical chemistry, molecular structure descriptors (also called topological indices) are used for modeling physicochemical, pharmacologic, toxicologic, biological and other properties of chemical compounds. Let G be a graph with n vertices and m edges. For a given edge uv, the quantity nu(e) denotes the number of vertices closer to u than v, the quantity nv(e) is defined analogously. The vertex PI index defined as the sum of the nu(e) and nv(e). Here the sum is taken over all edges of G. The energy of a graph is defined as the sum of the eigenvalues of adjacency matrix of G and the Laplacian energy of a graph is defined as the sum of the absolute value of difference of laplacian eigenvalues and average degree of G. In theoretical chemistry, the π-electron energy of a conjugated carbon molecule, computed using the Hückel theory, coincides with the energy. Hence results on graph energy assume special significance. The Laplacian matrix of a graph G weighted by the vertex PI weighting is the Laplacian vertex PI matrix and the Laplacian vertex PI eigenvalues of a connected graph G are the eigenvalues of its Laplacian vertex PI matrix. In this study, Laplacian vertex PI energy of a graph is defined of G. We also give some bounds for the Laplacian vertex PI energy of graphs in terms of vertex PI index, the sum of the squares of entries in the Laplacian vertex PI matrix and the absolute value of the determinant of the Laplacian vertex PI matrix.

Keywords: energy, Laplacian energy, laplacian vertex PI eigenvalues, Laplacian vertex PI energy, vertex PI index

Procedia PDF Downloads 158
2427 Deciding Graph Non-Hamiltonicity via a Closure Algorithm

Authors: E. R. Swart, S. J. Gismondi, N. R. Swart, C. E. Bell


We present an heuristic algorithm that decides graph non-Hamiltonicity. All graphs are directed, each undirected edge regarded as a pair of counter directed arcs. Each of the n! Hamilton cycles in a complete graph on n+1 vertices is mapped to an n-permutation matrix P where p(u,i)=1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n+1. We first create exclusion set E by noting all arcs (u, v) not in G, sufficient to code precisely all cycles excluded from G i.e. cycles not in G use at least one arc not in G. Members are pairs of components of P, {p(u,i),p(v,i+1)}, i=1, n-1. A doubly stochastic-like relaxed LP formulation of the Hamilton cycle decision problem is constructed. Each {p(u,i),p(v,i+1)} in E is coded as variable q(u,i,v,i+1)=0 i.e. shrinks the feasible region. We then implement the Weak Closure Algorithm (WCA) that tests necessary conditions of a matching, together with Boolean closure to decide 0/1 variable assignments. Each {p(u,i),p(v,j)} not in E is tested for membership in E, and if possible, added to E (q(u,i,v,j)=0) to iteratively maximize |E|. If the WCA constructs E to be maximal, the set of all {p(u,i),p(v,j)}, then G is decided non-Hamiltonian. Only non-Hamiltonian G share this maximal property. Ten non-Hamiltonian graphs (10 through 104 vertices) and 2000 randomized 31 vertex non-Hamiltonian graphs are tested and correctly decided non-Hamiltonian. For Hamiltonian G, the complement of E covers a matching, perhaps useful in searching for cycles. We also present an example where the WCA fails.

Keywords: Hamilton cycle decision problem, computational complexity theory, graph theory, theoretical computer science

Procedia PDF Downloads 294
2426 Nullity of t-Tupple Graphs

Authors: Khidir R. Sharaf, Didar A. Ali


The nullity η (G) of a graph is the occurrence of zero as an eigenvalue in its spectra. A zero-sum weighting of a graph G is real valued function, say f from vertices of G to the set of real numbers, provided that for each vertex of G the summation of the weights f (w) over all neighborhood w of v is zero for each v in G.A high zero-sum weighting of G is one that uses maximum number of non-zero independent variables. If G is graph with an end vertex, and if H is an induced sub-graph of G obtained by deleting this vertex together with the vertex adjacent to it, then, η(G)= η(H). In this paper, a high zero-sum weighting technique and the end vertex procedure are applied to evaluate the nullity of t-tupple and generalized t-tupple graphs are derived and determined for some special types of graphs. Also, we introduce and prove some important results about the t-tupple coalescence, Cartesian and Kronecker products of nut graphs.

Keywords: graph theory, graph spectra, nullity of graphs, statistic

Procedia PDF Downloads 156
2425 On the Basis Number and the Minimum Cycle Bases of the Wreath Product of Paths with Wheels

Authors: M. M. M. Jaradat


For a given graph G, the set Ԑ of all subsets of E(G) forms an |E(G)| dimensional vector space over Z2 with vector addition X⊕Y = (X\Y ) [ (Y \X) and scalar multiplication 1.X = X and 0.X = Ø for all X, Yϵ Ԑ. The cycle space, C(G), of a graph G is the vector subspace of (E; ⊕; .) spanned by the cycles of G. Traditionally there have been two notions of minimality among bases of C(G). First, a basis B of G is called a d-fold if each edge of G occurs in at most d cycles of the basis B. The basis number, b(G), of G is the least non-negative integer d such that C(G) has a d-fold basis; a required basis of C(G) is a basis for which each edge of G belongs to at most b(G) elements of B. Second, a basis B is called a minimum cycle basis (MCB) if its total length Σ BϵB |B| is minimum among all bases of C(G). The lexicographic product GρH has the vertex set V (GρH) = V (G) x V (H) and the edge set E(GρH) = {(u1, v1)(u2, v2)|u1 = u2 and v1 v2 ϵ E(H); or u1u2 ϵ E(G) and there is α ϵ Aut(H) such that α (v1) = v2}. In this work, a construction of a minimum cycle basis for the wreath product of wheels with paths is presented. Also, the length of the longest cycle of a minimum cycle basis is determined. Moreover, the basis number for the wreath product of the same is investigated.

Keywords: cycle space, minimum cycle basis, basis number, wreath product

Procedia PDF Downloads 186
2424 The K-Distance Neighborhood Polynomial of a Graph

Authors: Soner Nandappa D., Ahmed Mohammed Naji


In a graph G = (V, E), the distance from a vertex v to a vertex u is the length of shortest v to u path. The eccentricity e(v) of v is the distance to a farthest vertex from v. The diameter diam(G) is the maximum eccentricity. The k-distance neighborhood of v, for 0 ≤ k ≤ e(v), is Nk(v) = {u ϵ V (G) : d(v, u) = k}. In this paper, we introduce a new distance degree based topological polynomial of a graph G is called a k- distance neighborhood polynomial, denoted Nk(G, x). It is a polynomial with the coefficient of the term k, for 0 ≤ k ≤ e(v), is the sum of the cardinalities of Nk(v) for every v ϵ V (G). Some properties of k- distance neighborhood polynomials are obtained. Exact formulas of the k- distance neighborhood polynomial for some well-known graphs, Cartesian product and join of graphs are presented.

Keywords: vertex degrees, distance in graphs, graph operation, Nk-polynomials

Procedia PDF Downloads 334
2423 Development of Star Tracker for Satellite

Authors: S. Yelubayev, V. Ten, B. Albazarov, E. Sarsenbayev, К. Аlipbayev, A. Shamro, Т. Bopeyev, А. Sukhenko


Currently in Kazakhstan much attention is paid to the development of space branch. Successful launch of two Earth remote sensing satellite is carried out, projects on development of components for satellite are being carried out. In particular, the project on development of star tracker experimental model is completed. In the future it is planned to use this experimental model for development of star tracker prototype. Main stages of star tracker experimental model development are considered in this article.

Keywords: development, prototype, satellite, star tracker

Procedia PDF Downloads 360
2422 Undirected Endo-Cayley Digraphs of Cyclic Groups of Order Primes

Authors: Chanon Promsakon, Sayan Panma


Let S be a finite semigroup, A a subset of S and f an endomorphism on S. The endo-Cayley digraph of a semigroup S corresponding to a connecting set A and an endomorphism f, denoted by endo − Cayf (S, A) is a digraph whose vertex set is S and a vertex u is adjacent to a vertex v if and only if v = f(u)a for some a ∈ A. A digraph D is called undirected if any edge uv in D, there exists an edge vu in D. We consider the undirectedness of an endo-Cayley of a cyclic group of order prime, Zp. In this work, we investigate conditions for connecting sets and endomorphisms to make endo-Cayley digraphs of cyclic groups of order primes be undirected. Moreover, we give some conditions for an undirected endo-Cayley of cycle group of any order.

Keywords: endo-Cayley graph, undirected digraphs, cyclic groups, endomorphism

Procedia PDF Downloads 233
2421 The Correlation between Users’ Star Rating and Usability on Mobile Applications

Authors: Abdulmohsen A. AlBesher, Richard T. Stone


Star rating for mobile applications is a very useful way to differentiate between the best and worst rated applications. However, the question is whether the rating reflects the level of usability or not. The aim of this paper is to find out if the user’ star ratings on mobile apps correlate with the usability of those apps. Thus, we tested three mobile apps, which have different star ratings: low, medium, and high. Participating in the study, 15 mobile phone users were asked to do one single task for each of the three tested apps. After each task, the participant evaluated the app by answering a survey based on the System Usability Scale (SUS). The results found that there is no major correlation between the star rating and the usability. However, it was found that the task completion time and the numbers of errors that may happen while completing the task were significantly correlated to the usability.

Keywords: mobile applications, SUS, star rating, usability

Procedia PDF Downloads 228
2420 Normalized Laplacian Eigenvalues of Graphs

Authors: Shaowei Sun


Let G be a graph with vertex set V(G)={v_1,v_2,...,v_n} and edge set E(G). For any vertex v belong to V(G), let d_v denote the degree of v. The normalized Laplacian matrix of the graph G is the matrix where the non-diagonal (i,j)-th entry is -1/(d_id_j) when vertex i is adjacent to vertex j and 0 when they are not adjacent, and the diagonal (i,i)-th entry is the di. In this paper, we discuss some bounds on the largest and the second smallest normalized Laplacian eigenvalue of trees and graphs. As following, we found some new bounds on the second smallest normalized Laplacian eigenvalue of tree T in terms of graph parameters. Moreover, we use Sage to give some conjectures on the second largest and the third smallest normalized eigenvalues of graph.

Keywords: graph, normalized Laplacian eigenvalues, normalized Laplacian matrix, tree

Procedia PDF Downloads 252
2419 Design and Burnback Analysis of Three Dimensional Modified Star Grain

Authors: Almostafa Abdelaziz, Liang Guozhu, Anwer Elsayed


The determination of grain geometry is an important and critical step in the design of solid propellant rocket motor. In this study, the design process involved parametric geometry modeling in CAD, MATLAB coding of performance prediction and 2D star grain ignition experiment. The 2D star grain burnback achieved by creating new surface via each web increment and calculating geometrical properties at each step. The 2D star grain is further modified to burn as a tapered 3D star grain. Zero dimensional method used to calculate the internal ballistic performance. Experimental and theoretical results were compared in order to validate the performance prediction of the solid rocket motor. The results show that the usage of 3D grain geometry will decrease the pressure inside the combustion chamber and enhance the volumetric loading ratio.

Keywords: burnback analysis, rocket motor, star grain, three dimensional grains

Procedia PDF Downloads 126
2418 Hamiltonian Paths and Cycles Passing through Prescribed Edges in the Balanced Hypercubes

Authors: Dongqin Cheng


The n-dimensional balanced hypercube BHn (n ≥ 1) has been proved to be a bipartite graph. Let P be a set of edges whose induced subgraph consists of pairwise vertex-disjoint paths. For any two vertices u, v from different partite sets of V (BHn). In this paper, we prove that if |P| ≤ 2n − 2 and the subgraph induced by P has neither u nor v as internal vertices, or both of u and v as end-vertices, then BHn contains a Hamiltonian path joining u and v passing through P. As a corollary, if |P| ≤ 2n−1, then the BHn contains a Hamiltonian cycle passing through P.

Keywords: interconnection network, balanced hypercube, Hamiltonian cycle, prescribed edges

Procedia PDF Downloads 123
2417 GPU-Accelerated Triangle Mesh Simplification Using Parallel Vertex Removal

Authors: Thomas Odaker, Dieter Kranzlmueller, Jens Volkert


We present an approach to triangle mesh simplification designed to be executed on the GPU. We use a quadric error metric to calculate an error value for each vertex of the mesh and order all vertices based on this value. This step is followed by the parallel removal of a number of vertices with the lowest calculated error values. To allow for the parallel removal of multiple vertices we use a set of per-vertex boundaries that prevent mesh foldovers even when simplification operations are performed on neighbouring vertices. We execute multiple iterations of the calculation of the vertex errors, ordering of the error values and removal of vertices until either a desired number of vertices remains in the mesh or a minimum error value is reached. This parallel approach is used to speed up the simplification process while maintaining mesh topology and avoiding foldovers at every step of the simplification.

Keywords: computer graphics, half edge collapse, mesh simplification, precomputed simplification, topology preserving

Procedia PDF Downloads 279
2416 Ultra High Performance Concrete Using Special Aggregates for Irregular Structures (the New Concrete Technology)

Authors: Arjun, A. D. Singh


Concrete the basic material using in construction across the global these days. The purpose of this special concrete is to provide extra strength and stability for irregular structure where the center of gravity is disturbed. In this paper an effort has been made to use different type of material aggregates has been discussed. We named As "STAR Aggregates" which has qualities to resist Shear, tension and compression forces. We have been divided into coarse aggregates and fine aggregates according to their sizes. Star Aggregates has interlocking behavior and cutting edge technology. Star aggregates had been draft and deign in Auto CAD and then analysis in ANSYS software. by using special aggregates we deign concrete grade of M40 for mega structures and irregular structure. This special concrete with STAR aggregates use in construction for irregular structure like Bridges, Skyscrapers or in deigned buildings.

Keywords: star aggregates, high performance concrete, material aggregates, interlocking

Procedia PDF Downloads 483
2415 Union-Primes and Immediate Neighbors

Authors: Shai Sarussi


The union of a nonempty chain of prime ideals in a noncommutative ring is not necessarily a prime ideal. An ideal is called union-prime if it is a union of a nonempty chain of prime ideals but is not a prime. In this paper, some relations between chains of prime ideals and the induced chains of union-prime ideals are shown; in particular, the cardinality of such chains and the cardinality of the sets of cuts of such chains are discussed. For a ring R and a nonempty full chain of prime ideals C of R, several characterizations for the property of immediate neighbors in C are given.

Keywords: prime ideals, union-prime ideals, immediate neighbors, Kaplansky's conjecture

Procedia PDF Downloads 63
2414 Improvement a Lower Bound of Energy for Some Family of Graphs, Related to Determinant of Adjacency Matrix

Authors: Saieed Akbari, Yousef Bagheri, Amir Hossein Ghodrati, Sima Saadat Akhtar


Let G be a simple graph with the vertex set V (G) and with the adjacency matrix A (G). The energy E (G) of G is defined to be the sum of the absolute values of all eigenvalues of A (G). Also let n and m be number of edges and vertices of the graph respectively. A regular graph is a graph where each vertex has the same number of neighbours. Given a graph G, its line graph L(G) is a graph such that each vertex of L(G) represents an edge of G; and two vertices of L(G) are adjacent if and only if their corresponding edges share a common endpoint in G. In this paper we show that for every regular graphs and also for every line graphs such that (G) 3 we have, E(G) 2nm + n 1. Also at the other part of the paper we prove that 2 (G) E(G) for an arbitrary graph G.

Keywords: eigenvalues, energy, line graphs, matching number

Procedia PDF Downloads 120
2413 Control of Doubly Star Induction Motor Using Direct Torque DTC Based To on RST Regulator

Authors: Nadia Akkari


This paper presents the analysis and simulation of the control of double star induction motor, using direct torque control (DTC) based on RST regulator. The DTC is an excellent solution for general- purpose induction drives in very wide range the short sampling time required by the TC schemes makes them suited to a very fast torque and flux controlled drives as well the simplicity of the control algorithm. DTC is inherently a motion sensorless control method. The RST regulator can improve the double star induction motor performance in terms of overshoot, rapidity, cancellation of disturbance, and capacity to maintain a high level of performance. Simulation results indicate that the proposed regulator has better performance responses. The implementation of the DTC applied to a double star induction motor based on RST regulator is validated with simulated results.

Keywords: Direct Torque Control (DTC), Double Star Induction Motor (DSIM), RST Regulator

Procedia PDF Downloads 445
2412 750-Days Photometric and Spectral Variability of the Symbiotic Star CH Cyg

Authors: K. M. Mikailov, R . T. Mammadov


Using the American Association of Variable Star Observers (AAVSO) database of photometric observations, the light curve of the symbiotic star CH Cyg was constructed for 1963-2021. Analysis of the light curve showed that all minima correspond to variations of ~750 days, excluding the period of the outburst of stars. Periodic analysis of the brightness and radial velocities of absorption lines was carried out using the Fourier scargle analysis. The light curves for 1966-1976 and 2000-2005 revealed a period of 750 days, corresponding to the relatively quiet state of the star, and 751 days for the velocities of the absorption lines of the red giant. The radial-velocity curve is ahead of the light curve by 0.30 phases.

Keywords: symbiotic stars, CH Cyg, photometry, radial velocity, period

Procedia PDF Downloads 6
2411 The Evolution of the Simulated and Observed Star Formation Rates of Galaxies for the Past 13 Billion Years

Authors: Antonios Katsianis


I present the evolution of the galaxy Star Formation Rate Function (SFRF), star formation rate-stellar mass relation (SFR-M*) and Cosmic Star Formation Rate Density (CSFRD) of z = 0-8 galaxies employing both the Evolution and Assembly of GaLaxies and their Environments (EAGLE) simulations and a compilation of UV, Ha, radio and IR data. While I present comparisons between the above, I evaluate the effect and importance of supernovae/active galactic nuclei feedback. The relation between the star formation rate and stellar mass of galaxies represents a fundamental constraint on galaxy formation, and has been studied extensively both in observations and cosmological hydrodynamic simulations. However, a tension between the above is reported in the literature. I present the evolution of the SFR-M* relation and demonstrate the inconsistencies between observations that are retrieved using different methods. I employ cosmological hydrodynamic simulations combined with radiative transfer methods and compare these with a range of observed data in order to investigate further the root of this tension. Last, I present insights about the scatter of the SFR-M* relation and investigate which mechanisms (e.g. feedback) drive its shape and evolution.

Keywords: cosmological simulations, galaxy formation and evolution, star formation rate, stellar masses

Procedia PDF Downloads 65
2410 Passive Control of Elliptic Jet by Using Triangular and Truncated Tabs

Authors: Saif Akram, E. Rathakrishnan


The mixing promoting efficiency of two identical sharp and truncated vertex triangular tabs offering geometrical blockage of 2.5% each, placed at the exit of a Mach 1.5 elliptic nozzle was studied experimentally. The effectiveness of both the tabs in enhancing the mixing of jets with the ambient air are determined by measuring the Pitot pressure along the jet axis and the jet spread in both the minor and major axes of the elliptic nozzle, covering marginally overexpanded to moderately underexpanded levels at the nozzle exit. The results reveal that both the tabs enhance mixing characteristics of the uncontrolled elliptic jet when placed at minor axis. A core length reduction of 67% is achieved at NPR 3 which is the overexpanded state. Similarly, the core length is reduced by about 67%, 50% and 57% at NPRs of 4, 5 and 6 (underexpanded states) respectively. However, unlike the considerable increment in mixing promoting efficiency by the use of truncated vertex tabs for axisymmetric jets, the effect is not much pronounced for the case of supersonic elliptic jets. The CPD plots for both the cases almost overlap, especially when tabs are placed at minor axis, at all the pressure conditions. While, when the tabs are used at major axis, in the case of overexpanded condition, the sharp vertex triangular tabs act as a better mixing enhancer for the supersonic elliptic jets. For the jet controlled with truncated vertex triangular tabs, the core length reductions are of the same order as those for the sharp vertex triangular tabs. The jet mixing is hardly influenced by the tip effect in case of supersonic elliptic jet.

Keywords: elliptic jet, tabs, truncated, triangular

Procedia PDF Downloads 320
2409 Identifying Coloring in Graphs with Twins

Authors: Souad Slimani, Sylvain Gravier, Simon Schmidt


Recently, several vertex identifying notions were introduced (identifying coloring, lid-coloring,...); these notions were inspired by identifying codes. All of them, as well as original identifying code, is based on separating two vertices according to some conditions on their closed neighborhood. Therefore, twins can not be identified. So most of known results focus on twin-free graph. Here, we show how twins can modify optimal value of vertex-identifying parameters for identifying coloring and locally identifying coloring.

Keywords: identifying coloring, locally identifying coloring, twins, separating

Procedia PDF Downloads 68
2408 The Concept and Practice of Good Governance in the European Union

Authors: Robert Grzeszczak


The article deals with one of the most significant issues concerning the functioning of the public sector in the European Union. The objectives of good governance were formulated by the EU itself and also the Scholars in reaction to the discussion that started a decade ago and concerned the role of the government in 21st century, the future of integration processes and globalization challenges in Europe. Currently, the concept of good governance is mainly associated with the improvement of management of public policies in the European Union, concerning both domestic and EU policies. However, it goes beyond the issues of state capacity and effectiveness of management. Good governance relates also to societal participation in the public administration and verification of decisions made in public authorities’ (including public administration). Indirectly, the concept and practice of good governance are connected to societal legitimisation of public bodies in the European Union.

Keywords: good governance, government, European law, European Union

Procedia PDF Downloads 465
2407 Reliability-Based Life-Cycle Cost Model for Engineering Systems

Authors: Reza Lotfalian, Sudarshan Martins, Peter Radziszewski


The effect of reliability on life-cycle cost, including initial and maintenance cost of a system is studied. The failure probability of a component is used to calculate the average maintenance cost during the operation cycle of the component. The standard deviation of the life-cycle cost is also calculated as an error measure for the average life-cycle cost. As a numerical example, the model is used to study the average life cycle cost of an electric motor.

Keywords: initial cost, life-cycle cost, maintenance cost, reliability

Procedia PDF Downloads 438
2406 Benefits of Polish Accession to the European Union for Air Transport

Authors: D. Tloczynski


The main aim of this article is to present a balance of the decade of Polish air transport market in the European Union having taking into account selected entities of the aviation market. This article analyzes the functioning of the Polish air transport market after the Polish accession to the European Union. During the study two main areas were pointed: shipping activity and activity of the airports. The most important benefits of integration and the benefits of introducing of the open sky policy were indicated. The last part of the article presents the perspectives of development of air traffic.

Keywords: air transport, airports, development air transport, European Union, Poland

Procedia PDF Downloads 373
2405 Fault Tolerant (n,k)-star Power Network Topology for Multi-Agent Communication in Automated Power Distribution Systems

Authors: Ning Gong, Michael Korostelev, Qiangguo Ren, Li Bai, Saroj K. Biswas, Frank Ferrese


This paper investigates the joint effect of the interconnected (n,k)-star network topology and Multi-Agent automated control on restoration and reconfiguration of power systems. With the increasing trend in development in Multi-Agent control technologies applied to power system reconfiguration in presence of faulty components or nodes. Fault tolerance is becoming an important challenge in the design processes of the distributed power system topology. Since the reconfiguration of a power system is performed by agent communication, the (n,k)-star interconnected network topology is studied and modeled in this paper to optimize the process of power reconfiguration. In this paper, we discuss the recently proposed (n,k)-star topology and examine its properties and advantages as compared to the traditional multi-bus power topologies. We design and simulate the topology model for distributed power system test cases. A related lemma based on the fault tolerance and conditional diagnosability properties is presented and proved both theoretically and practically. The conclusion is reached that (n,k)-star topology model has measurable advantages compared to standard bus power systems while exhibiting fault tolerance properties in power restoration, as well as showing efficiency when applied to power system route discovery.

Keywords: (n, k)-star topology, fault tolerance, conditional diagnosability, multi-agent system, automated power system

Procedia PDF Downloads 437
2404 Fault Tolerant (n, k)-Star Power Network Topology for Multi-Agent Communication in Automated Power Distribution Systems

Authors: Ning Gong, Michael Korostelev, Qiangguo Ren, Li Bai, Saroj Biswas, Frank Ferrese


This paper investigates the joint effect of the interconnected (n,k)-star network topology and Multi-Agent automated control on restoration and reconfiguration of power systems. With the increasing trend in development in Multi-Agent control technologies applied to power system reconfiguration in presence of faulty components or nodes. Fault tolerance is becoming an important challenge in the design processes of the distributed power system topology. Since the reconfiguration of a power system is performed by agent communication, the (n,k)-star interconnected network topology is studied and modeled in this paper to optimize the process of power reconfiguration. In this paper, we discuss the recently proposed (n,k)-star topology and examine its properties and advantages as compared to the traditional multi-bus power topologies. We design and simulate the topology model for distributed power system test cases. A related lemma based on the fault tolerance and conditional diagnosability properties is presented and proved both theoretically and practically. The conclusion is reached that (n,k)-star topology model has measurable advantages compared to standard bus power systems while exhibiting fault tolerance properties in power restoration, as well as showing efficiency when applied to power system route discovery.

Keywords: (n, k)-star topology, fault tolerance, conditional diagnosability, multi-agent system, automated power system

Procedia PDF Downloads 363
2403 Management Opposition, Strikes, and Union Threats

Authors: Patrick Nüß


I estimate management opposition against unions in terms of hiring discrimination by a large scale field experiment in the German labor market. The results show that callback rates for union members decrease significantly in the presence of high sectoral union density and large firm size. I further explore how this effect varies with regional and sectoral labor dispute intensity and find that management opposition is stronger when a sector is exposed to an intense labor dispute. There is evidence that the observed management opposition can be explained by sectoral union threat effects. Sectors with lower hiring discrimination have lower coverage of collective agreements, and in the absence of a collective agreement, they are less likely to follow the collective agreement wage setting.

Keywords: trade unions, Industrial relations, management opposition, union threat, labor disputes, field experiments

Procedia PDF Downloads 105
2402 Applying Different Working Fluids in a Combined Power and Ejector Refrigeration Cycle with Low Temperature Heat Sources

Authors: Samad Jafarmadar, Amin Habibzadeh


A power and cooling cycle, which combines the organic Rankine cycle and the ejector refrigeration cycle supplied by waste heat energy sources, is discussed in this paper. 13 working fluids including wet, dry, and isentropic fluids are studied in order to find their performances on the combined cycle. Various operating conditions’ effects on the proposed cycle are examined by fixing power/refrigeration ratio. According to the results, dry and isentropic fluids have better performance compared with wet fluids.

Keywords: combined power and refrigeration cycle, low temperature heat sources, organic rankine cycle, working fluids

Procedia PDF Downloads 184
2401 The European Union: Considering Its Alleged Endangerment

Authors: Jesús Ulloa


The creation, rise, and consolidation of far right-wing, ultranationalist, and eurosceptic parties in Europe after the Second World War pose a real threat towards the disintegration of the European Union. Starting more than thirty years ago with Jean-Marie Le Pen's FN and Margaret Thatcher's policies, to Marine Le Pen's current FN and anti-immigration proposals along with Nigel Farage's UKIP and their intentions to leave the European Union, the progress of right-wing parties should be noted, taking into account that they may have very important differences within their postures but that they also reach common ground in certain areas. The actual disintegration of the EU would represent an enormous failure of the new liberal world order. Through this essay, the roots of this political parties will be analyzed and the conclusion of whether the disintegration may become a reality or if the principles of cooperation and unity will prevail will be answered.

Keywords: eurosceptic, ultarnationalist, right-wing, European Union

Procedia PDF Downloads 512