• Spatial Information Research
• /
• v.13 no.2 s.33
• /
• pp.119-128
• /
• 2005

Most spatial data handled in GIS is two-dimensional. These two-dimensional data is established by selecting 2D aspects form 3D, or by projecting 3D onto 2D space. During this conversion, without user's intention, data are abstracted and omitted. This unwanted data loss causes disadvantages such as restrictingof the range of data application and describing inaccurate real world. Recently, three dimensional data is getting wide interests and demands. One of the examplesis Database Management System which can store and manage three dimensional spatial data. However, this DBMS does not support spatial query which is the essence of the database management system. So, various studies are needed in this field. This research designs spatial relationship that is defined in space database standard using the three-dimension space model. The spatial data model, which is used in this research, is the one defined in OGC for GMS3, and designing tool is DE-9IM based on Point-Set Topology blow as the best method for topological operation.

• Spatial Information Research
• /
• v.19 no.3
• /
• pp.43-52
• /
• 2011

Recently, interest in location-based service (LBS) which utilizes a DBMS in mobile system environment has been increasing, and it is expected to overcome the existing file-based system's limitation in advanced in-vehicle system by utilizing DBMS's advantages such as efficient storage, transaction management, modelling and spatial queries etc. In particular, the road network data corresponds to the most essential domain in a route planning system, which needs efficient management and maintenance. Accordingly, this study aims to develop an efficient graph-based geodata model for topological network data and to support dynamic path computation algorithm based on heuristic approach in mobile LBS system. To achieve this goal, we design a data model for supporting the hierarchy of network, and implement a path planning system to evaluate its performance in mobile LBS system. Last but not least, we find out that the designed path computation algorithm with hierarchical graph model reduced the number of nodes used for finding and improved the efficiency of memory.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.6
• /
• pp.432-443
• /
• 2005

Recent three-dimensional feature-based CAD systems based on solid or non-manifold modelling functionality have been widely used for product design in manufacturing companies. When product models associated with features are used in various downstream applications such as analysis, however, simplified and abstracted models at various levels of detail (LODs) are frequently more desirable and useful than the full detailed model. To provide multi-resolution models, the features need to be rearranged according to a criterion that measures the significance of the feature. However, if the features are rearranged, the resulting shape is possibly different from the original because union and subtraction Boolean operations are not commutative. To solve this problem, in this paper, the new concept of the effective zone of a feature is defined and identified using Boolean algebra. By introducing the effective zone, an arbitrary rearrangement of features becomes possible and arbitrary LOD criteria may be selected to suit various applications. Besides, because the effective zone of a feature is independent of the data structure of the model, the multi-resolution modelling algorithm based on the effective zone can be implemented on any 3D CAD system based on conventional solid representations as well as non-manifold topological (NMT) representations.

• Molecular & Cellular Toxicology
• /
• v.4 no.2
• /
• pp.170-176
• /
• 2008

The quantitative structure-activity relationship (QSAR) of a set of 35 flavonoid compounds presenting antioxidant activity was established by means of Genetic Algorithm-Multiple Linear Regression (GA-MLR) technique. Four-parametric models for two sets of data, the 1,1-diphenyl-2-picryl hydrazyl (DPPH) radical scavenging activity $(R^2=0.788,\;Q^2_{cv}=0.699\;and\;Q^2_{ext}=0.577)$ and scavenging activity of reactive oxgen species (ROS) induced by $H_2O_2 (R^=0.829,\;Q^2_{cv}=0.754\;and\;Q^2_{ext}=0.573)$ were obtained with low external predictive ability on a mass basis, respectively. Each model gave some different mechanistic aspects of the flavonoid compounds tested in terms of the radical scavenging activity. Topological charge, H-bonding complex and deprotonation processes were likely to be involved in the radical scavenging activity.

• 전기의세계
• /
• v.22 no.4
• /
• pp.17-24
• /
• 1973

In the view point of practical engineering the identification problem may be considered as a problem to determine the optimal model in the sense of minimizing a given criterion function using the input-output records of the plant. In the system identification the statistical approach has been known to be very effective when the topological structure of the system and the statistical characteristics of the observation noises are known a priori. But in the practical situation there are many cases when the inforhation about the observation noises or the system noises are not available a priori. Here, the authors propose a new identification method which can be used effectively even in the cases when the variances of observation noises are unknown a priori. In the method, the identification of unknown parameters of a linear diserete system is achieved by minimizing the improved quadratic criterion function which is composed of the term of square equation errors and the term to eliminate the affection of observation noises. The method also gives the estimate of noise variance. Numerical computations for several examples show that the proposed procedure gives satisfactory results even when the short time observation data are provided.

• The Journal of Korea Robotics Society
• /
• v.3 no.1
• /
• pp.33-41
• /
• 2008

Based on object recognition technology, we present a new global localization method for robot navigation. For doing this, we model any indoor environment using the following visual cues with a stereo camera; view-based image features for object recognition and those 3D positions for object pose estimation. Also, we use the depth information at the horizontal centerline in image where optical axis passes through, which is similar to the data of the 2D laser range finder. Therefore, we can build a hybrid local node for a topological map that is composed of an indoor environment metric map and an object location map. Based on such modeling, we suggest a coarse-to-fine strategy for estimating the global localization of a mobile robot. The coarse pose is obtained by means of object recognition and SVD based least-squares fitting, and then its refined pose is estimated with a particle filtering algorithm. With real experiments, we show that the proposed method can be an effective vision- based global localization algorithm.

• Journal of Computing Science and Engineering
• /
• v.5 no.3
• /
• pp.197-209
• /
• 2011

The increasing popularity of graph data, such as social and online communities, has initiated a prolific research area in knowledge discovery and data mining. As more real-world graphs are released publicly, there is growing concern about privacy breaching for the entities involved. An adversary may reveal identities of individuals in a published graph, with the topological structure and/or basic graph properties as background knowledge. Many previous studies addressing such attacks as identity disclosure, however, concentrate on preserving privacy in simple graph data only. In this paper, we consider the identity disclosure problem in weighted graphs. The motivation is that, a weighted graph can introduce much more unique information than its simple version, which makes the disclosure easier. We first formalize a general anonymization model to deal with weight-based attacks. Then two concrete attacks are discussed based on weight properties of a graph, including the sum and the set of adjacent weights for each vertex. We also propose a complete solution for the weight anonymization problem to prevent a graph from both attacks. In addition, we also investigate the impact of the proposed methods on community detection, a very popular application in the graph mining field. Our approaches are efficient and practical, and have been validated by extensive experiments on both synthetic and real-world datasets.

• Journal of Korean Society for Geospatial Information Science
• /
• v.16 no.4
• /
• pp.41-48
• /
• 2008

Currently used 3D models, which are mostly focused on visualization of 3D objects and lack topological structure, have limitation in being used for 3D spatial analyses and applications. However, implementing a full topology for the indoor spatial objects is less practical due to the increase of complexity and computation time. This study suggests an alternative method to build a 3D indoor model with less complexity using a spatial DBMS. Storing spatial and nonspatial information of indoor spaces in DB tables enables faster queries, computation and analyses. Also it is possible to display them in 2D or 3D using the queried information. This study suggests a 2D-3D hybrid data model, which combines the 2D topology constructed from CAD floor plans and stored in a spatial DBMS and the 3D visualization functionality. This study showed the process to build the proposed model in a spatial DBMS and use spatial functions and queries to visualize in 2D and 3D. And, then, as an example application, it illustrated the process to build an indoor evacuation simulator.

• Spatial Information Research
• /
• v.19 no.4
• /
• pp.11-20
• /
• 2011

In accordance with low carbon and green growth paradigm, a subway is one of major public transit systems for resolving traffic congestion and decreasing traffic accidents. In addition, as subway networks expand, passengers' travel pattern in the subway network change and consequently affect the urban structure. Generally, new subway route has been planned and developed, mainly considering a travel demand forecast. However, it is desired to conduct an empirical analysis on the forecast model regarding change of travel accessibility and passenger demand pattern according to new subway line. Therefore, in this paper, an alternative method, developed based upon a spatial syntax model, is proposed for evaluating new subway route in terms of passenger's mobility and network accessibility. In a case study, we constructed subway network data, mainly targeting the no 9 subway line opened in 2009. With an axial-map analysis, we calculated spatial characteristics to describe topological movement interface. We then analyzed actual modal shift and change on demand of passengers through the number of subway passenger between subway stations and the number of passenger according to comparative bus line from Smart Card to validate suggested methods. Results show that the proposed method provides quantitative means of visualizing passenger flow in subway route planning and of analyzing the time-space characteristics of network. Also, it is expected that the proposed method can be utilized for predicting a passengers' pattern and its impact on public transportation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2473-2492
• /
• 2012

Energy conservation is a vital issue in wireless sensor networks. Recently, employing mobile sinks for data gathering become a pervasive trend to deal with this problem. The sink can follow stochastic or pre-defined paths; however the controlled mobility pattern nowadays is taken more into consideration. In this method, the sink moves across the network autonomously and changes its position based on the energy factors. Although the sink mobility would reduce nodes' energy consumption and enhance the network lifetime, the overhead caused by topological changes could waste unnecessary power through the sensor field. In this paper, we proposed EEDARS, an energy-efficient dual-sink algorithm with role switching mechanism which utilizes both static and mobile sinks. The static sink is engaged to avoid any periodic flooding for sink localization, while the mobile sink adaptively moves towards the event region for data collection. Furthermore, a role switching mechanism is applied to the protocol in order to send the nearest sink to the recent event area, hence shorten the path. This algorithm could be employed in event-driven and multi-hop scenarios. Analytical model and extensive simulation results for EEDARS demonstrate a significant improvement on the network metrics especially the lifetime, the load and the end-to-end delay.