• Title/Summary/Keyword: Search software

Search Result 784, Processing Time 0.031 seconds

Design and Analysis of Motion Estimation Architecture Applicable to Low-power Energy Management Algorithm (저전력 에너지 관리 알고리즘 적용을 위한 하드웨어 움직임 추정기 구조 설계 및 특성 분석)

  • Kim Eung-Sup;Lee Chanho
    • Proceedings of the IEEK Conference
    • /
    • 2004.06b
    • /
    • pp.561-564
    • /
    • 2004
  • The motion estimation which requires huge computation consumes large power in a video encoder. Although a number of fast-search algorithms are proposed to reduce the power consumption, the smaller the computation, the worse the performance they have. In this paper, we propose an architecture that a low energy management scheme can be applied with several fast-search algorithm. In addition. we show that ECVH, a software scheduling scheme which dynamically changes the search algorithm, the operating frequency, and the supply voltage using the remaining slack time within given power-budget, can be applied to the architecture, and show that the power consumption can be reduced.

  • PDF

Improved Route Search Method Through the Operation Process of the Genetic Algorithm (유전 알고리즘의 연산처리를 통한 개선된 경로 탐색 기법)

  • Ji, Hong-il;Seo, Chang-jin
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.64 no.4
    • /
    • pp.315-320
    • /
    • 2015
  • Proposal algorithm in this paper introduced cells, units of router group, for distributed processing of previous genetic algorithm. This paper presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was verified superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

Development of Search and Rescue System with Dynamic Model by RF Signal Based LTE (탐색구조 시스템에서의 RF 신호 기반 동역학 모델 적용 및 개발)

  • Jeong, I.C.;Kim, D.W.;Ahn, W.G.;Lee, S.
    • Journal of Satellite, Information and Communications
    • /
    • v.12 no.4
    • /
    • pp.120-124
    • /
    • 2017
  • This paper describes the product of search and rescue system with dynamic model. This spread spectrum system based new standard of COSPAS-SARSAT is results of RF signal generation and transmission. we will test performance evaluation which implement signal process adapting Dynamic model and we will adapt the CAF model using TDOA and FDOA relationship.

A Study on Loading and Scheduling of Assembly Block in Shipbuilding (조선산업에서의 블록 배량계획과 일정계획에 관한 연구)

  • Kim, Ki-Dong;Jeon, In-Woo;Kim, Tae-Hyeon
    • Journal of Industrial Technology
    • /
    • v.22 no.B
    • /
    • pp.61-70
    • /
    • 2002
  • The shipbuilding scheduling has many possible alternatives because of its long time horizon and a lot of jobs, so it is required that the scheduling system can generate and search feasible alternatives rapidly. The scheduling in the assembly shop is initiated by allocating, namely loading, the assembly blocks to each shop. In this step, the resource capacities (such as available man/hour, available crane) of each shop must be considered. The result of loading without above consideration can make the scheduling result based on that infeasible or worse one. In this paper, we developed the optimal scheduling system of shipbuilding, specifically for loading and scheduling of assembly block, using ILOG Solver/Scheduler. ILOG Solver/Scheduler is a general-purposed commercial software which supports to find a feasible or optimal solution using object oriented technique and constraints satisfaction programming, given constraints and objectives. Also, in order to enhance the system performance, we conducted various experiments of ILOG search strategies. The experimental results showed that the impact of search strategies is significant.

  • PDF

Search Range Reduction Algorithm with Motion Vectors of Upper Blocks for HEVC (상위 블록 움직임 벡터를 이용한 HEVC 움직임 예측 탐색 범위 감소 기법)

  • Lee, Kyujoong
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.1
    • /
    • pp.18-25
    • /
    • 2018
  • In High Efficiency Video Coding (HEVC), integer motion estimation (IME) requires a large amount of computational complexity because HEVC adopts the high flexible and hierarchical coding structures. In order to reduce the computational complexity of IME, this paper proposes the search range reduction algorithm, which takes advantage of motion vectors similarity between different layers. It needs only a few modification for HEVC reference software. Based on the experimental results, the proposed algorithm reduces the processing time of IME by 28.1% on average, whereas its the $Bj{\emptyset}ntegaard$ delta bitrate (BD-BR) increase is 0.15% which is negligible.

Development of the integration information search reference system for a Test-bed area

  • Lee, D.H.;Lee, Y.I.;Kim, D.S.;Kim, Yoon-Soo;Kim, I.S.;Kim, Y.S.
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.1418-1420
    • /
    • 2003
  • This presentation summarizes the development of the integration information search system for a Test-bed area located in Daejeon. It will be used for the validation of software components developed for the high resolution satellite image processing. The system development utilizes the Java programming language and implements the web browse capabilities to search, manage, and augment the satellite image data, the Ground Control Point(GCP) data, the spectral information on land cover types, the atmospheric data, and the topographical map.

  • PDF

Optimization by Simulated Catalytic Reaction: Application to Graph Bisection

  • Kim, Yong-Hyuk;Kang, Seok-Joong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.2162-2176
    • /
    • 2018
  • Chemical reactions have an intricate relationship with the search for better-quality neighborhood solutions to optimization problems. A catalytic reaction for chemical reactions provides a clue and a framework to solve complicated optimization problems. The application of a catalytic reaction reveals new information hidden in the optimization problem and provides a non-intuitive perspective. This paper proposes a new simulated catalytic reaction method for search in optimization problems. In the experiments using this method, significantly improved results are obtained in almost all graphs tested by applying to a graph bisection problem, which is a representative problem of combinatorial optimization problems.

An Analysis on Internet Information using Real Time Search Words (실시간 검색어 분석을 이용한 인터넷 정보 관심도 분석)

  • Noh, Giseop
    • The Journal of the Convergence on Culture Technology
    • /
    • v.4 no.4
    • /
    • pp.337-341
    • /
    • 2018
  • As the online media continues to evolve and the mobile computing environment has improved dramatically, the distribution of Internet information has rapidly changed from one-sided to consumer-oriented. Therefore, measuring the interest of Internet information has become an important issue for suppliers and consumers. In this paper, we analyze the Internet information interest by analyzing the duration of real - time query by collecting data for one month by implementing real - time search word provided by domestic Internet information provider.

The Comparative Software Development Cost Model Considering the Change in the Shape Parameter of the Erlang Distribution (어랑분포의 형상모수 변화에 따른 소프트웨어 개발 비용모형에 관한 비교 연구)

  • Yang, Tae-Jin
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.9 no.6
    • /
    • pp.566-572
    • /
    • 2016
  • Software Reliability implemented in software development is one of the most important issues. In finite failure NHPP software reliability models for software failure analysis, the hazard function that means a failure rate may have constant independently for failure time, non-increasing or non-decreasing pattern. In this study, software development cost analysis considering the variable shape parameter of Erlang distribution as the failure life distribution in the software product testing process was studied. The software failure model was applied finite failure Non-Homogeneous Poisson Procedure and the parameters approximation using maximum likelihood estimation was accompanied. Thus, this paper was presented comparative analysis by applying a software failure time data to the software, considering the shape parameter of Erlang distribution for development cost model analysis. When compared to the cost curve in accordance with the shape parameter, the model of smaller shape can be seen that the optimal software release time delay and more cost. Through this study, it is thought that it can serve as a preliminary information which can basically help the software developers to search for development cost according to software shape parameters.

Quasi-Lossless Fast Motion Estimation Algorithm using Distribution of Motion Vector and Adaptive Search Pattern and Matching Criterion (움직임벡터의 분포와 적응적인 탐색 패턴 및 매칭기준을 이용한 유사 무손실 고속 움직임 예측 알고리즘)

  • Park, Seong-Mo;Ryu, Tae-Kyung;Jung, Yong-Jae;Moon, Kwang-Seok;Kim, Jong-Nam
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.7
    • /
    • pp.991-999
    • /
    • 2010
  • In this paper, we propose a fast motion estimation algorithm for video encoding. Conventional fast motion estimation algorithms have a serious problem of low prediction quality in some frames. However, full search based fast algorithms have low computational reduction ratio. In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. The proposed algorithm uses distribution probability of motion vectors and adaptive search patterns and block matching criteria. By taking different search patterns and error criteria of block matching according to distribution probability of motion vectors, we can reduces only unnecessary computations efficiently. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.