• Title/Summary/Keyword: deletion algorithm

Search Result 74, Processing Time 0.02 seconds

A Selective Video Data Deletion Algorithm to Free Up Storage Space in Video Proxy Server (비디오 프록시 서버에서의 저장 공간 확보를 위한 선택적 동영상 데이터 삭제 알고리즘)

  • Lee, Jun-Pyo;Park, Sung-Han
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.4
    • /
    • pp.121-126
    • /
    • 2009
  • Video poxy server which is located near clients can store the frequently requested video data in storage space in order to minimize initial latency and network traffic significantly. However, due to the limited storage space in video proxy server, an appropriate deletion algorithm is needed to remove the old video data which is not serviced for a long time. Thus, we propose an efficient video data deletion algorithm for video proxy server. The proposed deletion algorithm removes the video which has the lowest request possibility based on the user access patterns. In our algorithm, we arrange the videos which are stored in video proxy server according to the requested time sequence and then, select the video which has the oldest requested time. The selected video is partially removed in order to free up storage space in video poky server. The simulation results show that the proposed algorithm performs better than other algorithms in terms of the block hit rate and the number of block deletion.

Optimization of RC Piers Based on Efficient Reanalysis Technique (효율적인 재해석 기법에 의한 RC 교각의 최적설계)

  • 조효남;민대홍;신만규
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 2000.10a
    • /
    • pp.199-204
    • /
    • 2000
  • In this study, an optimum design algorithm using efficient reanalysis is proposed for seismic design of RC Piers. The proposed algorithm for optimization of RC Piers is based on efficient reanalysis technique. Considering structural behavior of RC Piers, several other approximation techniques, such as artificial constraint deletion is introduced to increase the efficiency of optimization. The efficiency and robustness of the proposed algorithm increase the proposed reanalysis technique is demonstrated by comparing it with a conventional optimization algorithm. A few of design examples are optimized to show the applicability of the proposed algorithm.

  • PDF

An AT2 Optimal Reconfigurable Mesh Algorithm for The Constrained Off-line Competitive Deletion Problem (제한된 오프라인 경쟁삭제 문제를 해결하기 위한 AT2 최적의 재구성 가능 메쉬 알고리즘)

  • Lee, Kwang-Eui
    • The KIPS Transactions:PartA
    • /
    • v.9A no.2
    • /
    • pp.225-230
    • /
    • 2002
  • The constrained off-line competitive deletion problem is a simple form of the set manipulation operations problem. It excludes the insertion operation from the off-line competitive deletion problem. An optimal sequential algorithm and a CREW PRAM algorithm which runs $O(log^2nloglogn)$ time using O(n/loglogn) processors were already presented in the literature. In this paper, we present a reconfigurable mesh algorithm for the constrained off-line competitive deletion problem. The proposed algorithm is executed in a constant time on an $n{\times}n$ reconfigurable mesh, and the result is $AT^2$ optimal.

SCHENSTED INSERTION AND DELETION ALGORITHMS FOR SHIFTED RIM HOOK TABLEAUX

  • Lee, Jaejin
    • Korean Journal of Mathematics
    • /
    • v.14 no.1
    • /
    • pp.125-136
    • /
    • 2006
  • Using the Bumping algorithm for the shifted rim hook tableaux described in [5], we construct Schensted insertion and deletion algorithms for shifted rim hook tableaux. This may give us the combinatorial proof for the orthogonality of the second kind of the spin characters of $S_n$.

  • PDF

Improved Algorithm for Case-Deletion Diagnostic in Mixed Linear Models

  • Lee, Jang-Teak
    • Communications for Statistical Applications and Methods
    • /
    • v.7 no.3
    • /
    • pp.677-686
    • /
    • 2000
  • Outliers may occur with respect to any of the random components in mixed linear models. We develop a use of simple, inexpensive updating formulas to consider the effect of case-deletion for mixed linear models. The method described here requires inversions of an n x n matrix, where n is the number of nonempty cells. A numerical example illustrates the use of computational formulas.

  • PDF

Policy for reducing update duration of materialized views by distinguishing Insertion/Deletion operations (삽입/삭제연산의 구분을 통한 실체뷰 갱신시간의 단축정책)

  • Kim, Geun-Hyeong;Lee, Dong-Cheol
    • The KIPS Transactions:PartD
    • /
    • v.10D no.6
    • /
    • pp.917-926
    • /
    • 2003
  • More views in data warehouse, can respond to the users more rapidly because the user's requests may be processed by utilizing only the materialized views with higher probabilities rather than accessing base relations. But, more views cause longer update duration of all the materialized views. During the update time, queries of users can not be processed because accesses to the datawarehouse are blocked. Thus, the update durations of the materialized views are necessary to be reduced. In this paper, we propose algorithm the update duration of the materialized views owing to managing by distinguishing insecton/deletion operations. Though there might overheads for distinguishing insertion/deletion, we concluded that the proposed algorithm could be excellent than others.

The Study of Video Transcoding and Streaming System Based on Prediction Period

  • Park, Seong-Ho;Kim, Sung-Min;Lee, Hwa-Sei
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.4
    • /
    • pp.339-345
    • /
    • 2007
  • Video transcoding is a technique used to convert a compressed input video stream with an arbitrary format, size, and bitrate into a different attribute video stream different attributes to provide a efficient video streaming service for the customers is dispersed in the heterogeneous networks. Specifically, frames deletion occur in a transcoding scheme that exploits the adjustment of frame rate, and at this time, the loss in temporal relation among frames due to frame deletion is compensated for the prediction of motion estimation by reusing motion vectors in the would-be deleted frames. But the processing time for transcoding don't have an improvement as much as our expectation because transcoding is done only within the transcoder. So in this paper, we propose a new transcoding algorithm based on prediction period to improve transcoding-related processing time. For this, we also modify the existing encoder so as to adjust dynamically frame rate based on the prediction period and deletion period of frames. To check how the proposed algorithm works nicely, we implement a video streaming system with the new transcoder and encoder to which it is applied. The result of the performance test shows that the streaming system with proposed algorithm improve 60% above in processing time and also PSNR have a good performance while the quality of pictures is preserved.

Optimization of Reinforced Concrete Piers Based on Efficient Reanalysis Technique (효율적인 재해석 기법에 의한 철근콘크리트 교각의 최적설계)

  • 조효남;민대홍;신만규
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.14 no.4
    • /
    • pp.505-513
    • /
    • 2001
  • In this study, an optimum design algorithm using efficient reanalysis is proposed for seismic design of Reinforced Concrete (RC) piers. The proposed algorithm for optimization of RC piers is based on efficient reanalysis technique. Considering structural behavior of RC piers, the other approximation technique such as artificial constraint deletion is introduced to increase the efficiency of optimization. The efficiency and robustness of the proposed algorithm including the proposed reanalysis technique is demonstrated by comparing it with a conventional optimization algorithm. A few of design examples are optimized to show the applicability of the proposed algorithm.

  • PDF

Multi-level Optimization for Orthotropic Steel Deck Bridges (강바닥판교의 다단계 최적설계)

  • Cho, Hyo-Nam;Chung, Jee-Sung;Min, Daee-Hong;Lee, Kwang-Min
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2000.04b
    • /
    • pp.439-448
    • /
    • 2000
  • A multi-level design synthesis (MLDA) algorithm for efficiently optimizing orthotropic steel deck bridges is proposed in the paper, because it is usually very difficult to optimize orthotropic steel deck bridges using a conventional single-level (CSL) algorithn since the bridges have a large number of members and show complex structural behaviors. In the proposed MLDS algorithms a coordination method is introduced to divide the bridges into main girders and orthotropic steel decks and decomposition method is also used to reduce the number of design variables of the decks for system level optimization. For efficient optimization of the bridges the MLDS algorithm incorporates the crucial approximation techliques such as constraints deletion and stress reanalysis. The constraint deletion technique for deflection is found to be very useful for the optimization problem of the bridges, since a deflection constraint is usually inactive in the design. Considering the complex system of the bridges, the proposed the efficient stress reanalysis technique may prove to be a very effective method, since it does not require expensive design sensitivity analyses. The applicability and robustness of the MLDS algorithm is demonstrated using various numerical examples and compared with other algorithm presently available so far.

  • PDF

Indexing Methods of Splitting XML Documents (XML 문서의 분할 인덱스 기법)

  • Kim, Jong-Myung;Jin, Min
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.3
    • /
    • pp.397-408
    • /
    • 2003
  • Existing indexing mechanisms of XML data using numbering scheme have a drawback of rebuilding the entire index structure when insertion, deletion, and update occurs on the data. We propose a new indexing mechanism based on split blocks to cope with this problem. The XML data are split into blocks, where there exists at most a relationship between two blocks, and numbering scheme is applied to each block. This mechanism reduces the overhead of rebuilding index structures when insertion, deletion, and update occurs on the data. We also propose two algorithms, Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm which retrieve the relationship between two entities in the XML hierarchy using this indexing mechanism. We also propose a mechanism in which the identifier of a block has the information of its Parents' block to expedite retrieval process of the ancestor-descendent relationship and also propose two algorithms. Parent-Child Block Merge Algorithm and Ancestor-Descendent Algorithm using this indexing mechanism.

  • PDF