• Title/Summary/Keyword: 비간시

Search Result 9, Processing Time 0.027 seconds

Architectural Heritage of Hahoe Village in Andong City, South Korea and Vigan City in Ilocos Sur, Philippines (한국 안동시 하회마을과 필리핀 일로코스써 비간시의 건축 문화유산)

  • Yoo, Yeong Chan;Kim, Gon
    • KIEAE Journal
    • /
    • v.8 no.2
    • /
    • pp.47-52
    • /
    • 2008
  • A nations' cultural heritage embodies its intellectual and spiritual contributions to its civilization of mankind. Cultural properties, whether tangible or intangible, represent both the essence and the basis of national cultures. Both the Philippines and South Korea's cultural heritages have survived various unfortunate chapters of their long histories. This study's purpose is to explore and evaluate the phenomenon of the architecture of Hahoe village in Andong city, Korea and Vigan city of Ilocos Sur, Philippines and to understand and cherish the cultural heritage of both countries. The historic city of Vigan has a unique architecture that blend Ilocano, Filipino, Chinese and Spanish styles in a tropical Asian setting, with a typical Spanish colonial urban layout as specified by the Ley Delas Indias. Hahoe village also represents a masterpiece of human creation and exhibit an important interchange of human values in architecture, monumental arts, town planning and landscape design. Though diverse in milieu, Hahoe village and Vigan city share a common phenomenon which is architecture that is called cultural heritage.

신뢰도분석을 위한 감마사전확률분포의 추정

  • 전치혁;박영신;김지수
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1993.04a
    • /
    • pp.294-300
    • /
    • 1993
  • 어떤 무기체계의 임무신뢰도분석에 베이지안기법을 사용하는데 있어 고장율이 주어졌을 때 고장간 시간이 지수분포를 따른다는 가정하에 이의 Conjugate Prior인 감마분포의 추정문제를 다룬다. 임무별 고장간시간에 대한 예측분포를 유도하였으며, 실제 측정된 기존의 임무별 고장간시간이 이 예측분포를 따른다는 전제하에 비선형 최소자승법을 이용하여 감마분포의 두 파라메터를 추정하는 방안을 제시하였다. 또한 대상 무기체계의 실제 고장자료를 이용하여 추정치를 구하였다.

  • PDF

Real-time Task Scheduling Methods to Incorporate Low-power Techniques of Processors and Memory in IoT Environments (사물인터넷 환경에서 프로세서와 메모리의 저전력 기술을 결합하는 실시간 태스크 스케줄링 기법)

  • Nam, Sunhwa A.;Bahn, Hyokyung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.2
    • /
    • pp.1-6
    • /
    • 2017
  • Due to the recent advances in IoT technologies, reducing power consumption in battery-based IoT devices becomes an important issue. An IoT device is a kind of real-time systems, and processor voltage scaling is known to be effective in reducing power consumption. However, recent research has shown that power consumption in memory increases dramatically in such systems. This paper aims at combining processor voltage scaling and low-power NVRAM technologies to reduce power consumption further. Our main idea is that if a task is schedulable in a lower voltage mode of a processor, we can expect that the task will still be schedulable even on slow NVRAM memory. We incorporate the NVRAM memory allocation problem into processor voltage scaling, and evaluate the effectiveness of the combined approach.

An Improvement of Hospital Reception System using Web Socket (웹소켓을 이용한 병원 접수시스템 개선에 관한 연구)

  • Son, Man-Geun;Park, Ki-Seong;Kong, Yong-Hae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.1
    • /
    • pp.185-195
    • /
    • 2015
  • During hospital peak times of outpatients, an effective mechanism that informs the newly receipted patient information to corresponding medical departments is lacking in current hospital reception systems. Since every department repeatedly searches entire patient reception database in sequential manner to acquire its reception information, this is a significant performance degradation factor in hospital information system. To improve hospital reception system efficiency, we developed two web socket based systems, a primary key transmitting batch system and a reception information transmitting real time system. The former reduced database access time compared to sequential search system as well as kept search time low regardless of receipted patient number. The latter effectively reduced waiting list updating time in request/response patient reception system by eliminating database access.

Design of a System for Collecting and Utilizing Student Feedback Information in Asynchronous Indivisual Learning (비실시간 온라인 수업에서 학습자의 피드백 정보 수집 및 활용 시스템의 설계 및 구현)

  • Tae-Hwan Kim;Dae-Soo Cho;Seung-Min Park
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.19 no.1
    • /
    • pp.225-232
    • /
    • 2024
  • The Asynchronous indivisual learning offer advantages such as allowing learners to study at their preferred times without spatial constraints. However, since these classes are not conducted in real-time, there are limitations in conveying learners' feedback on problematic or inadequately explained course content to the instructors. This paper proposed a system for relaying feedback information from learners who view course content to the instructors. Learners can investigate the reasons for pausing online recorded class content, and they can transmit these pause reasons along with the time information of the paused content to the instructors. Instructors receive feedback information and pause times of learners' online recorded class videos in graphical form, making it easier to identify areas with numerous issues in the course content at a glance. Instructors can incorporate this feedback to re-upload the content, resulting in higher-quality course materials, which, in turn, can enhance learners' academic achievements.

On-line Schedulability Check Algorithm for Imprecise Real-time Tasks (부정확한 실시간태스크들을 위한 온라인 스케쥴가능성 검사 알고리즘)

  • Gi-Hyeon Song
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.9
    • /
    • pp.1167-1176
    • /
    • 2002
  • In a (hard) real-time system, every time-critical task must meet its timing constraint, which is typically specified in terms of its deadline. Many computer systems, such as those for open system environment or multimedia services, need an efficient schedulability test for on-line real-time admission control of new jobs. Although various polynomial time schedulability tests have been proposed, they often fail to decide the schedulability of the system precisely when the system is heavily loaded. Furthermore, the most of previous studies on on-line real-time schedulability tests are concentrated on periodic task applications. Thus, this paper presents an efficient on-line real-time schedulability check algorithm which can be used for imprecise real-time system predictability before dispatching of on-line imprecise real-time task system consisted of aperiodic and preemptive task sets when the system is overloaded.

  • PDF

Experiments on the Muscadine Transmission in the Silkworm Larvae, Bombyx mori L. and Pine Caterpillar, Dendrolimus Spectabilis B. (잠아와 송충과의 경화병균 전염시험성적)

  • 박병희;한수용;조성일
    • Journal of Sericultural and Entomological Science
    • /
    • v.1
    • /
    • pp.15-21
    • /
    • 1960
  • 4231년 농림부산림국에서 송충구제책으로 경기도 임업시험장에서 인공배양한 No.7호균외 수종을 사용할 계획인바 비에 대한 임업시험장 시험보고에 의하면 핵균은 송충에 대하여 맹독성이지마는 잠아에 대하여서는 기독성이 경미하다는 보고 이였으므로 양잠가에 대한 의문을 풀기 위하여 송충 및 잠아에 대한 전염성의 강약을 비교 시험하여 그 독성정도를 구명코저 함. 1. 경기도 임업시험장 연구보고 제1호에 기재된 No.7 호균의 시험성적과 본시험성적과를 대조하면 그 이병률은 일정한 경향을 표시치 않으며 다소 상치된 결과이었다. 즉 별표에 의하면 송충은 72~100% 잠아에 있어서는 4289년도에 0~2% 4290년도이 0~20%였으나 본시험결과 (표 1,2,3)는 송충은 표준구에 6.6% 처리구에 13.3~20%이고 잠아는 5~50%의 이병률이였다. 따라서 송충에는 그 감염도가 높으며 잠아는 그 감염도자 낮다고하는 근거를 인정키 난하다. 2. 본시험에 공시된 접종균 No.7호균은 경기도 임업시험장에서 호칭하는 황황강균(Insarica farinosa)이 었으나 핵균 배양시에 이균이 침입된 관계인지는 모르나 본시험에서 폐사를 검정한 결과 백강균(Botrytis Bassiana)이였다. 따라서 No.7호균에 대한 순도가 의심되며 시험결과의 정확을 기할수가없었다. 3. 경기도 임업시험장연구보고 제1호에 접수된 양년간시검성적에 의하면 경화병균 28종중 가장 이병률이 낮다고하는 No.7호균이 본시험결과에서 잠아에 5~50%의 이병률을 나타내는것으로 보아 소위 경기도 임업시험장에서 순수분리한 균은 어느것이라도 송충에 접종하여 산지에 산포하면 그 균이 중간기생 (인교목, 직교목)을 통하여 야생화되어서 더욱 잠아에 대한 전염력을 강렬하게됨으로 양잠상 위험할것이다. 일본의 소산씨 문헌(경기도 임업시험장도서관)에 의하면 야생혼충에서 전염되는 경화병균의 독성은 잠아에 대하여 강력하다는 점과 $\ulcorner$잠업지조선$\lrcorner$제11호에 전라남도 원잠종제조소 강본태대랑씨의 시험성적(참고문헌)이 이를 여실히 입증하는 바이다. (중략)

  • PDF

Analysis of Contributory Factors in Causing Crashes at Rural Unsignalized intersections Based on Statistical Modeling (지방부 무신호교차로 교통사고의 영향요인 분석 및 통계적 모형 개발)

  • PARK, Jeong Soon;OH, Ju Taek;OH, Sang Jin;KIM, Young Jun
    • Journal of Korean Society of Transportation
    • /
    • v.34 no.2
    • /
    • pp.123-134
    • /
    • 2016
  • Traffic accident at intersections takes 44.3% of total number of accidents on entire road network of Korea in 2014. Although several studies addressed contributory factors of accidents at signalized intersection, very few is known about the factors at rural unsignalized intersections. The objective of this study is therefore to investigate specific characteristics of crashes at rural unsignalized intersection and to identify contributory factors in causing crashes by statistical approach using the Ordered Logistic Regression Model. The results show that main type of car crashes at unsignalized intersection during the daytime is T-bone crashes and the number of crashes at 4-legged intersections are 1.53 times more than that at 3-legged intersections. Most collisions are caused by negligence of drivers and violation of Right of Way. Based upon the analysis, accident severity is modeled as classified by two types such as 3-legged intersection and 4-legged intersection. It shows that contributory factors in causing crashes at rural unsignalized intersections are poor sight distance problem, average daily traffic, time of day(night, or day), angle of intersection, ratio of heavy vehicles, number of traffic violations at intersection, and number of lanes on minor street.

An Improved Online Algorithm to Minimize Total Error of the Imprecise Tasks with 0/1 Constraint (0/1 제약조건을 갖는 부정확한 태스크들의 총오류를 최소화시키기 위한 개선된 온라인 알고리즘)

  • Song, Gi-Hyeon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.10
    • /
    • pp.493-501
    • /
    • 2007
  • The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et at suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. In the online scheduling, the NORA algorithm can find a schedule with the minimum total error for the imprecise online task system. In NORA algorithm, EDF strategy is adopted in the optional scheduling. On the other hand, for the task system with 0/1 constraint, EDF_Scheduling may not be optimal in the sense that the total error is minimized. Furthermore, when the optional tasks are scheduled in the ascending order of their required processing times, NORA algorithm which EDF strategy is adopted may not produce minimum total error. Therefore, in this paper, an online algorithm is proposed to minimize total error for the imprecise task system with 0/1 constraint. Then, to compare the performance between the proposed algorithm and NORA algorithm, a series of experiments are performed. As a conseqence of the performance comparison between two algorithms, it has been concluded that the proposed algorithm can produce similar total error to NORA algorithm when the optional tasks are scheduled in the random order of their required processing times but, the proposed algorithm can produce less total error than NORA algorithm especially when the optional tasks are scheduled in the ascending order of their required processing times.