• Title/Summary/Keyword: time-space partition

Search Result 58, Processing Time 0.024 seconds

Development of Distributed Interactive Stochastic Combat Simulation (DISCSIM) Model

  • Hong, Yoon-Gee;Kwon, Soon-Jong
    • Journal of the military operations research society of Korea
    • /
    • v.25 no.2
    • /
    • pp.15-30
    • /
    • 1999
  • A number of combat simulation models are scattered and the analytic solution approaches have experienced very difficult computational efforts. Today´s computer communication technology let people to do many unrealistic things possible and the use of those technologies is becoming increasingly prevalent throughout the military operation. Both DIS and ADS are welled defined computer aided military simulations. This study discusses a simulation of stochastic combat network modeling through Internet space. We have developed two separate simulation models, one for clients and another for server, and validated for conducting studies with these models. The object-oriented design was necessary to define the system entities and their relationship, to partition functionality into system entities, and to transform functional metrics into realizations derived from system component behaviors. Heterogeneous forces for each side are assumed at any battle node. The time trajectories for mean number of survivors and combat history at each node, some important combat measures, and relative difference computations between models were made. We observe and may conclude that the differences exit and some of these are significant based on a limited number of experiments.

  • PDF

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.

Dynamic Load Management Method for Spatial Data Stream Processing on MapReduce Online Frameworks (맵리듀스 온라인 프레임워크에서 공간 데이터 스트림 처리를 위한 동적 부하 관리 기법)

  • Jeong, Weonil
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.8
    • /
    • pp.535-544
    • /
    • 2018
  • As the spread of mobile devices equipped with various sensors and high-quality wireless network communications functionsexpands, the amount of spatio-temporal data generated from mobile devices in various service fields is rapidly increasing. In conventional research into processing a large amount of real-time spatio-temporal streams, it is very difficult to apply a Hadoop-based spatial big data system, designed to be a batch processing platform, to a real-time service for spatio-temporal data streams. This paper extends the MapReduce online framework to support real-time query processing for continuous-input, spatio-temporal data streams, and proposes a load management method to distribute overloads for efficient query processing. The proposed scheme shows a dynamic load balancing method for the nodes based on the inflow rate and the load factor of the input data based on the space partition. Experiments show that it is possible to support efficient query processing by distributing the spatial data stream in the corresponding area to the shared resources when load management in a specific area is required.

A Study on the Prediction of the Nonlinear Chaotic Time Series Using Genetic Algorithm based Fuzzy Neural Network (유전 알고리즘을 이용한 퍼지신경망의 시계열 예측에 관한 연구)

  • Park, In-Kyu
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.4
    • /
    • pp.91-97
    • /
    • 2011
  • In this paper we present an approach to the structure identification based on genetic algorithm and to the parameter identification by hybrid learning method in neuro-fuzzy-genetic hybrid system in order to predicate the Mackey-Glass Chaotic time series. In this scheme the basic idea consists of two steps. One is the construction of a fuzzy rule base for the partitioned input space via genetic algorithm, the other is the corresponding parameters of the fuzzy control rules adapted by the backpropagation algorithm. In an attempt to test the performance the proposed system, three patterns, x(t-3), x(t-6) and x(t-9), was prepared according to time interval. It was through lots of simulation proved that the initial small error of learning owed to the good structural identification via genetic algorithm. The performance was showed in Table 2.

Design and Implementation of Virtual and Invisible Private Disk (VIPDISK) having Secure Storage Device (보안 저장장치를 구비한 가상의 인비저블한 보안 디스크 (VIPDISK) 설계 및 구현)

  • Quan, Shan Guo;Kwon, Yong-Gu
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.4
    • /
    • pp.781-792
    • /
    • 2015
  • This paper proposes a virtual and invisible private disk (VIPDISK) technology equipped with the secure storage devices. As a software based security technology, it can create hidden partitions on any data storage device which can not be identified by the windows OS, so the program running on it, does not have any evidence of the existence of the hidden storage space. Under inactive state, it maintains an unexposed secure partition which can only be activated with a matching combination of a unique digital key and a user password to open the decryption tool. In addition, VIPDISK can store data to secure storage device with real-time encryption, it is worry-free even in the case of lost or theft. Simulation results show that VIPDISK provides a much higher level of security compared to other existing schemes.

A Study on Fuzzy Set-based Polynomial Neural Networks Based on Evolutionary Data Granulation (Evolutionary Data Granulation 기반으로한 퍼지 집합 다항식 뉴럴 네트워크에 관한 연구)

  • 노석범;안태천;오성권
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2004.10a
    • /
    • pp.433-436
    • /
    • 2004
  • In this paper, we introduce a new Fuzzy Polynomial Neural Networks (FPNNS)-like structure whose neuron is based on the Fuzzy Set-based Fuzzy Inference System (FS-FIS) and is different from that of FPNNS based on the Fuzzy relation-based Fuzzy Inference System (FR-FIS) and discuss the ability of the new FPNNS-like structure named Fuzzy Set-based Polynomial Neural Networks (FSPNN). The premise parts of their fuzzy rules are not identical, while the consequent parts of the both Networks (such as FPNN and FSPNN) are identical. This difference results from the angle of a viewpoint of partition of input space of system. In other word, from a point of view of FS-FIS, the input variables are mutually independent under input space of system, while from a viewpoint of FR-FIS they are related each other. The proposed design procedure for networks architecture involves the selection of appropriate nodes with specific local characteristics such as the number of input variables, the order of the polynomial that is constant, linear, quadratic, or modified quadratic functions being viewed as the consequent part of fuzzy rules, and a collection of the specific subset of input variables. On the parameter optimization phase, we adopt Information Granulation (IC) based on HCM clustering algorithm and a standard least square method-based learning. Through the consecutive process of such structural and parametric optimization, an optimized and flexible fuzzy neural network is generated in a dynamic fashion. To evaluate the performance of the genetically optimized FSPNN (gFSPNN), the model is experimented with using the time series dataset of gas furnace process.

  • PDF

Facial Expression Control of 3D Avatar by Hierarchical Visualization of Motion Data (모션 데이터의 계층적 가시화에 의한 3차원 아바타의 표정 제어)

  • Kim, Sung-Ho;Jung, Moon-Ryul
    • The KIPS Transactions:PartA
    • /
    • v.11A no.4
    • /
    • pp.277-284
    • /
    • 2004
  • This paper presents a facial expression control method of 3D avatar that enables the user to select a sequence of facial frames from the facial expression space, whose level of details the user can select hierarchically. Our system creates the facial expression spare from about 2,400 captured facial frames. But because there are too many facial expressions to select from, the user faces difficulty in navigating the space. So, we visualize the space hierarchically. To partition the space into a hierarchy of subspaces, we use fuzzy clustering. In the beginning, the system creates about 11 clusters from the space of 2,400 facial expressions. The cluster centers are displayed on 2D screen and are used as candidate key frames for key frame animation. When the user zooms in (zoom is discrete), it means that the user wants to see mort details. So, the system creates more clusters for the new level of zoom-in. Every time the level of zoom-in increases, the system doubles the number of clusters. The user selects new key frames along the navigation path of the previous level. At the maximum zoom-in, the user completes facial expression control specification. At the maximum, the user can go back to previous level by zooming out, and update the navigation path. We let users use the system to control facial expression of 3D avatar, and evaluate the system based on the results.

An Implementation of Method to Determine Search Space of Hierarchical Path Algorithm for Finding Optimal Path (최적 경로 탐색을 위한 계층 경로 알고리즘의 탐색 영역 결정 기법의 구현)

  • Lee, Hyoun-Sup;Yun, Sang-Du;Kim, Jin-Deog
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.835-838
    • /
    • 2008
  • Many researches on hierarchical path search have been studied so far. Even though partitioning regions is essential part, the researches are not enough. This paper proposes two efficient methods to partition regions: 1)a method based on voronoi algorithm in which a major node is central point of a region, 2) a method based on fired grid that partitions regions into major and minor. The performances of the proposed methods are compared with the conventional hierarchical path search method in which a region is formed by the boundary line of nearest 4 points of a major node in terms of the path search time and the accuracy. The results obtained from the experiments show that the method based on voronoi achieves short execution time and the method based grid achieves high accuracy.

  • PDF

Synthesis of Multi-level Reed Muller Circuits using BDDs (BDD를 이용한 다단계 리드뮬러회로의 합성)

  • Jang, Jun-Yeong;Lee, Gwi-Sang
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.3
    • /
    • pp.640-654
    • /
    • 1996
  • This paper presents a synthesis method for multi-level Reed-Muller circuits using BDDs(Binary Decision Diagrams). The existing synthesis tool for Reed circuits, FACTOR, is not appropriate to the synthesis of large circuits because it uses matrix (map-type) to represent given logic functions, resulting in the exponential time and space in number of imput to the circuits. For solving this problems, a syntheisis method based on BDD is presented. Using BDDs, logic functions are represented compactly. Therefor storage spaces and computing time for synthesizing logic functions were greatly decreased, and this technique can be easily applied to large circuits. Using BDD representations, the proposed method extract best patterns to minimize multi-level Reed Muller circuits with good performance in area optimization and testability. Experimental results using the proposed method show better performance than those using previous methods〔2〕. For large circuits of considering the best input partition, synthesis results have been improved.

  • PDF

A Study on the Characteristics of Penthouse Apartmaent Planning in Korea - Focus on the case analysis of penthouse in Seoul - (국내 펜트하우스(하늘채)의 공간 특성에 관한 연구 - 서울에 위치한 펜트하우스의 평면 계획 분석을 중심으로 -)

  • Choi, Kwang-Min;Hur, Bum-Pall
    • Korean Institute of Interior Design Journal
    • /
    • v.20 no.3
    • /
    • pp.172-181
    • /
    • 2011
  • Many of penthouse apartments began to be built and distributed in Korea from the 2000s. However, we have a transformed definition from the international concept of penthouse. It seems that the penthouse apartments in Korea have a confined definition as a luxury and privileged house-we often find it out from advertisements of newly built apartments. In this thesis, therefore, it needs to make a clear and substantial definition of penthouse. And on the base of this definition, this study is intended to analyze planes of penthouse apartments which are distributed recently. It is in order to find out positive aspects of penthouse apartments and to make practical application of this analysis. The process of this study for plane-planning is as follows. Firstly, it is investigated and analyzed that external factors that have an effect on plane-planning such as locations and types of penthouse apartments. Secondly, an interior of penthouse apartments are divided into a private, public and outward area. And properties of each area through this research show the way of division and arrangement of plane. Thirdly, methods of connection between spaces is analyzed on the base of results of research for the way of partition. Finally, specific characters of penthouse apartments planning is derived from synthesis of research. In conclusion, analysis of plane-planning of penthouse apartments is summarized as follows. The majority of penthouse apartments is arranged to small portions of households and on higher stories in apartment which is situated around Han River or public parks. These external factors influence the plane-planning in both the interior and exterior way. For the exterior planning in space, it becomes important to design bays as many as possible in contact with outside in order to satisfy demands for fine prospects. It is also important to plan extra places naturally such as a terrace in order to provide virtual grounding. In the interior planning, a large size of interior induces to develop space for linking between each area, such as corridors or extra rooms. This makes it possible that the private area is linked to each other, at the same time it has its own distinctiveness according to its usage.