• 제목/요약/키워드: spatial problem

Search Result 1,471, Processing Time 0.025 seconds

Spatial Scheduling for Mega-block Assembly Yard in Shipbuilding Company (조선소의 메가블록 조립작업장을 위한 공간계획알고리즘 개발)

  • Koh, Shie-Gheun;Jang, Jeong-Hee;Choi, Dae-Won;Woo, Sang-Bok
    • IE interfaces
    • /
    • v.24 no.1
    • /
    • pp.78-86
    • /
    • 2011
  • To mitigate space restriction and to raise productivity, some shipbuilding companies use floating-docks on the sea instead of dry-docks on the land. In that case, a floating-crane that can lift very heavy objects (up to 3,600 tons) is used to handle the blocks which are the basic units in shipbuilding processes, and so, very large blocks (these are called the mega-blocks) can be used to build a ship. But, because these mega-blocks can be made only in the area near the floating-dock and beside the sea, the space is very important resource for the process. Therefore, our problem is to make an efficient spatial schedule for the mega-block assembly yard. First of all, we formulate this situation into a mathematical model and find optimal solution for a small problem using a commercial optimization software. But, the software could not give optimal solutions for practical sized problems in a reasonable time, and so we propose a GA-based heuristic algorithm. Through a numerical experiment, finally, we show that the spatial scheduling algorithm can provide a very good performance.

Spatial Complex Envelope of Acoustic Field : Its Definition and Characteristics (음장의 공간 복소 포락: 정의와 특성)

  • Park, Choon-Su;Kim, Yang-Hann
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.17 no.8
    • /
    • pp.693-700
    • /
    • 2007
  • We can predict spatial acoustic pressure distribution on the plane of interest by using acoustic holography. However, the information embedded in the distribution plot is usually much more than what we need: for example, source locations and their overall propagation pattern. One possible candidate to solve the problem is complex envelope analysis. Complex envelope analysis extracts slowly-varying envelope signal from a band signal. We have attempted to extend this method to space domain so that we can have spatial information that we need. We have to modulate two dimensional data for obtaining spatial envelope. Although spatial modulation basically follows the same concept that is used in time domain, the algorithm for the spatial modulation turns out to be different from temporal modulation. We briefly describe temporal complex envelope analysis and extend it to spatial envelope of 2-D acoustic field by introducing geometric transformation. In the end, the results of applying the spatial envelope to the holography are envisaged and verified.

Selection of Spatial Regression Model Using Point Pattern Analysis

  • Shin, Hyun Su;Lee, Sang-Kyeong;Lee, Byoungkil
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.3
    • /
    • pp.225-231
    • /
    • 2014
  • When a spatial regression model that uses kernel density values as a dependent variable is applied to retail business data, a unique model cannot be selected because kernel density values change following kernel bandwidths. To overcome this problem, this paper suggests how to use the point pattern analysis, especially the L-index to select a unique spatial regression model. In this study, kernel density values of retail business are computed by the bandwidth, the distance of the maximum L-index and used as the dependent variable of spatial regression model. To test this procedure, we apply it to meeting room business data in Seoul, Korea. As a result, a spatial error model (SEM) is selected between two popular spatial regression models, a spatial lag model and a spatial error model. Also, a unique SEM based on the real distribution of retail business is selected. We confirm that there is a trade-off between the goodness of fit of the SEM and the real distribution of meeting room business over the bandwidth of maximum L-index.

Spatial Reuse in IEEE 802.11ax: Whether and How to Use in Practice

  • Zhu, Deqing;Luan, Shenji
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.12
    • /
    • pp.4617-4632
    • /
    • 2021
  • IEEE 802.11ax is a protocol being developed for high-density Wireless Local Area Networks (WLAN). Several algorithms have been proposed to improve the level of spatial reuse applied in IEEE 802.11ax. However, these algorithms are tentative and do not specify how to select the transmit power and carrier sense threshold in practice; It is unclear when and why the tuned parameters lead to better network performance. In this paper, we restricted the scale of transmit power tuning to prevent the case of backfire in which spatial reuse will result in transmission failure. If the restrictions cannot be satisfied, spatial reuse will be abandoned. This is why we named the proposed scheme as Arbitration based Spatial Reuse (ASR). We quantified the network performance after spatial reuse, and formulate a corresponding maximum problem whose solution is the optimal carrier sense threshold and transmit power. We verified our theoretical analysis by simulation and compared it with previous studies, and the results show that ASR improves the throughput up to 8.6% compared with 802.11ax. ASR can avoid failure of spatial reuse, while the spatial reuse failure rate of existing schemes can up to 36%. To use the ASR scheme in practice, we investigate the relation between the optimal carrier sense threshold and transmit power. Based on the relations got from ASR, the proposed Relation based Spatial Reuse (RSR) scheme can get a satisfactory performance by using only the interference perceived and the previously found relations.

GIS Oriented Platform For Solving Real World Logistic Vehicle Routing Problem

  • Md. Shahid Uz Zaman;Chen, Yen-Wei;Hayao Miyagi
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1248-1251
    • /
    • 2002
  • Logistics optimization problems related with vehicle routing such as warehouse locating, track scheduling, customer order delivery, wastage pickup etc. are very interesting and important issues to date. Many Vehicle Routing and Scheduling Systems (VRSS) have been developed/proposed to optimize the logistics problems. But majority of them are dedicated to a particular problem and are unable to handle the real world spatial data directly. The system developed for one problem may not be suitable for others due to inter-problem constraint variations. The constraints may include geographical, environmental and road traffic nature of the working region along with other constraints related with the problem. So the developer always needs to modify the original routing algorithm in order to fulfill the purpose. In our study, we propose a general-purpose platform by combining GIS road map and Database Management System (DBMS), so that VRSS can interact with real world spatial data directly to solve different kinds of vehicle routing problems. Using the features of our developed system, the developer can frequently modify the existing algorithm or create a new one to serve the purpose.

  • PDF

Continuous Query Processing in Data Streams Using Duality of Data and Queries (데이타와 질의의 이원성을 이용한 데이타스트림에서의 연속질의 처리)

  • Lim Hyo-Sang;Lee Jae-Gil;Lee Min-Jae;Whang Kyu-Young
    • Journal of KIISE:Databases
    • /
    • v.33 no.3
    • /
    • pp.310-326
    • /
    • 2006
  • In this paper, we deal with a method of efficiently processing continuous queries in a data stream environment. We classify previous query processing methods into two dual categories - data-initiative and query-initiative - depending on whether query processing is initiated by selecting a data element or a query. This classification stems from the fact that data and queries have been treated asymmetrically. For processing continuous queries, only data-initiative methods have traditionally been employed, and thus, the performance gain that could be obtained by query-initiative methods has been overlooked. To solve this problem, we focus on an observation that data and queries can be treated symmetrically. In this paper, we propose the duality model of data and queries and, based on this model, present a new viewpoint of transforming the continuous query processing problem to a multi-dimensional spatial join problem. We also present a continuous query processing algorithm based on spatial join, named Spatial Join CQ. Spatial Join CQ processes continuous queries by finding the pairs of overlapping regions from a set of data elements and a set of queries defined as regions in the multi-dimensional space. The algorithm achieves the effects of both of the two dual methods by using the spatial join, which is a symmetric operation. Experimental results show that the proposed algorithm outperforms earlier methods by up to 36 times for simple selection continuous queries and by up to 7 times for sliding window join continuous queries.

Filter Selection Method Using CSP and LDA for Filter-bank based BCI Systems (필터 뱅크 기반 BCI 시스템을 위한 CSP와 LDA를 이용한 필터 선택 방법)

  • Park, Geun-Ho;Lee, Yu-Ri;Kim, Hyoung-Nam
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.5
    • /
    • pp.197-206
    • /
    • 2014
  • Motor imagery based Brain-computer Interface(BCI), which has recently attracted attention, is the technique for decoding the user's voluntary motor intention using Electroencephalography(EEG). For classifying the motor imagery, event-related desynchronization(ERD), which is the phenomenon of EEG voltage drop at sensorimotor area in ${\mu}$-band(8-13Hz), has been generally used but this method are not free from the performance degradation of the BCI system because EEG has low spatial resolution and shows different ERD-appearing band according to users. Common spatial pattern(CSP) was proposed to solve the low spatial resolution problem but it has a disadvantage of being very sensitive to frequency-band selection. Discriminative filter bank common spatial pattern(DFBCSP) tried to solve the frequency-band selection problem by using the Fisher ratio of the averaged EEG signal power and establishing discriminative filter bank(DFB) which only includes the feature frequency-band. However, we found that DFB might not include the proper filters showing the spatial pattern of ERD. To solve this problem, we apply a band-selection process using CSP feature vectors and linear discriminant analysis to DFBCSP instead of the averaged EEG signal power. The filter selection results and the classification accuracies of the existing and the proposed methods show that the CSP feature is more effective than signal power feature.

Development of an OpenGIS Spatial Interface based on Oracle (Oracle 기반의 OpenGIS 공간 인터페이스의 개발)

  • Park, Chun-Geol;Park, Hee-Hyun;Kang, Hong-Koo;Han, Ki-Joon
    • Journal of Korea Spatial Information System Society
    • /
    • v.9 no.2
    • /
    • pp.1-11
    • /
    • 2007
  • Recently, with the development of collecting methods of spatial data, the spatial data is produced, circulated, and used in various fields of industry and research. To manage the mass spatial data efficiently, the researches on extension of the existing commercial DBMS, such as ESRI's ArcSDE or Oracle's Oracle Spatial, is making progress actively. However, the usage of the extension of the commercial DBMS Incurs an additional expense and causes an interoperability problem due to differences in spatial data types and spatial operators. Therefore, in this paper, we developed an OpenGIS Spatial Interface for Oracle, which supports a standard interface by fellowing the "Simple Features Specification for SQL" proposed by OGC(Open Geospatial Consortium). Since the OpenGIS Spatial Interface provides all spatial data types and spatial operators proposed in "Simple Features Specification for SQL", users can manage mass spatial data of Oracle efficiently by using the standard interface without additional expense. In addition, we proved that the OpenGIS Spatial Interface is superior to the Oracle Spatial in the response time through the performance evaluation.

  • PDF

A Study on Policy and System Improvement Plan of Geo-Spatial Big Data Services in Korea

  • Park, Joon Min;Yu, Seon Cheol;Ahn, Jong Wook;Shin, Dong Bin
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.34 no.6
    • /
    • pp.579-589
    • /
    • 2016
  • This research focuses on accomplishing analysis problems and issues by examining the policies and systems related to geo-spatial big data which have recently arisen, and suggests political and systemic improvement plan for service activation. To do this, problems and probable issues concerning geo-spatial big data service activation should be analyzed through the examination of precedent studies, policies and planning, pilot projects, the current legislative situation regarding geo-spatial big data, both domestic and abroad. Therefore, eight political and systematical improvement plan proposals are suggested for geo-spatial big data service activation: legislative-related issues regarding geo-spatial big data, establishing an exclusive organization in charge of geospatial big data, setting up systems for cooperative governance, establishing subsequent systems, preparing non-identifying standards for personal information, providing measures for activating civil information, data standardization on geo-spatial big data analysis, developing analysis techniques for geo-spatial big data, etc. Consistent governmental problem-solving approaches should be required to make these suggestions effectively proceed.

A Model of Location Decisions of Natural Gas Filling Station Considering Spatial Coverage and Travel Cost (공간적 접근성 및 통행비용을 고려한 천연가스 충전소 최적 입지선정 모형)

  • Yu, Jeong-Whon;Lee, Mu-Young;Oh, Sei-Chang
    • Journal of Korean Society of Transportation
    • /
    • v.26 no.3
    • /
    • pp.145-153
    • /
    • 2008
  • This study proposes a facility location model in consideration of spatial coverage and travel cost as an effort to make objective and effective decisions of natural gas filling stations. The proposed model is developed for fixed stations and consists of two stages. The first stage employs a heuristic algorithm to find a set of locations which satisfy the spatial coverage constraints determined by the maximum travel distance between the filling stations and bus depots. In the second stage, the optimal location of filling stations is determined based on the minimum travel cost estimated by using a modified transportation problem as well as the construction and maintenance costs of the filling stations. The applicability of the model is analyzed through finding the optimal location of filling stations for the city of Anyang, a typical medium-sized city in metropolitan Seoul, based on the demand of natural gas buses. This study is expected to help promote the spread of natural gas buses by providing a starting point of a objective and reasonable methodological perspective to address the filling station location problem.