New solutions for charge distribution on conductor surface

In the paper, a problem of electrostatics for charge distribution on a conductor surface is analytically solved for three new particular cases of conducting surfaces with complicated shape and specified value of electrostatic potential. The exact analytical expressions for surface charge density for the bodies are obtained. All the solutions are represented in a clear view of 3D graphs. It is shown that the proposed method of electrostatic problem for conductors allows to obtain infinitely many numerical solutions for the problem but only several special cases can be solved analytically.     

Uncertain multiobjective traveling salesman problem

Traveling salesman problem is a fundamental combinatorial optimization model studied in the operations research community for nearly half a century, yet there is surprisingly little literature that addresses uncertainty and multiple objectives in it. A novel TSP variation, called uncertain multiobjective TSP (UMTSP) with uncertain variables on the arc, is proposed in this paper on the basis of uncertainty theory, and a new solution approach named uncertain approach is applied to obtain Pareto efficient route in UMTSP. Considering the uncertain and combinatorial nature of UMTSP, a new ABC algorithm inserted with reverse operator, crossover operator and mutation operator is designed to this problem, which outperforms other algorithms through the performance comparison on three benchmark TSPs. Finally, a new benchmark UMTSP case study is presented to illustrate the construction and solution of UMTSP, which shows that the optimal route in deterministic TSP can be a poor route in UMTSP.     

Mathematical Analysis of caching policies and cooperation in YouTube-like services

Currently, most video on-demand services offered over the Internet do not exploit the idle resources available from end-users. We discuss the benefits of user-assistance in video on-demand systems, where users are both clients and servers, helping with the task of video distribution. The mathematical machinery for the systematic analysis of video on-demand services is not mature yet. In this paper we develop a deterministic fluid model to determine the expected evolution of user-assisted on-demand video streaming services. We theoretically prove that cooperative systems always outperform non-cooperative solutions. A combinatorial optimization problem is proposed, where the goal is to distribute a set of video items into repositories trying to offer the minimum waiting times to end-users. This combinatorial problem is proved to be in the class of NP-Complete computational problem, and is heuristically solved with a GRASP methodology. Predictions inspired in YouTube scenarios suggest the introduction of cooperation is both robust and extremely attractive from an economical viewpoint as well.     

Separable programming/duality approach to solving the multi-product Newsboy/Gardener Problem with linear constraints

The Gardener Problem is an extension of the multi-product Newsboy Problem with constraints. It deals with situations where not only the demand is random but also the yield (the supply). Separable programming and duality approaches are utilized to solve the constrained Newsboy/Gardener Problem. The solution methodologies are developed for the common probability distribution functions for the demand, and uniform distribution for the supply, rendering exact and approximate solutions to the problem. Numerical examples are given and when applicable, the performance of the developed approach is compared to those of existing works in this arena. The results reveal that the developed solution methods efficiently converge to the optimal or near optimum solutions. Also, a salient feature of the proposed methodologies is that they can utilize readily available commercial software to solve the considered problems. This feature facilitates the portability of the developed models to the classroom environment.     

Traveling waves for a reaction–diffusion–advection predator–prey model

In this paper we study a reaction–diffusion–advection predator–prey model in a river. The existence of predator-invasion traveling wave solutions and prey-spread traveling wave solutions in the upstream and downstream directions is established and the corresponding minimal wave speeds are obtained. While some crucial improvements in theoretical methods have been established, the proofs of the existence and nonexistence of such traveling waves are based on Schauder’s fixed-point theorem, LaSalle’s invariance principle and Laplace transform. Based on theoretical results, we investigate the effect of the hydrological and biological factors on minimal wave speeds and hence on the spread of the prey and the invasion of the predator in the river. The linear determinacy of the predator–prey Lotka–Volterra system is compared with nonlinear determinacy of the competitive Lotka–Volterra system to investigate the mechanics of linear and nonlinear determinacy.     

LOCALLY STABILIZED FINITE ELEMENT METHOD FOR STOKES PROBLEM WITH NONLINEAR SLIP BOUNDARY CONDITIONS

Based on the low-order conforming finite element subspace （Vh, Mh） such as the P1-P0 triangle element or the Q1-P0 quadrilateral element, the locally stabilized finite element method for the Stokes problem with nonlinear slip boundary conditions is investigated in this paper. For this class of nonlinear slip boundary conditions including the subdifferential property, the weak variational formulation associated with the Stokes problem is an variational inequality. Since （Vh, Mh） does not satisfy the discrete inf-sup conditions, a macroelement condition is introduced for constructing the locally stabilized formulation such that the stability of （Vh, Mh） is established. Under these conditions, we obtain the H1 and L2 error estimates for the numerical solutions.     

Entropy, independent sets and antichains: A new approach to Dedekind's problem

For -regular, -vertex bipartite graphs with bipartition , a precise bound is given for the sum over independent sets of the quantity . (In other language, this is bounding the partition function for certain instances of the hard-core model.) This result is then extended to graded partially ordered sets, which in particular provides a simple proof of a well-known bound for Dedekind's Problem given by Kleitman and Markowsky in 1975.

     

Three Classes of Reaction-Diffusion Systems with Neumann Boundary Condition

ＴｈｒｅｅＣｌａｓｓｅｓｏｆＲｅａｃｔｉｏｎ－ＤｉｆｆｕｓｉｏｎＳｙｓｔｅｍｓｗｉｔｈＮｅｕｍａｎｎＢｏｕｎｄａｒｙＣｏｎｄｉｔｉｏｎ￥（严子谦）ＹａｎＺｉｑｉａｎ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＪｉｌｉｎＵｎｉｖｅｒｓｉｔｙ，Ｃｈ...     

Computational experience with the Chow—Yorke algorithm

The Chow—Yorke algorithm is a nonsimplicial homotopy type method for computing Brouwer fixed points that is globally convergent. It is efficient and accurate for fixed point problems. L.T. Watson, T.Y. Li, and C.Y. Wang have adapted the method for zero finding problems, the nonlinear complementarity problem, and nonlinear two-point boundary value problems. Here theoretical justification is given for applying the method to some mathematical programming problems, and computational results are presented.This work was partially supported by NSF Grant MCS 7821337.     

A numerical technique for three-dimensional compressible boundary layers

The non-linear two-point boundary value problem for three-dimensional compressible boundary layers is solved through the application of a boundary value technique for a range of parameters characterizing the nature of stagnation point flows. The analytical boundary conditions, at infinity, are applied at the edge of the computational mesh with iterations on the size of the domain. The solutions obtained show excellent agreement with the established similarity solutions for three-dimensional flows. The present method has the potential advantage of yielding the wall values of f″_w, g″_w and θ′_w as a part of the solution, contrary to the previously used ‘shooting’ methods. The algorithm is computationally simple and numerically stable and extremely suitable for engineering design applications.