Search results for: extremal graphs

Authors: Krishnendra Shekhawat

Abstract:

Given a graph G = (V, E), a rectangular dual of G represents the vertices of G by a set of interior-disjoint rectangles such that two rectangles touch if and only if there is an edge between the two corresponding vertices in G. Rectangular duals do not exist for every graph, so we can define maximal rectangular duals. A maximal rectangular dual is a rectangular dual of a graph G such that there exists no graph G ′ with a rectangular dual where G is a subgraph of G ′. In this paper, we enumerate all maximal rectangular duals (or, to be precise, the corresponding planar graphs) up to six nodes and presents a necessary condition for the existence of a rectangular dual. This work allegedly has applications in integrated circuit design and architectural floor plans.

Keywords: adjacency, degree sequence, dual graph, rectangular dual

Procedia PDF Downloads 266

Authors: Prateek Chharia, Biswa Bhusan Ghosh

Abstract:

Graph coloring is one of the prominent concepts in graph coloring. It can be defined as a coloring of the various regions of the graph such that all the constraints are fulfilled. In this paper various graphs coloring approaches like greedy coloring, Heuristic search for maximum independent set and graph coloring using edge table is described. Graph coloring can be used in various real time applications like student time tabling generation, Sudoku as a graph coloring problem, GSM phone network.

Keywords: graph coloring, greedy coloring, heuristic search, edge table, sudoku as a graph coloring problem

Procedia PDF Downloads 539

Authors: Gowtham Kalkere Jayanna, Mohamad Nazri Husin

Abstract:

Graph theory, chemistry, and technology are all combined in cheminformatics. The structure and physiochemical properties of organic substances are linked using some useful graph invariants and the corresponding molecular graph. In this paper, we study specific reverse topological indices such as the reverse sum-connectivity index, the reverse Zagreb index, the reverse arithmetic-geometric, and the geometric-arithmetic, the reverse Sombor, the reverse Nirmala indices for the bistar graphs B (n: m) and the corona product Kₘ∘Kₙ', where Kₙ' Represent the complement of a complete graph Kₙ.

Keywords: reverse topological indices, bistar graph, the corona product, graph

Procedia PDF Downloads 97

Authors: Mario Lupaca, Karol Munoz, Victor De Negri

Abstract:

The present article presents a methodology for the improvement of the energy efficiency in pneumatic systems through the restoring of air. In this way, three techniques of expansion of a cylinder are identified: Expansion using the air of the compressor (conventional), restoring the air (efficient), and combining the air of the compressor and the restored air (hybrid). The methodology starts with the development of the GRAFCET of the system so that it can be decided whether to expand the cylinder in a conventional, efficient, or hybrid way. The methodology can be applied to any case. Finally, graphs of comparison between the three methods of expansion with certain cylinder strokes and workloads are presented, to facilitate the subsequent selection of one system or another.

Keywords: energetic, efficiency, GRAFCET, methodology, pneumatic

Procedia PDF Downloads 311

Authors: Shaan Khosla, Jon Krohn

Abstract:

In a recruiting context, machine learning models are valuable for recommendations: to predict the best candidates for a vacancy, to match the best vacancies for a candidate, and compile a set of similar candidates for any given candidate. While useful to create these models, validating their accuracy in a recommendation context is difficult due to a sparsity of data. In this report, we use network graph data to generate useful representations for candidates and vacancies. We use candidates and vacancies as network nodes and designate a bi-directional link between them based on the candidate interviewing for the vacancy. After using node2vec, the embeddings are used to construct a validation dataset with a ranked order, which will help validate new recommender systems.

Keywords: AI, machine learning, NLP, recruiting

Procedia PDF Downloads 84

Authors: Natasha Sharma, Kulbhushan Agnihotri

Abstract:

Cellular Automata are discrete dynamical systems which are based on local character and spatial disparateness of the spreading process. These factors are generally neglected by traditional models based on differential equations for epidemic spread. The aim of this work is to introduce an SEIR model based on cellular automata on graphs to imitate epidemic spreading. Distinctively, it is an SEIR-type model where the population is divided into susceptible, exposed, infected and recovered individuals. The results obtained from simulations are in accordance with the spreading behavior of a real time epidemics.

Keywords: cellular automata, epidemic spread, graph, susceptible

Procedia PDF Downloads 459

Authors: D. Satish Kumar, T. K. V. Iyengar

Abstract:

In this paper, we study the Brinkman flow, under Stokesian assumption, past an impervious prolate spheroid and obtain the expressions for the velocity and pressure fields in terms of Legendre functions, Associated Legendre functions, prolate radial and angular spheroidal wave functions. We further obtain an expression for the drag experienced by the spheroid and numerically study its variation with respect to the flow parameters and display the results through graphs.

Keywords: prolate spheoid, porous medium, stokesian assumption, brinkman model, velocity, pressure, drag

Procedia PDF Downloads 536

Authors: Mojgan Zendehdel, Safura Molla Mohammad Zamani

Abstract:

In this paper, Fe3O4/NaY zeolite nanocomposite with different molar ratio were successfully synthesized and characterized using FT-IR, XRD, TGA, SEM and VSM techniques. The SEM graphs showed that much of Fe3O4 was successfully coated by the NaY zeolite layer. Also, the results show that the magnetism of the products is stable with added zeolite. The catalytic effect of nanocomposite investigated for esterification reaction under solvent-free conditions. Hence, the effect of the catalyst amount, reaction time, reaction temperature and reusability of catalyst were considered and nanocomposite that created from zeolite and 16.6 percent of Fe3O4 showed the highest yield. The catalyst can be easily separated from reaction with the magnet and it can also be used for several times.

Keywords: zeolite, magnetic, nanocompsite, esterification

Procedia PDF Downloads 461

Authors: Xianwei Zheng, Yuan Yan Tang

Abstract:

Classical window Fourier transform has been widely used in signal processing, image processing, machine learning and pattern recognition. The related Gabor transform is powerful enough to capture the texture information of any given dataset. Recently, in the emerging field of graph signal processing, researchers devoting themselves to develop a graph signal processing theory to handle the so-called graph signals. Among the new developing theory, windowed graph Fourier transform has been constructed to establish a time-frequency analysis framework of graph signals. The windowed graph Fourier transform is defined by using the translation and modulation operators of graph signals, following the similar calculations in classical windowed Fourier transform. Specifically, the translation and modulation operators of graph signals are defined by using the Laplacian eigenvectors as follows. For a given graph signal, its translation is defined by a similar manner as its definition in classical signal processing. Specifically, the translation operator can be defined by using the Fourier atoms; the graph signal translation is defined similarly by using the Laplacian eigenvectors. The modulation of the graph can also be established by using the Laplacian eigenvectors. The windowed graph Fourier transform based on these two operators has been applied to obtain time-frequency representations of graph signals. Fundamentally, the modulation operator is defined similarly to the classical modulation by multiplying a graph signal with the entries in each Fourier atom. However, a single Laplacian eigenvector entry cannot play a similar role as the Fourier atom. This definition ignored the relationship between the translation and modulation operators. In this paper, a new definition of the modulation operator is proposed and thus another time-frequency framework for graph signal is constructed. Specifically, the relationship between the translation and modulation operations can be established by the Fourier transform. Specifically, for any signal, the Fourier transform of its translation is the modulation of its Fourier transform. Thus, the modulation of any signal can be defined as the inverse Fourier transform of the translation of its Fourier transform. Therefore, similarly, the graph modulation of any graph signal can be defined as the inverse graph Fourier transform of the translation of its graph Fourier. The novel definition of the graph modulation operator established a relationship of the translation and modulation operations. The new modulation operation and the original translation operation are applied to construct a new framework of graph signal time-frequency analysis. Furthermore, a windowed graph Fourier frame theory is developed. Necessary and sufficient conditions for constructing windowed graph Fourier frames, tight frames and dual frames are presented in this paper. The novel graph signal time-frequency analysis framework is applied to signals defined on well-known graphs, e.g. Minnesota road graph and random graphs. Experimental results show that the novel framework captures new features of graph signals.

Keywords: graph signals, windowed graph Fourier transform, windowed graph Fourier frames, vertex frequency analysis

Procedia PDF Downloads 341

Authors: Y. Sunita Rani, Y. Hari Krishna, M. V. Ramana Murthy, K. Sudhaker Reddy

Abstract:

This article studied effects of radiation and chemical reaction on MHD casson fluoid flow past a Permeable Stretching Sheet in a Porous Medium. Suitable transformations are considered to transform the governing partial differential equations as ordinary ones and then solved by the numerical procedures like Runge- Kutta – Fehlberg shooting technique method. The effects of various governing parameters, on the velocity, temperature and concentration are displayed through graphs and discussed numerically.

Keywords: MHD, Casson fluid, porous medium, permeable stretching sheet

Procedia PDF Downloads 127

Authors: Seyed Habib A. Rahmati, Mohamad Hasan Sadeghpour, Parsa Fallah Sheikhlari

Abstract:

Location quotient (LQ) is a comparison technique that represents emphasized economic structure of single zone versus the standard area to identify specialty for every zone. In another words, the exact calculation of this metric can show the main core competencies and critical capabilities of an area to the decision makers. This research focus on the exact calculation of the LQ for an Iranian Province called Qazvin and within a case study introduces LQ of the capable industries of Qazvin. Finally, through different graphs and tables, it creates an opportunity to compare the recognized capabilities.

Keywords: location quotient, case study, province analysis, core competency

Procedia PDF Downloads 655

Authors: Ladznar S. Laja, Rosalio G. Artes, Jr.

Abstract:

This paper introduced a graph polynomial relating convexity concepts. A graph polynomial is a polynomial representing a graph given some parameters. On the other hand, a subgraph H of a graph G is said to be convex in G if for every pair of vertices in H, every shortest path with these end-vertices lies entirely in H. We define the convex subgraph polynomial of a graph G to be the generating function of the sequence of the numbers of convex subgraphs of G of cardinalities ranging from zero to the order of G. This graph polynomial is monic since G itself is convex. The convex index which counts the number of convex subgraphs of G of all orders is just the evaluation of this polynomial at 1. Relationships relating algebraic properties of convex subgraphs polynomial with graph theoretic concepts are established.

Keywords: convex subgraph, convex index, generating function, polynomial ring

Procedia PDF Downloads 215

Authors: Sawsen Khlifa, Chiheb AMeur Abid, Belhassan Zouari

Abstract:

Modular verification approaches have been widely attempted to cope with the well known state explosion problem. This paper deals with the modular verification of modular Petri nets. We propose a reduced version for the modular state space of a given modular Petri net. The new structure allows the creation of smaller modular graphs. Each one draws the behavior of the corresponding module and outlines some global information. Hence, this version helps to overcome the explosion problem and to use less memory space. In this condensed structure, the verification of some generic properties concerning one module is limited to the exploration of its associated graph.

Keywords: distributed systems, modular verification, petri nets, state space explosition

Procedia PDF Downloads 115

Authors: Sumaira Saleem

Abstract:

This study reveals that the use of SMS effect the formal writing of the students. SMS is in vogue sine the last decade but its detrimental effects are effecting not only to the set norms but also deviant forms of expressions have come into the community to which all are not acquainted and it creates a hurdle in effective communication. It also determines the reasons behind the usage of SMS practices in the formal writings like in assignments and examinations. For this study a questionnaire was designed for faculty and students the data was collected from The Islamia University Bahawalpur and the formal work of the students was also collected to check the manifestation of SMS practices in writings. Data was analysed on excel sheet and the tables and graphs are used to explain the ratios and percentages of SMS usage. The results show that the usage of SMS has very strong effect upon the students writing.

Keywords: technology, writing, effects, SMS

Procedia PDF Downloads 380

Authors: Noureddine Henka, Sami Tazi, Mohamad Assaad

Abstract:

The electrical grid is a highly intricate system designed to transfer electricity from production areas to consumption areas. The Transmission System Operator (TSO) is responsible for ensuring the efficient distribution of electricity and maintaining the grid's safety and quality. However, due to the increasing integration of intermittent renewable energy sources, there is a growing level of uncertainty, which requires a faster responsive approach. A potential solution involves the use of electrical segmentation, which involves creating coherence zones where electrical disturbances mainly remain within the zone. Indeed, by means of coherent electrical zones, it becomes possible to focus solely on the sub-zone, reducing the range of possibilities and aiding in managing uncertainty. It allows faster execution of operational processes and easier learning for supervised machine learning algorithms. Electrical segmentation can be applied to various applications, such as electrical control, minimizing electrical loss, and ensuring voltage stability. Since the electrical grid can be modeled as a graph, where the vertices represent electrical buses and the edges represent electrical lines, identifying coherent electrical zones can be seen as a clustering task on graphs, generally called community detection. Nevertheless, a critical criterion for the zones is their ability to remain resilient to the electrical evolution of the grid over time. This evolution is due to the constant changes in electricity generation and consumption, which are reflected in graph structure variations as well as line flow changes. One approach to creating a resilient segmentation is to design robust zones under various circumstances. This issue can be represented through a multiplex graph, where each layer represents a specific situation that may arise on the grid. Consequently, resilient segmentation can be achieved by conducting community detection on this multiplex graph. The multiplex graph is composed of multiple graphs, and all the layers share the same set of vertices. Our proposal involves a model that utilizes a unified representation to compute a flattening of all layers. This unified situation can be penalized to obtain (K) connected components representing the robust electrical segmentation clusters. We compare our robust segmentation to the segmentation based on a single reference situation. The robust segmentation proves its relevance by producing clusters with high intra-electrical perturbation and low variance of electrical perturbation. We saw through the experiences when robust electrical segmentation has a benefit and in which context.

Keywords: community detection, electrical segmentation, multiplex graph, power grid

Procedia PDF Downloads 79

Authors: Hani Alkayed, Belal Omar, Eileen Roddy

Abstract:

This study focuses on investigating the determinants of Corporate Social Responsibility Disclosure (CSRD) extent and quality in Jordan. The study examines factors that influence CSR disclosure extent and quality, such as corporate characteristics (size, gearing, firm’s age, and industry type), corporate governance (board size, number of meetings, non-executive directors, female directors in the board, family directors in the board, foreign members, audit committee, type of external auditors, and CEO duality) and ownership structure (government ownership, institutional ownership, and ownership concentration). Legitimacy theory is utilised as the main theory for our theoretical framework. A quantitative approach is adopted for this research and content analysis technique is used to gather CSR disclosure extent and quality from the annual reports. The sample is withdrawn from the annual reports of 118 Jordanian companies over the period of 2010-2015. A CSRD index is constructed, and includes the disclosures of the following categories; environmental, human resources, product and consumers, and community involvement. A 7 point-scale measurement was developed to examine the quality of disclosure, were 0= No Disclosures, 1= General disclosures, (Non-monetary), 2= General disclosures, (Non-monetary) with pictures, charts, and graphs 3= Descriptive/ qualitative disclosures, specific details (Non-monetary), 4= Descriptive/ qualitative disclosures, specific details with pictures, charts, and graphs, 5= Numeric disclosures, full descriptions with supporting numbers, 6= Numeric disclosures, full descriptions with supporting numbers, pictures, and Charts. This study fills the gap in the literature regarding CSRD in Jordan, and the fact that all the previous studies have ignored a clear categorisation as a measurement of quality. The result shows that the extent of CSRD is higher than the quality in Jordan. Regarding the determinants of CSR disclosures, the followings were found to have a significant relationship with both extent and quality of CSRD except non-executives, were the significant relationship was found just with the extent of CSRD: board size, non-executive directors, firm’s age, foreign members on the board, number of boards meetings, the presence of audit committees, big 4, government ownership, firm’s size, industry type.

Keywords: content analysis, corporate governance, corporate social responsibility disclosure, Jordan, quality of disclosure

Procedia PDF Downloads 230

Authors: Neil M. Mame

Abstract:

We consider only finite graphs without loops nor multiple edges. Let G be a graph with E(G) = {e1, e2, …., em}. The edge space of G, denoted by ε(G), is a vector space over the field Z2. The elements of ε(G) are all the subsets of E(G). Vector addition is defined as X+Y = X Δ Y, the symmetric difference of sets X and Y, for X, Y ∈ ε(G). Scalar multiplication is defined as 1.X =X and 0.X = Ø for X ∈ ε(G). The set S ⊆ ε(G) is called a generating set if every element ε(G) is a linear combination of the elements of S. For a non-empty set X ∈ ε(G), the smallest subgraph with edge set X is called edge-induced subgraph of G, denoted by G[X]. The set EH(G) = { A ∈ ε(G) : G[A] ≅ H } denotes the uniform set of H with respect to G and εH(G) denotes the subspace of ε(G) generated by EH(G). If εH(G) is generating set, then we call H a generator subgraph of G. This paper gives the characterization for the generator subgraphs of the wheel that contain cycles and gives the necessary conditions for the acyclic generator subgraphs of the wheel.

Keywords: edge space, edge-induced subgraph, generator subgraph, wheel

Procedia PDF Downloads 464

Authors: Arun Prabhakar

Abstract:

Threat modeling is an important activity carried out in the initial stages of the development lifecycle that helps in building proactive security measures in the product. Though there are many techniques and tools available today, one of the common challenges with the traditional methods is the lack of a systematic approach in identifying security threats. The proposed solution describes an organized model by defining ontologies that help in building patterns to enumerate threats. The concepts of graph theory are applied to build the pattern for discovering threats for any given scenario. This graph-based solution also brings in other benefits, making it a customizable and scalable model.

Keywords: directed acyclic graph, ontology, patterns, threat identification, threat modeling

Procedia PDF Downloads 139

Authors: Pooja Sharma

Abstract:

In the present paper the effects of radiation is studied on unsteady flow of viscous incompressible electrically conducting fluid past a vertical porous plate embedded in the porous medium in the presence of constant heat flux. A uniform Transverse Magnetic field is considered and induced magnetic field is supposed as negligible. The non-linear governing equations are solved numerically. Numerical results of the velocity and temperature fields are shown through graphs. The results illustrates that the appropriator combination of regulated values of thermo-physical parameters is expedient for controlling the flow system.

Keywords: heat transfer, radiation, MHD flow, porous medium

Procedia PDF Downloads 440

Authors: Ramanpreet Kaur, Upasana Sharma

Abstract:

The purpose of this paper is to address the challenges faced by MLDB system at the piston foundry plant due to interruption in supply of water. For the MLDB system to work in Model, two sub-units must be connected to the robotic main unit. The system cannot function without robotics and water supply by the fan (WSF). Insufficient water supply is the cause of system failure. The system operates at top performance using two sub-units. If one sub-unit fails, the system capacity is reduced. Priority of repair is given to the main unit i.e. Robotic and WSF. To solve the problem, semi-Markov process and regenerative point technique are used. Relevant graphs are also included to particular case.

Keywords: MLDB system, robotic, semi-Markov process, regenerative point technique

Procedia PDF Downloads 77

Authors: Raj Nandkeolyar, Precious Sibanda

Abstract:

The flow of a viscous, incompressible, and electrically conducting fluid under the influence of aligned magnetic field acting along the direction of fluid flow over an exponentially stretching sheet is investigated numerically. The nonlinear partial differential equations governing the flow model is transformed to a set of nonlinear ordinary differential equations using suitable similarity transformation and the solution is obtained using a local linearization method followed by the Chebyshev spectral collocation method. The effects of various parameters affecting the flow and heat transfer as well as the induced magnetic field are discussed using suitable graphs and tables.

Keywords: aligned magnetic field, exponentially stretching sheet, induced magnetic field, magnetohydrodynamic flow

Procedia PDF Downloads 454

Authors: Şafak Aksoy, Ali Kurşun, Erhan Çetin, Mustafa Reşit Haboğlu

Abstract:

In this study, thermo elastic stress analysis is performed on a cylinder made of laminated isotropic materials under thermomechanical loads. Laminated cylinders have many applications such as aerospace, automotive and nuclear plant in the industry. These cylinders generally performed under thermomechanical loads. Stress and displacement distribution of the laminated cylinders are determined using by analytical method both thermal and mechanical loads. Based on the results, materials combination plays an important role on the stresses distribution along the radius. Variation of the stresses and displacements along the radius are presented as graphs. Calculations program are prepared using MATLAB® by authors.

Keywords: isotropic materials, laminated cylinders, thermoelastic stress, thermomechanical load

Procedia PDF Downloads 413

Authors: Shin-Shin Kao, Hsiu-Chunj Pan

Abstract:

Given a graph G. A cycle of G is a sequence of vertices of G such that the first and the last vertices are the same. A hamiltonian cycle of G is a cycle containing all vertices of G. The graph G is k-ordered (resp. k-ordered hamiltonian) if for any sequence of k distinct vertices of G, there exists a cycle (resp. hamiltonian cycle) in G containing these k vertices in the specified order. Obviously, any cycle in a graph is 1-ordered, 2-ordered and 3-ordered. Thus the study of any graph being k-ordered (resp. k-ordered hamiltonian) always starts with k = 4. Most studies about this topic work on graphs with no real applications. To our knowledge, the chordal ring families were the first one utilized as the underlying topology in interconnection networks and shown to be 4-ordered [1]. Furthermore, based on computer experimental results in [1], it was conjectured that some of them are 4-ordered hamiltonian. In this paper, we intend to give some possible directions in proving the conjecture.

Keywords: Hamiltonian cycle, 4-ordered, Chordal rings, 3-regular

Procedia PDF Downloads 434

Authors: Francesca Schiavello

Abstract:

This work aims to create a hybrid algorithm, combining Quantum Approximate Optimization Algorithm (QAOA) with an Evolutionary Algorithm (EA) in the place of traditional gradient based optimization processes. QAOA’s were first introduced in 2014, where, at the time, their algorithm performed better than the traditional best known classical algorithm for Max-cut graphs. Whilst classical algorithms have improved since then and have returned to being faster and more efficient, this was a huge milestone for quantum computing, and their work is often used as a benchmarking tool and a foundational tool to explore variants of QAOA’s. This, alongside with other famous algorithms like Grover’s or Shor’s, highlights to the world the potential that quantum computing holds. It also presents the reality of a real quantum advantage where, if the hardware continues to improve, this could constitute a revolutionary era. Given that the hardware is not there yet, many scientists are working on the software side of things in the hopes of future progress. Some of the major limitations holding back quantum computing are the quality of qubits and the noisy interference they generate in creating solutions, the barren plateaus that effectively hinder the optimization search in the latent space, and the availability of number of qubits limiting the scale of the problem that can be solved. These three issues are intertwined and are part of the motivation for using EAs in this work. Firstly, EAs are not based on gradient or linear optimization methods for the search in the latent space, and because of their freedom from gradients, they should suffer less from barren plateaus. Secondly, given that this algorithm performs a search in the solution space through a population of solutions, it can also be parallelized to speed up the search and optimization problem. The evaluation of the cost function, like in many other algorithms, is notoriously slow, and the ability to parallelize it can drastically improve the competitiveness of QAOA’s with respect to purely classical algorithms. Thirdly, because of the nature and structure of EA’s, solutions can be carried forward in time, making them more robust to noise and uncertainty. Preliminary results show that the EA algorithm attached to QAOA can perform on par with the traditional QAOA with a Cobyla optimizer, which is a linear based method, and in some instances, it can even create a better Max-Cut. Whilst the final objective of the work is to create an algorithm that can consistently beat the original QAOA, or its variants, due to either speedups or quality of the solution, this initial result is promising and show the potential of EAs in this field. Further tests need to be performed on an array of different graphs with the parallelization aspect of the work commencing in October 2023 and tests on real hardware scheduled for early 2024.

Keywords: evolutionary algorithm, max cut, parallel simulation, quantum optimization

Procedia PDF Downloads 60

Authors: M. Y. Malika, Farzana, Abdul Rehman

Abstract:

The study deals with the steady, 3D MHD boundary layer flow of a non-Newtonian Maxwell fluid flow due to a horizontal surface stretched exponentially in two lateral directions. The temperature at the boundary is assumed to be distributed exponentially and possesses convective boundary conditions. The governing nonlinear system of partial differential equations along with associated boundary conditions is simplified using a suitable transformation and the obtained set of ordinary differential equations is solved through numerical techniques. The effects of important involved parameters associated with fluid flow and heat flux are shown through graphs.

Keywords: boundary layer flow, exponentially stretched surface, Maxwell fluid, numerical solution

Procedia PDF Downloads 588

Authors: Amit Gill, Lalith Wijerathne, Sebastian Poledna

Abstract:

This research presents the details of the implementation of high performance computing (HPC) extension of agent-based economic models (ABEMs) to simulate hundreds of millions of heterogeneous agents. ABEMs offer an alternative approach to study the economy as a dynamic system of interacting heterogeneous agents, and are gaining popularity as an alternative to standard economic models. Over the last decade, ABEMs have been increasingly applied to study various problems related to monetary policy, bank regulations, etc. When it comes to predicting the effects of local economic disruptions, like major disasters, changes in policies, exogenous shocks, etc., on the economy of the country or the region, it is pertinent to study how the disruptions cascade through every single economic entity affecting its decisions and interactions, and eventually affect the economic macro parameters. However, such simulations with hundreds of millions of agents are hindered by the lack of HPC enhanced ABEMs. In order to address this, a scalable Distributed Memory Parallel (DMP) implementation of ABEMs has been developed using message passing interface (MPI). A balanced distribution of computational load among MPI-processes (i.e. CPU cores) of computer clusters while taking all the interactions among agents into account is a major challenge for scalable DMP implementations. Economic agents interact on several random graphs, some of which are centralized (e.g. credit networks, etc.) whereas others are dense with random links (e.g. consumption markets, etc.). The agents are partitioned into mutually-exclusive subsets based on a representative employer-employee interaction graph, while the remaining graphs are made available at a minimum communication cost. To minimize the number of communications among MPI processes, real-life solutions like the introduction of recruitment agencies, sales outlets, local banks, and local branches of government in each MPI-process, are adopted. Efficient communication among MPI-processes is achieved by combining MPI derived data types with the new features of the latest MPI functions. Most of the communications are overlapped with computations, thereby significantly reducing the communication overhead. The current implementation is capable of simulating a small open economy. As an example, a single time step of a 1:1 scale model of Austria (i.e. about 9 million inhabitants and 600,000 businesses) can be simulated in 15 seconds. The implementation is further being enhanced to simulate 1:1 model of Euro-zone (i.e. 322 million agents).

Keywords: agent-based economic model, high performance computing, MPI-communication, MPI-process

Procedia PDF Downloads 127

Authors: Alireza Abbasi Moshaii, Shaghayegh Nasiri, Mehdi Tale Masouleh

Abstract:

The main purpose of this study is static analysis of two three-degree of freedom parallel mechanisms: 3-RCC and 3-RRS. Geometry of these mechanisms is expressed and static equilibrium equations are derived for the whole chains. For these mechanisms due to the equal number of equations and unknowns, the solution is as same as 3-RCC mechanism. Mathematical software is used to solve the equations. In order to prove the results obtained from solving the equations of mechanisms, their CAD model has been simulated and their static is analysed in ADAMS software. Due to symmetrical geometry of the mechanisms, the force and external torque acting on the end-effecter have been considered asymmetric to prove the generality of the solution method. Finally, the results of both softwares, for both mechanisms are extracted and compared as graphs. The good achieved comparison between the results indicates the accuracy of the analysis.

Keywords: robotic, static analysis, 3-RCC, 3-RRS

Procedia PDF Downloads 384

Authors: Y. M. Aiyesimi, G. T. Okedayo, O. W. Lawal

Abstract:

An investigation is made for unsteady MHD thin film flow of a third grade fluid down an inclined plane with slip boundary condition. The non-linear partial differential equation governing the flow and heat transfer are evaluated numerically using computer software called Maple to obtain velocity and temperature profile. The effect of slip and other various physical parameter on both velocity and temperature profile obtained are studied through several graphs.

Keywords: non-Newtonian fluid, MHD flow, third-grade fluid, Maple, slip boundary condition, heat transfer

Procedia PDF Downloads 455

Authors: Ali Mustafa Elshawesh, Mohamed Abdulali

Abstract:

The paper presents an approach to dimension circuit switched networks and find the relationship between the parameters of the circuit switched networks on the condition of specific probability of call blocking. Our work is creating a Simulation code based on Erlang (B) formula to draw graphs which show two curves for each graph; one of simulation and the other of calculated. These curves represent the relationships between average number of calls and average call duration with the probability of call blocking. This simulation code facilitates to select the appropriate parameters for circuit switched networks.

Keywords: Erlang B formula, call blocking, telephone system dimension, Markov model, link capacity

Procedia PDF Downloads 611

Authors: Marcin Szlachetka, Rafal Sochaczewski, Lukasz Grabowski

Abstract:

This paper presents the results of the load simulations of main bearings in a two-stroke Diesel engine. A model of an engine lubrication system with connections of its main lubrication nodes, i.e., a connection of its main bearings in the engine block with the crankshaft, a connection of its crankpins with its connecting rod and a connection of its pin and its piston has been created for our calculations performed using the AVL EXCITE Designer. The analysis covers the loads given as a pressure distribution in a hydrodynamic oil film, a temperature distribution on the main bush surfaces for the specified radial clearance values as well as the impact of the force of gas on the minimum oil film thickness in the main bearings depending on crankshaft rotational speeds and temperatures of oil in the bearings. One of the main goals of the research has been to determine whether the minimum thickness of the oil film at which fluid friction occurs can be achieved for each value of crankshaft speed. Our model calculates different oil film parameters, i.e., its thickness, a pressure distribution there, the change in oil temperature. Additional enables an analysis of an oil temperature distribution on the surfaces of the bearing seats. It allows verifying the selected clearances in the bearings of the main engine under normal operation conditions and extremal ones that show a significant increase in temperature above the limit value. The research has been conducted for several engine crankshaft speeds ranging from 1000 rpm to 4000 rpm. The oil pressure in the bearings has ranged 2-5 bar according to engine speeds and the oil temperature has ranged 90-120 °C. The main bearing clearance has been adopted for the calculation and analysis as 0.025 mm. The oil classified as SAE 5W-30 has been used for the simulations. The paper discusses the selected research results referring to several specific operating points and different temperatures of the lubricating oil in the bearings. The received research results show that for the investigated main bearing bushes of the shaft, the results fall within the ranges of the limit values despite the increase in the oil temperature of the bearings reaching 120˚C. The fact that the bearings are loaded with the maximum pressure makes no excessive temperature rise on the bush surfaces. The oil temperature increases by 17˚C, reaching 137˚C at a speed of 4000 rpm. The minimum film thickness at which fluid friction occurs has been achieved for each of the operating points at each of the engine crankshaft speeds. Acknowledgement: This work has been realized in the cooperation with The Construction Office of WSK ‘PZL-KALISZ’ S.A.’ and is part of Grant Agreement No. POIR.01.02.00-00-0002/15 financed by the Polish National Centre for Research and Development.

Keywords: diesel engine, main bearings, opposing pistons, two-stroke

Procedia PDF Downloads 137