• International Journal of Computer Science & Network Security
• /
• 제22권1호
• /
• pp.55-60
• /
• 2022

Churn prediction is a critical long-term problem for many business like music, games, magazines etc. The churn probability can be used to study many aspects of a business including proactive customer marketing, sales prediction, and churn-sensitive pricing models. It is quite challenging to design machine learning model to predict the customer churn accurately due to the large volume of the time-series data and the temporal issues of the data. In this paper, a parallel artificial neural network is proposed to create a highly-accurate customer churn model on a large customer dataset. The proposed model has achieved significant improvement in the accuracy of churn prediction. The scalability and effectiveness of the proposed algorithm is also studied.

• 대한임베디드공학회논문지
• /
• 제18권2호
• /
• pp.67-73
• /
• 2023

Tree routing is one of appropriate routing schemes in wireless sensor network because the complexity of this approach is relatively low. But, congestion at a specific node may happen because a parent node toward a sink node is usually selected in one hop way, specially where large number of node are deployed. As feasible solution for this problem, multiple paths and sinks schemes can be applied. However, the performance of these schemes are not proved and analyzed yet. In this paper, we conduct diverse simulaton scenarios performance evaluation for these cases to identify the improvement and analyze the impact of schemes. The performance is measured in the aspects of packet transmission rate, throughput, and end-to-end delay as a function of amount of network traffic.

• 전기의세계
• /
• 제23권3호
• /
• pp.43-52
• /
• 1974

The matrix inversion is very inefficient for computing direct solutions of the large spare systems of linear equations that arise in many network problems as a large electrical power system. Optimally ordered triangular factorization of sparse matrices is more efficient and offers the other important computational advantages in some applications with this method. The direct solutions are computed from sparse matrix factors instead of a full inverse matrix, thereby gaining a significant advantage is speed and computer memory requirements. In this paper, it is shown that the sparse matrix method is superior to the inverse matrix method to solve the linear equations of large sparse networks. In addition, it is shown that the sparse matrix method is superior to the inverse matrix method to solve the linear equations of large sparse networks. In addition, it is shown that the solutions may be applied directly to sove the load flow in an electrical power system. The result of this study should lead to many aplications including short circuit, transient stability, network reduction, reactive optimization and others.

• 한국정보통신학회논문지
• /
• 제26권9호
• /
• pp.1320-1329
• /
• 2022

현재 선도국가연구망 그룹에서 SDN/NFV 기반의 네트워크 자동화·지능화 기술을 사용자에게 서비스 형태로 제공하기 위한 요구가 지속적으로 발생함에 따라 관련 연구개발이 추진되고 있다. 또한, 선도국가연구망에서는 일반 네트워크 환경보다 대용량 데이터 전송을 고성능으로 제공해야 한다는 요구사항이 점차 더 커지고 있는 실정이다. 이에 따라, 본 논문에서는 이러한 국가연구망의 네트워킹 요구사항들에 대응하기 위하여 연구 개발한 대용량 데이터 전송을 위한 오픈 API 기반 가상 네트워크 프로비저닝 자동화 플랫폼을 제안하고 이의 구현 결과를 제시한다. 해당 플랫폼에는 SDN 기반의 네트워크 가상화 기술을 제공하는 KREONET-S의 VDN 시스템, 컨테이너 중심의 서버 가상화 기술을 제공하는 Kubernetes 시스템, 그리고 고성능 데이터 전송 시스템인 Globus Online이 포함되어 있다. 본 논문에서는 이러한 상이한 시스템 간의 연계를 위한 환경 설정 및 시스템 연동 결과, 가상 네트워크 프로비저닝 자동화 구현 결과 및 성능에 대하여 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3602-3620
• /
• 2016

Dynamic topology is one of the main influence factors on network performability. However, it was always ignored by the traditional network performability assessment methods when analyzing large-scale mobile ad hoc networks (MANETs) because of the state explosion problem. In this paper, we address this problem from the perspective of complex network. A two-layer hierarchical modeling approach is proposed for MANETs performability assessment, which can take both the dynamic topology and multi-state nodes into consideration. The lower level is described by Markov reward chains (MRC) to capture the multiple states of the nodes. The upper level is modeled as a small-world network to capture the characteristic path length based on different mobility and propagation models. The hierarchical model can promote the MRC of nodes into a state matrix of the whole network, which can avoid the state explosion in large-scale networks assessment from the perspective of complex network. Through the contrast experiments with OPNET simulation based on specific cases, the method proposed in this paper shows satisfactory performance on accuracy and efficiency.

• Human Ecology Research
• /
• 제51권5호
• /
• pp.473-481
• /
• 2013

The purpose of this study was to investigate the moderating effects of a size of the friendship network and quality of friendship on the associations between mutual antipathy and maladjustment. The subjects were 678 fifth- and sixth-grade primary school children who were recruited from a public school in Bucheon City. The Peer Nomination Inventory was used to assess mutual antipathy, peer victimization, social withdrawal, aggression, and the friendship network. The children were given a classroom roster and asked to nominate up to three classmates who fit each description. Additionally, the children reported the quality of their friendships using the Friendship Quality Scale. Each child was asked to indicate his or her one best friend and rate how accurately a sentence describe done of their best friends on the scale. The results revealed that the friendship network and friendship quality significantly moderated the relationships between mutual antipathy and social withdrawal, and peer victimization. The magnitude of the association between mutual antipathy and social withdrawal was not significant for large friendship networks and high quality friendships. Although mutual antipathy was significantly associated with peer victimization, the association was stronger at lower levels than at higher levels of the friendship network and quality. However, there was no moderating effect of the friendship network and quality on the association between mutual antipathy and aggression. A large friendship network and high quality friendship could be protective factors among those who have mutual antipathy in peer groups.

• 한국산업융합학회 논문집
• /
• 제14권3호
• /
• pp.121-125
• /
• 2011

EMTP-RV is the very powerful program to analyze the dynamic operation of the power system. To use this package in the large complex power system, it is very important to simplify the power system to simple equivalent network. In our study the 100 MVA STATCOM is placed at 345kV "MIGUM" which is the one of the 345kV substations of the Korean Electric Power System that is consist of more than 1000-bus. MIGUM substation is connected with 7 separated transmission lines to main Korean Electric power system. We developed a new method to simplify the network except the substation that we want to analysis. The power system outside the 345kV substation is modeled into the equivalent network. The loop network outside the substation can be modeled to simplified Thevenin equivalent network. The proposed method is applied to IEEE-14 Reliability Test System and the results shows the effectiveness of the method.

• 방송공학회논문지
• /
• 제23권5호
• /
• pp.614-621
• /
• 2018

본 논문에서는 generative adversarial network (GAN)을 이용한 비감독 학습을 통해 깊이 카메라로 깊이 영상을 취득할 때 발생한 손실된 부분을 복원하는 기법을 제안한다. 제안하는 기법은 3D morphable model convolutional neural network (3DMM CNN)와 large-scale CelebFaces Attribute (CelebA) 데이터 셋 그리고 FaceWarehouse 데이터 셋을 이용하여 학습용 얼굴 깊이 영상을 생성하고 deep convolutional GAN (DCGAN)의 생성자(generator)와 Wasserstein distance를 손실함수로 적용한 구별자(discriminator)를 미니맥스 게임기법을 통해 학습시킨다. 이후 학습된 생성자와 손실 부분을 복원해주기 위한 새로운 손실함수를 이용하여 또 다른 학습을 통해 최종적으로 깊이 카메라로 취득된 얼굴 깊이 영상의 손실 부분을 복원한다.

• 한국통신학회논문지
• /
• 제12권3호
• /
• pp.267-275
• /
• 1987

회로망내에 존재하는 절점과 가지를 분할하여 몇 개의 부분회로망으로 나누고 분할절점에서의 전압 및 전류관계식으로부터 회로망방정식을 정식화하여 각 부분회로망 별로 독립적으로 처리함으로서 대형회로망을 효율적으로 해석할 수 있도록 하였다. 본 논문에서 제안한 분할회로망에 대한 방정식은 분할하기 전의 단일회로망에 대한 방정식과 비교할 때 절점의 순서만 재 배열한 결과가 되므로, 종래의 단일회로망에 대한 산법을 그대로 분할법에 적용할 수 있다. 또한, 어드미턴스행렬의 블록대각형구조를 이용한 병렬계산 알고리즘을 제시하였다.

• 한국컴퓨터정보학회논문지
• /
• 제23권9호
• /
• pp.57-64
• /
• 2018

In recent years, a new approach to cyber security, called the moving target defense, has emerged as a potential solution to the challenge of static systems. In this paper, we design a protected server network with a large number of decoys to anonymize the protected servers that dynamically mutate their IP address and port numbers according to Hidden Tunnel Networking, which is a network-based moving target defense scheme. In the network, a protected server is one-to-one mapped to a decoy-bed that generates a number of decoys, and the decoys share the same IP address pool with the protected server. First, the protected server network supports mutating the IP address and port numbers of the protected server very frequently regardless of the number of decoys. Second, it provides independence of the decoy-bed configuration. Third, it allows the protected servers to freely change their IP address pool. Lastly, it can reduce the possibility that an attacker will reuse the discovered attributes of a protected server in previous scanning. We believe that applying Hidden Tunnel Networking to protected servers in the proposed network can significantly reduce the probability of the protected servers being identified and compromised by attackers through deploying a large number of decoys.