This paper proposes and evaluates a novel, edge-based approach, which we call the kset Traffic Engineering (TE) method, to perform traffic engineering in OSPF networks by partitioning traffic into uneven k traffic sets. The traffic partitioning and splitting takes place only at network edges, leaving the core simple. We theoretically prove that if k is large enough, the k-set TE method achieves...

Edge detection and edge enhancement techniques play an essential role in interpreting potential field data. This paper describes the application of various edge detection techniques to gravity data in order to delineate the edges of subsurface structures. The edge detection methods comprise analytic signal, total horizontal derivative (THDR), theta angle, tilt angle, hyperbolic of tilt angle (H...

This thesis proposes a non-parametri te hnique for boundary dete tion in spe kled imagery. Syntheti Aperture Radar (SAR), sonar, B-ultrasound and laser imagery is orrupted by a signal-dependent non-additive noise alled spe kle. Several statisti al models have been proposed to des ribe su h a noise, thus of spe ialized te hniques for image improvement and analysis. The G distribution is a statis...

Let χl (G), χ ′ l (G), χ ′′ l (G), and 1(G) denote, respectively, the list chromatic number, the list chromatic index, the list total chromatic number, and the maximum degree of a non-trivial connected outerplane graph G. We prove the following results. (1) 2 ≤ χl (G) ≤ 3 and χl (G) = 2 if and only if G is bipartite with at most one cycle. (2) 1(G) ≤ χ ′ l (G) ≤ 1(G) + 1 and χ ′ l (G) = 1(G) + ...

We prove that the list chromatic index of a graph of maximum degree and treewidth ≤ √2 − 3 is ; and that the total chromatic number of a graph of maximum degree and treewidth ≤ /3 + 1 is + 1. This improves results by Meeks and Scott. C © 2015 Wiley Periodicals, Inc. J. Graph Theory 81: 272–282, 2016

We prove that the list chromatic index of a graph of maximum degree ∆ and treewidth ≤ √ 2∆ − 3 is ∆; and that the total chromatic number of a graph of maximum degree ∆ and treewidth ≤ ∆/3 + 1 is ∆ + 1. This improves results by Meeks and Scott.

We consider the parameterised complexity of several list problems on graphs, with parameter treewidth or pathwidth. In particular, we show that List Edge Chromatic Number and List Total Chromatic Number are fixed parameter tractable, parameterised by treewidth, whereas List Hamilton Path is W[1]-hard, even parameterised by pathwidth. These results resolve two open questions of Fellows, Fomin, L...

The present study investigates the efficacy of sinusoidal trailing-edge (TE) serrations as a passive means for reductions airfoil broadband noise, theoretically and experimentally. Comprehensive parametric studies were conducted to determine effect serration amplitudes wavelengths on noise reduction performance National Advisory Committee Aeronautics (NACA) airfoil. Initially, paper shows use (...

The thermoelectric transport properties of p-type Bi₂Te₃ nanofilms with various quintuple layers (QL) were systematically investigated based on ab initio electronic structure calculations and Boltzmann transport equations. Our results demonstrated that p-type few-quintuple Bi₂Te₃ nanofilms could exhibit high thermoelectric performance. It was found out that the 1QL Bi₂Te₃ nanofilm had the highe...

Trailing edge noise of a semi-infinite, thin, flat plate situated in low Mach number flow is computed in two spatial dimensions. The Acoustic Perturbation Equations (APE), which are employed as governing equations, are discretized via a Discontinuous Galerkin Method (DGM). Results are compared with theory and Finite Difference (FD) computations. Next to the radiated sound field, special attenti...