http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : 변하영 (검색결과 45 건)
- 무료
- 기관 내 무료
- 유료
-
변하영,신희석,이은신,공민식,이승훈,이창희 대한재활의학회 2016 Annals of Rehabilitation Medicine Vol.40 No.2
Objective To assess the intra-rater and inter-rater reliability for measuring femoral anteversion angle (FAA) by a radiographic method using three-dimensional computed tomography reconstruction (3D-CT).Methods The study included 82 children who presented with intoeing gait. 3D-CT data taken between 2006 and 2014 were retrospectively reviewed. FAA was measured by 3D-CT. FAA is defined as the angle between the long axis of the femur neck and condylar axis of the distal femur. FAA measurement was performed twice at both lower extremities by each rater. The intra-rater and inter-rater reliability were calculated by intraclass correlation coefficient (ICC). Results One hundred and sixty-four lower limbs of 82 children (31 boys and 51 girls, 6.3±3.2 years old) were included. The ICCs of intra-rater measurement for the angle of femoral neck axis (NA) were 0.89 for rater A and 0.96 for rater B, and those of condylar axis (CA) were 0.99 for rater A and 0.99 for rater B, respectively. The ICC of inter-rater measurement for the angle of NA was 0.89 and that of CA was 0.92. By each rater, the ICCs of the intra-rater measurement for FAA were 0.97 for rater A and 0.95 for rater B, respectively and the ICC of the inter-rater measurement for FAA was 0.89. Conclusion The 3D-CT measures for FAA are reliable within individual raters and between different raters. The 3D-CT measures of FAA can be a useful method for accurate diagnosis and follow-up of femoral anteversion.
-
변하영,정호연,최혜정,이중훈,오민균,윤철호,신희석,이은신 대한뇌신경재활학회 2014 뇌신경재활 Vol.7 No.2
Terson syndrome is a vitreous hemorrhage associated with subarachnoid hemorrhage. This can be caused by spontaneous, aneurysmal rupture or traumatic subarachnoid hemorrhage, but never has been reported as a consequence of hemorrhage due to thrombolysis and thrombectomy treatments of acute ischemic stroke patient. A 48-year-old man presented with left sided weakness was diagnosed as cerebral infarction on right middle cerebral artery territory due to complete occlusion of right distal internal carotid, middle cerebral, and anterior cerebral artery. He underwent thrombolysis and mechanical thrombectomy, and subarachnoid hemorrhage developed. Later, visual disturbance on right eye occurred so he was consulted to ophthalmology. Vitreous hemorrhage was found and surgery was recommended after two weeks of observation. After pars planar vitrectomy, visual acuity improved, along with functional ability. Therefore, possibilities of Terson syndrome in patients with subarachnoid hemorrhage have to be kept in mind to improve not only visual acuity but also rehabilitation outcome.
-
-
-
변하영,박철원 대한이비인후과학회 2019 대한이비인후과학회지 두경부외과학 Vol.62 No.10
With an introduce of virtual reality (VR) technology, the issue of unpleasant side effect of VRimmersion has been raised as “cybersickness.” Although exact mechanism of cybersickness isstill elusive, sensory conflict theory has been generally accepted as in classic motion sickness. The absence of expected correlated vestibulo-proprioceptive sensory information during VRexperience causes sensory conflict, which leads to dizziness, disorientation, nausea and fatigue. Herein, we review the recent literature to build the conceptual scheme for understandingcybersickness. From the brief description of motions sickness, assessment and managementof cybersickness is also outlined.
-
영역 분할 사분 트라이에 블룸 필터 선 검색을 사용한 패킷 분류 알고리즘
변하영(Hayoung Byun),임혜숙(Hyesook Lim) 한국정보과학회 2015 정보과학회논문지 Vol.42 No.8
영역분할을 이용한 패킷분류의 대표적인 알고리즘인 영역분할 사분 트라이(area-based quadtrie, AQT)는 검색 시 룰 노드를 만나도 더 높은 우선순위의 룰이 있을 수 있어 트라이의 끝까지 검색해야 하는 문제가 있다. 리프-푸싱(leaf-pushing) AQT는 모든 검색 경로에 룰 노드를 하나만 위치시켜 검색 성능을 높인 알고리즘이다. 본 논문에서는 리프-푸싱 AQT를 해시 테이블 기반으로 구현하고 블룸필터를 적용해 검색 성능을 더욱 향상시킨 알고리즘을 제안한다. 제안하는 알고리즘에서는 온-칩(on-chip) 블룸필터를 연쇄적으로 우선 검색하여 룰 노드의 레벨을 알아낸 후, 오프-칩(off-chip)에 저장된 룰 노드에 접근한다. 실험을 통해 적절한 크기의 블룸필터를 사용하여 평균 한 번의 해시테이블 접근만으로 패킷분류를 수행할 수 있음을 보았으며, 메모리 사용량 및 검색 성능에 있어 기존의 알고리즘과 제안하는 구조의 성능을 비교하였다. As a representative area-decomposed algorithm, an area-based quad-trie (AQT) has an issue of search performance. The search procedure must continue to follow the path to its end, due to the possibility of the higher priority-matching rule, even though a matching rule is encountered in a node. A leaf-pushing AQT improves the search performance of the AQT by making a single rule node exist in each search path. This paper proposes a new algorithm to further improve the search performance of the leaf-pushing AQT. The proposed algorithm implements a leaf-pushing AQT using a hash table and an on-chip Bloom filter. In the proposed algorithm, by sequentially querying the Bloom filter, the level of the rule node in the leaf-pushing AQT is identified first. After this procedure, the rule database, which is usually stored in an off-chip memory, is accessed. Simulation results show that packet classification can be performed through a single hash table access using a reasonable sized Bloom filter. The proposed algorithm is compared with existing algorithms in terms of the memory requirement and the search performance.
-
변하영(Hayoung Byun),이정원(Jungwon Lee),임혜숙(Hyesook Lim) 대한전자공학회 2017 전자공학회논문지 Vol.54 No.1
카운팅 블룸필터는 표준 블룸필터에서 제공하지 못하는 삭제 기능을 제공하여, 동적 집합에 대한 멤버쉽 쿼리를 허용하므로, 다양한 네트워크 알고리즘과 어플리케이션에 널리 사용된다. 그러나 카운팅 기능으로 인해 표준 블룸필터에는 없었던 오버플로우가 발생할 수 있고 이에 따라 거짓 음성이 발생할 수 있다. 4-비트 카운팅 블룸필터가 일반적으로 많이 사용되는데, 이는 모든 카운터에 4 비트를 할당하므로 메모리를 낭비한다는 단점이 있다. 거짓 음성의 가능성을 제거하고 메모리 사용량을 줄이기 위해서, 본 논문은 카운팅 블룸필터의 변형인 터너리 블룸필터(Ternary Bloom filter)를 제안한다. TBF는 하나의 카운터에 2개 이상의 원소가 대응될 경우, 더 이상의 삽입이나 삭제가 불가능하게 정한 구조이다. 실험을 통해 4-비트 카운팅 블룸필터와 같은 크기의 메모리 사용 시 TBF는 거짓 음성을 발생시키지 않을 뿐 아니라 거짓 양성률에 있어서도 상당한 우위를 보임을 확인하였다. Counting Bloom filters (CBFs) have been popularly used in many network algorithms and applications for the membership queries of dynamic sets, since CBFs can provide delete operations, which are not provided in a standard 1-bit vector Bloom filter. However, because of the counting functions, a CBF can have overflows and accordingly false negatives. CBFs composed of 4-bit counters are generally used, but the 4-bit CBF wastes memory spaces by allocating 4 bits for every counter. In this paper, we propose a simple alternative of a 4-bit CBF named ternary Bloom filter (TBF). In the proposed TBF structure, if two or more elements are mapped to a counter in programming, the counters are not used for insertion or deletion operations any more. When the TBF consumes the same amount of memory space as a 4-bit CBF, it is shown through simulation that the TBF provides a better false positive rate than the CBF as well as the TBF does not generate false negatives.
-
-
변하영(Hayoung Byun),임혜숙(Hyesook Lim) 대한전자공학회 2017 대한전자공학회 학술대회 Vol.2017 No.6
Key-value data structures, which return a value corresponding to an input key, are commonly used in many applications. Hashing is a representative key-value data structure. However, as the load factor of the hash table increases, the number of collisions increases, and unsaved elements cause false results. In this paper, we propose to use a functional Bloom filter instead of the hash table. While the hash table should store the signature of each input key in addition to the return value, the functional Bloom filter stores values only. Simulation results show that the functional Bloom filter is more efficient than hashing-based data structures such as hashing with a linked list, cuckoo hashing, and d-left hashing. Especially when the load factor is close to 1, while the number of incorrect results increases in hashing-based data structures because of collisions, the functional Bloom filter provides more accurate results using the same amount of memory.
-
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
