• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.293-298
• /
• 2010

The key of USN(Ubiquitous Sensor Network) technology is low power wireless communication technology and proper resource allocation technology for efficient routing. The distinguished resource allocation method is needed for efficient routing in sensor network. To solve this problems, we propose an algorithm that can be adopted in USN with making up for weak points of PQ and WRR in this paper. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class in sensor network. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.10
• /
• pp.1531-1536
• /
• 2022

This paper considers a problem to find a set of intervals containing all the points for the given n points and m intervals on a line, This is a special case of the set cover problem, well known as an NP-hard problem. As optimization criteria of the problem, there are minimizing the number of intervals to cover the points, maximizing the number of points each of which is covered by exactly one interval, and so on. In this paper, the intervals have weights and the sum of weights of intervals to cover a point is defined as a membership of the point. We will study the problem to find an interval cover minimizing the maximum of memberships of points. Using the dynamic programming method, we provide an O(m²)-time algorithm to improve the time complexity O(nm log n) given in the previous work.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2997-3009
• /
• 1998

독자-필자 문제(readers-writers problem)를 위한 기존의 스케쥴링 정책들은 대부분 독자나 필자 중 어느 한 쪽에 편향된 처리 성향을 가지고 있기 때문에 응답 시간이나 처리량, 둘 중 하나의 성능이 상당히 좋지 않은 특성이 있다. 본 논문에서는 이러한 문제를 개선하고자 새로룬 동적 스케쥴링 정책인 CAP(Counter-based Adaptive Priority)을 제안한다. CAP은 동시에 수행될 수 없는 필자에게 가중치를 주는 기법과 소수의 독자를 무작정 지연시키는 것을 막기 위한 에이징(aging) 기법을 동적으로 결합하여 사용하고 있다. CAP은 기는(starvation) 문제를 가지고 있지 않으며 주어진 상황에 동적으로 대응하는 능력을 가지고 있기 때문에 처리량과 응답 시간 모두 FCFS에 비하여 더 우수하다. 제안된 정책에 대한 효과성을 입증하기 위하여 세마포어 기반의 해법을 제시하고 사건-기반 시뮬레이션을 사용하여 기존의 정책들과 성능을 비교하였다.

• The KIPS Transactions:PartB
• /
• v.8B no.4
• /
• pp.327-334
• /
• 2001

본 논문에서는 기울기하강과 동적터널링이 조합된 학습알고리즘의 다층신경망을 이용한 고신회성의 회귀분석 모델을 제안하였다. 기울기하강은 빠른 수렴속도의 최적화가 가능하도록 하기 위함이고, 동적터널링은 국소최적해를 만났을 때 이를 벗어난 새로운 연결가중치를 설정하여 전역최적해로 수렴되도록 하기 위함이다. 또한 대용량의 입력 데이터를 통계적으로 독립인 특징들의 집합으로 변환시키는 주요성분분석 기법의 속성을 살려 학습데이터의 차원을 감소시킴으로서 고차원의 학습데이터에 따른 회귀분석 모델의 제약도 동시에 해결하였다. 제안된 기법의 신경망을 3개의 독립변수 패턴을 가진 암모니아 제조공정문제와 10개의 독립변수 패턴을 가진 자동차 연비문제에 각각 적용하여 시뮬레이션한 결과, 기존의 역전과 알고리즘의 신경망이나 주요성분분석에 의한 차원을 감소시키지 않은 학습패턴을 이용한 신경망보다 각각 더욱 우수한 학습성능과 회귀성능이 있음을 확인할 수 있었다. 또한 학습패턴의 영평균 정규화로 회귀용 신경망의 성능을 더욱 더 개선하였다.

• The Journal of Korean Association of Computer Education
• /
• v.6 no.1
• /
• pp.29-39
• /
• 2003

In this paper we proposed dynamic adaptive model based on discrete probabilistic distribution functions and user's profile for web media systems(web based hypermedia systems). The model represented that the application domain is modelled using a weighted direct graph and the user's behaviour is modelled using a probabilistic approach that dynamically constructs a discrete probability distribution functions. The proposed probabilistic interpretation of the web media structure is used to characterize latent properties of the user's behaviour, which can be captured by tracking user's browsing activity. Using that distribution the system attempts to assign the user to the best profile that fits user's expectations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.3
• /
• pp.97-103
• /
• 2020

Linux Cgroups takes a fundamental role for sharing system resources among multiple containers on container-based cloud computing environment. Especially for I/O resource, Linux Cgroups supports a mechanism for sharing I/O bandwidth in proportion to I/O weight. However, the current mechanism of Linux Cgroups using BFQ I/O scheduler seriously degrades the I/O performance with high bandwidth storage device such as NVMe SSDs. In this paper, we proposed a new feedback based I/O bandwidth sharing scheme for Linux Cgroups which allocates I/O credits to containers according to I/O weights and adjusts the amount of credits to performance fluctuation of NVMe SSDs. The proposed scheme is implemented on Linux kernel 5.3 and evaluated. The evaluation results show that it can share the I/O bandwidth among multiple containers proportionally to I/O weights while improving I/O performance more than twice as high as the existing scheme.

• The KIPS Transactions:PartA
• /
• v.18A no.5
• /
• pp.215-224
• /
• 2011

In this paper, a mechanism connecting all weighted migration routes with minimum cost with EGOSST is proposed. Weighted migration routes may be converted to weighted input edges considered as not only traces but also traffics or trip frequencies of moving object on communication lines, roads or railroads. Proposed mechanism can be used in more wide and practical area than mechanisms considering only moving object traces. In our experiments, edge number, maximum weight for input edges, and detail level for grid are used as input parameters. The mechanism made connection cost decrease average 1.07% and 0.43% comparing with the method using weight minimum spanning tree and weight steiner minimum tree respectively. When grid detail level is 0.1 and 0.001, while each execution time for a connecting solution increases average 97.02% and 2843.87% comparing with the method using weight minimum spanning tree, connecting cost decreases 0.86% and 1.13% respectively. This shows that by adjusting grid detail level, proposed mechanism might be well applied to the applications where designer must grant priority to reducing connecting cost or shortening execution time as well as that it can provide good solutions of connecting migration routes with weights.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.299-310
• /
• 2001

In this paper, we study the methodology of distributing the requests of clients based on the state of real server in the LVS(Linux virtual server) clustering system. The WLC(weighted least connection) algorithm in the LVS cluster system is studied. The load distributing algorithm which assigns a weight into each real server is devised by considering the load of real servers. The load test is executed to estimate the load of real servers using a load generating tool. Throughout the result of the experiment, we suggest new load distributing algorithm based on the usage of physical memory of each real server. It is shown that the correction potentiality of new algorithm is somewhat better than that of the WLC algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.17-24
• /
• 2007

Critical practicality problems are cause to search the presentation and contents according to user request and purpose in previous internet system. Recently, there are a lot of researches about dynamic adaptable ontology based system. We designed ontology based educational system which uses discrete probability and user profile. This system provided advanced usability of contents by ontology and dynamic adaptive model based on discrete probability distribution function and user profile in ontology educational systems. This models represents application domain to weighted direction graph of dynamic adaptive objects and modeling user actions using dynamically approach method structured on discrete probability function. Proposed probability analysis can use that presenting potential attribute to user actions that are tracing search actions of user in ontology structure. This approach methods can allocate dynamically appropriate profiles to user.

• Proceedings of the KIPE Conference
• /
• 2017.11a
• /
• pp.157-158
• /
• 2017

본 논문에서는 고출력 리튬이온 18650 셀(cell) 200개를 사용하여 고출력 어플리케이션의 운용 범위와 동적 특성을 적용한 스크리닝 방법을 제안하였다. 전기적 특성 실험 기반 배터리 용량과 OCV(open circuit voltage)의 요소를 고려한 16개의 내부 파라미터를 추출하고 표준편차 기반 가중치를 선정하였다. 선정된 가중치를 각각의 요소에 적용하여 단위 셀의 대표 값을 결정하고 셀 스크리닝을 수행하였다. 기존의 스크리닝 기법과 제안된 스크리닝 기법을 200개의 단위 셀에 적용하여 두 기법의 차이를 비교 분석하였다.