• Journal of Microbiology and Biotechnology
• /
• 제19권7호
• /
• pp.718-726
• /
• 2009

The objective of this study was to develop and validate secondary models that can predict growth parameters of L. monocytogenes Scott A as a function of concentrations (0-3%) of a commercial potassium lactate (PL) and sodium diacetate (SDA) mixture, pH (5.5-7.0), and temperature (4-37DC). A total of 120 growth curves were fitted to the Baranyi primary model that directly estimates lag time (LT) and specific growth rate (SGR). The effects of the variables on L. monocytogenes Scott A growth kinetics were modeled by response surface analysis using quadratic and cubic polynomial models of the natural logarithm transformation of both LT and SGR. Model performance was evaluated with dependent data and independent data using the prediction bias ($B_f$) and accuracy factors ($A_f$) as well as the acceptable prediction zone method [percentage of relative errors (%RE)]. Comparison of predicted versus observed values of SGR indicated that the cubic model fits better than the quadratic model, particularly at 4 and $10^{\circ}C$. The $B_f$and $A_f$for independent SGR were 1.00 and 1.08 for the cubic model and 1.08 and 1.16 for the quadratic model, respectively. For cubic and quadratic models, the %REs for the independent SGR data were 92.6 and 85.7, respectively. Both quadratic and cubic polynomial models for SGR and LT provided acceptable predictions of L. monocytogenes Scott A growth in the matrix of conditions described in the present study. Model performance can be more accurately evaluated with $B_f$and $A_f$and % RE together.

• 한국통신학회논문지
• /
• 제36권10C호
• /
• pp.614-620
• /
• 2011

현재 가장 많이 쓰이는 공개키 암호시스템 중 하나인 RSA는 매우 큰 합성수 N의 인수분해가 어렵다는 것에 기반을 두고 있다. 120자리보다 큰 합성수를 인수분해하는데 가장 효율적인 알고리즘으로 알려진 Number Field Sieve (NFS)는 법 N에 대하여 공통근을 갖는 두 다항식 선택한 후에, sieving, linear algebra, square root 단계를 차례대로 거친다. 최근의 많은 연구 결과에 따르면 다항식을 얼마나 적합하게 선택하느냐에 따라 sieving step에서의 복잡도가 크게 달라질 수 있다는 것이 알려져 있다. Sieving 다항식은 차수가 같은 두 다항식을 선택하는 것이 이상적이며 두 개의 2차 다항식을 선택하는 방법은 이미 Montgomery가 제시하였다. 이 논문에서는 5항 등 비수열 방법을 이용하여 두 개의 3차 다항식 선택방법을 제시하고자 한다.

• International Journal of Ocean Engineering and Technology Speciallssue:Selected Papers
• /
• 제5권1호
• /
• pp.40-45
• /
• 2002

The calculation of earthwork plays a major role in the planning and design phases of many civil engineering projects, such as seashore reclamation; thus, improving the accuracy of earthwork calculation has become very important. In this paper, we propose an algorithm for finding a cubic spline surface with the free boundary conditions, which interpolates the given three-dimensional data, by using B-spline and an accurate method to estimate pit-excavation volume. The proposed method should be of interest to surveyors, especially those concerned with accuracy of volume computations. The mathematical models of the conventional methods have a common drawback: the modeling curves form peak points at the joints. To avoid this drawback, the cubic spline polynomial is chosen as the mathematical model of the new method. In this paper, we propose an algorithm of finding a spline surface, which interpolates the given data, and an appropriate method to calculate the earthwork. We present some computational results that show the proposed method, of the Maple program, provides better accuracy than the method presented by Chen and Lin.

• 전기학회논문지
• /
• 제65권8호
• /
• pp.1418-1423
• /
• 2016

The purpose of this research is to investigate the effect of sampling frequency on the photoplethysmography (PPG) and to evaluate the performance of interpolation methods for under-sampled PPG. We generated down-sampled PPG using 10 kHz-sampled PPG then evaluated waveshape changes with correlation coefficient. Correlation coefficient was significantly decreased at 50 Hz or below sampling frequency. We interpolated the down-sampled PPG using four interpolation method-linear, nearest, cubic spline and piecewise cubic Hermitt interpolation polynomial - then evaluated interpolation performance. As a result, it was shown that PPG waveform that was sampled over 20 Hz could be reconstructed by interpolation. Among interpolation methods, cubic spline interpolation showed the highest performance. However, every interpolation method has no or less effect on 5 Hz sampled PPG.

• 한국염색가공학회지
• /
• 제2권2호
• /
• pp.20-32
• /
• 1990

In this paper, a new method by Cubic Spline to analyze Munsell Value Function is proposed. The values calculated by this method are compared with ones by Judd's Polynomial and Cube Root Functions, etc. For performing these computation algorithms have been developed.

• ETRI Journal
• /
• 제28권6호
• /
• pp.745-760
• /
• 2006

In this paper, we particularly deal with no $F_p$-rational two-torsion elliptic curves, where $F_p$ is the prime field of the characteristic p. First we introduce a shift product-based polynomial transform. Then, we show that the parities of (#E - 1)/2 and (#E' - 1)/2 are reciprocal to each other, where #E and #E' are the orders of the two candidate curves obtained at the last step of complex multiplication (CM)-based algorithm. Based on this property, we propose a method to check the parity by using the shift product-based polynomial transform. For a 160 bits prime number as the characteristic, the proposed method carries out the parity check 25 or more times faster than the conventional checking method when 4 divides the characteristic minus 1. Finally, this paper shows that the proposed method can make CM-based algorithm that looks up a table of precomputed class polynomials more than 10 percent faster.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.15-15
• /
• 2000

In the past couple of years, there has been increasing interest in the fusion of neural networks and fuzzy logic. Most of the existing fused models have been proposed to implement different types of fuzzy reasoning mechanisms and inevitably they suffer from the dimensionality problem when dealing with complex real-world problem. To overcome the problem, we propose the self-organizing networks with activation nodes based on fuzzy inference and polynomial function. The proposed model consists of two parts, one is fuzzy nodes which each node is operated as a small fuzzy system with fuzzy implication rules, and its fuzzy system operates with Gaussian or triangular MF in Premise part and constant or regression polynomials in consequence part. the other is polynomial nodes which several types of high-order polynomials such as linear, quadratic, and cubic form are used and are connected as various kinds of multi-variable inputs. To demonstrate the effectiveness of the proposed method, time series data for gas furnace process has been applied.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 D
• /
• pp.2977-2979
• /
• 2000

A Fuzzy Hybrid-Multilayer Perceptron (FH-MLP) Structure is proposed in this paper. proposed FH-MLP is not a fixed architecture. that is to say. the number of layers and the number of nodes in each layer of FH-MLP can be generated to adapt to the changing environment. FH-MLP consists of two parts. one is fuzzy nodes which each node is operated as a small fuzzy system with fuzzy implication rules. and its fuzzy system operates with Gaussian or Triangular membership functions in premise part and constants or regression polynomial equation in consequence part. the other is polynomial nodes which several types of high-order polynomial such as linear. quadratic. and cubic form are used and is connected as various kinds of multi-variable inputs. To demonstrate the effectiveness of the proposed method. time series data for gas furnace process has been applied.

• 한국정밀공학회지
• /
• 제23권8호
• /
• pp.89-99
• /
• 2006

In this paper a new shape reconstruction method that allows us to construct surface models from very large sets of points is presented. In this method the global domain of interest is divided into smaller domains where the problem can be solved locally. These local solutions of subdivided domains are blended together according to weighting coefficients to obtain a global solution using partition of unity function. The suggested approach gives us considerable flexibility in the choice of local shape functions which depend on the local shape complexity and desired accuracy. At each domain, a quadratic polynomial function is created that fits the points in the domain. If the approximation is not accurate enough, other higher order functions including cubic polynomial function and RBF(Radial Basis Function) are used. This adaptive selection of local shape functions offers robust and efficient solution to a great variety of shape reconstruction problems.

• 정보과학회지
• /
• 제1권1호
• /
• pp.72-74
• /
• 1983

Traditionally, polynomials have been used to approximte functions with prescribed values at a number of points(called the knots) on a given interal on the real line. The method of splines recently developed is more flexible. It approximates a function in a piece-wise fashion, by means of a different polynomial in each subinterval. The cubic spline gas ets origins in beam theory. It possessed continuous first and second deriatives at the knots and is characterised by a minimum curvature property which es rdlated to the physical feature of minimum potential energy of the supported beam. Translated into mathematical terms, this means that between successive knots the approximation yields a third-order polynomial sith its first derivatives continuous at the knots. The minimum curvature property holds good for each subinterval as well as for the whole region of approximation This means that the integral of the square of the second derivative over the entire interval, and also over each subinterval, es to be minimized. Thus, the task of determining the spline lffers itself as a textbook problem in discrete computer programming, since the integral of ghe square of the second derivative can be obviously recognized as the criterion function whicg gas to be minimized. Starting with the initial value of the function and assuming an initial solpe of the curve, the minimum norm property of the curvature makes sequential decision of the slope at successive knots (points) feasible. It is the aim of this paper to derive the cubic spline by the methods of computer programming and show that the results which is computed the all the alues in each subinterval of the spline approximations.