• 대한안전경영과학회지
• /
• 제16권2호
• /
• pp.217-230
• /
• 2014

The purpose of this study is to develop the Generalized Depreciation Function (GDF) and Winfrey Depreciation Function (WDF) by reviewing methods for the depreciation accountings. The Depreciation Accounting Models (DAM), including straight-line model, declining-balance model, sum-of-the-year-digit model and sinking fund model presented in this paper, are reclassified into the charging pattern of increasing type, decreasing type and constant type. This paper also discusses the development of the GDFs based on convex type, concave type and constant type according to the demand pattern of product, frequency of plant usage, deterioration of time, relative inadequacy, Capital Expenditure (CAPEX) and Operating Expenditure (OPEX) of the Total Productive Maintenance (TPM). The WDFs presented in this paper depict a sudden degradation of plant performance by measuring the change of TPM activity at the midpoint of useful life of asset. The WDFs are classified into left-modal type, symmetrical type and right-modal type by varying the value of skewness and kurtosis. Moreover, three increasing patterns, such as convex, concave and linear types, are used in this paper to present the distinct identification of WFDs by using Instantaneous Depreciation Rate (IDR) in terms of Performance Depreciation Function (PDF) and Depreciation Density Function (DDF). In order to have better understanding of depreciation models, the numerical examples are used for evaluating the Net Operating Less Adjusted Tax (NOPLAT) and Economic Value Added (EVA). It is concluded that the depreciation models showing a large dispersion of EVA require the adjustment of NOPLAT and Invested Capital (IC) based on the objective cash basis and net operating activity for reducing the variation of EVA.

• Journal of Mechanical Science and Technology
• /
• 제18권11호
• /
• pp.1916-1922
• /
• 2004

A robust position control with the bound function of neural network structure is proposed for uncertain robot manipulators. The uncertain factors come from imperfect knowledge of system parameters, payload change, friction, external disturbance, and etc. Therefore, uncertainties are often nonlinear and time-varying. The neural network structure presents the bound function and does not need the concave property of the bound function. The robust approach is to solve this problem as uncertainties are included in a model and the controller can achieve the desired properties in spite of the imperfect modeling. Simulation is performed to validate this law for four-axis SCARA type robot manipulator.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제13권4호
• /
• pp.281-292
• /
• 2009

The solution of the interface problem or Poisson problem with concave corner has singular perturbation at the interface corners or singular corners. The decoupled dual singular function method (DDSFM) which exploits the singular representations of the solutions was suggested in [3, 9] and estimated optimal accuracy in [10]. The convergence rates consist with theoretical results even for the problems with very strong singularity, with the efficiency depending on parameters used in the methods. Furthermore the errors in $L^2$ and $L^\infty$-spaces display some oscillation, in the cases with meshsize not small enough. In this paper, we present an answer to remove the oscillation via numerical experiments. We observe the effects of parameters in DDSFM, and show the consisting efficiency of the method over the strong singularity.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제15권4호
• /
• pp.387-392
• /
• 2008

In this note, an alternative proof and extensions are provided for the following conclusions in [6, Theorem 1 and Theorem 3]: The functions $\frac1{x^2}-\frac{e^{-x}}{(1-e^{-x})^2}\;and\;\frac1{t}-\frac1{e^t-1}$ are decreasing in (0, ${\infty}$) and the function $\frac{t}{e^{at}-e^{(a-1)t}}$ for a $a{\in}\mathbb{R}\;and\;t\;{\in}\;(0,\;{\infty})$ is logarithmically concave.

• 대한수학회논문집
• /
• 제11권4호
• /
• pp.1105-1116
• /
• 1996

A partial ordering is developed among weakly positive quadrant dependent (WPQD) bivariate random vectors. This permits us to measure the degree of WPQD-ness and to compare pairs of WPQD random vectors. Some properties and closures under certain statistical operations are derived. An application is made to measures of dependence such as Kendall's $\tau$ and Spearman's $\rho$.

• 대한수학회보
• /
• 제23권2호
• /
• pp.141-148
• /
• 1986

In [1], M. Guignard considered a constraint set in a Banach space, which is similar to that in [2] and gave a first order necessary optimality condition which generalized the Kuhn-Tucker conditions [3]. Sufficiency is proved for objective functions which is either pseudoconcave [5] or quasi-concave [6] where the constraint sets are taken pseudoconvex. In this note, we consider a psedoconvex programming problem in a Hilbert space. Constraint set in a Hillbert space being pseudoconvex and the objective function is restrained by an operator equation. Then we use the methods similar to that in [1] and [6] to obtain a necessary and sufficient optimality condition.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제17권2호
• /
• pp.189-197
• /
• 2010

We give an upper bound for the estimation of the difference between both sides of the well-known H$\ddot{o}$lder's inequality. Moreover, an upper bound for the estimation of the difference of the integral form of H$\ddot{o}$lder's inequality is also obtained. The results of this paper are natural generalizations and refinements of those of [2-4].

• 한국경영과학회지
• /
• 제13권1호
• /
• pp.24-30
• /
• 1988

We study the optimal allocation of machines and pallets in a class of manufacturing systems. The FMS is modeled as a closed queueing network with balanced loading of the stations. An Algorithm is developed, which exploits the properties of the throughput function and solves the allocation problem for increasing concave profit and convex cost. We also study the more general case of allocating machines and pallets among a set of FMSs. A dynamic programming approach is developed, which solves the problem with O(M$^{3}$N$^{2}$) operations.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2007년도 추계학술대회 및 정기총회
• /
• pp.309-312
• /
• 2007

We consider a proportionate flow shop problem with controllable processing times. The objective is to minimize the sum of total completion time and total compression cost, in which the cost function of compressing the processing times is non-decreasing concave. We show that the problem can be solved in polynomial time by reducing it to a polynomially solvable 0-1 unconstrained quadratic program.

• 대한수학회보
• /
• 제33권2호
• /
• pp.193-204
• /
• 1996

Let U and V be nonempty compact subsets of two Hausdorff topological vector spaces. Suppose that a function $J : U \times V \to R$ is such that for each $\upsilon \in V, J(\cdot, \upsilon)$ is lower semi-continuous and convex on U, and for each $ u \in U, J(u, \cdot)$ is upper semi-continuous and concave on V.