• The Journal of Bigdata
• /
• v.3 no.1
• /
• pp.73-82
• /
• 2018

At the core of future medicine is the realization of Precision Medicine centered on individuals. For this, we need to have an open ecosystem that can view, manage and distribute healthcare data anytime, anywhere. However, since healthcare data deals with sensitive personal information, a significant level of reliability and security are required at the same time. In order to solve this problem, the healthcare industry is paying attention to the blockchain technology. Unlike the existing information communication infrastructure, which stores and manages transaction information in a central server, the block chain technology is a distributed operating network in which a data is distributed and managed by all users participating in the network. In this study, we not only discuss the technical and legal aspects necessary for demonstration of healthcare data distribution using blockchain technology but also introduce KOREN SDI Network-based Healthcare Big Data Distribution Demonstration Study. In addition, we discuss policy strategies for activating blockchain technology in healthcare.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.6
• /
• pp.1872-1879
• /
• 2016

The techniques to recycle and reuse plastics attract public attention. These public attraction and needs result in improving the recycling technique. However, the identification technique for black plastic wastes still have big problem that the spectrum extracted from near infrared radiation spectroscopy is not clear and is contaminated by noise. To overcome this problem, we apply Raman spectroscopy to extract a clear spectrum of plastic material. In addition, to improve the classification ability of fuzzy Radial Basis Function Neural Networks, we apply supervised learning based clustering method instead of unsupervised clustering method. The conditional fuzzy C-Means clustering method, which is a kind of supervised learning based clustering algorithms, is used to determine the location of radial basis functions. The conditional fuzzy C-Means clustering analyzes the data distribution over input space under the supervision of auxiliary information. The auxiliary information is defined by using k Nearest Neighbor approach.

• Proceedings of the KSME Conference
• /
• 2003.04a
• /
• pp.810-815
• /
• 2003

This research is concerned with the development of an Internet-based robot system, which is insensitive to the unpredictable Internet time delay. For that purpose, a simple mobile robot system that moves in response to the user' direct control on the Internet has been built. The time delay in data transmission is a big problem for the construction of this kind of system. Therefore, the PPS (Position Prediction Simulator) is suggested and implemented to compensate for the time delay problem of the Internet. The simulation and experimental result show that the distance error can be reduced using the developed PPS.

• Journal of Korea Multimedia Society
• /
• v.18 no.3
• /
• pp.330-338
• /
• 2015

Gradually increasing the value of the technology, the techniques of the various security systems to protect the core technology have been developed. The proposed security scheme, which uses both a Password and the various devices, is always open by malicious user. In order to solve that problem, the biometric authentication systems are introduced but they have a problem which is the secondary damage to the user. So, the authentication methods using EEG(Electroencephalography) signals were developed. However, the size of EEG signals is big and it cause a lot of problems for the real-time authentication. And the encryption method is necessary. In this paper, we proposed an efficient real-time authentication system applied encryption scheme with junk data using chaos map on the EEG signals.

• Journal of information and communication convergence engineering
• /
• v.19 no.3
• /
• pp.155-160
• /
• 2021

Differential evolution is an efficient algorithm for solving continuous optimization problems. However, its performance deteriorates rapidly, and the runtime increases exponentially when differential evolution is applied for solving large-scale optimization problems. Hence, a novel cooperative coevolution differential evolution based on Spark (known as SparkDECC) is proposed. The divide-and-conquer strategy is used in SparkDECC. First, the large-scale problem is decomposed into several low-dimensional subproblems using the random grouping strategy. Subsequently, each subproblem can be addressed in a parallel manner by exploiting the parallel computation capability of the resilient distributed datasets model in Spark. Finally, the optimal solution of the entire problem is obtained using the cooperation mechanism. The experimental results on 13 high-benchmark functions show that the new algorithm performs well in terms of speedup and scalability. The effectiveness and applicability of the proposed algorithm are verified.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3493-3506
• /
• 2022

In the field of scene segmentation, the precise segmentation of object boundaries in sports movement scene images is a great challenge. The geometric information and spatial information of the image are very important, but in many models, they are usually easy to be lost, which has a big influence on the performance of the model. To alleviate this problem, a parallel dense dilated convolution merging Network (termed PDDCM-Net) was proposed. The proposed PDDCMNet consists of a feature extractor, parallel dilated convolutions, and dense dilated convolutions merged with different dilation rates. We utilize different combinations of dilated convolutions that expand the receptive field of the model with fewer parameters than other advanced methods. Importantly, PDDCM-Net fuses both low-level and high-level information, in effect alleviating the problem of accurately segmenting the edge of the object and positioning the object position accurately. Experimental results validate that the proposed PDDCM-Net achieves a great improvement compared to several representative models on the COCO-Stuff data set.

• International Journal of Computer Science & Network Security
• /
• v.24 no.4
• /
• pp.192-196
• /
• 2024

The memory coherence problem occurs while mapping shared virtual memory in a loosely coupled multiprocessors setup. Memory is considered coherent if a read operation provides same data written in the last write operation. The problem is addressed in the literature using different algorithms. The big question is on the correctness of such a distributed algorithm. Formal verification is the principal term for a group of techniques that routinely use an analysis that is established on mathematical transformations to conclude the rightness of hardware or software behavior in divergence to dynamic verification techniques. This paper uses UPPAAL model checker to model the dynamic distributed algorithm for shared virtual memory given by K.Li and P.Hudak. We analyse the mechanism to keep the coherence of memory in every read and write operation by using a dynamic distributed algorithm. Our results show that the dynamic distributed algorithm for shared virtual memory partially fulfils its functional requirements.

• Korean Journal of Social Welfare
• /
• v.42
• /
• pp.372-396
• /
• 2000

This study focuses on high school students and aims not only to examine the relationships among problem drinking measures and drinking motives to cope but also to determine the factors to predict the negative consequences related to alcohol. 1,436 self-reported questionnaires were collected from seven big cities' high school students who had ever experienced drinking. The survey data identified the following results; first, there were statistically significant differences in drinking motives to cope and 4 measures of problem drinking depending on gender and the school type. It should be noted that more girls and more students in vocational schools had experienced drunkenness rather than boys and students in academic schools unlike alcohol consumption, binge drinking, and negative consequences related to alcohol. Second, the use of alcohol to cope may place individuals at greater risk for alcohol problems. Four dimensions of problem drinking are moderately correlated to drinking motives to cope. Third, the result from logistic regressions indicated that factors related to drinking (binge drinking, drunkenness, and drinking reasons to cope) rather than demographic factors would be contributed more to one more as well as two more negative consequences. Especially, drunkeness seems to be the best factor to predict negative consequences related to alcohol. Implications for developing prevention programs are suggested.

• Journal of Korea Multimedia Society
• /
• v.18 no.4
• /
• pp.524-532
• /
• 2015

All data created in BigData times is included potentially meaning and correlation in data. A variety of data during a day in all society sectors has become created and stored. Research areas in analysis and grasp meaning between data is proceeding briskly. Especially, accuracy of meaning prediction and data imbalance problem between data for analysis is part in course of something important in data analysis field. In this paper, we proposed data prediction model based on data weights and neural network using R for meaning analysis between data. Proposed data prediction model is composed of classification model and analysis model. Classification model is working as weights application of normal distribution and optimum independent variable selection of multiple regression analysis. Analysis model role is increased prediction accuracy of output variable through neural network. Performance evaluation result, we were confirmed superiority of prediction model so that performance of result prediction through primitive data was measured 87.475% by proposed data prediction model.

• Journal of Intelligence and Information Systems
• /
• v.29 no.3
• /
• pp.167-183
• /
• 2023

In the recent field of recommendation systems, various studies have been conducted to model sparse data effectively. Among these, GLocal-K(Global and Local Kernels for Recommender Systems) is a research endeavor combining global and local kernels to provide personalized recommendations by considering global data patterns and individual user characteristics. However, due to its utilization of kernel tricks, GLocal-K exhibits diminished performance on highly sparse data and struggles to offer recommendations for new users or items due to the absence of side information. In this paper, to address these limitations of GLocal-K, we propose the GEase-K (Global and EASE kernels for Recommender Systems) model, incorporating the EASE(Embarrassingly Shallow Autoencoders for Sparse Data) model and leveraging side information. Initially, we substitute EASE for the local kernel in GLocal-K to enhance recommendation performance on highly sparse data. EASE, functioning as a simple linear operational structure, is an autoencoder that performs highly on extremely sparse data through regularization and learning item similarity. Additionally, we utilize side information to alleviate the cold-start problem. We enhance the understanding of user-item similarities by employing a conditional autoencoder structure during the training process to incorporate side information. In conclusion, GEase-K demonstrates resilience in highly sparse data and cold-start situations by combining linear and nonlinear structures and utilizing side information. Experimental results show that GEase-K outperforms GLocal-K based on the RMSE and MAE metrics on the highly sparse GoodReads and ModCloth datasets. Furthermore, in cold-start experiments divided into four groups using the GoodReads and ModCloth datasets, GEase-K denotes superior performance compared to GLocal-K.