• 동의생리병리학회지
• /
• 제16권5호
• /
• pp.1075-1078
• /
• 2002

Objective: The management for the stroke should ,given as soon as possible to be effect. But Patients with stroke symptoms commonly delay many hours before seeking medical attention. We evaluated the factors which are related to the time of hospital arrival after acute stroke. Method: Data were obtained from 317 patients admitted to our hospital within 72 hours of stroke onset. We assessed demographic variables, stoke subtype. referral routes. history of previous stroke, level of consciousness, distance from the place where stroke occurred to hospital, and the time interval between onset of stroke and arrival at the hospital. Results: Mean patient age was 65.99±9.57 years. The mean time interval between onset of stroke and hospital arrival was 17.26±18.69 hours and 128 (40.38%) patients arrived within 6 hours. The patients whoes stoke subtype was infarction, who arrived our hospital by way of other hospital, who had no suffered from previous stroke and who showed no impairement of consciousness was arrived at the hospital late(p<0.05). Conclusion: The majority of patients arrive at the hospital after prolonged delays for multiple reasons, and patients with milder symptoms, for whom treatment might be more effective, were less likely to arrive in time for therapy. Our study suggest that effective education about stroke to the patients and public would be highly necessary.

• ETRI Journal
• /
• 제30권2호
• /
• pp.227-237
• /
• 2008

In this paper, an algorithm that provides absolute and proportional differentiation of packet delays is proposed with the objective of enhancing quality of service in future packet networks. It features an adaptive scheme that adjusts the target delay for every time slot to compensate the deviation from the target delay, which is caused by prediction error on the traffic to arrive at the next time slot. It predicts the traffic to arrive at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot. The difference between them is utilized by the delay control operation for the next time slot to offset it. Because the proposed algorithm compensates the prediction error continuously, it shows superior adaptability to bursty traffic and exponential traffic. Through simulations we demonstrate that the algorithm meets the quantitative delay bounds and is robust to traffic fluctuation in comparison with the conventional non-adaptive mechanism. The algorithm is implemented with VHDL on a Xilinx Spartan XC3S1500 FPGA, and the performance is verified under the test board based on the XPC860P CPU.

• 대한산업공학회지
• /
• 제28권2호
• /
• pp.139-146
• /
• 2002

The third generation mobile communication needs to provide multimedia service with increased data rates. Thus an efficient allocation of radio and network resources is very important. This paper models the 'burst switching' as an efficient radio resource allocation scheme and the performance is compared to the circuit and packet switching. In burst switching, radio resource is allocated to a call for the duration of data bursts rather than an entire session or a single packet as in the case of circuit and packet switching. After a stream of data burst, if a packet does not arrive during timer2 value ($\tau_{2}$), the channel of physical layer is released and the call stays in suspended state. Again if a packet does not arrive for timerl value ($\tau_{1}$) in the suspended state, the upper layer is also released. Thus the two timer values to minimize the sum of access delay and queuing delay need to be determined. In this paper, we focus on the decision of $\tau_{2}$ which minimizes the access and queueing delay with the assumption that traffic arrivals follow Poison process. The simulation, however, is performed with Pareto distribution which well describes the bursty traffic. The computational results show that the delay and the packet loss probability by the burst switching is dramatically reduced compared to the packet switching.

• 한국자동차공학회논문집
• /
• 제4권2호
• /
• pp.69-79
• /
• 1996

Dynamic stress intensity factors are derives when the crack is propagating with constant velocity under longitudinal shear stress in orthotropic disk plate. General stress fields of crack tip propagating with constant velocity and least square method are used to obtain the dynamic stress intensity factor. The dynamic stress intensity factors of GLV/GTV=1(=isotropic material or transversely isotropic material) which is obtained in out study nearly coincides with Chiang's results when mode Ⅲ stress is applied to boundary of isotropic disk. The D.S.I.F. of mode Ⅲ stress is greater when α(=angle of crack propagation direction with fiber direction) is 90° than that when α is 0°. In case of a/D(a:crack length, D:disk diameter)<0. 58, the faster crack propagation velocity, the less D.S.I.F. but when crack propagation velocity arrive on ghear stress wave velocity, the D.S.I.F. but when crack propagation velocity arrive on shear stress wave velocity, the D.S.I.F. unexpectedly increases and decreases to zero.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1999년도 제14차 학술회의논문집
• /
• pp.226-229
• /
• 1999

We have been developing a method to build models for time series using Genetic Programming. The proposed method has been applied to various kinds of time series e.g. computer-generated chaos, natural phenomena, and financial market indices etc. Now we apply the prediction method to time histories of seismic ground motion i.e. one-step-ahead prediction of seismographic amplitude. Waves of earthquakes are composed of P-waves and S-waves. They propagate in different speeds and have different characteristics. It is believed that P-waves arrive firstly and S-waves arrive secondly. Simulations were performed based on real data of Hyuganada earthquake which broke out at southern part of Kyushuu Island in Japan. To our surprise, prediction model built using the earthquake waves in early time can enough precisely predict main huge waves in later time. Lots of experiments lead us to conclude that every slice of data involves P-wave and S-wave. The simulation results suggest the GP-based prediction method can be utilized in alarm systems or dispatch systems in an emergency.

• 한국인터넷방송통신학회논문지
• /
• 제17권5호
• /
• pp.79-84
• /
• 2017

본 논문은 다중 경로 다중입력 (Multiple-input multiple-output : MIMO) 채널에서 space alternating generalized expectation-maximization(SAGE) 알고리즘을 이용하여 채널 파라미터 추정 성능을 확인한다. 성능을 비교하기 위해 781 대역의 제주도 측정지역에서의 채널 파라미터로부터 시변 채널 환경 채널 파라미터 추정을 SAGE 알고리즘을 통해 추정하고 원본 데이터와 비교한다. 이를 통해 SAGE 알고리즘의 성능을 확인할 수 있으며 일반적인 파라미터 계산보다 SAGE 알고리즘을 통해 추정하는 것이 지연 확산(Delay Spread), 도래각 확산(Arrive of Angular Spread)이 적어 정확 측면에서 성능이 뛰어나고 안정적이다.

• 한국환경과학회지
• /
• 제22권7호
• /
• pp.885-893
• /
• 2013

The purpose of this study was to analyze the effects of partial solar eclipse on 21 May 2012 in Korea on meteorological variables in Busan. 0800 LST(Local Standard Time) solar radiation was similar or lower than 0700 LST solar radiation, and sunshine duration decreased by 0.2~0.5 hours in Busan and great cities under the influence of the partial solar eclipse. Temperature drop due to the partial solar eclipse was $0.2{\sim}2.0^{\circ}C$, time taken to arrive at maximum temperature after onset of eclipse was 8~62 minutes, and time taken to arrive at minimum temperature after maximum eclipse was -9~17 minutes in Busan. Change of wind speed was negligible as partial solar eclipse occurred in the morning. Soil temperature of 5 cm was minute as well, the increase of soil temperature due to sunset was delayed by more than 1 hour.

• 한국수학교육학회지시리즈C:초등수학교육
• /
• 제9권1호
• /
• pp.31-41
• /
• 2005

In modern theory, creativity is an aim of mathematics education not only for the gifted but also fur the general students. The assertion that we must cultivate the creativity for the gifted students and drill the mechanical activity for the general students are unreasonable. Freudenthal has advocated the reinvention method, a pedagogical principle in mathematics education, which would promote the creativity. In this method, the pupils start with a meaningful context, not ready-made concepts, and invent informative method through which he could arrive at the formative concepts progressively. In many face the reinvention method is contrary to the traditional method. In traditional method, which was named as 'concretization method' by Freudenthal, the pupils start with ready-made concepts, and applicate this concepts to various instances through which he could arrive at the understanding progressively. Freudenthal believed that the mathematical creativity could not be cultivated through the concretization method in which the teacher transmit a ready-made concept to the pupils. In the article, we close examined the reinvention method, and presented a context of delivery route which is a illustration of reinvention method. Through that context, the principle of pascal's triangle is reinvented progressively.

• 전기학회논문지
• /
• 제56권8호
• /
• pp.1476-1483
• /
• 2007

In a multi-sensor target tracking systems, the local sensors have the role of tracking the target and transferring the measurements to the fusion center. The measurements from the same target can arrive out of sequence called, the out-of-sequence measurements(OOSMs). The OOSM can arise in a form of single-lag or multi-lag throughout the transfer at the fusion center. The recursive retrodiction step was proposed to update the current state estimates with the multi-lag OOSM from the several previous papers. The real world has the possible situations that the maneuvering target informations can arrive at the fusion center with the random clutter in the possible OOSMs. In this paper, we incorporate the IMM-MPDA(Interacting Multiple Model - Most Probable Data Association) into the multi-lag OOSM update. The performance of the IMM-MPDA filter with multi-lag OOSM update is analyzed for the various clutter densities, OOSM lag numbers, and target maneuvering indexes. Simulation results show that IMM-MPDA is sufficient to be used in out of sequence environment and it is necessary to correct the current state estimates with OOSM except a very old OOSM.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 추계학술대회
• /
• pp.94-96
• /
• 2021

본 연구는 산업현장에서 사용되는 이동로봇이 익숙하지 못한 환경에서 목적지에 도착할 수 있는 항법 알고리즘을 개발하고자 한다. 이를 위해 동적창 접근(DWA)과 Dijkstra 경로설정 알고리즘을 결합하여 항법 알고리즘을 제안한다. 이를 성능 비교하기 위해 로컬 동적창 접근(LDWA), 글로벌 동적창 접근(GDWA), 고속 탐색 랜덤 트리 (RRT) 알고리즘을 비교 분석한다. LDWA과 GDWA을 적용한 Dijkstra 알고리즘을 활용한 항법 알고리즘을 구현하여 제한된 정보를 이용하여 이동로봇이 목적지에 도달할 수 있도록 한다. 이 알고리즘들의 목적지에 도착할 때까지 걸리는 시간, 장애물 회피와 계산복잡도에 대한 비교 분석한다. 위 알고리즘의 한계를 극복하기 위한 새로운 항법 알고리즘을 제안하고 제시된 최적화된 항법 알고리즘의 산업현장에서의 활용 방안을 모색한다.