• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.555-576
• /
• 2016

In the conventional clustering algorithms, an object could be assigned to only one group. However, this is sometimes not the case in reality, there are cases where the data do not belong to one group. As against, the fuzzy clustering takes into consideration the degree of fuzzy membership of each pixel relative to different classes. In order to overcome some shortcoming with traditional clustering methods, such as slow convergence and their sensitivity to initialization values, we have used the Harmony Search algorithm. It is based on the population metaheuristic algorithm, imitating the musical improvisation process. The major thrust of this algorithm lies in its ability to integrate the key components of population-based methods and local search-based methods in a simple optimization model. We propose in this paper a new unsupervised clustering method called the Fuzzy Harmony Search-Fourier Transform (FHS-FT). It is based on hybridization fuzzy clustering and the harmony search algorithm to increase its exploitation process and to further improve the generated solution, while the Fourier transform to increase the size of the image's data. The results show that the proposed method is able to provide viable solutions as compared to previous work.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.3
• /
• pp.1221-1226
• /
• 2015

This paper proposes a multiple switch mode power supply (SMPS) system based on the wireless network which controls variable load. The system enables power supply of up to 600W using 200W SMPS as a unit module and provides a controlling function of output power based on variable load and a monitoring function based on wireless network. The controlling function for output power measures the variation of output power and facilitates efficient power supply by controlling output power based on the measured variation value. The monitoring function guarantees a stable power supply by observing the multiple SMPS system in real time via wireless network. The performance of the proposed system was examined by various experiments. In addition, it was verified through standardized test of Korea Testing Certification. The results were given and discussed.

• International Journal of Advanced Culture Technology
• /
• v.10 no.4
• /
• pp.94-101
• /
• 2022

For the purpose of this study, in order to adapt to the era of intelligent informatization in the 4th Industrial Revolution, we propose an information processing and analysis technology education plan that can solve problems through information search and collection. To this end, first, we explored the necessity and content of information processing and analysis technology in hyperconnection, hyperintelligence, and hyperconvergence under the theme of various majors in IT, focusing on understanding information technology in the software and hardware curriculum. Second, the curriculum improvement plan was proposed based on information literacy, computing thinking skills, and cooperative problem-solving skills for efficient software and hardware-linked curriculum operation based on information processing and analysis technology. Third, I would like to emphasize that it is essential to secure connectivity between other studies for future innovation in new technologies related to computer technology, machine technology, and infrastructure technology through hyperconnection, hyperintelligence, and hyperconvergence in the software and hardware curriculum. Through this, we intend to cultivate creative convergence talent required by the future society.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2381-2399
• /
• 2019

Traditional recommendation algorithms on Collaborative Filtering (CF) mainly focus on the rating prediction with explicit ratings, and cannot be applied to the top-N recommendation with implicit feedbacks. To tackle this problem, we propose a new collaborative filtering approach namely Maximize MAP with Matrix Factorization (MFMAP). In addition, in order to solve the problem of non-smoothing loss function in learning to rank (LTR) algorithm based on pairwise, we also propose a smooth MAP measure which can be easily implemented by standard optimization approaches. We perform experiments on three different datasets, and the experimental results show that the performance of MFMAP is significantly better than other recommendation approaches.

• International Journal of Computer Science & Network Security
• /
• v.21 no.11
• /
• pp.89-96
• /
• 2021

This work is an extension of my work presented a robust and economically efficient method for the Discrimination of four Mung-Beans [1] varieties based on quantitative parameters. Due to the advancement of technology, users try to find the solutions to their daily life problems using smartphones but still for computing power and memory. Hence, there is a need to find the best classifier to classify the Mung-Beans using already suggested features in previous work with minimum memory requirements and computational power. To achieve this study's goal, we take the experiments on various supervised classifiers with simple architecture and calculations and give the robust performance on the most relevant 10 suggested features selected by Fisher Co-efficient, Probability of Error, Mutual Information, and wavelet features. After the analysis, we replace the Artificial Neural Network and Deep learning with a classifier that gives approximately the same classification results as the above classifier but is efficient in terms of resources and time complexity. This classifier is easily implemented in the smartphone environment.

• International Journal of Computer Science & Network Security
• /
• v.21 no.7
• /
• pp.119-124
• /
• 2021

Today, both sides of modern culture are decisively invaded by digitalization. Authentication is considered to be one of the main components in keeping this process secure. Cyber criminals are working hard in penetrating through the existing network channels to encounter malicious attacks. When it comes to enterprises, the company's information is a major asset. Question here arises is how to protect the vital information. This takes into account various aspects of a society often termed as hyper connected society including online communication, purchases, regulation of access rights and many more. In this research paper, we will discuss about the concepts of MFA and KBA, i.e., Multi-Factor Authentication and Knowledge Based Authentication. The purpose of MFA and KBA its utilization for human.to.everything..interactions, offering easy to be used and secured validation mechanism while having access to the service. In the research, we will also explore the existing yet evolving factor providers (sensors) used for authenticating a user. This is an important tool to protect data from malicious insiders and outsiders. Access Management main goal is to provide authorized users the right to use a service also preventing access to illegal users. Multiple techniques can be implemented to ensure access management. In this paper, we will discuss various techniques to ensure access management suitable for enterprises, primarily focusing/restricting our discussion to multifactor authentication. We will also highlight the role of knowledge-based authentication in multi factor authentication and how it can make enterprises data more secure from Cyber Attack. Lastly, we will also discuss about the future of MFA and KBA.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.7
• /
• pp.1252-1273
• /
• 2011

In Web Service Composition (WSC) area, services selection aims at selecting an appropriate candidate from a set of functionally-equivalent services to execute the function of each task in an abstract WSC according to their different QoS values. In despite of many related works, few of previous studies consider transactional constraints in QoS-aware WSC, which guarantee reliable execution of Composite Web Service (CWS) that is composed by a number of unpredictable web services. In this paper, we propose a novel global selection-optimal approach in WSC by considering both transactional constraints and end-to-end QoS constraints. With this approach, we firstly identify building rules and the reduction method to build layer-based Directed Acyclic Graph (DAG) model which can model transactional relationships among candidate services. As such, the problem of solving global optimal QoS utility with transactional constraints in WSC can be regarded as a problem of solving single-source shortest path in DAG. After that, we present Graph-building algorithms and an optimal selection algorithm to explain the specific execution procedures. Finally, comprehensive experiments are conducted based on a real-world web service QoS dataset. The experimental results show that our approach has better performance over other competing selection approaches on success ratio and efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3926-3945
• /
• 2018

In Jøsang's trust model, trust evaluation is obtained through operators, but there are problems with the mutuality and asymmetry of trust and the impact of event weight on trust evaluation. Trust evaluation is updated dynamically and continuously with time and the process of interactions, but it has not been reflected in Jøsang's model. Therefore, final trust evaluation is not accurate, and malicious fraud cannot be prevented effectively. This causes the success rate of interaction to be low. To solve these problems, a new dynamic trust model is proposed based on extended subjective logic (DTM-ESL). In DTM-ESL, the event weight and the mutuality of trust are fully considered, the original one-way trust relationship is extended to a two-way trust relationship, discounting and consensus operators are improved, and trust renewal is designed based on event weight. The viability and effectiveness of this new model are verified by simulation experiments.

• ETRI Journal
• /
• v.33 no.3
• /
• pp.344-354
• /
• 2011

In this paper, a model is introduced named double relation chains (DRC) based on ordered sets. It is proved that using DRC and special relationships among the members of an alphabet, vectors of this alphabet can be stored and searched in a tree. This idea is general; however, one special application of DRC is the longest prefix matching (LPM) problem in an IP network. Applying the idea of DRC to the LPM problem makes the prefixes comparable like numbers using a pair of w-bit vectors to store at least one and at most w prefixes, where w is the IP address length. This leads to good compression performance. Based on this, two recently introduced structures called coded prefix trees and scalar prefix trees are shown to be specific applications of DRC. They are implementable on balanced trees which cause the node access complexity for prefix search and update procedures to be O(log n) where n is the number of prefixes. As another advantage, the number of node accesses for these procedures does not depend on w. Additionally, they need fewer number of node accesses compared to recent range-based solutions. These structures are applicable on both IPv4 and IPv6, and can be implemented in software or hardware.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.388-391
• /
• 2003

We've been following research on the obstacle avoidance that is based on fuzzy control. We previously proposed a new method of automatically generating membership functions, which play an important role in improving accuracy of fuzzy control, by using genetic programming (GP). In this paper, we made two improvements to our proposed method, for the purpose of achieving better intelligence in fuzzy robots. First, the mutation rate is made to change dynamically, according to the coupled chaotic system. Secondly, the population partitioning using deme is introduced by parallel processing. The effectiveness of these improvements is demonstrated through several computer simulations.