• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.4
• /
• pp.53-61
• /
• 2014

In this paper, we proposed covariance weight matrix using SPT matrix in order to accurate target estimation. We have estimated a target using modified covariance matrix and beam steering error method. We have minimized beam steering error in order to estimation desired a target. This method obtain optimum covariance weight using modified SPT matrix. This paper of proposal method is showed good performance than general method. We updated a weight of covariance matrix using modified SPT matrix. We obtain optimum covariance matrix weight to application beam steering error method in order to beam steering toward desired target. Through simulation, we showed that compare proposal method with general method. It have improved resolution of estimation target to good performance more proposed method than general method.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.1
• /
• pp.62-68
• /
• 2002

It is well known that the MDVR beamforming outperforms the conventional delay-sum beamformer in the sense of noise rejection and bearing resolution. However, the MDVR method requires long observation time to achieve high frequency resolution. The STMV method uses the steered covariance matrix of sensor data, so it has an ability to form an adaptive weight vector from a single time-series snapshot. But it uses the same weight vector across all frequencies. In this paper, we propose an SSMV method. The basic idea of the SSMV method is to decompose a full frequency band into several subbands to acquire a weight vector for each subband, individually. Also the wrap may be divided into several subarrays in order to reduce a computational load and the bandwidth of each subband. Simulations using real sea trial data show that the proposed SSMV method has good performance with short observation time.

• The Journal of the Convergence on Culture Technology
• /
• v.5 no.1
• /
• pp.395-399
• /
• 2019

In order to support various parallel computing systems, it is necessary to extend LLVM IR to more efficiently support vector / matrix and to design LLVM IR to machine code as a new algorithm. As shown in the IR example, RISC instruction generation is naturally generated because the RISC instruction is basically composed of the RISC instruction, and the vector instruction is also not supported. There is a need for new IR structures, command generation algorithms and related extensions to support vector / matrix more robustly. To do this, it is important to map each instruction in the LLVM IR to the appropriate instruction in the target architecture (vector / matrix) (instruction selection algorithm). It is necessary to understand the meaning of LLVM IR command, to compare the meaning of each instruction of the target architecture with syntax, and to select the instruction that matches the pattern to make mapping efficient.

• Communications of Mathematical Education
• /
• v.37 no.3
• /
• pp.443-465
• /
• 2023

This study examines the content of vectors and matrices in Artificial Intelligence Mathematics textbooks (AIMTs) from the 2015 revised mathematics curriculum. We analyzed the implementation of foundational mathematical concepts, specifically definitions and related sub-concepts of vectors and matrices, in these textbooks, given their importance for understanding AI. The findings reveal significant variations in the presentation of vector-related concepts, definitions, sub-concepts, and levels of contextual information and descriptions such as vector size, distance between vectors, and mathematical interpretation. While there are few discrepancies in the presentation of fundamental matrix concepts, differences emerge in the subtypes of matrices used and the matrix operations applied in image data processing across textbooks. There is also variation in how textbooks emphasize the interconnectedness of mathematics for explaining vector-related concepts versus the textbooks place more emphasis on AI-related knowledge than on mathematical concepts and principles. The implications for future curriculum development and textbook design are discussed, providing insights into improving AI mathematics education.

• Structural Engineering and Mechanics
• /
• v.57 no.2
• /
• pp.327-355
• /
• 2016

A new analytical derivation of the elastodynamic point load solutions for an isotropic multi-layered half-space is presented by means of the precise integration method (PIM) and the approach of dual vector. The time-harmonic external load is prescribed either on the external boundary or in the interior of the solid medium. Starting with the axisymmetric governing motion equations in a cylindrical coordinate system, a second order ordinary differential matrix equation can be gained by making use of the Hankel integral transform. Employing the technique of dual vector, the second order ordinary differential matrix equation can be simplified into a first-order one. The approach of PIM is implemented to obtain the solutions of the ordinary differential matrix equation in the Hankel integral transform domain. The PIM is a highly accurate algorithm to solve sets of first-order ordinary differential equations and any desired accuracy of the dynamic point load solutions can be achieved. The numerical simulation is based on algebraic matrix operation. As a result, the computational effort is reduced to a great extent and the computation is unconditionally stable. Selected numerical trials are given to validate the accuracy and applicability of the proposed approach. More examples are discussed to portray the dependence of the load-displacement response on the isotropic parameters of the multi-layered media, the depth of external load and the frequency of excitation.

• Communications of the Korean Mathematical Society
• /
• v.13 no.3
• /
• pp.465-473
• /
• 1998

A real m $\times$ n matrix A is semipositive (SP) if there is a vector x $\geq$ 0 such that Ax > 0, inequalities being entrywise. A is minimally semipositive (MSP) if A is semipositive and no column deleted submatrix of A is semipositive. We give a necessary and sufficient condition for the sign pattern matrix with n positive entries to be minimally semipositive.

• Journal of Biomedical Engineering Research
• /
• v.5 no.2
• /
• pp.121-126
• /
• 1984

A new approach to texture classification for quantitative ultrasound liver diagnosis using run difference matrix was developed. The run difference matrix comprised the gray level difference along with a distances. From this run difference matrix, we defined several vectors and parameters such as DOD, DGD, DAD vector, SHP, SMO, SMG, LDE, LDEL etc.Each parameter values calculated in fatty, cirrhotic, normal and chronic hepatitic liver images were plotted in a plane and we found that RDM method was more sensitive to small structural changes than the conventional run length method and showed improved classification ability between the diseases.

• Journal of the Korean Statistical Society
• /
• v.12 no.2
• /
• pp.61-68
• /
• 1983

A parallel flats fraction for the $3^n$ factorial experiment is defined as the union of flats, ${t$\mid$At=C_i(mod 3)}, i=1,2,\cdot,f$, in EG(n,3) and is symbolically written as At=C where A is of rank r. The A matrix partitions the effects into u+1 alias sets where $u=(3^{n-r}-1)/2$. For each alias set the f flats produce an alias component permutation matrix (ACPM) with elements from $S_3$. In this paper, a detection vector of the ACPM was constructed for each combination of k or fewer two-factor interactions. Also the relationship between the detection vectors has been shown.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12A
• /
• pp.1185-1190
• /
• 2008

In this paper, we propose an simplified successive minimum mean square error ($S^{2}MMSE$) algorithm that can simplify the computational complexity for precoding matrix generation in the successive minimum mean square error (SMMSE) precoding method, which is adopted as a multiuser multiple-input multiple-output (MU-MIMO) precoding technique in the IST (information society technologies)-WINNER (wireless world initiative new radio) project. The original algorithm generates the precoding matrix by calculating all individual precoding vectors with each requiring its own MMSE nulling matrix, over all receive antennas for all users. In contrast, this proposed algorithm first calculates the MMSE nulling matrix for each user, and then calculates all precoding vectors for respective receive antennas of the corresponding user by using the identical MMSE nulling matrix, in which only a simple matrix-vector multiplication is required for each vector. Consequently, it can simplify significantly the computational complexity to generate a precoding matrix for SMMSE precoding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.9
• /
• pp.519-527
• /
• 2014

Adaptive arrays can minimize contributions from interferences incident onto an sensor array while preserving a signal the direction vector of which corresponds to the array steering vector to within a scalar factor. If there exist errors in the steering vector, severe performance degradation can be caused since the desired signal is misunderstood as an interference by the array. This paper presents an adaptive beamforming method which is robust against steering vector errors, exploiting a range of the desired signal direction. In the presented method, an correlation matrix of array response vectors is obtained through integration over the direction range and a minimization problem is formulated using some eigenvectors of the correlation matrix such that a more accurate steering vector than initially given one can be found. The minimization problem is transformed into a relaxed SDP (semidefinite program) problem, which can be effectively solved since it is a sort of convex optimization. Simulation results show that the proposed method outperforms existing ones such as ORM (outside-range-based method) and USM (uncertainty-based method).