On a Class of Generalized Curve Flows for Planar Convex Curves

In this paper, the authors consider a class of generalized curve flow for convex curves in the plane. They show that either the maximal existence time of the flow is finite and the evolving curve collapses to a round point with the enclosed area of the evolving curve tending to zero, i.e., limt→T A(t) = 0, or the maximal time is infinite, that is, the flow is a global one. In the case that the maximal existence time of the flow is finite, they also obtain a convergence theorem for rescaled curves at the maximal time.     

MARKOV SKELETON PROCESS IN PERT NETWORKS

In this article, we investigate Programming Evaluation and Review Technique networks with independently and generally distributed activity durations. For any path in this network, we select all the activities related to this path such that the completion time of the sub-network （only consisting of all the related activities） is equal to the completion time of this path. We use the elapsed time as the supplementary variables and model this sub-network as a Markov skeleton process, the state space is related to the subnetwork structure. Then use the backward equation to compute the distribution of the sub-network＇s completion time, which is an important rule in project management and scheduling.     

Frozen Landweber Iteration for Nonlinear Ill-Posed Problems

In this paper we propose a modification of the Landweber iteration termed frozen Landweberiteration for nonlinear ill-posed problems.A convergence analysis for this iteration is presented.The numericalperformance of this frozen Landweber iteration for a nonlinear Hammerstein integral equation is compared withthat of the Landweber iteration.We obtain a shorter running time of the frozen Landweber iteration based onthe same convergence accuracy.     

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.     

FULL DISCRETE TWO-LEVEL CORRECTION SCHEME FOR NAVIER-STOKES EQUATIONS

In this paper, a full discrete two-level scheme for the unsteady Navier-Stokes equations based on a time dependent projection approach is proposed. In the sense of the new projection and its related space splitting, non-linearity is treated only on the coarse level subspace at each time step by solving exactly the standard Galerkin equation while a linear equation has to be solved on the fine level subspace to get the final approximation at this time step. Thus, it is a two-level based correction scheme for the standard Galerkin approximation. Stability and error estimate for this scheme are investigated in the paper.     

Waiting times and stopping probabilities for patterns in Markov chains

Suppose that C is a finite collection of patterns. Observe a Markov chain until one of the patterns in C occurs as a run. This time is denoted by τ. In this paper, we aim to give an easy way to calculate the mean waiting time E(τ) and the stopping probabilities P(τ = τA)with A ∈ C, where τA is the waiting time until the pattern A appears as a run.     

On the mean field limit of the Random Batch Method for interacting particle systems

The Random Batch Method proposed in our previous work(Jin et al.J Comput Phys,2020)is not only a numerical method for interacting particle systems and its mean-field limit,but also can be viewed as a model of the particle system in which particles interact,at discrete time,with randomly selected mini-batch of particles.In this paper,we investigate the mean-field limit of this model as the number of particles N→∞.Unlike the classical mean field limit for interacting particle systems where the law of large numbers plays the role and the chaos is propagated to later times,the mean field limit now does not rely on the law of large numbers and the chaos is imposed at every discrete time.Despite this,we will not only justify this mean-field limit(discrete in time)but will also show that the limit,as the discrete time intervalτ→0,approaches to the solution of a nonlinear Fokker-Planck equation arising as the mean-field limit of the original interacting particle system in the Wasserstein distance.     

Positive periodic solution for a nonautonomous periodic model of population with time delays and impulses

In this paper, a nonautonomous periodic model of population with time delays and impulses, which arises in order to describe the control of a single population of cells, is studied. By the coincidence degree theory we obtain the conditions for the existence of periodic solution of this system.     

LINEAR SEARCH FOR A BROWNIAN TARGET MOTION

A target is assumed to move according to a Brownian motion on the real line. The searcher starts from the origin and moves in the two directions from the starting point.The object is to detect the target. The purpose of this paper is to find the conditions under which the expected value of the first meeting time of the searcher and the target is finite,and to show the existence of a search plan which made this expected value minimum.     

Existence of Positive Periodic Solution of Periodic Time-Dependent Predator-Prey System with Impulsive Effects

The general system of differential equations describing predator-prey dynamics with impulsive effects is modified by the assumption that the coefficients are periodic functions of time. By use of standard techniques of bifurcation theory, it is known that this system has a positive periodic solution provided the time average of the predator‘s net uninhibited death rate is in a suitable range.The bifurcation is from the periodic solution of the time-dependent logistic equation for the prey (which results in the absence of predator).     

Numerical Solution of non-Homogeneous Semi-Markov Processes in Transient Case*

In this article a numerical solution for the evolution equation of a continuous time non-homogeneous semi-Markov process (NHSMP) is obtained using a quadrature method. The paper, after a short introduction to continuous time NHSMP, presents the numerical solution of the process evolution equation with a general quadrature method. Furthermore, the paper gives results that justify this approach, proving that the numerical solution tends to the evolution equation of the continuous time NHSMP. Moreover, the formulae related to some specific quadrature methods are given and a method for obtaining the discrete time NHSMP by applying a very particular quadrature formula for the discretization is shown. In this way the relation between the continuous and discrete time NHSMP is proved. Then, the problem of obtaining the continuous time NHSMP from the discrete one is considered. This problem is solved showing that the discrete process converges in law to the continuous one if the discretized time interval tends to zero. In addition, the discrete time NHSMP in matrix form is presented, and the fact that the solution to this process always exists is proved. Finally, an algorithm for solving the discrete time NHSMP is given. To illustrate the use of this algorithm for a discrete NHSMP, an example in the area of finance is presented.     

Asymptotical time response of time varying state space dynamic using homotopy perturbation method

The main goal of this study is to present a technique to find a state response of multivariable time varying systems. In this paper a novel Homotopy Perturbation based Method (HPM) will be presented to find a dynamic response of time varying system. According to this method, the linear part of the described system is partitioned into two time varying and invariant subsections. Time invariant part analytically constructs the state transition matrix. This matrix is a core of the rest of time varying differential equation without any further changes in a sequence order. The main advantage of this method is only the necessity to solve the time invariant part of the state transition matrix. Simulation results verify the significance of the proposed analytic and asymptotic method.     

Stock market forecasting by using a hybrid model of exponential fuzzy time series

The initial aim of this study is to propose a hybrid method based on exponential fuzzy time series and learning automata based optimization for stock market forecasting. For doing so, a two-phase approach is introduced. In the first phase, the optimal lengths of intervals are obtained by applying a conventional fuzzy time series together with learning automata swarm intelligence algorithm to tune the length of intervals properly. Subsequently, the obtained optimal lengths are applied to generate a new fuzzy time series, proposed in this study, named exponential fuzzy time series. In this final phase, due to the nature of exponential fuzzy time series, another round of optimization is required to estimate certain method parameters. Finally, this model is used for future forecasts. In order to validate the proposed hybrid method, forty-six case studies from five stock index databases are employed and the findings are compared with well-known fuzzy time series models and classic methods for time series. The proposed model has outperformed its counterparts in terms of accuracy.     

同时具有学习效应和退化效应的单机排序问题

本文给出了一种同时具有一般化学习效应和退化效应的单机排序模型。在此模型中,工件的实际加工时间既与工件所在位置又与其开工时间有关,且工件在加工之后具有一个配送时间。其中学习效应是工件所在位置的函数,退化效应是工件开工时间的函数。证明了极小化最大完工时间和极小化总完工时间问题是多项式可解的,在满足一定的条件下,极小化加权总完工时间和极小化最大延误问题也是多项式可解的。推广了一些已有文献中的结论。     

工件可转包加工的排序问题研究

研究工件可以转包加工的单台机排序问题: 有n个工件, 在零时刻已经到达一个单台机处, 每个工件可以由加工者自有的单台机器加工或者转包给其他机器加工. 如果工件被转包加工, 那么其完工时间等于在自有机器上的加工时间, 而产生的加工费用与在自有机器上加工的费用不同. 假设被转包加工的工件的完工时间和加工费用与转包加工机器的总负载没有关系.目标函数是最小化工件最大完工时间与总加工费用的加权和. 该问题已经被证明是NP-难的. 最后给出该问题的伪多项式时间最优算法, 并且提出一个完全多项式时间近似方案(FPTAS).     

极小化最大完工时间的单机分批加工问题

本文考虑极小化最大完工时间的单机分批加工问题．设有n个工件和一台批加工机器．每个工件有一个释放时间和一个加工时间．批加工机器可以同时加工b(b相似文献   

Picone type identities and definiteness of quadratic functionals on time scales

In this paper we derive a new sufficient condition for the nonnegativity of time scale quadratic functionals associated to time scale symplectic systems. To establish this result, a new global Picone formula is derived. Another proof of a special case of the result is shown to be obtained via a Sturmian comparison technique. Furthermore, we derive several new Picone type identities which, in particular, do not impose a certain delta-differentiability assumption, and we survey known ones from the literature. The results in this paper complete our earlier work on the definiteness of a time scale quadratic functional in terms of its corresponding time scale symplectic system.     

一种计算工作时间参数新方法

为了编制和优化施工进度计划,计算构成施工项目的各项工作最早开始时间、最迟开始时间、最早完成时间、最迟完成时间、总时差和自由时差等时间参数十分重要.提出了一种计算工作时间参数新方法.该方法以工作完成时间为决策变量,通过建立和求解线性规划模型来得到各种工作时间参数.其建模思路清晰,不需绘制网络图,能用通用办公软件EXCEL求解.模拟计算表明,用该方法与用标准网络计划技术计算出的工作时间参数完全一致.     

A method of solving evolutionary problems based on the Laguerre step-by-step transform

In [1], Mikhailenko proposed a method of solving dynamic problems of elasticity theory. The method is based on the Laguerre transform with respect to time. In this paper, we propose a modification of this approach, applying the Laguerre transform to a sequence of finite time intervals. The solution obtained at the end of one time interval is used as initial data for solving the problem on the next time interval. To implement the approach, four parameters are chosen: a scale factor to approximate the solution by Laguerre functions, an exponential coefficient of a weight function that is used for finding a solution on a finite time interval, the duration of this interval, and the number of projections of the Laguerre transform. A way to find parameters that provide stability of calculations is proposed. The effect of the parameters on the accuracy of calculations when using second- and fourth-order difference schemes is studied. It is shown that the approach makes it possible to obtain a high-accuracy solution on large time intervals.