http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
주운기 한국경영과학회 1997 한국경영과학회 학술대회논문집 Vol.- No.2
As the increasing the demand on information service, high-capacity and high-speed telecommunication networks are required. For the networks, very intelligent telecommunication equipments such as DCS(Digital Cross-connect System) will be employed for the fast service on the various types of information including voice, data and image, This paper considers the transmission networks composed of DCSs and optical fibers as nodes and links of the networks, respectively. For the networks, some types of restoration algorithms are compared their characteristics for their potential applications, And a distirbuted control algorithm is described as an empirical example which is implemented on the BDCS(Broadband Digital Dross-connect System), where the BDCS is a type of DCS developed in Korea, Finally, some remarks on the associated further researches are added.
주운기 대한산업공학회 2009 대한산업공학회 추계학술대회논문집 Vol.2009 No.10
This paper considers localization methods for target locations. For the localization. we can use Global Positing System, mobile phone, or wireless Local Area Network. This paper classifies and discusses the advantage and disadvantages of the localization methods. Based upon the classification, this paper derives some topics for the further studies.
주운기 대한산업공학회 2008 대한산업공학회 추계학술대회논문집 Vol.2008 No.11
This paper considers a single machine scheduling problem. The machine processes given multiple jobs and then reworks the defected jobs resulted from the first work. The objective is to find an optimal schedule which minimizes makespan or total flow time. For minimization the makespan, this paper characterizes an optimal sequencing rule. By the way, this paper suggests to use a heuristic algorithm for minimization the total flow time even though two properties on the optimal solution are derived.
주운기,이형섭,이형호 한국경영과학회 2001 한국경영과학회 학술대회논문집 Vol.- No.1(2)
This paper considers a scheduling algorithm for high-speed routers , where the router has an N×N port input-queued switch and the input queues are composed of N VOQ(Virtual Output Queue)s at each input port. The objective of the paper is to develope a scheduling algorithm which minimizes mean tardiness under a common due date. T he paper characterizes the optimal solution properties to guarantee the QoS(Quality-of-Service) requirement of individual packet. And the paper suggests a heuristic scheduling algorithm for efficient switching.