• The Journal of the Korea Contents Association
• /
• v.19 no.3
• /
• pp.539-547
• /
• 2019

This study investigated the effect of small-world structure in team processes on team performance. I discussed the theoretical relationship between small-world structure in team processes and team performance and analyzed the relationship using pass data of soccer teams. I constructed the 128 pass networks from the pass data of the 2014 FIFA World Cup and then measured the structural features indicating small-world structure of the networks. Correlation analysis and regression analysis were performed in order to examine the strength and direction of the relationship. According to the results, the clustering has an exponential relationship with team performance and the connectivity has a log-function relationship with team performance. Finally, I found the positive effect of small-world structure in team processes on team performance. Through theoretical discussion and empirical analysis, this study found that small-world structure in team processes increase team performance by facilitating task coordination and collaboration between team members.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.7
• /
• pp.754-764
• /
• 2016

To understand and analyze SNS(Social Network Service) two important classes of networks, small-world and scale-free networks have gained a lot of research interests. In this study, a generalized network generation method is developed, which can produce small-world network, scale-free network, or network with the properties of both small-world and scale-free by controlling two input parameters. By tuning one parameter we can represent the small-world property and by tuning the other one we can represent both scale-free and small-world properties. For the network measures to represent small-world and scale-free properties clustering coefficient, average shortest path distance and power-law property are used. Using the model proposed in this study we can have more clear understanding about relationships between small-world network and scale-free network. Using numerical examples we have verified the effects of two parameters on clustering coefficient, average shortest path distance and power-law property. Through this investigation it can be shown that small-world network, scale-free network or both can be generated by tuning two input parameters properly.

• The Korean Journal of Applied Statistics
• /
• v.24 no.2
• /
• pp.401-409
• /
• 2011

From a social network of n nodes connected by l lines, one may produce centrality measures such as closeness, betweenness and so on. In the past, the magnitude of n was around 1,000 or 10,000 at most. Nowadays, some networks have 10,000, 100,000 or even more than that. Thus, the scalability issue needs the attention of researchers. In this short paper, we explore random networks of the size around n = 100,000 by Monte-Carlo method and propose Monte-Carlo algorithms of computing closeness and betweenness centrality measures to study the small world properties of social networks.

• Communications for Statistical Applications and Methods
• /
• v.18 no.5
• /
• pp.595-601
• /
• 2011

A community of the social network refers to the subset of nodes linked more densely among them than to others. In this study, we propose a Monte-Carlo method for generating random social unipartite and bipartite networks with two or more communities. Proposed random networks can be used to verify the small world phenomenon of the social networks with several communities.

• Journal of KIISE:Software and Applications
• /
• v.34 no.11
• /
• pp.971-983
• /
• 2007

Cellular Genetic Algorithms(CGAs) are a subclass of Genetic Algorithms(GAs) in which each individuals are placed in a given geographical distribution. In general, CGAs# population space is a regular network that has relatively long characteristic path length and high clustering coefficient in the view of the Networks Theory. Long average path length makes the genetic interaction of remote nodes slow. If we have the population#s path length shorter with keeping the high clustering coefficient value, CGAs# population space will converge faster without loss of diversity. In this paper, we propose Smallest-Small-World Cellular Genetic Algorithms(SSWCGAs). In SSWCGAs, each individual lives in a population space that is highly clustered but having shorter characteristic path length, so that the SSWCGAs promote exploration of the search space with no loss of exploitation tendency that comes from being clustered. Some experiments along with four real variable functions and two GA-hard problems show that the SSWCGAs are more effective than SGAs and CGAs.

• World Technopolis Review
• /
• v.4 no.2
• /
• pp.87-103
• /
• 2015

This paper aims to explore how firms develop and grow in regional clusters based in a developing country. The argument is that start-ups / small and large firms are able to grow by developing linkages or networks for resources within clusters - and this tenet is based on studies of firms that are based from such clusters as Silicon Valley in the US, Cambridge in UK and other clusters from which have evolved over long periods of time. Most of the time we hear narratives from the developed world where there are brownfield cluster development efforts. In developing countries governments are making efforts to develop clusters from scratch - which in this paper we term as greenfield cluster versus a brownfield development, which is where the cluster is developed based on existing and new organisations in a region. In this paper, we believe the context of clusters can be important in determining the way firms develop linkages for their growth - and we look at two contexts in Malaysia ie. A greenfield cluster and a brownfield cluster. The paper presents findings from case studies of firms in a greenfield cluster (Cyberjaya) and a brown field cluster (Penang) in Malaysia. The cases reveal fairly different approaches to development of linkages or networks, which we hope will provides insights to cluster development officials and policy makers and implications to researchers for developing studies of clusters and innovation systems.

• Journal of the Korean Physical Society
• /
• v.73 no.12
• /
• pp.1889-1894
• /
• 2018

An innovative small-scale piezoelectric energy harvester has been proposed to gather wind energy. A conventional horizontal-axis wind power generation has a low generating efficiency at low wind speed. To overcome this weakness, we designed a piezoelectric windmill optimized at low-speed wind. A piezoelectric device having high energy conversion efficiency is used in a small windmill. The maximum output power of the windmill was about 3.14 mW when wind speed was 1.94 m/s. Finally, the output power and the efficiency of the system were compared with a conventional wind power system. This work will be beneficial for the piezoelectric energy harvesting technology to be applied to the real world such as wireless sensor networks (WSN).

• International Journal of Computer Science & Network Security
• /
• v.24 no.8
• /
• pp.72-84
• /
• 2024

Plant leaf classification is an imperative task when their use in real world is considered either for medicinal purposes or in agricultural sector. Accurate identification of plants is, therefore, quite important, since there are numerous poisonous plants which if by mistake consumed or used by humans can prove fatal to their lives. Furthermore, in agriculture, detection of certain kinds of weeds can prove to be quite significant for saving crops against such unwanted plants. In general, Artificial Neural Networks (ANN) are a suitable candidate for classification of images when small datasets are available. However, these suffer from local minima problems which can be effectively resolved using some global optimization techniques. Considering this issue, the present research paper presents an automated plant leaf classification system using optimized soft computing models in which ANNs are optimized using Grasshopper Optimization algorithm (GOA). In addition, the proposed model outperformed the state-of-the-art techniques when compared with simple ANN and particle swarm optimization based ANN. Results show that proposed GOA-ANN based plant leaf classification system is a promising technique for small image datasets.

• Smart Structures and Systems
• /
• v.19 no.4
• /
• pp.383-391
• /
• 2017

In this paper, we investigate the impacts of network topology on the performance of a distributed estimation algorithm, namely combine-then-adaptive (CTA) diffusion LMS, based on the data with or without the assumptions of temporal and spatial independence with noisy links. The study covers different network models, including the regular, small-world, random and scale-free whose the performance is analyzed according to the mean stability, mean-square errors, communication cost (link density) and robustness. Simulation results show that the noisy links do not cause divergence in the networks. Also, among the networks, the scale free network (heterogeneous) has the best performance in the steady state of the mean square deviation (MSD) while the regular is the worst case. The robustness of the networks against the issues like node failure and noisier node conditions is discussed as well as providing some guidelines on the design of a network in real condition such that the qualities of estimations are optimized.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.321-329
• /
• 2007

This paper reports on the application of network analysis approaches to investigate the characteristics of graph representations of Japanese word associations. Two semantic networks are constructed from two separate Japanese word association databases. The basic statistical features of the networks indicate that they have scale-free and small-world properties and that they exhibit hierarchical organization. A graph clustering method is also applied to the networks with the objective of generating hierarchical structures within the semantic networks. The method is shown to be an efficient tool for analyzing large-scale structures within corpora. As a utilization of the network clustering results, we briefly introduce two web-based applications: the first is a search system that highlights various possible relations between words according to association type, while the second is to present the hierarchical architecture of a semantic network. The systems realize dynamic representations of network structures based on the relationships between words and concepts.