• 경영과학
• /
• 제26권1호
• /
• pp.183-196
• /
• 2009

Customer retention has been a pressing issue for companies to get and maintain the loyal customers in the competing environment. Lots of researchers make effort to seek the characteristics of the churning customers and the loyal customers using the data mining techniques such as decision tree. However, such existing researches don't consider relationships among customers. Social network analysis has been used to search relationships among social entities such as genetics network, traffic network, organization network and so on. In this study, a customer network is proposed to investigate the differences of network characteristics of churning customers and loyal customers. The customer networks are constructed by analyzing the real purchase data collected from a Korean cosmetic provider. We investigated whether the churning customers and the loyal customers have different degree centralities and densities of the customer networks. In addition, we compared products purchased by the churning customers and those by the loyal customers. Our data analysis results indicate that degree centrality and density of the churning customer network are higher than those of the loyal customer network, and the various products are purchased by churning customers rather than by the loyal customers. We expect that the suggested social network analysis is used to as a complementary analysis methodology with existing statistical analysis and data mining analysis.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 하계학술대회 논문집 A
• /
• pp.171-173
• /
• 1997

This paper presents analysis of the radial force density in brushless DC motor of which distribution is not uniform in the axial direction. The analysis considering 3D shape of teeth and overhang is not only important but essential to calculate the radial force density that acts on the teeth of stator, because it is frequent source of vibration and changes at the end of teeth. For the analysis, a new 3D equivalent magnetic circuit network method taking into account movement of the rotor without remesh is proposed. The radial force density is calculated by Maxwell stress tensor and analyzed by discrete Fourier transform.

• Transactions on Control, Automation and Systems Engineering
• /
• 제2권4호
• /
• pp.268-273
• /
• 2000

Plasma models are crucial to equipment design and process optimization. A radial basis function network(RBFN) in con-junction with statistical experimental design has been used to model a process plasma. A 2$^4$ full factorial experiment was employed to characterized a hemispherical inductively coupled plasma(HICP) in characterizing HICP, the factors that were varied in the design include source power, pressure, position of shuck holder, and Cl$_2$ flow rate. Using a Langmuir probe, plasma attributes were collected, which include typical electron density, electron temperature. and plasma potential as well as their spatial uniformity. Root mean-squared prediction errors of RBEN are 0.409(10(sup)12/㎤), 0.277(eV), and 0.699(V), for electron density, electron temperature, and Plasma potential, respectively. For spatial uniformity data, they are 2.623(10(sup)12/㎤), 5.704(eV) and 3.481(V), for electron density, electron temperature, and plasma potential, respectively. Comparisons with generalized regression neural network(GRNN) revealed an improved prediction accuracy of RBFN as well as a comparable performance between GRNN and statistical response surface model. Both RBEN and GRNN, however, experienced difficulties in generalizing training data with smaller standard deviation.

• 한국방사성폐기물학회:학술대회논문집
• /
• 한국방사성폐기물학회 2009년도 학술논문요약집
• /
• pp.186-186
• /
• 2009

The characterization strategy of fracture networks are classified into a deterministic or statistical characterization according to the type of required information. A deterministic characterization is most efficient for a sparsely fractured system, while the statistics are sufficient for densely fractured rock. In this study, the ensemble mean and variability of the effective connectivity is systematically analyzed with various density values for different network structures of a power law size distribution. The results of high resolution Monte Carlo analyses show that statistical characteristics can be a necessary information to determine the transport properties of a fracture system when fracture density is greater than a percolation threshold. When the percolation probability (II) approaches unity with increasing fracture density, the effective connectivity of the network can be safely estimated using statistics only (sufficient condition). It is inferred from conditional simulations that deterministic information for main pathways can reduce the uncertainty in estimation of system properties when the network becomes denser. Overall results imply that most pathways need to be identified when II < 0.5 statistics are sufficient when II $\rightarrow$ 1 and statistics are necessary and the identification of main pathways can significantly reduce the uncertainty in estimation of transport properties when 0.5$\ll$1. It is suggested that the proper estimation of the percolation probability of a fracture network is a prerequisite for an appropriate conceptualization and further characterization.

• Journal of information and communication convergence engineering
• /
• 제16권2호
• /
• pp.84-92
• /
• 2018

For large wireless sensor networks running on battery power, the time synchronization of all sensor nodes is becoming a crucial task for waking up sensor nodes with exact timing and controlling transmission and reception timing. However, as network size increases, this synchronization process tends to require long processing time consume significant power. Furthermore, a naïve synchronization scheduler may leave some nodes unsynchronized. This paper proposes a power-efficient scheduling algorithm for time synchronization utilizing the notion of density, which is defined by the number of neighboring nodes within wireless range. The proposed scheduling algorithm elects a sequence of minimal reference nodes that can complete the synchronization with the smallest possible number of hops and lowest possible power consumption. Additionally, it ensures coverage of all sensor nodes utilizing a two-pass synchronization scheduling process. We implemented the proposed synchronization algorithm in a network simulator. Extensive simulation results demonstrate that the proposed algorithm can reduce the power consumption required for the periodic synchronization process by up to 40% for large sensor networks compared to a simplistic multi-hop synchronization method.

• The Journal of the Acoustical Society of Korea
• /
• 제17권4E호
• /
• pp.3-10
• /
• 1998

This paper concerns the dynamical behavior, in probabilistic sense, of a feedforward neural network performing auto association for novelty. Networks of retinotopic topology having a one-to-one correspondence between and output units can be readily trained using back-propagation algorithm, to perform autoassociative mappings. A novelty filter is obtained by subtracting the network output from the input vector. Then the presentation of a "familiar" pattern tends to evoke a null response ; but any anomalous component is enhanced. Such a behavior exhibits a promising feature for enhancement of weak signals in additive noise. As an analysis of the novelty filtering, this paper shows that the probability density function of the weigh converges to Gaussian when the input time series is statistically characterized by nonsymmetrical probability density functions. After output units are locally linearized, the recursive relation for updating the weight of the neural network is converted into a first-order random differential equation. Based on this equation it is shown that the probability density function of the weight satisfies the Fokker-Planck equation. By solving the Fokker-Planck equation, it is found that the weight is Gaussian distributed with time dependent mean and variance.

• 한국염색가공학회지
• /
• 제19권6호
• /
• pp.7-11
• /
• 2007

A prediction model for yarn density profile was developed using the neural network methodology. The neural network model developed traces mass densities of a yarn within a section and predicts the mass profiles of the next yarn segment yet to be measured. The model does not require an assumption on the existence of a relationship between the past and future data sets. Four high-draft yarns made under different processing conditions were employed in order to test the performance of the model developed. It was shown that the model could predict the yarn density profiles without a significant error.

• 자원환경지질
• /
• 제50권1호
• /
• pp.61-71
• /
• 2017

본 연구는 절리의 빈도 및 길이분포가 절리암반의 수리지질학적 특성에 미치는 영향을 평가하기 위하여 이차원 불연속절리망 (DFN; discrete fracture network) 유체유동 해석을 바탕으로 한 수치실험을 수행하였다. 두개의 절리군을 사용하여 절리의 빈도와 길이분포를 달리하며 추계론적으로 생성한 총 51개의 DFN 시스템에 대하여 $0^{\circ}$부터 매 $30^{\circ}$ 간격으로 총 12 방향으로 구현한 총 612개의 $20m{\times}20m$ DFN 블록에서 방향에 따른 블록수리전도도가 산정되었다. 또한, 각각의 DFN 시스템에서 이론적 블록수리전도도와 더불어 주 수리전도도텐서, 평균 블록수리전도도 등이 산정되었다. 절리군의 빈도의 증가 또는 길이의 평균 및 표준편차 증가에 따라 임의 방향으로의 블록수리전도도는 증가하며 DFN 시스템에 대한 등가연속체 취급 가능성이 높아지지만, 절리군 간의 빈도 차이가 커지면 블록수리전도도의 이방성 증대로 인하여 등가연속체 취급 가능성이 낮아질 수 있는 것으로 평가되었다. 두 절리군의 교차각이 작을수록 등가연속체 특성은 빈도 및 길이분포의 변화에 상대적으로 더욱 영향을 받는 것으로 평가되었다. 등가연속체로 취급하기 어려울 정도로 두 절리군의 교차각이 작아도 절리군의 빈도 또는 길이 분포가 증가하면 등가연속체 취급 가능성은 높아진다.

• 한국유통학회지:유통연구
• /
• 제16권2호
• /
• pp.95-118
• /
• 2011

본 연구는 다음과 같은 연구목적을 가진다. 첫째, 프랜차이즈 시스템에서 사회연결망 밀도와 중앙성이 가맹점의 가맹본부와의 정보공유와 다른 가맹점들과의 정보공유에 미치는 영향에 대한 관계를 실증적으로 밝히고자 한다. 둘째, 앞서 제시한 관계들에 있어 가맹점과 가맹본부 간의 유대강도의 조절역할을 하는지에 대하여 탐색적으로 확인하고자 한다. 셋째, 실증분석의 결과를 토대로 학문적 실무적 시사점을 제시하고자 한다. 본 연구는 실증분석을 하기 위하여 부산지역에 소재한 프랜차이즈 가맹점들을 대상으로 설문조사를 실시하였으며, 설문응답의 신뢰성을 높이기 위해서 가맹점의 점주와 점장을 중심으로 설문조사 하였다. 회수된 설문지는 총 200부이며, 이 중 무성의하게 응답한 11부를 제외한 189부를 실증분석에 사용하였다. 평균변환법과 위계적 다중회귀분석법을 사용하여 가설들을 검증한 결과는 다음과 같다. 첫째, 정보공유 대상이 가맹본부인 경우 사회연결망 중앙성, 유대강도, 밀도 및 중앙성과 유대강도의 상호작용이 정보공유에 유의하게 영향을 미치는 것으로 나타났다. 둘째, 정보공유 대상이 다른 가맹점인 경우 사회연결망 중앙성이 정보공유에 유의한 영향을 미치는 것으로 나타났다. 마지막으로 본 연구의 실증분석 결과를 토대로 학문적 실무적 시사점과 본 연구의 한계점 및 향후 과제를 제시하였다.

• 기술혁신학회지
• /
• 제4권2호
• /
• pp.157-171
• /
• 2001

This paper discusses the economics of local loop architecture focusing on existing technologies, ADSL, HFC, and new one, PLC, and suggests a new modeling approach of access network system and the numerical equations. To modelize access network system and drive the numerical equations, we consider the double star and the tree & branch architecture and made block diagram of each access system. In addition, we introduce the density of subscriber as a variable and the equation of seeking the optimal number of cell in a service area. The economics of local loop architecture is analyzed in two ways, i.e. with and without consideration of the cost of cable and infrastructure. From the numerical analysis, we find that in case of not including the cost of cable and infrastructure, there is no much difference in the cost per one subscriber, while, in case of including it, there is remarkable difference among technologies. Therefore we conclude that the economics of local loop architecture is depend on the density of subscriber and existing network infrastructures.