• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.7
• /
• pp.315-320
• /
• 2017

In this paper, I design a new scheme that is immune to malicious attack based on the weighted voting game. By using stochastic learning, the proposed scheme can revoke the certification of malicious node. Through the revocation process, the proposed scheme can effectively adapt the dynamic Mobile Ad hoc network situation. Simulation results clearly indicate that the developed scheme has better performance than other existing schemes under widely diverse network environments.

• Convergence Security Journal
• /
• v.7 no.2
• /
• pp.39-47
• /
• 2007

The scheduling algorithms to provide quality of service (QoS) in broadband convergence network (BcN) are compared and analysed. The main QoS management methods such as traffic classification, traffic processing in the input queue and weighted queueing are first analysed, and then the major scheduling algorithms of round robin, priority and weighted round robin under recently considering for BcN to supply real time multimedia communications are analysed. The simulation results by NS-2 show that the scheduling algorithm with proper weights for each traffic class outperforms the priority algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.10 no.2
• /
• pp.37-43
• /
• 1984

For the polymatroidal network, which has set-constraints on arcs, solution procedures to get the weighted maximal flows are investigated. These procedures are composed of the transformation of the polymatroidal network flow problem into a polymatroid intersection problem and a polymatroid intersection algorithm. A greedy polymatroid intersection algorithm is presented, and an example problem is solved. The greedy polymatroid intersection algorithm is a variation of Hassin's. According to these procedures, there is no need to convert the primal problem concerned into dual one. This differs from the procedures of Hassin, in which the dual restricted problem is used.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.867-875
• /
• 1998

In this paper we prove that any continuous function on a bounded closed interval of can be approximated by the superposition of a bounded sigmoidal function with a fixed weight. In addition we show that any continuous function over $\mathbb{R}$ which vanishes at infinity can be approximated by the superposition f a bounded sigmoidal function with a weighted norm. Our proof is constructive.

• Smart Media Journal
• /
• v.3 no.1
• /
• pp.9-15
• /
• 2014

In these days, along with the extreme popularity of online social network services, it becomes an important problem understanding the role of social network in the research of message dissemination. Past studies of message dissemination over online social network services mostly consider the coverage of message dissemination and the methods to maximize it. But, these works lack of the consideration of the impact of multi channel social network, which has multiple communication channel with distinct properties of message transfer and various users with distinct channel preferences. In this paper, the new message dissemination model over multi-modal multi-channel social network, the Delay Weighted Independent Cascade Model, is proposed. The proposed model considers various channels including online social network service, email, SMS messaging, phone and mouth-to-mouth and their distinct message transfer properties. In order to consider the various user properties, the different value of probability of forwarding a message and the different preference of communication channel is considered. Moreover, the proposed model considers the distribution of user location and allows to analyze the properties of message dissemination under various scenarios. Based on the proposed model, a message dissemination simulator is generated and the message disseminations on various scenarios are analyzed.

• Journal of the Korean Society for information Management
• /
• v.31 no.3
• /
• pp.153-179
• /
• 2014

This study explores the characteristics of centrality measures for analyzing researchers' impact and structural positions in research collaboration networks. We investigate four binary network centrality measures (degree centrality, closeness centrality, betweenness centrality, and PageRank), and seven existing weighted network centrality measures (triangle betweenness centrality, mean association, weighted PageRank, collaboration h-index, collaboration hs-index, complex degree centrality, and c-index) for research collaboration networks. And we propose SSR, which is a new weighted centrality measure for collaboration networks. Using research collaboration data from three different research domains including architecture, library and information science, and marketing, the above twelve centrality measures are calculated and compared each other. Results indicate that the weighted network centrality measures are needed to consider collaboration strength as well as collaboration range in research collaboration networks. We also recommend that when considering both collaboration strength and range, it is appropriate to apply triangle betweenness centrality and SSR to investigate global centrality and local centrality in collaboration networks.

• Journal of the Korean Society for Library and Information Science
• /
• v.40 no.3
• /
• pp.191-214
• /
• 2006

Recently, some bibliometric researchers tried to use the centrality analysis methods and the centrality measures which are standard tools in social network analysis. However the traditional centrality measures originated from social network analysis could not deal with weighted networks such as co-citation networks. In this study. new centrality measures for analyzing bibliometric networks with link weights are suggested and applied to three real network data, including an author co-citation network, a co-word network, and a website co-link network. The results of centrality analyses in these three cases can be regarded as Promising the usefulness of suggested centrality measures, especially in analyzing the Position and influence of each node in a bibliometric network.

• Journal of the Chungcheong Mathematical Society
• /
• v.34 no.3
• /
• pp.221-234
• /
• 2021

We introduce high-order Hopfield neural networks with Leakage delays. Furthermore, we study the uniqueness and existence of Hopfield artificial neural networks having the weighted pseudo almost periodic forcing terms on finite delay. Our analysis is based on the differential inequality techniques and the Banach contraction mapping principle.

• Korean Journal of Mathematics
• /
• v.30 no.3
• /
• pp.491-502
• /
• 2022

In this paper we investigate some sufficient conditions to guarantee the existence and uniqueness of Stepanov-like weighted pseudo almost periodic solutions of cellular neural networks on Clifford algebra for non-automomous cellular neural networks with multi-proportional delays. Our analysis is based on the differential inequality techniques and the Banach contraction mapping principle.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.2
• /
• pp.101-107
• /
• 2009

In existing wireless ad-hoc networks, how to distribute network resources fairly between many users to optimize data transmission is an important research subject. However, in wireless mesh networks (WMNs), it is one of the research areas to avoid gateway bottleneck more than the fair network resource sharing. It is because WMN traffic are concentrated on the gateway connected to backhaul. To solve this problem, the paper proposes Weighted Fairness Time-sharing Access (WFTA). The proposed WFTA is a priority time scheduling scheme based on Weighted Fair Queuing (WFQ).