Diffusion Model of a Non-Integer Order PIγ Controller with TCP/UDP Streams

In this article, a way to employ the diffusion approximation to model interplay between TCP and UDP flows is presented. In order to control traffic congestion, an environment of IP routers applying AQM (Active Queue Management) algorithms has been introduced. Furthermore, the impact of the fractional controller PIγ and its parameters on the transport protocols is investigated. The controller has been elaborated in accordance with the control theory. The TCP and UDP flows are transmitted simultaneously and are mutually independent. Only the TCP is controlled by the AQM algorithm. Our diffusion model allows a single TCP or UDP flow to start or end at any time, which distinguishes it from those previously described in the literature.     

Optimal control and numerical methods for hybrid stochastic SIS models

This work focuses on optimal controls of a class of stochastic SIS epidemic models under regime switching. By assuming that a decision maker can influence the infectivity period, our aim is to minimize the expected discounted cost due to illness, medical treatment, and the adverse effect on the society. In addition, a model with the incorporation of vaccination is proposed. Numerical schemes are developed by approximating the continuous-time dynamics using Markov chain approximation methods. It is demonstrated that the approximation schemes converge to the optimal strategy as the mesh size goes to zero. Numerical examples are provided to illustrate our results.     

A framework to perform high-order deconvolution for finite-volume method on simplicial meshes

In this article, a new framework to design high-order approximations in the context of node-centered finite volumes on simplicial meshes is proposed. The major novelty of this method is that it relies on very simple and compact differential operators, which is a critical point to achieve good performances in the High-performance computing context. This method is based on deconvolution between nodal and volume-average values, which can be conducted to any order. The interest of the new method is illustrated through three different applications: mesh-to-mesh interpolation, levelset curvature computation, and numerical scheme for convection. Higher order can also be achieved within the present framework by introducing high-rank tensors. Although these tensors feature much symmetries, their manipulation can quickly become an overwhelming task. For this reason and without loss of generality, the present articles are limited to third-order expansion. This method, although tightly connected to the k-exact schemes theory, does not rely on successive corrections: the high-order property is obtained in a single operation, which makes them more attractive in terms of performances.     

Nonnegative solutions to reaction–diffusion system with cross-diffusion and nonstandard growth conditions

We establish the existence of nonnegative weak solutions to nonlinear reaction–diffusion system with cross-diffusion and nonstandard growth conditions subject to the homogeneous Neumann boundary conditions. We assume that the diffusion operators satisfy certain monotonicity condition and nonstandard growth conditions and prove that the existence of weak solutions using Galerkin's approximation technique.     

Construction Theory of Function on Local Fields

We establish the construction theory of function based upon a local field K p as underlying space. By virture of the concept of pseudo-differential operator, we introduce "fractal calculus"(or, p-type calculus, or, Gibbs-Butzer calculus). Then, show the Jackson direct approximation theorems, Bermstein inverse approximation theorems and the equivalent approximation theorems for compact group D( Kp) and locally compact group K+p(= Kp), so that the foundation of construction theory of function on local fields is established. Moreover, the Jackson type, Bernstein type,and equivalent approximation theorems on the H ?lder-type space Cσ(Kp), σ 0, are proved; then the equivalent approximation theorem on Sobolev-type space Wrσ(Kp),σ≥ 0, 1 ≤ r +∞, is shown.     

Exactness of SWKB for shape invariant potentials

The supersymmetry-based semiclassical method (SWKB) is known to produce exact spectra for conventional shape invariant potentials. In this paper we prove that this exactness follows from their additive shape invariance.     

Global approximation to arbitrary cost functions: A Bayesian approach with application to US banking

This paper proposes and estimates a globally flexible functional form for the cost function, which we call Neural Cost Function (NCF). The proposed specification imposes a priori and satisfies globally all the properties that economic theory dictates. The functional form can be estimated easily using Markov Chain Monte Carlo (MCMC) techniques or standard iterative SURE. We use a large panel of U.S. banks to illustrate our approach. The results are consistent with previous knowledge about the sector and in accordance with mathematical production theory.     

An approximation analysis for an assembly-like queueing system with time-constraint items

We study an assembly-like queueing system one of whose queues has items with generally distributed time-constraints, where this system has a single server providing services using each item individually. It is well-known that analysis of a queueing system which has items with time-constraint (i.e., impatient items) is difficult since the analytical model must involve all the departure times of these impatient items. We therefore propose to employ the techniques of Whitt’s approximation and show the method for obtaining the stationary distribution of the model. Through some simulation experiments, we discuss the validation of our approximation model, and show that the approximation is accurate in various kinds of situations (e.g., service time distribution and the number of queues).     

Linearly χ-bounding (P6, C4)-free graphs*

Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time.