• Digital Contents
• /
• no.9 s.112
• /
• pp.40-43
• /
• 2002

"복잡한 번역 프로세스를 획기적으로 단축시킬 수 있는 CAT(Computer Aided Technology) 기술과 번역메모리(TM; Translation Memory) 축적을 통해 많은 기업들에게 도움을 줄 수 있을 것으로 확신합니다. 번역을 개인의 노하우에 의존하지 않고 공유할 수 있는 '지식의 자산화'를 위해 ClickQ Travita가 개발된 것입니다." 클릭큐 이청호 사장의 얘기다. 4년간 30억원의 연구개발비를 투자해 개발한 'ClickQ Travita'를 널리 알리는 일만 남았다고 말하는 그는 ClickQ Travita는 기계번역의 한계를 뛰어넘을 휴먼번역 수준으로 올리는데 큰 도움이 될 것으로 확신한다고 말했다.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1996.05a
• /
• pp.10-14
• /
• 1996

본 논문은 토러스 망의 패킷 전송 효율을 평가하기 위해 각 노드가 에지당 2개의 입·출력 큐를 가지는 라우팅 알고리즘을 제시하고 시뮬레이션을 수행하여 그 결과를 분석하였다. 제시된 4가지 오름순차를 가지는 라우팅 알고리즘에 대해 시뮬레이션을 하기 위해 도착분포와 서비스분포는 지수분포를 갖도록하여 교착상태가 없는 패킷 전송 효율을 비교 평가하였다. 실험 결과로부터 무교착 상태로 패킷을 전달하기 위한 노드 큐의 크기를 알 수 있었고, 또한 입력 패킷 메시지의 분포에 따라 패킷의 전송 효율을 높이기 위한 버퍼의 크기를 예측할 수 있었다.

• 프린팅코리아
• /
• s.59
• /
• pp.98-99
• /
• 2007

• Environmental engineer
• /
• s.98
• /
• pp.16-17
• /
• 1994

• The Journal of the Korea Contents Association
• /
• v.5 no.3
• /
• pp.217-225
• /
• 2005

Currently the research on input-queued ATM switches is one of the most active research fields. Many achievements have been made in the research on scheduling algorithms for input-queued ATM switches and also applied in commerce. The scheduling algorithms have the characteristics of improving throughput, satisfying QoS requirements and providing service fairly. In this paper, we studied on an implementation of scheduler which arbitrates the input-queued ATM switches efficiently and swiftly. The proposed scheduler approximately provides $100\%$ throughput for scheduling. The proposed algorithm completes the arbitration for N-port VOQ switch with 4-iterative matching. Also the proposed algorithm has a merit for implementing the scheduling algorithm with 1/2 area compared to that of iSLIP scheduling algorithm which is widely used. The performance of the proposed scheduling algorithm is superior to that of iSLIP in 4-iterative matching.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.517-526
• /
• 2001

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection). While active queue management in routers and gateways can potentially reduce total packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are ineffective in preventing high loss rates. The inherent problem with these queue management algorithms is that they all use queue lengths as the indicator of the severity of congestion. In this paper, in order to solve this problem, a new active queue management algorithm called MRED(Modified Random Early Detection) is proposed. MRED computes the packet drop probability based on our heuristic method rather than the simple method used in RED. Using simulation, MRED is shown to perform better than existing queue management schemes. To analyze the performance, we also measure throughput of traffics under the FIFO control, and compared the performance with that of this MRED system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1B
• /
• pp.59-66
• /
• 2012

The use of MPSoC has been increasing because of a rise of use of mobile devices and complex applications. For improving the performance of MPSoC, number of processor has been increasing. Standard MPI is used for efficiently sending data in distributed memory architecture that has advantage in multi processor. Standard In this paper, we propose a scalable distributed memory system with a low cost hardware message passing interface(MPI). The proposed architecture improves transfer rate with buffered send for small size packet. Three queues, Ready Queue, Request Queue, and Reservation Queue, work as previous architecture, and two queues, Small Ready Queue and Small Request Queue, are added to send small size packet. When the critical point is set 8 bytes, the proposed architecture takes more than 2 times the performance improvement in the data that below the critical point.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.79-86
• /
• 2008

As the rapid development of the Internet, the embedded images in HTML web pages nowadays become predominant. For its amazing function in describing the content and attracting attention, images become substantially important in web pages. All these images consist a considerable database. What's more, the semantic meanings of images are well presented by the surrounding text and links. But only a small minority of these images have precise assigned keyphrases. and manually assigning keyphrases to existing images is very laborious. Therefore it is highly desirable to automate the keyphrases extraction process. In this paper, we first introduce WWW image annotation methods, based on low level features, page tags, overall word frequency and local word frequency. Then we put forward our method of multi-cues integration image annotation. Also, show multi-cue image annotation method is more superior than other method through an experiment.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.61-69
• /
• 2008

In order to evaluate the performance of priority queues for future event list in discrete-event simulations, models representing patterns of enqueue and dequeue processes are required. The time complexities of diverse priority queue implementations can be compared using the performance models. This study aims at developing such performance models especially under the environment that a developed simulation model is used repeatedly for a long period. The developed performance model is based on multi-stage Markov process models; probabilistic patterns of enqueue and dequeue are considered by incorporating non-homogeneous transition probability. All necessary parameters in this performance model would be estimated by analyzing a results obtained by executing the simulation model. A case study with a war game simulation model shows how the parameters defined in muti-stage Markov process models are estimated.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.38-47
• /
• 2003

Communication between Bluetooth devices is based on TDD by a master unit. In this discipline, the transmission of slave packets can be made only when the master transmits a packet to the slave. Thus, some slots may be wasted when there is no user data in the master's or slave's queue due to the transmission of a POLL or NULL packet. Therefore a scheduling scheme which can minimize the slot waste is required in Bluetooth intra-piconet communication. However, since the master is responsible for the intra-piconet scheduling, it must be provided with an information on each slave's queue length to apply traditional scheduling schemes. which is impossible in Bluetooth. This paper presents a new Bluetooth intra-piconet scheduling scheme that is efficient and does not require the information on each slave's queue length. The scheduling is done based on the information about the existence of data in the master and slave queues which is derived by the master identifying the type of packets transmitted. The master schedules to communicate with the slaves according to the priorities determined based on this information. We Presents simulation results which indicate a significant improvement in the performance when our proposed scheme is used.