• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.681-688
• /
• 2008

In this paper, we propose a new price-based call admission control algorithm for multi-class communication networks. When a call arrives at the network, it informs the network of the number of requested circuits and the minimum amount of time that it will require. The network provides the optimal price for the arrived call with which it tries to maximize its expected revenue. The optimal price is dynamically adjusted based on the information of the arrived call, and the present and the estimated future congestion level of the network during the reservation time of the call. If the call accepts the price, it is admitted. Otherwise, it is rejected. We compare the performance of our dynamic pricing algorithm with that of the static pricing algorithm by Courcoubetis and Reiman [1], and Paschalidis and Tsitsiklis [2]. By the comparison, we show that our dynamic pricing algorithm has better performance aspects such as higher call admission ratio and lower price than the static pricing algorithm, although these two algorithms result in almost the same revenue as shown in [2]. This implies that, in the competitive situation, the dynamic pricing algorithm can attract more users than the static pricing algorithm, generating more revenue. Moreover, we show that if a certain fixed connection fee is introduced to the price for a call, our dynamic pricing algorithm yields more revenue.

• Journal of Korean Academy of Nursing
• /
• v.46 no.6
• /
• pp.804-812
• /
• 2016

Purpose: This research was done to identify the hospital arrival rate and factors related to prehospital delay in arriving at an emergency medical center within the golden time after symptom onset in patients with acute myocardial infarction (AMI). Methods: Data used in the research was from the National Emergency Department Information System of the National Emergency Medical Center which reported that in 2014, 9,611 patients went to emergency medical centers for acute myocardial infarction. Prehospital time is the time from onset to arrival at an emergency medical center and is analyzed by subdividing arrival and delay based on golden time of 2 hour. Results: After onset of acute myocardial infarction, arrival rate to emergency medical centers within the golden time was 44.0%(4,233), and factors related to prehospital delay were gender, age, region of residence, symptoms, path to hospital visit, and method of transportation. Conclusion: Results of this study show that in 2014 more than half of AMI patients arrive at emergency medical centers after the golden time for proper treatment of AMI. In order to reduce prehospital delay, new policy that reflects factors influencing prehospital delay should be developed. Especially, public campaigns and education to provide information on AMI initial symptoms and to enhance utilizing EMS to get to the emergency medical center directly should be implemented for patients and/or caregivers.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.12
• /
• pp.75-84
• /
• 2010

As broadcasting in Mobile Ad hoc NETwork (MANET) is the process that a node sends a packet to all other nodes in the network. it is used for routing protocols such as Ad hoc On demand Distance Vector (AODV) to disseminate control information for establishing the routes. In this paper, we propose Probabilistic Broadcasting mechanism based on Distance Ratio between sender and receive node in MANETs. The proposed approach is based on the combination of probability and distance based approach. A mobile node receiving broadcast packets determines the probability of rebroadcasting considering distance ratio from sender. The distance ratio of a node is calculated by the distance from sender and the length of radio field strength. As a node with high distance ratio is located far away from sender, rebroadcast probability is set to high value. On contrary, the low rebroadcast probability is set for a node with low distance ratio which is close to sender. So it reduces packets transmission caused by the early die-out of rebroadcast packets. Compared with the simple flooding and fixed probabilistic flooding by simulation, our approach shows better performances results. Proposed algorithm can reduce the rebroadcast packet delivery more than 30% without scanting reachability, where as it shows up to 96% reachability compared with flooding.

• Journal of Astronomy and Space Sciences
• /
• v.25 no.4
• /
• pp.383-394
• /
• 2008

We examine geoeffective directional parameters of coronal mass ejections (CMEs). We select 30 front-side halo CMEs from SOHO LASCO CMEs whose speed is larger than 1000km/s and longitude is less than ${\pm}30^{\circ}$. These are thought to be the most plausible candidate of geoeffective CMEs. We examine the relation between CMEs directional parameters (Earthward direction, eccentricity, ${\Delta}$ distance and central angle parameter) and the minimum value of the Dst index. We have found that the Earthward direction parameter has a good correlation with the Dst index, the eccentricity parameter has a much better correlation with the Dst index. The bo distance and central angle parameter has a poor correlation with the Dst index. It's, however, well correlated with the Dst index in very strong geomagnetic storms. Most of CMEs causing very strong storms (Dst ${\leq}$-200nT) are found to have large Earthward direction parameter $({\geq}0.6)$, small eccentricity, bo distance and central angle parameters $(E{\leq}0.4,\;{\Delta}X\;and\;sin\;{\theta}{\leq}0.2)$. These directional parameters are very important parameters that control the geoeffectiveness of very fast front-side halo CMEs.

• Proceedings of the Plant Resources Society of Korea Conference
• /
• 2019.04a
• /
• pp.109-109
• /
• 2019

2018년 5월 전라북도 남원군에서 재배하여 수확 후 $0^{\circ}C$ 저장고에서 예냉을 마친 산마늘을 사용하였으며 외 포장 상자는 골판지로 구성된 통기공이 없는 골판지상자 1kg용을 사용하였다. 골판지상자와 함께 내부 포장으로 사용하기 위한 내포장 필름은 $20{\mu}m$ 두께의 HDPE으로 된 필름 봉지, 흡습종이는 파라핀왁스 코팅 종이($32{\times}35cm$, 태영산업)를 이용하여 조합 처리하고 국내에서 개발한 기능성 필름2종으로 포장처리는 총 4가지로 (1) PE(관행) (2) PE+흡습지 (3) 기능성필름1($30{\times}58cm$, 기능성물질 1%+40,000OTR, 제조사: 신영산업사) (4) 기능성필름2($30{\times}58cm$, Key fresh, 제조사: 씨앤케이프로팩(주)) 각 처리당 1kg 씩의 산마늘 잎을 포장하였다. 실험은 포장 처리 후 상온상태로 전북 완주군 실험실까지 수송하였으며 실험실 도착 후 상온 실험실에 두고 2일과 6일 후 중량감소율, 색도, 엽록소, 손실률 및 종합선도 등 품질특성 변화를 조사하였고 각 포장방법별 온도와 상대습도 변화를 보기 위하여 산마늘 잎이 포장된 상자 내부 중앙 부분에 디지털온습도기록계(SP-2000-20R)를 고정한 후 측정하였다. 대조구로 사용한 PE필름 단용으로 포장한 산마늘 잎은 상온저장 6일 경과 후 중량 소율이 1.7%, PE필름+신선지 처리는 1.0%, 기능성필름1과 기능성필름2는 거의 중량감소가 없어 1% 미만의 변화를 보였다. 산마늘 잎의 SPAD 값에 의한 엽록소 수치와 색도를 측정한 명도($L^*$)와 Hue angle 값의 변화는 기능성필름1과 기능성필름2가 유사하게 높게 유지되었고 반면에 PE필름은 저장 2일 후 부터 값이 감소하기 시작하여 6일 후 크게 감소하였다. 저장 6일 후 기능성필름1과 기능성필름2가 외관품위에서 높은 평가를 받아 상품성을 유지하고 있었으나 PE필름 처리와 PE필름+흡습지 처리는 상품성을 상실한 상태였다. 이러한 경향은 건전율에 있어서도 유사하였으며 기능성필름1(다공성 나노 물질이 혼입되어 있으며 산소투과율을 $40,000cc/m2{\cdot}day{\cdot}atm$으로 조성한 필름)이 상온저장 6일 후 상품성을 유지하는 건전율이 83%로 가장 높았다.

• Journal of Chest Surgery
• /
• v.35 no.6
• /
• pp.454-459
• /
• 2002

Clinical analysis of the relation between the clinical data of chest trauma patients and bone scan results was done to investigate the sensitivity and specificity of bone scan for the diagnosis of rib or chondral fracture. Material and Method： 445 patients treated due to chest trauma in Dongguk University Kyungju Hospital from July 1998 to December 2001 were studied. Age and sex distribution, causes of chest trauma, interval from the injury to arrival at hospital, final diagnosis, relationship between the chest pain and bone scan results, relationship between local tenderness and bone scan results, and sensitivity and specificity of bone scan were studied. Result： The male was 61.6% and the female was 38.4%. Age distribution was nearly even from the twenties to the sixties. The traffic accident was the most common cause of chest injury(60.4%). Most patients(76.6%) were arrived to the hospital within 6 hours after chest trauma. Rib fracture was the most common final diagnosis(46.5 %). The relationship between the duration of chest pain and tenderness and the bone scan results were significant, and the same in the relationship between the duration of local tenderness and the bone scan results, but the latter is more significant. The sensitivity of bone scan was 99.4% and the specificity was 90.4%. Conclusion： If the patient complains the chest pain continuously and the local tenderness around the chest is continued over 3 weeks, it is good to perform the bone scan. Further study including the MRI may be helpful for more evaluation in chest trauma patients.

• Journal of Korean Society of Transportation
• /
• v.18 no.2
• /
• pp.73-89
• /
• 2000

This Paper documents the development of a cycle free based, coordinated dynamic signal timing model for minimizing queue lengths using Genetic A1gorithm. The model was embodied using MAT-LAB, the language of technical computing. A special feature of this model is its ability to manage queue lengths of turning movements at the start of green times. The model produces a cycle-free based signal timing(cycles and green times) for each intersection to minimize queue lengths of turning movements on the cycle basis. Concurrently, appropriate offsets could be accomplished by applying cycle-free based signal timings for respective intersections. The model was applied to an example network which consists of three intersections. The result shows that the model produces superior signal timings to the existing signal timing model in terms of managing queue lengths of turning movements.

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.547-554
• /
• 2004

To play back CM (Continuous Media) in online mode, the multimedia system Is required to have a real-time disk scheduling scheme that can efficiently fulfill the strict temporal constraints of serviced CM streams to prevent hiccups. In general, such disk scheduling is performed based on the concept of periodic prefetching since a CM stream has a rather long Playback time. In this paper, we also propose a periodic prefetching scheme that runs by using real-time disk channels, called on-time delivery channels. Since the channels are generated from the bulk-SCAN algorithm and they can be allocated in a very flexible manner based on the EDF (earliest-deadline-first) algorithm, the proposed scheme provides a better Performance in terms of I/O throughput and the average response time, as well as hiccup-free playback of concurrent CM streams. To show that the proposed scheme outperforms other methods, we give some simulation results.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.1016-1022
• /
• 2010

Far-talking recognition and distributed speech recognition networking techniques are essential to control various and complex home services conveniently with voices. It is possible to control devices everywhere at home by using only voices. In this paper, we have developed the server-client DSP module for distributed speech recognition network system and proposed a new decision rule to decide intelligently whether to accept the recognition results or not by the transferred confidence rate. Simulation results show that the proposed decision rule delivers better performances than the conventional decision by majority rule or decision by first-arrival. Also, we have proposed the new interrupt-polling technique to remedy the defect of existing delay technique which always has to wait several clients' results for a few seconds. The proposed technique queries all client's status after first-arrival and decides whether to wait or not. It can remove unnecessary delay-time without any performance degradation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.72-84
• /
• 2005

Optical burst switching networks usually employ one-way reservation by sending a burst control packet with a specific offset time, before transmitting each data burst Same. Due to such a Property, burst-contentions occur when multiple bursts contend for the same wavelength in the same output link simultaneously in a node, leading to burst losses, eventually degrading the quality of service. Therefore, in this paper, we propose a dynamic routing algorithm using minimum local state information in order to decrease burst-contentions. In this proposed scheme, if burst loss rate exceeds a threshold value at a certain node, a new alternative routing path is chosen according to burst priority and location of burst generation, which enables the contending bursts to detour around the congested link. Moreover, for reducing the effect of sending bursts on the primary path due to the alternative path, we also apply a minimum path-cost based routing on link-cost concept. Our simulation results show that proposed scheme improves the network performance in terms of burst loss probability and throughput by comparing with conventional one.