http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
생애초기스트레스와 불안정한 부모와의 유대관계가 의사결정유형과 음주동기에 미치는 영향
전재효(Jae-Hyo Jeon),장옥진(Og-Jin Jang),김기옥(Gi-Ok Kim),정영인(Young-In Chung) 한국중독정신의학회 2022 중독정신의학 Vol.26 No.1
Objective: The purpose of this study was to identify the effects of negative experience during childhood on drinking in adulthood. Methods: A total of 89 male subjects participated in the study and a survey was conducted July 1-July 31, 2019. Hierarchical regression analysis was conducted to confirm the relationships of early life stress (ELS) and insecure parental bonding (IPB) on decision-making style (DMS) and motivation for alcohol use (MA). Results: ELS and IPB had positive correlation with enhance and the coping subscore of MA. ELS and IPB had negative correlation with the rationality subscore of DMS and positive correlation with the intuition subscore of DMS. The regression analysis revealed ELS and IPB direct influence on enhance and coping among MA and rationality and intuition among DMS. These factors of DMS mediated the effects of ELS and IPB on enhance and coping of MA. Conclusion : This study found that early life stress and insecure parental bonding are related to irrationality and intuition among decision-making style and enhance and coping among motivation for alcohol use.
조성진,최봉완,전재효,Cho, Sung-Jin,Choi, Bong-Wan,Jeon, Jae-Hyo 한국군사과학기술학회 2010 한국군사과학기술학회지 Vol.13 No.5
It is not easy job to find a underwater target using sonar system in the ASW operations. Many researchers have tried to solve anti-submarine search problem aiming to maximize the probability of detection under limited searching conditions. The classical 'Search Theory' deals with search allocation problem and search path problem. In both problems, the main issue is to prioritize the searching cells in a searching area. The number of possible searching path that is combination of the consecutive searching cells increases rapidly by exponential function in the case that the number of searching cells or searchers increases. The more searching path we consider, the longer time we calculate. In this study, an effective algorithm that can maximize the probability of detection in shorter computation time is presented. We show the presented algorithm is quicker method than previous algorithms to solve search problem through the comparison of the CPU computation time.