• 한국경영과학회지
• /
• 제22권4호
• /
• pp.1-16
• /
• 1997

The cell loss probability recommended in the B-ISDN is in the range $10^{-8}~10^{-12}$. When a simulation technique is used to analyze the performance of the ATM node, an enormous amount of computer processing time is required. In this study, we derive an importance sampling simulation technique that can be used to evaluate the performance of the ATM node very quickly, that is, the probability that the queue size at the ATM node reaches some large value N. The simulation results show that the backlog probability obtianed by the importance saimpling simulation is very close to that obtained by the ordinary simulation and the computer time can be reduced drastically by the importance sampling simulation.

• 한국인공지능학회지
• /
• 제11권2호
• /
• pp.1-6
• /
• 2023

This paper presents a comprehensive scheme for assessing the importance of multiple microgrids (MGs) network that includes distributed energy resources (DERs), renewable energy systems (RESs), and energy storage system (ESS) facilities. Due to the uncertainty of severe weather, large-scale cascading failures are inevitable in energy networks. making the assessment of the structural vulnerability of the energy network an attractive research theme. This attention has led to the identification of the importance of measuring energy nodes. In multiple MG networks, the energy nodes are regarded as one MG. This paper presents a modified PageRank algorithm to assess the importance of MGs that include multiple DERs and ESS. With the importance rank order list of the multiple MG networks, the core MG (or node) of power production and consumption can be identified. Identifying such an MG is useful in preventing cascading failures by distributing the concentration on the core node, while increasing the effective link connection of the energy flow and energy trade. This scheme can be applied to identify the most profitable MG in the energy trade market so that the deployment operation of the MG connection can be decided to increase the effectiveness of energy usages. By identifying the important MG nodes in the network, it can help improve the resilience and robustness of the power grid system against large-scale cascading failures and other unexpected events. The proposed algorithm can point out which MG node is important in the MGs power grid network and thus, it could prevent the cascading failure by distributing the important MG node's role to other MG nodes.

• International journal of advanced smart convergence
• /
• 제10권2호
• /
• pp.64-72
• /
• 2021

XML message brokers have a lot of importance because XML has become a practical standard for data exchange in many applications. Message brokers covered in this document store many users. This paper is a study of the processing of twig pattern queries in XML documents using branching node streams in XML message broker structures. This work is about query processing in XML documents, especially for query processing with XML twig patterns in the XML message broker structure and proposed a method to reduce query processing time when parsing documents with XML twig patterns by processing information. In this paper, the twig pattern query processing method of documents using the branching node stream removes the twigging value of the branch node that does not include the labeling value of the branch node stream when it receives a twig query from the client. In this paper, the leaf node discovery time can be reduced by reducing the navigation time of nodes in XML documents that are matched to leaf nodes in twig queries for client twig queries. Overall, the overall processing time to respond to queries is reduced, allowing for rapid question-answer processing.

• 한국시뮬레이션학회논문지
• /
• 제13권3호
• /
• pp.1-10
• /
• 2004

The cell loss probability required in the ATM network is in the range of 10$^{-9}$ ∼10$^{-12}$ . If Monte Carlo simulation is used to analyze the performance of the ATM node, an enormous amount of computer time is required. To obtain large speed-up factors, importance sampling may be used. Since the Markov-modulated processes have been used to model various high-speed network traffic sources, we consider discrete time single server queueing systems with Markov-modulated arrival processes which can be used to model an ATM node. We apply importance sampling based on the Large Deviation Theory for the performance evaluation of, MMBP/D/1/K, ∑MMBP/D/1/K, and two stage tandem queueing networks with Markov-modulated arrival processes and deterministic service times. The simulation results show that the buffer overflow probabilities obtained by the importance sampling are very close to those obtained by the Monte Carlo simulation and the computer time can be reduced drastically.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권4호
• /
• pp.1845-1865
• /
• 2019

Current Internet is designed by lots of service providers with different objects and policies which make the direct deployment of radically new architecture and protocols on Internet nearly impossible without reaching a consensus among almost all of them. Network virtualization is proposed to fend off this ossification of Internet architecture and add diversity to the future Internet. As an important part of network virtualization, virtual network embedding (VNE) problem has received more and more attention. In order to solve the problems of large embedding cost, low acceptance ratio (AR) and environmental adaptability in VNE algorithms, cognitive method is introduced to improve the adaptability to the changing environment and a cognitive virtual network embedding algorithm based on weighted relative entropy (WRE-CVNE) is proposed in this paper. At first, the weighted relative entropy (WRE) method is proposed to select the suitable substrate nodes and paths in VNE. In WRE method, the ranking indicators and their weighting coefficients are selected to calculate the node importance and path importance. It is the basic of the WRE-CVNE. In virtual node embedding stage, the WRE method and breadth first search (BFS) algorithm are both used, and the node proximity is introduced into substrate node ranking to achieve the joint topology awareness. Finally, in virtual link embedding stage, the CPU resource balance degree, bandwidth resource balance degree and path hop counts are taken into account. The path importance is calculated based on the WRE method and the suitable substrate path is selected to reduce the resource fragmentation. Simulation results show that the proposed algorithm can significantly improve AR and the long-term average revenue to cost ratio (LTAR/CR) by adjusting the weighting coefficients in VNE stage according to the network environment. We also analyze the impact of weighting coefficient on the performance of the WRE-CVNE. In addition, the adaptability of the WRE-CVNE is researched in three different scenarios and the effectiveness and efficiency of the WRE-CVNE are demonstrated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권4호
• /
• pp.1562-1578
• /
• 2020

Vector data compression algorithm can meet requirements of different levels and scales by reducing the data amount of vector graphics, so as to reduce the transmission, processing time and storage overhead of data. In view of the fact that large threshold leading to comparatively large error in Douglas-Peucker vector data compression algorithm, which has difficulty in maintaining the uncertainty of shape features and threshold selection, a segmented Douglas-Peucker algorithm based on node importance is proposed. Firstly, the algorithm uses the vertical chord ratio as the main feature to detect and extract the critical points with large contribution to the shape of the curve, so as to ensure its basic shape. Then, combined with the radial distance constraint, it selects the maximum point as the critical point, and introduces the threshold related to the scale to merge and adjust the critical points, so as to realize local feature extraction between two critical points to meet the requirements in accuracy. Finally, through a large number of different vector data sets, the improved algorithm is analyzed and evaluated from qualitative and quantitative aspects. Experimental results indicate that the improved vector data compression algorithm is better than Douglas-Peucker algorithm in shape retention, compression error, results simplification and time efficiency.

• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제4권1호
• /
• pp.37-44
• /
• 2015

사회관계망 분석에 있어서 매개 중심도(Betweenness Centrality)는 네트워크를 구성하는 노드들의 상대적인 중요도를 파악하기 위한 척도로서 주로 사용되어 왔다. 그러나 매개 중심도를 측정하기 위한 시간 복잡도가 높기 때문에 대규모의 온라인 사회관계망 서비스에서 각 노드의 매개 중심도를 산출하는 것은 쉽지 않은 문제이다. 그래서 본 연구팀에서는 과거에 네트워크를 구성하는 각각의 노드들마다 자신의 지역 정보를 활용하여 확장 자아 네트워크(Expanded Ego Network)를 정의하고 그 네트워크에서 확장 자아 매개 중심도(Expanded Ego Betweenness)를 산출하여 기존의 매개 중심도를 대체하려는 시도를 하였다. 본 논문에서는 지역정보 기반의 확장 자아 네트워크의 특징을 분석하여 확장 자아 매개 중심도를 빠르게 산출할 수 있는 알고리즘을 제안한다. 그리고 일반적인 사회관계망의 특성을 대표하는 Barab$\acute{a}$si-Albert 네트워크 모델을 사용한 가상 네트워크와 실제 사회관계망을 대표하는 페이스북 친구 관계 네트워크에서의 실험을 통하여 확장 자아 매개 중심도의 중요도 순위가 기존 매개 중심도의 중요도 순위와 거의 일치함을 보인다. 또한 제안하는 알고리즘이 기존 알고리즘에 비해 확장 자아 네트워크에서의 확장 자아 매개 중심도를 더 빠르게 산출함을 보인다.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2018년도 추계 학술논문 발표대회
• /
• pp.8-9
• /
• 2018

3D printing has the unique advantage of the ability to customize freeform product even in small quantity. However, we need to select and apply the only necessary parts of it because of the high cost of the manufacturing technology. It is of critical importance in irregular-shaped curtain walls to ensure precision of construction as well as quality fo finish. Complex shape that have structural members at varying angles can have nodes of different shapes making it unfeasible to construct using a general node connection detail. Therefore, this study aims to utilize smart node system using 3D printing as a solution to complex irregular-shaped curtain wall design.

• 인터넷정보학회논문지
• /
• 제8권5호
• /
• pp.109-116
• /
• 2007

요즈음, 웹 서비스의 확산으로 인하여, 등록된 웹 서비스를 합성함으로써 복잡한 응용프로그램을 구축하는 것이 가능하다. 이러한 추세는 오늘날 서비스 지향의 컴퓨팅 환경에 있어서 합성된 웹 서비스의 서비스 품질 보장을 중요한 문제로 대두시키고 있다. 하지만 주어진 서비스 품질 보장을 만족하는 전역적 최적화된 웹 서비스의 합성은 NP-hard한 문제로 분류된다. 본 논문에서는 이러한 문제를 해결하기 위하여, K-way Super node 접근법을 제시하고 실험 결과를 통하여 이의 효과를 보인다.

• Steel and Composite Structures
• /
• 제33권6호
• /
• pp.767-776
• /
• 2019

In this article, a simple and robust multi-objective assessment method to control design angles and node positions connected among steel outrigger truss members is proposed to approve both structural safety and economical cost. For given outrigger member layouts, the present method utilizes general-purpose prototypes of outrigger members, having resistance to withstand lateral load effects directly applied to tall buildings, which conform to variable connecting node and design space deposition. Outrigger layouts are set into several initial design conditions of height to width of an arbitrary given design space, i.e., variable design space. And then they are assessed in terms of a proposed multi-objective function optimizing both minimal total displacement and material quantity subjected to design impact factor indicating the importance of objectives. To evaluate the proposed multi-objective function, an analysis model uses a modified Maxwell-Mohr method, and an optimization model is defined by a ground structure assuming arbitrary discrete straight members. It provides a new robust assessment model from a local design point of view, as it may produce specific optimal prototypes of outrigger layouts corresponding to arbitrary height and width ratio of design space. Numerical examples verify the validity and robustness of the present assessment method for controlling prototypes of outrigger truss members considering a multi-objective optimization achieving structural safety and material cost.