• Structural Engineering and Mechanics
• /
• v.54 no.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
• /
• v.10 no.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.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.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.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• 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.

• Journal of the Korean School Mathematics Society
• /
• v.15 no.2
• /
• pp.299-316
• /
• 2012

In this paper, we examine high school in order to know their ability for understanding about fundamental functions, such as polynomial, trigonometric, logarithm and exponential functions which have learned from high school. The result of this study shows as follows. More than half students are not able to draw shape of given functions, except polynomial. More students do not fully understand about function properties such as domain, codomain, range, maximum and minimum value.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.8
• /
• pp.774-780
• /
• 2010

This paper deals with the choice of guidance gain for the time-to-go polynomial (POLY) guidance law when the acceleration limit is existed. POLY is derived based on the assumption that guidance commands are formed by a time-to-go polynomial function. The main characteristic of POLY is that any positive values can be used for its guidance gain. For this reason, it is ambiguous to choose a proper guidance gain. To relieve this difficulty, we firstly derive the closed-form solution of acceleration command and figure out the relationship between the maximum acceleration and guidance gain. From this analysis, we provide a guideline for choosing a guidance gain which satisfies the desired acceleration limit. Finally, the proposed method is demonstrated by simulation study.

• Journal of Plant Biology
• /
• v.33 no.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.

• Journal of the Korean Mathematical Society
• /
• v.41 no.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.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.11
• /
• pp.159-165
• /
• 2013

This paper proposes a O(E) polynomial-time algorithm that has been devised to simultaneously solve edge-coloring problem and graph classification problem both of which remain NP-complete. The proposed algorithm selects an edge connecting maximum and minimum degree vertices so as to determine the number of edge coloring ${\chi}^{\prime}(G)$. Determined ${\chi}^{\prime}(G)$ is in turn either ${\Delta}(G)$ or ${\Delta}(G)+1$. Eventually, the result could be classified as class 1 if ${\chi}^{\prime}(G)={\Delta}(G)$ and as category 2 if ${\chi}^{\prime}(G)={\Delta}(G)+1$. This paper also proves Vizing's planar graph conjecture, which states that 'all simple, planar graphs with maximum degree six or seven are of class one, closing the remaining possible case', which has known to be NP-complete.

• Journal of applied mathematics & informatics
• /
• v.23 no.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.