• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2008년도 춘계학술대회 논문집
• /
• pp.1466-1472
• /
• 2008

To minimize the train operation interruptions and train exchanges, the RF transmission system is proposed. The current control room of the Seoul Metro has information of the train movement through the Total Traffic Control System, but it does not have information of the train itself, rail status, and other facilities' status. When some trouble occurs during train operation, the train crews should report the control room about the trouble and fix it. If the control room has exact information of the trouble, the expert in the control room can help the crews to fix the trouble swiftly and exactly. Since the crews are busy taking care of the trouble, they often miss to report the control room on time. The proposed RF transmission system relays the information of the train to the control room automatically in real time, and makes it possible to provide the passengers good service by reducing the train operation interruptions and train exchanges.

• 한국통신학회논문지
• /
• 제17권7호
• /
• pp.656-665
• /
• 1992

In this paper, the performance of the various multiple access techniques for the mobile computer network has been studiedi in the consideration of the charactersitics of the mobile cimmunication channel. In the case of the hidden node occurring. It could be seen that the performance of the code division multiple access (CDMA) technique with simultaneous access function is better than that of the other packet access methods such as carrier sendsed multiple access (CDMA), busy tone multiple access (BTMA) and idle signal multiple access (ISMA) in the view of the throughput and mean delay time. Also, it has been shown that the performance of the CDMA method is superior to that of other packet access techniques such as multiple access (CSMA), etc. when the fading effect or impulsive noise exists in the mobile channel, Especially, in the case of the distributed mobile network it has been shown that the receivertransmitter based CDMA method using the characteristics of CDMA effectively has better throughput and less mean delay time than the commontransmitter based CDMA technique.

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

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

• 한국통신학회논문지
• /
• 제36권11B호
• /
• pp.1329-1338
• /
• 2011

본 논문에서는 분산 메모리 아키텍처를 사용하는 멀티프로세서에서 가장 병목 현상이 심한 집합통신 중 브로드캐스트를 위한 알고리즘 및 하드웨어 구조를 제안한다. 기존 시스템에서 집합통신은 프로세싱 노드의 통신포트 상태가 busy 혹은 free 인지를 고려하지 않고 MPI libray cell 에 의해서 점대점 통신으로 변환되어 진다. 만약 브로드캐스트 통신을 하는 동안에 간섭하는 점대점 통신이 있다면, 브로드캐스트 통신의 전송 속도는 저하된다. 따라서 본 논문에서는 각각의 프로세싱 노드의 상태를 고려하여 통신 순서를 결정하는 브로드캐스트 통신 알고리즘을 제안하였다. 제안하는 구조의 알고리즘은 각 프로세싱 노드의 상태에 따라, free 상태의 통신 포트를 가진 프로세싱 노드의 통신 포트에게 우선적으로 메시지를 송신하여 전체적인 집합통신 시간을 단축하였다. 본 연구에서 제안하는 브로드캐스트 통신을 위한 MPI 유닛은 SystemC로 모델링하여 평가하였다. 또한 본 구조는 16노드에서 브로드캐스트 통신의 성능을 최대 78% 향상시켰고, 이는 MPSoC(Multi-Processor System-on-Chip)의 전체적인 성능을 높이는데 유용하다.

• International Journal of Reliability and Applications
• /
• 제12권1호
• /
• pp.15-39
• /
• 2011

This paper deals with the reliability analysis of a complex system with three possibilities at the time of repair. The considered system consists of two subsystems A and Bin series configuration (1-out-of-2: F). Subsystem A has n units which are connected in series whereas subsystem B consists of n units in parallel configuration. The configuration of subsystem A is of 1-out-of-n: F whereas subsystem B is of k-out-of-n: D and k+1-out-of-n: F nature. System has three states: Good, degraded and failed. Supplementary variable technique has been used for mathematical formulation of the model. Laplace transform is being utilized to solve the mathematical equation. Reliability, Availability, M.T.T.F., Busy Period and Cost effectiveness of the system have been computed. The repairs from state $S_7$ to $S_0$, $S_8$ to $S_0$, $S_9$ to $S_0$ and $S_{11}$ to $S_0$ have two types namely exponential and general. Joint probability distribution of repair rate from $S_7$ to $S_0$, $S_8$ to $S_0$, $S_9$ to $S_0$ and $S_{11}$ to $S_0$ is computed by Gumbel-Hougaard family of copula. Some particular cases of the system have also been derived to see the practical importance of the model.

• 대한간호학회지
• /
• 제39권6호
• /
• pp.781-787
• /
• 2009

Purpose: The purpose of this study was to evaluate a computerized touch-screen version of the asthma-specific quality-of-life (cA-QOL) questionnaire against the conventional paper-and-pencil version (pA-QOL) for equivalence, time for completion, user preference, and ease of use. Methods: A total of 261 patients were recruited. A randomized cross-over design was used. Patients in group A completed the cA-QOL first while waiting to see a physician, and completed the pAQOL version after seeing the physician. Patients allocated in group B completed these questionnaires in the reverse order. The patients were asked questions about user preference and ease of use of the cA-QOL. The time taken to complete both versions of the questionnaire was measured. Results: Weighted kappa coefficients of all items showed almost perfect agreement. The time required to complete the pA-QOL is faster than the time for cA-QOL. The patients who preferred the cA-QOL were 37.5%, while those who preferred the pA-QOL were 29.9%. Most patients reported that the cA-QOL was "easy" or "very easy" to complete. Conclusion: The cA-QOL is the computerized equivalent of the pA-QOL. The findings herein demonstrate that the cA-QOL can be helpful to nurses in busy practices for assessing, collecting, and evaluating their patients' health related quality of life.

• 인터넷정보학회논문지
• /
• 제9권2호
• /
• pp.43-50
• /
• 2008

IEEE 802.11b 무선 네트워크에서 스테이션들이 저 전력 모드로 동작할 때, 스테이션들은 액세스 포인트 (AP)가 주기적으로 전송하는 비콘 (beacon)을 수신하여 동기를 맞춘다. 예정된 TBTT (target beacon transmission time)에 무선채널이 사용 중인 경우 비콘 전송이 지연되고 스테이션들은 지연된 비콘을 수신할 때까지 깨어있어야 한다. 이 논문에서는 다음 TBTT까지 데이터를 성공적으로 전송하기에 시간이 적은 경우 스테이션들이 전송을 지연하는 방법을 제안한다. 이 방법으로 매 TBTT 마다 지연이 없는 비콘 전송이 보장되므로 저 전력 스테이션들이 비콘을 수신하기 위해 깨어있는 시간이 줄어든다. 제안된 방법에 대해 모의실험이 수행되었고 결과 분석을 통해 제안된 방법의 특성을 설명하였다. 비콘 지연시간으로 측정된 결과는 에너지 소모가 개선됨을 보여준다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 A
• /
• pp.203-206
• /
• 2003

In this paper we discuss an algorithm for a real time transmission of moving color images on the TCP/IP network using wavelet transform and neural network. The image frames received from the camera are two-level wavelet-transformed in the server, and are transmitted to the client on the network. Then, the client performs the inverse wavelet-fransform using only the received pieces of each image frame within the prescribed time limit to display the moving images. When the TCP/IP network is busy, only a fraction of each image frame will be delivered. When the line is free, the whole frame of each image will be transferred to the client. The receiver warns the sender of the condition of traffic congestion in the network by sending a special short frame for this specific purpose. The sender can respond to this condition of warning by simply reducing the data rate which is adjusted by a back-propagation neural network. In this way we can send a stream of moving images adaptively adjusting to the network traffic condition.

• 제어로봇시스템학회논문지
• /
• 제10권11호
• /
• pp.1077-1081
• /
• 2004

In this Paper we discuss an algorithm for a real-time transmission of moving color image on the TCP/IP network using wavelet transform and neural network. The Image frames received from the camera are two-level wavelet-transformed in the server, and are transmitted to the client on the network. Then, the client performs the inverse wavelet-transform using only the received pieces of each image frame within the prescribed time limit to display the moving images. When the TCP/IP network is busy, only a fraction of each image frame will be delivered. When the line is free, the whole frame of each image will be transferred to the client. The receiver warns the sender of the condition of traffic congestion in the network by sending a special short frame for this specific purpose. The sender can respond to this information of warning by simply reducing the data rate which is adjusted with a neural network or fuzzy logic. In this way we can send a stream of moving images adaptively adjusting to the network traffic condition.

• 한국시뮬레이션학회논문지
• /
• 제8권4호
• /
• pp.61-72
• /
• 1999

This paper presents an estimation method of container handling capacity and selection of resource allocation strategies of container terminals using the computer simulation models. Simulation models are developed to model container terminal consisting of 4 berths considering the berth allocation strategies, crane allocation strategies and the total number of container cranes using Arena simulation package. The proposed models do not consider the yard operations and gate operations. All the input parameters for the models are estimated on the basis of the existing container terminal operation data and the planning data for the automated container terminal planned by Korean government. Four berth allocation strategies and three crane allocation strategies are considered. The total number of container cranes considered ranges from 12 to 15. Non-terminating simulation techniques are utilized for the performance comparison among alternatives. The performance measures such as average ship turnaround time, average ship waiting time, average ship service time, the number of containers handled per year, and the number of ships processed per year are used. The result shows that the berth allocation strategy minimizing the sum of the number of ships waiting, the number of busy container cranes and number of ships handled performs better than any other berth allocation strategies. In addition, the crane allocation strategy allocating up to 5 container cranes per berth performs better than any other crane allocation strategies. Finally there are no significant performance differences among the alternatives consisting of different total number of container cranes allocated.