• The Transactions of the Korean Institute of Power Electronics
• /
• v.18 no.3
• /
• pp.289-295
• /
• 2013

It is important to know exact values of Interior Permanent Magnet Synchronous Motors(IPMSM)' parameters such as stator resistance and inductance in order to have their high performance. This paper proposes a novel motor parameter(stator resistance, d&q axis inductance) estimation algorithm for IPMSM. The proposed estimation method utilizes back-EMF equations and model reference adaptive system(MRAS). The algorithm using back-EMF estimates d and q axis inductances in the constant torque region, and the stator resistance is estimated by using MRAS with the estimated inductance regardless of speed regions. The validity of the proposed algorithm is verified by simulations and experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.1085-1100
• /
• 2011

The Random Early Detection algorithm is widely used in the queue management mechanism of the router. We find that the parameters of the RED algorithm have a significant influence on the defense performance of the random early detection algorithm and discuss the robust of the algorithm in mitigating Low-rate Denial-of-Service attack in details. Simulation results show that the defense performance can be effectively improved by adjusting the parameters of $Q_{min}$ and $Q_{max}$. Some suggestions are given for mitigating the LDoS attack at the end of this paper.

• Wind and Structures
• /
• v.2 no.3
• /
• pp.189-200
• /
• 1999

In this paper, a new algorithm for active control design of structures is proposed and investigated. The algorithm preserves the decoupling property of the modal vibration equation and eliminates the spillover problem, which is the main shortcoming in the independent modal space control(IMSC) algorithm. With linear quadratic regulator(LQR) control law, the analytical solution of algebraic Riccati equation and the optimal actuator control force are obtained, and the control design procedure is significantly simplified. A numerical example for the control design of a tall building subjected to wind loads demonstrates the effectiveness of the proposed algorithm in reducing the acceleration and displacement responses of tall buildings under wind actions.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.277-283
• /
• 2019

In this paper, we present a cube root algorithm using a recurrence relation. Additionally, we compare the implementations of the Pocklington and $Padr{\acute{o}}-S{\acute{a}}ez$ algorithm with the Adleman-Manders-Miller algorithm. With the recurrence relations, we improve the Pocklington and $Padr{\acute{o}}-S{\acute{a}}ez$ algorithm by using a smaller base for exponentiation. Our method can reduce the average number of ${\mathbb{F}}_q$ multiplications.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.11
• /
• pp.5135-5142
• /
• 2011

A flexible mechanism is proposed in this paper to improve the dynamic response performance of a traffic flow control system in an urban area. The roads, vehicles, and traffic control systems are all modeled as intelligent systems, wherein a wireless communication network is used as the medium of communication between the vehicles and the roads. The necessary sensor networks are installed in the roads and on the roadside upon which reinforcement learning is adopted as the core algorithm for this mechanism. A traffic policy can be planned online according to the updated situations on the roads, based on all the information from the vehicles and the roads. This improves the flexibility of traffic flow and offers a much more efficient use of the roads over a traditional traffic control system. The optimum intersection signals can be learned automatically online. An intersection control system is studied as an example of the mechanism using Q-learning based algorithm, and simulation results showed that the proposed mechanism can improve the traffic efficiency and the waiting time at the signal light by more than 30% in various conditions compare to the traditional signaling system.

• Clinical and Experimental Pediatrics
• /
• v.64 no.2
• /
• pp.80-85
• /
• 2021

Background: Although identifying cases in large administrative databases may aid future research studies, previous reports demonstrated that the use of the International Classification of Diseases, Tenth Revision (ICD-10) code alone for diagnosis leads to disease misclassification. Purpose: We aimed to assess the value of the ICD-10 diagnostic code for identifying potential children with biliary atresia. Methods: Patients aged <18 years assigned the ICD-10 code of biliary atresia (Q44.2) between January 1996 and December 2016 at a quaternary care teaching hospital were identified. We also reviewed patients with other diagnoses of code-defined cirrhosis to identify more potential cases of biliary atresia. A proposed diagnostic algorithm was used to define ICD-10 code accuracy, sensitivity, and specificity. Results: We reviewed the medical records of 155 patients with ICD-10 code Q44.2 and 69 patients with other codes for biliary cirrhosis (K74.4, K74.5, K74.6). The accuracy for identifying definite/probable/possible biliary atresia cases was 80%, while the sensitivity was 88% (95% confidence interval [CI], 82%-93%). Three independent predictors were associated with algorithm-defined definite/probable/possible cases of biliary atresia: ICD-10 code Q44.2 (odds ratio [OR], 2.90; 95% CI, 1.09-7.71), history of pale stool (OR, 2.78; 95% CI, 1.18-6.60), and a presumed diagnosis of biliary atresia prior to referral to our hospital (OR, 17.49; 95% CI, 7.01-43.64). A significant interaction was noted between ICD-10 code Q44.2 and a history of pale stool (P<0.05). The area under the curve was 0.87 (95% CI, 0.84-0.89). Conclusion: ICD-10 code Q44.2 has an acceptable value for diagnosing biliary atresia. Incorporating clinical data improves the case identification. The use of this proposed diagnostic algorithm to examine data from administrative databases may facilitate appropriate health care allocation and aid future research investigations.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3952-3963
• /
• 2000

This paper considers the WRA(Wavelength and Houting Assignment) problem on all-optical tree networks using WDM(Wavelength Division Multiplexing). Each link between a pair of request nodes on all optical networks is assigned different wavelengths because of technical constraint. On the basis of this, we give an polynomial time algorithm to assign wavelengths to the all patbs of a arbitrary tree network using divide and conquer method. The time complexity of this algorithm is O(Q. R), in which Q is the request nodes for all to'all communication in a tree topology and U is the maximum number of wavelength. Also we implemented our algorithm using C in Pentium II 233MHz and analyzed performance results.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.5
• /
• pp.1089-1097
• /
• 2016

It is well-known that, if additional information other than a plaintext-ciphertext pair is available, breaking the RSA cryptosystem may be much easier than factorizing the RSA modulus. For example, Coppersmith showed that, given the 1/2 fraction of the least or most significant bits of one of two RSA primes, the RSA modulus can be factorized in a polynomial time. More recently, Henecka et. al showed that the RSA private key of the form (p, q, d, $d_p$, $d_q$) can efficiently be recovered whenever the bits of the private key are erroneous with error rate less than 23.7%. It is notable that their algorithm is based on counting the matching bits between the candidate key bit string and the given decayed RSA private key bit string. And, extending the algorithm, this paper proposes a new RSA private key recovery algorithm using a generalized probabilistic measure for measuring the consistency between the candidate key bits and the given decayed RSA private key bits.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.6
• /
• pp.342-349
• /
• 2019

We describe and anlayzes the methodology and implementation results of H / W configuration and signal characteristics analysis algorithm for analyzing equipment for analyzing OFDMA physical layer based on 802.16e. Recently, demand for signal analysis of instruments that analyze these signals with the development of digital communication signals is rapidly increasing. Accordingly, it is necessary to develop signal analysis equipment capable of analyzing characteristics of a broadband communication signal using a wideband digital signal processing module. In this paper, we have studied the basic theory of OFDMA in order to devise a device capable of analyzing characterisitcs of broadband communication signals. Second, the structure of OFDMA transmitter/receiver was examined. Third, a wideband digitizer was implemented. we design Wimax signal analysis algorithm based on OFDMA among broadband communication methods and propose Wimax physical layer analysis S/W implementation through I, Q signals. The IF downconverter used the receiver module and the LO generation module of the spectrum analyzer. Quantitative analysis result is obtained through the algorithm of Wimax signal analysis by I, Q data.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.6
• /
• pp.95-109
• /
• 2006

Elliptic Curve Cryptosystem (ECC) is suitable for resource-constrained devices such as smartcards, and sensor motes because of its short key size. This paper presents an efficient multi-scalar multiplication algorithm which is the main component of the verification procedure in Elliptic Curve Digital Signature Algorithm (ECDSA). The proposed algorithm can make use of a precomputed table of variable size and provides an optimal efficiency for that precomputed table. Furthermore, the given scalar is receded on-the-fly so that it can be merged with the main multiplication procedure. This can achieve more savings on memory than other receding algorithms. Through experiments, we have found that the optimal sizes of precomputed tables are 7 and 15 when uP+vQ is computed for u, v of 163 bits and 233 bits integers. This is shown by comparing the computation time taken by the proposed algorithm and other existing algorithms.