• 제목/요약/키워드: Matrices

검색결과 2,628건 처리시간 0.034초

A Method for Identifying Splice Sites and Translation Start Sites in Human Genomic Sequences

  • Kim, Ki-Bong;Park, Kie-Jung;Kong, Eun-Bae
    • BMB Reports
    • /
    • 제35권5호
    • /
    • pp.513-517
    • /
    • 2002
  • We describe a new method for identifying the sequences that signal the start of translation, and the boundaries between exons and introns (donor and acceptor sites) in human mRNA. According to the mandatory keyword, ORGANISM, and feature key, CDS, a large set of standard data for each signal site was extracted from the ASCII flat file, gbpri.seq, in the GenBank release 108.0. This was used to generate the scoring matrices, which summarize the sequence information for each signal site. The scoring matrices take into account the independent nucleotide frequencies between adjacent bases in each position within the signal site regions, and the relative weight on each nucleotide in proportion to their probabilities in the known signal sites. Using a scoring scheme that is based on the nucleotide scoring matrices, the method has great sensitivity and specificity when used to locate signals in uncharacterized human genomic DNA. These matrices are especially effective at distinguishing true and false sites.

Linear Preservers of Perimeters of Nonnegative Real Matrices

  • Song, Seok-Zun;Kang, Kyung-Tae
    • Kyungpook Mathematical Journal
    • /
    • 제48권3호
    • /
    • pp.465-472
    • /
    • 2008
  • For a nonnegative real matrix A of rank 1, A can be factored as $ab^t$ for some vectors a and b. The perimeter of A is the number of nonzero entries in both a and b. If B is a matrix of rank k, then B is the sum of k matrices of rank 1. The perimeter of B is the minimum of the sums of perimeters of k matrices of rank 1, where the minimum is taken over all possible rank-1 decompositions of B. In this paper, we obtain characterizations of the linear operators which preserve perimeters 2 and k for some $k\geq4$. That is, a linear operator T preserves perimeters 2 and $k(\geq4)$ if and only if it has the form T(A) = UAV or T(A) = $UA^tV$ with some invertible matrices U and V.

폴리프로필렌 글리콜 하이드로겔의 가교도 및 고분자사슬 길이조절에 의한 약물방출특성 (Drug Release Characteristics from Chain-extended and Crosslinked Polypropylene Glycol Hydrogels)

  • 이승진
    • Journal of Pharmaceutical Investigation
    • /
    • 제24권4호
    • /
    • pp.251-256
    • /
    • 1994
  • Polypropylene glycol (M.W. 4000) was crosslinked and chain-extended by using triisocyanate and diisocyanate to synthesize rubbery and water swellable hydrogels. Model drugs, i.e., sodium salicylate and indomethacin were incorporated in the polymer matrices by swelling loading. The drug release rates of drugs could be regulated by varying the degrees of crosslinking and chain-extension. Whereas, no correlation was observed between the drug release profiles and the swelling behaviours of the matrices. The release of drugs from the matrices was considered to be governed by the mobility and mesh size of the polymer chains in the matrices.

  • PDF

NONNEGATIVE INTEGRAL MATRICES HAVING GENERALIZED INVERSES

  • Kang, Kyung-Tae;Beasley, LeRoy B.;Encinas, Luis Hernandez;Song, Seok-Zun
    • 대한수학회논문집
    • /
    • 제29권2호
    • /
    • pp.227-237
    • /
    • 2014
  • For an $m{\times}n$ nonnegative integral matrix A, a generalized inverse of A is an $n{\times}m$ nonnegative integral matrix G satisfying AGA = A. In this paper, we characterize nonnegative integral matrices having generalized inverses using the structure of nonnegative integral idempotent matrices. We also define a space decomposition of a nonnegative integral matrix, and prove that a nonnegative integral matrix has a generalized inverse if and only if it has a space decomposition. Using this decomposition, we characterize nonnegative integral matrices having reflexive generalized inverses. And we obtain conditions to have various types of generalized inverses.

동적 시스템의 감쇠행렬 추정 (Estimation of Damping Matrices for Dynamic Systems)

  • 이건명;김경주;주영호
    • 한국소음진동공학회논문집
    • /
    • 제19권10호
    • /
    • pp.1021-1027
    • /
    • 2009
  • Finite element models of dynamic systems can be updated in two stages. In the first stage, mass and stiffness matrices are updated neglecting damping. In the second stage, a damping matrix is estimated with the mass and stiffness matrices fixed. Methods to estimate a damping matrix for this purpose are proposed in this paper. For a system with proportional damping, a damping matrix is estimated using the modal parameters extracted from the measured responses and the modal matrix calculated from the mass and stiffness matrices from the first stage. For a system with non-proportional damping, a damping matrix is estimated from the impedance matrix which is the inverse of the FRF matrix. Only one low or one column of the FRF matrix is measured, and the remaining FRFs are synthesized to obtain a full FRF matrix. This procedure to obtain a full FRF matrix saves time and effort to measure FRFs.

Global Feature Extraction and Recognition from Matrices of Gabor Feature Faces

  • Odoyo, Wilfred O.;Cho, Beom-Joon
    • Journal of information and communication convergence engineering
    • /
    • 제9권2호
    • /
    • pp.207-211
    • /
    • 2011
  • This paper presents a method for facial feature representation and recognition from the Covariance Matrices of the Gabor-filtered images. Gabor filters are a very powerful tool for processing images that respond to different local orientations and wave numbers around points of interest, especially on the local features on the face. This is a very unique attribute needed to extract special features around the facial components like eyebrows, eyes, mouth and nose. The Covariance matrices computed on Gabor filtered faces are adopted as the feature representation for face recognition. Geodesic distance measure is used as a matching measure and is preferred for its global consistency over other methods. Geodesic measure takes into consideration the position of the data points in addition to the geometric structure of given face images. The proposed method is invariant and robust under rotation, pose, or boundary distortion. Tests run on random images and also on publicly available JAFFE and FRAV3D face recognition databases provide impressively high percentage of recognition.

선형 변단면 보요소의 강도행렬 (Stiffness matrices for linearly tapered beam elements)

  • 최외호;민경주;이승우
    • 전산구조공학
    • /
    • 제8권1호
    • /
    • pp.115-122
    • /
    • 1995
  • 선형 변단면 부재의 삼차원 공간에서의 해석을 위하여 강도행렬을 유도하였다. 변단면 부재의 구조물을 해석하기 위하여 본 연구에서 유도된 강도행렬을 사용하여 구한 결과와 분할부재를 균일단면 탑 형태로 표현하여 ANSYS에서 구한 결과를 비교하여 본 연구의 결과 효율성 및 정확성이 증진된 것을 확인하였다. 본 연구에서 유도된 강도행렬은 변단면 부재와 균일단면 부재의 해석에 사용할 수 있다.

  • PDF

Direct determination of influence lines and surfaces by F.E.M.

  • Orakdogen, Engin;Girgin, Konuralp
    • Structural Engineering and Mechanics
    • /
    • 제20권3호
    • /
    • pp.279-292
    • /
    • 2005
  • In this study, element loading matrices are defined for static application of classical M$\ddot{u}$ller-Breslau principle to finite element method. The loading matrices are derived from existing element matrices using Betti's law and known governing equations of F.E.M. Thus, the ordinates of influence lines and influence surfaces may be easily obtained from structural analysis for the loading matrices derived from governing equations, instead of through introduced unit force or displacement techniques. An algorithm for a computer program and comparative numerical examples are also presented to illustrate the procedure for determination of influence line and surface ordinates.

Expanding Generalized Hadamard Matrices over $G^m$ by Substituting Several Generalized Hadamard Matrices over G

  • No, Jong-Seon;Song, Hong-Yeop
    • Journal of Communications and Networks
    • /
    • 제3권4호
    • /
    • pp.361-364
    • /
    • 2001
  • Over an additive abelian group G of order g and for a given positive integer $\lambda$, a generalized Hadamard matrix GH(g, $\lambda$) is defined as a gλ$\times$gλ matrix[h(i, j)], where 1 $\leq i \leqg\lambda and 1 \leqj \leqg\lambda$, such that every element of G appears exactly $\lambd$atimes in the list h($i_1, 1) -h(i_2, 1), h(i_1, 2)-h(i_2, 2), …, h(i_1, g\lambda) -h(i_2, g\lambda), for any i_1\neqi_2$. In this paper, we propose a new method of expanding a GH(g^m, \lambda_1) = B = [B_{ij}] over G^m$ by replacing each of its m-tuple B_{ij} with B_{ij} + GH(g, $\lambda_2) where m = g\lambda_2. We may use g^m/\lambda_1 (not necessarily all distinct) GH(g, \lambda_2$)s for the substitution and the resulting matrix is defined over the group of order g.

  • PDF

THE MOORE-PENROSE INVERSE OF THE PARTITIONED MARIX AND SIMULATION STUDY

  • Sunwoo, Ha-Sik
    • Journal of applied mathematics & informatics
    • /
    • 제5권3호
    • /
    • pp.849-857
    • /
    • 1998
  • In this paper we have a concern on the Moore-Penrose inverse of two kinds of partitioned matrices of the form [V X] and [{{{{ {V atop {X} {{{{ {X atop { 0} }}] where V is symmetric. The Moore-Penrose inverse of the partitioned matrices can be reduced to be simpler forms according to some algebraic conditions. Firstly we investigate the representations of the Moore-Penrose inverses of the partitioned matrices under four al-gebraic conditions. Each condition reduces the Moore-Penrose inverses of the partitioned matrices under four al-gebraic conditions. Each condition reduces the Morre-Penrose inverse into some simpler form. Also equivalant conditions will be considered. Finally we will perform a simulation study to investigate which con-dition is the most important in the sense that which condition occurs the most frequently in the real situation. The simluation study will show us a particular condition occurs the most likely tha other conditions. This fact enables us to obtain the Morre-Penrose inverse with less computational efforts and computational storage.