• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.254-260
• /
• 2005

In the guaranteed service, a real-time scheduling algorithm must achieve both high level of network utilization and scalable implementation. Here, network utilization indicates the number of admitted real-time sessions. Unfortunately, existing scheduling algorithms either are lack of scalable implementation or can achieve low network utilization. For example, scheduling algorithms based on time-stamps have the problem of O(log N) scheduling complexity where N is the number of sessions. On the contrary, round-robin algorithms require O(1) complexity. but can achieve just a low level of network utilization. In this paper, we propose a scheduling algorithm that can achieve high network utilization without losing scalability. The proposed algorithm is a Hierarchical Round-Robin (H-RR) algorithm that utilizes multiple rounds with different interval sizes. It provides latency bounds similar to those by Packet-by-Packet Generalized Processor Sharing (PGPS) algorithm using a sorted-Priority queue. However, H-RR requires a constant time for implementation.

• Journal of Internet Computing and Services
• /
• v.7 no.5
• /
• pp.43-57
• /
• 2006

Next-generation mobile communication systems evolve in the form of high speed data transmission along with integration of wired-wireless network. Therefore, it needs researches on integrating service to heterogeneous networks to offer high speed data transmission and various services while supporting user mobility. In existing studies, heterogeneous networks are linked to single core network separatively, Since vertical handoff between heterogeneous networks leads to some delay, packets may be lost during vertical handoff. To solve this problem, this paper proposes an hierarchically integrated network architecture considering the characteristics of CDMA2000, WiBro, and WLAN. The hierarchically integrated networks are overlaid according to coverage of each network. Therefore, the proposed architecture can minimize handoff delay and packet loss. In addition, this paper proposes an integrated framework for next generation mobile communication networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.12
• /
• pp.2800-2807
• /
• 2012

An ad-hoc wireless network provides self-organizing data networking while they are routing of packets among themselves. Typically multi-hop and control packets overhead affects the change of route of transmission. There are numerous routing protocols have been developed for ad hoc wireless networks as the size of the network scale. Hence the scalable routing protocol would be needed for energy efficient various network routing environment conditions. The number of depth or layer of hierarchical clustering nodes are analyzed the different clustering structure with topology in this paper. To estimate the energy efficient number of cluster layer and energy dissipation are studied based on distributed homogeneous spatial Poisson process with context-awareness nodes condition. The simulation results show that CACHE-R could be conserved the energy of node under the setting the optimal layer given parameters.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.269-273
• /
• 2000

This paper proposes a algorithm for several mobile robots navigation. There are three parts in this algorithm. First part generates robots turning angle and moving distance for goal approaching, sencond part generates robots avoiding angle and avoiding distance for static obstacles or other robots and third part adjust between robots moving distance and avoiding distance. Most simulation results of this algorithm are very effective for several mobile robots traveling in unknown field.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1121-1124
• /
• 1993

We propose two-degree-of-freedom fuzzy neural network control systems. It has a hierarchical structure of two sets of control knowledge, thus it is easy to extract and refine fuzzy rules before and after the operation has started, and the number of fuzzy rules is reduced. In addition an example application of automatic vehicle operation is reported and its usefulness is shown simulation.

• International Journal of Advanced Culture Technology
• /
• v.6 no.4
• /
• pp.262-265
• /
• 2018

Deep learning, a sub-field of machine learning changing the prospects of artificial intelligence (AI) because of its recent advancements and application in various field. Deep learning deals with algorithms inspired by the structure and function of the brain called artificial neural networks. This works reviews basic architecture and recent advancement of deep structured learning. It also describes contemporary applications of deep structured learning and its advantages over the treditional learning in artificial interlligence. This study is useful for the general readers and students who are in the early stage of deep learning studies.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.248-249
• /
• 2018

본 논문에서는 고해상도 자궁 내막 세포들을 대상으로 정상세포와 이상세포들을 구별하기 위한 알고리즘을 제안한다. 구체적으로 계층적 구조를 갖는 Convolutional Neural Network (CNN) 모델을 기반으로 네 가지 세포들을 구분하는 알고리즘을 제안한다. 이 연구에서 고해상도 영상을 분류하면서도 복잡도 증가를 막기 위해 효율적인 전처리 과정을 사용하였다. 다양한 컴퓨터 실험을 통하여 제안하는 기술을 사용할 때, 인식률이 향상되는 것을 확인할 수 있었다.

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.11-15
• /
• 2018

The application of Wireless Sensor Networks requires a wise utilization of limited energy resources. Therefore, a wide range of routing protocols with a motivation to prolong the lifetime of a network has been proposed in recent years. Hierarchical clustering based protocols have become an object of a large number of studies that aim to efficiently utilize the limited energy of network components. In this paper, the effect of mismatch in parameter estimation is discussed to evaluate the robustness of a distanced based algorithm called distributed clustering protocol in homogeneous and heterogeneous environment. For quantitative analysis, performance simulations for this protocol are carried out in terms of the network lifetime which is the main criteria of efficiency for the energy limited system.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.45 no.4
• /
• pp.602-611
• /
• 1996

In this paper, radial basis function networks with two hidden layers, which employ the K-means clustering method and the hierarchical training, are proposed for improving the short-term predictability of chaotic time series. Furthermore the recursive training method of radial basis function network using the recursive modified Gram-Schmidt algorithm is proposed for the purpose. In addition, the radial basis function networks trained by the proposed training methods are compared with the X.D. He A Lapedes's model and the radial basis function network by nonrecursive training method. Through this comparison, an improved radial basis function network for predicting chaotic time series is presented. (author). 17 refs., 8 figs., 3 tabs.

• Journal of Sensor Science and Technology
• /
• v.19 no.5
• /
• pp.369-374
• /
• 2010

It is important to efficiently elect the cluster header in Hierarchical Sensor Network, because it largely affects on the lifetime of the network. Therefore, recent research is focused on the lifetime extension of the whole network for efficient cluster header election. In this paper, we propose the new Cluster Header Election Scheme in which the cluster is divided into Group considering Distance from Upper Node, and a cluster header will be elected by node density of the Group. Also, we evaluate the performance of this scheme, and show that this proposed scheme improves network lifetime in Zigbee environment.