• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.3
• /
• pp.203-209
• /
• 2010

Since information systems are pervasive in the business and non-business areas, the issue of extending researches on information systems to knowledge systems and e-business systems is one of the most profitable topics of researches. We propose a historical, discontinuous changes introducing ambiguity in explaining and interpreting innovative nature of three paradigms of systems: information systems, knowledge systems, and e-business systems. Resorting to the historical perspective in developing ideas into meaningful themes, we proposed a discrete continuity in interpreting changes of paradigms of systems. Discrete continuity may be explained by ambiguously-shared meaningful perspectives applied to different paradigms of systems and interpretive elements of each system. The discrete continuity has been adopted to make ambiguity utilized have instrumental contribution in researches. The engrafted ambiguity in systems design, development, and use could have enduring instrumental value in interpreting the types or variants of systems in each paradigm of systems.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.4
• /
• pp.1067-1082
• /
• 2003

In this paper, we propose a randomized response model with discrete quantitative attribute by three-stage cluster sampling for obtaining discrete quantitative data by using the Liu & Chow model(1976), when the population was made up of sensitive discrete quantitative clusters. We obtain the minimum variance by calculating the optimum number of fsu, ssu, tsu under the some given constant cost. And we obtain the minimum cost under the some given accuracy.

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.754-764
• /
• 2016

The exhaustive list of sparsification methods for a digital image suffers from achieving an adequate number of zero and near-zero coefficients. The method proposed in this paper, which is known as the Discrete Rajan Transform Sparsification, overcomes this inadequacy. An attempt has been made to compare the simulation results for benchmark images by various popular, existing techniques and analyzing from different aspects. With the help of Discrete Rajan Transform algorithm, both lossless and lossy sparse representations are obtained. We divided an image into $8{\times}8-sized$ blocks and applied the Discrete Rajan Transform algorithm to it to get a more sparsified spectrum. The image was reconstructed from the transformed output of the Discrete Rajan Transform algorithm with an acceptable peak signal-to-noise ratio. The performance of the Discrete Rajan Transform in providing sparsity was compared with the results provided by the Discrete Fourier Transform, Discrete Cosine Transform, and the Discrete Wavelet Transform by means of the Degree of Sparsity. The simulation results proved that the Discrete Rajan Transform provides better sparsification when compared to other methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4467-4486
• /
• 2016

Discrete cosine transform (DCT) based JPEG standard significantly improves the coding efficiency of image compression, but it is unacceptable event in serious blocking artifacts at low bit rate and low efficiency of high-definition image. In the light of all phase digital filtering theory, this paper proposes a novel transform based on discrete sine transform (DST), which is called all phase discrete sine biorthogonal transform (APDSBT). Applying APDSBT to JPEG scheme, the blocking artifacts are reduced significantly. The reconstructed image of APDSBT-JPEG is better than that of DCT-JPEG in terms of objective quality and subjective effect. For improving the efficiency of JPEG coding, the structure of JPEG is analyzed. We analyze key factors in design and evaluation of JPEG compression on the massive parallel graphics processing units (GPUs) using the compute unified device architecture (CUDA) programming model. Experimental results show that the maximum speedup ratio of parallel algorithm of APDSBT-JPEG can reach more than 100 times with a very low version GPU. Some new parallel strategies are illustrated in this paper for improving the performance of parallel algorithm. With the optimal strategy, the efficiency can be improved over 10%.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.7
• /
• pp.99-104
• /
• 2018

In this paper, we compare Fisher's continuous method with an exact discrete analog of Fisher's continuous method from permutation tests for combining p values. The discrete analog of Fisher's continuous method is known to be adequate for combining independent p values from discrete probability distributions. Also permutation tests are widely used as alternatives to conventional parametric tests since these tests are distribution-free, and yield discrete probability distributions and exact p values. In this paper, we obtain permutation p values from discrete probability distributions using Mann-Whitney test data sets (real data and hypothetical data) and combine p values by the exact discrete analog of Fisher's continuous method.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.4
• /
• pp.45-52
• /
• 2011

In the real-field of control cases for robot manipulators, there always exists a modeling error, which results the model has the uncertainties in its parameters and/or structure. In many modem applications, digital computers are extensively used to implement control algorithms to control such systems. The discretization of the nonlinear dynamic equations of such systems results in a complicated discrete dynamic equations. Therefore, it will be difficult to design a discrete-time controller to give good tracking performances in the presence of certain uncertainties. In this paper, a discrete-time sliding mode control algorithm for nonlinear and time varying robot manipulators with uncertainties is presented. Sufficient conditions for guaranteeing the convergence of the discrete-time SMC system are derived. As example simulations, the proposed SMC algorithm is applied to a two-link robotic manipulator with unknown dynamics. The results of the simulation indicate that the developed control scheme is effective in manipulators and electro-mechanical system control.

• Journal of Multimedia Information System
• /
• v.4 no.4
• /
• pp.317-320
• /
• 2017

This paper examines approaches to the development of algorithms of parametric identification of models of complex systems from discrete observations. A modification of a known algorithm Kaczmarz which is designed for closed systems with perturbations, based on the methods of random search and investigates their statistical properties.

• Communications for Statistical Applications and Methods
• /
• v.26 no.3
• /
• pp.325-336
• /
• 2019

In this article we extend the discrete Weibull regression model in the presence of missing data. Discrete Weibull regression models can be adapted to various type of dispersion data however, it is not widely used. Recently Yoo (Journal of the Korean Data and Information Science Society, 30, 11-22, 2019) adapted the discrete Weibull regression model using single imputation. We extend their studies by using multiple imputation also with several various settings and compare the results. The purpose of this study is to address the merit of using multiple imputation in the presence of missing data in discrete count data. We analyzed the seventh Korean National Health and Nutrition Examination Survey (KNHANES VII), from 2016 to assess the factors influencing the variable, 1 month hospital stay, and we compared the results using discrete Weibull regression model with those of Poisson, negative Binomial and zero-inflated Poisson regression models, which are widely used in count data analyses. The results showed that the discrete Weibull regression model using multiple imputation provided the best fit. We also performed simulation studies to show the accuracy of the discrete Weibull regression using multiple imputation given both under- and over-dispersed distribution, as well as varying missing rates and sample size. Sensitivity analysis showed the influence of mis-specification and the robustness of the discrete Weibull model. Using imputation with discrete Weibull regression to analyze discrete data will increase explanatory power and is widely applicable to various types of dispersion data with a unified model.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.3
• /
• pp.575-584
• /
• 2004

We propose a Bayesian model-based approach using a mixture of Dirichlet processes model with discrete wavelet transform, for curve clustering in the microarray data with time-course gene expressions.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.7
• /
• pp.175-182
• /
• 2020

Fisher's classical method for combining independent p-values from continuous distributions is widely used but it is known to be inadequate for combining p-values from discrete probability distributions. Instead, the discrete analog of Fisher's classical method is used as an alternative for combining p-values from discrete distributions. In this paper, firstly we obtain p-values from discrete probability distributions associated with multi-sample location test data (Fisher-Pitman test and Kruskall-Wallis test data) by permutation method, and secondly combine the permutaion p-values by the discrete analog of Fisher's classical method. And we finally compare the combined p-values from both the discrete analog of Fisher's classical method and Fisher's classical method.