• 제목/요약/키워드: Applied example

검색결과 2,638건 처리시간 0.025초

AN ORDER LEVEL INVENTORY MODEL FOR PERISHABLE SEASONAL PRODUCTS WITH DEMAND FLUCTUATION

  • Panda, S.;Basu, M.
    • Journal of applied mathematics & informatics
    • /
    • 제26권3_4호
    • /
    • pp.615-625
    • /
    • 2008
  • A single item order level inventory model for perishable products is considered in which a constant fraction of on hand inventory spoils per unit time. Demand linearly depends on time. The fluctuation of demand is taken into account to determine minimum total cost of the system. Both discrete and continuous fluctuations are considered. The model is developed and solved analytically for infinite time horizon. A numerical example is presented for finite time horizon. Sensitivity analysis of the model is carried out.

  • PDF

PERIODIC SOLUTION TO DELAYED HIGH-ORDER COHEN-GROSSBERG NEURAL NETWORKS WITH REACTION-DIFFUSION TERMS

  • Lv, Teng;Yan, Ping
    • Journal of applied mathematics & informatics
    • /
    • 제28권1_2호
    • /
    • pp.295-309
    • /
    • 2010
  • In this paper, we study delayed high-order Cohen-Grossberg neural networks with reaction-diffusion terms and Neumann boundary conditions. By using inequality techniques and constructing Lyapunov functional method, some sufficient conditions are given to ensure the existence and convergence of the periodic oscillatory solution. Finally, an example is given to verify the theoretical analysis.

비선형 최적화문제의 해결을 위한 개선된 유전알고리즘의 연구 (A study on Improved Genetic Algorithm to solve nonlinear optimization problems)

  • 우병훈;하정진
    • 경영과학
    • /
    • 제13권1호
    • /
    • pp.97-109
    • /
    • 1996
  • Genetic Algorithms have been successfully applied to various problems (for example, engineering design problems with a mix of continuous, integer and discrete design variables) that could not have been readily solved with traditional computational techniques. But, several problems for which conventional Genetic Algorithms are ill defined are premature convergence of solution and application of exterior penalty function. Therefore, we developed an Improved Genetic Algorithms (IGAs) to solve above two problems. As a case study, IGAs is applied to several nonlinear optimization problems and it is proved that this algorithm is very useful and efficient in comparison with traditional methods and conventional Genetic Algorithm.

  • PDF

GCR-LIGHTLIKE SUBMANIFOLDS OF A SEMI-RIEMANNIAN PRODUCT MANIFOLD

  • Kumar, Sangeet;Kumar, Rakesh;Nagaich, Rakesh Kumar
    • 대한수학회보
    • /
    • 제51권3호
    • /
    • pp.883-899
    • /
    • 2014
  • We introduce GCR-lightlike submanifold of a semi-Riemannian product manifold and give an example. We study geodesic GCR-lightlike submanifolds of a semi-Riemannian product manifold and obtain some necessary and sufficient conditions for a GCR-lightlike submanifold to be a GCR-lightlike product. Finally, we discuss minimal GCR-lightlike submanifolds of a semi-Riemannian product manifold.

Bayesian Test for Equality of Coefficients of Variation in the Normal Distributions

  • Lee, Hee-Choon;Kang, Sang-Gil;Kim, Dal-Ho
    • Journal of the Korean Data and Information Science Society
    • /
    • 제14권4호
    • /
    • pp.1023-1030
    • /
    • 2003
  • When X and Y have independent normal distributions, we develop a Bayesian testing procedure for the equality of two coefficients of variation. Under the reference prior of the coefficient of variation, we propose a Bayesian test procedure for the equality of two coefficients of variation using fractional Bayes factor. A real data example is provided.

  • PDF

Reference Priors in the Normal Distributions with Common Coefficient of Variation

  • Lee, Hee-Choon;Kang, Sang-Gil
    • Journal of the Korean Data and Information Science Society
    • /
    • 제14권3호
    • /
    • pp.697-705
    • /
    • 2003
  • When X and Y have independent normal distributions with equal coefficient of variation, we develop the reference priors for different groups of ordering for the parameters. Propriety of posteriors under reference priors proved. A real example is presented to compare the classical estimator and Bayes estimator.

  • PDF

혼합 설계 환경에서의 하드웨어-소프트웨어 인터페이스 설계 (A Hardware-Software Interface Design in the Codesign Environment)

  • 장준영;배영환
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 추계종합학술대회 논문집(2)
    • /
    • pp.120-123
    • /
    • 2000
  • In this paper, A target architecture and interface synthesizer are proposed for processor-embedded codesign. The target architecture has the form of ARM processor based on AMBA. The interface synthesizer automatically generates an interface circuit for the communication between HW and SW. A memory map is used as the communication channel and an interrupt-based interface is applied for synchronized communication between HW and SW modules. In order to verify the function and performance of proposed target architecture and the interface synthesizer, practical test example is applied. Experimental results show the proposed interface synthesizer functioned correctly in the HW/SW codesign environment.

  • PDF

SOME LOCAL SPECTRAL PROPERTIES OF T AND S WITH AT - SA = 0

  • Yoo, Jong-Kwang;Han, Hyuk
    • Journal of applied mathematics & informatics
    • /
    • 제26권5_6호
    • /
    • pp.1263-1272
    • /
    • 2008
  • Let T and S be bounded linear operators on Banach spaces X and y, respectively. A linear map A : X ${\rightarrow}$ y is said to be an intertwiner if AT - SA = 0. In this paper we study the relation between local spectral properties of T and S on the assumption of AT - SA = 0. We give some example of intertwiner with T and S.

  • PDF

IMPROVING COMPARISON RESULTS ON PRECONDITIONED GENERALIZED ACCELERATED OVERRELAXATION METHODS

  • Wang, Guangbin;Sun, Deyu
    • Journal of applied mathematics & informatics
    • /
    • 제33권1_2호
    • /
    • pp.193-201
    • /
    • 2015
  • In this paper, we present preconditioned generalized accelerated overrelaxation (GAOR) methods for solving weighted linear least square problems. We compare the spectral radii of the iteration matrices of the preconditioned and the original methods. The comparison results show that the preconditioned GAOR methods converge faster than the GAOR method whenever the GAOR method is convergent. Finally, we give a numerical example to confirm our theoretical results.