• Title/Summary/Keyword: 확장공간

Search Result 2,118, Processing Time 0.031 seconds

The Formation of New Game Generation in Game-Extended Space : Focused on the Experience Game (게임-확장공간에서의 '게임적 신인류'의 형성 : 체감형 게임을 중심으로)

  • Kim, Jae-Young;Sung, Jung-Hwan
    • Journal of Korea Game Society
    • /
    • v.10 no.5
    • /
    • pp.3-13
    • /
    • 2010
  • This paper focuses on the sequences between game performance, game experience, game generation. Present-day the game has powerful effects to form new human species as game generation. Especially, the experience game is important because it could have one of the most powerful effect by characteristics of own interface. First of all, this paper analyzes a experience of the experience game and researches the game-extended space. Secondly, We create concept of 'new game generation' in order to explain new human species on the experience game. So we can reveal the social meaning of accelerated present state by the experience game through this new analysis.

A study on live vertical scale-up in a cloud environment (클라우드 환경에서의 무중단 수직 확장에 관한 연구)

  • Jun-Seok Park;Dae-Sik Ko
    • Journal of Platform Technology
    • /
    • v.10 no.4
    • /
    • pp.70-81
    • /
    • 2022
  • In this paper, we proposed a Virtual Machine Placement (VMP) method to provide live vertical scaling services for cloud resources. Since free space on the physical server must be secured in advance for vertical scaling, a "general-mixed-vertical" mode conversion algorithm based on the FirstFit placement strategy that variably adjusts the allocation ratio of virtual servers to physical servers for this purpose is presented. Simulations were performed using parameters such as vertical scaling ratio, virtualization ratio, and free resource ratio. When the vertical scaling ratio is 50%, considering free space, 150% of resources are required as a whole, but simulation results of the proposed algorithm show that only up to 125% of free space is required.

A Study on Millimeter Wave Power Amplifiers Using Spatial Combining (공간 결합을 이용한 밀리미터파 전력 증폭기에 관한 연구)

  • Ki, Hyeon-Cheol
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.4
    • /
    • pp.77-82
    • /
    • 2017
  • As frequencies increase to the millimeter wave bands the cross sections of wave guides become smaller than a few millimeters, which cause sapatial problems in realization of spatial combining power amplifiers. In this paper we intented to overcome the problem by widening the width of wave guides using horn antenna principles. We designed a widened rectangular wave guide for using in spatial combining power amplifier in 60GHz ISM band(57-64GHz), and we installed Antipodal transition in the widened wave guide, and then we characterized it as a spatial combining power amplifier. For the compatibility of WR15 standard wave guide, we widened the width of WR15 to 7mm using principle of H-plane sectoral horn antenna and then installed 3 slots of back to back Antipodal transition. The designed spatial combining power amplifier showed good characteristics of return loss less than -22.4dB and insertion loss less than 0.53dB. However, as widening the width of the wave guide, additional modes such as $TE_{20}$, $TE_{30}$ in addition to $TE_{10}$ were accurred in the bandwidth of WR15, which restricted the bandwidth and widening of the width of the wave guide.

A Study on the Performance of Structured Document Retrieval Using Node Information (노드정보를 이용한 문서검색의 성능에 관한 연구)

  • Yoon, So-Young
    • Journal of the Korean Society for information Management
    • /
    • v.24 no.1 s.63
    • /
    • pp.103-120
    • /
    • 2007
  • Node is the semantic unit and a part of structured document. Information retrieval from structured documents offers an opportunity to go subdivided below the document level in search of relevant information, making any element in an structured document a retrievable unit. The node-based document retrieval constitutes several similarity calculating methods and the extended node retrieval method using structure information. Retrieval performance is hardly influenced by the methods for determining document similarity The extended node method outperformed the others as a whole.

Web GIS Cluster Design with Extended Workload-Aware Request Distribution (WARD) Strategy (확장된 WARD기 법을 사용한 웹 GIS 클러스터 링 시스템)

  • 장용일;이충호;이재동;배해영
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.304-306
    • /
    • 2001
  • 웹 클러스터링 시스템은 사용자의 집중에 의한 서버의 과부화해 효율적으로 대처할 수 있는 방법 중 하나이다. 공간 질의의 대부분은 인접 영역에 대한 경우가 매우 잦으며. 특정 영역에 집중되는 특성을 갖는다. 타일 기반 웹 GIS 클러스터링 시스템은 이러한 공간 질의의 특성을 만족시키면서 클러스터에 포함되는 각 노드의 버퍼 재 사용률을 높이고 디스크 접근 빈도를 낮출 수 있는 기법을 사용한다. 그러나, 모든 질의가 디스패처를 거치기 때문에 병목현상이 나타날 수 있으며, 질의의 빈도가 낮은 지역의 경우 할당된 지역의 범위에 의해 버퍼 관리에 문제가 생긴다. 본 논문에서는 확장된 WARD기법을 사용한 웹 GIS 클러스터링 시스템을 제안한다. 제안되는 시스템은 타일 기반 웹 GIS클러스터링 시스템을 기반으로 디스패처를 분산시켜 병목현상을 줄이고, 각 지역을 그룹으로 묶어 플러스터를 분배하여 대용량의 공간 데이터를 위해 적절한 버퍼 관리를 한다. 또한, 질의가 집중되는 영역에 대한 레이어를 모든 노드의 코어 영역에 중복 저장하여 로컬에서 지역적으로 처리하고 다른 노드로의 처리 요구에 대한 포워딩(Forwarding) 오버헤드를 줄여 기존의 서버에 비해 안정성와 확장성 그리고 처리 능력을 향상시킬 수 있다.

  • PDF

An Expansion of Vector Space for Document Classifications (문서 분류에 이용 가능한 벡터 공간의 확장 방법)

  • Lee, Samuel Sangkon;Yoo, Kyungseok
    • Annual Conference of KIPS
    • /
    • 2015.04a
    • /
    • pp.782-784
    • /
    • 2015
  • 본 논문에서는 한국어 문서의 분류 정밀도 향상을 위해 애매어와 해소어 정보를 이용한 확장된 벡터 공간 모델을 제안하였다. 벡터 공간 모델에 사용된 벡터는 같은 정도의 가중치를 갖는 축이 하나 더 존재하지만, 기존의 방법은 그 축에 아무런 처리가 이루어지지 않았기 때문에 벡터끼리의 비교를 할 때 문제가 발생한다. 같은 가중치를 갖는 축이 되는 단어를 애매어라 정의하고, 단어와 분야 사이의 상호정보량을 계산하여 애매어를 결정하였다. 애매어에 의해 애매성을 해소하는 단어를 해소어라 정의하고, 애매어와 동일한 문서에서 출현하는 단어 중에서 상호정보량을 계산하여 해소어의 세기를 결정하였다. 본 논문에서는 애매어와 해소어를 이용하여 벡터의 차원을 확장하여 문서 분류의 정밀도를 향상시키는 방법을 제안하였다.

A Spatial Data Mining System Extending Generalization based on Rulebase (규칙베이스 기반의 일반화를 확장한 공간 데이터 마이닝 시스템)

  • Choi, Seong-Min;Kim, Ung-Mo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.11
    • /
    • pp.2786-2796
    • /
    • 1998
  • Extraction of interesting and general knowledge from large spatial database is an important task in the development of geographical information system and knowledge-base systems. In this paper, we propose a spatial data mining system using generalization method; In this system, we extend an existing generalization mining and design a rulebase to support deriving new spatial knowledge. For this purpose, we propose an interleaved method which integrates spatial data dominated and nonspatial data dominated mining and construct a rulebase to extract topological relationship between spatial objects.

  • PDF

Spatial Computation on Spark Using GPGPU (GPGPU를 활용한 스파크 기반 공간 연산)

  • Son, Chanseung;Kim, Daehee;Park, Neungsoo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.8
    • /
    • pp.181-188
    • /
    • 2016
  • Recently, as the amount of spatial information increases, an interest in the study of spatial information processing has been increased. Spatial database systems extended from the traditional relational database systems are difficult to handle large data sets because of the scalability. SpatialHadoop extended from Hadoop system has a low performance, because spatial computations in SpationHadoop require a lot of write operations of intermediate results to the disk, resulting in the performance degradation. In this paper, Spatial Computation Spark(SC-Spark) is proposed, which is an in-memory based distributed processing framework. SC-Spark is extended from Spark in order to efficiently perform the spatial operation for large-scale data. In addition, SC-Spark based on the GPGPU is developed to improve the performance of the SC-Spark. SC-Spark uses the advantage of the Spark holding intermediate results in the memory. And GPGPU-based SC-Spark can perform spatial operations in parallel using a plurality of processing elements of an GPU. To verify the proposed work, experiments on a single AMD system were performed using SC-Spark and GPGPU-based SC-Spark for Point-in-Polygon and spatial join operation. The experimental results showed that the performance of SC-Spark and GPGPU-based SC-Spark were up-to 8 times faster than SpatialHadoop.

Extended R-Tree with Grid Filter for Efficient Filtering (효율적인 여과를 위한 그리드 필터를 갖는 R-Tree 의 확장)

  • 김재흥
    • Spatial Information Research
    • /
    • v.8 no.1
    • /
    • pp.155-170
    • /
    • 2000
  • When we use R-Tree,a spatial index, to find objects matches some predicate, it often leads to an incorrect result of perform filtering step only with MBR. And , each candidates need to be inspected to conform if it really satisfies with given query, so called, 'refinement step'. In refinement step. we should perform disk I/O and expansive spatial operations which is the cause of increasing retrieval costs. Therefore, to minimize the number of candidate after filtering step, two-phase filtering methods were studied, but there was many problems such as inefficiency of filtering,maintenance of additional informations and reconstruction of data resulted from the loss of original information. So , in this paper, I propose an Extended R-Tree which provides ability to retrieve spatial objects only with some simple logical operations using Grid Table, truth table strong the information about the existence of spatial objects, in second filtering step. Consequently , this Extended R-Tree using Grid Filter has low cost of operation for filtering because of efficient second filtering step, and better filtering efficiency caused by high quality of approximation.

  • PDF