• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.6
• /
• pp.777-784
• /
• 2006

This paper proposes a c-fuzzy model tree using partial least square method to predict the Chlorophyll-a concentration in each zone. First, cluster centers are calculated by fuzzy clustering method using all input and output attributes. And then, each internal node is produced according to fuzzy membership values between centers and input attributes. Linear models are constructed by partial least square method considering input-output pairs remained in each internal node. The expansion of internal node is determined by comparing errors calculated in parent node with ones in child node, respectively. On the other hands, prediction is performed with a linear model haying the highest fuzzy membership value between input attributes and cluster centers in leaf nodes. To show the effectiveness of the proposed method, we have applied our method to water quality data set measured at several stations. Under various experiments, our proposed method shows better performance than conventional least square based model tree method.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.3
• /
• pp.163-169
• /
• 2016

To establish the equitable distribution of total energy load, a representative cluster based routing protocol LEACH selects cluster heads randomly in accordance with the pre-determined probability every round. But because the current energy level of sensor nodes is not considered, if a sensor node which has little residual energy is elected as a cluster head, it can not live to fulfil the role of cluster head which has big energy load. As a result, the first time of death of a node is quickened and the service quality of WSN gets worse. In this regard we propose a new routing method that, by considering the current energy of a cluster head and the distance between cluster heads and a base station, selects the sub cluster head for saving the energy of a cluster head. Simulation results show that the first time of death of a node prolongs, more data arrive at the base station and the service quality of WSN improves.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.4
• /
• pp.1317-1341
• /
• 2021

Nowadays, the Internet of Things (IoT) is adopted to enable effective and smooth communication among different networks. In some specific application, the Wireless Sensor Networks (WSN) are used in IoT to gather peculiar data without the interaction of human. The WSNs are self-organizing in nature, so it mostly prefer multi-hop data forwarding. Thus to achieve better communication, a cross-layer routing strategy is preferred. In the cross-layer routing strategy, the routing processed through three layers such as transport, data link, and physical layer. Even though effective communication achieved via a cross-layer routing strategy, energy is another constraint in WSN assisted IoT. Cluster-based communication is one of the most used strategies for effectively preserving energy in WSN routing. This paper proposes a Bio-inspired cross-layer routing (BiHCLR) protocol to achieve effective and energy preserving routing in WSN assisted IoT. Initially, the deployed sensor nodes are arranged in the form of a grid as per the grid-based routing strategy. Then to enable energy preservation in BiHCLR, the fuzzy logic approach is executed to select the Cluster Head (CH) for every cell of the grid. Then a hybrid bio-inspired algorithm is used to select the routing path. The hybrid algorithm combines moth search and Salp Swarm optimization techniques. The performance of the proposed BiHCLR is evaluated based on the Quality of Service (QoS) analysis in terms of Packet loss, error bit rate, transmission delay, lifetime of network, buffer occupancy and throughput. Then these performances are validated based on comparison with conventional routing strategies like Fuzzy-rule-based Energy Efficient Clustering and Immune-Inspired Routing (FEEC-IIR), Neuro-Fuzzy- Emperor Penguin Optimization (NF-EPO), Fuzzy Reinforcement Learning-based Data Gathering (FRLDG) and Hierarchical Energy Efficient Data gathering (HEED). Ultimately the performance of the proposed BiHCLR outperforms all other conventional techniques.

• The Journal of the Convergence on Culture Technology
• /
• v.8 no.6
• /
• pp.787-793
• /
• 2022

After COVID-19, with the emergence of social distancing, non-face-to-face services, and home economics, visiting dining out is rapidly being replaced by non-face-to-face dining out. The purpose of this study is to find ways to create a safe dining culture centered on living quarantine in line with the changing trend of the restaurant industry after the outbreak of COVID-19, establish the direction of food culture improvement projects, and enhance the effectiveness of the project. This study used TEXTOM to collect and refine search frequency, perform TF-IDF analysis, and Ucinet6 programs to implement visualization using NetDraw from January 1, 2018 to October 31, 2019 and December 31, 2021, and identified the network between nodes of key keywords. Finally, clustering between them was performed through Concor analysis. As a result of the study, if you check the frequency of searches before and after COVID-19, it can be seen that the COVID-19 pandemic greatly affects the changes in the restaurant industry.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.35 no.6
• /
• pp.343-349
• /
• 2022

This paper proposes a new topology optimization scheme to determine optimized joints for multi-component models. The joints are modeled as zero-length high-stiffness spring elements. The spring joints are considered as mesh-independent springs based on a joint-element interpolation scheme. This enables the changing of the location of the joints regardless of the connected nodes during optimization. Because the joints are movable, the locations of the optimized joints should be aggregated at several points. In this paper, the novel joint dispersal (JD) constraint to prevent joint clustering is proposed. With the joint dispersal constraint, it is possible to determine the optimized joint location as well as optimized topologies while maintaining the minimum distance between each joint. The mechanical compliance value is considered as the objective function. Several topology optimization examples are solved to demonstrate the effect of the joint dispersal constraint.

• The Journal of Korean Academic Society of Nursing Education
• /
• v.30 no.2
• /
• pp.182-191
• /
• 2024

Purpose: The purpose of this study was to explore the characteristics of social networks among registered nurses in acute nursing care units. Methods: This study used a survey design. Four nursing units from two acute hospitals were selected using a convenience method, and 83 nurses from those nursing units participated in the study in July 2022. The positive influences among nurses included friendship, collaboration, advice, and referent networks, and the negative influences included avoidance and bullying networks. Using the NetMiner program, the k-means clustering technique was applied to create groups of nodes with similar characteristics. The general characteristics of the participants were analyzed by mean, standard deviation, frequency, and ANOVA or chi-squared test. Results: As a result of dividing the 83 nurse participants into four clusters, positive influencers, silent peers, unwelcome peers, and active bullies were identified. Positive influence group nurses were frequently mentioned in the friendship, collaboration, advice, and referent networks. On the other hand, nurses in the unwelcome group and the active bullying group were frequently mentioned in the avoidance and bullying networks. Conclusion: Social networks that have a positive or negative impact on nursing performance are created through different relationships between nurses. Nurse managers can use the findings to create a more supportive and collaborative environment. Further research is needed to develop intervention programs to improve interactions and relationships between fellow nurses.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.271-281
• /
• 2006

Recently the need for Location-Based Service (LBS) has increased due to the development and widespread use of the mobile devices (e.g., PDAs, cellular phones, labtop computers, GPS, and RFID etc). The core technology of LBS is a moving-objects database that stores and manages the positions of moving objects. To search for information quickly, the database needs to contain an index that supports both real-time position tracking and management of large numbers of updates. As a result, the index requires a structure operating in the main memory for real-time processing and requires a technique to migrate part of the index from the main memory to disk storage (or from disk storage to the main memory) to manage large volumes of data. To satisfy these requirements, this paper suggests a unified index scheme unifying the main memory and the disk as well as migration policies for migrating part of the index from the memory to the disk during a restriction in memory space. Migration policy determines a group of nodes, called the migration subtree, and migrates the group as a unit to reduce disk I/O. This method takes advantage of bulk operations and dynamic clustering. The unified index is created by applying various migration policies. This paper measures and compares the performance of the migration policies using experimental evaluation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.87-93
• /
• 2009

Wireless mesh networks (WMNs) are emerging technologies that provide ubiquitous environments and wireless broadband access. The aggregate capacity of WMNs can be improved by minimizing the effect of channel interference. The IEEE 802.11b/g standard which is mainly used for the network interface technology in WMNs provides 3 multiple channels. We must consider the channel scanning delay and the channel dependency problem to effectively assign channels in like these multi-channel WMNs. This paper proposes a cluster-based channel assignment (CB-CA) algorithm for multi-channel WMNs to solve such problems. The CB-CA does not perform the channel scanning and the channel switching through assigning co-channel to the inter-cluster head (CH) links. In the CB-CA, the communication between the CH and cluster member (CM) nodes uses a channel has no effect on channels being used by the inter-CH links. Therefore, the CB-CA can minimize the interference within multi-channel environments. Our simulation results show that CB-CA can improve the performance of WMNs.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.2
• /
• pp.335-346
• /
• 2015

The purpose of this study is to compare not only network influence of individual coauthor but also the types and properties of two coauthor networks of Communications for Statistical Applications and Methods and the Korean Journal of Applied Statistics which are published by the Korean Statistical Society using social network analysis.As the result of two network structure comparison, density, inclusiveness, reciprocity and clustering coefficient which represent the type of coauthor networks show almost similar values and the Korean Journal of Applied Statistics has bigger values in average degree, average distance and diameter because it has more nodes than Communications for Statistical Applications and Methods. Finally two journals have very similar type of coauthor network. In the comparison of network centrality of two coauthor networks, closeness centrality and betweenness centrality of the Korean Journal of Applied Statistics are bigger than those of Communications for Statistical Applications and Methods at the statistical significance level 0.05. The coauthor network of the Korean Journal of Applied Statistics has faster information delivery and stronger betweenness than that of Communications for Statistical Applications.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.355-364
• /
• 2004

These days, various clustering technologies have been adopted to construct web sites. High performance hardware switches have good performance, but have disadvantage of high cost for constructing small and middle-sized web sites. Now a days, many sites have been constructed with the LVS (Linux Virtual Server), which is free of charge and has good performance. Having a centralized load balancing with one front-end, the LVS causes a bottleneck when it receives all at once. In the paper, we suggest a way to remove the LVS bottleneck by providing multiple front-ends. In this architecture, all of cluster nodes act as both a front-end and a back-end. When the load of a node receiving requests is not large enough, the node responds to the client directly. When the load of a node is large enough, the node send the request to a node which is selected by a scheduling algorithm. The scheduling algorithm is discussed to balance loads between servers. While single front-end cluster raises the throughput curvedly, the multiple front-end cluster raises the throughput linearly.