• 제목/요약/키워드: computational scalability

검색결과 65건 처리시간 0.049초

An Optimization Approach to Data Clustering

  • Kim, Ju-Mi;Olafsson, Sigurdur
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
    • /
    • pp.621-628
    • /
    • 2005
  • Scalability of clustering algorithms is critical issues facing the data mining community. This is particularly true for computationally intense tasks such as data clustering. Random sampling of instances is one possible means of achieving scalability but a pervasive problem with this approach is how to deal with the noise that this introduces in the evaluation of the learning algorithm. This paper develops a new optimization based clustering approach using an algorithms specifically designed for noisy performance. Numerical results illustrate that with this algorithm substantial benefits can be achieved in terms of computational time without sacrificing solution quality.

  • PDF

스케일러블 비디오 부호화와 AT-DMB (Scalable Video Coding and its Application to AT-DMB)

  • 김재곤;김진수;최해철;강정원
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2008년도 하계종합학술대회
    • /
    • pp.45-48
    • /
    • 2008
  • This paper presents a brief overview of scalable video coding (SVC) with a focus on spatial scalability and its application to Advanced Terrestrial-DMB (AT-DMB). By adopting SVC with two spatial-layers and hierarchical modulation, AT-DMB provides standard definition (SD)-level video while maintaining compatability with the existing CIF-level video. In this paper, we suggest a layer-configuration and coding parameters of SVC which are well suit for an AT-DMB system. In order to reduce extremely large encoding time resulted by an exhaustive search of a macroblock coding mode in spatial scalability, we propose a fast mode decision method which excludes redundant modes in each layer. It utilizes the mode distribution of each layer and their correlations. Experimental results show that a simplified encoding model with the method reduces the computational complexity significantly with negligible coding loss.

  • PDF

전이학습을 활용한 군집제어용 강화학습의 효율 향상 방안에 관한 연구 (Study on Enhancing Training Efficiency of MARL for Swarm Using Transfer Learning)

  • 이슬기;김권일;윤석민
    • 한국군사과학기술학회지
    • /
    • 제26권4호
    • /
    • pp.361-370
    • /
    • 2023
  • Swarm has recently become a critical component of offensive and defensive systems. Multi-agent reinforcement learning(MARL) empowers swarm systems to handle a wide range of scenarios. However, the main challenge lies in MARL's scalability issue - as the number of agents increases, the performance of the learning decreases. In this study, transfer learning is applied to advanced MARL algorithm to resolve the scalability issue. Validation results show that the training efficiency has significantly improved, reducing computational time by 31 %.

MMOG의 확장성을 위한 클라우드 컴퓨팅 기반의 P2P 시스템 (P2P Systems based on Cloud Computing for Scalability of MMOG)

  • 김진환
    • 한국인터넷방송통신학회논문지
    • /
    • 제21권4호
    • /
    • pp.1-8
    • /
    • 2021
  • 전세계 수많은 사용자들이 특정 실시간 가상 환경을 공유하는 MMOG(Massive Multi-player On-line Game)를 지원하고자 본 논문에서 P2P(Peer-to-Peer)와 클라우드 컴퓨팅의 기술적 장점을 결합하는 기법을 제시한다. 본 논문에서 제시된 클라우드 컴퓨팅 기반의 P2P 시스템은 사용자 수가 급증할 경우에도 사용자 자원을 기반 구조에 추가함으로써 준수한 수준의 확장성을 제공할 수 있다. 또한 이 시스템은 사용자들의 처리 능력을 활용함으로써 클라우드에 있는 서버의 부하 즉 상당한 컴퓨팅 능력과 통신량을 절감할 수 있다. 본 논문에서 MMOG의 확장성을 위한 클라우드 컴퓨팅 기반의 P2P 시스템의 개념과 기본적 구조가 기술된다. 대규모 사용자 집단에 대한 경제적 비용과 서비스 품질의 규모를 고려하는 이 구조가 실현되기 위해서는 효율적이고 효과적인 자원의 공급과 부하의 배분이 반드시 필요하다. 시뮬레이션 결과 제시된 P2P 시스템은 동시에 실행되는 사용자들의 수가 증가할 때 클라우드와 사용자 제공 자원의 양을 제어함으로써 사용자들의 충분한 대역폭을 활용하는 반면 서버의 대역폭을 감소시킬 수 있는 것으로 나타났다.

Computational Grid 환경에서 RFID 프라이버시 보호를 위한 확장성 있는 태그 판별 처리 모델 (Tag Identification Process Model with Scalability for Protecting Privacy of RFID on the Computational Grid)

  • 신명숙;김충원;이준
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2008년도 춘계종합학술대회 A
    • /
    • pp.245-248
    • /
    • 2008
  • 최근 RFID 시스템의 채택이 다양한 분야에서 빠르게 진행되고 있다. 그러나 RFID 시스템의 대중화를 위해서는 RFID 태그의 정보를 무단으로 획득함으로써 발생할 수 있는 프라이버시 침해 문제를 해결해야 한다. 이 문제를 해결하기 위해서 기존 연구들 중에서 가장 안전한 M. Ohkubo 등의 Hash-Chain 기법이 있다. 그러나 이 기법은 태그를 판별할 때 엄청난 태그 수의 증가로 인해 막대한 계산 능력을 요구하는 문제점이 있다. 따라서 본 논문에서는 프라이버시 보호를 유지하면서 태그판별시간 절감을 위해서 그리드 환경으로의 이식과 노드별로 m/k개의 SP를 분할하는 균등분할 알고리즘을 적용한 태그 판별 처리 모델을 제안한다. 제안 모델을 그리드 환경에서 동시에 수행할 수 있다면 이상적인 경우 태그를 판별하는 시간은 1/k로 감소한다.

  • PDF

공간 웨이블릿 변환의 복잡도를 줄인 스케일러블 비디오 코딩에 관한 연구 (Scalable Video Coding with Low Complex Wavelet Transform)

  • 박성호;김원하;정세윤
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
    • /
    • pp.298-300
    • /
    • 2004
  • In the decoding process of interframe wavelet coding, the inverse wavelet transform requires huge computational complexity. However, the decoder may need to be used in various devices such as PDAs, notebooks, PCs or set-top Boxes. Therefore, the decoder's complexity should be adapted to the processor's computational power. A decoder designed in accordance with the processor's computational power would provide optimal services for such devices. So, it is natural that the complexity scalability and the low complexity codec are also listed in the requirements for scalable video coding. In this contribution, we develop a method of controlling and lowering the complexity of the spatial wavelet transform while sustaining almost the same coding efficiency as the conventional spatial wavelet transform. In addition, the proposed method may alleviate the ringing effect for certain video data.

  • PDF

빌딩 자동화를 위한 무선 센서 네트워크 라우팅 프로토콜 (Routing Algorithm of Wireless Sensor Network for Building Automation System)

  • 노덕래;홍승호
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2009년도 정보 및 제어 심포지움 논문집
    • /
    • pp.45-47
    • /
    • 2009
  • Wireless Sensor Network(WSN) has been very popular in unattended surveillance systems recently. For Applying WSN into Building Automation system(BAS), a novel hierarchial network structure and static routing algorithm which eliminates the scalability limitation of Zigbee are proposed in this paper. The static routing algorithm relying on the hierarchial network address reduces the computational complexity to a great extent and has a real-time performance which satisfies urgent applications well.

  • PDF

슈퍼컴퓨팅 기반의 대규모 구조해석을 위한 전/후처리 시스템 개발 (Development of Pre- and Post-processing System for Supercomputing-based Large-scale Structural Analysis)

  • 김재성;이상민;이재열;정희석;이승민
    • 한국CDE학회논문집
    • /
    • 제17권2호
    • /
    • pp.123-131
    • /
    • 2012
  • The requirements for computational resources to perform the structural analysis are increasing rapidly. The size of the current analysis problems that are required from practical industry is typically large-scale with more than millions degrees of freedom (DOFs). These large-scale analysis problems result in the requirements of high-performance analysis codes as well as hardware systems such as supercomputer systems or cluster systems. In this paper, the pre- and post-processing system for supercomputing based large-scale structural analysis is presented. The proposed system has 3-tier architecture and three main components; geometry viewer, pre-/post-processor and supercomputing manager. To analyze large-scale problems, the ADVENTURE solid solver was adopted as a general-purpose finite element solver and the supercomputer named 'tachyon' was adopted as a parallel computational platform. The problem solving performance and scalability of this structural analysis system is demonstrated by illustrative examples with different sizes of degrees of freedom.

Computation Controllable Mode Decision and Motion Estimation for Scalable Video Coding

  • Zheng, Liang-Wei;Li, Gwo-Long;Chen, Mei-Juan;Yeh, Chia-Hung;Tai, Kuang-Han;Wu, Jian-Sheng
    • ETRI Journal
    • /
    • 제35권3호
    • /
    • pp.469-479
    • /
    • 2013
  • This paper proposes an efficient computation-aware mode decision and search point (SP) allocation algorithm for spatial and quality scalabilities in Scalable Video Coding. In our proposal, a linear model is derived to allocate the computation for macroblocks in enhancement layers by using the rate distortion costs of the base layer. In addition, an adaptive SP decision algorithm is proposed to decide the number of SPs for motion estimation under the constraint of the allocated computation. Experiment results demonstrate that the proposed algorithm allocates the computation resource efficiently and outperforms other works in rate distortion performance under the same computational availability constraint.

제약이론을 활용한 재구성가능 생산시스템의 레이아웃 설계 (Design of a System Layout for Reconfigurable Manufacturing System with Theory of Constraints)

  • 쿠르니아디 케지아 아만다;류광열
    • 한국CDE학회논문집
    • /
    • 제22권2호
    • /
    • pp.129-140
    • /
    • 2017
  • This paper presents a systematic approach for design of timely and proper layouts of a manufacturing system facilitating reconfigurability, referred to as a reconfigurable manufacturing system. A proper methodology for design of a system layout is required for reconfiguration planning - adding or removing machines for supplying the exact capacity needed to fulfill market demands, as well as minimizing the cost of adding new machines. In this paper, theory of constraints is used to make reconfiguration manufacturing systems more cost-effective and efficiency. The proposed approach is validated by using a real industrial case. This paper suggests that the proposed study should be performed concurrently with the design of a new manufacturing system.