带新熵函数的Entropy-Ultra-bee格式计算线性传输方程

本文研究了线性传输方程的数值解法.利用物理的熵函数得到了一种新的Entropy-Ultrabee格式.数值实验表明该格式长时间计算效果非常好,在间断附近有比较高的分辨率.     

A response to Tisdell on ‘Critical perspectives of the “new” difference equation solution method’ of Rivera-Figueroa and Rivera-Rebolledo

ABSTRACT

Recently, Christopher C. Tisdell questions some claims and results that appear in our article [Rivera-Figueroa A, Rivera-Rebolledo JM. A new method to solve the second-order linear difference equations with constant coefficients. Int J Math Educ Sci Technol. 2016;47(4):636–649.] regarding the novelty and simplicity of a method to solve second-order linear difference equations. He argues that our method was not new because the method already appeared in the mathematical literature, neither was simpler than existing ones. After carefully analysing and comparing the references quoted by Tisdell, we confirm that our method differs from that quoted by Tisdell. Moreover, our approach is simpler because it avoids the uniqueness theorem and the method of variation of parameters, in this context, it offers some clear didactic and epistemological advantages.     

A semidefinite programming approach to the hypergraph minimum bisection problem

The hypergraph minimum bisection (HMB) problem is the problem of partitioning the vertices of a hypergraph into two sets of equal size so that the total weight of hyperedges crossing the sets is minimized. HMB is an NP-hard problem that arises in numerous applications – for example, in digital circuit design. Although many heuristics have been proposed for HMB, there has been no known mathematical program that is equivalent to HMB. As a means of shedding light on HMB, we study the equivalent, complement problem of HMB (called CHMB), which attempts to maximize the total weight of non-crossing hyperedges. We formulate CHMB as a quadratically constrained quadratic program, considering its semidefinite programming relaxation and providing computational results on digital circuit partitioning benchmark problems. We also provide results towards an approximation guarantee for CHMB.     

Resource allocation in rooted trees for VLSI applications

ABSTRACT

Several optimization problems of modifying the weight of vertices in rooted trees, some of which are special cases of the inverse 1-median problem, are solved. Such problems arise in Very Large Scale Integration (VLSI) design of hardware security circuits, circuit synchronization, and analog-to-digital converters. These problems require assigning costly hardware (demands) to the leaves of rooted trees. One common property of these problems is that a resource allocated to an internal node can be shared by the entire sub-tree emanated at the node. Two types of problems are studied here. (1) A tree node employs an addition operation and the demands at the leaves are obtained by summing the resources allocated to nodes along the root-to-leaf paths. A linear-time bottom-up algorithm is shown to minimize the total resources allocated to tree nodes. (2) A tree’s node employs a multiplication operation and the demands at the leaves are obtained by multiplying the resources allocated to nodes along the root-to-leaf paths. A bottom-up dynamic programming algorithm is shown to minimize the total resources allocated to the tree’s nodes. While the above problems are usually solved by design engineers heuristically, this paper offers optimal solutions that can be easily programmed in CAD tools.     

Further bounds for waiting time distributions and their means in the case ρ<1

In the paper exponential bounds for the instationary and stationary waiting time d.f.'s in GI/GI/1/∞, derived by several authors partly using martingale theory arguments, are improved with the help of monotonicity properties. Further it is shown that Ne?eptjrenko's bound for the rate of convergence of the mean waiting time in single server queues Is also valid for many server queues with ρ < 1.     

A simple but NP-hard problem of mixed-discrete programming and its solution by approximate algorithms

A NP-hard problem (P) of mixed-discrete linear programming is considered which consists in the minimization of a linear objective function subject to a special non-connected subset of an unbounded polymatroid. For this problem we describe three polynomial approximate algorithms including a greedy algorithm and a fully polynomial approximation scheme solving a special subproblem of (P).     

Analysis of an Implicit Finite Difference Scheme for Time Fractional Diffusion Equation

Time fractional diffusion equation is usually used to describe the problems involving non-Markovian random walks. This kind of equation is obtained from the standard diffusion equation by replacing the first-order time derivative with a fractional derivative of order α∈(0, 1). In this paper, an implicit finite difference scheme for solving the time fractional diffusion equation with source term is presented and analyzed, where the fractional derivative is described in the Caputo sense. Stability and convergence of this scheme are rigorously established by a Fourier analysis. And using numerical experiments illustrates the accuracy and effectiveness of the scheme mentioned in this paper.     

Likelihood Inference under Generalized Hybrid Censoring Scheme with Comp eting Risks

Statistical inference is developed for the analysis of generalized type-II hybrid censoring data under exponential competing risks model. In order to solve the problem that approximate methods make unsatisfactory performances in the case of small sample size, we establish the exact conditional distributions of estimators for parameters by conditional moment generating function(CMGF). Furthermore, confidence intervals(CIs) are constructed by exact distributions, approximate distributions as well as bootstrap method respectively, and their performances are evaluated by Monte Carlo simulations. And finally, a real data set is analyzed to illustrate all the methods developed here.     

Dynamically consistent discrete metapopulation model

In this paper we construct nonstandard difference schemes, which are dynamically consistent with a metapopulation model formulated by Keymer et al. in 2000, i.e. preserve all dynamical properties of the differential equations of the model. These properties are: monotone convergence, boundedness, local asymptotic stability and especially, global stability of equilibria and non-periodicity of solutions. Numerical examples confirm the obtained theoretical results of the properties of the constructed difference schemes.