http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
다중 스트림에 적합한 효율적인 대역폭 할당 알고리즘 개발
高仁善 弘益大學校 科學技術硏究所 2002 科學技術硏究論文集 Vol.13 No.-
Video on Demand (VoD) service, an algorithm for dynamic bandwidth allocations is essential because the variable bit rate (VBR) of video data streams is inherently bursty. Typical dynamic allocations to competing streams are done in linear proportion to the bandwidth requirements. However, since this scheme has not taken into account statistical nature of compressed video data and constraints of buffers, it is not suitable to directly implement in the scheduler. We propose an algorithm that incorporates fair bandwidth allocation, statistical property of compressed video data, and constraints of buffer. First, we describe the constraints imposed by the buffer to avoid underflow or overflow. Based on these constraints, a new scheme is then designed to ensure a much fairer bandwidth allocation. Finally, the proposed scheme will be verified with video trace, as shown in the following figures via ExSpect 6.1 based on Petri Nets.
스토케스틱 페트리 네트를 이용한 교통량 대응 신호기 설계 및 교통흐름 분석
고인선 대한전자공학회 1999 電子工學會論文誌, S Vol.s36 No.3
본 논문에서는 DSPN(Deterministic and Stochastic Petri Net)을 이용, 교차로에서의 차량 진입과 같은 이산 사건(discrete events)적인 상황을 해석하고, 교통신호기의 동작과 차량흐름을 모델링하였다. 교차로에서의 차량 흐름을 확률적 개념으로 표현하여, 차량 변화에 따른 교차로의 상황을 토큰의 변화로 나타내었다. GreatSPN을 사용한 모의 실험을 통하여, 모델링된 교통신호기하에서의 차량의 평균 지체시간을 분석하였다. 차량 지체시간을 이용하여 단위시간연장 교통량 대응 신호기와 본 논문에서 제안한 최대시간허용 교통량 대응 신호기의 성능을 비교 분석하여, 최대시간허용 교통량 대응 신호기가 단위시간연장 교통량 신호기보다 좋은 특성을 나타냄을 보였다. 2개의 교차로로 이루어진 시스템을 본 논문에서 개발한 기본 모듈들을 서로 연결하여 분석하였고, 이러한 성능 분석을 통하여 주위 여건에 적합한 새로운 교통신호기를 구현할 수 있음을 보였다.
페트리 네트에서 시스템의 분석과 데드락 방지를 위한 short-cut 행렬의 분석
高仁善,金度衡 弘益大學校 科學技術硏究所 2004 科學技術硏究論文集 Vol.15 No.-
This paper discusses the algorithm for finding short-cut matrix defined by us for analysis and deadlock avoidance of system. First, we analyze the system with one shared resource model graphically. Then, we extend graphcal model in detail. Second, we analyze the system in numerical method and find the short-cut matrix. The short-cut matrix is useful thing for analysis for system performance and deadlock avoidance. We propose the method and figure of short-cut matrix for simple reachability tree. So, we can find the synchronic variables for reachability tree and we can have the simple reachability tree.
高仁善,金度衡 弘益大學校 科學技術硏究所 2003 科學技術硏究論文集 Vol.14 No.-
This paper discusses the optimal switching algorithm in packet switching network. In Multimedia Network like VOD(Video On Demand) service, it is important to guarantee the QOS(Quality Of Service) to each clients. In multimedia network system there are many kind of multimedia data - mpeg video, mp 2-layer audio, jpeg image, and so on. We introduce the switching algorithm adapted to each kind of multimedia data guaranteeing the minimum transmission delay. It allows network system to have good throughput and clients to more fast transmissions. In next research, we will considerate the flow error control in fast transmission and adapt proposed algorithm to error-existing network system.
페트리 네트와 퍼지를 이용한 자동화 조립 시스템의 분석
全光鎬,高仁善 弘益大學校 科學技術硏究所 1994 科學技術硏究論文集 Vol.5 No.-
Until recently, the choosing of firing a transition in conflict situations has not been suitable for practical cases. Since the firing transition is decided with a certain priority, DEDS modeled with Petri Nets sometimes shows unrealistic results. This paper presents a method to solve the situation using fuzzy reasoning. The methods given by this paper is applied to controlling an automatic assembling system.
金建勳,高仁善 弘益大學校 科學技術硏究所 1996 科學技術硏究論文集 Vol.7 No.2
The Idling time (IT) matrix is proposed to schedule job patching sequences in automated manufacturing systems. Using the method, the idling time of resources can be minimized. The job sequence is modeled by Neural Petri Nets with a time constraint to generate real time control signals. The results are applied a simple automated assembly system consisting two robots and a conveyor.