• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.141-148
• /
• 2023

During the medical data transmissions, the protection of the patient information is vital. Hence this work proposes a spatial domain watermarking algorithm that enhances the data payload (capacity) while maintaining the authentication and data hiding. The code is distributed at every pixel of the digital image and not only in the regions of non-interest pixels. But the image details are still preserved. The performance of the proposed algorithm is evaluated using several performance measures such as the mean square error (MSE), the mean absolute error (MAE), and the peak signal to noise Ratio (PSNR), the universal image quality index (UIQI) and the structural similarity index (SSIM).

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.31-41
• /
• 2009

In the Semantic Web, it is possible to provide intelligent information retrieval and automated web services by defining a concept of information resource and representing a semantic relation between resources with meta data and ontology. It is very important to manage semantic data such as ontology and meta data efficiently for implementing essential functions of the Semantic Web. Thus we propose an index structure to support more accurate search results and efficient query processing by considering semantic and structural features of the semantic data. Especially we use a graph data model to express semantic and structural features of the semantic data and process various type of queries by using graph model based path expressions. In this paper the proposed index aims to distinguish our approach from earlier studies and involve the concept of the Semantic Web in its entirety by querying on primarily extracted structural path information and secondary extracted one through semantic inferences with ontology. In the experiments, we show that our approach is more accurate and efficient than the previous approaches and can be applicable to various applications in the Semantic Web.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.4
• /
• pp.869-878
• /
• 2007

In this paper a new process capability index $C_{psks}$ is introduced for non-normal process. $C_{psks}$ that is proposed by transformation of the $C_{psks}$ incorporates an additional skewness correction factor in the denominator of $C_{psks}$. The use of each technique is illustrated by reference to a distribution system which includes the Pearson and Johnson functions. Accordingly, $C_{psks}$ is proposed as the process capability measure for non-normal process.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.4
• /
• pp.937-943
• /
• 2007

In this paper a new process incapability index $C^*_{psks}$ is introduced for non-normal process. $C^*_{psks}$ is proposed by transformation of the $C^*_{psks}$. The use of each technique is illustrated by reference to a distribution system which includes the Pearson and Johnson functions. Accordingly, $C^*_{psks}$ is proposed as the process capability measures for non-normal process.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.7
• /
• pp.11-22
• /
• 1992

In this paper, a new indexing technique is proposed for efficient evaluation of nested queries on aggregation hierarchy in object-oriented data model. As an index data structure, an extended $B^{+}$ tree is introduced in which instance identifier to be searched and path information used for update of index record are stored in leaf node and subleaf node, respectively. the retrieval and update algorithm on the introduced index data structure is provided. Comparisons under a variety of conditions are given with current indexing techniques, showing improved performance in cost, i.e., the total number of pages accessed for retrieval and update.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.4
• /
• pp.1305-1325
• /
• 2008

As index option markets grow recently, many analysts and investors become interested in forecasting the volatility of KOSPI 200 Index to achieve portfolio's goal from the point of financial risk management and asset evaluation. To serve this purpose, we introduce NN and SVM integrated with other financial series models such as GARCH, EGARCH, and EWMA. Moreover, according to the empirical test, Integrating NN with GARCH or EWMA models improves prediction power in terms of the precision and the direction of the volatility of KOSPI 200 index. However, integrating SVM with financial series models doesn't improve greatly the prediction power. In summary, SVM-EGARCH was the best in terms of predicting the direction of the volatility and NN-GARCH was the best in terms of the prediction precision. We conclude with advantages of the integration process and the need for integrating models to enhance the prediction power.

• Journal of Information Processing Systems
• /
• v.20 no.3
• /
• pp.285-295
• /
• 2024

Driven by the vague assessment big data, a product service system (PSS) evaluation method is developed based on a hybrid model of multi-weight combination and improved TOPSIS by relative entropy. The index values of PSS alternatives are solved by the integration of the stakeholders' vague assessment comments presented in the form of trapezoidal fuzzy numbers. Multi-weight combination method is proposed for index weight solving of PSS evaluation decision-making. An improved TOPSIS by relative entropy (RE) is presented to overcome the shortcomings of traditional TOPSIS and related modified TOPSIS and then PSS alternatives are evaluated. A PSS evaluation case in a printer company is given to test and verify the proposed model. The RE closeness of seven PSS alternatives are 0.3940, 0.5147, 0.7913, 0.3719, 0.2403, 0.4959, and 0.6332 and the one with the highest RE closeness is selected as the best alternative. The results of comparison examples show that the presented model can compensate for the shortcomings of existing traditional methods.

• Journal of Information Technology Services
• /
• v.12 no.4
• /
• pp.423-434
• /
• 2013

Since acquiring intelligence about political situations around the Korea Peninsular in a direct manner is nearly impossible, it is inevitable for the individuals or companies to rely on open and indirect data such as newspapers. However, since the contents in the newspapers are substantially unstructured and very large, conventional content analysis is time-consuming and hence very costly. Hence, this paper aims to propose a sentimental analysis method which computes daily 'peace index' from unstructured data in the newspapers. From the content analysis, words and phrases which represent the sentiment of a nation are carefully identified. To show the feasibility of the idea proposed in this paper, a prototype system with vocabulary repository about political situations was developed for estimating peace index automatically.

• Journal of the Korean Society of Costume
• /
• v.37
• /
• pp.181-190
• /
• 1998

The purpose of this study was to provide basic information for women's women's head type for mil-inary. The subjects were 141 college women aged from 19∼23. Data were collected from the real anthropometric measurements and 4 index. Correlation coefficientss, factor analysis, cluster analysis and analysis of variance in SAS package. The results were as follows : 4 factors were extracted from 20 anthrometric measurements and in index data, which explain 60.0% of variance. The subjectss were classified into 4 clusters by 11 measurement and 4 index data. Each charicteristics of cluster by the measurements was flat, big, thick, small types in women's head. Each charicteristics of cluster by the index data was mostly flat in head thickness and wide, midium, narrow, very wide type in face.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.400-407
• /
• 2011

Various air indexing and data scheduling schemes for wireless broadcast of spatial data have been developed for energy efficient query processing. The existing schemes are not effective when the clients' data access patterns are skewed to some items. It is because the schemes are based on flat broadcast that does not take the popularity of the data items into consideration. In this paper, thus, we propose a data scheduling scheme letting the popular items appear more frequently on the channel, and grid-based distributed index for non-flat broadcast (GDIN) for window query processing. The proposed GDIN allows quick and energy efficient processing of window query, matching the clients' linear channel access pattern and letting the clients access only the queried data items. The simulation results show that the proposed GDIN significantly outperforms the existing schemes in terms of access time, tuning time, and energy efficiency.