• 한국CDE학회논문집
• /
• 제14권6호
• /
• pp.404-414
• /
• 2009

In the computational molecular analysis, 3D structural comparison for protein searching plays a very important role. As protein databases have been grown rapidly in size, exhaustive search methods cannot provide satisfactory performance. Because exhaustive search methods try to handle the structure of protein by using sphere set which is converted from atoms set, the similarity calculation about two sphere sets is very expensive. Instead, the filter-and-refine paradigm offers an efficient alternative to database search without compromising the accuracy of the answers. In recent, a very fast algorithm based on the inter-atomic distance has been suggested by Ballester and Richard. Since they adopted the moments of distribution with inter-atomic distance between atoms which are rotational invariant, they can eliminate the structure alignment and orientation fix process and perform the searching faster than previous methods. In this paper, we propose a new 3D shape descriptor. It has properties of the general shape distribution and useful property in screening the molecular database. We show some experimental results for the validity of our method.

• 정보처리학회논문지A
• /
• 제17A권5호
• /
• pp.221-228
• /
• 2010

최근 문자열 연산들이 계산 생물학 및 인터넷의 보안, 검색 분야에 응용되면서 효율적인 문자열 연산을 위한 다양한 자료구조와 알고리즘이 연구되고 있다. suffix-prefix가 일치하는 모든 쌍 찾기는 두 개 이상의 문자열이 주어질 때 각 쌍의 문자열에 대해 가장 긴 suffix와 일치하는 prefix를 찾는 것으로 가장 짧은 슈퍼스트링을 검출하는 근사 알고리즘에서 사용될 뿐만 아니라 생물정보학, 데이터 압축 분야에서도 중요하게 사용된다. 본 논문에서는 접미사 배열을 이용하는 suffix-prefix가 일치하는 모든 쌍 찾기 알고리즘을 제안하며 O($k{\cdot}m$) 시간 복잡도를 가진다. 접미사 배열 알고리즘이 접미사 트리 알고리즘 보다 소요 시간과 메모리 면에서 더 우수함을 실험을 통해서 제시한다.

• ETRI Journal
• /
• 제32권4호
• /
• pp.577-587
• /
• 2010

The layered coding structure of scalable video coding (SVC) with adaptive inter-layer prediction causes noticeable computational complexity increments when compared to existing video coding standards. To lighten the computational complexity of SVC, we present a fast algorithm to speed up the inter-mode decision process. The proposed algorithm terminates inter-mode decision early in the enhancement layers by estimating the rate-distortion (RD) cost from the macroblocks of the base layer and the enhancement layer in temporal, spatial, and inter-layer directions. Moreover, a search range decision algorithm is also proposed in this paper to further increase the motion estimation speed by using the motion vector information from temporal, spatial, or inter-layer domains. Simulation results show that the proposed algorithm can determine the best mode and provide more efficient total coding time saving with very slight RD performance degradation for spatial and quality scalabilities.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권6호
• /
• pp.2282-2303
• /
• 2021

To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

• 전자공학회논문지 IE
• /
• 제43권4호
• /
• pp.43-51
• /
• 2006

RSST를 이용한 분할법은 정확한 영역 경계를 추출과 분할결과의 해상도를 조절 등의 많은 장점을 가지고 있다. 본 논문에서는 영상분할을 위한 세 가지 고속 RSST 알고리듬을 제안한다. 첫 번째 방법에서는 고속 가지검색을 위해 가중치의 크기에 따라 가지들을 분류한다. 두 번째 방법은 RSST 구성 전에 매우 유사한 가지들을 제거된다. 세 번째 방법에서는 시각적으로 중요하지 않은 소영역의 가지들을 제거된다. 제안된 알고리듬들을 영상분할에 적용한 결과 기존의 RSST와 비교하여 PSNR과 화질의 저하가 거의 없이 RSST 수행시간을 10 $\sim$ 40배 정도 줄일 수 있었다.

• 전기전자학회논문지
• /
• 제22권4호
• /
• pp.1158-1162
• /
• 2018

안티-하모닉락 기능을 가지는 고속-락킹 MDLL 기반의 디지털 클락 주파수 증배기를 소개한다. 제안하는 디지털 주파수 증배기는 하모닉락 문제 없이 빠른 락킹 시간을 구현하기 위하여 새로운 MSB-구간 검색 알고리즘을 사용한다. 제안하는 디지털 MDLL 주파수 증배기는 65nm CMOS 공정으로 설계되었으며, 1 GHz ~ 3 GHz의 출력 동작주파수 영역을 가진다. 제안하는 디지털 MDLL은 프로그래머블한 N/M (N=1, 4, 5, 8, 10, M=1, 2, 3)의 분수배 주파수 증배 기능을 제공한다. 제안하는 MDLL은 1GHz에서 3.52 mW의 전력을 소모하고, 14.07 ps의 피크-투-피크 (p-p) 지터를 갖는다.

• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• 제4B권4호
• /
• pp.211-216
• /
• 2004

Inductance characteristics, torque variations and ripple according to current, and position of multi-layer buried magnet synchronous machines with field-weakening operations are presented. The rotor structure optimal design of a buried magnet synchronous machine with high performance is investigated, and optimization results and comparison among design candidates are shown. For the fast and accurate search of multiple optima, the auto-tuning niching genetic algorithm is used and a final solution is selected considering various design factors.

• 한국전자통신학회논문지
• /
• 제9권1호
• /
• pp.33-40
• /
• 2014

본 논문에서는 웨이블릿 변환 특성을 이용한 대역별 계층적 비트 플레인을 구성, 비트 플레인별로 순차적 전송을 수행하는 새로운 영상 부호화 방법을 제안한다. 제안한 방식은 Antonini의 웨이블릿 기저함수를 사용하여 대역 분할된 영상을 특정대역과 다양한 해상도를 갖는 대역들로 나누어 분리함으로써 다해상도를 지원한다. 대역별 특성을 고려한 부호화의 전송 시 대역별 영상의 우선순위를 고려할 수 있고, 영상의 고속 검색에도 응용될 수 있다.

• 산업경영시스템학회지
• /
• 제19권40호
• /
• pp.169-178
• /
• 1996

Geographically dispersed computing system is made of computers interconnected by a telecommunications network. To make the system operated efficiently, system designer must determine the allocation of data files to each node. In designing such distributed computing system, the most important issue is the determination of the numbers and the locations where database files are allocated. This is commonly referred to as the file allocation problem (FAP)[3]. The proposed model is a 0/l integer programming problem minimizing the sum of file storage costs and communication(query and update) costs. File allocation problem belongs to the class of NP-Complete problems. Because of the complexity, it is hard to solve. So, this paper presents an efficient heuristic algorithm to solve the file allocation problem using Tabu Search Technique. By comparing the optimal solutions with the heuristic solutions, it is believed that the proposed heuristic algorithm gives good solutions. Through the experimentation of various starting points and tabu restrictions, this paper presents fast and efficient method to solve the file allocation problem in the distributed computing system.

• 전기학회논문지
• /
• 제56권3호
• /
• pp.451-456
• /
• 2007

This paper presents a problem that reconfigure distribution power system using branch exchange method. Optimal reconfiguration problem calculates line loss, voltage condition about system states of all situations that become different according to line On/off status, and search for optimum composition of these. However, result is difficult to be calculated fast. Because radiated operation condition of system is satisfied using many connection and sectionalize switches in the distribution power system. Therefore, in this paper, optimization method for reducing system total loss and satisfying operating condition of radial and constraints condition of voltage is proposed using the fastest branch exchange. And optimal solution at branch exchange algorithm can be wrong estimated to local optimal solution according to initial operating state. Considering this particular, an initial operating point algorithm is added and this paper showed that optimal solution arrives at global optimal solution.