• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.3
• /
• pp.8-17
• /
• 1999

무선 ATM망에서 다수 연결채널로부터 발생되는 트래픽의 서비스 질을 보장하고 한정된 무선 자원을 효율적으로 사용하기 위해서는 다중접속제어 기술이 중요한 설계요소 중 하나이다. 본고에서는 ATM 프로토콜 특성을 무선 구간에 까지 확장한 동적다중슬롯할당(DMSA: Dynamic Multi-Slot Assignment)기법의 단점 중 하나인 연결채널별 지연 성능의 차이에 대해 분석하고, 이를 해결하기 위하여 이동국으로부터 각 연결채널에 대해 전달되는 정보를 이용하여 중앙제어국에 가상큐를 도입하는 방안을 제안한다. 중앙제어국에서는 구성된 가상큐룰 이용하여 상향링크의 다음 한 프레임내 모든 타임슬롯에 대한 연결채녈 할당을 수행한다. 다양한 트래픽 소스에 대한 시뮬레이션을 통해 가상큐-동적다중슬롯할당 알고리즘이 기존의 동적다중슬롯할당 알고리즘에 비해 중앙제어국에서의 단순한 제어 부하만으로도 다수의 연결채널에 대해 균등한 설비스 질을 보장하고 지연 변이 특성의 성능 향상을 나타냄을 입증한다. 이러한 연구결과는 동종 혹은 이종의 트래픽을 가진 각 연결 채널에 대해 무선 구간의 분산 환경으로 인해 발생할 수 있는 불평등성을 해결함으로써 무선 ATM의 개념을 우선 ATM과 유사한 환경으로 분석할 수 있는 계기를 마련한 것으로 판단된다.

• The Korean Journal of Applied Statistics
• /
• v.34 no.1
• /
• pp.25-38
• /
• 2021

Recently the need for network surveillance to detect abnormal behavior within dynamic social networks has increased. We consider a dynamic version of the degree corrected stochastic block model (DCSBM) to simulate dynamic social networks and to monitor for a significant structural change in these networks. To apply a control charting procedure to network surveillance, in-control model parameters must be estimated from the Phase I data, that is from historical data. In network surveillance, however, there are many situations where sufficient relevant historical data are unavailable. In this paper we propose a self-starting Shewhart control charting procedure for detecting change in the dynamic networks. This procedure can be a very useful option when we have only a few initial samples for parameter estimation. Simulation results show that the proposed procedure has good in-control performance even when the number of initial samples is very small.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.3
• /
• pp.483-491
• /
• 2001

In this paper, we design and implement of the remote method connection system using Java RMI in the distributed computing system. In pursuing this goal, we implement the dynamic method connection interface and API. And then we describe the dynamic memory management routine.

• The Journal of the Korea Contents Association
• /
• v.22 no.6
• /
• pp.56-68
• /
• 2022

Recently, as the demand for real-time processing increases, studies on a dynamic graph that changes over time has been actively done. There is a connected components processing algorithm as one of the algorithms for analyzing dynamic graphs. GPUs are suitable for large-scale graph calculations due to their high memory bandwidth and computational performance. However, when computing the connected components of a dynamic graph using the GPU, frequent data exchange occurs between the CPU and the GPU during real graph processing due to the limited memory of the GPU. The proposed scheme utilizes the Weighted-Quick-Union algorithm to process large-scale graphs on the GPU. It supports fast connected components computation by applying the size to the connected component label. It computes the connected component by determining the parts to be recalculated and minimizing the data to be transmitted to the GPU. In addition, we propose a processing structure in which the GPU and the CPU execute asynchronously to reduce the data transfer time between GPU and CPU. We show the excellence of the proposed scheme through performance evaluation using real dataset.

• The Journal of Korean Academy of Prosthodontics
• /
• v.55 no.2
• /
• pp.151-155
• /
• 2017

Purpose: The aim of this study was to evaluate screw removal torque of the two-piece zirconia abutment with the novel titanium component compared to the conventional one-piece titanium abutment in the internal connection implant before and after dynamic cyclic loading. Materials and methods: Two types of the abutment assemblies with internal connection were prepared and divided into the groups; titanium abutment-titanium abutment screw assemblies as control, and zirconia abutment-titanium socket-titanium abutment screw assemblies as experimental group. A total of 12 abutments and implants were used of six assemblies each group. Each assembly was tightened to 30 Ncm. A cyclic load of 300 N at an angle of 30 degrees in reference to the loading axis was applied until one million cycles or failure. The removal torque values (RTVs) of the abutment screws were measured with a digital torque gauge before and after cyclic loading. The RTVs of the pre load and post load were analyzed with t-test, and P-values < .05 were considered statistically significant. Results: The assemblies of both groups survived all after the dynamic cyclic loading test without screw loosening. The statistically significant differences were found between the mean RTVs before and after the cyclic loading in both groups (P < .05). The RTV differences for the control and the experimental group were $-7.25{\pm}1.50Ncm$ and $-7.33{\pm}0.93Ncm$, respectively. Statistical analysis revealed that the RTV differences in both groups were not significantly different from each other (P > .05). Conclusion: Within the limitation of this study, the two-piece zirconia abutment with the titanium component did not show a significant RTV difference of the abutment screw compared to the titanium abutment after dynamic cyclic loading.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.557-562
• /
• 2005

Throughput and latency of interconnection network are important factors of the performance of multiprocessor systems. The dual-link CC-NUMA architecture using point-to-point unidirectional link is one of the popular structures in high-end commercial systems. In terms of optimal path between nodes, several paths exist with the optimal hop count by its native multi-path structure. Furthermore, transaction latency between nodes is affected by congestion of links on the transaction path. Hence the transaction latency may get worse if the transactions make a hot spot on some links. In this paper, I propose a dynamic transaction routing algorithm that maintains the balanced link utilization with the optimal path length, and I compare the performance with the fixed path method on the dual-link CC-NUMA systems. By the proposed method, the link competition is alleviated by the real-time path selection, and consequently, dynamic transaction algorithm shows a better performance. The program-driven simulation results show $1{\~}10\%$ improved fluctuation of link utilization, $1{\~}3\%$ enhanced acquirement of link, and $1{\~}6\%$ improved system performance.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• fall
• /
• pp.106-109
• /
• 2021

본 논문에서는 입력에 따라 합성곱 레이어 간의 잔차 연결을 변화시키는 동적 잔차 연결을 활용해 고해상도 복원 (Super-resolution) 작업을 위한 경량 네트워크를 설계하는 방법을 제안한다. 먼저, 동적 잔차 연결을 입력에 따라 변화시킬 수 있도록 경량화된 (Lightweight) 모듈을 설계하는 방법을 제안한다. 또한 이렇게 설계한 모듈로부터 얻은 잔차 연결에 대한 정보를 토대로 네트워크를 설계하는 방법을 제시한다. 제안된 방법을 통해 설계된 고해상도 복원 작업을 위한 네트워크는 적은 파라미터로도 입력에 따라 적응적으로 네트워크의 구조를 변화시킬 수 있어 효울적으로 다양한 입력 영상을 처리할 수 있다.

• The Korean Journal of Financial Management
• /
• v.21 no.1
• /
• pp.183-204
• /
• 2004

This paper introduces an observable connection structure between stocks in Korean stock market and investigates the formation principles of the observed connection structure between stocks in economic views. Several recent studies have been attempting to explain that the connection structure between stocks is organized by Power-Law distribution, this implies that most stocks have a few links, but only a few stocks have very large number of links. Therefore, we want to investigate the reason about why the connection structure between stocks exhibited by Mantegna's approach is Power-Law distribution. As a result we found that the number of connection between stocks is determined by market factors and specific firm factors among many other factors. In addition, if a stock is more affected by common factors(market) than specific firm factors, the stock has large number of links with other stocks, otherwise more affected by specific firm factors, the stock has a few links.

• Journal of KIISE:Software and Applications
• /
• v.33 no.8
• /
• pp.668-680
• /
• 2006

Web services on the Internet are not always reliable in terms of service availability and performance. Dynamic service coordination capability of a system or an application invoking Web services is essential to cope with such unreliable situations. In dynamic service coordination, if a Web service does not respond within a specific time constraint, it is replaced with another Web service at run time for reliable invocation of Web services. In this paper, we develop an exception based dynamic service coordination framework for Web services. In the framework, all necessary information for dynamic service coordination is explicitly specified and summarized as a set of attributes. Then classes and workflows, supporting dynamic service coordination and invoking Web services, are automatically created based on these attributes. Developers of Web services client programs can make the invocations of Web services reliable by calling the methods of the classes. Some performance loss has been observed in the indirect invocation of a Web service. However, when we consider the flexibility and reliability gained from the method, the performance loss would be acceptable in many cases.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.10
• /
• pp.6458-6465
• /
• 2015

Frequent change of mobile applications has become a burden to management of mobile services. Therefore, the development of mobile Web services, which the central management is easy, has increased. Tools which developers, as well as general users can easily develop, have been developed for mobile Web services. However, researches of standardized metamodel for implementing mobile Web service dynamically by general users is the inadequate situation. In this paper, we propose a dynamic metamodel for developing mobile Web services. The dynamic metamodel consists of a mobile Web pages, mobile Web page instance and dynamic connection using XDPL structure. we study a connection metamodel for condition connection, split connection and join connection, and combile entire metamodel, finally. Also, we carry out a case study in order to verify the suitability of metamodel by based on XPDL.