• East Asian mathematical journal
• /
• 제26권1호
• /
• pp.39-47
• /
• 2010

Existence of common fixed points for generalized S-nonexpansive subcompatible mappings in convex metric spaces have been obtained. Invariant approximation results have also been derived by its application. These results extend and generalize various known results in the literature with the aid of more general class of noncommuting mappings.

• 대한수학회지
• /
• 제32권3호
• /
• pp.415-425
• /
• 1995

• Kyungpook Mathematical Journal
• /
• 제34권2호
• /
• pp.137-143
• /
• 1994

• East Asian mathematical journal
• /
• 제33권3호
• /
• pp.271-289
• /
• 2017

It is our purpose in this paper to introduce the concept of best random proximity pair for subsets A and B of a separable Banach space E. We prove some best random approximation and best random proximity pair theorems of certain classes of random operators, which is the stochastic verse of the deterministic results of Eldred et al. [22], Eldred et al. [18] and Eldred and Veeramani [19]. Furthermore, our results generalize and extend recent results of Okeke and Abbas [42] and Okeke and Kim [43]. Moreover, we shall apply our results to study nonlinear stochastic integral equations of the Hammerstein type.

• 한국정보과학회논문지:시스템및이론
• /
• 제31권10호
• /
• pp.562-574
• /
• 2004

본 논문에서는 고정 우선순위 경성 실시간 시스템에 대한 에너지 측면에서의 최적의 전압 스케줄링 문제를 고려한다. 먼저, 이 문제가 NP-hard임을 증명한다. 다음으로 이 문제에 대한 fully polynomial time approximation scheme(FPTAS)을 제시한다 제안한 FPTAS는 주어진 임의의 $\varepsilon$>0에 대해 에너지 소모량이 최적의 전압 스케줄에 비해 (1＋$\varepsilon$)배 이내에 있는 전압 스케줄을 문제의 입력의 크기와 1/$\varepsilon$의 다항함수 이내의 시간에 계산해준다. 실험 결과, 제안된 FPTAS는 기존의 휴리스틱에 비해 더 효율적인 전압 스케줄을 더 빠른 시간에 찾아주었다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2003년도 추계학술대회
• /
• pp.1882-1887
• /
• 2003

The response surface method (RSM) became one of famous meta modeling techniques, however its approximation errors give designers several restrictions. Classical RSM uses the least squares method (LSM) to find the best fitting approximation models from the all given data. This paper discusses how to construct RSM efficiently and accurately using moving least squares method (MLSM) with sensitivity information. In this method, several parameters should be determined during the construction of RSM. Parametric study and optimization for these parameters are performed. Several difficulties during approximation processes are described and numerical examples are demonstrated to verify the efficiency of this method.

• Geomechanics and Engineering
• /
• 제13권5호
• /
• pp.845-860
• /
• 2017

It is very important to study displacement prediction in geotechnical engineering. Nowadays, the grey system method, time series analysis method and artificial neural network method are three main methods. Based on the brief introduction, the three methods are analyzed comprehensively. Their merits and demerits, applied ranges are revealed. To solve the shortcomings of the artificial neural network method, a new prediction method based on new evolutionary neural network is proposed. Finally, through two real engineering applications, the analysis of three main methods and the new evolutionary neural network method all have been verified. The results show that, the grey system method is a kind of exponential approximation to displacement sequence, and time series analysis is linear autoregression approximation, while artificial neural network is nonlinear autoregression approximation. Thus, the grey system method can suitably analyze the sequence, which has the exponential law, the time series method can suitably analyze the random sequence and the neural network method almostly can be applied in any sequences. Moreover, the prediction results of new evolutionary neural network method is the best, and its approximation sequence and the generalization prediction sequence are all coincided with the real displacement sequence well. Thus, the new evolutionary neural network method is an acceptable method to predict the measurement displacements of geotechnical engineering.

• 한국산업정보학회논문지
• /
• 제27권2호
• /
• pp.61-69
• /
• 2022

다수 에이전트 시스템(Multi-agent system)은 에이전트 각자의 결정으로 최상의 조직화 된 결정을 달성하는 것을 목표로 하는 시스템으로 본 논문에서는 다수 에이전트-다수 작업의 할당 문제를 제시한다. 본 문제는 각 에이전트가 하나의 작업에 할당이 되어 수행하고, 작업 수행에 대한 작업 완료 확률(completion probability)이 있으며 모든 작업의 수행 확률을 최대화하는 할당을 결정한다. 비선형(non-linearity)의 목적함수와 조합 최적화(combinatorial optimization)로 표현되는 본 문제는 NP-hard로, 효과적이면서 효율적인 문제 해결 방법론 제시가 필요하다. 본 연구에서는 한계 이익(marginal gain)의 감소를 의미하는 하위모듈성(submodularity)을 활용한 근사 알고리즘(approximation algorithm)을 제안하고, 확장성(scalability)과 강건성(robustness) 측면에서 우수한 알고리즘임을 이론 및 실험적으로 제시한다.

• Structural Engineering and Mechanics
• /
• 제69권6호
• /
• pp.615-626
• /
• 2019

The 3-noded metric Timoshenko beam element with an offset of the internal node from the element centre is used here to demonstrate the best-fit paradigm using function space formulation under locking and mesh distortion. The best-fit paradigm follows from the projection theorem describing finite element analysis which shows that the stresses computed by the displacement finite element procedure are the best approximation of the true stresses at an element level as well as global level. In this paper, closed form best-fit solutions are arrived for the 3-noded Timoshenko beam element through function space formulation by combining field consistency requirements and distortion effects for the element modelled in metric Cartesian coordinates. It is demonstrated through projection theorems how lock-free best-fit solutions are arrived even under mesh distortion by using a consistent definition for the shear strain field. It is shown how the field consistency enforced finite element solution differ from the best-fit solution by an extraneous response resulting from an additional spurious force vector. However, it can be observed that when the extraneous forces vanish fortuitously, the field consistent solution coincides with the best-fit strain solution.

• 충청수학회지
• /
• 제24권2호
• /
• pp.351-357
• /
• 2011

In this paper, we introduce certain concepts which we will provide us with a perspective and insight into the problem of calculating best approximations. The material of this paper will be mainly, but not only, used in developing algorithms for the one-sided and two-sided sided approximation problem.