• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.339-350
• /
• 2005

A space-time fractional advection-dispersion equation (ADE) is a generalization of the classical ADE in which the first-order time derivative is replaced with Caputo derivative of order $\alpha{\in}(0,1]$, and the second-order space derivative is replaced with a Riesz-Feller derivative of order $\beta{\in}0,2]$. We derive the solution of its Cauchy problem in terms of the Green functions and the representations of the Green function by applying its Fourier-Laplace transforms. The Green function also can be interpreted as a spatial probability density function (pdf) evolving in time. We do the same on another kind of space-time fractional advection-dispersion equation whose space and time derivatives both replacing with Caputo derivatives.

• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.383-391
• /
• 2005

The paper is devoted to some flow shop scheduling problems, where job processing times are defined by functions dependent on their positions in the schedule. An example is constructed to show that the classical Johnson's rule is not the optimal solution for two different models of the two-machine flow shop scheduling to minimize makespan. In order to solve the makespan minimization problem in the two-machine flow shop scheduling, we suggest Johnson's rule as a heuristic algorithm, for which the worst-case bound is calculated. We find polynomial time solutions to some special cases of the considered problems for the following optimization criteria: the weighted sum of completion times and maximum lateness. Some furthermore extensions of the problems are also shown.

• Journal of applied mathematics & informatics
• /
• 제12권1_2호
• /
• pp.395-408
• /
• 2003

Common Channel Signaling(CCS) networks need special controls to avoid overload of signaling networks and degradation of call process-ing rate, since they play an important role of controlling communication transfer networks. Congestion control and flow control mechanisms are well described in ITU-T recommendation on Signaling System No.7(SS7). For the practical provisions, however, we need an analysis on the relation among service objects, system requirements and implementation of congestion control algorithms. SS7 provides several options for controlling link congestion in CCS networks. In this paper we give a general queueing model of congestion control algorithm which covers both the international and national options. From the queuing model, we obtain the performance parameters such as throughput, message loss rate and mean delay for the international option. To show the performance of the algorithm, some numerical results are also given.

• Journal of applied mathematics & informatics
• /
• 제3권1호
• /
• pp.11-24
• /
• 1996

The focus of this research is the class of sequential al-gorithms called predictive sorting algorithms for sorting a given set of n elements using pairwise comparisons. The order in which these pairwise comparisons are made is defined by a fixed sequence of all un-ordered pairs of distinct integers{1,2 ···,n} called a sort sequence. A predictive sorting algorithm associated with a sort sequence spec-ifies pairwise comparisons of elements in the input set in the order defined by the sort sequence except that the comparisons whose out-comes can be inferred from the preceding pairs of comparisons are not performed. in this paper predictive sorting algorithms are obtained based on known sorting algorithms and are shown to be required on the average O(n log n) comparisons.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.115-123
• /
• 2004

A recursive tree is constructed by starting with a root node and repeatedly adjoining new nodes to one node of the tree already constructed. Such a tree can represent, for example, the heirarchy of a workforce of a company that grows via recruiting. At times of economic depression, the company may decide to layoff participants, and in some cases it is a fair policy to relieve the last senior worker (most recent entry in the tree). If we remove an edge from such a tree then it falls into two subtrees one of which contains the most recent entry. If we continue to remove edges from the successively smaller subtrees that contain the most recent entry, we eventually isolate the most recent entry. We consider how many randomly selected edges must be removed in average before isolating the most recent entry by this procedure.

• Journal of applied mathematics & informatics
• /
• 제12권1_2호
• /
• pp.233-241
• /
• 2003

The rolling schedule procedure has been an important part of the Enterprise Resource Planning (ERP) systems. The performance of production planning in an ERP system depends on the selection of the three parameters in rolling schedule procedure: frozen interval, replanning interval, and planning horizon (forecast window). This research investigated, in a theoretical approach, the combined impact of selections of those three parameters. The proven mathematical theorems provided guidance to re-duction of instability (nervousness) and to seek the optimal balance between stability and responsiveness of ERP systems. Further the theorems are extended to incorporate the cost structure.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.427-435
• /
• 2007

The existence theorem and continuous dependence property in $"L^2"$ sense for solutions of backward stochastic differential equation (shortly BSDE) with Lipschitz coefficients were respectively established by Pardoux-Peng and Peng in [1,2], Mao and Cao generalized the Pardoux-Peng's existence and uniqueness theorem to BSDE with non-Lipschitz coefficients in [3,4]. The present paper generalizes the Peng's continuous dependence property in $"L^2"$ sense to BSDE with Mao and Cao's conditions. Furthermore, this paper investigates the continuous dependence property in "almost surely" sense for BSDE with Mao and Cao's conditions, based on the comparison with the classical mathematical expectation.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.295-303
• /
• 2007

In this paper we investigate the boundedness character of the positive solutions of the rational difference equation of the form $$x_{n+1}=\frac{a_0+{{\sum}^k_{j=1}}a_jx_{n-j+1}}{b_0+{{\sum}^k_{j=1}}b_jx_{n-j+1}},\;\;n=0,\;1,...$$ where $k{\in}N,\;and\;a_j,b_j,\;j=0,\;1,...,\;k $, are nonnegative numbers such that $b_0+{{\sum}^k_{j=1}}b_jx_{n-j+1}>0$ for every $n{\in}N{\cup}\{0\}$. In passing we confirm several conjectures recently posed in the paper: E. Camouzis, G. Ladas and E. P. Quinn, On third order rational difference equations(part 6), J. Differ. Equations Appl. 11(8)(2005), 759-777.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.325-331
• /
• 2007

To the unconstrained programme of non-convex function, this article give a modified BFGS algorithm associated with the general line search model. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficacious of the new quasi-Newton iteration equation $B_{k+1}s_k=y^*_k,\;where\;y^*_k$ is the sum of $y_k\;and\;A_ks_k,\;and\;A_k$ is some matrix. The global convergence properties of the algorithm associating with the general form of line search is proved.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.283-293
• /
• 2007

This paper considers single machine scheduling problems with group technology (GT) and deteriorating jobs. A sequence independent setup is required to process a job from a different group and jobs in each group are processed together. We consider the case of jobs whose processing times are a decreasing function of their starting time. The objectives of scheduling problems are to minimize the makespan and the total completion time, respectively. We also provide polynomial time algorithms to solve these problems.