• Management Science and Financial Engineering
• /
• 제15권2호
• /
• pp.1-21
• /
• 2009

We consider an $M^x/G/1$ queueing system with a random setup time under Bernoulli vacation schedule, where the service of the first unit at the completion of each busy period or a vacation period is preceded by a random setup time, on completion of which service starts. However, after each service completion, the server may take a vacation with probability p or remain in the system to provide next service, if any, with probability (1-p). This generalizes both the $M^x/G/1$ queueing system with a random setup time as well as the Bernoulli vacation model. We carryout an extensive analysis for the queue size distributions at various epochs. Further, attempts have been made to unify the results of related batch arrival vacation models.

• 대한전자공학회논문지TC
• /
• 제41권8호
• /
• pp.9-18
• /
• 2004

IEEE 802.11 DCF(Distributed Coordination Function) 프로토콜은 무선 매체의 공유를 위하여 단말간 경쟁기반의 분산 채널접근 방법을 제공한다. 그러나, 이 방법은 단말 수가 증가함에 따라 많은 충돌(Collision)을 야기한다. 따라서, 지연 지터 그리고 효율측면에서 IEEE 802.11 DCF의 성능은 급격하게 감소한다. 본 논문에서는 IEEE 802.11 DCF 시스템의 성능을 향상시키기 위해 간단하고 효율적인 DCF/VG(Distributed Coordination Function with Virtual Group) 방법을 제안한다. 제안하는 방법에서, 각 단말은 캐리어 검출을 통해 현재 채널의 경쟁 수준(Contention Level)을 측정하고 경쟁 수준에 따라 독립적으로 가상 그룹 주기(Virtual Group Cycle)를 결정한다. 가상 그룹 주기는 하나 이상의 가상 그룹들로 이루어지며 하나의 가상 그룹은 한번의 유휴 기간(Idle Period)과 한번의 번잡 기간(Busy Period)을 갖는다. 단말은 가상 그룹 주기 중에서 자신이 선택한 가상 그룹에서만 동작하며 다른 그룹에서는 동작하지 않는다. 즉, 단말이 선택한 가상 그룹에서는 IEEE 802.11 DCF처럼 유휴 슬롯을 검출하면 백오프 카운터(Backoff Counter)를 감소시키고 백오프 카운터가 0이 되면 데이터 패킷을 전송한다. 그러나 다른 가상 그룹에서는 유휴 슬롯을 검출하더라도 백오프 카운터를 감소시키지 않는다. 제안하는 방법을 수학적 분석과 시뮬레이션을 통해 IEEE 802.11 DCF와 성능을 비교 분석한다. 성능 비교 분석 결과, 제안하는 방법이 다양한 경쟁 수준 환경에서 높은 효율과 낮은 지연 및 지터를 가짐을 확인하였다.

• 혜화의학회지
• /
• 제10권1호
• /
• pp.437-451
• /
• 2001

The clinical study was carried out the 30 patients with tremor who were treated in Daejeon University Oriental Hospital from 1 April 1997 to 31 March 2001. The results were summarized as follows. 1. The ratio of female was higher, especially in the psychosomatic tremor, the ratio of female was higher and in the age distribution the aged over 50 were higher frequence. 2. The case without past history was most, the most ordinary preceding disease was hypertention and the next was diabetes, drinking history had no concern with tremor, first visit was most, in the psychosomatic tremor complication by relation was the most inducing factor and both parkinson tremor and essential tremor were no inducing factor. 3. Tremor appeared to be busy in extremities, parkinson tremor appeared to be accompanied with musculoskeletal system symptoms and they were in descending order lower limb weakness, extremities numbness, general body weakness e.t.c. both essential tremor and psychosomatic tremor appeared to be accompanied with psychosomatic symptoms and they were in descending order dizziness, headache e.t.c. 4. In classification of Four Human coporeal constitution the number of patients, Tae-Eum-In(太陰人) was most, the prescription drugs of tranquillizing the liver and relieving anxiety such as GYEJIYONGGOLMORYETANG(桂枝加龍骨牡蠣湯) and nourishing Yin, blood and relieving anxiety such as SAMULANSINTANG(四物安神湯) were used to be busy. 5. The rate of treatment was collectively improved and was higher in the yaung age than in the old age, the period of the clinical history was the shorter within one month, the rate of improvement was the better.

• 한국인터넷방송통신학회논문지
• /
• 제21권1호
• /
• pp.141-148
• /
• 2021

일부 네거리나 혼잡도로에서 특정 시간대에 행인이 많고 도로가 막혀서 발생하는 교통사고가 적지 않다. 특히 인근에 학교교차로가 있어 바쁜 시간에 학생들의 교통안전을 지키는 것이 중요하다. 과거에는 교통 신호등을 설 계 했을 때 행인의 안전성을 고려하지 않고 자동차 인식과 교통 최적화에 대하여 연구 했다. 행인, 특히 학생들의 안전을 확보하는 전제에서 가능한 한 도로의 소통을 유지하는 것이 본 연구의 중점적인 연구 방향이다. 본 연구는 사람, 오토바이, 자전거, 자동차, 버스의 식별문제를 중점적으로 연구할 것이다. 조사와 비교를 통해 본 연구는 YOLO v4 네트워크로 목표물의 위치와 수량을 식별하는 것을 제시한다. YOLO v4는 작은 목표물의 식별 능력이 강하고 정밀도가 높으며 처리속도가 빠르다는 특징을 가지고 있으며, 데이터 수집 대상을 설정하여 이미지 집합을 훈련하고 테스트 한다. 움직이는 영상에서 목표물의 정확도, 실수율과 누락율에 대한 통계를 사용하여, 본 연구에서 훈련된 네트워크는 움직이는 이미지 속의 사람, 오토바이, 자전거, 자동차와 버스를 정확하게 식별 할 수 있다.

• 한국식생활문화학회지
• /
• 제18권6호
• /
• pp.536-543
• /
• 2003

The Chosun Dynasty in the $18^{th}$ century was a period of revival for science, art, and culture, bringing about Silhak(practical science), a new trend in the history of Chosun thoughts. In the history of fine arts, realistic landscape paintings and genre paintings were popular as realism became prevalent. From the aspect of food culture, in particular, the luxurious and elegant Korean-styled food culture was completed during this period. Iwanwasuseoksihoedo was painted by Jeong Hwang (1735-1800) in 1789, depicting a banquet on an elder's $60^{th}$ birthday. It is classified as a genre painting in the late Chosun Period but it contains things that comes into our heart, which are white porcelain with blue celadon pictures, white porcelain bowls, busy atmosphere of a banqueting house where food is being carried in a hurry and elders' serene appearance. All these things show the abundance of life, the room and comfort of old ages, and the beauty and relish of life in the well-arranged living ground. Hoehonyedo was painted on an elder's $60^{th}$ marriage anniversary by an unknown artist presumably in the $18^{th}$ century is a painting as realistic as a documentary photograph. The work gives viewers pleasure and comfort because it describes not a mighty clan but the superb later years of an official who had lived right and upright life. In the aspect of food culture, it displays the food culture of the splendid sixtieth marriage anniversary of a Korean official through noble etiquette among family members, seat planning, unique table culture and high quality tableware including white porcelain with celadon pictures and pure white porcelain.

• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2002년도 춘계 학술발표회 논문집
• /
• pp.61-66
• /
• 2002

We consider a generalized N-policy for an M/M/1 queueing system. The idle server starts to work with ordinary service rate when a customer arrives. If the number of customers in the system reaches N, the service rate gets faster and continues until the system becomes empty. Otherwise, the server finishes the busy period with ordinary service rate. We obtain the limiting distribution of the number of customers in the system. After assigning various operating costs to the system, we show that there exists a unique fast service rate minimizing the long-run average cost per unit time.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2001년도 추계학술대회 논문집
• /
• pp.199-202
• /
• 2001

This article deals with stochastic reliability systems that include a repair facility and unreliable machines: the main facility of working and an auxiliary facility of "super-reserve" machines. The number of super-reserve machines are random number with a arbitrarily distribution and working machines break down exponentially. Defective machines line up for repair, whose durations are arbitrarily distributed. Refurbished machines return to the main facility. If the main facility is restored to its original quantity, the repair facility leaves on routine maintenance until all of super-reserve machines are exhausted. Then, the busy period is regenerated. The whole system also falls into the category of closed queues, with more options than those of basic models. The techniques include two-variate Markov and semi-regenerative processes, and a duality principle, to find the probability distribution of the number of intact machines. Explicit formulas obtained demonstrate a relatively effortless use of functionals of the main stochastic characteristics (such as expenses due to repair, maintenance, waiting, and rewards for higher reliability) and optimization of their objective function. Applications include computer networking, human resources, and manufacturing processes.

• 대한산업공학회지
• /
• 제33권4호
• /
• pp.419-423
• /
• 2007

In this paper, we consider the M/G/1 queueing system with randomized control of T-policy. Whenever the busy period ends, the server is turned off and takes multiple vacations whose interval is fixed time T with probability p or stays on and waits for arriving customers with probability 1-p. We introduce the cost function and determine the optimal combination of (p, T) to minimize the average cost per unit time.

• Journal of information and communication convergence engineering
• /
• 제10권4호
• /
• pp.396-404
• /
• 2012

This paper proposes an analysis method to check the schedulability of a set of sporadic tasks under earliest deadline first (EDF) scheduler. The sporadic task model consists of subtasks with precedence constraints, arbitrary arrival times and deadlines. In order to determine the schedulability, we present an approach to find exact worst case response time (WCRT) of subtatsks. With the technique presented in this paper, we exploit the precedence relations between subtasks in an accurate way while taking advantage of the deadline of different subtasks. Another nice feature of our approach is that it avoids calculation time overhead by exploiting the concept of deadline busy period. Experimental results show that this consideration leads to a significant improvement compared with existing work.

• 아동학회지
• /
• 제30권4호
• /
• pp.223-239
• /
• 2009

In order toidentify the daily activities of five-year-old children in a daycare center, the 23 children in "Yellow" class at "Yellow" Daycare Center were observed for seven months. Research was informed by a qualitative approach. Findings were that : children were rigidly attached to a time frame built into their daily classroom schedule, arranged by time and classroom space allotted to each unit. The meaning to the children was to be found in their "busyness;" they were very busy finalizing activities imposed by teachers within a short period of time. They spent most of their time moving about from one space to another within the classroom, and they played with their mostly artificial toys under rules set by the teacher.