• Title/Summary/Keyword: Balanced Processing of Information

Search Result 92, Processing Time 0.025 seconds

Customized AI Exercise Recommendation Service for the Balanced Physical Activity (균형적인 신체활동을 위한 맞춤형 AI 운동 추천 서비스)

  • Chang-Min Kim;Woo-Beom Lee
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.23 no.4
    • /
    • pp.234-240
    • /
    • 2022
  • This paper proposes a customized AI exercise recommendation service for balancing the relative amount of exercise according to the working environment by each occupation. WISDM database is collected by using acceleration and gyro sensors, and is a dataset that classifies physical activities into 18 categories. Our system recommends a adaptive exercise using the analyzed activity type after classifying 18 physical activities into 3 physical activities types such as whole body, upper body and lower body. 1 Dimensional convolutional neural network is used for classifying a physical activity in this paper. Proposed model is composed of a convolution blocks in which 1D convolution layers with a various sized kernel are connected in parallel. Convolution blocks can extract a detailed local features of input pattern effectively that can be extracted from deep neural network models, as applying multi 1D convolution layers to input pattern. To evaluate performance of the proposed neural network model, as a result of comparing the previous recurrent neural network, our method showed a remarkable 98.4% accuracy.

Clustering Triangular Routing Protocol in Wireless Sensor Network (무선 센서 네트워크에서 삼각 클러스터링 라우팅 기법)

  • Nurhayati, Nurhayati;Lee, Kyung Oh;Choi, Sung Hee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.913-916
    • /
    • 2010
  • Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. In BCDCP, all sensors send data from CH (Cluster Head) and then to BS (Base Station). BCDCP works well in small-scale network but in large scale network it is not appropriated since it uses much energy for long distance wireless communication. We propose a routing protocol - Triangular Clustering Routing Protocol (TCRP) - to prolong network life time through the balanced energy consumption. TCRP selects cluster head of triangular shape. The sensor field is divided into energy level and in every level we choose one node as a gate node. This gate node collects data and sends it to the leader node. Finally the leader node sends the aggregated data to the BS. We show TCRP outperforms BCDCP with several experiments.

A Study on Enhancement of Digital Image Performance Using Dual Tree Wavelet Transformation in Non-separable Image Processing (비분리 영상처리에서 이중 트리 웨이브렛 변환을 사용한 디지털 영상 성능 개선에 관한 연구)

  • Lim, Joong-Hee;Jee, Inn-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.1
    • /
    • pp.65-74
    • /
    • 2012
  • In this paper, we explore the application of 2-D dual-tree discrete wavelet transform (DDWT), which is a directional and redundant transform, for image coding. DDWT introduces limited redundancy and allows the transform to provide approximate shift invariance and directionally selective filters while preserving the usual properties of perfect reconstruction and computational efficiency with good well-balanced frequency responses. Also, quincunx lattice yields a non separable 2D-wavelet transform, which is also symmetric in both horizontal and vertical direction. And non-separable wavelet transformation can generate sub-images of multiple degrees rotated versions. The proposed 2-D non-separable DDWT can provide efficient approximation for directional features of images schemes, such as edges and contours in images that are not aligned with the horizontal or vertical direction. Finally, non-separable image processing using DDWT services good performance.

K Partition-Based Even Wear-Leveling Policy for Flash Memory (K 분할 기반 플래시 메모리 균등소거 방법론)

  • Park Je-Ho
    • The KIPS Transactions:PartD
    • /
    • v.13D no.3 s.106
    • /
    • pp.377-382
    • /
    • 2006
  • Advantageous features of flash memory are stimulating its exploitation in mobile and ubiquitous related devices. The hardware characteristics of flash memory however place restrictions upon this current trend. In this paper, a cleaning policy for flash memory is proposed in order to decrease the necessary penally for recycling of memory minimizing the degradation of performance at the same time. The proposed cleaning algorithm is based on partitioning of candidate memory regions, to be reclaimed as free, into a number of groups. In addition, in order to improve the balanced utilization of the entire flash memory space in terms of 'wearing-out', a free segment selection algorithm is discussed. The impact of the proposed algorithms is evaluated through a number of experiments. Moreover, the composition of the optimal configuration featuring the proposed methods is tested through experiments.

A Parallel Video Encoding Technique for U-HDTV (U-HDTV를 위한 향상된 병렬 비디오 부호화 기법)

  • Jung, Seung-Won;Ko, Sung-Jea
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.1
    • /
    • pp.132-140
    • /
    • 2011
  • Ultra-High Definition Television (U-HDTV) is a promising candidate for the next generation television. Since the U-HDTV video signal requires a huge amount of data, parallel implementation of the U-HDTV compression system is highly demanding. In the conventional parallel video codec, a video is divided into sub-sequences and the sub-sequences are independently encoded. In this paper, for efficient parallel processing, we propose a pipelined encoding structure which exploits cross-correlation among the sub-sequences. The experimental results demonstrate that the proposed technique improves the coding efficiency and provides the sub-sequences of the balanced visual quality.

Enhancing Education Curriculum of Cyber Security Based on NICE (NICE 기반 사이버보안 교육커리큘럼 개선 연구)

  • Park, Wonhyung;Ahn, Seongjin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.7
    • /
    • pp.321-328
    • /
    • 2017
  • As the cyber threats become more sophisticated and intelligent, the cases of cyber-infringement accidents are rapidly increasing. As a result, awareness of the importance of cyber security professionals has led to many cyber security-related educational programs. These programs provided with education curriculum aimed because cyber security workforce and job-based cyber security education research are not properly done. In this study, we developed a new cyber security education curriculum that defines and reflects cyber security personnel and knowledge system. In this study is not composed solely of the education contents related to the defenses emphasized in the existing education curriculum, but developed education curriculum to train a professional and balanced cyber security manpower by adding education contents in the attack field.

Improving Performance of Large Sparse Linear System Solvers On Distributed Memory Systems By Asynchronous Algorithms (비동기 알고리즘을 이용한 분산 메모리 시스템에서의 초대형 선형 시스템 해법의 성능 향상)

  • Park, Pil-Seong;Sin, Sun-Cheol
    • The KIPS Transactions:PartA
    • /
    • v.8A no.4
    • /
    • pp.439-446
    • /
    • 2001
  • The main stream of parallel programming today is using synchronous algorithms, where processor synchronization for correct computation and workload balance are essential. Overall performance of the whole system is dependent upon the performance of the slowest processor, if workload is not well-balanced or heterogeneous clusters are used. Asynchronous iteration is a way to mitigate such problems, but most of the works done so far are for shared memory systems. In this paper, we suggest and implement a parallel large sparse linear system solver that improves performance on distributed memory systems like clusters by reducing processor idle times as much as possible by asynchronous iterations.

  • PDF

Adaptive Multi-class Segmentation Model of Aggregate Image Based on Improved Sparrow Search Algorithm

  • Mengfei Wang;Weixing Wang;Sheng Feng;Limin Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.2
    • /
    • pp.391-411
    • /
    • 2023
  • Aggregates play the skeleton and supporting role in the construction field, high-precision measurement and high-efficiency analysis of aggregates are frequently employed to evaluate the project quality. Aiming at the unbalanced operation time and segmentation accuracy for multi-class segmentation algorithms of aggregate images, a Chaotic Sparrow Search Algorithm (CSSA) is put forward to optimize it. In this algorithm, the chaotic map is combined with the sinusoidal dynamic weight and the elite mutation strategies; and it is firstly proposed to promote the SSA's optimization accuracy and stability without reducing the SSA's speed. The CSSA is utilized to optimize the popular multi-class segmentation algorithm-Multiple Entropy Thresholding (MET). By taking three METs as objective functions, i.e., Kapur Entropy, Minimum-cross Entropy and Renyi Entropy, the CSSA is implemented to quickly and automatically calculate the extreme value of the function and get the corresponding correct thresholds. The image adaptive multi-class segmentation model is called CSSA-MET. In order to comprehensively evaluate it, a new parameter I based on the segmentation accuracy and processing speed is constructed. The results reveal that the CSSA outperforms the other seven methods of optimization performance, as well as the quality evaluation of aggregate images segmented by the CSSA-MET, and the speed and accuracy are balanced. In particular, the highest I value can be obtained when the CSSA is applied to optimize the Renyi Entropy, which indicates that this combination is more suitable for segmenting the aggregate images.

A dual-link CC-NUMA System Tolerant to the Multiprogramming Environment (다중 프로그램 환경에 적합한 이중 연결 CC-NUMA 시스템)

  • Suh, Hyo-Joong
    • The KIPS Transactions:PartA
    • /
    • v.11A no.3
    • /
    • pp.199-206
    • /
    • 2004
  • Under the multiprogrammed situation, the performance of multiprocessor system is affected by the process allocation policy of the operating systems. The lowest communication cost can be achieved when the related processes positioned to the adjacent processors. While the effective allocation is quite difficult to the real situation, and the processing of the allocation policy consumes some computation time. The dual-ring CC-NUMA systems exhibit a quite performance difference according to the process a1location policy due to a lot of unbalanced memory transactions on the interconnection networks. In this paper, I propose a load balanced dual-link CC-NUMA system that does not requires the processes allocation policy. By the program-driven simulation results. the proposed system shows no remarkable difference according to the allocation policy while the dual-ring systems shows 10% performance improvement by the process allocation. In addition, the proposed system outperforms the dual~ring systems about 1.5 times.

Study on the Basic Ways for Propulsion of Land Consolidation Project -Laying Stress on Rural Integral Development (耕地整理事業의 推進 基本方向에 관한 調査硏究 -農村整備를 中心으로-)

  • Kim, Choul-Kee
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.34 no.2
    • /
    • pp.21-39
    • /
    • 1992
  • Many problems were found out the remarkable unbalance between paddy fields and up-land areas, or between plain and mountainous areas, unreasonable establishing of land consolidaton boundaries without consideration of rural development, lower leverl of construction technology of the roads and canals for agricultral use ad operation and maintenance of them by human power far apart from the ages of high technology, high information and free internationalisation, and too slow progress to overcome the weak agricultural circumstances etc. through the survey in the past executed land consolidation projects. The basic ways for solution of these problems for propulsion of land consolidation project through investigation are summarized as follows : 1. Land consolidation project should be executed to the direction of balanced regional development, laying stress on the upland and mountainous areas in order to carry out the agriculture effectively. 2. the acreage of land consolidation project to be conducted anually should be increased to overcome the serious underdeveloped agricultural development. 3. It should be developed to the way in accordance with the order of land use from the view point of rural integral development including the rural readjustment. 4. The level of the structures of road and canal, the size of standard lot and the grouping of land substitution should be to incraese the productivity of land and labour more than ever and reached to a degree in cope with the age of industrialization, information and free internationalisation. 5. The level of the management of agricultural water use and the maintenace of the various facilities should be developed to be automatization, remote control, central control and information processing instead human work. 6. Land substitution should take a measure of grouping method in accordance with the agricultural plan and farming organization, which can overcome high industrialized society in place of the substition by origin land. 7. Land consolidation project should be planned in order to fulfil a conservative function of ecosystem and resources together with improvement of land and labour productivity.

  • PDF