• Title/Summary/Keyword: 경합

Search Result 446, Processing Time 0.026 seconds

THE STUDY ON THE PREDICTION OF THE MESIODISTAL DIAMETERS OF UNERUPTED CANINES AND PREMOLARS IN KOREAN MALE AND FEMALE (미맹출 영구 견치 및 소구치 근원심 폭경 추정에 관한 연구)

  • Hwang, Min-Sung;Kim, Jung-Wook;Jang, Ki-Taeg;Lee, Sang-Hoon
    • Journal of the korean academy of Pediatric Dentistry
    • /
    • v.29 no.1
    • /
    • pp.115-124
    • /
    • 2002
  • The purpose of this study was to establish regression equations and probability charts for predicting the sum of mesiodistal crown diameters of unerupted unilateral canine and premolars from the sum of mesiodistal crown diameters of four mandibular incisors in Korean male and female. The plaster casts of 162 children(75 boys and 87 girls) among the contestees in 1994-2001 Healthy Dentition Contest in Seoul were measured. Sex differences are compared and the following results were obtained: 1. Bilateral comparison of sum of widths of permanent canine and premolars showed no significant differences for either sex(p>0.05). Sum of widths of permanent canine and premolars of male were significantly larger than that of female(p<0.01). 2. Regression equations for the prediction of sum of widths of permanent canine and premolars in each sex were as follows Male ${\Sigma}Maxillary$ 345 y= 10.45+0.53x Male ${\Sigma}Mandibular$ 345 : y= 10.07+0.51x Female ${\Sigma}Maxillary$ 345 : y=12.65+0.42x Female ${\Sigma}Mandibular$ 345 : y=11.70+0.42x Male+female ${\Sigma}Maxillary$ 345 y=11.01+0.50x Male+female ${\Sigma}Mandibular$ 345 : y=9.87+0.51x

  • PDF

DVFS based Memory-Contention Aware Scheduling Method for Multi-threaded Workloads (멀티쓰레드 워크로드를 위한 DVFS 기반 메모리 경합 인지 스케줄링 기법)

  • Nam, Yoonsung;Kang, Minkyu;Yeom, HeonYoung;Eom, Hyeonsang
    • KIISE Transactions on Computing Practices
    • /
    • v.24 no.1
    • /
    • pp.10-16
    • /
    • 2018
  • The task of consolidating server workloads is critical for the efficiency of a datacenter in terms of reducing costs. However, as a greater number of workloads are consolidated in a single server, the performance of workloads might be degraded due to their contention to the limited shared resources. To reduce the performance degradation, scheduling for mitigating the contention of shared resources is necessary. In this paper, we present the Dynamic Voltage Frequency Scaling (DVFS) based memory-contention aware scheduling method for multi-threaded workloads. The proposed method uses two approaches: running memory-intensive threads on the limited cores to avoid concurrent memory accesses, and reducing the frequencies of the cores that run memory-intensive threads. With the proposed algorithm, we increased performance by 43% and reduced power consumption by 38% compared to the Completely Fair Scheduler(CFS), the default scheduler of Linux.

On-the -fly Detection of the First Races for Shared-Memory Parallel Programs with Ordered Synchronization (순서적 동기화를 포함하는 공유 메모리 병렬프로그램에서의 수행중 최초경합 탐지 기법)

  • Park, Hui-Dong;Jeon, Yong-Gi
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.8
    • /
    • pp.884-894
    • /
    • 1999
  • 순서적 동기화 및 내포 병렬성을 포함하는 공유메모리 병렬 프로그램에서의 경합(race)은 프로그램 수행에서 원하지 않은 비결정성(nondeterminism)을 야기할 수 있기 때문에 반드시 탐지되어져야 한다. 특히 프로그램 수행에서 최초경합(first race)을 탐지하는 것은 중요한데, 그 이유는 이 경합을 제거하면 다른 경합이 나타나지 않을 수도 있기 때문이다. 본 논문에서는 결정적 공유메모리 병렬프로그램을 위한 2단계 수행중 (two-pass on-the-fly) 최초경합 탐지 기법을 제시하며, 이것은 공유메모리 병렬 프로그램의 특정 수행에서 "최초로 발생되는" 경합들을 탐지하는 기법이다. 그리고 HPF 컴파일러를 이용하여 본 탐지 프로토콜을 공인된 벤치마크 프로그램에 적용하여, 병렬 프로그램 디버깅 시 고려하여야 할 파라미터들에 대한 실험으로부터 본 기법의 효율성을 보였다.Abstract Detecting races is important in debugging shared-memory parallel programs which have ordered synchronization and nested parallelism, because the races result in unintended non- deterministic executions of the programs. The first races are important in debugging, because the removal of such races may make other races disappear. It is even possible that all races reported would disappear once the first races are removed. This paper presents a new two-pass on-the-fly algorithm to detect the first races in such parallel programs. The algorithm reported in this paper is an on-the-fly algorithm that detects the races that "occur first" in a particular execution of shared-memory parallel programs. The experiment has accomplished, where two certified benchmark programs which can be executed under High Performance Fortran environments to get some parameters which improve debugging performance with our algorithm. with our algorithm.

Evaluation of Running Safety and Ride Comfort for High Speed Train in Cases of Superimposition of Vertical and Horizontal Curves (종곡선과 평면곡선의 경합조건별 차량주행안전성 및 승차감 평가)

  • Um, Ju-Hwan;Choi, IL-Yoon;Kim, Man-Cheol
    • Journal of the Korean Society for Railway
    • /
    • v.16 no.4
    • /
    • pp.311-317
    • /
    • 2013
  • In railway construction, superimposition of horizontal and vertical curves has critical effects on the running stability and the ride comfort of vehicles as well as on construction costs. In this study, running safety, ride comfort, and track acting forces were analyzed by a numerical analysis using the VAMPIRE program according to cases of superimposition of vertical and horizontal curves. From the analysis results, it was found that running safety, riding comfort, and track acting forces in the case of superimposition of vertical and horizontal curves as well as vertical and transition curves meet all of the criteria. Also, in the case of the superimposition of vertical curves and curvature change between horizontal transition curves and circular curves meet all of the criteria.

Understanding the Experience of Visual Change Detection Based on the Experience of a Sensory Conflict Evoked by a Binocular Rivalry (양안경합의 감각적 상충 경험에 기초한 시각적 변화탐지 경험에 대한 이해)

  • Shin, Youngseon;Hyun, Joo-Seok
    • Science of Emotion and Sensibility
    • /
    • v.16 no.3
    • /
    • pp.341-350
    • /
    • 2013
  • The present study aimed to understand the sensory characteristic of change detection by comparing the experience of detecting a salient visual change against the experience of detecting a sensory conflict evoked by a binocular mismatch. In Experiment 1, we used the change detection task where 2, 4, or 6 items were short-term remembered in visual working memory and were compared with following test items. The half of change-present trials were manipulated to elicit a binocular rivalry on the test item with the change by way of monocular inputs across the eyes. The results showed that change detection accuracy without the rivalry manipulation declined evidently as the display setsize increased whereas no such setsize effect was observed with the rivalry manipulation. Experiment 2 tested search efficiency for the search array where the target was designated as an item with the rivalry manipulation, and found the search was very efficient regardless of the rivalry manipulation. The results of Experiment 1 and 2 showed that when the given memory load varies, the experience of detecting a salient visual change become similar to the experience of detecting a sensory conflict by a binocular rivalry.

  • PDF

Correlation between Crowding and Binocular Rivalry depending on eccentricity (과밀 효과와 양안 경합의 이심률별 상관관계)

  • Kim, Sang-Rae;Chong, Sang-Chul
    • Korean Journal of Cognitive Science
    • /
    • v.21 no.2
    • /
    • pp.233-251
    • /
    • 2010
  • Crowding effect is the impairment of peripheral object identification due to nearby objects. Binocular rivalry is a phenomenon in which perception alternates between two different objects presented separately to each eye. The purpose of this study was to investigate the correlation between these two phenomena. We measured the magnitudes of visibility index of these two effects at 8 different locations of 3 different eccentricities (2, 5, and $10^{\circ}$). Significant positive correlation between the two measurements was found only near the fovea ($2^{\circ}$). Our study is the demonstration to show relationship between crowding and binocular rivalry.

  • PDF

An Empirical Comparison of Monitoring Filtering Techniques for Dynamic Data Race Detection in Parallel Programs with OpenMP Directives (OpenMP 디렉티브 병렬프로그램에서의 동적 자료경합 탐지를 위한 감시 필터링 기술의 실험적 비교)

  • Cho, Ahra;Ha, Ok-Kyoon
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2016.07a
    • /
    • pp.1-2
    • /
    • 2016
  • 다중 스레드 기반 병렬 프로그램에서의 자료경합 탐지는 동시에 수행되는 스레드 간의 비결정적인 상호작용 때문에 탐지하기 어려운 것으로 잘 알려져 있다. 동적 분석기술을 사용하여 자료경합을 탐지할 경우 프로그램 수행의 감시와 충돌하는 모든 메모리 연산의 분석을 위해 추가적인 오버헤드가 발생한다는 단점이 있다. 이러한 동적 분석의 추가적인 오버헤드를 줄이는 방법으로 감시 필터링 기술이 소개되고 있으며, 본 논문에서는 동적 자료경합 탐지를 위한 감시 필터링 기술 중 OpenMP 디렉티브 병렬 프로그램에 적용 가능한 두 기술을 대상으로 실용성과 효율성을 실험적으로 비교한다.

  • PDF

Railway Conflict Detection Design for KORAIL Command Center Intergration Signal Equipment Construction Project (철도청 사령실통합 신호설비 구축 프로젝트에서의 경합검지의 설계)

  • Lee Ju-Wang;Kim Bum-Sik;Bum Young-Hyun;Hong Hyo-Sik;Yoo Kwang-Kyun
    • Proceedings of the KSR Conference
    • /
    • 2004.10a
    • /
    • pp.1519-1525
    • /
    • 2004
  • 현재 사용되고 있는 열차운행관리 시스템(Railway Traffic Management System, RTMS)에서 경합 검지 및 해소업무는 역 및 선로의 정보(상태)연계 및 자동화의 미비로 인하여 착발선 결정, 착발시간 결정, 교행역, 대피역등에서 발생하는 경합 검지 및 해소(Railway Conflict Detection and Resolution)의 결정이 신속하게 이루어지지 못하고 있다. 본 논문은 국내외적으로 적용하고 있는 열차 경합 검지 방법을 조사 비교하여 가장 적절한 알고리즘을 개발, 구현하여 현재 진행중인 철도청 사령실 통합 신호설비 구축사업 프로젝트에 적용하고자 한다.

  • PDF