• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권2호
• /
• pp.483-503
• /
• 2015

This paper analyzes the optimal user density and power allocation for Device-to-Device (D2D) communication underlaying cellular networks on multiple bands with the target of maximizing the D2D transmission capacity. The entire network is modeled by Poisson point process (PPP) which based on stochastic geometry. Then in order to ensure the outage probabilities of both cellular and D2D communication, a sum capacity optimization problem for D2D system on multiple bands is proposed. Using convex optimization, the optimal D2D density is obtained in closed-form when the D2D transmission power is determined. Next the optimal D2D transmission power is obtained in closed-form when the D2D density is fixed. Based on the former two conclusions, an iterative algorithm for the optimal D2D density and power allocation on multiple bands is proposed. Finally, the simulation results not only demonstrate the D2D performance, density and power on each band are constrained by cellular communication as well as the interference of the entire system, but also verifies the superiority of the proposed algorithm over sorting-based and removal algorithms.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제16권12호
• /
• pp.1234-1238
• /
• 2010

최근 센서 네트워크를 이용하여 이동 객체의 정보를 모니터링 하는 응용에 대한 연구가 활발하게 이루어지고 있다. 네트워크 전체 영역에서 대상 객체가 원하는 밀도로 분포하는 영역을 찾아내는 밀도 질의는 객체 모니터링 응용의 한 분야이다. 본 논문에서는 에너지 효율적인 질의 처리를 위한 동종 센서 기반의 인-네트워크 밀도 질의 처리 기법을 제안한다. 제안하는 기법은 밀도 질의 처리의 정확도를 높이고, 에너지 소비를 최소화하기 위한 가능성 기반 예상 지역 선정 기법과 센싱 영역 면적 기반 결과 보정 기법을 수행한다. 제안하는 기법의 우수성을 보이기 위해 시뮬레이션을 통해 기존에 제안된 밀도 질의 처리 기법과의 성능을 비교하였다. 그 결과 기존 기법에 비해 질의 처리를 위한 에너지 소모는 약 92% 감소하였고, 그에 따른 네트워크 생존 시간이 증가하였다. 덧붙여, 기존 기법보다 제안하는 기법의 질의 결과가 더 높은 정확도를 보장한다.

• 대한조선학회논문집
• /
• 제52권1호
• /
• pp.88-95
• /
• 2015

For the frequency-domain spectral fatigue analysis, the probability density function of stress range needs to be estimated based on the stress spectrum only, which is a frequency domain representation of the response. The probability distribution of the stress range of the narrow-band spectrum is known to follow the Rayleigh distribution, however the PDF of wide-band spectrum is difficult to define with clarity due to the complicated fluctuation pattern of spectrum. In this paper, efforts have been made to figure out the links between the probability density function of stress range to the structural response of wide-band Gaussian random process. An artificial neural network scheme, known as one of the most powerful system identification methods, was used to identify the multivariate functional relationship between the idealized wide-band spectrums and resulting probability density functions. To achieve this, the spectrums were idealized as a superposition of two triangles with arbitrary location, height and width, targeting to comprise wide-band spectrum, and the probability density functions were represented by the linear combination of equally spaced Gaussian basis functions. To train the network under supervision, varieties of different wide-band spectrums were assumed and the converged probability density function of the stress range was derived using the rainflow counting method and all these data sets were fed into the three layer perceptron model. This nonlinear least square problem was solved using Levenberg-Marquardt algorithm with regularization term included. It was proven that the network trained using the given data set could reproduce the probability density function of arbitrary wide-band spectrum of two triangles with great success.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 2008년도 추계 공동 국제학술대회
• /
• pp.479-491
• /
• 2008

A "task network" is a type of social network that consists of experts who exchange professional help and advice regarding executing tasks. In this study, we investigate the task network used within the IS department of a national bank in Korea. We identify how this network moderates the influence of computer-mediated communication (CMC) technology on an individual s task performance. Size, density, and centrality were measured as the characteristics of a personal task networks. Size equates to the total number of colleagues who work with a specific member for a certain project. Density is the ratio of the number of actual relationships to the total number of available relationships. Centrality defines whether an individual s position is in the exact center of whole network, and is measured by betweenness centrality, meaning the position one member holds between others in a network. Our findings conclude that the conditions - the larger the size of the task network, the smaller its density and the higher its level of centrality - lead to more benefits of using CMC media. Further, this positive effect of CMC is more noticeable when it provides synchronicity.

• 한국경영과학회지
• /
• 제34권4호
• /
• pp.57-72
• /
• 2009

As development of information technologies, customer retention has been an important issue in the competing environment. A lot of researches focus on prediction of the churning customers and seeking their characteristics. However, relationships among customers or products have not been considered in existing researches. In this study, product networks are proposed and analyzed to investigate the differences of network characteristics of products purchased by potential churning customers and those of loyal customers. The product networks are constructed from real product purchase data collected from a Korean department store. We investigated the characteristic differences, such as the degree centrality, degree centralization, and density, of two product networks constructed by potential churning customers and the loyal customers. The results indicate that degree centrality, density and degree centralization of the product network of the loyal customers are higher than those of the potential churning customers. And the promotional products of the department store are resulted to be effective in attracting the loyal customers.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제16권4호
• /
• pp.432-436
• /
• 2010

소셜 네트워크를 비롯한 네트워크로부터 커뮤니티를 발견하려면 네트워크의 노드를 그룹 내에서는 서로 조밀하게 연결되고 그룹 간에는 연결의 밀도가 낮은 그룹들로 군집화하는 과정이 꼭 필요하다. 군집화 알고리즘의 성능을 위해서는 군집화의 기준이 되는 유사도 기준이 잘 정의되어야 한다. 이 논문에서는 네트워크 내의 커뮤니티 발견을 위해 유사도 기준을 정의하고, 정의한 유사도를 유사도 전파(affinity propagation) 알고리즘과 결합하여 만든 방법을 기존의 방법들과 비교한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2170-2190
• /
• 2012

There are nowadays strong demands for intelligent surveillance systems, which can infer or understand more complex behavior. The application of crowd density estimation methods could lead to a better understanding of crowd behavior, improved design of the built environment, and increased pedestrian safety. In this paper, we propose a new crowd density estimation method, which aims at estimating not only a moving crowd, but also a stationary crowd, using images captured from surveillance cameras situated in various public locations. The crowd density of the moving people is measured, based on the moving area during a specified time period. The moving area is defined as the area where the magnitude of the accumulated optical flow exceeds a predefined threshold. In contrast, the stationary crowd density is estimated from the coarseness of textures, under the assumption that each person can be regarded as a textural unit. A multilayer neural network is designed, to classify crowd density levels into 5 classes. Finally, the proposed method is experimented with PETS 2009 and the platform of Gangnam subway station image sequences.

• Tribology and Lubricants
• /
• 제38권4호
• /
• pp.152-161
• /
• 2022

Chemical mechanical planarization (CMP) is a technology that planarizes the surfaces of semiconductor devices using chemical reaction and mechanical material removal, and it is an essential process in manufacturing highly integrated semiconductors. In the CMP process, a conditioning process using a diamond conditioner is applied to remove by-products generated during processing and ensure the surface roughness of the CMP pad. In previous studies, prediction of pad wear by CMP conditioning has depended on numerical analysis studies based on mathematical simulation. In this study, using an artificial neural network, the ratio of conditioner coverage to the distance between centers in the conditioning system is input, and the average conditioning density, standard deviation, nonuniformity (NU), and conditioning density distribution are trained as targets. The result of training seems to predict the target data well, although the average conditioning density, standard deviation, and NU in the contact area of wafer and pad and all areas of the pad have some errors. In addition, in the case of NU, the prediction calculated from the training results of the average conditioning density and standard deviation can reduce the error of training compared with the results predicted through training. The results of training on the conditioning density profile generally follow the target data well, confirming that the shape of the conditioning density profile can be predicted.

• 한국지하수토양환경학회:학술대회논문집
• /
• 한국지하수토양환경학회 2003년도 추계학술발표회
• /
• pp.543-547
• /
• 2003

We applied the modified invasion percolation (MIP) model to the migration of DNAPL within a two-dimensional random fracture network. The MIP model was verified against laboratory experiments, which was conducted using a two-dimensional random fracture network model. The results showed that the MIP needs modification. To remove TCE trapped in a random fracture network, the density-surfactant-motivated removal method was applied and found very effective to remove TCE from dead-end fractures.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2015년도 춘계학술대회
• /
• pp.120-122
• /
• 2015

본 논문은 Delay Tolerant Network(DTN)에서 유동 밀도를 사용해 메시지 확산을 억제하는 DDIM(Dynamic Density-based Inhibited Message diffusion) 알고리즘을 제안한다. 기존 Epidemic 라우팅 알고리즘이나 Spray and Wait 라우팅 알고리즘과 같은 DTN 라우팅 알고리즘은 메시지의 전송률을 높이기 위해 소스 노드와 이웃하는 모든 노드들에게 메시지를 복사한다. 하지만 노드 밀도가 높은 네트워크에서 기존 DTN 라우팅 알고리즘을 사용할 경우 불필요한 메시지 복사로 많은 오버헤드가 발생한다. 제안하는 DDIM 알고리즘은 효율적인 메시지 복사 수를 결정하기 위해 노드 전송 범위와 이웃 노드 수를 활용하여 동적 노드 밀도를 계산한다. 또한 불필요한 메시지 확산을 억제하여 전송률 손실과 지연 시간의 증가 없이 오버헤드를 감소시킨다. 주어진 모의실험을 통해 제안하는 DDIM 알고리즘과 기존 DTN 라우팅 알고리즘의 전송률, 지연시간, 오버헤드를 비교하고 제안하는 알고리즘이 더 효율적임을 검증한다.