• Journal of Dental Anesthesia and Pain Medicine
• /
• v.18 no.3
• /
• pp.177-182
• /
• 2018

Paresthesia is an altered sensation of the skin, manifesting as numbness, partial loss of local sensitivity, burning, or tingling. The inferior alveolar nerve (IAN) is the third branch of the trigeminal nerve and is very important in dental treatment. IAN paresthesia may occur after various dental procedures such as simple anesthetic injections, surgical procedures, and endodontic treatment, and is reported to range from 0.35% to 8.4%. The altered sensation usually follows immediately after the procedure, and reports of late onset of nerve involvement are rare. This report presents a rare case of delayed paresthesia after dental surgery and discusses the pathophysiology of IAN delayed paresthesia.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.9
• /
• pp.1667-1673
• /
• 2009

This paper presents a application of new algorithm for feeder reconfiguration problem in distribution systems. Harmony Search (HS) algorithm, which is motivated from the musical performance, is used to reconfigure distribution systems so that active power losses are globally minimized with turning on/off the sectionalizing and the tie-line switches. In optimization processing, the HS algorithm has searching ability for the global optimal solution, simple coding of the iteration procedure, and fast convergence to get the solution. The HS algorithm is tested on 15 buses and 69 buses distribution systems, and the results prove its effectiveness to determine appropriate switching options without the occurrence of any misdetermination in switching and get the minimum power loss.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.1
• /
• pp.78-89
• /
• 2003

Ordering is performed to reduce the amount of fill-ins of the Cholesky factor of a symmetric positive definite matrix. This paper proposes a new ordering algorithm that reduces the fill-ins of the Cholesky factor iteratively by elimination tree rotations and clique separators. Elimination tree rotations have been used mainly to reorder the rows of the permuted matrix for the efficiency of storage space management or parallel processing, etc. In the proposed algorithm, however, they are repeatedly performed to reduce the fill-ins of the Cholesky factor. In addition, we presents a simple method for finding a minimal node separator between arbitrary two nodes of a chordal graph. The proposed reordering procedure using clique separators enables us to obtain another order of rows of which the number of till-ins decreases strictly.

• IE interfaces
• /
• v.14 no.1
• /
• pp.79-83
• /
• 2001

In this paper, we propose a simple method to reduce categorical variables into smaller, but significant numbers, and also demonstrate how the proposed method can be applied to the problem of reduction that empirical research often faces in the course of data processing. For the purpose, we introduce a concept of pseudo-correlation coefficient to make it possible to use factor analysis (FA) as a tool for reducing variables. The main idea of the concept is to deal with the measures of association of categorical variables in the sense of the concept of Pearson's correlation coefficient in order to meet the input requirement of FA. Upon examination of existing measures that could play as pseudo-correlation coefficients, Cramer's V coefficient is selected for the best result among them. To show the detailed procedure of the proposed method, a specific demonstration with the data from 329 R&D projects conducted in 18 private laboratories in electric and electronics industry is presented.

• IE interfaces
• /
• v.12 no.2
• /
• pp.210-221
• /
• 1999

Several researchers have previously studied the problem of allocating buffer storage to maximize the throughput rate and/or minimize the mean buffer average of a transfer line for a given total amount of buffer space. But there seems to be very little difference in performance between intuitively reasonable and optimal allocations. This paper proposes and illustrates a methodology, based on the robust design concept of Taguchi, to allocate buffer storage of long transfer lines with a given total amount of buffer capacity when up and down times follow exponential distributions, respectively. We show how this procedure using simple heuristic rule can be used for design of long transfer lines.

• Journal of Power Electronics
• /
• v.4 no.4
• /
• pp.228-236
• /
• 2004

This paper describes the optimal current-control of a permanent magnet synchronous motor by the use of robust and simple current controllers, based upon the analytical procedure known as the inverse LQ (ILQ) design method. The ILQ design method is a strategy for finding the optimal gains based on pole assignment without solving the Riccati equation. It is very important to keep the motor in robust servo-lock. By experiments and simulations, we will show that the ILQ optimal servo-system with servo-lock is more insensitive at low speeds to variations in armature inductance than the standard PI servo-system. Variations in armature inductance have the greatest influence on the responses of a servo-system.

• Journal of Information Technology Services
• /
• v.10 no.1
• /
• pp.117-133
• /
• 2011

In this paper, we present a frequency reassignment problem (FRP) arising from the reconfiguration of radio networks such as adding new base stations (BSs) and changing the number of frequencies assigned to BSs. For this problem, we develop an integer programming (IP) model that minimizes the sum of frequency reassignment cost and the cost for unsatisfied frequency demands, while avoiding interference among frequencies. To obtain tight lower bounds, we develop some valid inequalities and devise an objective function relaxation scheme. Also, we develop a simple but efficient heuristic procedure to solve large size problems. Computational results show that the developed valid inequalities are effective for improving lower bounds. Also, the proposed tabu search heuristic finds tight upper bounds with average optimality gap of 2.3%.

• Proceedings of the KAIS Fall Conference
• /
• 2004.11a
• /
• pp.299-301
• /
• 2004

A simple procedure for the extraction of the lipolytic enzyme from rice bran has been developed. High activity of lipolytic enzyme was obtained by first defatting the rice bran to remove lipid components with various extraction conditions. Then, after five cycles of aqueous extraction, rice bran lipolytic enzyme was purified using micro- and ultrafiltration apparatus. Lipolytic enzyme activity was estimated by its hydrolytic action of tributyrin. The result indicated that the standard activity curve of butyric acid showed that the potential rice bran enzyme is a hydrolytic lipase enzyme. In addition, it showed higher lipolytic activity and specific enzyme activity with further purification by micro- and ultrafiltration.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.2
• /
• pp.65-75
• /
• 2004

This paper presents a generalized predictive control method based on a fuzzy neural network(FNN) model, which uses the on-line multi-step prediction, fur the intelligent control of chaotic nonlinear systems whose mathematical models are unknown. In our design method, the parameters of both predictor and controller are tuned by a simple gradient descent scheme, and the weight parameters of FNN are determined adaptively during the operation of the system. In order to design a generalized predictive controller effectively, this paper describes computing procedure for each of the two important parameters. Also, we introduce a projection matrix to determine the control input, which deceases the control performance function very rapidly. Finally, in order to evaluate the performance of our controller, the proposed method is applied to the Doffing and Henon systems, which are two representative continuous-time and discrete-time chaotic nonlinear systems, res reactively.

• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• v.4B no.3
• /
• pp.114-121
• /
• 2004

Switched reluctance motors have received much attention as a driving means for various industrial applications because they have simple construction, low cost and high efficiency. Nevertheless, the requirements of drive converters make it difficult to lower the overall system cost as compared with the DC motor application. Single phase switched reluctance motors (SPSRMs) provide a solution to the high cost problem since the number of switching power devices can be reduced and consequently the trials for application are increased. However, research involving SPSRMs, especially in the area of design work, is insufficient. This paper introduces a novel design methodology of single phase SRM. The design work for SPSRM comprises the determination of many variables such as stator and rotor pole arc as well as on, off and so on. Managing all variable combinations leads to lengthy computation time and a fault in the design process. For that reason, a reliable technique and brief procedure term are required in SPSRM design.