• Title/Summary/Keyword: i-vector

Search Result 1,079, Processing Time 0.022 seconds

A design of Direct Memory Access For H.264 Encoder (H.264 Encoder용 Direct Memory Access (DMA) 설계)

  • Jung, Il-Sub;Suh, Ki-Bum
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.91-94
    • /
    • 2008
  • The designed module save to memory after received Image from CMOS image Sensor(CIS), and set a motion of Encoder module, read from memory per one macroblock each original Image and reference image then supply or save. the time required 470 cycle when processed one macroblock. For designed construct verification, I develop reference Encoder C like JM 9.4 and I proved this module with test vector which achieved from reference encoder C.

  • PDF

SINGULAR THIRD-ORDER 3-POINT BOUNDARY VALUE PROBLEMS

  • Palamides, Alex P.
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.3_4
    • /
    • pp.697-710
    • /
    • 2010
  • In this paper, we prove existence of infinitely many positive and concave solutions, by means of a simple approach, to $3^{th}$ order three-point singular boundary value problem {$x^{\prime\prime\prime}(t)=\alpha(t)f(t,x(t))$, 0 < t < 1, $x(0)=x'(\eta)=x^{\prime\prime}(1)=0$, (1/2 < $\eta$ < 1). Moreover with respect to multiplicity of solutions, we don't assume any monotonicity on the nonlinearity. We rely on a combination of the analysis of the corresponding vector field on the phase-space along with Knesser's type properties of the solutions funnel and the well-known Krasnosel'ski$\breve{i}$'s fixed point theorem. The later is applied on a new very simple cone K, just on the plane $R^2$. These extensions justify the efficiency of our new approach compared to the commonly used one, where the cone $K\;{\subset}\;C$ ([0, 1], $\mathbb{R}$) and the existence of a positive Green's function is a necessity.

East Asian five stock market linkages (아시아 주식수익률의 동조화에 대한 연구)

  • Jung, Heon-Yong
    • Management & Information Systems Review
    • /
    • v.27
    • /
    • pp.131-147
    • /
    • 2008
  • The study examines common component existing in five Asian countries from 1991 to 2007. To do this, the daily stock market indices of Korea, Malaysia, Thailand, Indonesia, and the Philippines were used. Using a Vector Autoregressive Model this paper analyzes causal relations and dynamic interactions between five Asian stock markets. The findings in this study indicate that level of five Asian stock markets' stock return linkages are low. First, from the statistics for pair-wise Granger causality tests, I find Granger-causal relationship between Korea and Indonesia and between Malaysia and and Indonesia. Second, from the results of response function and the statistics of variance decomposition, I find that week shocks to Korean stock market return on Malaysia, Indonesia, Thailand, and the Philippines stock market returns. The results indicate increased Asian stock market linkages but the level is very low. This implies that the benefits of diversification within the five Asian stock markets are still existed.

  • PDF

The Analysis on Vector Control Characteristics of IM Using Finite Element Method (FEM을 이용한 유도 전동기의 벡터제어 특성 해석 연구)

  • Im, D.H.;Kwon, B.I.;Lee, J.H.;Woo, K.I.;Kim, C.E.
    • Proceedings of the KIEE Conference
    • /
    • 1995.07a
    • /
    • pp.56-58
    • /
    • 1995
  • Dynamic characteristics of the vector controlled induction motor has been analysed using d-q equivalent circuit. However, for the design of the induction motor, the analysis of an accurate response characteristic are needed. In this paper, dynamic characteristic analysis method using 2-D Finite Element Method (FEM), which takes the motion equation of the rotor into account and considers the physical motion of the rotor by an automatic subdivision of mesh, are explained.

  • PDF

Optimal Estimation within Class of James-Stein Type Decision Rules on the Known Norm

  • Baek, Hoh Yoo
    • Journal of Integrative Natural Science
    • /
    • v.5 no.3
    • /
    • pp.186-189
    • /
    • 2012
  • For the mean vector of a p-variate normal distribution ($p{\geq}3$), the optimal estimation within the class of James-Stein type decision rules under the quadratic loss are given when the underlying distribution is that of a variance mixture of normals and when the norm ${\parallel}\underline{{\theta}}{\parallel}$ in known. It also demonstrated that the optimal estimation within the class of Lindley type decision rules under the same loss when the underlying distribution is the previous type and the norm ${\parallel}{\theta}-\overline{\theta}\underline{1}{\parallel}$ with $\overline{\theta}=\frac{1}{p}\sum\limits_{i=1}^{n}{\theta}_i$ and $\underline{1}=(1,{\cdots},1)^{\prime}$ is known.

SEMI-INVARINAT SUBMANIFOLDS OF CODIMENSION 3 SATISFYING ${\nabla}_{{\phi}{\nabla}_{\xi}{\xi}}R_{\xi}=0$ IN A COMPLEX SPACE FORM

  • Ki, U-Hang
    • East Asian mathematical journal
    • /
    • v.37 no.1
    • /
    • pp.41-77
    • /
    • 2021
  • Let M be a semi-invariant submanifold of codimension 3 with almost contact metric structure (��, ξ, η, g) in a complex space form Mn+1(c), c ≠ 0. We denote by Rξ = R(·, ξ)ξ and A(i) be Jacobi operator with respect to the structure vector field ξ and be the second fundamental form in the direction of the unit normal C(i), respectively. Suppose that the third fundamental form t satisfies dt(X, Y ) = 2��g(��X, Y ) for certain scalar ��(≠ 2c)and any vector fields X and Y and at the same time Rξ is ��∇ξξ-parallel, then M is a Hopf hypersurface in Mn(c) provided that it satisfies RξA(1) = A(1)Rξ, RξA(2) = A(2)Rξ and ${\bar{r}}-2(n-1)c{\leq}0$, where ${\bar{r}}$ denotes the scalar curvature of M.

One-sided Readings of Numbers in Modal Sentences

  • Kwak, Eun-Joo
    • Journal of English Language & Literature
    • /
    • v.57 no.3
    • /
    • pp.429-455
    • /
    • 2011
  • Numbers have been regarded as one-sided, and their exactly readings have been understood as the results of scalar implicature. This Neo-Gricean view on numbers becomes less persuasive due to theoretical and experimental counterarguments. In spite of growing evidence for theirtwo-sided readings, numbers are still one-sided in modal sentences. Moreover, the occurrence of a negative operator may worsen the acceptability of modal sentences with numbers. In the framework of Vector Space Semantics, I have derived two-sided readings of numbers with the simple notions of monotonicity of modals and scopal relations between modals and numbers. I have also argued that the awkwardness incurred by negation is the result of a split set of vectors for a number. The incoherent set of vectors is understood as the lack of an ideal behavior, which is against the deontic modality of the sentence.

Vector Approximation Bitmap Indexing Method for High Dimensional Multimedia Database (고차원 멀티미디어 데이터 검색을 위한 벡터 근사 비트맵 색인 방법)

  • Park Joo-Hyoun;Son Dea-On;Nang Jong-Ho;Joo Bok-Gyu
    • The KIPS Transactions:PartD
    • /
    • v.13D no.4 s.107
    • /
    • pp.455-462
    • /
    • 2006
  • Recently, the filtering approach using vector approximation such as VA-file[1] or LPC-file[2] have been proposed to support similarity search in high dimensional data space. This approach filters out many irrelevant vectors by calculating the approximate distance from a query vector using the compact approximations of vectors in database. Accordingly, the total elapsed time for similarity search is reduced because the disk I/O time is eliminated by reading the compact approximations instead of original vectors. However, the search time of the VA-file or LPC-file is not much lessened compared to the brute-force search because it requires a lot of computations for calculating the approximate distance. This paper proposes a new bitmap index structure in order to minimize the calculating time. To improve the calculating speed, a specific value of an object is saved in a bit pattern that shows a spatial position of the feature vector on a data space, and the calculation for a distance between objects is performed by the XOR bit calculation that is much faster than the real vector calculation. According to the experiment, the method that this paper suggests has shortened the total searching time to the extent of about one fourth of the sequential searching time, and to the utmost two times of the existing methods by shortening the great deal of calculating time, although this method has a longer data reading time compared to the existing vector approximation based approach. Consequently, it can be confirmed that we can improve even more the searching performance by shortening the calculating time for filtering of the existing vector approximation methods when the database speed is fast enough.

Sequence Analysis of a Cryptic Plasmid pKW2124 from Weissella cibaria KLC140 and Construction of a Surface Display Vector

  • Kim, Soo Young;Oh, Chang Geun;Lee, Young Joo;Choi, Kyu Ha;Shin, Doo Sik;Lee, Si Kyung;Park, Kab Joo;Shin, Hakdong;Park, Myeong Soo;Lee, Ju-Hoon
    • Journal of Microbiology and Biotechnology
    • /
    • v.23 no.4
    • /
    • pp.545-554
    • /
    • 2013
  • Plasmid isolation of kimchi-derived Weissella cibaria KLC140 revealed six different plasmids. The smallest plasmid, pKW2124, was DNA sequenced and characterized, showing 2,126 bp with a GC content of 36.39% and five putative open reading frames (ORFs). In silico analysis of these ORFs showed ORF1 encodes a putative replication protein similar to rolling circular replication proteins from other lactic acid bacteria. However, a single-stranded intermediate was not detected when S1 nuclease was treated, suggesting it may follow theta replication. Interestingly, the replication initiation site of this plasmid is 100% identical to other plasmids from lactic acid bacteria, suggesting it may function for replication initiation. To construct a surface layer expression vector, pTSLGFP, slpA encoding the surface layer protein from Lactobacillus acidophilus was PCR amplified and fused with the gfp gene, forming a SLGFP fused gene. The plasmid pKW2124 was cloned into the XbaI site of pUC19, forming an Weissella-E. coli shuttle vector pKUW22. NheI-linearized pTSLGFP was ligated into pKUWCAT containing pKUW22 and the chloramphenicol acetyltransferase gene from pEK104, resulting in an 8.6 kb pKWCSLGFP surface layer expression vector. After transformation of this vector into W. cibaria KLC140, a GFP fluorescence signal was detected on the surface of the transformant, substantiating production of SLGFP fused protein and its secretion. This is the first report for construction of a Weissella surface layer expression vector, which may be useful for surface layer production of beneficial proteins in Weissella.

Forensic Decision of Median Filtering by Pixel Value's Gradients of Digital Image (디지털 영상의 픽셀값 경사도에 의한 미디언 필터링 포렌식 판정)

  • RHEE, Kang Hyeon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.6
    • /
    • pp.79-84
    • /
    • 2015
  • In a distribution of digital image, there is a serious problem that is a distribution of the altered image by a forger. For the problem solution, this paper proposes a median filtering (MF) image forensic decision algorithm using a feature vector according to the pixel value's gradients. In the proposed algorithm, AR (Autoregressive) coefficients are computed from pixel value' gradients of original image then 1th~6th order coefficients to be six feature vector. And the reconstructed image is produced by the solution of Poisson's equation with the gradients. From the difference image between original and its reconstructed image, four feature vector (Average value, Max. value and the coordinate i,j of Max. value) is extracted. Subsequently, Two kinds of the feature vector combined to 10 Dim. feature vector that is used in the learning of a SVM (Support Vector Machine) classification for MF (Median Filtering) detector of the altered image. On the proposed algorithm of the median filtering detection, compare to MFR (Median Filter Residual) scheme that had the same 10 Dim. feature vectors, the performance is excellent at Unaltered, Averaging filtering ($3{\times}3$) and JPEG (QF=90) images, and less at Gaussian filtering ($3{\times}3$) image. However, in the measured performances of all items, AUC (Area Under Curve) by the sensitivity and 1-specificity is approached to 1. Thus, it is confirmed that the grade evaluation of the proposed algorithm is 'Excellent (A)'.