• Title/Summary/Keyword: 공간 복잡도

Search Result 1,901, Processing Time 0.027 seconds

Uniformity Evaluation of Elderly Hospital Outpatients' Waiting Space using Discrete Event Simulation (이산사건 시뮬레이션을 이용한 요양병원 외래부 대기공간 균일성 평가)

  • Yoon, So-Hee;Kim, Suk-Tae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.7
    • /
    • pp.490-499
    • /
    • 2017
  • In recent years, the introduction of complex systems analysis based on various variables has become more active in order to identify and analyze complex problems of Modern Society. Prediction of patients' spatial perception and usability according to the spatial arrangement of the outpatient department is a very important factor for providing high quality hospital service. For objective analysis, the standard program procedure and analysis index for the diseases of the elderly were prepared and the uniformity of the atmospheric space was evaluated through heat map analysis and quantitative analysis. In this study, 73 cells were installed and simulated to analyze the uniformity of the four alternatives according to the change of the arrangement of the medical care space, receiving space, and consultation space using the complex system analysis method for the nursing hospitals. The resulting density was derived. The results are as follows. 1)The layout of the reception space has the greatest influence on the total spatial density of the waiting space. 2) The uniformity of the waiting space can be increased by separating the examination space and the examination space. 3)The closer the location of the receiving space is from the entrance, the greater the density of the waiting space. Finally, this study applied discrete event simulation to the evaluation of uniformity of atmosphere space, and proved that the actor - based model can be utilized for utilization and evaluation as spatial analysis methodology.

A Study on Complexity Analysis of Extensible Profile Verification Software for Energy Storage System (에너지저장장치용 확장성 프로파일 검증 소프트웨어 복잡도 분석에 관한 연구)

  • Kwon, Hyeokyoung;Ryu, Youngsu;Park, Jaehong;Kwon, Kiwon
    • Journal of Internet Computing and Services
    • /
    • v.17 no.5
    • /
    • pp.59-65
    • /
    • 2016
  • Recently, a study has been progressed about the energy storage system for resolving energy shortage problems in the world. The energy storage system can maximize energy storage system's energy usage by monitoring and controlling about all energy infrastructures on energy network. However, compatibility problems among main components or devices of the energy storage system are obstacles to development of energy storage system products. An extensible profile and extensible profile verification software being able to verify the extensible profile have been required in order to resolve compatibility problems. In this paper, the study on complexity analysis for the extensible profile verification software for the energy storage system is performed. A XML based profile and C language structure based profile are used for analysis of the profile verification software. The complexity of complex verification structure that parses the XML based profile several times and simple verification structure that parses the C language structure based profile are analyzed and compared. Time complexity, space complexity, and cyclomatic complexity are used for complexity analysis. By using these complexity analysis, the study result that compares and analyzes the complexity of XML based and C language structure based profile verification software is presented.

공연장의 전기설비 시설지침(마지막회)

  • 배석명
    • Electric Engineers Magazine
    • /
    • v.264 no.8
    • /
    • pp.22-27
    • /
    • 2004
  • 공연장은 문화적 공간이기에 앞서 많은 사람이 동시에 운집하는 대규모 집회시설이며, 그 특성상 복잡한 내부 공간 및 다양한 용도로 인해 전기화재 등의 사고 발생시에는 재산피해는 물론 많은 인명피해가 우려되는 대표적인 다중이용시설중의 하나이다.<중략>

  • PDF

공연장의 전기설비 시설지침①

  • 배석명
    • Electric Engineers Magazine
    • /
    • v.255 no.11
    • /
    • pp.31-36
    • /
    • 2003
  • 공연장은 문화적 공간이기에 앞서 많은 사람이 동시에 운집하는 대규모 집회시설이며, 그 특성상 복잡한 내부 공간 및 다양한 용도로 인해 전기화재 등의 사고 발생시에는 재산피해는 물론 많은 인명피해가 우려되는 대표적인 다중이용시설중의 하나이다.

  • PDF

Fast Coding Mode Decision for MPEG-4 AVC|H.264 Scalable Extension (MPEG-4 AVC|H.264 Scalable Extension을 위한 고속 모드 결정 방법)

  • Lim, Sun-Hee;Yang, Jung-Youp;Jeon, Byeung-Woo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.6
    • /
    • pp.95-107
    • /
    • 2008
  • In this paper, we propose a fast mode decision method for temporal and spatial scalability to reduce computational complexity of mode decision that used to be computationally one of the most intensive processes of the MPEG-4 AVC|H.264 SE(Scalable Extension) encoding. For temporal scalability, we propose an early skip method and MHM(mode history map) method. The early skip method confines macroblock modes of backward and forward frames within selected a few candidates. The MHM method utilizes stored information of frames inside a GOP of lower levels for the decision of MHM at higher level. For the spatial scalability, we propose the method that uses a candidate mode according to the MHM method and adds the BL_mode as candidates. The proposed scheme reduces the number of candidate modes to reduce computational complexity in mode decision. The proposed scheme reduces total encoding time by about 52% for temporal scalability and 47% for spatial scalability without significant loss of RD performance.

Limited Constellation List Sphere Decoding (격자 제한 리스트 스피어 디코딩)

  • Jeon, Myeong-Woon;Lee, Jung-Woo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2010.07a
    • /
    • pp.1-3
    • /
    • 2010
  • 스피어 복호 알고리즘 (sphere decoding algorithm)은 다중 입출력 (MIMO) 통신 시스템에서 사용되는 복호기중 최대 우도 복호기 (Maximum Likelihood Detector)와 비슷한 BER(bit error rate)성능을 가지고 복잡도를 줄일수 있어서 최근 많이 연구되어 왔다. 이때 공간 다중화와 채널 부호의 연접시스템에서 연판정 정보(Soft output information) 를 스피어 복호 알고리즘을 통해 생성하기 위한 방법으로 리스트 스피어 복호 알고리즘 (List Sphere Decoding)이 알려져있다. 기존 리스트 스피어 디코딩 알고리즘은 리스트를 반지름을 업데이트 하지 않으므로 탐색시 복잡도가 매우 높다는것이 문제가 되므로, 차원별로 최적해의 가능성이 높은 격자 주변으로 검색을 제한하여 복잡도를 줄이는 알고리즘을 제안하고 성능과 복잡도를 실험한다.

  • PDF

Low Complexity Motion Estimation Based on Spatio - Temporal Correlations (시간적-공간적 상관성을 이용한 저 복잡도 움직임 추정)

  • Yoon Hyo-Sun;Kim Mi-Young;Lee Guee-Sang
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.9
    • /
    • pp.1142-1149
    • /
    • 2004
  • Motion Estimation(ME) has been developed to reduce temporal redundancy in digital video signals and increase data compression ratio. ME is an Important part of video encoding systems, since it can significantly affect the output quality of encoded sequences. However, ME requires high computational complexity, it is difficult to apply to real time video transmission. for this reason, motion estimation algorithms with low computational complexity are viable solutions. In this paper, we present an efficient method with low computational complexity based on spatial and temporal correlations of motion vectors. The proposed method uses temporally and spatially correlated motion information, the motion vector of the block with the same coordinate in the reference frame and the motion vectors of neighboring blocks around the current block in the current frame, to decide the search pattern and the location of search starting point adaptively. Experiments show that the image quality improvement of the proposed method over MVFAST (Motion Vector Field Adaptive Search Technique) and PMVFAST (Predictive Motion Vector Field Adaptive Search Technique) is 0.01~0.3(dB) better and the speedup improvement is about 1.12~l.33 times faster which resulted from lower computational complexity.

Fast Block Mode Decision of Spatial Enhancement Layer using Interlayer Motion Vector Estimation in Scalable Video Coding (스케일러블 비디오 부호화에서 공간 계층간 움직임 벡터 예측를 이용한 고속 모드 결정)

  • Lee, Bum-Shik;Kim, Mun-Chul;Hahm, Sang-Jin;Lee, Keun-Sik;Park, Chang-Seob
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2007.02a
    • /
    • pp.13-17
    • /
    • 2007
  • 스케일러블 비디오 코딩(SVC, Scalable Video Coding)은 MPEG(Moving Picture Expert Group)과 VCEG (Video Coding Expert Group)의 JVT(Joint VIdeo Team)에 의해 현재 표준화 되고 있는 새로운 압축 표준 기술이며 시간, 공간 및 화질의 스케일러빌리티를 지원하기 위해 계층 구조를 가지고 있다. 공간적 스케일러빌리티를 위해 기본 계층으로부터 텍스처, 움직임 그리고 잔차신호 정보를 예측하여 사용한다. 그러나 고효율의 압축효과를 얻기 위해 기존의 방식에서는 기본계층에서 얻은 세가지 정보이외에 현재 향상 계층에서 자체적으로 얻은 부호화 정보를 비교하여 최소의 RD(Rate Distortion) 비용을 가지는 정보를 이용하여 부호화 하도록 되어 있다. 하지만 이러한 방식은 향상 계층에서 인터 모드 결정 시 $16\times16,\;16\times8,\;8\times16,\;8\times8,\;4\times4,\;4\times8,\;4\times4$ 블록 모드에 대한 움직임 벡터 예측 및 보상 과정을 거쳐야 하기 때문에 향상 계층에서의 부호화 복잡도는 기본 계층에 비해 상당히 증가하게 된다. 본 논문에서는 기본계층에서 예측한 움직임 벡터 정보를 이용하여 항상 계층에서 모드 결정을 고속화하는 방법에 대해 소개한다. 제안된 방법은 기본 계층에서 예측한 블록모드 중에서 큰 블록인 $16\times16$ 블록에서 움직임 벡터가 (0, 0) 일 경우에 대하여 향상 계층에서는 $16\times16$매크로 블록에 대해서만 움직임 예측 및 보상을 수행함으로써 향상 계층에서 움직임 모드 결정을 조기에 완료하게 된다. 이것은 하위 공간 계층에서 예측한 움직임 벡터 정보가 아주 작을 때는 큰 블록 크기로 모드로 결정되는 일반적인 원리를 이용한 것이고 이 제안 방법을 이용하였을 경우 향상계층에의 모드 결정과정을 고속화함으로써 전체 스케일러빌 비디오 부호하기의 연산량 및 복잡도를 최대 70%까지 감소 시켰다. 그러나 연산량 감소에 따른 비트율의 증가와 화질 열화는 각각 최대 1.32%와 최대 0.11dB로 무시할 수 있을 정도로 작음을 확인 하였다.

  • PDF

Density-Based Estimation of POI Boundaries Using Geo-Tagged Tweets (공간 태그된 트윗을 사용한 밀도 기반 관심지점 경계선 추정)

  • Shin, Won-Yong;Vu, Dung D.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.2
    • /
    • pp.453-459
    • /
    • 2017
  • Users tend to check in and post their statuses in location-based social networks (LBSNs) to describe that their interests are related to a point-of-interest (POI). While previous studies on discovering area-of-interests (AOIs) were conducted mostly on the basis of density-based clustering methods with the collection of geo-tagged photos from LBSNs, we focus on estimating a POI boundary, which corresponds to only one cluster containing its POI center. Using geo-tagged tweets recorded from Twitter users, this paper introduces a density-based low-complexity two-phase method to estimate a POI boundary by finding a suitable radius reachable from the POI center. We estimate a boundary of the POI as the convex hull of selected geo-tags through our two-phase density-based estimation, where each phase proceeds with different sizes of radius increment. It is shown that our method outperforms the conventional density-based clustering method in terms of computational complexity.

Reactance Set and Performance Evaluation of Chaos QPSK Beamspace MIMO System Using ESPAR Antenna (ESPAR 안테나를 사용하는 카오스 QPSK 빔 공간 MIMO 시스템을 위한 리액턴스 조합과 성능 평가)

  • Lee, Jun-Hyun;Lee, Dong-Hyung;Keum, Hong-Sik;Ryu, Heung-Gyoon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.25 no.7
    • /
    • pp.737-746
    • /
    • 2014
  • Recently, researches about MIMO(Multi-Input Multi-Output) system are being studied actively due to high-capacity and high-speed communication. However, MIMO system has many RF(Radio Frequency) chains according to many array antennas. So, MIMO system has disadvantages such as high-complexity and high-power-consumption. Also, it is impossible to miniaturize the antenna dimension. In order to solve these problems, beamspace MIMO system using ESPAR(Electronically Steerable Parasitic Array Radiator) antenna was proposed. It is possible to reduce the complexity and the power-consumption, because it has single RF chain by using one active antenna and several parasitic elements. In this paper, in order to improve the security, for the first time, chaos communication algorithm is applied to QPSK modulated beamspace MIMO system using ESPAR antenna. We define as chaos QPSK beamspace MIMO system, and evaluate the SER performance. Also, we confirm that QPSK symbols can be made by changing the reactance values of parasitic elements, and evaluate the SER performance of this system.