• Title/Summary/Keyword: 척도없는 네트워크

Search Result 201, Processing Time 0.027 seconds

A Measure of Reliability Importance in the Network and its Computational Algorithm (네트워크 신뢰성 중요도의 척도와 계산알고리즘)

  • Lee, Chang-Hun;Jeong, Seong-Jin;Hong, Jeong-Sik
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.13 no.2
    • /
    • pp.79-85
    • /
    • 1987
  • A unified reliability importance of the component in the network is considered. A measure is presented by considering the traffic between vertex pairs. An algrithm for this measure is also presented by using the factoring algorithm.

  • PDF

A Study on the Construction and Application of Social Capital Scale in Social Welfare Organizations (사회복지조직의 사회적 자본 척도 구성과 그 적용에 관한 연구)

  • Moon, Young-Joo
    • Korean Journal of Social Welfare Studies
    • /
    • v.42 no.3
    • /
    • pp.381-407
    • /
    • 2011
  • This study set out to construct an social capital scale that could be commonly used by social welfare organizations and to apply it to examine any differences in social capital among social welfare organizations. For those purposes, the study distributed a questionnaire by mail to social welfare organizations in 15 cities and provinces across the nation and conducted latent means analysis. The major research findings were as follows. First, as a result of exploratory factor analysis and confirmatory factor analysis, the validity and reliability in measurement indicators of social capital were proved to be satisfactory level. Secondly, social capital were found to be interpreted at the organizational level through the review of levels of analysis. Meanwhile, the configural, metric, and scalar invariance of social capital scale were confirmed, which indicates that the social capital scale can be commonly applied to social welfare organizations. Finally, latent means analysis was carried out to examine differences among social welfare organizations in the subindexes of social capital including network connectivity, setting and sharing of vision, reciprocal norm, trust and cooperation, and group participation. As a result, there were significant differences among social welfare organizations in network connectivity, reciprocal norm, trust and cooperation and group participation but no statistically significant differences among them in sharing of vision, goal and core value. Those findings led to implications needed to manage of social welfare organizations.

An Estimate of the Required Number of Yard Tractor in Container Terminal (컨테이너터미널의 야드 트랙터 소요대수 추정)

  • Choi, Yong-Seok;Kim, Woo-Sun;Ha, Tae-Young
    • Journal of Navigation and Port Research
    • /
    • v.28 no.6
    • /
    • pp.549-555
    • /
    • 2004
  • The purpose of this study is to estimate the required number of yard tractor on port container terminal. The number of yard tractor is the bottleneck factor on the efficiency of container terminal. Due to the change in travel speed and travel distance, the efficiency is difficult to estimate. The efficiency of yard tractor is estimated by the proposed simulation model that developed considering the queueing network between container crane and transfer crane. The number of yard tractor per container crane is estimated by the alternative analysis. And to determine the number of yard tractor per container crane, the performance measure such as the distance between berth and yard, the speed of yard tractor are simulated.

Analysis of Network Dynamics from the Roman-Fleuve, Togi (대하소설 토지 등장인물 네트워크의 동적 변화 분석)

  • Kim, Hak Yong
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.11
    • /
    • pp.519-526
    • /
    • 2012
  • Human-human interaction network derived from Roman-fleuve, Togi was constructed. The network has a scale free properties as if most social networks do. The Togi is excellent model system for analyzing network dynamics because it has various characters and complex their interactions. The novel is composed of well-separated 5 sections. I constructed 5 different sub-netwotks from each section. As employing k-core algorithm as a useful tool for obtaining a core network from the complex networks, it is possible to obtain hidden and valuable information from a complex network. As gradually extending one section to another one, I constructed 4 different extended networks. The final one is whole network from the Togi. These results provide new insight that is analyzed by network-based approaches for network dynamics from literature, Togi.

A Study of Coastal Passenger Ship Routes through Social Network Analysis Method (사회 네트워크 분석 방법을 활용한 국내 여객항로 분석 연구)

  • Ko, Jae-Woo;Cho, Chang-Mook;Kim, Sung-Ho;Jung, Wan-Hee
    • Journal of Navigation and Port Research
    • /
    • v.39 no.3
    • /
    • pp.217-222
    • /
    • 2015
  • In this research, sea routes of domestic coaster liners between 2005 and 2013 were studied via social network analysis. Study of the sea routes revealed that they follow power-law in a scale-free form, a characteristic found often in social network. We have looked into centrality, which is a major standard in the field of social network analysis. We have also analyzed the annual changing trend in the centrality of the connectivity, examined the effect of quantity through the comparison with the original quantitative analysis method, and lastly, verified the relationship between the centrality of connectivity and mediation. Then, we were able to identify ports according to priority using these factors. This research assumed and interpreted the coaster liners route as a single network and suggested useful results. Based on these results, directing of development of domestic coaster liners route development and other factors will be achieved more smoothly. And if we utilize social network analysis method in other various fields - for example, the centrality of airport and the diplomatic realations analysis of the neighboring country - we will be able to effectively analyze events in diverse perspectives.

Analysis of regionally centralized and decentralized multistage reverse logistics networks using genetic algorithm (유전알고리즘을 이용한 지역 집중형 및 분산형 다단계 역물류 네트워크 분석)

  • Yun, YoungSu
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.19 no.4
    • /
    • pp.87-104
    • /
    • 2014
  • This paper proposes regionally centralized multistage reverse logistics (cmRL) networks and regionally decentralized multistage reverse logistics (dmRL) networks. cmRL considers whole area of RL network, while dmRL regionally distributed area of RL network. Each type is formulated by the mixed integer programming (MIP) models, which are realized in genetic algorithm (GA) approach. Two types of numerical experiments using RL network are presented and various measures of performance are used for comparing the efficiency of the cmRL and the dmRL. Finally, it is proved that the performance of the cmRL is superior to that of the dmRL.

A Study on the Effect of Network Centralities on Recommendation Performance (네트워크 중심성 척도가 추천 성능에 미치는 영향에 대한 연구)

  • Lee, Dongwon
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.1
    • /
    • pp.23-46
    • /
    • 2021
  • Collaborative filtering, which is often used in personalization recommendations, is recognized as a very useful technique to find similar customers and recommend products to them based on their purchase history. However, the traditional collaborative filtering technique has raised the question of having difficulty calculating the similarity for new customers or products due to the method of calculating similaritiesbased on direct connections and common features among customers. For this reason, a hybrid technique was designed to use content-based filtering techniques together. On the one hand, efforts have been made to solve these problems by applying the structural characteristics of social networks. This applies a method of indirectly calculating similarities through their similar customers placed between them. This means creating a customer's network based on purchasing data and calculating the similarity between the two based on the features of the network that indirectly connects the two customers within this network. Such similarity can be used as a measure to predict whether the target customer accepts recommendations. The centrality metrics of networks can be utilized for the calculation of these similarities. Different centrality metrics have important implications in that they may have different effects on recommended performance. In this study, furthermore, the effect of these centrality metrics on the performance of recommendation may vary depending on recommender algorithms. In addition, recommendation techniques using network analysis can be expected to contribute to increasing recommendation performance even if they apply not only to new customers or products but also to entire customers or products. By considering a customer's purchase of an item as a link generated between the customer and the item on the network, the prediction of user acceptance of recommendation is solved as a prediction of whether a new link will be created between them. As the classification models fit the purpose of solving the binary problem of whether the link is engaged or not, decision tree, k-nearest neighbors (KNN), logistic regression, artificial neural network, and support vector machine (SVM) are selected in the research. The data for performance evaluation used order data collected from an online shopping mall over four years and two months. Among them, the previous three years and eight months constitute social networks composed of and the experiment was conducted by organizing the data collected into the social network. The next four months' records were used to train and evaluate recommender models. Experiments with the centrality metrics applied to each model show that the recommendation acceptance rates of the centrality metrics are different for each algorithm at a meaningful level. In this work, we analyzed only four commonly used centrality metrics: degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality. Eigenvector centrality records the lowest performance in all models except support vector machines. Closeness centrality and betweenness centrality show similar performance across all models. Degree centrality ranking moderate across overall models while betweenness centrality always ranking higher than degree centrality. Finally, closeness centrality is characterized by distinct differences in performance according to the model. It ranks first in logistic regression, artificial neural network, and decision tree withnumerically high performance. However, it only records very low rankings in support vector machine and K-neighborhood with low-performance levels. As the experiment results reveal, in a classification model, network centrality metrics over a subnetwork that connects the two nodes can effectively predict the connectivity between two nodes in a social network. Furthermore, each metric has a different performance depending on the classification model type. This result implies that choosing appropriate metrics for each algorithm can lead to achieving higher recommendation performance. In general, betweenness centrality can guarantee a high level of performance in any model. It would be possible to consider the introduction of proximity centrality to obtain higher performance for certain models.

The Path Loss Estimation Model over the sea at 2.4 GHz Wireleless Network (해상 무선통신 네트워크에서 2.4 GHz 대역의 해수면 경로손실 예측 모델 연구)

  • Yang, Seung-Chur;Byun, Seung-Kyu;Lee, Sung-Ho;Kim, Jong-Deok
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.601-602
    • /
    • 2013
  • 경로손실 예측 모델은 무선 네트워크 설계를 위한 기본 척도이며, 적용 환경과 적용 시스템에 영향을 받는 특징이 있다. 대부분의 기존 연구는 도심, 교외와 같은 육상 환경을 기반으로 한다. 일반적으로 해수면 경로 손실은 전파의 잦은 굴절로 인해 지표면 보다 크며, 주파수에 비례한 경로손실이 있다고 알려져 있다. 하지만 해상 환경의 관련 연구는 자유공간에 적용하기 때문에 예측 모델의 정확성을 낮춘다. 본 논문은 해상 무선통신 서비스를 위한 2.4 GHz 대역의 해수면 경로손실 예측 모델을 제안한다. 이를 위해 육상과 해상에서 각각 수신신호 세기를 측정하고, 다양한 예측 모델과 비교 분석하여 실용성과 정확성을 입증한다.

  • PDF

Analysis of Network Dynamics from the Romance of the Three Kingdoms (소설 삼국지 등장인물 네트워크의 동적 변화 분석)

  • Lee, Yoon-Kyeong;Shin, Hyun-Il;Ku, Ja-Eul;Kim, Hak-Yong
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.4
    • /
    • pp.364-371
    • /
    • 2009
  • We analyzed romance of the three kingdoms written by Luo Guanzhong by using complex network to compare its properties with those of social network. The three kingdom network has a scale free and hierarchical network properties. Human-human interaction networks are dramatically changing in response to time and space. Due to lack of the dynamic interacting data, the researches only focus to analysis for properties of the statical networks. The romance of the three kingdoms is a Chinese historical novel based upon events from the end of the Han Dynasty, the Three Kingdoms era of China, and the reunification of the land. There are over a thousand characters, over a three thousand human-human interactions, and the dynamic changed in human-human interactions in the historical novel. Here, we introduce that a possible method for analyzing about dynamic changing of the complex network.

Analysis of Scientific Item Networks from Science and Biology Textbooks (고등학교 과학 및 생물교과서 과학용어 네트워크 분석)

  • Park, Byeol-Na;Lee, Yoon-Kyeong;Ku, Ja-Eul;Hong, Young-Soo;Kim, Hak-Yong
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.5
    • /
    • pp.427-435
    • /
    • 2010
  • We extracted core terms by constructing scientific item networks from textbooks, analyzing their structures, and investigating the connected information and their relationships. For this research, we chose three high-school textbooks from different publishers for each three subjects, i.e, Science, Biology I and Biology II, to construct networks by linking scientific items in each sentence, where used items were regarded as nodes. Scientific item networks from all textbooks showed scare-free character. When core networks were established by applying k-core algorithm which is one of generally used methods for removing lesser weighted nodes and links from complex network, they showed the modular structure. Science textbooks formed four main modules of physics, chemistry, biology and earth science, while Biology I and Biology II textbooks revealed core networks composed of more detailed specific items in each field. These findings demonstrate the structural characteristics of networks in textbooks, and suggest core scientific items helpful for students' understanding of concept in Science and Biology.