• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8B
• /
• pp.1333-1340
• /
• 2000

This paper shows that the Kronecker sequence, the rapid acquisition spreading code, can be used in packet wireless data communication systems. The general properties of the Kronecker sequence such as construction and correlation characteristics are described, and it is shown that the Kronecker sequence can use a partial-period correlation for a faster acquisition. Based on above Properties, it can be expected that the Kronecker sequence can be used in packet communication systems because the probability of false alarm for the Kronecker sequence is lower and flatter(that is, less sensitive to Ec/No variations) than that for the PN sequence under the assumption that both sequences have the same acquisition time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1399-1405
• /
• 2003

This paper proposes an MAC protocol for fair packet data services in stoned CDMA system. In slotted CDMA system, the packets transmitted in the same slot act as multiple access interference, so that unsuccessful packet transmissions are entirely caused by multiple access interference. Therefore, in order to get the optimal system throughput, the number of simultaneously transmitted Packets should be kept at a proper level. In the proposed protocol, the base station calculates the new and retransmitted packet transmission probability of mobile stations according to the offered load and then broadcasts these probabilities. Mobile stations, which have a packet, attempt to transmit packet with the received probabilities. Simulation results show that the proposed scheme can offer better system throughput than the conventional scheme, and guarantee a good fairness among all mobile stations regardless of the offered load.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.6
• /
• pp.1-9
• /
• 2013

The studies on the shortest path algorithms based on Dijkstra algorithm has been done continuously to decrease the time for searching. $A^*$ algorithm is the most represented one. Although fast searching speed is the major point of $A^*$ algorithm, there are high rates of failing in search of the shortest path, because of complex and irregular networks. The failure of the search means that it either did not find the target node, or found the shortest path, witch is not true. This study proposed $A^*$ algorithm applying method that can reduce searching failure rates, preferentially organizing the relations between the starting node and the targeting node, and appling it in reverse according to the organized path. This proposed method may not build exactly the shortest path, but the entire failure in search of th path would not occur. Following the developed algorithm tested in a real complex networks, it revealed that this algorithm increases the amount of time than the usual $A^*$ algorithm, but the accuracy rates of the shortest paths built is very high.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.11
• /
• pp.908-918
• /
• 2000

캐쉬의 성능을 향상시키는 가장 효과적인 방법은 프로그램 수행 특성에 내재되어 있는 시간적 (temporal locality) -공간적 지역성 (spatial locality)을 활용하는 것이다. 본 논문에서는 추가적인 장치나 컴파일러의 도움 없이 단지 캐쉬의 구조적인 특징과 간단한 메커니즘만을 이용하여 두 가지 타입의 지역성을 효과적으로 반영할 수 있는 새로운 캐쉬 시스템이 제안된다. 제안하는 새로운 캐쉬 시스템은 다른 블록 크기와 다른 연관도를 가지는 두 개의 캐쉬로써 구성되어 진다. 즉 작은 블록 크기를 지원하는 직접사상 캐쉬 (direct-mapped cache)와 큰 블록을 지원하는 완전 연관 버퍼 (fully-associative buffer)로 구성되어 진다. 큰 블록은 여러 개의 작은 블록으로 구성되어지며 두 캐쉬에서 접근 실패가 발생할 경우 직접사상 캐쉬의 접근 실패가 발생한 작은 블록과 그 이웃 작은 블록을 완전 연관 버퍼에 저장시킴으로써 한번 참조가 일어난 블록의 이웃 블록이 참조될 확률이 높다는 공간적 지역성의 특성을 효과적으로 반영할 수 있다. 또한 참조가 일어난 블록은 제어 비트를 사용하여 선택적으로 작은 블록을 직접사상 캐쉬에 저장함으로써 시간적 지역성을 보다 효과적으로 사용할 수 있다 시뮬레이션 결과에 따르면 기존의 직접사상 캐쉬의 4배 크기보다도 좋은 성능 향상을 보이고 있으며, 동일한 크기의 victim 캐쉬보다 우수한 성능을 보이고 소비 전력 면에서는 5% 정도의 전력 감소를 보이고 있다.

• Journal of Chest Surgery
• /
• v.32 no.6
• /
• pp.599-602
• /
• 1999

A 51-year-old woman was transferred from a private hospital for persistent massive left pleural effusion. Available examination methods did not reveal the cause of the disease. The pleural effusion was confirmed as chylothorax by thoracentesis and chest computed tomography. Previous tube drainage and pleurodesis had failed. Therefore we decided on an operative approach. A left thoracotomy revealed nothing abnormal except for the oozing lymph from the mediastinal pleura, which was sutured by 4-0 prolene. Decortication and pleurodesis were done at the same time. Postoperative course was uneventful and no recurrent pleural effusion was recognized for 3 months. Adult Idiopathic unilateral chylothorax with unknown etiology is rare, but this case was successfully treated with an operative method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.1
• /
• pp.1-8
• /
• 2021

As a nation experiencing rapid economic growth, South Korea and its government have made a continuous effort toward efficient research investments to achieve transformation of the Korean industry for the fourth industrial revolution. To achieve the maximum effectiveness of the research investments, it is necessary to evaluate its funding's worth and default risk. Thus, incorporating the concepts of the Black-Scholes-Merton model and the Greeks, this study develops a default-risk evaluation model in the foundation of a system dynamics methodology. By utilizing the proposed model, this study estimates the monetary worth and the default risks of research funding in the public and private sectors of Information and Communication technologies, along with the sensitivity of the R&D economic worth of research funding to changes in a given parameter. This study finds that the public sector has more potential than the private sector in terms of monetary worth and that the default risks of three types of research funding are relatively high. Through a sensitivity analysis, the results indicate that uncertainty in volatility, operation period, and a risk-free interest rate has trivial impacts on the monetary worth of research funding, while volatility has large impacts on the default risk among the uncertain factors.

• 한국벤처창업학회:학술대회논문집
• /
• 2020.06a
• /
• pp.135-139
• /
• 2020

2019년 장애인경제활동실태조사에 따르면 장애인의 고용률은 35%, 실업률은 6.6%로 우리나라 전체 경제 활동 인구의 고용률 61.5%, 실업률 4.4%와 비교할 때 매우 낮은 수준을 보여주고 있다. 상대적으로 저조한 장애인의 취업 및 고용 상황을 개선하기 위하여 정부 주요 부처에서 활발한 노력을 하고 있으나, 장애인의 고용환경은 여전히 열악하여 장애인의 낮은 경제활동 참가율, 직종 선택의 제한, 지원 고용에 비해 낮은 일반고용률, 비정규직 치중 등 열악한 고용 형태의 질적 개선 등 장애인고용에 대한 정책적 지원이 더 개선되고 발전되어야 함을 내포하고 있다. 그에 따른 대안으로 장애인 창업이 주목을 받고 있다. 그러나 창업은 비장애인조차도 성공하기가 어렵고 실패할 확률이 높다. 장애인 창업의 경우 장애라는 특성으로 인해 실패할 경우 재기하기 어려운 상황에 처해질 가능성이 비장애인보다 높다. 따라서 장애인 창업의 특성을 고려하여 성공 창업 요소를 파악할 필요가 있으며, 그에 영향을 미치는 요인들에 관한 연구는 시급한 상황이다. 본 연구의 목적은 비장애인들을 대상으로 이루어진 기회 인식, 창업 의도, 기업가정신에 관한 선행 연구의 연구 결과를 바탕으로 장애인 창업자의 창업의지에 미치는 영향요인을 규명해 보고자 한다. 특히 장애인 창업자의 기회인식과 창업의지 사이에서 기업가 정신(혁신성, 위험 감수성, 진취성)의 매개효과를 검증하며, 이 과정에서 창업자의 창업 의도를 고취시킬 수 방안에 관해 논의해 보고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4A
• /
• pp.471-480
• /
• 2000

With the limited wireless resources, various traffic in the cellular system is served based on micro-cell or pico-cell structure. The rapid increase in the number of mobile users results in the frequent handoff which is becoming a critical issue. In this paper, we propose a channel allocation scheme to reduce the probability of handoff failure. In this scheme, we provide a guard channel for each service to handle the handoff processes. It maintains the low probability of failure in handoff calls. To prevent the performance degradation due to the traffic variation, we use a channel arbitration method that adaptively manages the number of channels based on the call density. We evaluated the performance in terms of the initial call blocking probability and the handoff call blocking probability for various traffic and motility. We found that the proposed scheme keeps the lower probability of call blocking through the efficient channel arbitration than other suggested methods even for the irregular traffic conditions.

• Journal of Navigation and Port Research
• /
• v.34 no.6
• /
• pp.405-415
• /
• 2010

To assess the possible collision risk between Mokpo Harbour Bridge, which is under construction, and passing vessels, we proposed Real-Time Bridge-Vessel Collision Model (RT-BVCM) in this paper. The mathematical model of RT-BVCM consists of the causation probability by the vessel aberrancy due to navigation environments, the geometric probability by the structural feature of a bridge relative to a ship size and, the failure probability by the ship collision track and the stopping distance which is not to come to a stop before hitting the obstacles. Then, the probabilistic mathematical model represented as risk index with the risk level from 1 to 5. The merit of the proposed model to the collision model proposed by AASHTO (American Association of State Highway and Transportation Officials) is that it can provide enough time to take adequate collision avoiding action. Through the simulation tests to the two kinds of test ships, 3,000 GT and 10,000 GT, it is cleary found that the proposed model can be used as a collision evaluation model to the passing vessel and Mokpo Harbour Bridge.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.4
• /
• pp.1-10
• /
• 2001

The 3-step cell search has been considered for fast acquisition of the scrambling code unique to a cell in the W -CDMA system. In this paper, the performance of the cell search scheme is analyzed in Rayleigh fading channels. And the system parameters for cell search scheme and the design parameters for the receivers are examined. The probabilities of detection, miss and false alarm for each step are derived in closed forms based on the statistics of CDMA noncoherent demodulator output. Through the analysis, the effect of threshold setting and post detection integration for each step is investigated, and the optimal values of the power allocation for the synchronization channels are also considered. The number of post-detection integrations for each step is a design parameter for the receiver, and the optimum values may depend on not only the power allocation for each channel related to the cell search, but the false alarm penalty time. It is shown that optimal values could be determined through the analysis. Also, the cumulative probability distribution of the average cell search time is obtained.