• Asian Pacific Journal of Cancer Prevention
• /
• v.14 no.1
• /
• pp.595-598
• /
• 2013

Background: Lung cancer is the leading cause of cancer death worldwide Therefore, identification of genetic as well as environmental factors is very important in developing novel methods of lung cancer prevention. However, this is a multi-layered problem. Therefore a lung cancer risk prediction system is here proposed which is easy, cost effective and time saving. Materials and Methods: Initially 400 cancer and non-cancer patients' data were collected from different diagnostic centres, pre-processed and clustered using a K-means clustering algorithm for identifying relevant and non-relevant data. Next significant frequent patterns are discovered using AprioriTid and a decision tree algorithm. Results: Finally using the significant pattern prediction tools for a lung cancer prediction system were developed. This lung cancer risk prediction system should prove helpful in detection of a person's predisposition for lung cancer. Conclusions: Most of people of Bangladesh do not even know they have lung cancer and the majority of cases are diagnosed at late stages when cure is impossible. Therefore early prediction of lung cancer should play a pivotal role in the diagnosis process and for an effective preventive strategy.

• Convergence Security Journal
• /
• v.9 no.2
• /
• pp.71-78
• /
• 2009

It is very difficult to apply previous security protocols to WSNs(Wireless Sensor Networks) directly because WNSs have resource constrained characteristics such as a low computing ability, power, and a low communication band width. In order to overcome the problem, we proposes a secure group communication scheme applicable to WSNs. The proposed scheme is a combined form of the TEEN(Threshold sensitive Energy Efficient sensor Network protocol) clustering based hierarchical routing protocol and security mechanism, and we assume that WSNs are composed of sensor nodes, cluster headers, and base stations. We use both private key and public key cryptographic algorithms to achieve an enhanced security and an efficient key management. In addition, communications among sensor nodes, cluster headers, and base stations are accomplished by a hierarchical tree architecture to reduce power consumption. Therefore, the proposed scheme in this paper is well suited for WSNs since our design can provide not only a more enhanced security but also a lower power consumption in communications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2699-2707
• /
• 2013

We proposed the context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm at Mobile Ad-hoc Network(MANET). MANET has problem about dynamic topology, the lack of scalability of the network by mobile of node. By mobile of node, energy consumption rate is different. So it is important choosing routing algorithms for the minium of energy consumption rate. DDV-hop algorithms considers of the attribute of mobile node, create a cluster and maintain. And it provides a path by searching a route more energy efficient. We apply mobile of node by direction and time, the alogorighm of routning path and energy efficiency clustering is provided, it is shown the result of enery consumption that is optimized for the network.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2298-2309
• /
• 2000

This paper proposes the multidimensioa! nested attribute indexing techniques (MD- NAI) in object-oriented databases using a multidimensional index structure. Since most conventional indexing techniques for object oriented databases use a one-dimensional index stnlcture such as the B-tree, they do not often handle complex qUlTies involving both nested attributes and class hierarchies. We extend a tunable two dimensional class hierachy indexing technique(2D-CHI) for nested attributes. The 2D-CHI is an indexing scheme that deals with the problem of clustering ohjects in a two dimensional domain space that consists of a kev attribute dOI11'lin and a class idmtifier domain for a simple attribute in a class hierachy. In our extended scheme, we construct indexes using multidimensional file organizations that include one class identifier domain per class hierarchy on a path expression that defines the indexed nested attribute. This scheme efficiently suppoI1s queries that involve search conditions on the nested attribute represcnted by an extcnded path expression. An extended path expression is a one in which a class hierarchy can be substituted by an indivisual class or a subclass hierarchy in the class hierarchy.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.1
• /
• pp.121-127
• /
• 2009

The Multistage Feature-based Classification Model(MFCM) is proposed in this paper. MFCM does not use whole feature vectors extracted from the original data at once to classify each data, but use only groups related to each feature vector to classify separately. In the training stage, the contribution rate calculated from each feature vector group is drew throughout the accuracy of each feature vector group and then, in the testing stage, the final classification result is obtained by applying weights corresponding to the contribution rate of each feature vector group. In this paper, the proposed MFCM algorithm is applied to the problem of music genre classification. The results demonstrate that the proposed MFCM outperforms conventional algorithms by 7% - 13% on average in terms of classification accuracy.

• The Korean Journal of Applied Statistics
• /
• v.21 no.3
• /
• pp.429-439
• /
• 2008

Canonical correlation biplot is 2-dimensional plot for investigating the relationship between two sets of variables and the relationship between observations and variables in canonical correlation analysis graphically. In general, biplot is useful for giving a graphical description of the data. However, this general biplot and also canonical correlation biplot do not give some concise interpretations between variables and observations when the number of observations are large. Recently, for overcoming this problem, Choi and Kim (2008) suggested a method to interpret the biplot analysis by applying the K-means clustering analysis. Therefore, in this study, we will apply their method for investigating the relationship between skill and competition score factors of KLPGA players using canonical correlation biplot and cluster analysis.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.4
• /
• pp.53-60
• /
• 2011

In order to augment the robustness of OFDM system to Rayleigh multipath fading, there exist two smart antenna algorithms, namely, Pre-FFT smart antenna and Post-FFT smart antenna. After the mathematical modeling of both smart antenna algorithms, computer simulations have been carried to compare and analyze the performance of generalized eigen problem based Pre-FFT algorithm and the performance of Wiener solution based Post-FFT algorithm. It has been shown that the Post-FFT smart antenna far outperforms the Pre-FFT smart antenna due to the computational complexities. Especially it is so when the multipath signal arrives at beyond the guard interval and a rich co-channel interferer is introduced. Performance of a subcarrier clustering method proposed to lessen the computing load has been compared to that of a typical Wiener solution based Post-FFT smart antenna. Performance comparison between MRC(Maximum Ratio Combining) diversity based Post-FFT algorithm and typical Post-FFT algorithm has also been carried.

• Composites Research
• /
• v.30 no.1
• /
• pp.65-70
• /
• 2017

Carbon fiber reinforced composites have light weight and high mechanical properties. These materials are only applicable in limited shape structure cause by complex curing process and low drapability. To solve this problem, Long Fiber Prepreg Sheet (LFPS) has been proposed. In this research, electric device cover plate was selected and designed by using LFPS. Before the design process, we analyzed the target structure to which the rib structures were applied. And 8-inch tablet PC product was selected. For FE analysis, simple loading and boundary conditions were applied. Stiffness of rib structure was investigated according to the rib pattern and shape changes. Rib pattern and shape were selected based on fixed volume condition analysis results. And uneven rib width model was selected for the best case whose deflection was reduced 6~10% than uniform rib model.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.1-9
• /
• 2010

Today's growth of the mobile communication infrastructure made mobile computing systems like cellular phones came next to or surpassed the desktop PCs in popularity due to their mobility. Although the performance of mobile devices is now being improved continuously, it is a current common sense that compute intensive large-scale applications can hardly run on any kind of mobile handset devices. To clear up this problem, we decided to exploit the mobile cluster computing system and surveyed the existing ones first. We found out, however, that most of them are not the actual implementations but a mobile cluster infrastructure proposal or idea suggestions for reliable mobile clustering. To make cell phones participated in cluster computing nodes, in this paper, we propose a redesigned JPVM cluster computing engine and a set of WIPI mobile runtime functions interfacing with it. And we also show the performance evaluation results of real parallel applications running on our Mobile-JPVM cluster computing systems. We find out by the performance evaluation that large-scale applications can sufficiently run on mobile devices such as cellular phones when using our mobile cluster computing engine.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.133-142
• /
• 2010

As the ubiquitous technology has penetrated into almost every aspect of modern life, the research of the security technology to solve the weakness of security in the ubiquitous environment is received much attention. Because, however, today's security systems are usually based on the fixed rules, many security systems can not handle diverse situations in the ubiquitous environment appropriately. Although many existing researches on context aware security service are based on ACL (Access Control List) or RBAC (Role Based Access Control), they have an overhead in the management of security policy and can not manipulate unexpected situations. Therefore, in this paper, we propose a context-aware security service providing multiple authentications and authorization from a security level which is decided dynamically in a context-aware environment using FCM (Fuzzy C-Means) clustering algorithm and Fuzzy Decision Tree. We show proposed model can solve typical conflict problems of RBAC system due to the fixed rules and improve overhead problem in the security policy management. We expect to apply the proposed model to the various applications using contextual information of the user such as healthcare system, rescue systems, and so on.