• Bulletin of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.497-505
• /
• 2017

The rank over a finite field of the adjacency matrix of a directed strongly regular graph is studied, with some applications to the construction of linear codes. Three techniques are used: code orthogonality, adjacency matrix determinant, and adjacency matrix spectrum.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1095-1106
• /
• 1994

This paper presents a method for determining optimal grayscale function processing(FP) morphological filters under the least square (LMS) error criterion. The optimal erosion and dilation filters with a grayscale structuring element(GSE) are determined by minimizing the mean square error (MSE) between the desired signal and the filter output. It is shown that convergence of the erosion and dilation filters can be achieved by a proper choice of the step size parameter of the LMS algorithm. In an attempt to determine optimal closing and opening filters, a matrix representation of both opening and closing with a basis matrix is proposed. With this representation, opening and closing are accomplished by a local matrix operation rather than cascade operations. The LMS and back-propagation algorithm are utilzed for obtaining the optimal basis matrix for closing and opening. Some results of optimal morphological filters applied to 2-D images are presented.

• Journal of the Korean Geographical Society
• /
• v.48 no.6
• /
• pp.978-993
• /
• 2013

It can be advantage as well as disadvantage to use the spatial weight matrix in a spatial regression model; it would benefit from explicitly quantifying spatial relationships between geographical units, but necessarily involve subjective judgment while specifying the matrix. We took Incheon City as a study area and investigated how the fitness of a spatial regression model changed by constructing various spatial weight matrices. In addition, we explored neighborhood segmentation in the study area and analyzed any influence of it on the model adequacy of two basic spatial regression models, i.e., spatial lagged and spatial error models. The results showed that it can help to improve the adequacy of models to specify the spatial weight matrix strictly, that is, interpreting the neighborhood as small as possible when estimating land price. It was also found that the spatial error model would be preferred in the area with serious spatial heterogeneity. In such area, we found that its spatial heterogeneity can be alleviated by delineating sub-neighborhoods, and as a result, the spatial lagged model would be preferred over the spatial error model.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.12 no.3
• /
• pp.331-340
• /
• 2012

In the deep sub-micron ICs, growing amounts of on-die memory and scaling effects make embedded memories increasingly vulnerable to reliability and yield problems. Spare columns are often included in memories to repair defective cells or bit lines during production test. In many cases, the repair process will not use all spare columns. Schemes have been proposed to exploit these unused spare columns to store additional check bits which can be used to reduce the miscorrection probability for triple errors in single error correction-double error detection (SEC-DED). These additional check bits increase the dimensions of the parity check matrix (H-matrix) requiring extra area overhead. A method is proposed in this paper to efficiently fill the extra rows of the H-matrix on the basis of similarity of logic between the other rows. Optimization of the whole H-matrix is accomplished through logic sharing within a feasible operating time resulting in reduced area overhead. A detailed implementation using fuse technology is also proposed in this paper.

• Spatial Information Research
• /
• v.21 no.2
• /
• pp.45-54
• /
• 2013

Analytical and simulation error models have the ability to describe (or realize) error-corrupted versions of spatial data. But the different approaches for modeling positional errors require an internal validation that ascertains whether the analytical and simulation error models predict correct positional errors in a defined set of conditions. This paper presents stochastic simulation models of a point and a line segm ent to be validated w ith analytical error models, which are an error ellipse and an error band model, respectively. The simulation error models populate positional errors by the Monte Carlo simulation, according to an assumed error distribution prescribed by given parameters of a variance-covariance matrix. In the validation process, a set of positional errors by the simulation models is compared to a theoretical description by the analytical error models. Results show that the proposed simulation models realize positional uncertainties of the same spatial data according to a defined level of positional quality.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.13-21
• /
• 2010

The Optimal results of Kalman Filtering on the Inverted Pendulum System requires an effective factor such as the noise covariance matrix Q, the measurement noise covariance matrix R and the initial error covariance matrix $P_0$. We present a special case where the optimality of the filter is not destroyed and not sensitive to scaling of these covariance matrix because these factors are unknown or are known only approximately in the practical situation. Moreover, the error covariance matrices issued by this method predict errors in the state estimate consistent with the scaled covariance matrices and not the issued state estimates. Various results using the scalar gain $\delta$ are derived to described the relations among the three covariance matrices, Kalman Gain and the error covariance matrices. This paper is described as follows: Section III a brief overview of the Inverted Pendulum system. Section IV deals with the mathematical dynamic model of the system used for the computer simulation. Section V presents a various simulation results using the scalar gain.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.253-256
• /
• 1997

This paper proposes a control strategy of position and force control in the same direction based on hybrid position/force control. In order to control position and force in the same direction, a weighting matrix is introduced instead of a selection matrix suggested by Raibert and Craig. The major part of the controller output comes from the position controller when a position control error is large, from the force controller when a position control error is large. The proposed algorithm is implemented by the simulation and experiment focusing on the peg-in-hole task where friction exist significantly and is not constant. It also adopts and event control scheme for more efficient performance.

• Journal of KSNVE
• /
• v.6 no.5
• /
• pp.679-684
• /
• 1996

The Instrumental Variable Method(IVM), modified from least square algorithm, is applied to parameter identification of a noise contaminated bearing test rig. The signal to noise ratio included in Frequency Response Function(FRF) can cause significant errors in parameter identification. Therefore, among several candidates of parameter identification method, results of the applied IVM were compared with noise-contaminated least square method. This study shows that the noise-contaminated least square method can have indonsistent accuracy depending on the degree of noise level, while the IVM has robuster performance to signal to noise ratio than least square method.

• Journal of the Korean Mathematical Society
• /
• v.57 no.2
• /
• pp.401-414
• /
• 2020

It is computationally expensive to compute principal components from scratch at every update or downdate when new data arrive and existing data are truncated from the data matrix frequently. To overcome this limitations, incremental principal component analysis is considered. Specifically, we present a sliding window based efficient incremental principal component computation from a covariance matrix which comprises of two procedures; simultaneous update and downdate of principal components, followed by the rank-one matrix update. Additionally we track the accurate decomposition error and the adaptive numerical rank. Experiments show that the proposed algorithm enables a faster execution speed and no-meaningful decomposition error differences compared to typical incremental principal component analysis algorithms, thereby maintaining a good approximation for the principal components.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.4
• /
• pp.374-387
• /
• 1989

The decoding method of Binary BCH Codes using symmetric matrix is proposed in this paper. With this method, the error-locator-polynomial is composed by symmetric matrix which consists of the powers of the unknown X plus the synfromes as its elements. The symmetric matirx can also be represented in terms of the unknown X. But the each coefficients of the error-locator polynomial represents the matirx with the syndromes as its entries. By utilizing this proposed algorithm, the device for decoding circuit of the (63, 45) BCH Code for t=3 has been implemented for demonstration.