• The Journal of Korea Assosiation for Disability and Oral Health
• /
• v.8 no.1
• /
• pp.15-21
• /
• 2012

Extraction of all nonrestorable teeth prior to bone marrow transplantation is the major dental management of the patient being prepared for the transplantation. But, there are four principal causes for excessive bleeding in the immediate postextraction phase ; (1) Vascular wall alteration (wound infection, scurvy, chemicals, allergy) (2) Disorders of platelet function (3) Thrombocytopenic purpuras (4) Disorders of coagulation (liver disease, anticoagulation drug-heparin, coumarin, aspirin, plavix) If the hemorrhage from postextraction wound is unusually aggressive, the socket must be packed with local hemostatic agent and wound closure & pressure dressing are applied. But, in dental alveoli, local hemostatic agent (gelfoam, surgcel etc) may absorb oral microorganisms and cause alveolar osteitis (infection). This is a case report of bleeding and infection control by suture, pressure packing and iodoform gauze drainage on infected active bleeding extraction socket under sedation and local anesthesia in a 57-years-old multiple disabled patient with anticoagulation drug.

• Journal of Digital Contents Society
• /
• v.8 no.3
• /
• pp.309-314
• /
• 2007

A decision tree algorithm should be modified to be suitable in distributed and collaborative environments for distributed data mining. The distributed data mining system proposed in this paper consists of several agents and a mediator. Each agent deals with a local data mining for data in each local site and communicates with one another to build the global decision tree model. The mediator helps several agents to efficiently communicate among them. One of advantages in distributed data mining is to save much time to analyze huge data with several agents. The paper focuses on a transfer technique among agents dealing with each local decision tree model to reduce huge overhead in communication among them.

• Korean Journal of Health Education and Promotion
• /
• v.29 no.1
• /
• pp.1-11
• /
• 2012

Objectives: The nurse visiting health service named Customized Visiting Health Care Program(CVHCP) requires the service innovations incorporating community support into a local service network. The purpose of this study was to assess the community network in CVHCP and inform improvement in this network. Methods: We used Social Network Analysis(SNA) in one CVHCP at H city. Network links were generated by self-administered questionnaires by the 14 community resource centers who quantified their links to all other 25 agents on the list. Links were analyzed by a dichotomous scale for any experience of collaboration and a scored scale of 0 to 3 for level of collaboration using UCINET v6. Results: A list of 14 agents was generated, and local network was dominated by the Public Health Center and a local welfare center named Unlimited Care Center(UCC). According to centrality score, UCC was the most prominent agent, and Public Health Center was the most influential agent, being a link in the pathway flow between other agents for 9.5% of contribution. CVHCP scored lower rank of prominent with 30.8% of other agents reported referring to it. Conclusions: Social network analysis provides a useful network description for informing and evaluation service network improvement in maximizing its service for the CVHCP.

• Structural Engineering and Mechanics
• /
• v.65 no.6
• /
• pp.707-719
• /
• 2018

In this article, a new method is introduced to improve the local search capability of meta-heuristic algorithms using the projection of the path on the border of constraints. In a mathematical point of view, the Gradient Projection Method is applied through a new approach, while the imposed limitations are removed. Accordingly, the gradient vector is replaced with a new meta-heuristic based vector. Besides, the active constraint identification algorithm, and the projection method are changed into less complex approaches. As a result, if a constraint is violated by an agent, a new path will be suggested to correct the direction of the agent's movement. The presented procedure includes three main steps: (1) the identification of the active constraint, (2) the neighboring point determination, and (3) the new direction and step length. Moreover, this method can be applied to some meta-heuristic algorithms. It increases the chance of convergence in the final phase of the search process, especially when the number of the violations of the constraints increases. The method is applied jointly with the authors' newly developed meta-heuristic algorithm, entitled Star Graph. The capability of the resulted hybrid method is examined using the optimal design of truss and frame structures. Eventually, the comparison of the results with other meta-heuristics of the literature shows that the hybrid method is successful in the global as well as local search.

• Fire Science and Engineering
• /
• v.34 no.2
• /
• pp.147-155
• /
• 2020

This paper presents a study on the development of a fire extinguishing agent and extinguishing system for an energy storage system (ESS) fire. The fire extinguishing agent designed to extinguish an ESS fire is a highly permeable fire extinguisher that reduces the surface tension and viscosity while bringing about cooling action. This is the main extinguishing effect of this type of wetting agent, which displays the characteristics of fire extinguishing agents used for penetrating the battery cells inside the ESS module. For the fire extinguishing system, a local application system was designed to suppress fire on a rack-by-rack basis. A 360° rotating nozzle was inserted into the rear hall of the ESS module, and general nozzles were installed in the rack to maximize the fire extinguishing effect. The fire extinguishing agent was strongly discharged by virtue of the gas release pressure. Experiments on fire suppression performance with ESS module 1 unit and module 3 units showed that all visible flames were extinguished in 8 s and 9 s, respectively, by the fire extinguishing agent. In addition, based on confirming reignition for 600 s after the fire extinguishing agent was exhausted, it was confirmed that the ESS fire was completely extinguished without reignition in all fire suppression performance experiments.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.4
• /
• pp.824-831
• /
• 2009

This paper proposes an obstacle avoidance algorithm for an autonomous mobile robot. The proposed method based on the circular navigation with probability distribution finds local-paths to avoid collisions. Futhermore, it makes mobile robots to achieve obstacle avoidance and optimal path planning due to the accurate decision of the final goal. Simulation results are included to show the feasibility of the proposed method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.146.1-146
• /
• 2001

The researches of science and engineering need the latest information from internet resources. But searching and filtering processes of appropriate web documents from huge internet resources are very complex as well as having some repeated procedures. In this paper, I propose a Personalized Agent System(PAS), which can filter World Wide Web Documents that the user is interested, such as papers. To do this, PAS uses a modified spreading activation neural network which 1 propose here. PAS observes the user´s local paper database to analyze, adapt and learn the user interests, and the then constructs the user-specified neural network model by the analyzed interests ...

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.123-144
• /
• 2014

Wireless sensor networks are generally deployed for specific applications to accomplish certain objectives over a period of time. To fulfill these objectives, it is crucial that the sensor network continues to function for a long time, even if some of its nodes become faulty. Energy efficiency and fault tolerance are undoubtedly the most crucial requirements for the design of an information extraction protocol for any sensor network application. However, most existing software agent based information extraction protocols are incapable of satisfying these requirements because of static agent itineraries and large agent sizes. This paper proposes an Information Extraction protocol based on Multiple software Agents with Dynamic Itineraries (IEMADI), where multiple software agents are dispatched in parallel to perform tasks based on the query assigned to them. IEMADI decides the itinerary for an agent dynamically at each hop using local information. Through mathematical analysis and simulation, we compare the performance of IEMADI with a well known static itinerary based protocol with respect to energy consumption and response time. The results show that IEMADI provides better performance than the static itinerary based protocols.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.2
• /
• pp.61-69
• /
• 2022

A multi-agent system is a system that aims at achieving the best-coordinated decision based on each agent's local decision. In this paper, we consider a multi agent-multi task assignment problem. Each agent is assigned to only one task and there is a completion probability for performing. The objective is to determine an assignment that maximizes the sum of the completion probabilities for all tasks. The problem, expressed as a non-linear objective function and combinatorial optimization, is NP-hard. It is necessary to design an effective and efficient solution methodology. This paper presents an approximation algorithm using submodularity, which means a marginal gain diminishing, and demonstrates the scalability and robustness of the algorithm in theoretical and experimental ways.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.11
• /
• pp.4244-4274
• /
• 2021

The utilization of UAVs in various fields has led to the development of flying ad hoc network (FANET) technology. In a network environment with highly dynamic topology and frequent link changes, the traditional routing technology of FANET cannot satisfy the new communication demands. Traditional routing algorithm, based on geographic location, can "fall" into a routing hole. In view of this problem, we propose a geolocation routing protocol based on multi-agent reinforcement learning, which decreases the packet loss rate and routing cost of the routing protocol. The protocol views each node as an intelligent agent and evaluates the value of its neighbor nodes through the local information. In the value function, nodes consider information such as link quality, residual energy and queue length, which reduces the possibility of a routing hole. The protocol uses global rewards to enable individual nodes to collaborate in transmitting data. The performance of the protocol is experimentally analyzed for UAVs under extreme conditions such as topology changes and energy constraints. Simulation results show that our proposed QLGR-S protocol has advantages in performance parameters such as throughput, end-to-end delay, and energy consumption compared with the traditional GPSR protocol. QLGR-S provides more reliable connectivity for UAV networking technology, safeguards the communication requirements between UAVs, and further promotes the development of UAV technology.