• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.9
• /
• pp.1399-1407
• /
• 2004

Structural optimization has been carried out in continuous design space or in discrete design space. Generally, available designs are discrete in design practice. However, the methods for discrete variables are extremely expensive in computational cost. An iterative optimization algorithm is proposed for design in a discrete space, which is called a sequential algorithm using orthogonal arrays (SOA). We demonstrate verifying the fact that a local optimum solution can be obtained from the process with this algorithm. The local optimum solution is defined in a discrete design space. Then the search space, which is a set of candidate values of each design variables formed by the neighborhood of a current design point, is defined. It is verified that a local optimum solution can be found by sequentially moving the search space. The SOA algorithm has been applied to problems such as truss type structures. Then it is confirmed that a local solution can be obtained by using the SOA algorithm

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.1005-1010
• /
• 2004

The structural optimization has been carried out in the continuous design space or in the discrete design space. Generally, available designs are discrete in design practice. But methods for discrete variables are extremely expensive in computational cost. In order to overcome this weakness, an iterative optimization algorithm was proposed for design in the discrete space, which is called as a sequential algorithm using orthogonal arrays (SOA). We focus to verify the fact that the local solution can be obtained throughout the optimization with this algorithm. The local solution is defined in discrete design space. Then the search space, which is the set of candidate values of each design variables formed by the neighborhood of current design point, is defined. It is verified that a local solution can be founded by moving sequentially the search space. The SOA algorithm has been applied to problems such as truss type structures. Then it is confirmed that a local solution can be obtained using the SOA algorithm

• Journal of Dental Anesthesia and Pain Medicine
• /
• v.20 no.4
• /
• pp.187-194
• /
• 2020

Background: The aim of the present systematic review was to evaluate and compare the efficacy of warmed and unwarmed local anesthesia solutions in reduction of pain during intraoral injection administration. Methods: PubMed, Ovid SP, and Cochrane Central Register of Controlled Trials were searched from publication years 1990 to 2020 with relevant MeSH terms. Studies were screened by titles and abstracts, followed by full-texts evaluation of the included studies. Results: A total of four studies were included in the systematic review. Outcomes evaluated were subjective and objective pain during administration of the warmed local anesthesia solution in comparison with the unwarmed local anesthesia solution. Among the four studies that evaluated the self-reported pain score, three studies showed significantly lower pain scores associated with warmed local anesthesia. Only two studies evaluated the observed pain score, and both of them reported a significantly lower pain reaction with the warmed local anesthesia solution. Conclusion: Within the limits of this systematic review, warming the local anesthesia solution to body temperature (37℃) before administration seemed to reduce the discomfort during intraoral local anaesthesia administration, and more high-quality studies should be carried out to validate the same.

• The Journal of the Korean dental association
• /
• v.56 no.1
• /
• pp.58-65
• /
• 2018

Dental local anesthesia is important procedure for the elimination of pain during dental treatment. However, the pain during local anesthesia is one of the main source of fear to the patients. The cause of pain during dental local anesthesia includes soft tissue damage during penetration of the oral mucosa, pressure from the spread of the anesthetic solution, temperature of anesthetic solution, low pH of anesthetic solution, and the characteristics of the drug. Several concepts and devices introduced to date to reduce the pain during local anesthesia for dental treatment. In this report, devices that can reduce the pain during local anesthesia will be discussed.

• Journal of Yeungnam Medical Science
• /
• v.11 no.1
• /
• pp.30-34
• /
• 1994

Local anesthetics produce pain during infiltration into skin. The relationship between local anesthetic-induced pain and pH of the local anesthetic solution has not been fully investigated. Commercial preparation of local anesthetics are prepared as acidic solutions of the salts to promote solubility and stability. And the acidity of local anesthetic solition may be related with the pain during infiltration of the solutione. So, we tried to neutralize the lidocaine hydrochloride solution which is one of the most frequently used local anesthetic agent. Sodium bicarbonate was used for neutralization. Sodium bicarbonate was mixed with lidocaine hydrochloride until the resulting pH of the solution become 7.4 which is identical to the acidity of body fluid. To identify the effect of neutralized lidocaine solution, we had a course of double blind test to 6 volunteers. Both forearm of each volunteer were injected with neutralized lidocaine and plain one, and the degree of pain was estimated by each volunteers. According to subjective description by the volinteers, everyone felt neutralized lidocaine injection site was less painful than plain lidocaine. We concluded that we could reduce pain from infiltration of lidocaine hydrochloride by neutralization of the anesthetic solution with sodium bicarbonate.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.3
• /
• pp.358-367
• /
• 2003

We consider discrete-time factorial Markov Decision Processes (MDPs) in multiple decision-makers environment for infinite horizon average reward criterion with a general joint reward structure but a factorial joint state transition structure. We introduce the "localization" concept that a global MDP is localized for each agent such that each agent needs to consider a local MDP defined only with its own state and action spaces. Based on that, we present a gradient-ascent like iterative distributed algorithm that converges to a local optimal solution of the global MDP. The solution is an autonomous joint policy in that each agent's decision is based on only its local state.cal state.

• Proceedings of the Korean Society For Composite Materials Conference
• /
• 2004.04a
• /
• pp.223-227
• /
• 2004

The pultruded structural shapes are usually composed of thin-walled plate elements. Because the composite material has relatively low elastic moduli, the design of pultruded compression members may not be governed by the material strength limit state but by the stability limit state such as the local buckling or the global buckling. Therefore, the stability limit state must be checked to design pultruded columns. In this research, the local buckling analysis of pultruded I-shape column was conducted for various composite materials using the closed-form solution. To establish the design guidelines for the local buckling of pultruded I-shape compression members, the simplified form of equation to find the local buckling coefficient of pultruded I-shape column was proposed as a function of mechanical properties and the width ratio of plate components using the results obtainde by the closed-form solution. In order to verify the validity of proposed solution, the results obtained by the proposed approximate solution were compared with those of the closed-form solution and the experimental results.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.2
• /
• pp.120-129
• /
• 2004

This paper provides a simple but effective method, cost relaxation to escape from a local optimum of the traveling salesman problem. We would find a better solution if we repeat a local search heuristic at a different initial solution. To find a different initial solution, we use the cost relaxation method relaxing the cost of arcs. We used the Lin-Kernighan algorithm as a local search heuristic. In experimental result, we tested large instances, 30 random instances and 34 real world instances. In real-world instances, we found average 0.17% better above the optimum solution than the Concorde known as the chained Lin-Kernighan. In clustered random instances, we found average 0.9% better above the optimum solution than the Concorde.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.1
• /
• pp.48-53
• /
• 2002

This paper Proposes an iterative Local Search (ILS) algorithm for Rural Postman Problems (RPPs). LS searches neighbors from an initial solution in solution space and obtains a nearoptimal solution which can be a local-minima. As an extension of LS, the ILS algorithm is a method that uses various initial solutions for LS. Hence. ILS can overcome the defect of LS. This paper proposes LS and ILS methods for 18 RPPs and analyzes the results of LS and ILS. In the simulation results, the ILS method obtained the better results than the LS method.

• Journal of Dental Anesthesia and Pain Medicine
• /
• v.20 no.5
• /
• pp.271-279
• /
• 2020

Background: The present study aimed to evaluate and compare the efficacy of buffered and unbuffered local anesthesia solutions during inferior alveolar nerve block (IANB) administration in children. Methods: PubMed, Ovid SP, and Cochrane databases were searched separately by two independent reviewers for potential papers published between 1980 and April 2020 using relevant MeSH terms and pre-specified inclusion and exclusion criteria. T Studies of IANB administration in children comparing buffered and unbuffered local anesthesia solutions were evaluated. The primary outcome evaluated was pain (perception and reaction), while the secondary outcome was the onset of anesthesia. Results: A total of five articles were included in a qualitative analysis; among them, four qualified for quantitative analysis of the primary outcome and three for quantitative analysis of the secondary outcome. A fixed-effects model was used to perform the meta-analysis. Pain perception (child-reported pain): Significantly lower pain scores were reported with buffered local anesthesia solution than with unbuffered solution (P = 0.006, MD: -0.32, 95% CI: -0.55 to -0.09). Pain reaction (observer-reported pain reaction in child): No significant difference was found between buffered and unbuffered solution in terms of observer-reported pain behavior in the child (P = 0.09, MD: -0.21, 95% CI: -0.46 to 0.04). Onset of anesthesia: A significantly lower duration of anesthesia onset was reported with buffered local anesthesia solution than with unbuffered solution (P = 0.00001, MD: -12.38, 95% CI: -17.64 to -7.13]. Conclusion: Buffering local anesthesia solution may reduce discomfort due to IANB injection administration and lower the initial onset time of anesthesia. More randomized control trials with adequate sample sizes should be carried out to validate the accuracy of these results.