• 전자통신동향분석
• /
• 제35권3호
• /
• pp.66-75
• /
• 2020

As the increasing expectations of a practical AI (Artificial Intelligence) service makes AI algorithms more complicated, an efficient processor to process AI algorithms is required. To meet this requirement, processors optimized for parallel processing, such as GPUs (Graphics Processing Units), have been widely employed. However, the GPU has a generalized structure for various applications, so it is not optimized for the AI algorithm. Therefore, research on the development of AI processors optimized for AI algorithm processing has been actively conducted. This paper briefly introduces an AI processor especially for inference acceleration, developed by the Electronics and Telecommunications Research Institute, South Korea., and other global vendors for mobile and server platforms. However, the GPU has a generalized structure for various applications, so it is not optimized for the AI algorithm. Therefore, research on the development of AI processors optimized for AI algorithm processing has been actively conducted.

• Journal of applied mathematics & informatics
• /
• 제35권5_6호
• /
• pp.623-649
• /
• 2017

Retrial queues have been widely used to model the many practical situations arising from telephone systems, telecommunication networks and call centers. An approximation method for a simple Markovian retrial queue by reducing the two dimensional problem to one dimensional problem was presented by Fredericks and Reisner in 1979. The method seems to be a promising approach to approximate the retrial queues with complex structure, but the method has not been attracted a lot of attention for about thirty years. In this paper, we exposit the method in detail and show the usefulness of the method by presenting the recent results for approximating the retrial queues with complex structure such as multi-server retrial queues with phase type distribution of retrial time, impatient customers with general persistent function and/or multiclass customers, etc.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.301-304
• /
• 1998

Now, the world is faced with radical changing in the new rvolution which is followed by speading and utilization of internet. The domain names which are currently used on the internet are unique throgh out the world. Therefore, U.S government positively intervenes in the management of the internet domain name for the effective implementation. The thesis descrbes research of the korean domain name system which allows us to use korea character into current internet domain name system and implements the architecture of the korean domain name system by analysis the structure and behavior of domain name server.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2011년도 춘계학술대회
• /
• pp.245-247
• /
• 2011

모바일 기상 정보 서비스에서 USN, 휴대폰, 대중 교통차량 등 다양한 클라이언트로부터 센싱된 데이터는 무선 통신망을 통하여 서버에 수집되어야 한다. 수집된 데이터는 지속적으로 증가하는 대용량 데이터로서 특별한 쿼리 방법과 자료 구조가 요구된다. 이 논문은 기상 정보 서비스를 위해 필요한 시스템 구조를 설계하고 자료구조와 쿼리 유형을 분석한다.

• 한국컴퓨터산업학회논문지
• /
• 제3권8호
• /
• pp.1019-1026
• /
• 2002

이기종 분산환경에서 객체지향기술과 분산기술에 기반한 개방형 정보 통신망 구조의 연구가 진행되고 있다. 객체 그룹화의 목적은 다양하고 복잡한 분산 멀티미디어 서비스를 단순하게 관리하고 서비스를 지원하는데 있다. 본 논문은 이러한 분산 객체그룹 플랫폼 상에 편집자 직접조판을 위한 CTS를 설계한다. 논문의 결과로서 분산CTS 시스템의 기본구조와 객체들 간의 서비스 인터페이스를 설계한다.

• 한국정보통신학회논문지
• /
• 제10권5호
• /
• pp.821-831
• /
• 2006

본 논문에서는 인터넷 기반의 컴퓨터를 이용하여 전화교환 및 통신이 가능하도록 하는 B-ISDN 인터넷 폰 교환 시스템의 구현을 위한 개발방법 및 설계에 관해 연구하였다. 인터넷 폰 시스템의 단말과 교환서버의 구조를 설계하고, 호제어 메세지와 자료구조를 정의하고, 사용자간 통화를 위한 착발신 단말 간의 호제어 메세지의 흐름을 상세 설계하였다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제55권2호
• /
• pp.72-74
• /
• 2006

In this paper, a wireless multimedia service interacting with key input of a phone number is Presented. In the conventional handset, when the key button is pressed, numbers are displayed or the embedded sound is played. Also, the contents are fixed and cannot be changed. In this paper, we propose a wireless multimedia service playing multimedia contents in accordance with the key input of a phone number. The contents can be downloaded from the wireless internet server. To implement this service, file format, fast codec and download structure are proposed. Using the presented structure, this service is being provided by a telecommunication company in Korea. Various applications based on this service are being expected.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2000년도 가을 학술발표논문집 Vol.27 No.2 (1)
• /
• pp.113-115
• /
• 2000

A GIS software GEO Millennium SystemTM has been developed to integrated with spatial database that combines conventional and spatially related data. As we known well the standard query language lacks the support of spatial data type and predicate, and can not serve as the query language in the spatial database directly; some extended strategies have been proposed, but some of them need their own storage manager, some introfuce new clause into the SELECT-FROM-WHERE structure, and some is very complex and available to us. So we designed our own query language on the conventional storage manager system. It supports the Spatial Data Type and predicate, and provides the full query capabilities of SQL on the non-spatial part of the database while being tightly integrated with the spatial part, without changing the standard SQL structure.

• 융합보안논문지
• /
• 제8권4호
• /
• pp.81-89
• /
• 2008

상황인지에 기반한 유비쿼터스 학습서비스 응용모형에 대하여 소개한다. 이동성과 자율성에 기반하여 피학습자에게 WPAN 환경하의 적절한 상황인지 맞춤형 컨텐츠를 제공하고, 학습관리모형을 통해 경험과 선호사항 그리고 후보추천이 서비스제공 시점에 동적으로 재구성되는 서비스 응용 매커니즘을 소개한다. 개방형모형으로써 OSGi 미들웨어를 적용하며, 상황정보 및 프로파일 관리를 위해 메타모형을 통한 동적 재구성 매카니즘이 소개된다.

• 한국정보처리학회논문지
• /
• 제6권5호
• /
• pp.1212-1218
• /
• 1999

This paper proposes a new multipath interconnection network(MIN) structure for improving performance which uses widely in the design of multiprocessing, ATM system and VOD server. For improving performance such as passthrough ratio and packet latency, it proposes new routing method which routes one of the collided packets into the i+1-th switching stage of the adding Banyan MIN network when it occurred collision at the i-th switching stage of the basic MIN again when they collide each other. The new improved performance MIN network has been compared with MBSF, TBSF and PBSF structured MIN network from the viewpoint of passthrough ratio and the number of switching stage vs. passthrough ratio. It is shown to improve a performance and to be a simple structure which reducing the number of switching stage of adding MIN in comparison with other structured MIN including TBSF.