• Title/Summary/Keyword: Information matrix

Search Result 3,491, Processing Time 0.029 seconds

Using The Matrix Pencil Method to Frequency Estimate Algorithm of OFDM System (Matrix Pencil Method를 이용한 OFDM의 주파수 추정)

  • 차정근;강석진;박상백;고진환
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04d
    • /
    • pp.73-75
    • /
    • 2003
  • OFDM 전송방식에 있어서 중요한 주파수 옵셋 추정을 하는데 있어서 기존의 FFT 방법이 가지고 있는 문제점을 보완하는 알고리즘이 많이 연구되고 있다. FFT의 정수배 옵셋외에 소수배 옵셋이 생겼을때 제대로 추정해 낼 수 없는 점을 보완하는 High resolutional technical 알고리즘을 보면 MVDR, MUSIC, root MUSIC, PISARENCO 등이 있다. 본 논문에서는 이러한 알고리즘 중에 MPM(Matrix Pencil Method)를 이용하여 FFT의 문제점을 보완하고 옵셋 추정을 시뮬레이션 해 보았다.

  • PDF

Development of the KnowledgeMatrix as an Informetric Analysis System (계량정보분석시스템으로서의 KnowledgeMatrix 개발)

  • Lee, Bang-Rae;Yeo, Woon-Dong;Lee, June-Young;Lee, Chang-Hoan;Kwon, Oh-Jin;Moon, Yeong-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.1
    • /
    • pp.68-74
    • /
    • 2008
  • Application areas of Knowledge Discovery in Database(KDD) have been expanded to many R&D management processes including technology trends analysis, forecasting and evaluation etc. Established research field such as informetrics (or scientometrics) has utilized techniques or methods of KDD. Various systems have been developed to support works of analyzing large-scale R&D related databases such as patent DB or bibliographic DB by a few researchers or institutions. But extant systems have some problems for korean users to use. Their prices is not moderate, korean language processing is impossible, and user's demands not reflected. To solve these problems, Korea Institute of Science and Technology Information(KISTI) developed stand-alone type information analysis system named as KnowledgeMatrix. KnowledgeMatrix system offer various functions to analyze retrieved data set from databases. KnowledgeMatrix's main operation unit is composed of user-defined lists and matrix generation, cluster analysis, visualization, data pre-processing. Matrix generation unit help extract information items which will be analyzed, and calculate occurrence, co-occurrence, proximity of the items. Cluster analysis unit enable matrix data to be clustered by hierarchical or non-hierarchical clustering methods and present tree-type structure of clustered data. Visualization unit offer various methods such as chart, FDP, strategic diagram and PFNet. Data pre-processing unit consists of data import editor, string editor, thesaurus editor, grouping method, field-refining methods and sub-dataset generation methods. KnowledgeMatrix show better performances and offer more various functions than extant systems.

Genetic evaluation of sheep for resistance to gastrointestinal nematodes and body size including genomic information

  • Torres, Tatiana Saraiva;Sena, Luciano Silva;dos Santos, Gleyson Vieira;Filho, Luiz Antonio Silva Figueiredo;Barbosa, Bruna Lima;Junior, Antonio de Sousa;Britto, Fabio Barros;Sarmento, Jose Lindenberg Rocha
    • Animal Bioscience
    • /
    • v.34 no.4
    • /
    • pp.516-524
    • /
    • 2021
  • Objective: The genetic evaluation of Santa Inês sheep was performed for resistance to gastrointestinal nematode infection (RGNI) and body size using different relationship matrices to assess the efficiency of including genomic information in the analyses. Methods: There were 1,637 animals in the pedigree and 500, 980, and 980 records of RGNI, thoracic depth (TD), and rump height (RH), respectively. The genomic data consisted of 42,748 SNPs and 388 samples genotyped with the OvineSNP50 BeadChip. The (co)variance components were estimated in single- and multi-trait analyses using the numerator relationship matrix (A) and the hybrid matrix H, which blends A with the genomic relationship matrix (G). The BLUP and single-step genomic BLUP methods were used. The accuracies of estimated breeding values and Spearman rank correlation were also used to assess the feasibility of incorporating genomic information in the analyses. Results: The heritability estimates ranged from 0.11±0.07, for TD (in single-trait analysis using the A matrix), to 0.38±0.08, for RH (using the H matrix in multi-trait analysis). The estimates of genetic correlation ranged from -0.65±0.31 to 0.59±0.19, using A, and from -0.42±0.30 to 0.57±0.16 using H. The gains in accuracy of estimated breeding values ranged from 2.22% to 75.00% with the inclusion of genomic information in the analyses. Conclusion: The inclusion of genomic information will benefit the direct selection for the traits in this study, especially RGNI and TD. More information is necessary to improve the understanding on the genetic relationship between resistance to nematode infection and body size in Santa Inês sheep. The genetic evaluation for the evaluated traits was more efficient when genomic information was included in the analyses.

2D-MELPP: A two dimensional matrix exponential based extension of locality preserving projections for dimensional reduction

  • Xiong, Zixun;Wan, Minghua;Xue, Rui;Yang, Guowei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.2991-3007
    • /
    • 2022
  • Two dimensional locality preserving projections (2D-LPP) is an improved algorithm of 2D image to solve the small sample size (SSS) problems which locality preserving projections (LPP) meets. It's able to find the low dimension manifold mapping that not only preserves local information but also detects manifold embedded in original data spaces. However, 2D-LPP is simple and elegant. So, inspired by the comparison experiments between two dimensional linear discriminant analysis (2D-LDA) and linear discriminant analysis (LDA) which indicated that matrix based methods don't always perform better even when training samples are limited, we surmise 2D-LPP may meet the same limitation as 2D-LDA and propose a novel matrix exponential method to enhance the performance of 2D-LPP. 2D-MELPP is equivalent to employing distance diffusion mapping to transform original images into a new space, and margins between labels are broadened, which is beneficial for solving classification problems. Nonetheless, the computational time complexity of 2D-MELPP is extremely high. In this paper, we replace some of matrix multiplications with multiple multiplications to save the memory cost and provide an efficient way for solving 2D-MELPP. We test it on public databases: random 3D data set, ORL, AR face database and Polyu Palmprint database and compare it with other 2D methods like 2D-LDA, 2D-LPP and 1D methods like LPP and exponential locality preserving projections (ELPP), finding it outperforms than others in recognition accuracy. We also compare different dimensions of projection vector and record the cost time on the ORL, AR face database and Polyu Palmprint database. The experiment results above proves that our advanced algorithm has a better performance on 3 independent public databases.

A study on suspension state matrix to improve load/unload performance (로드/언로드 성능향상을 위한 서스펜션 상태행렬 연구)

  • Lee, Yong-Hyun;Kim, Ki-Hoon;Kim, Seok-Hwan;Park, No-Cheol;Park, Young-Pil;Park, Kyoung-Su;Kim, Cheol-Soon
    • Transactions of the Society of Information Storage Systems
    • /
    • v.5 no.1
    • /
    • pp.47-52
    • /
    • 2009
  • Most hard disk drives that apply the ramp load/unload technology unload the heads at the outer edge of the disk while the disk is rotating. The load/unload includes the benefits as like an increased areal density, a reduced power consumption and an improved shock resistance. A lot of papers investigating the effects of the various load/unload parameters such as a suspension tab, a limiter, a ramp and air-bearing surface designs have been published. However, in previous researches, an effect of the suspension is not considered at each load/unload step. In this paper, we focus that a variation of the state matrix affects the load/unload performance on based on a state matrix that is a stiffness matrix of the suspension. Because the state matrix is related to the suspension at each load/unload step, to change the state matrix means the structural change of the suspension. Therefore, we investigated a range of a pitch static attitude(PSA) and a roll static attitude(RSA) for load/unload performance. We also analyzed an effect of the variation of the state matrix a range of load/unload velocity occurred a slider-disk contact. We determined the variation of the state matrix to improve the load/unload performance through comparison of each factor of state matrix.

  • PDF

Improving Levenberg-Marquardt algorithm using the principal submatrix of Jacobian matrix (Jacobian 행렬의 주부분 행렬을 이용한 Levenberg-Marquardt 알고리즘의 개선)

  • Kwak, Young-Tae;Shin, Jung-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.8
    • /
    • pp.11-18
    • /
    • 2009
  • This paper proposes the way of improving learning speed in Levenberg-Marquardt algorithm using the principal submatrix of Jacobian matrix. The Levenberg-Marquardt learning uses Jacobian matrix for Hessian matrix to get the second derivative of an error function. To make the Jacobian matrix an invertible matrix. the Levenberg-Marquardt learning must increase or decrease ${\mu}$ and recalculate the inverse matrix of the Jacobian matrix due to these changes of ${\mu}$. Therefore, to have the proper ${\mu}$, we create the principal submatrix of Jacobian matrix and set the ${\mu}$ as the eigenvalues sum of the principal submatrix. which can make learning speed improve without calculating an additional inverse matrix. We also showed that our method was able to improve learning speed in both a generalized XOR problem and a handwritten digit recognition problem.

Two Messages out of One 2D Matrix Bar Code

  • Cvitic, Filip;Pavcevic, Mario Osvin;Pibernik, Jesenka
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.3
    • /
    • pp.1105-1120
    • /
    • 2015
  • With the proposed principle of two-dimensional matrix bar code design based on masks, the whole surface of a 2D bar code is used for creating graphic patterns. Masks are a method of overlaying certain information with complete preservation of encoded information. In order to ensure suitable mask performance, it is essential to create a set of masks (mask folder) which are similar to each other. This ultimately allows additional error correction on the whole code level which is proven mathematically through an academic example of a QR code with a matrix of size $9{\times}9$. In order to create a mask folder, this article will investigate parameters based on Weber's law. With the parameters founded in the research, this principle shows how QR codes, or any other 2D bar code, can be designed to display two different messages. This ultimately enables a better description of a 2D bar code, which will improve users' visual recognition of 2D bar code purpose, and therefore users' greater enjoyment and involvement.

A Simplified Zero-Forcing Receiver for Multi-User Uplink Systems Based on CB-OSFB Modulation

  • Bian, Xin;Tian, Jinfeng;Wang, Hong;Li, Mingqi;Song, Rongfang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.5
    • /
    • pp.2275-2293
    • /
    • 2020
  • This paper focuses on the simplified receiver design for multi-user circular block oversampled filter bank (CB-OSFB) uplink systems. Through application of discrete Fourier transform (DFT), the special banded structure and circular properties of the modulation matrix in the frequency domain of each user are derived. By exploiting the newly derived properties, a simplified zero-forcing (ZF) receiver is proposed for multi-user CB-OSFB uplink systems in the multipath channels. In the proposed receiver, the matrix inversion operation of the large dimension multi-user equivalent channel matrix is transformed into DFTs and smaller size matrix inversion operations. Simulation is given to show that the proposed ZF receiver can dramatically reduce the computational complexity while with almost the same symbol error rate as that of the traditional ZF receiver.

On the Bayesian Fecision Making Model of 2-Person Coordination Game (2인 조정게임의 베이지안 의사결정모형)

  • 김정훈;정민용
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.3
    • /
    • pp.113-143
    • /
    • 1997
  • Most of the conflict problems between 2 persons can be represented as a bi-matrix game, because player's utilities, in general, are non-zero sum and change according to the progress of game. In the bi-matrix game the equilibrium point set which satisfies the Pareto optimality can be a good bargaining or coordination solution. Under the condition of incomplete information about the risk attitudes of the players, the bargaining or coordination solution depends on additional elements, namely, the players' methods of making inferences when they reach a node in the extensive form of the game that is off the equilibrium path. So the investigation about the players' inference type and its effects on the solution is essential. In addition to that, the effect of an individual's aversion to risk on various solutions in conflict problems, as expressed in his (her) utility function, must be considered. Those kinds of incomplete information make decision maker Bayesian, since it is often impossible to get correct information for building a decision making model. In Baysian point of view, this paper represents an analytic frame for guessing and learning opponent's attitude to risk for getting better reward. As an example for that analytic frame. 2 persons'bi-matrix game is considered. This example explains that a bi-matrix game can be transformed into a kind of matrix game through the players' implicitly cooperative attitude and the need of arbitration.

  • PDF

A Study on Touchless Panel based Interactive Contents Service using IrDA Matrix

  • Lee, Minwoo;Lee, Dongwoo;Kim, Daehyeon;Ann, Myungsuk;Lee, Junghoon;Lee, Seungyoun;Cho, Juphil;Shin, Jaekwon;Cha, Jaesang
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.7 no.2
    • /
    • pp.73-78
    • /
    • 2015
  • Touch panel is mainly applied to pressure type touch panel but it occur a low recognition rate and error during long-term use. So, it is partly applied to capacitive touch panel to compensate for these problems but it also can occur a same problems via pollutions. Touch technology has developed a various method but it is not used because of high costs and difficult installation process. So, in this paper, we proposed an input method of touchless panel using IrDA matrix. This method is conducted using an IrDA Matrix composed of depth sensor. It is possible to offer a various contents for multi user. The proposed technology need a development of a high sensitivity sensing method and high-speed processing method of position information for Seamless operation control. And, it is required high-precision drive technology. Also, we proposed a Seamless user recognition for interactive contents service through a touchless panel using IrDA matrix.