• International journal of advanced smart convergence
• /
• v.9 no.4
• /
• pp.52-61
• /
• 2020

The AHP method was used in 30 provinces of China to construct the index system of creative space efficiency evaluation and determine the weight of each index. The fuzzy comprehensive evaluation method was further used to score the indexes at all levels, and then the total efficiency score was sorted. The purpose of this study is to adjust the regional layout of creative space reasonably and implement financial policies accurately through the evaluation of the efficiency of creative space. The results is ranking top in weight of several indicators, which include the number of incubated Startups, the number of innovation and entrepreneurship mentors, the survival rate of incubator, the innovative training activities, etc. It was also found that Beijing, Shanghai, Jiangsu, Guangdong and Zhejiang ranked first in the score of creative space efficiency. This study is meaningful in that it was In order to effectively solve the problem of the imbalance of the creative space efficiency in China's province, by coordinating the regional pattern, establishing a sound service system and improving the efficiency evaluation system.

• Journal of the Architectural Institute of Korea Structure & Construction
• /
• v.34 no.6
• /
• pp.11-18
• /
• 2018

Isogeometric concept is introduced to find out the optimum layout of plane structure under free vibration. Eigenvalue problem is formulated and numerically solved in order to obtain natural frequencies and mode shapes of plane structures. For the exact geometric expression of the structure, the Non-Uniform Rational B-spline Surface (NURBS) basis functions is employed and it is also used to define the material density functions. A node-wise design variables is adopted to deal with the updating of material density in topology optimization (TO). The definition of modal strain energy is employed to achieve the maximization of fundamental frequency through its minimization. The verification of the proposed TO technique is performed by a series of benchmark test for plane structures.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.104-108
• /
• 2021

In order to improve performance in IoT, edge computing system, a memory is usually configured in a hierarchical structure. Based on the distance from CPU, the access speed slows down in the order of registers, cache memory, main memory, and storage. Similar to the change in performance, energy consumption also increases as the distance from the CPU increases. Therefore, it is important to develop a technique that places frequently used data to the upper memory as much as possible to improve performance and energy consumption. However, the technique should solve the problem of cache performance degradation caused by lack of spatial locality that occurs when the data access stride is large. This study proposes a technique to selectively place data with large data access stride to a software-controlled cache. By using the proposed technique, data spatial locality can be improved by reducing the data access interval, and consequently, the cache performance can be improved.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.4
• /
• pp.550-556
• /
• 1986

This paper proposes a two-layer channel routing algorithm using the division of signal nets in LSI/VLSI layout design. To solve the vertical constraint problem, the doglegging method is used. Although signal net division and the dogleg are used, the routing is accomplished within local channel density and the increase in vias is repressed by assining the vertical segments to the metal layer and the horizontal segments to the poly layer. The algorithm was implemented on a VAX 11/780 computer. The effectiveness of the proposed algorithm is proved by appling this algorithm to Deutch's difficult example.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.4
• /
• pp.557-564
• /
• 1986

This paper describes a standard cell placement strategy which consists of three kconsecutive steps` initial placement, iterative placement improvement, and string placement. In the initial placement step, cell placement was done by solving the linear ordering problem for a one-dimensional layout of standard cells and then zigzaging the resultant linear order width in the chip plane. The iterative placement improvement step is based on the iterative pairwise interchange using the estimated total routing length as a figure-or -merit. The string placement is used to reorder cells and terminals in each etandard cell row such that channel routing in the adjacent channels is not blocked by cyclic constraints and needs fewer routing tracks. The placement program is coded in PASCAL and kimplemented on a VAX-11/750 computer. Experimental results for several examples are included.

• ETRI Journal
• /
• v.44 no.1
• /
• pp.125-134
• /
• 2022

Visible light communication (VLC) systems incorporate ambient lighting and wireless data transmission, and the experienced channel in indoor VLC is a major topic that should be examined for reliable communication. In this study, it is realized that multiple transmitters in classical alignment are the forceful factors for channel characteristics. In the frequency band, fluctuations with sudden drops are observed, where the fluctuation shape is related to the source layout and receiver location. These varying frequency-selective channels need solutions, especially for mobile users, because sustained channel estimation and equalization are necessary as the receiver changes its location. It is proven that using light-emitting diodes (LEDs) with highly directional beams as sources or using a detector with a narrow field of view (FOV) in the receiver may help partially alleviate the problem; the frequency selectivity of the channel reduces in some regions of the room. For flat fading channel characteristics all over the room, LEDs should be aligned in hexagonal cellular structure, and detector FOV should be arranged according to the cell dimension outcomes.

• ETRI Journal
• /
• v.45 no.6
• /
• pp.1035-1045
• /
• 2023

We propose a novel graphics processing unit (GPU) algorithm that can handle a large-scale 3D fast Fourier transform (i.e., 3D-FFT) problem whose data size is larger than the GPU's memory. A 1D FFT-based 3D-FFT computational approach is used to solve the limited device memory issue. Moreover, to reduce the communication overhead between the CPU and GPU, we propose a 3D data-transposition method that converts the target 1D vector into a contiguous memory layout and improves data transfer efficiency. The transposed data are communicated between the host and device memories efficiently through the pinned buffer and multiple streams. We apply our method to various large-scale benchmarks and compare its performance with the state-of-the-art multicore CPU FFT library (i.e., fastest Fourier transform in the West [FFTW]) and a prior GPU-based 3D-FFT algorithm. Our method achieves a higher performance (up to 2.89 times) than FFTW; it yields more performance gaps as the data size increases. The performance of the prior GPU algorithm decreases considerably in massive-scale problems, whereas our method's performance is stable.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.1
• /
• pp.37-42
• /
• 2024

This paper suggests polynomial time algorithm for cutwidth minimization problem that classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. To find the minimum cutwidth CW_f(G)=max_𝜈∈_VCW_f(𝜈)for given graph G=(V,E),m=｜V｜, n=｜E｜, the proposed algorithm divides neighborhood N_G[𝜈_i] of the maximum degree vertex 𝜈_i in graph G into left and right and decides the vertical cut plane with minimum number of edges pass through the vertex 𝜈_i firstly. Then, we split the left and right N_G[𝜈_i] into horizontal sections with minimum pass through edges. Secondly, the inner-section vertices are connected into line graph and the inter-section lines are connected by one line layout. Finally, we perform the optimization process in order to obtain the minimum cutwidth using vertex moving method. Though the proposed algorithm requires O(n²) time complexity, that can be obtains the optimal solutions for all of various experimental data

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.44 no.4
• /
• pp.587-593
• /
• 2024

Recently, countries such as Japan and France are actively using three-dimensional development of land to secure available land. In Korea, too, the lack of available land within cities is a major problem, and in particular, the problem of decline due to disconnection due to division due to the railroad is emerging. As a solution to this, interest in three-dimensional development is increasing day by day, but the application or legal effectiveness of the concept is still lacking. Therefore, in this study, assuming that the Gyeongbu Line railway in Busan is underground, we attempted to apply the type of multi-dimensional development appropriate for each region to the land that would be created, and to predict how much it would contribute to urban competitiveness by arranging the necessary facilities for each part. To this end, we have developed an urban competitiveness index that can evaluate the layout of facilities by region, and since the range of the region is different from the existing evaluation indicator, it is judged that the three-dimensional development of the railway facility site can have a positive impact on the competitiveness of the city as a result of the prediction through a subjective survey.

• Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.140-151
• /
• 2014

Storing, and the loading and unloading of materials at production sites in the manufacturing sector for mass production is a critical problem that affects various aspects: the layout of the factory, line-side space, logistics, workers' work paths and ease of work, automatic procurement of components, and transfer and supply. Traditionally, the nesting problem has been an issue to improve the efficiency of raw materials; further, research into mainly 2D optimization has progressed. Also, recently, research into the expanded usage of 3D models to implement packing optimization has been actively carried out. Nevertheless, packing algorithms using 3D models are not widely used in practice, due to the large decrease in efficiency, owing to the complexity and excessive computational time. In this paper, the problem of efficiently loading and unloading freeform 3D objects into a given container has been solved, by considering the 3D form, ease of loading and unloading, and packing density. For this reason, a Group Packing Approach for workers has been developed, by using analyzed truck packing work patterns and Group Technology, which is to enhance the efficiency of storage in the manufacturing sector. Also, an algorithm for 3D packing has been developed, and implemented in a commercial 3D CAD modeling system. The 3D packing method consists of a grouping algorithm, a sequencing algorithm, an orientating algorithm, and a loading algorithm. These algorithms concern the respective aspects: the packing order, orientation decisions of parts, collision checking among parts and processing, position decisions of parts, efficiency verification, and loading and unloading simulation. Storage optimization and examination of the ease of loading and unloading are possible, and various kinds of engineering analysis, such as work performance analysis, are facilitated through the intelligent 3D packing method developed in this paper, by using the results of the 3D model.