• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1599-1610
• /
• 2019

Intelligent services have expanded as Internet of Things (IoT) technology has evolved and new requirements emerge to accommodate various services. One new requirement is transmitting data over long distances with low-power. Researchers have developed low power wide area (LPWA) network technology to satisfy the requirement; this can improve IoT network infrastructure and increase the range of services. However, network coverage expansion causes several problems. The traffic load is concentrated at a specific gateway, which causes network congestion and leads to decreased transmission efficiency. Therefore, the approach proposed in this paper attempts to recognize and then avoid congestion through gateway channel hopping. The LPWA network employs multiple channels, so wireless channel hopping is available in a gateway. Devices that are not delay sensitive wait for the gateway to reappear on their wireless channel; delay sensitive devices change the wireless channel along the hopping gateway. Thus, the traffic load and congestion in each wireless channel can be reduced improving transmission efficiency. The proposed approach's performance is evaluated by computer simulation and verified in terms of transmission efficiency.

• The KIPS Transactions:PartA
• /
• v.14A no.7
• /
• pp.399-408
• /
• 2007

Currently various techniques for efficiently developing sensor network applications are developed. However, these techniques provide the method for developing only single sensor network application easily and rapidly. Since sensor network applications control various sensor nodes based on core components of operating system, the technique to develop applications by defining common functionalities of various applications and selecting variable functionalities according to the work flow of specific application is efficient. Accordingly, this paper presents an experimental study that identifies commonality of sensor network application domain and supports optional development according to the variability of application by applying product line approach to developing sensor network application. Through the experimental study, we describe the characteristics of sensor network application domain compared with general business domain for product line development. Also, we show the effectiveness of the proposed approach by presenting that core assets designed using the proposed variability feature model and VEADL are reused according to the functionalities of each sensor node.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.68-74
• /
• 2001

This paper mentions a centralized approach based on SNMP protocol and distributed approach based on mobile agent in network management s system. And it presents a few Quantitative models for systematically evaluating those two different approaches. To do this, we propose model m that is applicable under a uniform network environment, and compare network execution times of each paradigms based on parameters from s simulation. The model is then refined to take into account non-uniform networks. We show that it can reduce overall network execution times b by determining the best interaction patterns to perfo$\pi$n network management operations from this model. We believe that the model proposed h here should help us to decide appropriate paradigms and interaction patterns for developing network management applications.

• Investigative Magnetic Resonance Imaging
• /
• v.6 no.2
• /
• pp.137-146
• /
• 2002

Purpose : This paper introduces an improved classification approach which adopts a deterministic relaxation method and an agglomerative clustering technique for the classification of MRI using neural network. The proposed approach can solve the problems of convergency to local optima and computational burden caused by a large number of input patterns when a neural network is used for image classification. Materials and methods : Application of Hopfield neural network has been solving various optimization problems. However, major problem of mapping an image classification problem into a neural network is that network is opt to converge to local optima and its convergency toward the global solution with a standard stochastic relaxation spends much time. Therefore, to avoid local solutions and to achieve fast convergency toward a global optimization, we adopt MFA to a Hopfield network during the classification. MFA replaces the stochastic nature of simulated annealing method with a set of deterministic update rules that act on the average value of the variable. By minimizing averages, it is possible to converge to an equilibrium state considerably faster than standard simulated annealing method. Moreover, the proposed agglomerative clustering algorithm which determines the underlying clusters of the image provides initial input values of Hopfield neural network. Results : The proposed approach which uses agglomerative clustering and deterministic relaxation approach resolves the problem of local optimization and achieves fast convergency toward a global optimization when a neural network is used for MRI classification. Conclusion : In this paper, we introduce a new paradigm to classify MRI using clustering analysis and deterministic relaxation for neural network to improve the classification results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1920-1937
• /
• 2015

Network environment has been under constant threat from both malicious attackers and inherent vulnerabilities of network infrastructure. Existence of such threats calls for exhaustive vulnerability analyzing to guarantee a secure system. However, due to the diversity of security hazards, analysts have to select from massive alternative hardening strategies, which is laborious and time-consuming. In this paper, we develop an approach to seek for possible hardening strategies and prioritize them to help security analysts to handle the optimal ones. In particular, we apply a Risk Flow Attack Graph (RFAG) to represent network situation and attack scenarios, and analyze them to measure network risk. We also employ a multi-objective genetic algorithm to infer the priority of hardening strategies automatically. Finally, we present some numerical results to show the performance of prioritizing strategies by network risk and hardening cost and illustrate the application of optimal hardening strategy set in typical cases. Our novel approach provides a promising new direction for network and vulnerability analysis to take proper precautions to reduce network risk.

• Knowledge Management Research
• /
• v.16 no.2
• /
• pp.67-89
• /
• 2015

Improving productivity of knowledge workers is an important issue in the 21st century referred as knowledge-based society. The core key word is knowledge sharing among constituents of an organization. The purpose of this study is to combine the social network position factors with attitude and behavior factors, and develop an integrated research model for the knowledge sharing among members of an organization. This study adopted the integrated theoretical framework based on social capital, self-efficacy, transactive memory, and knowledge sharing. Surveys were conducted to 42 organizational members from a department in a leading IT outsourcing company to empirically test the proposed research model. In order to validate the proposed research model, social network analysis tool, UCINET, a structural equation modeling tool, SmartPLS, were utilized. The empirical result showed that, first of all, organizational members' familiarity network position had significant influence on knowledge self-efficacy and transactive memory capability. Second, knowledge self-efficacy and transactive memory capability affected knowledge sharing intention. Third, knowledge sharing intention also had an impact on the job performance. However, organizational members' expertise network position had no significant influence on knowledge self-efficacy and transactive memory capability. This finding reveals the importance of the emotional approach rather than the rational approach in knowledge management. The theoretical and practical implications on the research findings were discussed along with limitations.

• Smart Structures and Systems
• /
• v.8 no.1
• /
• pp.69-92
• /
• 2011

This paper presents an emergent pattern recognition approach based on the immune network theory and hierarchical clustering algorithms. The immune network allows its components to change and learn patterns by changing the strength of connections between individual components. The presented immune-network-based approach achieves emergent pattern recognition by dynamically generating an internal image for the input data patterns. The members (feature vectors for each data pattern) of the internal image are produced by an immune network model to form a network of antibody memory cells. To classify antibody memory cells to different data patterns, hierarchical clustering algorithms are used to create an antibody memory cell clustering. In addition, evaluation graphs and L method are used to determine the best number of clusters for the antibody memory cell clustering. The presented immune-network-based emergent pattern recognition (INEPR) algorithm can automatically generate an internal image mapping to the input data patterns without the need of specifying the number of patterns in advance. The INEPR algorithm has been tested using a benchmark civil structure. The test results show that the INEPR algorithm is able to recognize new structural damage patterns.

• Interdisciplinary Bio Central
• /
• v.5 no.2
• /
• pp.3.1-3.7
• /
• 2013

Recently, the productivity of drug discovery has gradually decreased as the limitations of single-target-based drugs for various and complex diseases become exposed. To overcome these limitations, drug combinations have been proposed, and great efforts have been made to predict efficacious drug combinations by statistical methods using drug databases. However, previous methods which did not take into account biological networks are insufficient for elaborate predictions. Also, increased evidences to support the fact that drug effects are closely related to metabolic enzymes suggested the possibility for a new approach to the study drug combinations. Therefore, in this paper we suggest a novel approach for analyzing drug combinations using a metabolic network in a systematic manner. The influence of a drug on the metabolic network is described using the distance between the drug target and an enzyme. Target-enzyme distances are converted into influence scores, and from these scores we calculated the correlations between drugs. The result shows that the influence score derived from the targetenzyme distance reflects the mechanism of drug action onto the metabolic network properly. In an analysis of the correlation score distribution, efficacious drug combinations tended to have low correlation scores, and this tendency corresponded to the known properties of the drug combinations. These facts suggest that our approach is useful for prediction drug combinations with an advanced understanding of drug mechanisms.

• Knowledge Management Research
• /
• v.12 no.2
• /
• pp.69-80
• /
• 2011

This paper reports on a structural view of a knowledge network comprised of clubs and organisationsexpressly concerned with cultural activities in a regional Australian city. Social network analysis showed an uneven distribution of power, influence, and prominence in the network. The network structure consisted of two modules of vertices clustered around particular categories of creative arts and these modules were linked most frequently by several organisations acting as communication hubs and boundary spanners. The implications of the findings include 'network weaving' for improving the network structure and developing a systemic approach for exploring the structures of social action that form community-based knowledge networks.

• Journal of Information Processing Systems
• /
• v.1 no.1 s.1
• /
• pp.14-21
• /
• 2005

Even though mainly statistical methods have been used in anomaly network intrusion detection, to detect various attack types, machine learning based anomaly detection was introduced. Machine learning based anomaly detection started from research applying traditional learning algorithms of artificial intelligence to intrusion detection. However, detection rates of these methods are not satisfactory. Especially, high false positive and repeated alarms about the same attack are problems. The main reason for this is that one packet is used as a basic learning unit. Most attacks consist of more than one packet. In addition, an attack does not lead to a consecutive packet stream. Therefore, with grouping of related packets, a new approach of group-based learning and detection is needed. This type of approach is similar to that of multiple-instance problems in the artificial intelligence community, which cannot clearly classify one instance, but classification of a group is possible. We suggest group generation algorithm grouping related packets, and a learning algorithm based on a unit of such group. To verify the usefulness of the suggested algorithm, 1998 DARPA data was used and the results show that our approach is quite useful.