http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
자살 및 자해로 응급실에 내원한 환자의 나이군에 따른 사망 위험도 분석
문종영,조진성,최우성,최재연,장재호,우재혁,임용수 대한응급의학회 2021 대한응급의학회지 Vol.32 No.3
Objective: Previous studies lacked an accurate analysis of age-specific mortality because they included either a single hospital’s data or survey-based method, rather than the patient’s information from the emergency room (ER). Therefore, this study analyzed the mortality risk by age group among patients who visited the ER with suicidal attempts using large-scale data. Methods: Data were collected from the in-depth surveillance data of injury among patients who visited the ERs of 23 hospitals from January 2011 to December 2018. Their ages were divided into 10-year ranges for patients aged 15 years or older (15-24, 25-34, 35-44, 45-54, 55-64, 65-74, and ≥75 years). The patients’ sex, alcohol consumption before the injury, time of injury, place of injury, ambulance used for transport to the ER, disposition at the ER, and total deaths were investigated. Results: The number of patients was 41,257, of which 38,229 (92.7%) survived and 3,082 (7.3%) died. The proportions of patients in each group who died from suicidal attempts in the 15-24, 25-34, 35-44, 45-54, 55-64, 65-74, and ≥75 years groups were 2.7%, 3.1%, 5.4%, 7.8%, 12.0%, 18.5%, and 21.8%, respectively (P<0.001). A statistically positive-response relationship was noted (P trend<0.001). As a result of adjusting for sex, age, place of injury, time of injury, and alcohol consumption in multivariate logistic regression analysis, and the odds ratios of deaths were 1.70, 2.37, 2.86, 5.18, 5.48, and 6.41, respectively (reference, 15-24 years). Moreover, compared to women, the men’s odds ratio of death was 1.58. Conclusion: Among patients who visited the ER due to suicidal attempts, those of advanced age and males have high mortality.
"계층 상태공간 축약방법"에 기반한 효율적인 상호운용성 시험 방법론
최영한,진병문,이동익,진성일,Choe, Young-Han,Chin, Byoung-Moon,Lee, Dong-Ik,Jin, Seong-Il 한국정보처리학회 1998 정보처리논문지 Vol.5 No.8
상호운용성은 정보기술 및 통신분야에서 가장 중요한 요소의 하나이다. 본 논문에서는 상호운용성에 관한 시험방법 및 시험 스위트의 생산에 대하여 논의하고 있다. 적합성시험을 비롯하여 정형적인 검즈에서 가장 먼저 고려되는 치명적인 문제점은 상태공간의 폭발에 관한 사항이며 이는 상호운용성의 시험방법 및 시험 스위트의 개발에 있어서도 가장 먼저 해결되어야 할 문제이다. 본 논문에서는 페트리네트를 이용한 상운용성 시험을 지원하기 위해 새로운 상태 공간 축약 방법을 제시하며 이를 이용한 상호운용성의 시험방법 및 시험 스위트 생성 방안을 IOSM, Quasi stable state 등을 이용하여 HOSS에 기반한 상태축약 결과를 보임으로써 상호운용성시험을 효율적으로 지원하는 방안을 제시한다. Interoperability(lOP) is one of the major goal of Information Technology and Telecommunication fields. In this paper, we discuss dcvclOlJing an interoperabiiity testing(IOPT) method. As is easily gueOisecl from conformance testing and formal verification. state space explosion problem is the most serious problem we encounter in deriving interoperability test method and its test suite. A new state space reduction method to support interoperability testing is suggested based on Petri nets. The proposed test method can be applied to 1 to many communication protocols as well as 1 to 1 communication protocols efficiently
김덕상,진성문,김백철,Nguyen Huu Chuc,Ngyuen Huu Lam Vuong,안광준,Vuong Hong Phuc,구자춘,문형필,이영관,남재도,최혁렬 제어로봇시스템학회 2009 제어로봇시스템학회 합동학술대회 논문집 Vol.2009 No.12
In this paper, we have proposed the novel tactile sensor using dielectric elastomer. Our sensor can be considered as a capacitive tactile sensor. A capacitive tactile sensor is based on a capacitor, where the dielectric is made of a compliant material so that the capacitance changes due to the strain exerted on the sensor. In the proposed design, capacitive tactile sensor is implemented using commercially available capacitance to digital converter integrated circuits(CDC), commonly used for example in cell phones. When we touch the sensor surface, the CDC detects the variation of a capacitance and we can know the position of touch through the array of electrodes on the surface. In this paper, we describe the structure of the sensor, material, fabrication process, system configuration and experimental results.
계층 상태공간 축약방법에 기반한 효율적인 상호운용성 시험 방법론
최영한(Choe Young Han),진병문(Chin Byoung Moon),이동익(Lee Dong IK),진성일(Jin Seong II) 한국정보처리학회 1998 정보처리학회논문지 Vol.5 No.8
Interoperability(IOP) is one of the major goal of Information Technology and Telecommunication fields. In this paper, we discuss developing an interoperability testing(IOPT) method. As is easily guessed from conformance testing and formal verification, state space explosion problem is the most serious problem we encounter in deriving interoperability test method and its test suite. A new state space reduction method to support interoperability testing is suggested based on Petri nets. The proposed test method can be applied to 1 to many communication protocols as well as 1 to 1 communication protocols efficiently.
최적 경로 및 충돌 회피를 위한 다개체 모바일 로봇의 동적 경로 계획 알고리즘
최병준(Byung June Choi),진성문(Sung Miin Jin),박재훈(Jaehoon Park),김범수(Bum-Soo Kim),문형필(Hyungpil Moon),구자춘(Ja Choon Koo),정완균(Wankyun Chung),최혁렬(Hyouk Ryeol Choi) 대한기계학회 2008 대한기계학회 춘추학술대회 Vol.2008 No.5
Motion planning of multiple mobile robots is one of the challenging problems in robotics. In this paper, we present a dynamic path planning algorithm for multiple mobile robots using D* Lite algorithm. A native approach of path planning for multiple robots is to assign of priorities to individual robot and to move the robots in a sequential way based on the priorities. While these methods are very convenient, it may cause congestions when many robots need to go through narrow passage. Moreover, deciding priorities would be problematic when the number of robots is very large. The key idea of our approach is to generate detour path in an optimal way. In the first path planning step, each robot computes its optimal path using D<SUP>*</SUP> Lite, without any consideration of the paths of the other robots. When each robot moves to follow its own trajectory, some robots may collide with other. In this case, the robots that are involved in collision generate detour path using D<SUP>*</SUP> Lite algorithm which is known for finding detour path optimally. Then, by considering the total distance of all the robots, it is determined which robot takes detour and which robot takes the original path. Our approach can find a solution that minimizes the overall path length. The proposed dynamic path planning algorithm is validated by simulation experiments.