• Korean Management Science Review
• /
• v.10 no.1
• /
• pp.1-22
• /
• 1993

Systemetic classification of a technology is critical to the development of technology strategy. This paper suggests a new technology classification scheme for computer and communication : a two-level scheme. Technology is first classified by its role and function in the upper level which forms a 2 * 2 matrix. The technology is then further classified into the lower level of 3 classes by associations among technology elements. Thus, a new classification scheme of 2 * 2 * 3 matrix is proposed for the computer and communication technology.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.150-150
• /
• 2019

The development of prolong and severe drought can directly impact on the environment, agriculture, economics and society of country. A lot of efforts have been made across worldwide in the planning, monitoring and mitigation of drought. Currently, different drought indices such as the Palmer Drought Severity Index (PDSI), Standardized Precipitation Index (SPI), Standardized Precipitation Evapotranspiration Index (SPEI) are developed and most commonly used to monitor drought characteristics quantitatively. However, it will be very meaningful and essential to develop a more effective technique for assessment and monitoring of onset and end of drought. Therefore, in this study, the hidden Markov Bayesian classifier (MBC) was employed for the assessment of onset and end of meteorological drought classes. The results showed that the probabilities of different classes based on the MBC were quite suitable and can be employed to estimate onset and end of each class for meteorological droughts. The classification results of MBC were compared with SPI and with past studies which proved that the MBC was able to account accuracy in determining the accurate drought classes. For more performance evaluation of classification results confusion matrix was used to find accuracy and precision in predicting the classes and their results are also appropriate. The overall results indicate that the MBC was effective in predicating the onset and end of drought events and can utilized for monitoring and management of short-term drought risk.

• Journal of Institute of Control, Robotics and Systems
• /
• v.1 no.2
• /
• pp.78-82
• /
• 1995

In this paper, we consider the robustness analysis problem in state space models with linear time invariant perturbations. Based upon the discrete-time Lyapunov approach, sufficient conditions are derived for the eigenvalues of perturbed matrix to be located in a circle, and robustness bounds on perturbations are obtained. Spaecially, for the case of a diagonalizable hermitian matrix the bound is given in terms of the nominal matrix without the solution of Lyapunov equation. This robustness analysis takes account not only of stability robustness but also of certain types of performance robustness. For two perturbation classes resulting bounds are shown to be improved over the existing ones. Examples given include comparison of the proposed analysis method with existing one.

• Korean Journal of Mathematics
• /
• v.29 no.1
• /
• pp.25-40
• /
• 2021

In this article we introduce tribonacci sequence spaces c0(T) and c(T) derived by the domain of a newly defined regular tribonacci matrix T. We give some topological properties, inclusion relations, obtain the Schauder basis and determine ��-, ��- and ��- duals of the spaces c0(T) and c(T). We characterize certain matrix classes (c0(T), Y) and (c(T), Y), where Y is any of the spaces c0, c or ℓ∞. Finally, using Hausdorff measure of non-compactness we characterize certain class of compact operators on the space c0(T).

• Journal of the Korean Mathematical Society
• /
• v.47 no.6
• /
• pp.1269-1282
• /
• 2010

We in this note consider a new concept, so called $\pi$-McCoy, which unifies McCoy rings and IFP rings. The classes of McCoy rings and IFP rings do not contain full matrix rings and upper (lower) triangular matrix rings, but the class of $\pi$-McCoy rings contain upper (lower) triangular matrix rings and many kinds of full matrix rings. We first study the basic structure of $\pi$-McCoy rings, observing the relations among $\pi$-McCoy rings, Abelian rings, 2-primal rings, directly finite rings, and ($\pi-$)regular rings. It is proved that the n by n full matrix rings ($n\geq2$) over reduced rings are not $\pi$-McCoy, finding $\pi$-McCoy matrix rings over non-reduced rings. It is shown that the $\pi$-McCoyness is preserved by polynomial rings (when they are of bounded index of nilpotency) and classical quotient rings. Several kinds of extensions of $\pi$-McCoy rings are also examined.

• Bulletin of the Korean Mathematical Society
• /
• v.20 no.1
• /
• pp.9-13
• /
• 1983

M$_{n}$(F) denotes the set of all n*n matrices over F={0, 1}. For a, b.mem.F, define a+b=max{a, b} and ab=min{a, b}. Under these operations a+b and ab, M$_{n}$(F) forms a multiplicative semigroup (see [1], [4]) and we call it the semigroup of the n*n boolean matrices over F={0, 1}. Since the semigroup M$_{n}$(F) is the matrix representation of the semigroup B$_{n}$ of the binary relations on the set X with n elements, we may identify M$_{n}$(F) with B$_{n}$ for finding all D-classes.l D-classes.

• Journal of Information Technology Services
• /
• v.3 no.2
• /
• pp.99-104
• /
• 2004

Conventional and public-key cryptography has been widely accepted as a base technology for the design of computer security systems. D-classes have the potential for application to conventional and public-key cryptography. However, there are very few results on D-classes because the computational complexity of D-class computation is NP-complete. This paper discusses the design of algorithms for the efficient computation of D-classes and the Java implementation of them. In addition, the paper implements the same D-class computation algorithms in C and shows the performance of C and Java programming languages for the computation-intensive applications by comparing their execution results.

• Communications of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.1075-1090
• /
• 2023

In this paper, we study new classes of operators k-quasi (m, n)-paranormal operator, k-quasi (m, n)^*-paranormal operator, k-quasi (m, n)-class 𝒬 operator and k-quasi (m, n)-class 𝒬^* operator which are the generalization of (m, n)-paranormal and (m, n)^*-paranormal operators. We give matrix characterizations for k-quasi (m, n)-paranormal and k-quasi (m, n)^*-paranormal operators. Also we study some properties of k-quasi (m, n)-class 𝒬 operator and k-quasi (m, n)-class 𝒬^* operators. Moreover, these classes of composition operators on L² spaces are characterized.

• Journal of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.793-806
• /
• 2001

In this paper we consider the enumeration problem of permutations with partially forbidden positions, generalizing the notion of permutations with forbidden positions. .As an alternative approach to this problem, we investigate the permanent maximization problem over some classes of (0,1)-matrices which have a given number of 1's some of which lie in prescribed positions.

• Journal of KIISE:Software and Applications
• /
• v.32 no.8
• /
• pp.789-794
• /
• 2005

LDA (Linear Discriminant Analysis) provides the projection that discriminates the data well, and shows a very good performance for face recognition. However, since LDA provides only one transformation matrix over whole data, it is not sufficient to discriminate the complex data consisting of many classes like honan faces. To overcome this weakness, we propose a new face recognition method, called LDA mixture model, that the set of alf classes are partitioned into several clusters and we get a transformation matrix for each cluster. This detailed representation will improve the classification performance greatly. In the simulation of face recognition, LDA mixture model outperforms PCA, LDA, and PCA mixture model in terms of classification performance.