• Title/Summary/Keyword: transpose

Search Result 57, Processing Time 0.028 seconds

Treatment of Medial Patellar Luxation by Placement of a Cortical Screw on the Medial Side of the Tibial Crest in a Dog (개에서 경골 조면 내측에 피질골 나사못을 장착하는 방법에 의한 내측 슬개골 탈구 치료 증례)

  • Kang, Byung-Jae;Yoon, Daeyoung;Rhew, Daeun;Kim, Yongsun;Lee, Seunghoon;Kim, Wan Hee;Kweon, Oh-Kyeong
    • Journal of Veterinary Clinics
    • /
    • v.31 no.2
    • /
    • pp.133-136
    • /
    • 2014
  • An 8 kg, 9-month-old castrated male Shiba Inu presented with a history of intermittent bilateral hind limb lameness. On examination, grade III medial patellar luxation of the bilateral hind limbs was diagnosed. A novel surgical method involving relatively noninvasive tibial tuberosity transposition was used to restore normal alignment of the quadriceps mechanism. The procedure involved an incision on the medial cortical bone of the tibial tuberosity along the tibial crest and placement of a cortical screw on the medial side of the tibial crest to laterally transpose the tibial tuberosity. Lameness and patellar luxation of bilateral hind limbs were improved at a 3-month postoperative examination. This technique could be considered an effective treatment for medial patellar luxation in skeletal immature patients.

Variable Radix-Two Multibit Coding and Its VLSI Implementation of DCT/IDCT (가변길이 다중비트 코딩을 이용한 DCT/IDCT의 설계)

  • 김대원;최준림
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.39 no.12
    • /
    • pp.1062-1070
    • /
    • 2002
  • In this paper, variable radix-two multibit coding algorithm is presented and applied in the implementation of discrete cosine transform(DCT) and inverse discrete cosine transform(IDCT). Variable radix-two multibit coding means the 2k SD (signed digit) representation of overlapped multibit scanning with variable shift method. SD represented by 2k generates partial products, which can be easily implemented with shifters and adders. This algorithm is most powerful for the hardware implementation of DCT/IDCT with constant coefficient matrix multiplication. This paper introduces the suggested algorithm, it's proof and the implementation of DCT/IDCT The implemented IDCT chip with 8 PEs(Processing Elements) and one transpose memory runs at a tate of 400 Mpixels/sec at 54MHz frequency for high speed parallel signal processing, and it's verified in HDTV and MPEG decoder.

Efficient Image Data Processing using a Real Time Concurrent Single Memory Input/Output Access (실시간 단일 메모리 동시 입출력을 이용한 효율적인 영상 데이터 처리)

  • Lee, Gunjoong;Han, Geumhee;Ryoo, Kwangki
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.103-106
    • /
    • 2012
  • A memory access method that data are read with different sequences with writing order is a simple but important procedure in many image compression standards, such as JPEG, MPEG1/2/4, H.264, and HEVC. For real time processing, double buffering is widely used using two block sized buffers, that accesses buffers concurrently with alternative way to read and write. In some cases like a transpose memory in 2D DCT with a simple and regular access order, a single buffering which requires only single block sized buffer can be used. This paper shows that even in complex access orders there is a regularity among updating orders within a finite turns, and suggested an effective implementation method using a single block sized buffer to process concurrent read/write operation with different access orders.

  • PDF

A Practical Study on Didactical Transposition in the Highschool Trigonometric Function for Closer Use of Manipulative, and for More Real, Principle Based (교수공학 친화적, 실용적, 교수학적 변환의 실제적 연구(10-나 삼각함수 단원을 중심으로))

  • Lee, Young-Ha;Shin, Jung-Eun
    • School Mathematics
    • /
    • v.11 no.1
    • /
    • pp.111-129
    • /
    • 2009
  • This paper is about didactical transposition, which is to transpose academic knowledge into practical knowledge intended to teach. The research questions are addressed as follows. 1. Are the 13 mathematics textbooks of the 10-Na level indisputable regarding with the didactical transposition, in terms that the order of arrangement and the way of explaining the knowledge of trigonometric functions being analyzed and that its logical construction and students' understandings are considered? 2. Can some transpositions for easier use of didactical manipulative, for more practical and for more principle based be proposed? To answer these questions, this research examined previous studies of mathematics education, specifically the organization of the textbook and the trigonometric functions, and also compared orders of arranging and ways of explaining trigonometric functions from the perspective of didactical transposition of 13 versions of the 10-Na level reorganized under the 7th curriculum. The paper investigated what lacks in the present textbook and sought a teaching guideline of trigonometric functions(especially about sector and graph, period, characters of trigonometric function, and sine rule).

  • PDF

A Secure Method for Color Image Steganography using Gray-Level Modification and Multi-level Encryption

  • Muhammad, Khan;Ahmad, Jamil;Farman, Haleem;Jan, Zahoor;Sajjad, Muhammad;Baik, Sung Wook
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1938-1962
    • /
    • 2015
  • Security of information during transmission is a major issue in this modern era. All of the communicating bodies want confidentiality, integrity, and authenticity of their secret information. Researchers have presented various schemes to cope with these Internet security issues. In this context, both steganography and cryptography can be used effectively. However, major limitation in the existing steganographic methods is the low-quality output stego images, which consequently results in the lack of security. To cope with these issues, we present an efficient method for RGB images based on gray level modification (GLM) and multi-level encryption (MLE). The secret key and secret data is encrypted using MLE algorithm before mapping it to the grey-levels of the cover image. Then, a transposition function is applied on cover image prior to data hiding. The usage of transpose, secret key, MLE, and GLM adds four different levels of security to the proposed algorithm, making it very difficult for a malicious user to extract the original secret information. The proposed method is evaluated both quantitatively and qualitatively. The experimental results, compared with several state-of-the-art algorithms, show that the proposed algorithm not only enhances the quality of stego images but also provides multiple levels of security, which can significantly misguide image steganalysis and makes the attack on this algorithm more challenging.

Tutorial on the Coordinate Transforms in Applied Geophysics (물리탐사에 유용한 좌표계 회전 정리)

  • Song, Yoonho
    • Geophysics and Geophysical Exploration
    • /
    • v.23 no.2
    • /
    • pp.89-96
    • /
    • 2020
  • This tutorial summarizes the coordinate transforms for formulating geophysical problems. To ensure mathematical consistency, this discussion begins with the right-hand rule. Further, the concepts of active and passive transforms are introduced. By extending these concepts, the coordinate transform and its inverse between two coordinates are related to the matrix transpose. The yaw-pitch-roll rotation and the azimuth-deviation-tool face rotation transforms are described as the most frequently used schemes, and the relation between the Rodrigues' rotation formula and these two transforms are mathematically explained. The "Gimbal Lock" problem inherent in yaw-pitch-roll rotation is schematically presented and mathematically derived. As a useful tool overcome this problem, the principle and usage of the quaternion is also described.

Jacket Matrix in Hyperbola (쌍곡선에서의 재킷 행렬)

  • Yang, Jae-Seung;Park, Ju-Yong;Lee, Moon-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.3
    • /
    • pp.15-24
    • /
    • 2015
  • Jacket matrices which are defined to be $m{\times}m$ matrices $J^{\dagger}=[J_{ik}^{-1}]^T$ over a Galois field F with the property $JJ^{\dagger}=mI_m$, $J^{\dagger}$ is the transpose matrix of element-wise inverse of J, i.e., $J^{\dagger}=[J_{ik}^{-1}]^T$, were introduced by Lee in 1984 and are used for Digital Signal Processing and Coding theory. This paper presents some square matrices $A_2$ which can be eigenvalue decomposed by Jacket matrices. Specially, $A_2$ and its extension $A_3$ can be used for modifying the properties of hyperbola and hyperboloid, respectively. Specially, when the hyperbola has n times transformation, the final matrices $A_2^n$ can be easily calculated by employing the EVD[7] of matrices $A_2$. The ideas that we will develop here have applications in computer graphics and used in many important numerical algorithms.

A partial factors methodology for structural safety assessment in non-linear analysis

  • Castro, Paula M.R.P.;Delgado, Raimundo M.;Cesar de Sa, Jose M.A.
    • Computers and Concrete
    • /
    • v.2 no.1
    • /
    • pp.31-53
    • /
    • 2005
  • In the present structural codes the safety verification is based on a linear analysis of the structure and the satisfaction of ultimate and serviceability limit states, using a semi-probabilistic security format through the consideration of partial safety factors, which affect the action values and the characteristic values of the material properties. In this context, if a non-linear structural analysis is wanted a difficulty arises, because the global safety coefficient, which could be obtained in a straightforward way from the non-linear analysis, is not directly relatable to the different safety coefficient values usually used for the different materials, as is the case for reinforced concrete structures. The work here presented aims to overcome this difficulty by proposing a methodology that generalises the format of safety verification based on partial safety factors, well established in structural codes within the scope of linear analysis, for cases where non-linear analysis is needed. The methodology preserves the principal assumptions made in the codes as well as a reasonable simplicity in its use, including a realistic definition of the material properties and the structural behaviour, and it is based on the evaluation of a global safety coefficient. Some examples are presented aiming to clarify and synthesise all the options that were taken in the application of the proposed methodology, namely how to transpose the force distributions obtained with a non-linear analysis into design force distributions. One of the most important features of the proposed methodology, the ability for comparing the simplified procedures for second order effects evaluation prescribed in the structural codes, is also presented in a simple and systematic way. The potential of the methodology for the development and assessment of alternative and more accurate procedures to those already established in codes of practice, where non-linear effects must be considered, is also indicated.

Conjugate Gradient Least-Squares Algorithm for Three-Dimensional Magnetotelluric Inversion (3차원 MT 역산에서 CG 법의 효율적 적용)

  • Kim, Hee-Joon;Han, Nu-Ree;Choi, Ji-Hyang;Nam, Myung-Jin;Song, Yoon-Ho;Suh, Jung-Hee
    • Geophysics and Geophysical Exploration
    • /
    • v.10 no.2
    • /
    • pp.147-153
    • /
    • 2007
  • The conjugate gradient (CG) method is one of the most efficient algorithms for solving a linear system of equations. In addition to being used as a linear equation solver, it can be applied to a least-squares problem. When the CG method is applied to large-scale three-dimensional inversion of magnetotelluric data, two approaches have been pursued; one is the linear CG inversion in which each step of the Gauss-Newton iteration is incompletely solved using a truncated CG technique, and the other is referred to as the nonlinear CG inversion in which CG is directly applied to the minimization of objective functional for a nonlinear inverse problem. In each procedure we only need to compute the effect of the sensitivity matrix or its transpose multiplying an arbitrary vector, significantly reducing the computational requirements needed to do large-scale inversion.

Unusual data local access using inverse order tree (역순트리를 이용한 특이데이터 국소적 접근)

  • Rim, Kwang-Cheol;Seol, Jung-Ja
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.3
    • /
    • pp.595-601
    • /
    • 2014
  • With the advent of the Smart information-communication era, the number of data has increased exponentially. Accordingly, figuring out and analyzing in which area and circumstance the data has been created becomes one of the factors for prompt actions. In this paper identifies how to analyze the data by implementing a route from the lowest module to highest one in an inverse order for the part judgement for the particular data. The script first identifies cluster analisys, paralizes the analysis using the sum of each factors of the cluster with the tree structure, and finally transpose the answer into number. Also, it is designed to place priority on particular answer, thereafter, draws the wanted answer real-time.