Diagnostic Value of Functional Bladder Capacity, Urine Osmolality, and Daytime Storage Symptoms for Severity of Nocturnal Enuresis

김준모 대한비뇨의학회 2012 Investigative and Clinical Urology Vol.53 No.2

Purpose: To investigate the correlation between functional bladder capacity, first morning urine osmolality, daytime voiding symptoms, and severity of nocturnal enuresis. Materials and Methods: We assessed a total of 101 children with nocturnal enuresis (mean age, 7.7±2.3 years). Patients were divided into three groups according to the severity of enuresis: (1) one to six episodes per week (46 cases, 45.5%), (2) one episode every day (29 cases, 28.7%), and (3) multiple episodes every day (26 cases, 25.8%). Baseline parameters were obtained from frequency volume charts for 2 days, first morning urine osmolality, and a questionnaire for the presence of frequency, urgency, and daytime incontinence. Results: The severity of enuresis increased with younger age (p=0.037) and reduced functional bladder capacity (p=0.007) and daytime symptoms of frequency and daytime incontinence (p=0.012, p=0.036). No statistical difference in urine osmolality or urgency was found among the three groups. Both reduced functional bladder capacity and low urine osmolality increased according to the severity of enuresis (p=0.012). Conclusions: In children with nocturnal enuresis, severity was increased by younger age, reduced functional bladder capacity, and the presence of daytime voiding symptoms of frequency and daytime incontinence. The incidence of small functional bladder capacity was increased in children with everyday wetting, and the incidences of both small functional bladder capacity and low urine osmolality were increased in children with everyday multiple wetting. Purpose: To investigate the correlation between functional bladder capacity, first morning urine osmolality, daytime voiding symptoms, and severity of nocturnal enuresis. Materials and Methods: We assessed a total of 101 children with nocturnal enuresis (mean age, 7.7±2.3 years). Patients were divided into three groups according to the severity of enuresis: (1) one to six episodes per week (46 cases, 45.5%), (2) one episode every day (29 cases, 28.7%), and (3) multiple episodes every day (26 cases, 25.8%). Baseline parameters were obtained from frequency volume charts for 2 days, first morning urine osmolality, and a questionnaire for the presence of frequency, urgency, and daytime incontinence. Results: The severity of enuresis increased with younger age (p=0.037) and reduced functional bladder capacity (p=0.007) and daytime symptoms of frequency and daytime incontinence (p=0.012, p=0.036). No statistical difference in urine osmolality or urgency was found among the three groups. Both reduced functional bladder capacity and low urine osmolality increased according to the severity of enuresis (p=0.012). Conclusions: In children with nocturnal enuresis, severity was increased by younger age, reduced functional bladder capacity, and the presence of daytime voiding symptoms of frequency and daytime incontinence. The incidence of small functional bladder capacity was increased in children with everyday wetting, and the incidences of both small functional bladder capacity and low urine osmolality were increased in children with everyday multiple wetting.

무선호출 발전방향 및 서울이동통신 서비스계획

김준모 한국통신학회 1996 정보와 통신 Vol.13 No.1

최소 개수의 스타이너 포인트를 위한 근사 비율 2

김준모,김인범 한국정보과학회 2003 정보과학회논문지 : 시스템 및 이론 Vol.30 No.8

본 논문은 STP-MSP을 위한 근사 알고리즘을 제안한다. 이 문제에 대해 근접한 최적 해법을 제공하는 PTAS를 가지는 것이 불가능하기 때문에, 본 논문의 연구는 nO(1)의 실행 시간과 근사 비율 2를 가지는 하나의 대안을 제시한다. 본 연구의 중요성은 관련된 다른 미해결문제에 대하여 해결 가능성을 제시하는 것이다. 본 논문의 주요 제안내용은 문제 인스턴스에게 허용오차를 배분하는 것이다. 이로 인해 우리는 무한적 경우에서 다항적 범위로 실행시간을 줄일 수 있다. 관련연구[1,2]가 근사 비율이 2보다 크지만 보다 현실적인 실행시간을 갖는 근사 알고리즘들을 제시한 것이라면, 본 연구는 근사 비율이 2인 근사 알고리즘의 존재를 밝힌 것이다. This paper provides an approximation algorithm for STP-MSP(Steiner Tree Problem with Minimum number of Steiner Points). Because it seems to be impossible to have a PTAS(Polynomial Time Approximation Schemes), which gives the near optimal solutions, for the problem, the algorithm of this paper is an alternative that has the approximation ratio 2 with nO(1) run time . The importance of this paper is the potential to solve other related unsolved problems. The idea of this paper is to distribute the error allowance over the problem instance so that we may reduce the run time to polynomial bound out of infinitely many cases. There are earlier works[1,2] that show the approximations that have practical run times with the ratio of bigger than 2, but this paper shows the existence of a poly time approximation algorithm with the ratio 2.

최소 개수의 스타이너 포인트를 위한 근사 비율 2

김준모,김인범 한국정보과학회 2003 정보과학회논문지 : 시스템 및 이론 Vol.30 No.7

본 논문은 STP-MSP을 위한 근사 알고리즘을 제안한다. 이 문제에 대해 근접한 최적 해법을 제공하는 PTAS를 가지는 것이 불가능하기 때문에, 본 논문의 연구는 $n^{O(1)}$의 실행 시간과 근사 비율 2를 가지는 하나의 대안을 제시한다. 본 연구의 중요성은 관련된 다른 미해결문제에 대하여 해결 가능성을 제시하는 것이다. 본 논문의 주요 제안내용은 문제 인스턴스에게 허용오차를 배분하는 것이다. 이로 인해 우리는 무한적 경우에서 다항적 범위로 실행시간을 줄일 수 있다. 관련연구[1,2]가 근사 비율이 2보다 크지만 보다 현실적인 실행시간을 갖는 근사 알고리즘들을 제시한 것이라면, 본 연구는 근사 비율이 2인 근사 알고리즘의 존재를 밝힌 것이다. This paper provides an approximation algorithm for STP-MSP(Steiner Tree Problem with minimum number of Steiner Points).Because it seems to be impossible to have a PTAS(Polynomial Time Approximation Schemes), which gives the near optimal solutions, for the problem, the algorithm of this paper is an alternative that has the approximation ratio 2 with $n^{O(1)}$ run time. The importance of this paper is the potential to solve other related unsolved problems. The idea of this paper is to distribute the error allowance over the problem instance so that we may reduce the run time to polynomial bound out of infinitely many cases. There are earlier works[1,2] that show the approximations that have practical run times with the ratio of bigger than 2, but this paper shows the existence of a poly time approximation algorithm with the ratio 2.

Generation of Dynamic Routing Information by using Balanced Howell Rotations

김준모,Kim, Joon-Mo The Institute of Electronics and Information Engin 2011 電子工學會論文誌-TC (Telecommunications) Vol.40 No.7

통신 노드들이 이동 중인 mobile ad hoc networks에서, 통신처리율에 따라 노드 쌍들의 순위를 결정하면, 이를 바탕으로 전체 네트워크의 처리율을 향상시키는 동적인 라우팅을 할 수 있다. Balanced Howell rotations는 브리지 게임을 위한 토너먼트 구성 방법의 하나이다. 본 논문에서는 mobile ad hoc networks의 전반적인 통신 처리율 향상을 위해 balanced Howell rotations를 활용할 수 있음을 설명한다. 그리고 balanced Howell rotations가 존재할 수 있는 조건을 제시하고, 이를 증명한다. In mobile ad hoc networks where the communication nodes are moving around, one may perform dynamic routing that can increase the total communication throughput of the network, by determining the ranks of pairs of nodes according to their communication throughput. The balanced Howell rotation is a tournament design scheme for bridge games. This paper explains that the balanced Howell rotation can be applied to enhance the overall communication throughput of mobile ad hoc networks, and proposes and proves the condition under which the balanced Howell rotations may exist.

Phospholipase D activity is elevated in hepatitis C virus core protein-transformed NIH3T3 mouse fibroblast cells

김준모,최복희,장경립,민도식 생화학분자생물학회 2004 Experimental and molecular medicine Vol.36 No.5

Hepatitis C Virus (HCV) is associated with a severe liver disease and increased frequency in Overexpresion of HCV core protein is known to transform fibroblast cells. Phospholipase D (PLD) activity is comonly elevated in response to mitogenic signals, and has also ben overex-pressed and hyperactivated in some human cancer cels. The aim of this study was to understand how PLD was regulated in the HCV core protein-transformed NIH3T3 mouse fibro-blast cels. We observed that PLD activity was elevated in the NIH3T3 cels overexpresing HCV core protein over the vector alone-trans-of PLD protein and protein kinase C (PKC) in the HCV core protein-transformed cels was si-milar to the control cells. Phorbol 12-myristate 13-acetate (PMA), which is known to activate PKC, stimulated PLD activity significantly more in the core protein-transformed cels, in com-parison with that of the control cels. PLD activity assay using PKC isozyme-specific inhi-bitor and PKC translocation experiment showed that PKC-δ was mainly involved in the PMA- cells. Moreover, in cells overexpresing HCV core protein, PMA also stimulated p38 kinase more potently than that of the control cels, and an inhibitor of p38 kinase abolished PMA-in-duced PLD activation in cells overexpressing HCV core protein. Taken together, these results sugest that PLD might be implicated in core protein-induced transformation.

오디오 딥페이크 탐지를 위한 안전한 워터마킹

김준모,한창희 한국정보보호학회 2024 정보보호학회논문지 Vol.34 No.6

디지털 기술의 발전으로 딥페이크 기법은 변조된 음성을 생성하여 디지털 통신의 무결성에 심각한 위험을 초래하고 있다. 이러한 문제를 해결하기 위해 본 논문에서는 암호학적으로 안전한 워터마크를 오디오 파일에 직접 삽입하는 디지털 오디오 워터마킹 기법을 제안한다. 본 접근법은 암호화 해시 함수를 활용하여 비인가된 수정에 극도로 민감한 고유 워터마크를 생성한다. 이 워터마크는 딥페이크 조작이 발생할시, 즉시 파괴되어 변조의 명확한 표시를 제공한다. 신호 대비 잡음비 (Signal-to-Noise Ratio)과 원본과 워터마킹된 오디오의 상호 상관 (Cross Correlation) 평가 지표를 사용하여 워터마킹 시스템의 성능을 평가한 결과, 본 워터마크 방식은 높은 수준의 오디오 무결성을 보장한다. 또한 StarGAN 음성 변환, PPG 음성 변환 등 실제 딥페이크 공격에 대해 테스트를 거친 결과, 제안기법으로 워터마킹이 삽입된 음성은 딥페이크 변조 후 즉시 파괴됨을 검증했다. 본 연구 결과는 오디오의 무결성과 딥페이크 저항성을 크게 필요로 하는 미디어, 법률, 안전한 통신 등 다양한 분야에 적용 가능할 것으로 기대된다. With the advancement of digital technology, deepfake techniques have increasingly posed serious threats to the integrity of digital communication by generating manipulated voices. To address this issue, we propose a cryptographically secure digital audio watermarking technique that directly embeds a watermark into audio files. Our approach utilizes cryptographic hash functions to create a unique watermark that is highly sensitive to unauthorized modifications. This watermark is destroyed immediately when a deepfake manipulation occurs, providing a clear indication of tampering. We evaluate the performance of the watermarking system using signal-to-noise ratio and cross-correlation metrics to measure the similarity between the original and watermarked audio. The results show that our watermarking method ensures a high level of audio integrity. Furthermore, tests against real-world deepfake attacks, such as StarGAN voice conversion and PPG voice conversion demonstrate that the watermarked audio is immediately destroyed after deepfake manipulation. We expect that the proposed watermarking scheme is applicable across various fields requiring strong audio integrity and resistance to deepfake tampering, including media, legal sectors, and secure communications.

국가발전과 공공정책관리 / 제3회의 제3분과 : 통상산업정책 : 비교 지역산업정책의 방향 모색 : 대구 섬유산업을 중심으로

김준모 한국정책학회 1998 한국정책학회 동계학술발표논문집 Vol.1998 No.0

N/A

NF3 / O2 플라즈마를 이용한 Silylated Resist의 2-Step Etch 연구

김준모,김진용,김명선,박찬동,설여송,박혜성,최수한 대한전자공학회 1994 대한전자공학회 학술대회 Vol.1994 No.1

방광암에서 새로운 종양표지자로 요중 Survivin의 발현

김준모,이광우,김영호,박성규,이유경,김민의 대한비뇨의학회 2004 Investigative and Clinical Urology Vol.45 No.12