• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.12
• /
• pp.1-12
• /
• 1998

In this paper, a design and implementation of VHDL-to-C mapping in the VHDL compiler back-end is described. The analyzed data in an intermediate format(IF), produced by the compiler front-end, is transformed into a C-code model of VHDL semantics by the VHDL-to-C mapper. The C-code model for VHDL semantics is based on a functional template, including declaration, elaboration, initialization and execution parts. The mapping is carried out by utilizing C mapping templates of 129 types classified by mapping units and functional semantics, and iterative algorithms, which are combined with terminal information, to produce C codes. In order to generate the C program, the C codes are output to the functional template either directly or by combining the higher mapping result with intermediate mapping codes in the data queue. In experiments, it is shown that the VHDL-to-C mapper could completely deal with the VHDL analyzed programs from the compiler front-end, which deal with about 96% of major VHDL syntactic programs in the Validation Suite. As for the performance, it is found that the code size of VHDL-to-C is less than that of interpreter and worse than direct code compiler of which generated code is increased more rapidly with the size of VHDL design, and that the VHDL-to-C timing overhead is needed to be improved by the optimized implementation of mapping mechanism.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.6
• /
• pp.25-35
• /
• 1998

The control system architecture in switching systems have undergone numerous changes to provide various call processing capability needed in telecommunication services. During call processing in a distributed switching control environment, the delay effect due to communication among main processors or peripheral controllers is one of the limiting factors which affect the system performance. In this paper, we propose a performance model for an IPC(Inter Processor Communication) interface hardware block which is required on the ATM cell-based message processing in a distributed ATM exchange system, and analyze the primary causes which affect the processor performance through the simulation. Consequently, It can be shown that the local CPU of the several components(resources) related to the IPC scheme is a bottleneck factor in achieving the maximum system performance from the simulation results, such as the utilization of each processing component according to the change of the input message rate, and the queue length and processing delay according to input message rate. And we also give some useful results such as the maximum message processing capacity according to the change of the performance of local CPU, and the local CPU maximum throughput according to the change of average message length, which is applicable as a reference data for the improvement or expansion of the ATM control system.

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

The MAC (Medium Access Control) protocol is needed for the OLT(Optical Line Termination) to allocate bandwidth to ONUs(Optical Network Units) and ONTs(Optical Network Terminations) dynamically in the ATM PON(Passive Optical Network). With the protocol, the OLT gathers ONUs' informations and provides grants efficiently to each ONU. Two important functions of the MAC protocol is the grant request procedure and the grant distribution algrithm. The latter has the greatest arithmetic portion in the TC(Transmission Convergence) module, occupies a relatively large portion of the overall chip area, has often been the limiting factor in terms of speed, and should be designed to guarantee the quality of service for various traffics. In this paper, we implement the MAC with the FPGA which can allocate grants dynamically according to the queue length information and the number of active ONUs and distribute grants uniformly to minimize the cell delay variation for each ONU. The structure of the MAC scheduler for the dynamic bandwidth assignment has a programmable look-up table. Also, it has a simple structure, the less chip area, and the lower delay time.

• Proceedings of the Korean Society of Applied Pharmacology
• /
• 1992.05a
• /
• pp.64-64
• /
• 1992

1. Eudragit RS, RL, E, S 및 L을 이용하여 유중건조법으로 제조한 $\beta$-락탐계 항생제 (Amoxicillin, Cephalexin) 마이크로캅셀 모두가 구상 성형성과 정립성이 양호한 결과를 얻었다. 2. 분리 분산제 (aluminium tristearate)의 양을 고정시켰을 때에는 일정한 입자 분포도를 가지는 마이크로캅셀을 얻을 수 있었고, 양을 증가시켰을 때에는 입자 크기는 작아 졌으며, 용출율은 증가하였다. 3. Eudragit RS 및 S 마이크로캅셀제제로부터의 약물용출은 저조하였고, Eudragit RL 및 L 제제로부터의 약물용출은 양호하였다. 따라서 Eudragit RS/RL 마이크로캅셀제제에서는 Eudragit RL의 양을 증가시킬수록 약물의 용출율이 증가하였으며, Eudragit S/L 마이크로캅셀제제에서는 Eudragit L의 양을 증가시킬수록 약물의 용출율이 증가하였다. 약물방출 실험결과, Amoxicillin 함유Eudragit RS/RL (25/75) 마이크로캅셀, cephalxin함유 Eudragit RS/RL (75/25) 마이크로캅셀 및 Eudragit S/L (75/25) 마이크로캅셀제제는 유용한 제제로 펑가되었다. 또한 수용성 고분자인 polyethylene glycol을 혼합하어 제조하는 것에 의해 방출조절성 마이크로캅셀의 제조가 가능하였다. 유중건조법을 이용하여 본 연구방법으로 저조한 마이크로캅셀제제는 투어횟수를 줄일 수 있을 뿐만 아니라 생체에 대해 안전하고 재현성에 확보되는 유용한 제제로 판단된다. 앞으로 연구를 계속 수행하여, 특히 약물의 물리화학적 성질 및 생제내 투어 후의 생물약제학적 펑가를 엄격히 하므로써 안정성이 심히 문제시되는 다용 약물계열에 대한 조절방출성제제의 개발을 기대할 수 있다.은 해리항수의 역수이므로 해리항수가 적을수록 $\beta$ 수용체에 대한 친화력이 큰 약물이다. 시사되었으며, 이 조직에서 또한 5-$HT_2$와 5-$HT_3$ 수용체의 존재를 확인하고 각각의 기능을 분명히 했다.가 수월하게 하였고 메모리를 동적으로 관리할 수 있게 하였다. 또한 기존의 smpl에 디버깅용 함수 및 설비(facility) 제어용 함수를 추가하여 시뮬레이션 프로그램 작성을 용이하게 하였다. 예를 들면 who_server(), who_queue(), pop_Q(), push_Q(), pop_server(), push_server(), we(), wf(), printfct() 같은 함수들이다. 또한 동시에 발생되는 사건들의 순서를 조종하기 위해, 동시에 발생할 수 있는 각각의 사건에 우선순위를 두어 이 우선 순위에 의하여 사건 리스트(event list)에서 자동적으로 사건들의 순서가 결정되도록 확장하였으며, 설비 제어방식에 있어서도 FIFO, LIFO, 우선 순위 방식등을 선택할 수 있도록 확장하였다. SIMPLE는 자료구조 및 프로그램이 공개되어 있으므로 프로그래머가 원하는 기능을 쉽게 추가할 수 있는 장점도 있다. 아울러 SMPLE에서 새로이 추가된 자료구조와 함수 및 설비제어 방식등을 활용하여 실제 중형급 시스템에 대한 시뮬레이션 구현과 시스템 분석의 예를 보인다._3$", chain segment, with the activation energy of carriers from the shallow trap with 0.4[eV], in he amorphous regions.의 증발산율은 우기의 기상자료를 이용하여 구한 결과 0.05 - 0.10 mm/hr 의 범위로서 이로 인한 강우손실량은 큰 의미가 없음

• Proceedings of the Korean Society of Applied Pharmacology
• /
• 1992.05a
• /
• pp.47-47
• /
• 1992

$\beta$수용체에 대한 차단약으로 propranolol이 1964년에 도입된 후, 현재까지 수십여종의 $\beta$-차단약이 개발되었다. 그중 특이 $\beta$1 수용체에 대해 선택적인 억제효과를 지닌 atenolol, metoprolol, betaxolol, celiprolol 및 최근에 bisoprolol 등이 개발되어 임상적으로 부정맥, 협심증, 고혈압의 치료에 사용되고 있다. 그 작용기전으로는 심박출량의 감소, renin 유리억제, 중추억제효과 등이 제시되고 있으나, 이들의 약효검색은 주로 $\beta$1수용체가 많이 존재하는 심장에 대한 억제효과를 중심으로 실시한다. 즉, SHR 및 개를 사용한 생체실험과 심장, 심방 ($\beta$1) 및 기완지, 혈관($\beta$2)을 이용한 적출장기실험을 통하여 isoproterenol에 대한 억제효과를 용량반응 곡선으로 그리고, Van rossum 법에 의해 pA$_2$ 치를 구하여 $\beta$-차단제의 효력을 평가한다. 특히, pA$_2$ 치가 클수록 $\beta$-차단제의 효력이 큰 약물이다. 또한 수용체 결합실험으로 소의 심실 세포막을 분리하여 $^3$H-DHA 와의 결합실험을 통해 해리항수(Kd) 를 측정하고, 이어서 $^3$H-DHA의 일정농도와 함께 미지의 $\beta$-차단제를 여러 농도로 변화시켜 가하여 치환곡선을 작성한다. 여기에서 얻은 치환약의 $IC_{50}$/ 치로부터 치환약의 해리항수(Ki)를 산출한다. 이때 약물과 수용체의 친화력은 해리항수의 역수이므로 해리항수가 적을수록 $\beta$ 수용체에 대한 친화력이 큰 약물이다. 시사되었으며, 이 조직에서 또한 5-$HT_2$와 5-$HT_3$ 수용체의 존재를 확인하고 각각의 기능을 분명히 했다.가 수월하게 하였고 메모리를 동적으로 관리할 수 있게 하였다. 또한 기존의 smpl에 디버깅용 함수 및 설비(facility) 제어용 함수를 추가하여 시뮬레이션 프로그램 작성을 용이하게 하였다. 예를 들면 who_server(), who_queue(), pop_Q(), push_Q(), pop_server(), push_server(), we(), wf(), printfct() 같은 함수들이다. 또한 동시에 발생되는 사건들의 순서를 조종하기 위해, 동시에 발생할 수 있는 각각의 사건에 우선순위를 두어 이 우선 순위에 의하여 사건 리스트(event list)에서 자동적으로 사건들의 순서가 결정되도록 확장하였으며, 설비 제어방식에 있어서도 FIFO, LIFO, 우선 순위 방식등을 선택할 수 있도록 확장하였다. SIMPLE는 자료구조 및 프로그램이 공개되어 있으므로 프로그래머가 원하는 기능을 쉽게 추가할 수 있는 장점도 있다. 아울러 SMPLE에서 새로이 추가된 자료구조와 함수 및 설비제어 방식등을 활용하여 실제 중형급 시스템에 대한 시뮬레이션 구현과 시스템 분석의 예를 보인다._3$", chain segment, with the activation energy of carriers from the shallow trap with 0.4[eV], in he amorphous regions.의 증발산율은 우기의 기상자료를 이용하여 구한 결과 0.05 - 0.10 mm/hr 의 범위로서 이로 인한 강우손실량은 큰 의미가 없음을 알았다.재발이 나타난 3례의 환자를 제외한 9례 (75%)에서는 현재까지 재발소견을 보이지 않고 있다. 이러한 결과는 다른 보고자들과 유사한 결과를 보이고 있지만 아직까지 증례가 많지 않기 때문에 생존율을 얻기에는 미흡한 점이

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.131-137
• /
• 2004

Conventional traffic signal optimization models assume that green intervals for pedestrian crossings are given as exogenous inputs such as minimum green intervals for straight-ahead movements. As the result, in reality, the green intervals of traffic movements may not distribute adequately by the volume/saturation-flow of them. In this paper, we proposed signal optimization models formulated in BMILP to integrate pedestrian crossings into traffic movements under under-saturated traffic flow. The model simultaneously optimizes traffic and pedestrian movements to minimize weighted queues of primary queues during red interval and secondary queues during queue clearance time. A set of linear objective function and constraints set up to ensure the conditions with respect to pedestrian and traffic maneuvers. Numerical examples are given by pedestrian green intervals and the number of pedestrian crossings located at an arm. Optimization results illustrated that pedestrian green intervals using proposed models are greater than those using TRANSYT-7F, but opposite in the ratios of pedestrian green intervals to the cycle lengths. The simulation results show that proposed models are superior to TRANSYT-7F in reducing delay, where the longer the pedestrian green interval the greater the effect.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.5
• /
• pp.37-45
• /
• 2004

As Internet technologies are mature, many new applications that are different characteristics are emerging. Recently we see wide use of P2P(Peer to Peer) applications of which traffic shows different statistical characteristics compared with traditional application such as web(HTTP) and FTP(File Transfer Protocol). In this paper, we measured subscriber network of KT(Korea Telecom) to analyze P2P traffic characteristics. We show flow characteristics of measured traffic. We also estimate Hurst parameter of P2P traffic and compare self-similarity with web traffic. Analysis results indicate that P2P traffic is much bustier than web traffic and makes both upstream traffic and downstream traffic be symmetric. To predict parameters related QoS such as packet loss and delays we model P2P traffic using two self-similar traffic models and predict both loss probability and mm delay then compare their accuracies. With simulation we show that the self-similar traffic models we derive predict the performance of P2P traffic accurately and thus when we design a network or evaluate its performance, we can use the P2P traffic model as reference input traffic.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.605-614
• /
• 2002

Amount of the web traffic web server handles are explosively increasing, which requires that the performance of the web server should be improved for the various web services. Although the analysis for the HTTP traffic with the proper tuning for the web server is essential, the research relevant to the subject are insignificant. In particular, although most of applications are implemented over HTTP 1.1 protocol, the researches mostly deal with the performance evaluation of the HTTP 1.0 protocol. Consequently, the modeling approach and the performance evaluation over HTTP 1.1 protocol have not been well formed. Therefore, basing on the HTTP 1.1 protocol supporting persistent connection, we present an analytical end-to-end tandem queueing model for web server to consider the specific hardware configuration inside web server beginning at accepting the user request until completing the service. we compare various performances between HTTP 1.0 and HTTP 1.1 under the overloading condition, and then analyze the characteristics of the HTTP traffic that include file size requested to web server, the OFF time between file transfers, the frequency of requests, and the temporal locality of requests. Presented model is verified through the comparing the server throughput according to varying requests rate with the real web server. Thereafter, we analyze the performance evaluation of the web server, according to the interrelation between TCP Listen queue size, the number of HTTP threads and the size of the network buffers.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.513-522
• /
• 2002

Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization which TCP congestion window size is fluctuated during congestion occurred and if RTT (Round Trip Time) is increased, three duplicate ACK packets is not a correct congestion signal because congestion maybe already disappeared and the host may send more packets until receive the three duplicate ACK packets. Recently there is increasing interest in solving end-to-end congestion control using active network frameworks to improve the performance of TCP protocols. ACC (Active congestion control) is a variation of TCP-based congestion control with queue management In addition traffic modifications nay begin at the congested router (active router) so that ACC will respond more quickly to congestion than TCP variants. The advantage of this method is that the host uses the information provided by the active routers as well as the end points in order to relieve congestion and improve throughput. In this paper, we model enhanced ACC, provide its algorithm which control the congestion by using information in core networks and communications between active routers, and finally demonstrate enhanced performance by simulation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.12
• /
• pp.167-175
• /
• 2019

Recently, health examination centers have been changing from auxiliary medical facilities to key and independent medical facilities. However, it is not easy to improve medical facilities, including health examination centers, due to the variable characteristics of the relationship between humans and space. Therefore, this study was done to develop a pedestrian-based discrete event simulation analysis program to examine the problems and develop methods for improvement. The program was developed to analyze five evaluation indices and the density of examinees. The problems were derived by analyzing the required time, capacity, and queue size for each examination through simulations. We reduced the examination time and moving distance, increased the capacity, and distributed the queues by adjusting the medical services and relocating the examination rooms. The results were then quantitatively verified by simulations.