• Korean Journal of Computational Design and Engineering
• /
• v.18 no.6
• /
• pp.439-450
• /
• 2013

In the case of a floating offshore structure such as FPSO(Floating, Production, Storage, and Offloading unit), many equipment should be installed in the limited space, as compared with an onshore structure. Recently, the requirement for an optimal layout method of the structure has been raised. Thus, a layout method of the floating offshore structure was proposed in this study. First, an optimization problem for layout design was mathematically formulated, and then an optimization algorithm was implemented based on the genetic algorithm in order to solve it. To evaluate the applicability of the proposed method, it was applied to examples ofFPSO topsides and an offshore wind turbine. As a result, it was shown that the proposed method can be applied to layout design of the floating offshore structure.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2211-2232
• /
• 2018

The unstructured and semi-structured big data in social network poses new challenges in query retrieval. This requirement needs to be met by introducing quality retrieval time measures like indexing. Due to the huge volume of data storage, there originate the need for efficient index algorithms to promote query processing. However, conventional algorithms fail to index the huge amount of frequently obtained information in real time and fall short of providing scalable indexing service. In this paper, a new LIndex algorithm, which is a heuristic on Lucene is built on Neo4jHA architecture that holds the social network Big data. LIndex is a flexible and simplified adaptive indexing scheme that ascendancy decomposed shortest paths around term neighbors as basic indexing unit. This newfangled index proves to be effectual in query space pruning of graph database Neo4j, scalable in index construction and deployment. A graph query is processed and optimized beyond the traditional Lucene in a time-based manner to a more efficient path method in LIndex. This advanced algorithm significantly reduces query fetch without compromising the quality of results in time. The experiments are conducted to confirm the efficiency of the proposed query retrieval in Neo4j graph NoSQL database.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.3
• /
• pp.288-298
• /
• 2000

Digital assets denote multimedia information that exists in the form of digitized materials such as images, audio, and video. The management of digital assets demands much effort because of a huge amount of storage space requirement and multidimensional characteristics of the information needed to describe their contents. In this paper, we design and implement a Digital Asset Manager that stores and manages digital assets efficiently. Among the various types of digital assets, we focus on the video asset which has the highest complexity. Our Digital Asset Manager provides various facilities for digital contents authoring applications. In the Digital Asset Manager, video assets are managed by using a hierarchical model in order to ensure efficient accesses to any part of a video asset. Our system also guarantees the independence from the storage platform, and provides a fast content-based similarity search method on the digital assets.

• The KIPS Transactions:PartA
• /
• v.15A no.6
• /
• pp.325-334
• /
• 2008

Flash memory is widely used as a storage medium for mobile devices such as cell phones, MP3 players, PDA's due to its tiny size, low power consumption and shock resistant characteristics. Additionally, some computer manufacturers try to replace hard-disk drives used in Laptops or personal computers with flash memory. More recently, there are some literatures on developing a flash memory-aware $B^+$-tree index for an efficient key-based search in the flash memory storage system. They focus on minimizing the number of "overwrites" resulting from inserting or deleting a sequence of key values to/from the $B^+$-tree. However, in addition to this factor, the size of a physical page allocated to a node can affect the maintenance cost of the $B^+$-tree. In this paper, with diverse experiments, we compare and analyze the costs of construction and search of the $B^+$-tree and the space requirement on flash memory as the node size increases. We also provide sorting-based or non-sorting-based algorithms to be used when inserting a key value into the node and suggest an header structure of the index node for searching a given key inside it efficiently.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.447-458
• /
• 2008

In this paper, we address an efficient processing scheme for k-nearest neighbor queries to retrieve k static objects in road network databases. Existing methods cannot expect a query processing speed-up by index structures in road network databases, since it is impossible to build an index by the network distance, which cannot meet the triangular inequality requirement, essential for index creation, but only possible in a totally ordered set. Thus, these previous methods suffer from a serious performance degradation in query processing. Another method using pre-computed network distances also suffers from a serious storage overhead to maintain a huge amount of pre-computed network distances. To solve these performance and storage problems at the same time, this paper proposes a novel approach that creates an index for moving objects by approximating their network distances and efficiently processes k-nearest neighbor queries by means of the approximate index. For this approach, we proposed a systematic way of mapping each moving object on a road network into the corresponding absolute position in the m-dimensional space. To meet the triangular inequality this paper proposes a new notion of average network distance, and uses FastMap to map moving objects to their corresponding points in the m-dimensional space. After then, we present an approximate indexing algorithm to build an R*-tree, a multidimensional index, on the m-dimensional points of moving objects. The proposed scheme presents a query processing algorithm capable of efficiently evaluating k-nearest neighbor queries by finding k-nearest points (i.e., k-nearest moving objects) from the m-dimensional index. Finally, a variety of extensive experiments verifies the performance enhancement of the proposed approach by performing especially for the real-life road network databases.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.3
• /
• pp.328-333
• /
• 2003

NGE (Nested Generalized Exemplars) proposed by Salzberg improved the storage requirement and classification rate of the Memory Based Reasoning. It constructs hyperrectangles during training and performs classification tasks. It worked not bad in many area, however, the major drawback of NGE is constructing hyperrectangles because its hyperrectangle is extended so as to cover the error data and the way of maintaining the feature weight vector. We proposed the OH (Optimizing Hyperrectangle) algorithm which use the feature weight vectors and the ED(Exemplar Densimeter) to optimize resulting Hyperrectangles. The proposed algorithm, as well as the EACH, required only approximately 40% of memory space that is needed in k-NN classifier, and showed a superior classification performance to the EACH. Also, by reducing the number of stored patterns, it showed excellent results in terms of classification when we compare it to the k-NN and the EACH.

• Journal of KIISE:Software and Applications
• /
• v.31 no.4
• /
• pp.478-487
• /
• 2004

We had proposed the RPA(Recursive Partition Averaging) method in order to improve the storage requirement and classification rate of the Memory Based Reasoning. That algorithm worked not bad in many area, however, the major drawbacks of RPA are it's partitioning condition and the way of extracting major patterns. We propose an adaptive RPA algorithm which uses the FPD(feature-based population densimeter) to stop the ARPA partitioning process and produce, instead of RPA's averaged major pattern, optimizing resulting hyperrectangles. The proposed algorithm required only approximately 40% of memory space that is needed in k-NN classifier, and showed a superior classification performance to the RPA. Also, by reducing the number of stored patterns, it showed an excellent results in terms of classification when we compare it to the k-NN.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.41 no.3
• /
• pp.226-232
• /
• 2013

A compact hydrogen generation device of fuel cell system using chemical hydride storage technique was designed to fit the propulsion device requirement of a small unmanned aerial vehicle(SUAV). For high efficient, compact, and lightweight hydrogen generation control device, the Co-B catalyst hydrogen conversion rate by $NaBH_4$ aqueous solution flux is measured so that the proper amount of Co-B catalyst for maximum hydrogen generation of 100W stack was proposed. A compact hydrogen generation device is controlled by pump's on/off using its own internal pressure and consumes fuel in high efficiency through a dead-end type fuel cell. The fuel cell system has stable operation for a planed flight profile. The system operates up to maximum 7 hours and at least 4 hours for tough flight profiles.

• Journal of Korean Society of Forest Science
• /
• v.101 no.3
• /
• pp.387-394
• /
• 2012

The study was conducted to develop an effective forest resources use models for an alternate use of abandoned quarry by an attitude survey. According to the result of survey, a pessimistic view due to dust, noise pollution, and forest damage was 5% higher than an affirmative view by economic benefits from the development of quarry. The 42% of the respondents preferred the alternate use of abandoned quarry and the 25% of the respondents wanted an art and cultural space. The optimum size of alternate use was 5-10 ha (43%) with the requirement of nearby residents (32%). According to the SWOT analysis for abandoned quarry, the strength factors were an effective use of land, the content development of modern industrial inheritance + cultural and art fusion, attraction for nearby city and visitors, a harmony of beauty landscape and clean environment, and a sustainable increase of domestic and foreign visitors with the 5-day-work week. The opportunity factors were the improvement of traffic networks through KTX and local highway, the creation of the new growth engines with the establishment of artistic creation belts, the providing of unique cultural and art space through grafting of tour and education, the creation of local income through stone processed goods, and the vitalization of local development through eco-city. The weakness factors were a psychological remoteness and backwardness, and the weakness of staying tour infra. The threat factors were a poor financial support for sustainable development in nearby quarry and a modify of legal and institutional system for the alternated use of abandoned quarry. The developed restoration models for the alternate use in abandoned quarry are classified to a sculpture park, a waterfall and lake park, a rock-climbing, a sports park + forest park, a native botanical garden, a culture and art park, a complex park, a water storage site, a water storage site to extinguish forest fire, a geriatric hospital, an agricultural facility, and a school site types etc. The results suggest that the alternate use in the abandoned soil and stone quarry is needed to establish facility use models with consideration of user's preference.

• Korea Science and Art Forum
• /
• v.37 no.1
• /
• pp.249-260
• /
• 2019

Recently, the proportion of single-person households is on the increase in Korea, expected to reach 34.6% in 2035. Among the single-person households, Young single family households are facing greater difficulties due to high house prices in Korea. The government is expanding its support to Young single family, executing various policies such as public lease housings, private lease housings for youth, youth dormitory, etc. The purpose of this study is to understand the exact housing requirement of Young single family households who have different lifestyles with other age groups and provide base line data for youth house planning which will be in use later on. Study methods are shown below. First, this research studied the status and characteristics of Young single family households by looking into literature. Second, by studying previous studies concerned with life style and housing preferences of youth, the tool for investigating preferences and needs of housing environment by Young single family households was composed. Third, survey on characterstics of space usage, preferences and needs on flat composition, and preferences of interior design were conducted based on lifestyle of Young single family-households. The survey was conducted as an online survey using SNS for 150 Young single family holds from the age of 20 and 39, including students and office workers from December 2018 to January 2019. The results are as following. (1) Looking into the space usage characteristics, considering that various activities other than basic functions take place in bedroom and living room of small-sized Young single family households, we need to consider this additionally when planning the housing. (2) Looking into the preferences and composite needs of flat composition, the subjects demand separate bed room and more living room space, and also demand expansion of living room space where various activities take place and additional storage such as dress room in bed room (3) The preferences toward interior design show preferences toward modern style and achromatic color, a representative color. The subjects also prefer floor finishing materials normally used for living spaces, and indirect, soft lighting that uses wall. Also, there are differences between interior design preferences between students (20's) and office workers(30's) due to their different lifestyles. Research is needed to propose practical residential environment requirements and plans through a case study of actual public rental housing and a wider range of users.