• Title/Summary/Keyword: matrix application

Search Result 1,438, Processing Time 0.025 seconds

Characterizations of Two-step Matrix Application Procedures for Imaging Mass Spectrometry

  • Shimma, Shuichi
    • Mass Spectrometry Letters
    • /
    • v.6 no.1
    • /
    • pp.21-25
    • /
    • 2015
  • In this paper, I describe the importance of matrix spraying conditions in imaging mass spectrometry (IMS) to obtain successful imaging results. My developed matrix application methodology, which is a "two-step matrix application" sequentially combined with matrix sublimation and spraying matrix solution can provide high reproducibility and high ion yield compared with a conventional direct spraying method. However, insufficient IMS results were obtained occasionally despite the two-step method. Therefore, I wanted to characterize the methodology to continuously provide high quality data. According to my results, the sublimation time was not a strict parameter, and the most important step was the first spraying condition. This means that the extraction conditions from the tissue section and co-crystallization of the matrix were the most important factors.

In-depth Analysis and Performance Improvement of a Flash Disk-based Matrix Transposition Algorithm (플래시 디스크 기반 행렬전치 알고리즘 심층 분석 및 성능개선)

  • Lee, Hyung-Bong;Chung, Tae-Yun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.12 no.6
    • /
    • pp.377-384
    • /
    • 2017
  • The scope of the matrix application is so broad that it can not be limited. A typical matrix application area in computer science is image processing. Particularly, radar scanning equipment implemented on a small embedded system requires real-time matrix transposition for image processing, and since its memory size is small, a general matrix transposition algorithm can not be applied. In this case, matrix transposition must be done in disk space, such as flash disk, using a limited memory buffer. In this paper, we analyze and improve a recently published flash disk-based matrix transposition algorithm named as asymmetric sub-matrix transposition algorithm. The performance analysis shows that the asymmetric sub-matrix transposition algorithm has lower performance than the conventional sub-matrix transposition algorithm, but the improved asymmetric sub-matrix transposition algorithm is superior to the sub-matrix transposition algorithm in 13 of the 16 experimental data.

Formation of Black Matrix Pattern by using Black Photoresist

  • Cho, Yoon-Lae;Kim, Tae-Yong;Kim, Jin-Mog;Song, Jeong-Mok;Koh, Nam-Je
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2002.08a
    • /
    • pp.1047-1050
    • /
    • 2002
  • Generally, the Black Matrix of CRT is formed by the application of photoresist and black material separately. We have developed the simple process for black matrix of CRT. We used the black photoresist, It made it possible that the formation of Black Matrix by application of the light exposure and development only once.

  • PDF

THE EQUIVALENT FORM OF A MATRIX INEQUALITY AND ITS APPLICATION

  • ZHONGPENG YANG;XIAOXIA FENG
    • Journal of applied mathematics & informatics
    • /
    • v.20 no.1_2
    • /
    • pp.421-431
    • /
    • 2006
  • In this paper, we establish a matrix inequality and its equivalent form. Applying the results, some matrix inequalities involving Khatri-Rao products of positive semi-definite matrices are generalized.

Pseudo Jacket Matrix and Its MIMO SVD Channel (Pseudo Jacket 행렬을 이용한 MIMO SVD Channel)

  • Yang, Jae-Seung;Kim, Jeong-Su;Lee, Moon-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.5
    • /
    • pp.39-49
    • /
    • 2015
  • Some characters and construction theorems of Pseudo Jacket Matrix which is generalized from Jacket Matrix introduced by Jacket Matrices: Construction and Its Application for Fast Cooperative Wireless signal Processing[27] was announced. In this paper, we proposed some examples of Pseudo inverse Jacket matrix, such as $2{\times}4$, $3{\times}6$ non-square matrix for the MIMO channel. Furthermore we derived MIMO singular value decomposition (SVD) pseudo inverse channel and developed application to utilize SVD based on channel estimation of partitioned antenna arrays. This can be also used in MIMO channel and eigen value decomposition (EVD).

A Parallel-Architecture Processor Design for the Fast Multiplication of Homogeneous Transformation Matrices (Homogeneous Transformation Matrix의 곱셈을 위한 병렬구조 프로세서의 설계)

  • Kwon Do-All;Chung Tae-Sang
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.54 no.12
    • /
    • pp.723-731
    • /
    • 2005
  • The $4{\times}4$ homogeneous transformation matrix is a compact representation of orientation and position of an object in robotics and computer graphics. A coordinate transformation is accomplished through the successive multiplications of homogeneous matrices, each of which represents the orientation and position of each corresponding link. Thus, for real time control applications in robotics or animation in computer graphics, the fast multiplication of homogeneous matrices is quite demanding. In this paper, a parallel-architecture vector processor is designed for this purpose. The processor has several key features. For the accuracy of computation for real application, the operands of the processors are floating point numbers based on the IEEE Standard 754. For the parallelism and reduction of hardware redundancy, the processor takes column vectors of homogeneous matrices as multiplication unit. To further improve the throughput, the processor structure and its control is based on a pipe-lined structure. Since the designed processor can be used as a special purpose coprocessor in robotics and computer graphics, additionally to special matrix/matrix or matrix/vector multiplication, several other useful instructions for various transformation algorithms are included for wide application of the new design. The suggested instruction set will serve as standard in future processor design for Robotics and Computer Graphics. The design is verified using FPGA implementation. Also a comparative performance improvement of the proposed design is studied compared to a uni-processor approach for possibilities of its real time application.

Vibration Analysis of the Helical Gear System by Spectral Transfer Matrix (스펙트럴 전달행렬에 의한 헬리컬 기어계의 진동해석)

  • Park, Chan-Il
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2006.05a
    • /
    • pp.774-781
    • /
    • 2006
  • This paper presents a study on the analytical prediction of vibration transmission from helical gears to the bearing. The proposed method is based on the application of the three dimensional helical gear behaviors and complete description of shaft by the spectral method. Helical gear system used in this paper consists of the driving element, helical gears, shafts, bearings, couplings and load element. In order to describe all translation and rotation motion of helical gears twelve degree of freedom equations of motion by the transmission error excitation are derived. Using these equations, transfer matrix for the helical gear is derived. For the detail behavior of shaft motion, the $12{\times}12$ transfer matrix for the shaft is derived. Transfer matrix for the bearing, coupling, driving element, and load is also derived. Application of the boundary conditions in the assembled transfer matrix produces the forces and displacements in each element of the helical gear system. The effect of the proposed method is shown by numerical example.

  • PDF

Application of Condensed Joint Matrix Method to the Joint Structure of Vehicle Body (축약 행렬법을 적용한 차체 결합부 해석)

  • 서종환;서명원;양원호
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.6 no.4
    • /
    • pp.9-16
    • /
    • 1998
  • The joint characteristics are necessary to be determined in the early stage of the vehicle body design. Researches on identification of joints in a vehicle body have been performed until the recent year. In this study, the joint characteristics of vehicle struct- ure were expressed as condensed forms from the full joint stiffness and mass matrix. The condensed joint stiffness and mass matrix were applied to typical T-type and Edge-type joints, and the usefulness was confirmed. In addition, those were applied to center pillar and full vehicle body to validate the practical application.

  • PDF

MATRIX REALIZATION AND ITS APPLICATION OF THE LIE ALGEBRA OF TYPE F4

  • CHOI, SEUNGIL
    • Honam Mathematical Journal
    • /
    • v.28 no.2
    • /
    • pp.205-212
    • /
    • 2006
  • The Lie algebra of type $F_4$ has the 26 dimensional representation. Its matrix realization can be obtained via 26 by 26 matrices and has a direct useful application to degenerate principal series for p-adic groups of type $F_4$.

  • PDF

User Targerting SaaS Application Mash-Up Service Framework using Complex-Context and Rule-Martix (복합 콘텍스트 및 Rule-Matrix를 활용한 사용자 맞춤형 SaaS 어플리케이션 연동 서비스 프레임워크)

  • Jung, Jong Jin;Cui, Yun;Kwon, Kyung Min;Lee, Han Ku
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.7
    • /
    • pp.1054-1064
    • /
    • 2017
  • With the development of cloud computing, internet technology and Internet of Things(IoT), most of applications are being smarter and changing from native application to SaaS (Software as a Service) application. New versatile SaaS applications are being released through various app portals (e.g. appstore, googleplay, T-Store, and so on). However, a user has a difficulty in searching, choosing an suitable application to him. It is also hard for him to know what functions of each SaaS application are useful. He wants to be recommended something inter-operated SaaS service according to his personality and his situation. Therefore, this paper presents a way of making mash-up of SaaS applications in order to provide the most convenient inter-operated SaaS service to user. This paper also presents SaaS Application Mash-up Framework (SAMF), complex context and rule matrix. The proposed SAMF is a main system that totally manage SaaS application mash-up service. Complex context and rule matrix are key components in order to recommend what SaaS applications are needed and how those SaaS applications are inter-operated. The SAMF collects complex contexts (User Description, Status Description, SaaS Service Description) in order to choose which SaaS applications are useful, analyze what functions to use, how to mash-up.