• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1624-1647
• /
• 2020

Vehicular network is one of the most important subjects for researchers in recent years. Anycast routing protocols have many applications in vehicular ad hoc networks. The aim of an anycast protocol is sending packets to at least one of the receivers among candidate receivers. Studies done on anycast protocols over vehicular networks, however, have capability of implementation on some applications; they are partial, and application specific. No need to say that the lack of a comprehensive study, having a strong analytical background, is felt. Mathematical modeling in vehicular networks is difficult because the topology of these networks is dynamic. In this paper, it has been demonstrated that vehicular networks can be modeled based on time-expanded networks. The focus of this article is on geographical anycast. Three different scenarios were proposed including sending geographic anycast packet to exactly-one-destination, to at-least-one-destination, and to K-anycast destination, which can cover important applications of geographical anycast routing protocols. As the proposed model is of MILP type, a decentralized heuristic algorithm was presented. The evaluation process of this study includes the production of numerical results by Branch and Bound algorithm in general algebraic modeling system (GAMS) software and simulation of the proposed protocol in OMNET++ simulator. The comprehension of the result of proposed protocol and model shows that the applicability of this proposed protocol and its reactive conformity with the presented models based on presented metrics.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.5
• /
• pp.209-216
• /
• 2013

In traditional social network analysis, the betweenness centrality measure has been heavily used to identify the relative importance of nodes in terms of message delivery. Since the time complexity to calculate the betweenness centrality is very high, however, it is difficult to get it of each node in large-scale social network where there are so many nodes and edges. In this paper, we define a new type of network, called the expanded ego network, which is built only with each node's local information, i.e., neighbor information of the node's neighbor nodes, and also define a new measure, called the expended ego betweenness centrality. Through the intensive experiment with Barab$\acute{a}$si-Albert network model to generate the scale-free networks which most social networks have as their embedded feature, we also show that the nodes' importance rank based on the expanded ego betweenness centrality has high similarity with that based on the traditional betweenness centrality.

• Journal of Information Technology Services
• /
• v.19 no.1
• /
• pp.1-16
• /
• 2020

Suncheon City Regeneration Project is known as the concept of cultural residents. Through the previous projects, the residents' capabilities have been improved, and the projects have been carried out according to their strategies. For this reason, participants in urban regeneration projects are important. The purpose of this study is to actually identify the 'rescue center' and 'direct relationship' with the analysis utilizing the characteristics of social networks NetMiner solution of the participants, who led the project, Suncheon. Surveys and interviews were conducted for participants, and the characteristics of social networks were analyzed in time series to quantify and visualize the results. As a result of the analysis, social networks were changed among the participants before and after the urban regeneration project. Initially, loose networks were denser over time, and initially networks formed only around participants were expanded over time. Network analysis has revealed that the system is strengthening with urban regeneration projects in the form of public and public-private cooperation. This highlights the need for a city-centered urban regeneration strategy centered on people and shows that a dense network of participants can be a success factor.

• Transactions of the Korean hydrogen and new energy society
• /
• v.33 no.4
• /
• pp.318-329
• /
• 2022

This study analyzed keyword networks and Author's Affiliation networks of hydrogen-related papers published in Korea Citation Index (KCI) journals from 2016 to 2020. The study investigated co-occurrence patterns of institutions over time to examine collaboration trends of hydrogen scholars. The study also conducted frequency analysis of keyword networks to identify key topics and visualized keyword networks to explore topic trends. The result showed Collaborative research between institutions has not yet been extensively expanded. However, collaboration trends were much more pronounced with local universities. Keyword network analysis exhibited continuing diversification of topics in hydrogen research of Korea. In addition centrality analysis found hydrogen research mostly deals with multi-disciplinary and complex aspects like hydrogen production, transportation, and public policy.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.12
• /
• pp.1113-1119
• /
• 2000

To operate a process plant safely and economically, process monitoring is very important. Process monitoring is the task to identify the state of the system from sensor data. Process monitoring includes data acquisition, regulatory control, data reconciliation, fault detection, etc. This research focuses on the data recon-ciliation using scale-space filtering and fault detection using functional-link associative neural networks. Scale-space filtering is a multi-resolution signal analysis method. Scale-space filtering can extract highest frequency factors(noise) effectively. But scale-space filtering has too large calculation costs and end effect problems. This research reduces the calculation cost of scale-space filtering by applying the minimum limit to the gaussian kernel. And the end-effect that occurs at the end of the signal of the scale-space filtering is overcome by using extrapolation related with the clustering change detection method. Nonlinear principal component analysis methods using neural network have been reviewed and the separately expanded functional-link associative neural network is proposed for chemical process monitoring. The separately expanded functional-link associative neural network has better learning capabilities, generalization abilities and short learning time than the exiting-neural networks. Separately expanded functional-link associative neural network can express a statistical model similar to real process by expanding the input data separately. Combining the proposed methods-modified scale-space filtering and fault detection method using the separately expanded functional-link associative neural network-a process monitoring system is proposed in this research. the usefulness of the proposed method is proven by its application a boiler water supply unit.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1390-1411
• /
• 2024

Underwater Wireless Sensors Networks (UWSNs) are deployed in remotely monitored environment such as water level monitoring, ocean current identification, oil detection, habitat monitoring and numerous military applications. Providing scalable and efficient routing is very challenging in UWSNs due to the harsh underwater environment. The biggest difficulties are the nodes inherent movement due to water current, long delay in data transmission, low bandwidth of the acoustic signal, high error rate and energy scarcity in battery powered nodes. Many routing protocols have been proposed to solve the aforementioned problems. There are three broad categories of routing protocols namely depth based, energy based and vector-based routing. Vector Based Forwarding protocols perform routing through virtual pipeline by defining their radius which give proper direction to packets communication. We proposed a routing protocol termed as Path-Oriented Energy Scaled Expanded Vector Based Forwarding (PESEVBF). PESEVBF takes into account all parameters; holding time, the source nodes packets routing path and void holes creation on the second hop; PESEVBF not only considers the packet upward advancement but also focus on density of the forwarded nodes in terms of number of potential forwarding and suppressed nodes for path selection. Node selection in resultant holding time is based on minimum Path Factor (PF) value. Moreover, the suppressed node will be selected for packet forwarding to avoid the void holes occurrences on the second hop. Performance of PESEVBF is compared with other routing protocols using matrices such as energy consumption, packet delivery ratio, packets dropping ratio and duplicate packets creation indicating considerable performance improvement.

• International Journal of Advanced Culture Technology
• /
• v.8 no.3
• /
• pp.325-333
• /
• 2020

In the past, eating outside was usually the purpose of eating. However, it has recently expanded into a restaurant culture market. In particular, a dessert culture is being established where people can talk and enjoy. Each consumer has a different tendency to buy chocolate such as health, taste, and atmosphere. Therefore, it is time to recommend chocolate according to consumers' tendency to eat out. In this paper, we propose a chocolate recommendation application based on the tendency to eat out using data on social networks. To collect keyword-based chocolate information, Textom is used as a text mining big data analysis solution.Text mining analysis and related topics are extracted and modeled. Because to shorten the time to recommend chocolate to users. In addition, research on the propensity of eating out is based on prior research. Finally, it implements hybrid app base.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.7
• /
• pp.1322-1331
• /
• 1992

The conventional neural networks are built without considering the underlying structure of the problems. Hence, they usually contain redundant weights and require excessive training time. A novel neural network structure is proposed for symmetric problems, which alleviate some of the aforementioned drawback of the conventional neural networks. This concept is expanded to that of the constrained neural network which may be applied to general structured problems. Because these neural networks can not be trained by the conventional training algorithm, which destroys the weight structure of the neural networks, a proper training algorithm is suggested. The illustrative examples are shown to demonstrate the applicability of the proposed idea.

• Earthquakes and Structures
• /
• v.26 no.2
• /
• pp.87-96
• /
• 2024

This paper proposes a logistic multinomial regression approach to model the spatial cross-correlation of damage probabilities among different damage states in an expanded transportation network. Utilizing Bayesian theory and the multinomial logistic model, we analyze the damage states and probabilities of bridges while incorporating damage correlation. This correlation is considered both between bridges in a network and within each bridge's damage states. The correlation model of damage probabilities is applied to the seismic assessment of a portion of Tehran's transportation network, encompassing 26 bridges. Additionally, we introduce extra daily traffic time (EDTT) as an operational parameter of the transportation network and employ the shortest path algorithm to determine the path between two nodes. Our results demonstrate that incorporating the correlation of damage probabilities reduces the travel time of the selected network. The average decrease in travel time for the correlated case compared to the uncorrelated case, using two selected EDTT models, is 53% and 71%, respectively.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.1
• /
• pp.37-44
• /
• 2015

In traditional social network analysis, the betweenness centrality measure has been heavily used to identify the relative importance of nodes. Since the time complexity to calculate the betweenness centrality is very high, however, it is difficult to get it of each node in large-scale social network where there are so many nodes and edges. In our past study, we defined a new type of network, called the expanded ego network, which is built only with each node's local information, i.e., neighbor information of the node's neighbor nodes, and also defined a new measure, called the expanded ego betweenness centrality. In this paper, We propose algorithm that quickly computes expanded ego betweenness centrality by exploiting structural properties of expanded ego network. Through the experiment with virtual network used Barab$\acute{a}$si-Albert network model to represent the generic social network and facebook network to represent actual social network, We show that the node's importance rank based on the expanded ego betweenness centrality has high similarity with that the node's importance rank based on the existing betweenness centrality. We also show that the proposed algorithm computes the expanded ego betweenness centrality quickly than existing algorithm.