• Title/Summary/Keyword: Number Matching

Search Result 803, Processing Time 0.028 seconds

An Efficient Updating Algorithm for IPv6 Lookup based on Priority-TCAM (IPv6 Lookup을 위한 효율적인 Priority TCAM Table 운영 알고리즘)

  • Hong, Seung-Woo;Noh, Sung-Kee;Hong, Sung-Back;Kim, Sang-Ha
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.162-168
    • /
    • 2007
  • TCAM(Ternary content-addressable memory) has been widely used to perform fast routing lookup. It is able to accomplish the LPM(longest prefix matching) search in O(1) time without considering the number of prefixes and their lengths. As compared to software-based solutions, especially for IPv6, TCAM can oner sustained throughput and simple system architecture. However, There is no research for Priority-TCAM which can assign priority to each memory block. This paper addresses the difference or priority-TCAM compared to the existing TCAM and proposes CAO-PA algerian to manage the lookup table efficiently.

Fractal Depth Map Sequence Coding Algorithm with Motion-vector-field-based Motion Estimation

  • Zhu, Shiping;Zhao, Dongyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.242-259
    • /
    • 2015
  • Three-dimensional video coding is one of the main challenges restricting the widespread applications of 3D video and free viewpoint video. In this paper, a novel fractal coding algorithm with motion-vector-field-based motion estimation for depth map sequence is proposed. We firstly add pre-search restriction to rule the improper domain blocks out of the matching search process so that the number of blocks involved in the search process can be restricted to a smaller size. Some improvements for motion estimation including initial search point prediction, threshold transition condition and early termination condition are made based on the feature of fractal coding. The motion-vector-field-based adaptive hexagon search algorithm on the basis of center-biased distribution characteristics of depth motion vector is proposed to accelerate the search. Experimental results show that the proposed algorithm can reach optimum levels of quality and save the coding time. The PSNR of synthesized view is increased by 0.56 dB with 36.97% bit rate decrease on average compared with H.264 Full Search. And the depth encoding time is saved by up to 66.47%. Moreover, the proposed fractal depth map sequence codec outperforms the recent alternative codecs by improving the H.264/AVC, especially in much bitrate saving and encoding time reduction.

Experimental Study of the Axial Slit Wall and Radial Temperature Gradient Effect on Taylor-Couette Flow (Taylor-Couette 유동에서 축방향 홈과 반경방향 온도구배의 영향에 대한 실험적 연구)

  • Lee, Sang-Hyuk;Kim, Hyoung-Bum
    • Journal of the Korean Society of Visualization
    • /
    • v.6 no.2
    • /
    • pp.33-38
    • /
    • 2008
  • The effect of the radial temperature gradient and the presence of slits in the wall of outer of two cylinders involved in creating a Taylor-Couette flow was investigated by measuring the velocity field inside the gap. The slits were azimuthally located along the inner wall of the outer cylinder and the number of slits used in this study was 18. The radius ratio and aspect ratio of the models were 0.825 and 48, respectively. The heating film wrapped around the inner cylinder was used for generating the constant heat flux and we ensured the constant temperature condition at the outer space of the outer cylinder. The velocity fields were measured by using the PIV(particle image velocimetry) method. The refractive index matching method was applied to remove image distortion. The results were compared with plain wall configuration of Taylor-Couette flow. From the results, the presence of slits in the wall of outer cylinder and temperature gradient increased the flow instability.

Motion Search Region Prediction using Neural Network Vector Quantization (신경 회로망 벡터 양자화를 이용한 움직임 탐색 영역의 예측)

  • Ryu, Dae-Hyun;Kim, Jae-Chang
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.1
    • /
    • pp.161-169
    • /
    • 1996
  • This paper presents a new search region prediction method using vector quantization for the motion estimation. We find motion vectors using the full search BMA from two successive frame images first. Then the motion vectors are used for training a codebook. The trained codebook is the predicted search region. We used the unsupervised neural network for VQ encoding and codebook design. A major advantage of formulating VQ as neural networks is that the large number of adaptive training algorithm that are used for neural networks can be applied to VQ. The proposed method reduces the computation and reduce the bits required to represent the motion vectors because of the smaller search points. The computer simulation results show the increased PSNR as compared with the other block matching algorithms.

  • PDF

UHF RFID Dipole Tag Antenna Design Using Flexible Electro-Thread (도전사를 이용한 UHF RFID 다이폴 태그 안테나 설계)

  • Kim, Yeon-Ho;Chung, You-Chung
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.19 no.1
    • /
    • pp.1-6
    • /
    • 2008
  • A wearable T-matching dipole UHF RFID tag antenna has been designed using conductive electro-thread. The conductivity of the electro-thread has been measured depending on the number of twisted thread. The measured conductivity has been used for simulation to have accurate simulation results. The flexible electro-thread or fabric has been used for fabricating the antenna instead of using copper tape since the electro-thread is more flexible and wearable than copper tape. The return loss and reading range of the fabricated electro-thread UHF RFID tag antennas have been tested. The reading range is approximately 2.4 m.

Fuzzy Indexing and Retrieval in CBR with Weight Optimization Learning for Credit Evaluation

  • Park, Cheol-Soo;Ingoo Han
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2002.11a
    • /
    • pp.491-501
    • /
    • 2002
  • Case-based reasoning is emerging as a leading methodology for the application of artificial intelligence. CBR is a reasoning methodology that exploits similar experienced solutions, in the form of past cases, to solve new problems. Hybrid model achieves some convergence of the wide proliferation of credit evaluation modeling. As a result, Hybrid model showed that proposed methodology classify more accurately than any of techniques individually do. It is confirmed that proposed methodology predicts significantly better than individual techniques and the other combining methodologies. The objective of the proposed approach is to determines a set of weighting values that can best formalize the match between the input case and the previously stored cases and integrates fuzzy sit concepts into the case indexing and retrieval process. The GA is used to search for the best set of weighting values that are able to promote the association consistency among the cases. The fitness value in this study is defined as the number of old cases whose solutions match the input cases solution. In order to obtain the fitness value, many procedures have to be executed beforehand. Also this study tries to transform financial values into category ones using fuzzy logic approach fur performance of credit evaluation. Fuzzy set theory allows numerical features to be converted into fuzzy terms to simplify the matching process, and allows greater flexibility in the retrieval of candidate cases. Our proposed model is to apply an intelligent system for bankruptcy prediction.

  • PDF

Large-eddy simulation of channel flow using a spectral domain-decomposition grid-embedding technique (스펙트럴 영역분할 격자 삽입법을 이용한 채널유동의 큰 에디 모사)

  • Gang, Sang-Mo;Byeon, Do-Yeong;Baek, Seung-Uk
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.22 no.7
    • /
    • pp.1030-1040
    • /
    • 1998
  • One of the main unresolved issues in large-eddy simulation(LES) of wall-bounded turbulent flows is the requirement of high spatial resolution in the near-wall region, especially in the spanwise direction. Such high resolution required in the near-wall region is generally used throughout the computational domain, making simulations of high Reynolds number, complex-geometry flows prohibitive. A grid-embedding strategy using a nonconforming spectral domain-decomposition method is proposed to address this limitation. This method provides an efficient way of clustering grid points in the near-wall region with spectral accuracy. LES of transitional and turbulent channel flow has been performed to evaluate the proposed grid-embedding technique. The computational domain is divided into three subdomains to resolve the near-wall regions in the spanwise direction. Spectral patching collocation methods are used for the grid-embedding and appropriate conditions are suggested for the interface matching. Results of LES using the grid-embedding strategy are promising compared to LES of global spectral method and direct numerical simulation. Overall, the results show that the spectral domain-decomposition grid-embedding technique provides an efficient method for resolving the near-wall region in LES of complex flows of engineering interest, allowing significant savings in the computational CPU and memory.

Similarity Measure based on XML Document's Structure and Contents (XML 문서의 구조와 내용을 고려한 유사도 측정)

  • Kim, Woo-Saeng
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.8
    • /
    • pp.1043-1050
    • /
    • 2008
  • XML has become a standard for data representation and exchange on the Internet. With a large number of XML documents on the Web, there is an increasing need to automatically process those structurally rich documents for information retrieval, document management, and data mining applications. In this paper, we propose a new method to measure the similarity between XML documents by considering their structures and contents. The similarity of document's structure is found by a simple string matching technique and that of document's contents is found by weights taking into account of the names and positions of elements. The overall algorithm runs in time that is linear in the combined size of the two documents involved in comparison evaluation.

  • PDF

Oscillatory enclosed buoyant convection of a fluid with the density maximum (사각 밀폐용기 내부의 밀도최대치를 가지는 유체의 공진현상)

  • Lee, Chang-Ho;Hyun, Jae-Min;Kim, Sung-Jin
    • Proceedings of the KSME Conference
    • /
    • 2000.04b
    • /
    • pp.311-315
    • /
    • 2000
  • A numerical investigation is made of time-dependent buoyant convection in a square of a non-Boussinesq fluid. The density-temperature$({\rho}-T)$ relation is modeled by a quadratic function, with the maximum density ${\rho}_M$ at temperature $T_M$. The horizontal walls of the square are insulated, and a pulsating temperature $T_H=T_M+{\Delta}T'\;sin({\omega}{\tau})$ is imposed on the hot vertical sidewall. The temperature at the cold wall $T_c$ is constant. Extensive numerical solutions to the governing Navier-Stokes equations are portrayed. Resonance is identified by monitoring the amplitude of the mid-plane Nusselt number, $A(Nu^*)$. The primary resonance frequency is found by matching ${\omega}$ to the nondimensional basic mode $N_1$ of internal gravity oscillations. Due to the quadratic$({\rho}-T)$ relationship, the effective pulsation frequency for density, $2{\omega}$, is meaningful, which brings forth the secondary resonance frequency, i.e., $2{\omega}=N_1$

  • PDF

Visual Inspection Method by Pyramid Data Structure (IC핀 조사를 위한 시각 조사 방법)

  • 최성진;조동래;김영해;나극환;김춘길
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.5
    • /
    • pp.374-383
    • /
    • 1990
  • For a visual inspectio system to be viable, it must in general achieve the same or lower costs as those incurred by manual methods, it must have a reasonable inspection rate, and it must be reliable and maintainable : for the visual inspection system, inspection at high speed, flexibility for variety of products, and low cost are needed. In order to solve these problems, we propose the visual inspection algorithm by divide-and-conquer technique using the pyramid data structure and the development of simplified pattern matching method. By this method we can reduce the number of data required to compare with patterns and make the inspection time short.

  • PDF