• Korean Journal of Construction Engineering and Management
• /
• v.25 no.3
• /
• pp.68-82
• /
• 2024

The planning stage of laser scanning is crucial for acquiring high-quality 3D source data. It involves assessing the target space's environment and formulating an effective measurement strategy. However, existing practices often overlook on-site conditions, with decisions on scanner deployment and scanning locations relying heavily on the operators' experience. This approach has resulted in frequent modifications to scanning locations and diminished 3D data quality. Previous research has explored the selection of optimal scanner locations and conducted preliminary reviews through simulation, but these methods have significant drawbacks. They fail to consider scanner inaccuracies, do not support the use of multiple scanners, rely on less accurate 2D drawings, and require specialized knowledge in 3D modeling and programming. This study introduces an optimization technique for laser scanning planning using 3D simulation to address these issues. By evaluating the accuracy of scan data from various laser scanners and their positioning for scanning a retaining wall structure in a small-scale building, this method aids in refining the laser scanning plan. It enhances the decision-making process for end-users by ensuring data quality and reducing the need for plan adjustments during the planning phase.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.42 no.1
• /
• pp.27-40
• /
• 2014

The functions of urban open space, which embraces community revitalization, are diverse. It is the means of public healthcare, learning centers for children, hub of arts and cultural programs, as well as promoter of urban tourism. However, in-depth discourse and research on the topic of urban open spaces has been limited so far. Hence, this study aims to investigate the motivations and satisfaction of visitation based on four representative waterfront open space in Seoul; Cheongyecheon Waterfront, Seoul Forest Park, Seonyudo Park and Banpo Hangang Park. The methods of study are literature review, observation investigation, and questionnaire survey. The findings are analyzed through the Exploratory Factor Analysis, Reliability Analysis, ANOVA Analysis and Regression Analysis by SPSS 18.0. The results of the study are as follows. First, urban waterfront open spaces in Seoul has 5 factors of visitor motivation; community amenity, nature access, cultural and educational assets, aesthetic enjoyment, and lastly means of escape. Second, factors of recognizing urban waterfront open spaces as community amenity and nature access indicate meaningful differences in visitor's perception by spatial characteristics. Third, distances between the destination and the visitor's residence influence significantly their perceived motivation. Close-range visitors perceived nature access as a principal factor, whilst medium to long-range visitors perceived visitation for aesthetic purposes more importantly. Lastly, the will to escape was shown as the influential factor in visitor satisfaction. Visiting open spaces for the enjoyment of nature and aesthetic purposes were factors that also closely relate to visitor satisfaction. In addition, it was found that there are different visitor motivations that influence visitor satisfaction in accordance with the spatial characteristics of each open space. In summary, it can be said that urban waterfront open space is a hybrid space connected to various types of urban contents beyond daily experiences. It was found that several visitor motivations including community development, design aesthetics, education and culture, entertainment, enjoyment of natural landscape, and relaxation, affect the overall satisfaction of the visiting experience. It is anticipated that the results of the study will be used by the local government in setting up strategies for the creation and management of successful urban waterfront open space, and for those involved in planning and design act as a starting point for spatial programming and amenities arrangement in accordance to the city's tourism and urban marketing approach.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.3
• /
• pp.105-112
• /
• 2017

PCI Express is a bus technology that connects the processor and the peripheral I/O devices that widely used as an industry standard because it has the characteristics of high-speed, low power. In addition, PCI Express is system interconnect technology such as Ethernet and Infiniband used in high-performance computing and computer cluster. PGAS(partitioned global address space) programming model is often used to implement the one-sided RDMA(remote direct memory access) from multi-host systems, such as computer clusters. In this paper, we design and implement a OpenSHMEM API based on PCI Express maintaining the existing features of OpenSHMEM to implement RDMA based on PCI Express. We perform experiment with implemented OpenSHMEM API through a matrix multiplication example from system which PCs connected with NTB(non-transparent bridge) technology of PCI Express. The PCI Express interconnection network is currently very expensive and is not yet widely available to the general public. Nevertheless, we actually implemented and evaluated a PCI Express based interconnection network on the RDK evaluation board. In addition, we have implemented the OpenSHMEM software stack, which is of great interest recently.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.2
• /
• pp.67-74
• /
• 2013

Approximate string matching problems have been studied in diverse fields. Recently, fast approximate string matching algorithms are being used to reduce the time and costs for the next generation sequencing. To measure the amounts of errors between two strings, we use a distance function such as the edit distance. Given two strings X(|X| = m) and Y(|Y| = n) over an alphabet ${\Sigma}$, the edit distance between X and Y is the minimum number of edit operations to convert X into Y. The edit distance between X and Y can be computed using the well-known dynamic programming technique in O(mn) time and space. The edit distance also can be computed using the Four-Russians' algorithm whose preprocessing step runs in $O((3{\mid}{\Sigma}{\mid})^{2t}t^2)$ time and $O((3{\mid}{\Sigma}{\mid})^{2t}t)$ space and the computation step runs in O(mn/t) time and O(mn) space where t represents the size of the block. In this paper, we present a parallelized version of the computation step of the Four-Russians' algorithm. Our algorithm computes the edit distance between X and Y in O(m+n) time using m/t threads. Then we implemented both the sequential version and our parallelized version of the Four-Russians' algorithm using CUDA to compare the execution times. When t = 1 and t = 2, our algorithm runs about 10 times and 3 times faster than the sequential algorithm, respectively.

• Tunnel and Underground Space
• /
• v.31 no.6
• /
• pp.534-548
• /
• 2021

In this paper, the feasibility of generating solar power near an abandoned quarry is examined with the objectives of resolving the essential problems that quarries encounter, such as rockfalls and space usage issues. On an abandoned quarry site in Sadang, Seoul, Republic of Korea, two different PV installation methods were analyzed. The first is attaching PV directly on the quarry slope. Since there are no corresponding safety standards and precedents for installing solar panels directly on slopes, the power generation potential was calculated by using topographic data and reasonable assumptions. The surface area of cut slope section was extracted from the Digital Elevation Model(DEM) via ArcGIS and Python programming to calculate the tilt and power capacity of installable panels. The other approach is installing PV as a rockfall barrier, and the power generation potential was analyzed with the assumption that the panel is installed in the direction of facing solar irradiation. For the derivation of power generation, the renewable energy generation analysis program SAM(System Advisor Model) was used for both methods. According to the result, quarries that have terminated resource extraction and remain devastated have the potential to be transformed into renewable energy generation sites.

• Journal of Korean Association for Spatial Structures
• /
• v.8 no.4
• /
• pp.47-55
• /
• 2008

This paper deals with basic theories and some numerical results on structural optimization for geodesic dome. First of all, the space efficiency of geodesic dome is investigated by using the ratio of icosahedron's surface area to the internal volume enclosed by it. The procedure how to create the geodesic dome is also provided in systematic way and implemented and utilized into the design optimization code ISADO-OPT. The mathematical programming technique is introduced to find out the optimum pattern of member size of geodesic dome against a point load. In this study, total weight of structure is considered as the objective function to be minimized and the displacement occurred at loading point and member stresses of geodesic dome are used as the constraint functions. The finite difference method is used to calculate the design sensitivity of objective function with respect to design variables. The SLP, SQP and MFDM available in the optimizer DoT is used to search optimum member size patterns of geodesic dome. It is found to be that the optimum member size pattern can be efficiently obtained by using the proposed design optimization technique and numerical results can be used as benchmark test as a basic reference solution for design optimization of dome structures.

• Journal of Intelligence and Information Systems
• /
• v.16 no.2
• /
• pp.129-141
• /
• 2010

An Internet shopping mall for clothing operates a warehouse for packing and shipping products to fulfill its orders. All the products in the warehouse are put into the boxes of same brands and the boxes are stored in a row on shelves equiped in the warehouse. To make picking and managing easy, boxes of the same brands are located side by side on the shelves. When new products arrive to the warehouse for storage, the products of a brand are put into boxes and those boxes are located adjacent to the boxes of the same brand. If there is not enough space for the new coming boxes, however, some boxes of other brands should be moved away and then the new coming boxes are located adjacent in the resultant vacant spaces. We want to minimize the movement of the existing boxes of other brands to another places on the shelves during the warehousing of new coming boxes, while all the boxes of the same brand are kept side by side on the shelves. Firstly, we define the adjacency of boxes by looking the shelves as an one dimensional series of spaces to store boxes, i.e. cells, tagging the series of cells by a series of numbers starting from one, and considering any two boxes stored in the cells to be adjacent to each other if their cell numbers are continuous from one number to the other number. After that, we tried to formulate the problem into an integer programming model to obtain an optimal solution. An integer programming formulation and Branch-and-Bound technique for this problem may not be tractable because it would take too long time to solve the problem considering the number of the cells or boxes in the warehouse and the computing power of the Internet shopping mall. As an alternative approach, we designed a fast heuristic method for this reallocation problem by focusing on just the unused spaces-empty cells-on the shelves, which results in an assignment problem model. In this approach, the new coming boxes are assigned to each empty cells and then those boxes are reorganized so that the boxes of a brand are adjacent to each other. The objective of this new approach is to minimize the movement of the boxes during the reorganization process while keeping the boxes of a brand adjacent to each other. The approach, however, does not ensure the optimality of the solution in terms of the original problem, that is, the problem to minimize the movement of existing boxes while keeping boxes of the same brands adjacent to each other. Even though this heuristic method may produce a suboptimal solution, we could obtain a satisfactory solution within a satisfactory time, which are acceptable by real world experts. In order to justify the quality of the solution by the heuristic approach, we generate 100 problems randomly, in which the number of cells spans from 2,000 to 4,000, solve the problems by both of our heuristic approach and the original integer programming approach using a commercial optimization software package, and then compare the heuristic solutions with their corresponding optimal solutions in terms of solution time and the number of movement of boxes. We also implement our heuristic approach into a storage location assignment system for the Internet shopping mall.

• Smart Structures and Systems
• /
• v.9 no.3
• /
• pp.231-251
• /
• 2012

The stochastic optimal control for a piezoelectric spherically symmetric shell subjected to stochastic boundary perturbations is constructed, analyzed and evaluated. The stochastic optimal control problem on the boundary stress output reduction of the piezoelectric shell subjected to stochastic boundary displacement perturbations is presented. The electric potential integral as a function of displacement is obtained to convert the differential equations for the piezoelectric shell with electrical and mechanical coupling into the equation only for displacement. The displacement transformation is constructed to convert the stochastic boundary conditions into homogeneous ones, and the transformed displacement is expanded in space to convert further the partial differential equation for displacement into ordinary differential equations by using the Galerkin method. Then the stochastic optimal control problem of the piezoelectric shell in partial differential equations is transformed into that of the multi-degree-of-freedom system. The optimal control law for electric potential is determined according to the stochastic dynamical programming principle. The frequency-response function matrix, power spectral density matrix and correlation function matrix of the controlled system response are derived based on the theory of random vibration. The expressions of mean-square stress, displacement and electric potential of the controlled piezoelectric shell are finally obtained to evaluate the control effectiveness. Numerical results are given to illustrate the high relative reduction in the root-mean-square boundary stress of the piezoelectric shell subjected to stochastic boundary displacement perturbations by the optimal electric potential control.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.3
• /
• pp.56-63
• /
• 2016

For air express service providers offering various express delivery services such as overnight delivery and next-business day delivery services, establishing quickly cargo loading plans is one of important issues owing to the characteristics of air express business, i.e., a short amount of time is available to complete all cargo loading operations before flight departure after receiving air express containers, pallets and bulks. On the other hand, one of major concerns in the air cargo loading planning is to make a plan that insures the stability of an aircraft to avoid take-off, flight, and landing accidents. To this end, this paper considers an air cargo loading planning problem, which is the problem of determining locations in the aircraft cargo space where air containers, pallets and bulks to be loaded while insuring the aircraft stability, motivated from DHL and Air Hong Kong. The objective of the problem is to maximize the total revenue gained from loading air express containers, pallets and bulks. To solve the problem, this paper suggests a simulated annealing algorithm to overcome impracticality of the integer programming model developed by a previous study requiring excessive computation time. The results of computational experiments show that the heuristic algorithm is a viable tool for establishing express cargo loading plans as giving robust and good solutions in a short amount of computation time. Scenario analyses are performed to investigate the effect of the current activities of air express carriers on the revenue change and to draw practical implications for air express service providers.

• Journal of KIISE
• /
• v.44 no.9
• /
• pp.986-991
• /
• 2017

In this paper, we present a method for synthesizing imperative programs from input-output examples. Given (1) a set of input-output examples, (2) an incomplete program, and (3) variables and integer constants to be used, the synthesizer outputs a complete program that satisfies all of the given examples. The basic synthesis algorithm enumerates all possible candidate programs until the solution program is found (enumerative search). However, it is too slow for practical use due to the huge search space. To accelerate the search speed, our approach uses code optimization and avoids unnecessary search for the programs that are syntactically different but semantically equivalent. We have evaluated our synthesis algorithm on 20 introductory programming problems, and the results show that our method improves the speed of the basic algorithm by 10x on average.