• Structural Engineering and Mechanics
• /
• 제54권1호
• /
• pp.55-67
• /
• 2015

Taking the mid-span/center-point of the structure as the reference point of capturing the maximum dynamic response is very customary in the available literature of the moving load problems. In this article, the absolute maximum dynamic response of an Euler-Bernoulli beam subjected to a moving mass is widely investigated for various boundary conditions of the base beam. The response of the beam is obtained by utilizing a robust numerical method so-called OPSEM (Orthonormal Polynomial Series Expansion Method). It is underlined that the absolute maximum dynamic response of the beam does not necessarily take place at the mid-span of the beam and thus the conventional analysis needs modifications. Therefore, a comprehensive parametric survey of the base beam absolute maximum dynamic response is represented in which the contribution of the velocity and weight of the moving inertial objects are scrutinized and compared to the conventional version (maximum at mid-span).

• Archives of Pharmacal Research
• /
• 제10권1호
• /
• pp.1-8
• /
• 1987

One of the problems of derivatie spectrophotometry, the decrease of signal-to-noise ratio by derivative operations, was solved by three concepts of digital filtering, ensemble averaging, least squares polynomial smoothing and Fourier smoothing. The suthors made several compouter programs written in APPLE SOFT BASIC language for the actual applications of the concepts of these digital filters on UV spectrophotometer system. As a result, ensemble averaging could not be used as a routine operation for the spectrophotometer used. The maximum S/N ratio enhancement factors achieved by least squares polynomial smoothing were 6.17 and 7.47 for the spectra of Gaussian and Lorentzian distribution models, and by Fourier smoothing 16.42 and 11.78 for the spectra of two models, respectively.

• 한국컴퓨터정보학회논문지
• /
• 제21권4호
• /
• pp.81-88
• /
• 2016

The optimal solution of quadratic assignment problem (QAP) cannot get done in polynomial time. This problem is called by NP-complete problem. Therefore the meta-heuristic techniques are applied to this problem to get the approximated solution within polynomial time. This paper proposes an algorithm for a random type QAP, in which the instance of two nodes are arbitrary. The proposed algorithm employs what is coined as a max flow-min distance rule by which the maximum flow node is assigned to the minimum distance node. When applied to the random type QAP, the proposed algorithm has been found to obtain optimal solutions superior to those of the genetic algorithm.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.279-280
• /
• 2008

In order to improve the performance and simplify the structure of the conventional detectors in high density magnetic channels, a new equalizer based on bilinear recursive polynomial (BRP) models, which uses the previously estimated sequence, is proposed. The performance is compared with the conventional equalizers and the maximum likelihood sequence detection (MLSD) bound.

• 한국학교수학회논문집
• /
• 제15권2호
• /
• pp.299-316
• /
• 2012

본 연구에서는 이차함수, 유리함수, 무리함수, 지수함수, 로그함수, 삼각함수와 같이 고등학교 수학 교육과정에서 이미 배운 기본적인 함수들의 모양 그리기와 해석하는 능력을 분석하였다. 00 고등학교의 인문반 2개반(64명)과 자연반 2개반(64명)을 대상으로 조사한 결과 주어 진 함수들의 모양을 그리지 못한 학생이 50% 이상이었다. 또한 함수가 지닌 중요한 성질인 정의역, 치역, 최솟값, 최댓값, 주기 등에 대한 해석하는 능력이 부족한 것으로 나타났다. 본 연구에서는 함수단원이 고등학교 수학이나 대학 교양 수학에서 기초가 되는 내용이므로 함수의 개념과 함수의 모양 그리기, 함수의 모양 오류 데이터 분석 등의 수학학습에 관하여 연구하였다.

• 한국항공우주학회지
• /
• 제38권8호
• /
• pp.774-780
• /
• 2010

본 논문은 $t_{go}$-다항식 유도 법칙에서 가속도 제한을 고려한 유도이득(guidance gain)을 선정하는 방법을 다룬다. 다항식 유도 법칙은 유도명령의 형태를 $t_{go}$의 다항식 형태로 가정하여 유도 되며 유도이득으로 임의의 양의 실수 값 (Real value)을 선정할 수 있다는 특징을 가지고 있다. 따라서 유도이득의 결정에 따라 큰 가속도 명령이 산출 될 수 있는 가능성이 있어서, 적절한 유도이득을 결정하는데 모호성이 존재하게 된다. 이러한 어려움을 해결하기 위해 본 논문에서 다항식 유도 법칙의 가속도 명령의 닫힌 해를 유도하고, 이로 부터 최대 가속도와 유도이득 간의 관계식을 구하여 가속도 제한을 넘지 않는 유도이득을 선정하는 방법을 제안한다. 최종적으로 시뮬레이션을 통해 제안한 방법을 검증한다.

• Journal of Plant Biology
• /
• 제33권2호
• /
• pp.141-146
• /
• 1990

Germination and vegetative growth of Enteromorpha multiramosa Bliding from Pyoson, Cheju Island were investigated in laboratory under various combinations of temperature (5-$25^{\circ}C$) and salinity (8-48$^{\circ}C$). Percent level of germination was relatively high at all combinations of the two factors. The highest value among the combinations was revealed at 15$^{\circ}C$ and 32$\textperthousand$. Dry weight also was fairly high at all levels of combination with maximum value at 2$0^{\circ}C$ and 32$\textperthousand$. Analysis of variance for germination and growth was completed respectively and polynomial prediction models were constructed. F ratio revealed that all factors had a significant effect (p<0.001) on percentage of germination and dry weight, and their interactions also were significant (p<0.001), although the F ratio of interactions was far less than that for either the separate effect of temperature or salinity. Response surface of polynomial equation represented that temperature influenced less than salinity on germination, while it effected remarkably on vegetative growth, so the Enteromorpha multiramosa was kept to visible macrothalli from winter to spring in Cheju Island.

• 대한수학회지
• /
• 제41권1호
• /
• pp.209-229
• /
• 2004

Let $\Sigma_{$\mid$\alpha$\mid$=m}\;s_{\alpha}z^{\alpha},\;z\;{\in}\;{\mathbb{C}}^n$ be a unimodular m-homogeneous polynomial in n variables (i.e. $$\mid$s_{\alpha}$\mid$\;=\;1$ for all multi indices $\alpha$), and let $R\;{\subset}\;{\mathbb{C}}^n$ be a (bounded complete) Reinhardt domain. We give lower bounds for the maximum modules $sup_{z\;{\in}\;R\;$\mid$\Sigma_{$\mid$\alpha$\mid$=m}\;s_{\alpha}z^{\alpha}$\mid$$, and upper estimates for the average of these maximum moduli taken over all possible m-homogeneous Bernoulli polynomials (i.e. $s_{\alpha}\;=\;{\pm}1$ for all multi indices $\alpha$). Examples show that for a fixed degree m our estimates, for rather large classes of domains R, are asymptotically optimal in the dimension n.

• 한국컴퓨터정보학회논문지
• /
• 제18권11호
• /
• pp.159-165
• /
• 2013

본 논문은 NP-완전 문제인 간선 색칠과 그래프 부류 결정 문제를 동시에 해결하는 O(E)의 다항시간 알고리즘을 제안하였다. 제안된 알고리즘은 최대차수-최소차수 정점 쌍 간선을 단순히 선택하는 방법으로 간선 채색수 ${\chi}^{\prime}(G)$를 결정하였다. 결정된 ${\chi}^{\prime}(G)$는 ${\Delta}(G)$ 또는 ${\Delta}(G)+1$을 얻는다. 결국, 알고리즘 수행 결과 얻은 ${\chi}^{\prime}(G)$로부터 ${\chi}^{\prime}(G)={\Delta}(G)$이면 부류 1, ${\chi}^{\prime}(G)={\Delta}(G)+1$이면 부류 2로 분류할 수 있다. 또한, 미해결 문제로 알려진 "최대차수가 6인 단순, 평면 그래프는 부류 1이다."라는 Vizing의 평면 그래프 추정도 증명하였다.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.193-203
• /
• 2007

In this paper we consider the inverse minimum flow (ImF) problem, where lower and upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a minimum flow. A linear time and space method to decide if the problem has solution is presented. Strongly and weakly polynomial algorithms for solving the ImF problem are proposed. Some particular cases are studied and a numerical example is given.