• Proceedings of the Korean Nuclear Society Conference
• /
• 1996.05a
• /
• pp.219-224
• /
• 1996

노심설계에서 현재 사용되는 일체형 가연성 흡수봉인 Gd, ZrB$_2$ 그리고 Er의 한국표준형 원전 노심 설계에의 타당성을 노심 F$\Delta$H 제어, 저누출 장전모형 설계, 농축도/주기길이 그리고 주기말의 잔존 페널티 등의 측면에서 분석하였다. 초기노심의 경우는 영광 3호기 1주기 장전모형에 동일 연료집합체를 사용한 Gd/ZrB$_2$/Er의 경우와 ZrB$_2$/Er 최적장전모형에 동일 연료집합체를 사용한 경우에 대하여 분석하였다. 평형노심은 Gd/ZrB$_2$/Er 모두 동일한 장전모형을 사용한 18개월 주기길이의 노심에 대하여 동일한 농축도에서의 주기길이차이와 동등 주기길이를 내는데 필요한 농축도 요구량에 대하여 분석하였다. 초기노심 평형노심 모두 F$\Delta$H 제어에는 ZrB$_2$/Er가 Gd보다 유리하였으며, 저누출 장전모형의 설계에도 ZrB$_2$와 Er가 Gd보다 유리하였다. 평형노심에서 동일한 주기길이를 내는데 요구되는 농축도는 ZrB$_2$에 비하여 Er는 0.182 w/o Gd는 0.063 w/o 높게 나타났으며 동일 농축도를 사용할 경우 주기길이는 ZrB$_2$에 비하여 Gd는 165 MWD/MTU 그리고 Er은 575 MWD/MTU가 짧게 나타났다. 따라서, F$\Delta$H 제어와 저누출 장전모형은 설계에는 ZrB$_2$와 Er가 Gd보다 유리하였으나 Er의 경우 주기말에서의 잔존 페널티가 매우 크다는 단점이 있다.

• 한국ITS학회:학술대회논문집
• /
• v.2007 no.10
• /
• pp.76-84
• /
• 2007

• Journal of Korean Society of Transportation
• /
• v.22 no.3 s.74
• /
• pp.145-157
• /
• 2004

The cycle length design model of the Korean traffic responsive signal control systems is devised to vary a cycle length as a response to changes in traffic demand in real time by utilizing parameters specified by a system operator and such field information as degrees of saturation of through phases. Since no explicit guideline is provided to a system operator, the system tends to include ambiguity in terms of the system optimization. In addition, the cycle lengths produced by the existing model have yet been verified if they are comparable to the ones minimizing delay. This paper presents the studies conducted (1) to find shortcomings embedded in the existing model by comparing the cycle lengths produced by the model against the ones minimizing delay and (2) to propose a new direction to design a cycle length minimizing delay and excluding such operator oriented parameters. It was found from the study that the cycle lengths from the existing model fail to minimize delay and promote intersection operational conditions to be unsatisfied when traffic volume is low, due to the feature of the changed target operational volume-to-capacity ratio embedded in the model. The 64 different neural network based cycle length design models were developed based on simulation data surrogating field data. The CORSIM optimal cycle lengths minimizing delay were found through the COST software developed for the study. COST searches for the CORSIM optimal cycle length minimizing delay with a heuristic searching method, a hybrid genetic algorithm. Among 64 models, the best one producing cycle lengths close enough to the optimal was selected through statistical tests. It was found from the verification test that the best model designs a cycle length as similar pattern to the ones minimizing delay. The cycle lengths from the proposed model are comparable to the ones from TRANSYT-7F.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1994.11a
• /
• pp.132-156
• /
• 1994

본 논문에서는 비선형 합성 함수를 이용하여 생성된 난수 계열의 특성을 분석한다. 먼저 트레이스 함수 등을 정의하고, 선형 복잡도 및 생성기 구조 분석시 요구되는 관련 이론을 도출하고, 특정 난수 계열이 주어진 경우 이계열을 생성할 수 있는 최소 길이의 LFSR을 합성할 수 있는 USR 합성 알고리듬을 제시한다. 동일한 계열을 위상 천이한 계열간의 비선형 결합으로 생성된 난수 계열과 다른 계열간의 비선형 결합으로 생성된 난수 계열에 대한 주기 및 선형 복잡도 등의 특성을 분석하고 생성기의 구조를 제시한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.475-481
• /
• 2009

The frequency and probability of deadlock are influential factors in the design of algorithms for deadlock. However, little work has been done in this area because it's not easy to analyze how factors such as the characteristics of process or resource, resource request and release patterns, or the number of process affect the occurrence of deadlock. This study was designed to reduce remarkably the number of state by adapting the model 'state (a,b)t' to represent the resource allocation state, as well as to include the effect of resource error rate and recovery rate in the system analysis. Various formulas about deadlock occurrence were resulted in this study such as the average time interval of deadlock, the probability that a process requesting a resource waits or deadlocks, and the probability that a request deadlocks in a cycle of length 2.

• Journal of KIISE:Databases
• /
• v.31 no.4
• /
• pp.422-431
• /
• 2004

In recent years, different models in data delivery have been explored in mobile computing systems. Particularly, there were a lot of research efforts in the periodic push model where the server repetitively disseminates information without explicit request. However, average waiting time per data operation highly depends on the length of a broadcast cycle and different access pattern among clients may deteriorate the response time considerably. In this case, clients are preferably willing to send a data request to the server explicitly through backchannel in order to obtain optimal response time. We call the broadcast model supporting backchannel as hybrid broadcast. In this paper, we devise a new transaction processing algorithm(O-PreH) in hybrid broadcast environments. The data objects which the server maintains are divided into Push_Data for periodic broadcasting and Pull_Data for on-demand processing. Clients tune in broadcast channel or demand the data of interests according to the data type. Periodic invalidation reports from the server support maintaining transactional consistency. If one or more conflicts are found, conflict orders are determined not to violate the consistency(pre-reordering) and then the remaining operations have to be executed pessimistically. Through extensive simulations, we demonstrate the improved throughput of the proposed algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.136-144
• /
• 2003

In this paper, we propose a scheme that can control the loss probability of low priority class bursts by dynamically adjusting the assembly threshold of low priority class. The key ideas is that the loss Probability of the longer burst increases as the load increases, thus reduced low priority class burst length decreases the loss priority at high traffic load. To achieve this aim, we first derive the relation among the loss probability, the assembly threshold, and the traffic load. In this paper we derive the relation by curve fitting on the simulation results. The ingress edge routers periodically or by event-driven receives the proper corresponding assembly threshold information from the core routers. This assembly threshold is calculated from the derived relation so that the required loss probability of the low priority class bursts in the network is satisfied. The simulation results show that the proposed scheme performs well to meet the loss probability target as expected.

• The Bulletin of The Korean Astronomical Society
• /
• v.43 no.1
• /
• pp.48.4-48.4
• /
• 2018

대한민국 달탐사 시험용 궤도선은 2020년 말에 발사를 예정으로 위성개발이 진행되고 있다. KPLO(Korea Pathfinder Lunar Orbiter) 라고 명명된 달 궤도선에는 6개의 탑재체가 있으며, 경희대학교 우주탐사학과에서는 달 주위 공간 및 달 표면의 이상 자기장 영역을 관측하는 탑재체 (KMAG: Kplo MAGnetometer)를 개발하고 있다. 자기장센서는 3축 플럭스게이트 센서를 사용하며 약 0.2nT 이하의 분해능을 가지고 있다. 측정주기는 10Hz이며 총 무게는 3.5kg 이다. 1.2m 길이의 붐(Boom) 구조물 내부에 3개의 자기장 센서들을 설치하였으며 가능한 위성체로부터 거리를 두고 자기장을 측정하는 구조로 구성하였다. 시험모델 개발을 완료하고, 개발된 탑제체의 환경시험결과와 성능시험결과 요구조건에 부합되는 결과를 얻었다. KAMG는 국내최초의 심우주 탐사용 자기장 측정기로서 향 후, 행성 및 소행성 탐사 등에 활용하기 위한 기반 기술로 활용할 수 있을 것으로 기대한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.221-224
• /
• 2008

Anghelescu et al. proposed a block cryptosystem based on 8-cell hybrid additive cellular automata with cycle length 8 using state transition rules 51, 60 (or 102). All states must divided into the same cycles in the diagram of the cellular automata. But there exist cellular automata which don't satisfy this condition in Anghelescu et al.'s cryptosystem. In this paper we analyze hybrid additive cellular automata and propose an improved method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.457-465
• /
• 2003

In this paper, we analyze the performances of variable MAC (Medium Access Control) protocols and present an efficient MAC protocol for Ethernet PON (Passive Optical Network). We consider three MAC protocols: static TDMA, dynamic TDMA, and Interleaved polling. Static TDMA assigns an equal amount of bandwidth to all ONUs regardless of the request information but Dynamic TDMA dynamically allocates the bandwidth to each ONU considering its request. Interleaved Polling operates a cycle with variable time period and a polling method for informing a uplink transmission chance to each ONU. This paper theoretically analyzes the available bandwidth for each of three protocols. We also implement the simulation models for them by using OPNET and evaluates the performances under various bursty traffic environments. The results are compared and analyzed in terms of channel utilization and queueing delay.