• Title/Summary/Keyword: bit-strings

Search Result 18, Processing Time 0.024 seconds

Large-scale and small-scale self-excited torsional vibrations of homogeneous and sectional drill strings

  • Gulyayev, V.I.;Glushakova, O.V.
    • Interaction and multiscale mechanics
    • /
    • v.4 no.4
    • /
    • pp.291-311
    • /
    • 2011
  • To simulate the self excited torsional vibrations of rotating drill strings (DSs) in vertical bore-holes, the nonlinear wave models of homogeneous and sectional torsional pendulums are formulated. The stated problem is shown to be of singularly perturbed type because the coefficient appearing before the second derivative of the constitutive nonlinear differential equation is small. The diapasons ${\omega}_b\leq{\omega}\leq{\omega}_l$ of angular velocity ${\omega}$ of the DS rotation are found, where the torsional auto-oscillations (of limit cycles) of the DS bit are generated. The variation of the limit cycle states, i.e. birth (${\omega}={\omega}_b$), evolution (${\omega}_b<{\omega}<{\omega}_l$) and loss (${\omega}={\omega}_l$), with the increase in angular velocity ${\omega}$ is analyzed. It is observed that firstly, at birth state of bifurcation of the limit cycle, the auto-oscillation generated proceeds in the regime of fast and slow motions (multiscale motion) with very small amplitude and it has a relaxation mode with nearly discontinuous angular velocities of elastic twisting. The vibration amplitude increases as ${\omega}$ increases, and then it decreases as ${\omega}$ approaches ${\omega}_l$. Sectional drill strings are also considered, and the conditions of the solution at the point of the upper and lower section joints are deduced. Besides, the peculiarities of the auto-oscillations of the sectional DSs are discussed.

A Study on Strong Minutiae Extraction for Secure and Rapid Fingerprint Authentication

  • Han, Jin-Ho
    • International journal of advanced smart convergence
    • /
    • v.6 no.2
    • /
    • pp.65-71
    • /
    • 2017
  • Fingerprints are increasingly used for user authentication in small devices such as mobile phones. Therefore, it is important for Fingerprint authentication systems in personal devices to protect the user's fingerprint information while performing efficiently with a lightweight matching algorithm. In this paper, we propose a new method to extract strong minutiae with unique numbers from fingerprint images. Strong minutiae are at all times obtained from fingerprint images, and can be useful for secure and rapid fingerprint authentication. The binary information of strong minutiae of a fingerprint can be transformed securely and can create cancelable fingerprint templates. Also the bit-strings of strong minutiae decrease computing time necessary for the matching procedure between two fingerprints due to the simplicity of bitwise operations. First, we enroll several fingerprints images of a finger. From these images we select a reference fingerprint and put a number on each minutia. Following this procedure, we search for mated-minutiae between the reference fingerprint and other fingerprints one by one. Finally we derive unique numbers of strong minutiae of the finger. In the experiment with the FVC2004 fingerprint database, we show that using the proposed method, strong minutiae can be extracted successfully.

Improvement of dynamic encoding algorithm for searches (DEAS) using hopping unidirectional search (HUDS)

  • Choi, Seong-Chul;Kim, Nam-Gun;Kim, Jong-Wook;Kim, Sang-Woo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.324-329
    • /
    • 2005
  • Dynamic Encoding Algorithm for Searches (DEAS) which is known as a fast and reliable non-gradient optimization method, was proposed [1]. DEAS reaches local or global optimum with binary strings (or binary matrices for multi-dimensional problem) by iterating the two operations; bisectional search (BSS) and unidirectional search (UDS). BSS increases binary strings by one digit (i.e., 0 or 1), while UDS performs increment or decrement of binary strings in the BSS' result direction with no change of string length. Because the interval of UDS exponentially decreases with increment of bit string length (BSL), DEAS is difficult to escape from local optimum when DEAS falls into local optimum. Therefore, this paper proposes hopping UDS (HUDS) which performs UDS by hopping as many as BSL in the final point of UDS process. HUDS helps to escape from local optimum and enhances a probability searching global optimization. The excellent performance of HUDS will be validated through the well-known benchmark functions.

  • PDF

Space-economical rank and select of two dimensional bit strings (2차원 비트스트링의 공간 효율적 rank와 select)

  • Kim, Tae-Seong;Na, Joong-Chae
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06a
    • /
    • pp.385-387
    • /
    • 2012
  • Succinct 표현은 n개의 이산 객체를 정수 값으로 표현하는 대신 이진화하여 표현하는 방법으로 o(n) bit만을 사용하는 공간 효율적인 방법이다. Succinct 표현을 위한 1차원 비트스트링은 이산 객체의 저장 위치에 접근하기 위해서 rank와 select 함수를 필요로 하며, 다양한 연구들에 의해 현재 rank와 select 함수는 o(n) 비트를 사용하여 O(1) 시간에 수행되고, 실용적인 구현이 가능하다. 또한, 2차원 비트 스트링에 대한 연구도 진행되어, 현재 O($n^2$) bit를 사용하여 O(logn) 시간에 rank를, O($log^2n$) 시간에 select를 수행할 수 있다. 본 논문에서는 2차원 비트스트링 상에서의 rank 및 select 함수를 새롭게 정의하고 o($n^2$) 비트만을 사용하여 O(logn) 시간에 rank 질의를, 그리고 O($log^2n$)시간에 select 질의를 수행할 수 있는 방법을 제안한다.

Study on the Correlation between Digital Images using ICOR (이미지 상관관계함수를 이용한 디지털 영상의 유사도 비교에 관한 연구)

  • Yang, Hyung-Kyu;Choi, Jong-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.3
    • /
    • pp.75-82
    • /
    • 2009
  • The comparison of images uses PSNR generally. In the case that PSNR value is above 35, it is hard to distinguish the quality of images. In 2006 Lee has proposed the protocol to be able to prove ownership of image using publishing MSB bit strings of original image instead of original images and used the new function to measure correlation of MSB bit strings of two images. In the view of measuring the quality of images, correlation is a bit different from PSNR. That is, if an object image to gene ate from an original image has lower quality, PSNR has very low value, but though the quality is bad, correlation of the images is very high in the view of similarity. In this paper, we modify MSB comparison function that LEE suggested and propose the ICOR function, then analyze the possibility to decide correlation of two images.

A 8-bit Variable Gain Single-slope ADC for CMOS Image Sensor

  • Park, Soo-Yang;Son, Sang-Hee;Chung, Won-Sup
    • Journal of IKEEE
    • /
    • v.11 no.1 s.20
    • /
    • pp.38-45
    • /
    • 2007
  • A new 8-bit single-slope ADC using analog RAMP generator with digitally controllable dynamic range has been proposed and simulated for column level or per-pixel CMOS image sensor application. The conversion gain of ADC can he controlled easily by using frequency divider with digitally controllable diviber ratio, coarse/fine RAMP with class-AB op-amp, resistor strings, decoder, comparator, and etc. The chip area and power consumption can be decreased by simplified analog circuits and passive components. Proposed frequency divider has been implemented and verified with 0.65um, 2-poly, 2-metal standard CMOS process. And the functional verification has been simulated and accomplished in a 0.35$\mu$m standard CMOS process.

  • PDF

Analysis of hash functions based on cellular automata (셀룰러 오토마타 기반 해쉬 함수 분석)

  • Jeong Kitae;Lee Jesang;Chang Donghoon;Sung Jaechul;Lee Sangjin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.6
    • /
    • pp.111-123
    • /
    • 2004
  • A hash function is a function that takes bit strings of arbitrary length to bit string of fixed length. A cellular automata is a finite state machine and has the property of generating pseudorandom numbers efficiently by combinational logics of neighbour cells. In [1] and [7], hash functions based on cellular automata which can be implemented efficiently in hardware were proposed. In this paper, we show that we can find collisions of these hash functions with probability 0.46875 and 0.5 respectively.

Genetic-Fuzzy Controller for Induction Motor Speed Control (유도전동기의 속도제어를 위한 유전-퍼지 제어기)

  • Kwon, Tae-Seok;Kim, Chang-Sun;Kim, Young-Tae;Oh, Won-Seok;Sin, Tae-Hyun;Kim, Hee-Jun
    • Proceedings of the KIEE Conference
    • /
    • 1999.07f
    • /
    • pp.2742-2744
    • /
    • 1999
  • In this paper, an auto-tuning method for fuzzy logic controller based on the genetic algorithm is presented. In the proposed method, normalization parameters and membership function parameters of fuzzy controller are translated into binary bit-strings, which are processed by the genetic algorithm in order to be optimized for the well-chosen objective function (i.e. fitness function). To examine the validity of the proposed method. a genetic algorithm based fuzzy controller for an indirect vector control of induction motors is simulated and experiment is carried out. The simulation and experimental results show a significant enhancement in shortening development time and improving system performance over a traditional manually tuned fuzzy logic controller.

  • PDF

Data hiding in partially encrypted HEVC video

  • Xu, Dawen
    • ETRI Journal
    • /
    • v.42 no.3
    • /
    • pp.446-458
    • /
    • 2020
  • In this study, an efficient scheme for hiding data directly in partially encrypted versions of high efficiency video coding (HEVC) videos is proposed. The content owner uses stream cipher to selectively encrypt some HEVC-CABAC bin strings in a format-compliant manner. Then, the data hider embeds the secret message into the encrypted HEVC videos using the specific coefficient modification technique. Consequently, it can be used in third-party computing environments (more generally, cloud computing). For security and privacy purposes, service providers cannot access the visual content of the host video. As the coefficient is only slightly modified, the quality of the decrypted video is satisfactory. The encrypted and marked bitstreams meet the requirements of format compatibility, and have the same bit rate. At the receiving end, data extraction can be performed in the encrypted domain or decrypted domain that can be adapted to different application scenarios. Several standard video sequences with different resolutions and contents have been used for experimental evaluation.

Design of Sophisticated Self-Tuning Fuzzy Logic Controllers Using Genetic Algorithms (유전알고리즘을 이용한 정교한 자기동조 퍼지 제어기의 설계)

  • Hwang, Yon-Won;Kim, Lark-Kyo;Nam, Moon-Hyon
    • Proceedings of the KIEE Conference
    • /
    • 1998.07b
    • /
    • pp.509-511
    • /
    • 1998
  • Design of fuzzy logic controllers encounters difficulties in the selection of optimized membership function and fuzzy rule base, which is traditionally achieved by tedious trial-and-error process. In this paper We proposed a new method to generate fuzzy logic controllers throught genetic algorithm(GA). The controller design space is coded in base-7 strings chromosomes, where each bit gene matches the 7 discrete fuzzy value. The developed approach is subsequently applied to the design of proportional plus integral type fuzzy controller for a do-servo motor control system. It was presented in discrete fuzzy linguistic value, and used a membership function with Gaussian curve. The performance of this control system is demonstrated higher than that of a conventional PID controller and fuzzy logic controller(FLC).

  • PDF