Search results for: fractional edge domination number
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 10748

Search results for: fractional edge domination number

10748 An Algorithm to Find Fractional Edge Domination Number and Upper Fractional Edge Domination Number of an Intuitionistic Fuzzy Graph

Authors: Karunambigai Mevani Govindasamy, Sathishkumar Ayyappan

Abstract:

In this paper, we formulate the algorithm to find out the dominating function parameters of Intuitionistic Fuzzy Graphs(IFG). The methodology we adopted here is converting any physical problem into an IFG, and that has been transformed into Intuitionistic Fuzzy Matrix. Using Linear Program Solver software (LiPS), we found the defined parameters for the given IFG. We obtained these parameters for a path and cycle IFG. This study can be extended to other varieties of IFG. In particular, we obtain the definition of edge dominating function, minimal edge dominating function, fractional edge domination number (γ_if^') and upper fractional edge domination number (Γ_if^') of an intuitionistic fuzzy graph. Also, we formulated an algorithm which is appropriate to work on LiPS to find fractional edge domination number and upper fractional edge domination number of an IFG.

Keywords: fractional edge domination number, intuitionistic fuzzy cycle, intuitionistic fuzzy graph, intuitionistic fuzzy path

Procedia PDF Downloads 136
10747 Introduction to Paired Domination Polynomial of a Graph

Authors: Puttaswamy, Anwar Alwardi, Nayaka S. R.

Abstract:

One of the algebraic representation of a graph is the graph polynomial. In this article, we introduce the paired-domination polynomial of a graph G. The paired-domination polynomial of a graph G of order n is the polynomial Dp(G, x) with the coefficients dp(G, i) where dp(G, i) denotes the number of paired dominating sets of G of cardinality i and γpd(G) denotes the paired-domination number of G. We obtain some properties of Dp(G, x) and its coefficients. Further, we compute this polynomial for some families of standard graphs. Further, we obtain some characterization for some specific graphs.

Keywords: domination polynomial, paired dominating set, paired domination number, paired domination polynomial

Procedia PDF Downloads 195
10746 Introduction to Transversal Pendant Domination in Graphs

Authors: Nayaka S.R., Putta Swamy, Purushothama S.

Abstract:

Let G=(V, E) be a graph. A dominating set S in G is a pendant dominating set if < S > contains a pendant vertex. A pendant dominating set of G which intersects every minimum pendant dominating set in G is called a transversal pendant dominating set. The minimum cardinality of a transversal pendant dominating set is called the transversal pendant domination number of G, denoted by γ_tp(G). In this paper, we begin to study this parameter. We calculate γ_tp(G) for some families of graphs. Furthermore, some bounds and relations with other domination parameters are obtained for γ_tp(G).

Keywords: dominating set, pendant dominating set, pendant domination number, transversal pendant dominating set, transversal pendant domination number

Procedia PDF Downloads 152
10745 Location-Domination on Join of Two Graphs and Their Complements

Authors: Analen Malnegro, Gina Malacas

Abstract:

Dominating sets and related topics have been studied extensively in the past few decades. A dominating set of a graph G is a subset D of V such that every vertex not in D is adjacent to at least one member of D. The domination number γ(G) is the number of vertices in a smallest dominating set for G. Some problems involving detection devices can be modeled with graphs. Finding the minimum number of devices needed according to the type of devices and the necessity of locating the object gives rise to locating-dominating sets. A subset S of vertices of a graph G is called locating-dominating set, LD-set for short, if it is a dominating set and if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. The location-domination number λ(G) is the minimum cardinality of an LD-set for G. The complement of a graph G is a graph Ḡ on same vertices such that two distinct vertices of Ḡ are adjacent if and only if they are not adjacent in G. An LD-set of a graph G is global if it is an LD-set of both G and its complement Ḡ. The global location-domination number λg(G) is defined as the minimum cardinality of a global LD-set of G. In this paper, global LD-sets on the join of two graphs are characterized. Global location-domination numbers of these graphs are also determined.

Keywords: dominating set, global locating-dominating set, global location-domination number, locating-dominating set, location-domination number

Procedia PDF Downloads 154
10744 An investigation of Leading Edge and Trailing Edge Corrugation for Low Reynolds Number Application

Authors: Syed Hassan Raza Shah, Mohammad Mohammad Ali

Abstract:

The flow over a smoothly profiled airfoil at a low Reynolds number is highly susceptible to separate even at a very low angle of attack. An investigation was made to study the effect of leading-edge and trailing-edge corrugation with the spanwise change in the ridges resulted due to the change in the chord length for an infinite wing. The wind tunnel results using NACA0018 wings revealed that leading and trailing edge corrugation did not have any benefit in terms of aerodynamic efficiency or delayed stall. The leading edge and trailing edge corrugation didn't change the lift curve slope, with the leading edge corrugation wing stalling first in the range of Reynolds number of 50,000 to 125,000.

Keywords: leading and trailing edge corrugations, low reynolds number, wind tunnel testing, NACA0018

Procedia PDF Downloads 248
10743 Modified Fractional Curl Operator

Authors: Rawhy Ismail

Abstract:

Applying fractional calculus in the field of electromagnetics shows significant results. The fractionalization of the conventional curl operator leads to having additional solutions to an electromagnetic problem. This work restudies the concept of the fractional curl operator considering fractional time derivatives in Maxwell’s curl equations. In that sense, a general scheme for the wave loss term is introduced and the degree of freedom of the system is affected through imposing the new fractional parameters. The conventional case is recovered by setting all fractional derivatives to unity.

Keywords: curl operator, fractional calculus, fractional curl operators, Maxwell equations

Procedia PDF Downloads 451
10742 Numerical Solutions of Fractional Order Epidemic Model

Authors: Sadia Arshad, Ayesha Sohail, Sana Javed, Khadija Maqbool, Salma Kanwal

Abstract:

The dynamical study of the carriers play an essential role in the evolution and global transmission of infectious diseases and will be discussed in this study. To make this approach novel, we will consider the fractional order model which is generalization of integer order derivative to an arbitrary number. Since the integration involved is non local therefore this property of fractional operator is very useful to study epidemic model for infectious diseases. An extended numerical method (ODE solver) is implemented on the model equations and we will present the simulations of the model for different values of fractional order to study the effect of carriers on transmission dynamics. Global dynamics of fractional model are established by using the reproduction number.

Keywords: Fractional differential equation, Numerical simulations, epidemic model, transmission dynamics

Procedia PDF Downloads 563
10741 Mixed Sub-Fractional Brownian Motion

Authors: Mounir Zili

Abstract:

We will introduce a new extension of the Brownian motion, that could serve to get a good model of many natural phenomena. It is a linear combination of a finite number of sub-fractional Brownian motions; that is why we will call it the mixed sub-fractional Brownian motion. We will present some basic properties of this process. Among others, we will check that our process is non-Markovian and that it has non-stationary increments. We will also give the conditions under which it is a semimartingale. Finally, the main features of its sample paths will be specified.

Keywords: mixed Gaussian processes, Sub-fractional Brownian motion, sample paths

Procedia PDF Downloads 459
10740 Mixed-Sub Fractional Brownian Motion

Authors: Mounir Zili

Abstract:

We will introduce a new extension of the Brownian motion, that could serve to get a good model of many natural phenomena. It is a linear combination of a finite number of sub-fractional Brownian motions; that is why we will call it the mixed sub-fractional Brownian motion. We will present some basic properties of this process. Among others, we will check that our process is non-markovian and that it has non-stationary increments. We will also give the conditions under which it is a semi-martingale. Finally, the main features of its sample paths will be specified.

Keywords: fractal dimensions, mixed gaussian processes, sample paths, sub-fractional brownian motion

Procedia PDF Downloads 387
10739 A New Study on Mathematical Modelling of COVID-19 with Caputo Fractional Derivative

Authors: Sadia Arshad

Abstract:

The new coronavirus disease or COVID-19 still poses an alarming situation around the world. Modeling based on the derivative of fractional order is relatively important to capture real-world problems and to analyze the realistic situation of the proposed model. Weproposed a mathematical model for the investigation of COVID-19 dynamics in a generalized fractional framework. The new model is formulated in the Caputo sense and employs a nonlinear time-varying transmission rate. The existence and uniqueness solutions of the fractional order derivative have been studied using the fixed-point theory. The associated dynamical behaviors are discussed in terms of equilibrium, stability, and basic reproduction number. For the purpose of numerical implementation, an effcient approximation scheme is also employed to solve the fractional COVID-19 model. Numerical simulations are reported for various fractional orders, and simulation results are compared with a real case of COVID-19 pandemic. According to the comparative results with real data, we find the best value of fractional orderand justify the use of the fractional concept in the mathematical modelling, for the new fractional modelsimulates the reality more accurately than the other classical frameworks.

Keywords: fractional calculus, modeling, stability, numerical solution

Procedia PDF Downloads 80
10738 Fractional Calculus into Structural Dynamics

Authors: Jorge Lopez

Abstract:

In this work, we introduce fractional calculus in order to study the dynamics of a damped multistory building with some symmetry. Initially we make a review of the dynamics of a free and damped multistory building. Then we introduce those concepts of fractional calculus that will be involved in our study. It has been noticed that fractional calculus provides models with less parameters than those based on classical calculus. In particular, a damped classical oscilator is more naturally described by using fractional derivatives. Accordingly, we model our multistory building as a set of coupled fractional oscillators and compare its dynamics with the results coming from traditional methods.

Keywords: coupled oscillators, fractional calculus, fractional oscillator, structural dynamics

Procedia PDF Downloads 208
10737 Edge Detection in Low Contrast Images

Authors: Koushlendra Kumar Singh, Manish Kumar Bajpai, Rajesh K. Pandey

Abstract:

The edges of low contrast images are not clearly distinguishable to the human eye. It is difficult to find the edges and boundaries in it. The present work encompasses a new approach for low contrast images. The Chebyshev polynomial based fractional order filter has been used for filtering operation on an image. The preprocessing has been performed by this filter on the input image. Laplacian of Gaussian method has been applied on preprocessed image for edge detection. The algorithm has been tested on two test images.

Keywords: low contrast image, fractional order differentiator, Laplacian of Gaussian (LoG) method, chebyshev polynomial

Procedia PDF Downloads 592
10736 Multiple Version of Roman Domination in Graphs

Authors: J. C. Valenzuela-Tripodoro, P. Álvarez-Ruíz, M. A. Mateos-Camacho, M. Cera

Abstract:

In 2004, it was introduced the concept of Roman domination in graphs. This concept was initially inspired and related to the defensive strategy of the Roman Empire. An undefended place is a city so that no legions are established on it, whereas a strong place is a city in which two legions are deployed. This situation may be modeled by labeling the vertices of a finite simple graph with labels {0, 1, 2}, satisfying the condition that any 0-vertex must be adjacent to, at least, a 2-vertex. Roman domination in graphs is a variant of classic domination. Clearly, the main aim is to obtain such labeling of the vertices of the graph with minimum cost, that is to say, having minimum weight (sum of all vertex labels). Formally, a function f: V (G) → {0, 1, 2} is a Roman dominating function (RDF) in the graph G = (V, E) if f(u) = 0 implies that f(v) = 2 for, at least, a vertex v which is adjacent to u. The weight of an RDF is the positive integer w(f)= ∑_(v∈V)▒〖f(v)〗. The Roman domination number, γ_R (G), is the minimum weight among all the Roman dominating functions? Obviously, the set of vertices with a positive label under an RDF f is a dominating set in the graph, and hence γ(G)≤γ_R (G). In this work, we start the study of a generalization of RDF in which we consider that any undefended place should be defended from a sudden attack by, at least, k legions. These legions can be deployed in the city or in any of its neighbours. A function f: V → {0, 1, . . . , k + 1} such that f(N[u]) ≥ k + |AN(u)| for all vertex u with f(u) < k, where AN(u) represents the set of active neighbours (i.e., with a positive label) of vertex u, is called a [k]-multiple Roman dominating functions and it is denoted by [k]-MRDF. The minimum weight of a [k]-MRDF in the graph G is the [k]-multiple Roman domination number ([k]-MRDN) of G, denoted by γ_[kR] (G). First, we prove that the [k]-multiple Roman domination decision problem is NP-complete even when restricted to bipartite and chordal graphs. A problem that had been resolved for other variants and wanted to be generalized. We know the difficulty of calculating the exact value of the [k]-MRD number, even for families of particular graphs. Here, we present several upper and lower bounds for the [k]-MRD number that permits us to estimate it with as much precision as possible. Finally, some graphs with the exact value of this parameter are characterized.

Keywords: multiple roman domination function, decision problem np-complete, bounds, exact values

Procedia PDF Downloads 70
10735 Fractional Order Differentiator Using Chebyshev Polynomials

Authors: Koushlendra Kumar Singh, Manish Kumar Bajpai, Rajesh Kumar Pandey

Abstract:

A discrete time fractional orderdifferentiator has been modeled for estimating the fractional order derivatives of contaminated signal. The proposed approach is based on Chebyshev’s polynomials. We use the Riemann-Liouville fractional order derivative definition for designing the fractional order SG differentiator. In first step we calculate the window weight corresponding to the required fractional order. Then signal is convoluted with this calculated window’s weight for finding the fractional order derivatives of signals. Several signals are considered for evaluating the accuracy of the proposed method.

Keywords: fractional order derivative, chebyshev polynomials, signals, S-G differentiator

Procedia PDF Downloads 617
10734 Upper Bounds on the Paired Domination Number of Cubic Graphs

Authors: Bin Sheng, Changhong Lu

Abstract:

Let G be a simple undirected graph with no isolated vertex. A paired dominating set of G is a dominating set which induces a subgraph that has a perfect matching. The paired domination number of G, denoted by γₚᵣ(G), is the size of its smallest paired dominating set. Goddard and Henning conjectured that γₚᵣ(G) ≤ 4n/7 holds for every graph G with δ(G) ≥ 3, except the Petersen Graph. In this paper, we prove this conjecture for cubic graphs.

Keywords: paired dominating set, upper bound, cubic graphs, weight function

Procedia PDF Downloads 207
10733 Fractional Euler Method and Finite Difference Formula Using Conformable Fractional Derivative

Authors: Ramzi B. Albadarneh

Abstract:

In this paper, we use the new definition of fractional derivative called conformable fractional derivative to derive some finite difference formulas and its error terms which are used to solve fractional differential equations and fractional partial differential equations, also to derive fractional Euler method and its error terms which can be applied to solve fractional differential equations. To provide the contribution of our work some applications on finite difference formulas and Euler Method are given.

Keywords: conformable fractional derivative, finite difference formula, fractional derivative, finite difference formula

Procedia PDF Downloads 408
10732 Caputo-Type Fuzzy Fractional Riccati Differential Equations with Fuzzy Initial Conditions

Authors: Trilok Mathur, Shivi Agarwal

Abstract:

This paper deals with the solutions of fuzzy-fractional-order Riccati equations under Caputo-type fuzzy fractional derivatives. The Caputo-type fuzzy fractional derivatives are defined based on Hukuhura difference and strongly generalized fuzzy differentiability. The Laplace-Adomian-Pade method is used for solving fractional Riccati-type initial value differential equations of fractional order. Moreover, we also displayed some examples to illustrate our methods.

Keywords: Caputo-type fuzzy fractional derivative, Fractional Riccati differential equations, Laplace-Adomian-Pade method, Mittag Leffler function

Procedia PDF Downloads 365
10731 Fractional Residue Number System

Authors: Parisa Khoshvaght, Mehdi Hosseinzadeh

Abstract:

During the past few years, the Residue Number System (RNS) has been receiving considerable interest due to its parallel and fault-tolerant properties. This system is a useful tool for Digital Signal Processing (DSP) since it can support parallel, carry-free, high-speed and low power arithmetic. One of the drawbacks of Residue Number System is the fractional numbers, that is, the corresponding circuit is very hard to realize in conventional CMOS technology. In this paper, we propose a method in which the numbers of transistors are significantly reduced. The related delay is extremely diminished, in the first glance we use this method to solve concerning problem of one decimal functional number some how this proposition can be extended to generalize the idea. Another advantage of this method is the independency on the kind of moduli.

Keywords: computer arithmetic, residue number system, number system, one-Hot, VLSI

Procedia PDF Downloads 470
10730 Derivation of Fractional Black-Scholes Equations Driven by Fractional G-Brownian Motion and Their Application in European Option Pricing

Authors: Changhong Guo, Shaomei Fang, Yong He

Abstract:

In this paper, fractional Black-Scholes models for the European option pricing were established based on the fractional G-Brownian motion (fGBm), which generalizes the concepts of the classical Brownian motion, fractional Brownian motion and the G-Brownian motion, and that can be used to be a tool for considering the long range dependence and uncertain volatility for the financial markets simultaneously. A generalized fractional Black-Scholes equation (FBSE) was derived by using the Taylor’s series of fractional order and the theory of absence of arbitrage. Finally, some explicit option pricing formulas for the European call option and put option under the FBSE were also solved, which extended the classical option pricing formulas given by F. Black and M. Scholes.

Keywords: European option pricing, fractional Black-Scholes equations, fractional g-Brownian motion, Taylor's series of fractional order, uncertain volatility

Procedia PDF Downloads 131
10729 Reduced Differential Transform Methods for Solving the Fractional Diffusion Equations

Authors: Yildiray Keskin, Omer Acan, Murat Akkus

Abstract:

In this paper, the solution of fractional diffusion equations is presented by means of the reduced differential transform method. Fractional partial differential equations have special importance in engineering and sciences. Application of reduced differential transform method to this problem shows the rapid convergence of the sequence constructed by this method to the exact solution. The numerical results show that the approach is easy to implement and accurate when applied to fractional diffusion equations. The method introduces a promising tool for solving many fractional partial differential equations.

Keywords: fractional diffusion equations, Caputo fractional derivative, reduced differential transform method, partial

Procedia PDF Downloads 490
10728 Relation between Roots and Tangent Lines of Function in Fractional Dimensions: A Method for Optimization Problems

Authors: Ali Dorostkar

Abstract:

In this paper, a basic schematic of fractional dimensional optimization problem is presented. As will be shown, a method is performed based on a relation between roots and tangent lines of function in fractional dimensions for an arbitrary initial point. It is shown that for each polynomial function with order N at least N tangent lines must be existed in fractional dimensions of 0 < α < N+1 which pass exactly through the all roots of the proposed function. Geometrical analysis of tangent lines in fractional dimensions is also presented to clarify more intuitively the proposed method. Results show that with an appropriate selection of fractional dimensions, we can directly find the roots. Method is presented for giving a different direction of optimization problems by the use of fractional dimensions.

Keywords: tangent line, fractional dimension, root, optimization problem

Procedia PDF Downloads 162
10727 The Need for Multi-Edge Strategies and Solutions

Authors: Hugh Taylor

Abstract:

Industry analysts project that edge computing will be generating tens of billions in revenue in coming years. It’s not clear, however, if this will actually happen, and who, if anyone, will make it happen. Edge computing is seen as a critical success factor in industries ranging from telecom, enterprise IT and co-location. However, will any of these industries actually step up to make edge computing into a viable technology business? This paper looks at why the edge seems to be in a chasm, on the edge of realization, so to speak, but failing to coalesce into a coherent technology category like the cloud—and how the segment’s divergent industry players can come together to build a viable business at the edge.

Keywords: edge computing, multi-edge strategies, edge data centers, edge cloud

Procedia PDF Downloads 74
10726 Design Fractional-Order Terminal Sliding Mode Control for Synchronization of a Class of Fractional-Order Chaotic Systems with Uncertainty and External Disturbances

Authors: Shabnam Pashaei, Mohammadali Badamchizadeh

Abstract:

This paper presents a new fractional-order terminal sliding mode control for synchronization of two different fractional-order chaotic systems with uncertainty and external disturbances. A fractional-order integral type nonlinear switching surface is presented. Then, using the Lyapunov stability theory and sliding mode theory, a fractional-order control law is designed to synchronize two different fractional-order chaotic systems. Finally, a simulation example is presented to illustrate the performance and applicability of the proposed method. Based on numerical results, the proposed controller ensures that the states of the controlled fractional-order chaotic response system are asymptotically synchronized with the states of the drive system.

Keywords: terminal sliding mode control, fractional-order calculus, chaotic systems, synchronization

Procedia PDF Downloads 382
10725 Lyapunov Type Inequalities for Fractional Impulsive Hamiltonian Systems

Authors: Kazem Ghanbari, Yousef Gholami

Abstract:

This paper deals with study about fractional order impulsive Hamiltonian systems and fractional impulsive Sturm-Liouville type problems derived from these systems. The main purpose of this paper devotes to obtain so called Lyapunov type inequalities for mentioned problems. Also, in view point on applicability of obtained inequalities, some qualitative properties such as stability, disconjugacy, nonexistence and oscillatory behaviour of fractional Hamiltonian systems and fractional Sturm-Liouville type problems under impulsive conditions will be derived. At the end, we want to point out that for studying fractional order Hamiltonian systems, we will apply recently introduced fractional Conformable operators.

Keywords: fractional derivatives and integrals, Hamiltonian system, Lyapunov-type inequalities, stability, disconjugacy

Procedia PDF Downloads 325
10724 Nonhomogeneous Linear Fractional Differential Equations Will Bessel Functions of the First Kind Giving Hypergeometric Functions Solutions

Authors: Fernando Maass, Pablo Martin, Jorge Olivares

Abstract:

Fractional derivatives have become very important in several areas of Engineering, however, the solutions of simple differential equations are not known. Here we are considering the simplest first order nonhomogeneous differential equations with Bessel regular functions of the first kind, in this way the solutions have been found which are hypergeometric solutions for any fractional derivative of order α, where α is rational number α=m/p, between zero and one. The way to find this result is by using Laplace transform and the Caputo definitions of fractional derivatives. This method is for values longer than one. However for α entire number the hypergeometric functions are Kumer type, no integer values of alpha, the hypergeometric function is more complicated is type ₂F₃(a,b,c, t2/2). The argument of the hypergeometric changes sign when we go from the regular Bessel functions to the modified Bessel functions of the first kind, however it integer seems that using precise values of α and considering no integers values of α, a solution can be obtained in terms of two hypergeometric functions. Further research is required for future papers in order to obtain the general solution for any rational value of α.

Keywords: Caputo, fractional calculation, hypergeometric, linear differential equations

Procedia PDF Downloads 172
10723 Solutions of Fractional Reaction-Diffusion Equations Used to Model the Growth and Spreading of Biological Species

Authors: Kamel Al-Khaled

Abstract:

Reaction-diffusion equations are commonly used in population biology to model the spread of biological species. In this paper, we propose a fractional reaction-diffusion equation, where the classical second derivative diffusion term is replaced by a fractional derivative of order less than two. Based on the symbolic computation system Mathematica, Adomian decomposition method, developed for fractional differential equations, is directly extended to derive explicit and numerical solutions of space fractional reaction-diffusion equations. The fractional derivative is described in the Caputo sense. Finally, the recent appearance of fractional reaction-diffusion equations as models in some fields such as cell biology, chemistry, physics, and finance, makes it necessary to apply the results reported here to some numerical examples.

Keywords: fractional partial differential equations, reaction-diffusion equations, adomian decomposition, biological species

Procedia PDF Downloads 340
10722 Weak Solutions Of Stochastic Fractional Differential Equations

Authors: Lev Idels, Arcady Ponosov

Abstract:

Stochastic fractional differential equations have recently attracted considerable attention, as they have been used to model real-world processes, which are subject to natural memory effects and measurement uncertainties. Compared to conventional hereditary differential equations, one of the advantages of fractional differential equations is related to more realistic geometric properties of their trajectories that do not intersect in the phase space. In this report, a Peano-like existence theorem for nonlinear stochastic fractional differential equations is proven under very general hypotheses. Several specific classes of equations are checked to satisfy these hypotheses, including delay equations driven by the fractional Brownian motion, stochastic fractional neutral equations and many others.

Keywords: delay equations, operator methods, stochastic noise, weak solutions

Procedia PDF Downloads 167
10721 Application of Fractional Model Predictive Control to Thermal System

Authors: Aymen Rhouma, Khaled Hcheichi, Sami Hafsi

Abstract:

The article presents an application of Fractional Model Predictive Control (FMPC) to a fractional order thermal system using Controlled Auto Regressive Integrated Moving Average (CARIMA) model obtained by discretization of a continuous fractional differential equation. Moreover, the output deviation approach is exploited to design the K -step ahead output predictor, and the corresponding control law is obtained by solving a quadratic cost function. Experiment results onto a thermal system are presented to emphasize the performances and the effectiveness of the proposed predictive controller.

Keywords: fractional model predictive control, fractional order systems, thermal system, predictive control

Procedia PDF Downloads 381
10720 Oil Displacement by Water in Hauterivian Sandstone Reservoir of Kashkari Oil Field

Authors: A. J. Nazari, S. Honma

Abstract:

This paper evaluates oil displacement by water in Hauterivian sandstone reservoir of Kashkari oil field in North of Afghanistan. The core samples of this oil field were taken out from well No-21st, and the relative permeability and fractional flow are analyzed. Steady state flow laboratory experiments are performed to empirically obtain the fractional flow curves and relative permeability in different water saturation ratio. The relative permeability represents the simultaneous flow behavior in the reservoir. The fractional flow approach describes the individual phases as fractional of the total flow. The fractional flow curve interprets oil displacement by water, and from the tangent of fractional flow curve can find out the average saturation behind the water front flow saturation. Therefore, relative permeability and fractional flow curves are suitable for describing the displacement of oil by water in a petroleum reservoir. The effects of irreducible water saturation, residual oil saturation on the displaceable amount of oil are investigated through Buckley-Leveret analysis.

Keywords: fractional flow, oil displacement, relative permeability, simultaneously flow

Procedia PDF Downloads 354
10719 Some Codes for Variants in Graphs

Authors: Sofia Ait Bouazza

Abstract:

We consider the problem of finding a minimum identifying code in a graph. This problem was initially introduced in 1998 and has been since fundamentally connected to a wide range of applications (fault diagnosis, location detection …). Suppose we have a building into which we need to place fire alarms. Suppose each alarm is designed so that it can detect any fire that starts either in the room in which it is located or in any room that shares a doorway with the room. We want to detect any fire that may occur or use the alarms which are sounding to not only to not only detect any fire but be able to tell exactly where the fire is located in the building. For reasons of cost, we want to use as few alarms as necessary. The first problem involves finding a minimum domination set of a graph. If the alarms are three state alarms capable of distinguishing between a fire in the same room as the alarm and a fire in an adjacent room, we are trying to find a minimum locating domination set. If the alarms are two state alarms that can only sound if there is a fire somewhere nearby, we are looking for a differentiating domination set of a graph. These three areas are the subject of much active research; we primarily focus on the third problem. An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from other vertices by the set of vertices in C that are at distance at most r≥1 from x. When only vertices out of the code are asked to be identified, we get the related concept of a locating dominating set. The problem of finding an identifying code (resp a locating dominating code) of minimum size is a NP-hard problem, even when the input graph belongs to a number of specific graph classes. Therefore, we study this problem in some restricted classes of undirected graphs like split graph, line graph and path in a directed graph. Then we present some results on the identifying code by giving an exact value of upper total locating domination and a total 2-identifying code in directed and undirected graph. Moreover we determine exact values of locating dominating code and edge identifying code of thin headless spider and locating dominating code of complete suns.

Keywords: identiying codes, locating dominating set, split graphs, thin headless spider

Procedia PDF Downloads 435