• Journal of The Korean Society of Agricultural Engineers
• /
• v.62 no.1
• /
• pp.61-70
• /
• 2020

To estimate the ventilation volume of mechanically ventilated swine farms, various regression models were applied, and errors were compared to select the regression model that can best simulate actual data. Linear regression, linear spline, polynomial regression (degrees 2 and 3), logistic curve, generalized additive model (GAM), and gompertz curve were compared. Overfitting models were excluded even when the error rate was small. The evaluation criteria were root mean square error (RMSE) and mean absolute percentage error (MAPE). The evaluation results indicated that degree 3 exhibited the lowest error rate; however, an overestimation contradiction was observed in a certain section. The logistic curve was the most stable and superior to all the models. In the estimation of ventilation volume by all of the models, the estimated ventilation volume of the logistic curve was the smallest except for the model with a large error rate and the overestimated model.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.6_2
• /
• pp.577-583
• /
• 2013

Recently, massive archives of ground information imagery from new sensors have become available. To establish a functional relationship between the image and the ground space, sensor models are required. The rational functional model (RFM), which is used as an alternative to the rigorous sensor model, is an attractive option owing to its generality and simplicity. To determine the rational polynomial coefficients (RPC) in RFM, however, we encounter the problem of obtaining a stable solution. The design matrix for solutions is usually ill-conditioned in the experiments. To solve this unstable solution problem, regularization techniques are generally used. In this paper, we describe the effective determination of the optimal regularization parameter in the regularization technique during RPC derivation. A brief mathematical background of RFM is presented, followed by numerical approaches for effective determination of the optimal regularization parameter using the Euler Method. Experiments are performed assuming that a tilted aerial image is taken with a known rigorous sensor. To show the effectiveness, calculation time and RMSE between L-curve method and proposed method is compared.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.3
• /
• pp.387-393
• /
• 2015

In Electronic Commerce and Secret Communication based on ECC over finite field, if the sender and the receiver use different basis of finite fields, then the time of communication should always be delayed. In this paper, we analyze the number of bases-transformations needed for Electronic Signature in Electronic Commerce and Secret Communication based on ECC over finite field between H/W and S/W implementation systems and introduce the anomalous basis of finite fields using AOP which is efficient for H/W, S/W implementation systems without bases-transformations for Electronic Commerce and Secret Communication. And then we propose a new multiplier based on the anomalous basis of finite fields using AOP which reduces the running time by 25% than that of the multiplier based on finite fields using trinomial with polynomial bases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2680-2700
• /
• 2017

Finite field arithmetic over GF($2^m$) is used in a variety of applications such as cryptography, coding theory, computer algebra. It is mainly used in various cryptographic algorithms such as the Elliptic Curve Cryptography (ECC), Advanced Encryption Standard (AES), Twofish etc. The multiplication in a finite field is considered as highly complex and resource consuming operation in such applications. Many algorithms and architectures are proposed in the literature to obtain efficient multiplication operation in both hardware and software. In this paper, a modified serial multiplication algorithm with interleaved modular reduction is proposed, which allows for an efficient realization of a sequential polynomial basis multiplier. The proposed sequential multiplier supports multiplication of any two arbitrary finite field elements over GF($2^m$) for generic irreducible polynomials, therefore made versatile. Estimation of area and time complexities of the proposed sequential multiplier is performed and comparison with existing sequential multipliers is presented. The proposed sequential multiplier achieves 50% reduction in area-delay product over the best of existing sequential multipliers for m = 163, indicating an efficient design in terms of both area and delay. The Application Specific Integrated Circuit (ASIC) and the Field Programmable Gate Array (FPGA) implementation results indicate a significantly less power-delay and area-delay products of the proposed sequential multiplier over existing multipliers.

• Journal of the Korean Society for Geothermal and Hydrothermal Energy
• /
• v.13 no.1
• /
• pp.7-13
• /
• 2017

In order to use and manage the building energy efficiently, it is necessary to minimize building energy consumptions, and establish operation plans of various equipment. The maximum heating and cooling load calculation is an essential way in various equipment selections, and the annual building load calculation is used in forecasting & evaluating the LCC required for operation plan. In this study, noting that the annual building load changes depending on outside temperature around year, we propose a predicting method of annual building load. By using the $4^{th}$ polynomial function that have two double radix and a feature the $f(x)=a^4$ in x = 0 condition, we can calculate annual building load very easily only with the two result (maximum heating and cooling load) and a minimum parameters.

• ETRI Journal
• /
• v.26 no.3
• /
• pp.241-251
• /
• 2004

We propose two improved scalar multiplication methods on elliptic curves over $F_{{q}^{n}}$ $q= 2^{m}$ using Frobenius expansion. The scalar multiplication of elliptic curves defined over subfield $F_q$ can be sped up by Frobenius expansion. Previous methods are restricted to the case of a small m. However, when m is small, it is hard to find curves having good cryptographic properties. Our methods are suitable for curves defined over medium-sized fields, that is, $10{\leq}m{\leq}20$. These methods are variants of the conventional multiple-base binary (MBB) method combined with the window method. One of our methods is for a polynomial basis representation with software implementation, and the other is for a normal basis representation with hardware implementation. Our software experiment shows that it is about 10% faster than the MBB method, which also uses Frobenius expansion, and about 20% faster than the Montgomery method, which is the fastest general method in polynomial basis implementation.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.10 no.6
• /
• pp.795-802
• /
• 1998

For measuring the thermal diffusivity by laser flash method, raw data have to be calibrated using temperature data. We have developed in-process calibration method and polynomial calibration in which thermal diffusivity can be calibrated during measuring, This method is different from existing temperature pre-process calibration method and exponential calibration having various source of error. Using this new calibration method, measurement accuracy was improved about 1∼2% compare to the value by the existing method. We also studied more accurate fitting curve as in Figure 4 was shown the result of measuring output characteristics of IR radiometer with temperature. As illustrated in data, in-process calibration method and polynomial calibration equation is proper than pre-process calibration method and exponential calibration.

• Journal of the Korean Institute of Navigation
• /
• v.25 no.4
• /
• pp.417-422
• /
• 2001

Every ship might be exposed to collision, grounding and/or various accidents. They may make some underwater holes on the hull. An underwater damage would cause her loss of buoyancy, trim, and inclination. Although a ship has some provisions against these accidents, if the circumstance is serious, she would be sunk or upsetted. Because of varieties of type of accidents, one could not prepare all of them. Many subdivision could prevent them, but it is difficult to realize it due to rising costs. This paper deals with physical phenomena of sinkage and an application on box type ship, and some results are earned as follows； 1. sinkage speed up to the level of the damage hole is increased proportionally, and is decreased proportionally after filling the level. 2. the curve of draft shows cup type of second order polynomial up to the damage hole level, and shows cap type of second order polynomial after filling the level. 3. if damage occurs beneath half of the draft, changes of head and displacement, and sinking speed follow almost straight lines. 4. by careful observation, sinkage speed could be predicted.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.145-155
• /
• 2015

In this paper, we study the bounds of the coefficients of the characteristic polynomial of the Frobenius endomorphism of the Jacobian of dimension three over a finite field. We provide explicitly computable bounds for the coefficients of the characteristic polynomial. In addition, we present the counting points algorithm for computing a group of the Jacobian of genus 3 hyperelliptic curves over a finite field with large characteristic. Based on these bounds, we found an efficient search space that was used in the counting points algorithm on genus 3 curves. The algorithm was explained and verified through simple examples.

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.101-109
• /
• 2012

In this paper, we present an algorithm for computing the number of points on the Jacobian varieties of one-dimensional family of genus 3 nonhyperelliptic curves over finite fields. We also provide the explicit formula of the characteristic polynomial of the Frobenius endomorphism of the Jacobian of $C:y^3=x^4+{\alpha}$ over a finite field $\mathbb{F}_p$ with $p{\equiv}1$ (mod 3) and $p{\neq}1$ (mod 4). Moreover, we give some implementation results using Gaudry-Schost method. A 162-bit order is computed in 97 s on a Pentium IV 2.13 GHz computer using our algorithm.