• 디지털융복합연구
• /
• 제14권2호
• /
• pp.235-243
• /
• 2016

모바일 및 사물인터넷 기술의 발전, 대용량 빅데이터 처리, 그리고 클라우드 컴퓨팅 기술의 발전에 힘입어 기존 데이터센터는 클라우드 데이터센터로 변모하고 있다. 클라우드 데이터센터는 ICT 자원들을 가상화하여 운영함으로써 에너지 및 시설 자원을 효율적으로 관리하고 사용자들의 서비스 요구에 빠르게 대응하는 것을 목표로 하고 있다. 이에 따라 클라우드 데이터센터 네트워크는 가상화된 ICT 자원을 효율적으로 제공할 수 있도록 구성되어야 한다. 본 논문은 클라우드 데이터센터에 적합한 네트워크 구조 및 네트워킹 기술을 분석하고 이를 효과적으로 운용하기 위한 방안을 제시한다.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2013년도 추계학술대회
• /
• pp.336-339
• /
• 2013

이동 통신, RFID, GPS 등의 무선 원거리 통신의 발달로 시간의 흐름에 따라 변하는 이동 객체의 위치 정보들을 수집하여 활용하는 위치 기반의 서비스들이 다방면으로 이용되고 있다. 이에 따라 대용량의 이동 객체의 위치 데이터들을 빠르게 검색하기 위한 효율적인 색인 방법과 질의 처리에 대한 연구들이 진행 중이다. 본 논문에서는 이동객체궤적에 대하여 단순화 기법을 사용하여 단순화한 후에 색인구조를 생성하고 이 색인구조를 이용하여 범위질의를 효율적으로 처리할 수 있는 알고리즘을 제안한다. 이동객체궤적의 단순화 기법으로는 Douglas-Peucker 알고리즘을 수정하여 이용한다. 제안된 방법과 기존의 최소 경계 사각형(MBR)을 이용한 색인 방법을 실험을 통하여 비교 및 분석하였다. 실험 결과로 제안된 방법에서는 색인 데이터 량이 상대적으로 작아지고 색인 및 질의 처리방법이 간단하며 기존의 방법보다 시공간적으로 효율적임을 확인하였다.

• 전기학회논문지
• /
• 제60권1호
• /
• pp.201-204
• /
• 2011

For efficient noise reduction in a Fourier transform ion cyclotron resonance (FT-ICR) mass spectrum, a new algorithm was proposed. The suggested algorithm reduces white and electrical noise, and it improves signal-to-noise ratio. This algorithm has been optimized to reduce the noise more efficiently using the traces of signal level. The algorithm has been efficiently combined with derivative window to improve the resolution as well S/N. Time domain data was corrected for DC voltage interference. $t^n$ window was applied in time domain data to improved the resolution. However, $t^n$ window can improve the signal resolution, it will also increase the noise level in frequency domain. Therefore, newly developed noise reduction algorithm will be applied to make a balance between resolving power and S/N ratio for magnitude mode. The trace algorithm can determine the current data point with several data points (mean, past data, calculated past data). In the current calculations, we assumed data points with S/N ratio more than 3 were considered as signal data points. After the windowing and noise reduction, both resolution and signal-to-noise ratio were improved. This algorithm is applicable more efficiently to frequency dependent noise and large size data.

• 대한안전경영과학회지
• /
• 제12권2호
• /
• pp.167-172
• /
• 2010

EPCIS(EPC Information Service) system is a core component of EPCglobal Architecture Framework offering information of the freights, the time of awareness and the location of awareness on the EPCglobal Network. EPCIS Repository continuously stores and manages mass EPCIS Event input data from a great number of RFID devices simultaneously. The Hybrid DBMS can deal efficiently mass necessary data. This study suggest the plan which can efficiently manage EPCIS Repository using Hybrid DBMS. We offer three schema and stores EPCIS Event data to Altibase DB that can efficiently manage EPCIS Repository using Hybrid DBMS and compare the performance about three schema through simulations.

• 융합보안논문지
• /
• 제9권1호
• /
• pp.1-10
• /
• 2009

현재 인터넷을 교육에 이용함으로서 새로운 정보화 시대의 교육 패러다임이 이루어지고 있으며, 이에 따라 교육에서의 인터넷의 활용은 갈수록 증가하는 추세에 있고 인터넷을 이용함으로서 다양한 형태의 교육방법을 선보이고 있다. 교사와 학생들이 웹을 이용함으로서 교사는 수업관리와 학생관리를 편리하고 효율적으로 수행할 수 있으며, 학생들도 학업에 관한 여러 가지 사항을 효율적으로 처리할 수 있는 장점이 있다. 그러나 기존의 시스템은 거의 학습관리를 구현하였으며 학생관리를 위한 시스템의 구현은 저조한편이다. 따라서 본 논문에서는 인터넷을 이용하여 효율적으로 학습 및 학생관리를 할 수 있는 시스템을 설계 및 구현하였다. 구현된 시스템은 크게 교사모듈과 학생모듈을 나누어 설계하였으며 교사모듈에서는 수업관리와 학생관리를 위한 다양한 기능이 포함되어 있으며 학생모듈에도 강의 및 리포트, 성적에 관련된 다양한 기능을 포함하고 있다.

• 한국지능시스템학회논문지
• /
• 제14권1호
• /
• pp.105-111
• /
• 2004

Traveling Salesman Problem(TSP)을 해결하기 위해 DNA 컴퓨팅이 사용되고 있다. 그러나 현재의 DNA 컴퓨팅을, TSP에 적용하였을 때, 정점과 정점사이의 가중치를 효율적으로 표현할 수 없다. 본 논문에서는 TSP의 정점과 정점 사이의 가중치를 효율적으로 표현하기 위해 DNA 컴퓨팅 기법에 DNA 코딩방법을 적용한 ACO(Algorithm for Code Optimization)를 제안한다. 우리는 ACO를 TSP에 적용하였고, 그 결과 ACO 는 Adleman의 DNA 컴퓨팅 알고리즘보다 가변길이의 DNA 코드와 간선의 가중치를 효율적으로 표현할 수 있었다. 또한 ACO 는 Adleman의 DNA 컴퓨팅 알고리즘 보다 탐색 시간과 생물학적 오류율을 50% 정도 줄일 수 있었으며, 빠른 시간 내에 최단경로를 탐색할 수 있었다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2003년도 가을 학술발표논문집 Vol.30 No.2 (1)
• /
• pp.196-198
• /
• 2003

Virtually every digital signal processors(DSPs) support on-chip multi- memory banks that allow the processor to access multiple words of data from memory in a single instruction cycle. Also, all existing fixed-point DSPs have irregular architecture of heterogeneous register which contains multiple register files that are distributed and dedicated to different sets of instructions. Although there have been several studies conducted to efficiently assign data to multi-memory banks, most of them assumed processors with relatively simple, homogeneous general-purpose resisters. Therefore, several vendor-provided compilers fer DSPs were unable to efficiently assign data to multiple data memory banks. thereby often failing to generate highly optimized code fer their machines. This paper presents an algorithm that helps the compiler to efficiently assign data to multi- memory banks. Our algorithm differs from previous work in that it assigns variables to memory banks in separate, decoupled code generation phases, instead of a single, tightly-coupled phase. The experimental results have revealed that our decoupled algorithm greatly simplifies our code generation process; thus our compiler runs extremely fast, yet generates target code that is comparable In quality to the code generated by a coupled approach

• Journal of Information Processing Systems
• /
• 제14권1호
• /
• pp.228-238
• /
• 2018

With the rapid advancement of Internet services, there has been a dramatic increase in services that dynamically provide Internet resources on demand, such as cloud computing. In a cloud computing service, because the number of users in the cloud is changing dynamically, it is more efficient to utilize a flexible network technology such as software-defined networking (SDN). However, to efficiently support the SDN-based cloud computing service with limited resources, it is important to effectively manage the flow table at the SDN switch. Therefore, in this paper, a new flow management scheme is proposed that is able to, through efficient management, speed up the flow-entry search speed and simultaneously maximize the number of flow entries. The proposed scheme maximizes the capacity of the flow table by efficiently storing flow entry information while quickly executing the operation of flow-entry search by employing a hash index. In this paper, the proposed scheme is implemented by modifying the actual software SDN switch and then, its performance is analyzed. The results of the analysis show that the proposed scheme, by managing the flow tables efficiently, can support more flow entries.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2015년도 추계학술발표대회
• /
• pp.1295-1298
• /
• 2015

Many firms have used e-business systems to efficiently perform their business in an e-business management environment. Firms have applied their e-business capabilities to management activities in order to raise the performance of business execution in a global market environment. In this business environment, the analysis and management for the performance of a firm's e-business execution need to efficiently build and improve its e-business capability and competitiveness. This research presents an analysis tool for a firm e-business performance to efficiently manage and improve the e-business performance in this environment. The analysis items for a firm e-business performance are developed and extracted from the major components of a general firm performance in previous studies. The generated analysis items were verified by factor analysis and reliability analysis through a pilot test. The developed twelve items were extracted from twenty items by these analyses. This study developed a 12-item tool that can totally analyze a firm e-business performance in an e-business management environment. The developed tool consists of four analysis factors and twelve items.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2013년도 추계학술발표대회
• /
• pp.1367-1369
• /
• 2013

Applying Application-Level Multicast technology (ALM) to Distributed Interactive Applications (DIAs) becomes more and more popular. Especially for DIAs embedded priority that the sender forwards data to receivers due to their respective priorities. The priority-based directed minimum spanning tree (PST) algorithm was designed for these DIAs. However, the PST has no efficient priority selection and filtering mechanism. The system will consume a tremendous amount of resource for reconstructing distribution tree and becomes unstable and unscalable. In this paper, First, We propose a novel priority-based application level multicast algorithm: Predict-and-Quantize for Priority with directed minimum Spanning Tree (PQPST), which can efficiently predict efficient priorities for the receivers and quantize the predicted priorities to build the multicast distribution tree. Second, we propose Priority Discrepancy Heuristic Mechanism (PDHM), which sets different thresholds of priority discrepancy within the priority discrepancy interval to control the distribution tree construction can efficiently decrease the repeated distribution tree construction, and we get the best heuristic priority discrepancy interval by PQPST. According to the simulation results, the PQPST and PDHM can efficiently improve the performance of the PST algorithm.