• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.200-203
• /
• 2005

Most of electrical fires are caused by short circuits, overheating of wires, deterioration and incomplete connection of wiring devices. The last two cases are predictable before the occurrence of fire because of its slow progress. In this paper, we have simulated the discharge signals caused by the deterioration and incomplete connection of wiring devices using an aged concent to provide information on the characteristics of discharge signals. From the experimental data, we could characterize the frequency spectrums of the discharge signals depending on the cases. The higher frequency components of the signal are attenuated by the capacitance and inductance of power lines as the measuring point is getting away from the discharges. Main frequency components of the discharge signal are existent at 600 kHz - 1.5 MHz in incomplete connections and at 210 kHz - 8 Mhz in deteriorations of the concent.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.2
• /
• pp.1-7
• /
• 1984

An algorithm, which can obtain a reconstructed image from incomplete projections in computed tomography, is proposed. The algorithm is accomplished with a simple operations of iterative correction in reconstruction - reprojection process using the measured incomplete projections the object's crossection boundary, and so on, To demonstrate effectiveness of the algotithm the results of a computer simulation is presented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.810-831
• /
• 2019

Recently, continuous dimensional emotion recognition from audiovisual clues has attracted increasing attention in both theory and in practice. The large amount of data involved in the recognition processing decreases the efficiency of most bimodal information fusion algorithms. A novel algorithm, namely the incomplete Cholesky decomposition based kernel cross factor analysis (ICDKCFA), is presented and employed for continuous dimensional audiovisual emotion recognition, in this paper. After the ICDKCFA feature transformation, two basic fusion strategies, namely feature-level fusion and decision-level fusion, are explored to combine the transformed visual and audio features for emotion recognition. Finally, extensive experiments are conducted to evaluate the ICDKCFA approach on the AVEC 2016 Multimodal Affect Recognition Sub-Challenge dataset. The experimental results show that the ICDKCFA method has a higher speed than the original kernel cross factor analysis with the comparable performance. Moreover, the ICDKCFA method achieves a better performance than other common information fusion methods, such as the Canonical correlation analysis, kernel canonical correlation analysis and cross-modal factor analysis based fusion methods.

• Journal of the Korea Convergence Society
• /
• v.11 no.3
• /
• pp.1-7
• /
• 2020

This paper introduces two different techniques for dealing with incomplete data and algorithms for learning this data. The first method is to process the incomplete data by assigning the missing value with equal probability that the missing variable can have, and learn this data with the SVM. This technique ensures that the higher the frequency of missing for any variable, the higher the entropy so that it is not selected in the decision tree. This method is characterized by ignoring all remaining information in the missing variable and assigning a new value. On the other hand, the new method is to calculate the entropy probability from the remaining information except the missing value and use it as an estimate of the missing variable. In other words, using a lot of information that is not lost from incomplete learning data to recover some missing information and learn using deep learning. These two methods measure performance by selecting one variable in turn from the training data and iteratively comparing the results of different measurements with varying proportions of data lost in the variable.

• Proceedings of the Korea Database Society Conference
• /
• 1999.06a
• /
• pp.281-287
• /
• 1999

Decision class analysis (DCA) is viewed as a classification problem where a set of input data (situation-specific knowledge) and output data (a topological leveled influence diagram (ID)) is given. Situation-specific knowledge is usually given from a decision maker (DM) with the help of domain expert(s). But it is not easy for the DM to know the situation-specific knowledge of decision problem exactly. This paper presents a methodology fur sensitivity analysis of DCA under incomplete information. The purpose of sensitivity analysis in DCA is to identify the effects of incomplete situation-specific frames whose uncertainty affects the importance of each variable in the resulting model. For such a purpose, our suggested methodology consists of two procedures: generative procedure and adaptive procedure. An interactive procedure is also suggested based the sensitivity analysis to build a well-formed ID. These procedures are formally explained and illustrated with a raw material purchasing problem.

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.1
• /
• pp.137-144
• /
• 2005

In $I{\times}J$ incomplete contingency tables, the test of independence proposed by Chen and Fienberg(1974) uses $I{\times}J-1$ instead of (I-1)(J-1) degrees of freedom without providing much of an increase in the value of the test statistic. For these reasons, Chen and Fienberg tests are expected to have less power. New Wald test statistic related to the part of Chen and Fienberg test statistic is proposed using delta method. These two tests are compared through Monte Carlo studies.

• Management Science and Financial Engineering
• /
• v.17 no.2
• /
• pp.63-84
• /
• 2011

The ordinary multiple criteria decision making (MCDM) approach requires two types of input, alternative values and criterion weights, and employs two schemes of alternative prioritization, dominance and potential optimality. This paper allows for incomplete information on both types of input and gives rise to the dominance relationships and potential optimality of alternatives. Unlike the earlier studies, we emphasize that incomplete information frequently takes the form of strict inequalities, such as strict orders and strict bounds, rather than weak inequalities. Then the issues of rising importance include: (1) The standard mathematical programming approach to prioritize alternatives cannot be used directly, because the feasible region for the permissible decision parameters becomes an open set. (2) We show that the earlier methods replacing the strict inequalities with weak ones, by employing a small positive number or zeroes, which closes the feasible set, may cause a serious problem and yield unacceptable prioritization results. Therefore, we address these important issues and develop a useful and simple method, without selecting any small value for the strict preference information. Given strict information on both types of decision parameters, we first construct a nonlinear program, transform it into a linear programming equivalent, and finally solve it via a two-stage method. An application is also demonstrated herein.

• The KIPS Transactions:PartD
• /
• v.17D no.1
• /
• pp.17-24
• /
• 2010

Recently, there has been growing interest in skyline queries. Most of works for skyline queries assume that the data do not have null value. However, when we input data through the Web or with other different tools, there exist incomplete data with null values. As a result, several skyline processing techniques for incomplete data have been proposed. However, available skyline query techniques for incomplete data do not consider the environments that coexist complete data and incomplete data since these techniques deal with the incomplete data only. In this paper, we propose a novel skyline group processing technique which evaluates skyline queries for the environments that coexist complete data and incomplete data. To do this, we introduce the top-k(g) skyline group query which searches g skyline groups with respect to the user's dimensional preference. In our experimental study, we show efficiency of our proposed technique.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.2
• /
• pp.231-240
• /
• 2010

If only fixed effects exist in a 4 $\times$ 4 balanced incomplete block design, powers of FR statistic for testing a main effect show the highest level with a few replications. Under the exponential and double exponential distributions, FR statistic shows relatively high powers with big differences as compared with the F statistic. Further in a traditional balanced incomplete block design, powers of FR statistic having a fixed main effect and a random block effect show superior preference for all situations without regard to the effect size of a main effect, the parameter size and the type of population distributions of a block effect. Powers of FR statistic increase in a high speed as replications increase. Overall power preference of FR statistic for testing a main effect is caused by unique characteristic of a balanced incomplete block design having one main and block effect with missing observations, which sensitively responds to small increase of main effect and sample size.

• International Journal of Contents
• /
• v.2 no.3
• /
• pp.22-26
• /
• 2006

In this paper we introduce a new circle detection algorithm for occluded on/off pupil and iris boundary extraction. The proposed algorithm employs 7-step processing to detect a center and radius of occluded on/off eye images using the property of the chords. The algorithm deals with two types of occluded pupil and iris boundary information; one is composed of circle-shaped, incomplete objects, which is called occluded on iris images and the other type consists of arc objects in which circular information has partially disappeared, called occluded off iris images. This method shows that the center and radius of iris boundary can be detected from as little as one-third of the occluded on/off iris information image. It is also shown that the proposed algorithm computed the center and radius of the incomplete iris boundary information which has partially occluded and disappeared. Experimental results on RGB images and IR images show that the proposed method has encouraging performance of boundary detection for pupil and iris segmentation. The experimental results show satisfactorily the detection of circle from incomplete circle shape information which is occluded as well as the detection of pupil/iris boundary circle of the occluded on/off image.