• Title/Summary/Keyword: distance transformation

Search Result 309, Processing Time 0.024 seconds

Optimization of Parameters for GUS Gene Transformation of Porphyra yezoensis by Particle Bombardment

  • Nam, Bo-Hye;Park, Jung-Youn;Jin, Deuk-Hee;Hong, Yong-Ki
    • Fisheries and Aquatic Sciences
    • /
    • v.9 no.4
    • /
    • pp.135-139
    • /
    • 2006
  • We optimized the biological and physical parameters for DNA delivery into thalli of the red alga Porphyra yezoensis using a particle bombardment device. The efficiency of transformation was determined using the ${\beta}-glucuronidase$ (GUS) assay. The optimal helium pressure, distance of tungsten particle flight, and ratio of DNA to tungsten particles were $23kgf/cm^2$, 8 cm, and $5{\mu}g/mg$ tungsten, respectively. During bombardment, osmotic treatment with a mixture of 0.6 M mannitol and sorbitol increased the efficiency of GUS transformation. After 2 days, the blue color indicating GUS activity was observed using a histochemical assay.

LASER WELDING OF TI-NI SHAPE MEMORY ALLOY WIRE

  • Kim, Young-Sik;Kim, Jong-Do
    • Proceedings of the KWS Conference
    • /
    • 2002.10a
    • /
    • pp.139-144
    • /
    • 2002
  • Ti-50.9at%Ni wires were welded using pulsed YAG laser. The laser welded wires were tested for investigating the shape memo교 effect and the ability of super elasticity. The fatigue properties of the welded wires were investigated using the rotary bending fatigue tester specially designed for wires. Moreover, the effect of defocusing distance during laser welding on the static and fatigue properties was investigated. The shape memory effect and super elasticity of the laser welded wires were approximately identical with that of base metal at the test temperature below 353K. However, the welded wires were broken within elastic limit at the test temperature above 353k. Under the cyclic bending loading conditions, the welded wires could be useful only below the elastic limit, while the base metal had sufficient fatigue life even the stress induced M-phase region. The fatigue strength of the welded wires was about half of that of the base metal. The deterioration of the static and fatigue properties in the welded wires was proven to be from the large difference of the transformation behavior between the base metal and welded part that is caused by vaporization of Ni-content at the welded part during the welding process. The defocusing distance below 3mm acted more largely on lowering the strength of the welded wires than that of 6mm or 8mm.

  • PDF

A Colony Counting Algorithm based on Distance Transformation (거리 변환에 기반한 콜로니 계수 알고리즘)

  • Mun, Hyeok;Lee, Bok Ju;Choi, Young Kyu
    • Journal of the Semiconductor & Display Technology
    • /
    • v.15 no.3
    • /
    • pp.24-29
    • /
    • 2016
  • One of the main applications of digital image processing is the estimation of the number of certain types of objects (cells, seeds, peoples etc.) in an image. Difficulties of these counting problems depends on various factors including shape and size variation, degree of object clustering, contrast between object and background, object texture and its variation, and so on. In this paper, a new automatic colony counting algorithm is proposed. We focused on the two applications: counting the bacteria colonies on the agar plate and estimating the number of seeds from images captured by smartphone camera. To overcome the shape and size variations of the colonies, we adopted the distance transformation and peak detection approach. To estimate the reference size of the colony robustly, we also used k-means clustering algorithm. Experimental results show that our method works well in real world applications.

A Loop Transformation for Parallelism from Single Loops

  • Jeong, Sam-Jin
    • International Journal of Contents
    • /
    • v.2 no.4
    • /
    • pp.8-11
    • /
    • 2006
  • This paper describes several loop partitioning techniques such as loop splitting method by thresholds and Polychronopoulos' loop splitting method for exploiting parallelism from single loop which already developed. We propose improved loop splitting method for maximizing parallelism of single loops with non-constant dependence distances. By using the distance for the source of the first dependence, and by our defined theorems, we present generalized and optimal algorithms for single loops with non-uniform dependences. The algorithms generalize how to transform general single loops into parallel loops.

  • PDF

A Distance Estimation Method of Object′s Motion by Tracking Field Features and A Quantitative Evaluation of The Estimation Accuracy (배경의 특징 추적을 이용한 물체의 이동 거리 추정 및 정확도 평가)

  • 이종현;남시욱;이재철;김재희
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.621-624
    • /
    • 1999
  • This paper describes a distance estimation method of object's motion in soccer image sequence by tracking field features. And we quantitatively evaluate the estimation accuracy We suppose that the input image sequence is taken with a camera on static axis and includes only zooming and panning transformation between frames. Adaptive template matching is adopted for non-rigid object tracking. For background compensation, feature templates selected from reference frame image are matched in following frames and the matched feature point pairs are used in computing Affine motion parameters. A perspective displacement field model is used for estimating the real distance between two position on Input Image. To quantitatively evaluate the accuracy of the estimation, we synthesized a 3 dimensional virtual stadium with graphic tools and experimented on the synthesized 2 dimensional image sequences. The experiment shows that the average of the error between the actual moving distance and the estimated distance is 1.84%.

  • PDF

MDS code Creation Confirmation Algorithms in Permutation Layer of a Block Cipher (블록 암호에서 교환 계층의 MDS 코드 생성 확인 알고리즘)

  • 박창수;조경연
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.7
    • /
    • pp.1462-1470
    • /
    • 2003
  • According to the necessity about information security as well as the advance of IT system and the spread of the Internet, a variety of cryptography algorithms are being developed and put to practical use. In addition the technique about cryptography attack also is advanced, and the algorithms which are strong against its attack are being studied. If the linear transformation matrix in the block cipher algorithm such as Substitution Permutation Networks(SPN) produces the Maximum Distance Separable(MDS) code, it has strong characteristics against the differential attack and linear attack. In this paper, we propose a new algorithm which cm estimate that the linear transformation matrix produces the MDS code. The elements of input code of linear transformation matrix over GF$({2_n})$ can be interpreted as variables. One of variables is transformed as an algebraic formula with the other variables, with applying the formula to the matrix the variables are eliminated one by one. If the number of variables is 1 and the all of coefficient of variable is non zero, then the linear transformation matrix produces the MDS code. The proposed algorithm reduces the calculation time greatly by diminishing the number of multiply and reciprocal operation compared with the conventional algorithm which is designed to know whether the every square submatrix is nonsingular.

Hybrid Lower-Dimensional Transformation for Similar Sequence Matching (유사 시퀀스 매칭을 위한 하이브리드 저차원 변환)

  • Moon, Yang-Sae;Kim, Jin-Ho
    • The KIPS Transactions:PartD
    • /
    • v.15D no.1
    • /
    • pp.31-40
    • /
    • 2008
  • We generally use lower-dimensional transformations to convert high-dimensional sequences into low-dimensional points in similar sequence matching. These traditional transformations, however, show different characteristics in indexing performance by the type of time-series data. It means that the selection of lower-dimensional transformations makes a significant influence on the indexing performance in similar sequence matching. To solve this problem, in this paper we propose a hybrid approach that integrates multiple transformations and uses them in a single multidimensional index. We first propose a new notion of hybrid lower-dimensional transformation that exploits different lower-dimensional transformations for a sequence. We next define the hybrid distance to compute the distance between the transformed sequences. We then formally prove that the hybrid approach performs the similar sequence matching correctly. We also present the index building and the similar sequence matching algorithms that use the hybrid approach. Experimental results for various time-series data sets show that our hybrid approach outperforms the single transformation-based approach. These results indicate that the hybrid approach can be widely used for various time-series data with different characteristics.

The Impact of Technology Dependence and Technological Characteristics on the Transformation of Multiplex Ties (기술 의존성과 기술 특성이 다차원 관계 전환에 미치는 영향)

  • Kim, Byung Eun;Bae, Sung Joo
    • Journal of Korea Technology Innovation Society
    • /
    • v.22 no.3
    • /
    • pp.307-339
    • /
    • 2019
  • This study investigates factors that affect the transformation of multiplex tie into one specific type of relationship - competitive relationship. In particular, this study argues that the lower technological distance or gap of technological competency, the higher the chances are for the multiplex tie to become a competitive tie. In addition, technological characteristics of the firms are also found to affect the multiplex tie's transformation into the competitive tie. To study this phenomena, this study uses both quantitative analysis and case study method. This study is an exploratory attempt to find factors relevant to change multiplex ties into competition, contributing to the literature of multiplex ties by identifying technological variables that affect the transformation of such ties. This study also contributes to practices by providing the guidance on what strategies firms should implement in complex situations such as multiplex ties.

WAVELET-BASED FOREST AREAS CLASSIFICATION BY USING HIGH RESOLUTION IMAGERY

  • Yoon Bo-Yeol;Kim Choen
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.698-701
    • /
    • 2005
  • This paper examines that is extracted certain information in forest areas within high resolution imagery based on wavelet transformation. First of all, study areas are selected one more species distributed spots refer to forest type map. Next, study area is cut 256 x 256 pixels size because of image processing problem in large volume data. Prior to wavelet transformation, five texture parameters (contrast, dissimilarity, entropy, homogeneity, Angular Second Moment (ASM≫ calculated by using Gray Level Co-occurrence Matrix (GLCM). Five texture images are set that shifting window size is 3x3, distance .is 1 pixel, and angle is 45 degrees used. Wavelet function is selected Daubechies 4 wavelet basis functions. Result is summarized 3 points; First, Wavelet transformation images derived from contrast, dissimilarity (texture parameters) have on effect on edge elements detection and will have probability used forest road detection. Second, Wavelet fusion images derived from texture parameters and original image can apply to forest area classification because of clustering in Homogeneous forest type structure. Third, for grading evaluation in forest fire damaged area, if data fusion of established classification method, GLCM texture extraction concept and wavelet transformation technique effectively applied forest areas (also other areas), will obtain high accuracy result.

  • PDF