• 제목/요약/키워드: Evolution Algorithm

검색결과 641건 처리시간 0.024초

Joint Subcarriers and Power Allocation with Imperfect Spectrum Sensing for Cognitive D2D Wireless Multicast

  • Chen, Yueyun;Xu, Xiangyun;Lei, Qun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권7호
    • /
    • pp.1533-1546
    • /
    • 2013
  • Wireless multicast is considered as an effective transmission mode for the future mobile social contact services supported by Long Time Evolution (LTE). Though wireless multicast has an excellent resource efficiency, its performance suffers deterioration from the channel condition and wireless resource availability. Cognitive Radio (CR) and Device to Device (D2D) are two solutions to provide potential resource. However, resource allocation for cognitive wireless multicast based on D2D is still a great challenge for LTE social networks. In this paper, a joint sub-carriers and power allocation model based on D2D for general cognitive radio multicast (CR-D2D-MC) is proposed for Orthogonal Frequency-Division Multiplexing (OFDM) LTE systems. By opportunistically accessing the licensed spectrum, the maximized capacity for multiple cognitive multicast groups is achieved with the condition of the general scenario of imperfect spectrum sensing, the constrains of interference to primary users (PUs) and an upper-bound power of secondary users (SUs) acting as multicast source nodes. Furthermore, the fairness for multicast groups or unicast terminals is guaranteed by setting a lower-bound number of the subcarriers allocated to cognitive multicast groups. Lagrange duality algorithm is adopted to obtain the optimal solution to the proposed CR-D2D-MC model. The simulation results show that the proposed algorithm improves the performance of cognitive multicast groups and achieves a good balance between capacity and fairness.

전역 임계치 벡터의 유전적 진화에 기반한 적응형 배경차분화 (Adaptive Background Subtraction Based on Genetic Evolution of the Global Threshold Vector)

  • 임양미
    • 한국멀티미디어학회논문지
    • /
    • 제12권10호
    • /
    • pp.1418-1426
    • /
    • 2009
  • 주어진 배경 이미지로부터 전경 객체를 분리하는 것을 목표로 하는 배경 차분화 기법에 관한 많은 연구가 있어 왔다. 최근에 발표된 몇 가지 통계 기반 배경 차분화 기법들은 동적인 환경에서 동작할 수 있을 정도로 안정된 성능을 보이는 것으로 보고되고 있다. 그러나 이들 기법은 일반적으로 매우 많은 계산 자원을 요구하며, 객체의 명확한 윤곽을 획득하는데 있어서는 아직 어려움이 있다. 본 논문에서는 점진적으로 변화하는 배경을 모델링하기 위해 복잡한 통계 기법을 적용하는 대신 간단한 이동-평균 기법을 사용한다. 또한 픽셀별로 할당되는 다중의 임계치 대신 유전자 학습에 의해 최적화되는 하나의 전역적 임계치를 사용한다. 유전자 학습을 위해 새로운 적합도 함수를 정의하여 학습하고 이를 이용하여 이미지의 분할 결과들을 평가한다. 본 논문의 시스템은 웹 카메라가 장착된 개인용 컴퓨터에서 구현하였으며, 실사 이미지들에 대한 실험 결과에 의하면 기존의 가우시안 믹스쳐 방식보다 우수한 성능을 보이는 것으로 나타났다.

  • PDF

함정 초기 설계 단계에서 레이아웃 설계 시 생존성을 고려하기 위한 간이 평가 방법과 애플리케이션 (A Simplified Assessment Method and Application for Consideration of Survivability in Spatial Layout Design at the Early Design Stage of Naval Vessels)

  • 정진욱;정용국;주수헌;신종계;김종철
    • 대한조선학회논문집
    • /
    • 제55권1호
    • /
    • pp.9-21
    • /
    • 2018
  • Survivability of naval vessels is defined as the ability to perform functions and missions in a combat environment. Survivability has close relationship with the spatial layout of naval vessels. In order to maximize survivability, it must be considered from the early stage of design. However the existing concept of survivability was intended to be applied to unit vessels. So it was not suitable for assessment of spatial layout results at the early stage of design. In this paper, a simplified assessment method which can evaluate the spatial layout considering the survivability in the early stage of design has been proposed. For this, assessment layers were defined on survivability components such as susceptibility, vulnerability, and recoverability. Assessment layers of each component were overlapped to deduce a survivability layer of spatial layout alternatives. In addition, the proposed method and optimization algorithm were used to derive optimal spatial layout alternatives considering survivability.

SURFACE RECONSTRUCTION FROM SCATTERED POINT DATA ON OCTREE

  • Park, Chang-Soo;Min, Cho-Hon;Kang, Myung-Joo
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제16권1호
    • /
    • pp.31-49
    • /
    • 2012
  • In this paper, we propose a very efficient method which reconstructs the high resolution surface from a set of unorganized points. Our method is based on the level set method using adaptive octree. We start with the surface reconstruction model proposed in [20]. In [20], they introduced a very fast and efficient method which is different from the previous methods using the level set method. Most existing methods[21, 22] employed the time evolving process from an initial surface to point cloud. But in [20], they considered the surface reconstruction process as an elliptic problem in the narrow band including point cloud. So they could obtain very speedy method because they didn't have to limit the time evolution step by the finite speed of propagation. However, they implemented that model just on the uniform grid. So they still have the weakness that it needs so much memories because of being fulfilled only on the uniform grid. Their algorithm basically solves a large linear system of which size is the same as the number of the grid in a narrow band. Besides, it is not easy to make the width of band narrow enough since the decision of band width depends on the distribution of point data. After all, as far as it is implemented on the uniform grid, it is almost impossible to generate the surface on the high resolution because the memory requirement increases geometrically. We resolve it by adapting octree data structure[12, 11] to our problem and by introducing a new redistancing algorithm which is different from the existing one[19].

The Development of Modularized Post Processing GPS Software Receiving Platform using MATLAB Simulink

  • Kim, Ghang-Ho;So, Hyoung-Min;Jeon, Sang-Hoon;Kee, Chang-Don;Cho, Young-Su;Choi, Wansik
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제9권2호
    • /
    • pp.121-128
    • /
    • 2008
  • Modularized GPS software defined radio (SDR) has many advantages of applying and modifying algorithm. Hardware based GPS receiver uses many hardware parts (such as RF front, correlators, CPU and other peripherals) that process tracked signal and navigation data to calculate user position, while SDR uses software modules, which run on general purpose CPU platform or embedded DSP. SDR does not have to change hardware part and is not limited by hardware capability when new processing algorithm is applied. The weakness of SDR is that software correlation takes lots of processing time. However, in these days the evolution of processing power of MPU and DSP leads the competitiveness of SDR against the hardware GPS receiver. This paper shows a study of modulization of GPS software platform and it presents development of the GNSS software platform using MATLAB Simulink™. We focus on post processing SDR platform which is usually adapted in research area. The main functions of SDR are GPS signal acquisition, signal tracking, decoding navigation data and calculating stand alone user position from stored data that was down converted and sampled intermediate frequency (IF) data. Each module of SDR platform is categorized by function for applicability for applying for other frequency and GPS signal easily. The developed software platform is tested using stored data which is down-converted and sampled IF data file. The test results present that the software platform calculates user position properly.

3GPP LTE 하향링크 시스템의 초기 셀 탐색기 SSS 검출 시 복잡도 최소화를 위한 CP 길이 선 결정 알고리즘 (Complexity Reduced CP Length Pre-decision Algorithm for SSS Detection at Initial Cell Searcher of 3GPP LTE Downlink System)

  • 김영범;김종훈;장경희
    • 한국통신학회논문지
    • /
    • 제34권9A호
    • /
    • pp.656-663
    • /
    • 2009
  • 3GPP (3rd Generation Partnership Project) LTE (Long Term Evolution) 시스템의 하양링크에서는 초기 동기화 및 셀 탐색 과정을 수행하기 위해 PSS (primary synchronization signal) 와 SSS (secondary synchronization signal) 시퀀스를 사용한다. 단말기는 PSS를 이용하여 슬롯 타이밍과 주파수 동기, 그리고 셀 ID를 획득한 후 SSS를 검출해야 하는데, 3GPP LTE에서 지원되는 2 종류의 CP (Cyclie Prefix) 길이로 인해 2번의 FFT를 수행하여 SSS reference 신호와의 cross-correlation을 이용해 무선 프라밍 타이밍과 셀 그룹 ID를 획득한다. 본 논문에서는 단말기의 셀 탐색기에서 SSS 검출 시 복잡도를 최소화하기 위해 extended CP로 전송한 경우 CP 길이를 선 결정하여 FFT와 cross-correlation의 계산 복잡도를 최대 50%까지 감소시키는 알고리즘을 제안한다. 컴퓨터 모의실험을 통해 매우 작은 성능 열화를 가지면서, 복잡도는 크게 감소하는 결과를 확인할 수 있었다.

Free Surface Flow in a Trench Channel Using 3-D Finite Volume Method

  • Lee, Kil-Seong;Park, Ki-Doo;Oh, Jin-Ho
    • 한국수자원학회논문집
    • /
    • 제44권6호
    • /
    • pp.429-438
    • /
    • 2011
  • In order to simulate a free surface flow in a trench channel, a three-dimensional incompressible unsteady Reynolds-averaged Navier-Stokes (RANS) equations are closed with the ${\kappa}-{\epsilon}$ model. The artificial compressibility (AC) method is used. Because the pressure fields can be coupled directly with the velocity fields, the incompressible Navier-Stokes (INS) equations can be solved for the unknown variables such as velocity components and pressure. The governing equations are discretized in a conservation form using a second order accurate finite volume method on non-staggered grids. In order to prevent the oscillatory behavior of computed solutions known as odd-even decoupling, an artificial dissipation using the flux-difference splitting upwind scheme is applied. To enhance the efficiency and robustness of the numerical algorithm, the implicit method of the Beam and Warming method is employed. The treatment of the free surface, so-called interface-tracking method, is proposed using the free surface evolution equation and the kinematic free surface boundary conditions at the free surface instead of the dynamic free surface boundary condition. AC method in this paper can be applied only to the hydrodynamic pressure using the decomposition into hydrostatic pressure and hydrodynamic pressure components. In this study, the boundary-fitted grids are used and advanced each time the free surface moved. The accuracy of our RANS solver is compared with the laboratory experimental and numerical data for a fully turbulent shallow-water trench flow. The algorithm yields practically identical velocity profiles that are in good overall agreement with the laboratory experimental measurement for the turbulent flow.

An Efficient Channel Selection and Power Allocation Scheme for TVWS based on Interference Analysis in Smart Metering Infrastructure

  • Huynh, Chuyen Khoa;Lee, Won Cheol
    • Journal of Communications and Networks
    • /
    • 제18권1호
    • /
    • pp.50-64
    • /
    • 2016
  • Nowadays, smart meter (SM) technology is widely effectively used. In addition, power allocation (PA) and channel selection (CS) are considered problems with many proposed approaches. In this paper, we will suggest a specific scenario for an SM configuration system and show how to solve the optimization problem for transmission between SMs and the data concentrator unit (DCU), the center that collects the data from several SMs, via simulation. An efficient CS with PA scheme is proposed in the TV white space system, which uses the TV band spectrum. On the basic of the optimal configuration requirements, SMs can have a transmission schedule and channel selection to obtain the optimal efficiency of using spectrum resources when transmitting data to the DCU. The optimal goals discussed in this paper are the maximum capacity or maximum channel efficiency and the maximum allowable power of the SMs used to satisfy the quality of service without harm to another wireless system. In addition, minimization of the interference to the digital television system and other SMs is also important and needs to be considered when the solving coexistence scenario. Further, we propose a process that performs an interference analysis scheme by using the spectrum engineering advanced Monte Carlo analysis tool (SEAMCAT), which is an integrated software tool based on a Monte-Carlo simulation method. Briefly, the process is as follows: The optimization process implemented by genetic evolution optimization engines, i.e., a genetic algorithm, will calculate the best configuration for the SM system on the basis of the interference limitation for each SM by SEAMCAT in a specific configuration, which reaches the solution with the best defined optimal goal satisfaction.

객체지향 소프트웨어의 재구성을 위한 클래스계층 구조의 평탄화 (Flattening Class Hierarchy for Reorganization of Object-Oriented Software)

  • 황석형;양해술;박정호
    • 정보처리학회논문지D
    • /
    • 제8D권6호
    • /
    • pp.853-860
    • /
    • 2001
  • 최근의 객체지향 소프트웨어개발에서는 설계 및 유지보수와 관련된 많은 문제점들을 해결하기 위하여 클래스를 재설계하거나 클래스계층구조를 재구성하는 등 객체지향 소프트웨어에 대한 일련의 재이용 및 재구성기법이 사용되고 있다. 본 논문에서는 클래스계층구조의 재구성에 관한 정형적인 이론을 제공함으로써 클래스계층구조의 재구성에 관하여 보다 수월하게 이해하고 적용할 수 있도록 하였다. 구체적으로 본 논문에서는 객체지향 소프트웨어의 개발에 있어서 주요 골격이 되는 클래스계층구조를 평탄화시킨 형태로 정의한 평탄화된 클래스계층구조를 소개하고, 임의의 클래스계층구조를 평탄화된 형태로 변형시키기 위한 알고리즘을 제안하였다. 클래스계층구조를 평탄화함으로써 클래스계층구조상의 계승 및 집약관계가 각 인스턴스들에게 어떻게 사상되는가를 수월하게 파악할 수 있으며, 주어진 클래스계층구조로부터 생성가능한 객체를 그대로 유지보존할 수 있는 평탄화된 형태의 새로운 클래스계층구조를 구축할 수 있다. 평탄화된 클래스계층구조는 클래스계층구조를 재구성하여 객체지향 소프트웨어를 점증적으로 변화 발전시키거나 재이용함에 있어서 기초를 제공하는 등 중요한 역할을 수행한다.

  • PDF

최적 적재를 위한 컨테이너 시큐어링 시스템 개발에 관한 연구 (A Study on Container Securing System for Optimum Arrangement)

  • 신상훈
    • 한국항해항만학회지
    • /
    • 제27권4호
    • /
    • pp.397-402
    • /
    • 2003
  • 컨테이너 시큐어링 시스템은 컨테이너 운반선 상갑판에 적재되는 컨테이너의 배치 설계를 위한 시스템이다. 컨테이너의 배치는 각 선급의 가이드라인에 기초하여 설계되어지며, 주어진 배치에 따른 반력들과 변력의 한계값을 제공하고 있다. 컨테이너 설계를 위해서는 컨테이너 구속 교량(lashing bridge)과 수직 구속 장치(vertical lashing) 등을 고려해야 하며, 최대 수직 중량 중심(vertical center of gravity, VCG)과 최대 화물 중량(stack weight)을 갖는 배치안을 제시할 수 있어야 한다. 본 연구에서는 이를 위한 평형방정식을 정립하였으며, 배치안 계산을 위해 등식 제한조건(equality constraint)을 처리할 수 있는 최적화 알고리즘을 적용하여 새로운 컨테이너 시큐어링 시스템을 개발하였다. 개발된 시스템은 컨테이너 배치 설계 시간을 크게 줄여주며, 설계자가 원하는 배치 설계안을 제시해 준다.