• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5616-5630
• /
• 2019

Fully homomorphic encryption allows a third-party to perform arbitrary computation over encrypted data and is especially suitable for secure outsourced computation. This paper investigates secure outsourced computation of multiple matrix multiplication based on fully homomorphic encryption. Our work significantly improves the latest Mishra et al.'s work. We improve Mishra et al.'s matrix encoding method by introducing a column-order matrix encoding method which requires smaller parameter. This enables us to develop a binary multiplication method for multiple matrix multiplication, which multiplies pairwise two adjacent matrices in the tree structure instead of Mishra et al.'s sequential matrix multiplication from left to right. The binary multiplication method results in a logarithmic-depth circuit, thus is much more efficient than the sequential matrix multiplication method with linear-depth circuit. Experimental results show that for the product of ten 32×32 (64×64) square matrices our method takes only several thousand seconds while Mishra et al.'s method will take about tens of thousands of years which is astonishingly impractical. In addition, we further generalize our result from square matrix to non-square matrix. Experimental results show that the binary multiplication method and the classical dynamic programming method have a similar performance for ten non-square matrices multiplication.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.1
• /
• pp.57-62
• /
• 2003

Among the procedure of automatic fingerprint recognition, binary code is important for the optimum thinning and singular point extraction while reserving the fingerprint image data. Binarization is to convert gray scale images into 0s and 255s values. For this conversion, you should set up the proper threshold value not to lose fingerprint image data. In this paper, we suggest the method to extract the standard threshold in real-time from fingerprint images entered by applying artificial intelligent methods in the binary code procedure. We show improved features while comparing the experiment results with the existing methods.

• ETRI Journal
• /
• v.34 no.5
• /
• pp.743-752
• /
• 2012

Semantic interpretation of the relationship between noun compound (NC) elements has been a challenging issue due to the lack of contextual information, the unbounded number of combinations, and the absence of a universally accepted system for the categorization. The current models require a huge corpus of data to extract contextual information, which limits their usage in many situations. In this paper, a new semantic relations interpreter for NCs based on novel lightweight binary features is proposed. Some of the binary features used are novel. In addition, the interpreter uses a new feature selection method. By developing these new features and techniques, the proposed method removes the need for any huge corpuses. Implementing this method using a modular and plugin-based framework, and by training it using the largest and the most current fine-grained data set, shows that the accuracy is better than that of previously reported upon methods that utilize large corpuses. This improvement in accuracy and the provision of superior efficiency is achieved not only by improving the old features with such techniques as semantic scattering and sense collocation, but also by using various novel features and classifier max entropy. That the accuracy of the max entropy classifier is higher compared to that of other classifiers, such as a support vector machine, a Na$\ddot{i}$ve Bayes, and a decision tree, is also shown.

• The Journal of the Korea Contents Association
• /
• v.10 no.5
• /
• pp.210-219
• /
• 2010

Consumers differ in both horizontally and vertically. Market segmentation aims to divide horizontally different (or heterogeneous) consumers into more similar (or homogeneous) small segments. A specific consumer, however, may differ in vertically. He (or she) may belong to a different market segment from another one where he (or she) belonged to before. In consumer panel data, the vertical difference can be observed by his (or her) choice among brand alternatives are changing over time. The consumer's vertical difference has been defined as 'dynamics'. In this research, we have developed a binary probit model with random-walk coefficients to capture the consumer's dynamics. With an application to a consumer panel data, we have examined how have the random-walk coefficients changed over time.

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.913-921
• /
• 2004

Steganography is a kind of data hiding which can hide secret information to digital media. It is performed so that another person does not recognize any information and make secret communication between each other. Specially, it is not easy to hide secret information without being visually recognized in scanned text image or cartoon image etc. In this paper, we propose an improved method that can embed a large quantity of secret information in a binary image without noticeable artifacts. Binary cartoon image is divided into block of 3-by-3 sizes. Secret information is embedded by using run-length of 8-neighborhood pixels except for the center pixel of the block. To improve the embedding capacity, we embed it into center pixel under to some condition.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.6
• /
• pp.215-218
• /
• 2014

In hashing-based methods for approximate nearest neighbors(ANN) search, by mapping data points to k-bit binary codes, nearest neighbors are searched in a binary embedding space. In this paper, we present a hashing method using a PCA-based clustering method, Principal Direction Divisive Partitioning(PDDP). PDDP is a clustering method which repeatedly partitions the cluster with the largest variance into two clusters by using the first principal direction. The proposed hashing method utilizes the first principal direction as a projective direction for binary coding. Experimental results demonstrate that the proposed method is competitive compared with other hashing methods.

• Journal of the Korea Society for Simulation
• /
• v.22 no.2
• /
• pp.85-91
• /
• 2013

Smart phones become essential goods for our life. As the technology are developing, and the market becomes saturated, it is important to understand the determinants affecting purchase of smart phones. In this paper, to understand these determinants factor analysis and binary logistics regression is used. Toward this, we first define the determinants into 3 categories: customer satisfaction, switching barrier, and switching attractiveness based on literature review. Furthermore, we develop 9 hypotheses to test with survey data using factor analysis and binary logistics regression. The results show that the six factors (data quality, price satisfaction, corporate image, the burden of new contract, attraction of devices and attraction of other competitors) are significant when customers buy smart phones.

• Bulletin of the Korean Space Science Society
• /
• 2009.10a
• /
• pp.24.2-24.2
• /
• 2009

We present the results of new CCD photometry for the contact binary BX Peg, made during three successive months beginning on September 2008. As do historical light curves, our observations display an O'Connell effect and the November data by themselves indicate clear evidence for very short-time brightness disturbance. For these variations, model spots are applied separately to the two data set of Group I (Sep.--Oct.) and Group II (Nov.). The former is described by a single cool spot on the secondary photosphere and the latter by a two-spot model with a cool spot on the cool star and a hot one on either star. These are generalized manifestations of the magnetic activity of the binary system. Twenty light-curve timings calculated from Wilson-Devinney code were used for a period study, together with all other minimum epochs. The complex period changes of BX Peg can be sorted into a secular period decrease caused dominantly by angular momentum loss due to magnetic stellar wind braking, a light-travel-time (LTT) effect due to the gravitational effect of a low-mass third companion, and a previously unknown short-term oscillation. This last period modulation could be produced either by a second LTT orbit with a period of about 16 yr due to the existence of a fourth body or by the effect of magnetic activity with a cycle length of about 12 yr.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.2
• /
• pp.943-952
• /
• 2018

This paper presents a new type of absolute rotary encoder system based on the affine n-digit N-ary gray code. A brief comparison of the existing encoder systems is carried out in terms of resolution, encoding and decoding principles and number of sensor heads needed. Using the proposed method, two different types of encoder disks are designed, namely, color-coded disk and grayscale coded disk. The designed coded disk pattern is used to manufacture 3 digit 3 ary and 2 digit 5 ary grayscale coded disks respectively. The manufactured disk is used with the light emitter and photodetector assembly to design the entire encode system. Experimental analysis is done on the designed prototype with LabVIEW platform for data acquisition. A comparison of the designed system is done with the traditional binary gray code encoder system in terms of resolution, disk diameter, number of tracks and data acquisition system. The resolution of the manufactured system is 3 times higher than the conventional system. Also, for a 5 digit 5 ary coded encoder system, a resolution approximately 100 times better than the conventional binary system can be achieved. In general, the proposed encoder system gives $(N/2)^n$ times better resolution compared with the traditional gray coded disk. The miniaturization in diameter of the coded disk can be achieved compared to the conventional binary systems.

• Convergence Security Journal
• /
• v.7 no.4
• /
• pp.29-34
• /
• 2007

This paper proposes RCB(Reduced Compact Binary) trie to correct faults of CB(Compact Binary) trie. First, in the case of CB trie, a compact structure was tried for the first time, but as the amount of data was increasing, that of inputted data gained and much difficulty was experienced in insertion due to the dummy nods used in balancing trees. On the other hand, if the HCB trie realized hierarchically, given certain depth to prevent the map from increasing on the right, reached the depth, the method for making new trees and connecting to them was used. Eventually, fast progress could be made in the inputting and searching speed, but this had a disadvantage of the storage space becoming bigger because of the use of dummy nods like CB trie and of many tree links. In the case of RCB trie in this thesis, a capacity is increased by about 60% by completely cutting down dummy nods.