• 한국ITS학회:학술대회논문집
• /
• 2008.11a
• /
• pp.205-210
• /
• 2008

• Journal of the Korean Institute of Educational Facilities
• /
• v.24 no.2
• /
• pp.3-10
• /
• 2017

This study compared evacuation effectiveness between the conventional school auditorium plan and a suggested hypothetical plan that was generated by a mathematical model, which is commonly applied in the field of industrial engineering. Recent school buildings became much more complicated in floor planning due to new social needs and modern curriculum than the old days. Nevertheless, architect's approach to floor composition in terms of fire emergency evacuation planning, still has no relation to optimized effective but relies more on an conventional school planning. Therefore, since school buildings are much more likely to be exposed to any fire related events than any other building types, emergency exit effectiveness based on spatial composition has to be seriously evaluated with a scientific method. The algorithm, which acquires the number of persons in each spatial type(node) per floor and the minimum physical distance between spatial types(arc), can propose the most optimized spatial layout per floor regarding emergency evacuation event. Consequently, this study evaluated school's fire exit effectiveness focusing on auditorium area with the scientific tool and suggested the most reliable spatial layout regarding possibile emergency evacuation event.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.10
• /
• pp.1131-1146
• /
• 1992

In this paper, we suggest a new algorithm applied to the segmentation of published documents to obtain constituent and layout information of document. Firstly, we begin the process of blocking and labeling on a 300dpi scanned document. Secondly, we classify the blocked document by individual sub-regions. Thirdly, we group sub-regions into graphic areas and text areas. Finally, we extract information for layout recognition by using the data. From an experiment on papers of an academic society, we obtain the above 98% of region classification rate and extraction rate of information for the layout recognition.

• Smart Structures and Systems
• /
• v.14 no.1
• /
• pp.39-54
• /
• 2014

Node layout optimization of structural wireless systems is investigated as a means to prolong the network lifetime without, if possible, compromising information quality of the measurement data. The trade-off between these antagonistic objectives is studied within a multi-objective layout optimization framework. A Genetic Algorithm is adopted to obtain a set of Pareto-optimal solutions from which the end user can select the final layout. The information quality of the measurement data collected from a heterogeneous WSN is quantified from the placement quality indicators of strain and acceleration sensors. The network lifetime or equivalently the network energy consumption is estimated through WSN simulation that provides realistic results by capturing the dynamics of the wireless communication protocols. A layout optimization study of a monitoring system on the Great Belt Bridge is conducted to evaluate the proposed approach. The placement quality of strain gauges and accelerometers is obtained as a ratio of the Modal Clarity Index and Mode Shape Expansion values that are computed from a Finite Element model of the monitored bridge. To estimate the energy consumption of the WSN platform in a realistic scenario, we use a discrete-event simulator with stochastic communication models. Finally, we compare the optimization results with those obtained in a previous work where the network energy consumption is obtained via deterministic communication models.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.6 no.6
• /
• pp.469-477
• /
• 2016

This study develops an approach to assign numbers of facilities (rectangular shape) in a given plant and compares the test results by proposed approach with those by approaches in the literature. An improvement approach is proposed to minimize material handling cost given initial layout. Like popular heuristic approaches, the developed heuristic approach employs interchange routine to improve material handling cost in current layout. Horizontal interchange and vertical interchange procedures are applied to obtain better solution. Also, it is possible to rotate facility layout when the sizes of both facilities are same. However, the proposed approach generates good solutions without shape distortion. That means the shape of facilities remains rectangle in the final solution. In addition, the improve approach can find global optimal solution from local optimal solution by applying Tabu search technique. Based on 25 test problems in the literature, we obtained better solutions than other facility layout approaches in the literature when there are many facilities.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.8
• /
• pp.621-629
• /
• 2020

LRU layout is a complex problem that requires consideration of various criteria such as airworthiness, performance, maintainability and environmental requirements. As aircraft functions become more complex, the necessary equipment is increasing, and unmanned aerial vehicles are equipped with more equipment as a substitute for pilots. Due to the complexity of the problem, the increase in the number of equipment, and the limited development period, the placement of equipment is largely dependent on the engineer's insight and experience. For optimization, quantitative criteria are required for evaluation, but criteria such as safety, performance, and maintainability are difficult to quantitatively compare or have limitations. In this study, we consider the installation and maintenance of the equipment, simplify the deployment model to the traveling salesman problem, Optimization was performed using a genetic algorithm to minimize the weight of the connecting cable between the equipment. When the optimization results were compared with the global calculations, the same results were obtained with less time required, and the improvement was compared with the heuristic.

• ETRI Journal
• /
• v.26 no.6
• /
• pp.520-534
• /
• 2004

As the density of memories increases, unwanted interference between cells and the coupling noise between bit-lines become significant, requiring parallel testing. Testing high-density memories for a high degree of fault coverage requires either a relatively large number of test vectors or a significant amount of additional test circuitry. This paper proposes a new tiling method and an efficient built-in self-test (BIST) algorithm for neighborhood pattern-sensitive faults (NPSFs) and new neighborhood bit-line sensitive faults (NBLSFs). Instead of the conventional five-cell and nine-cell physical neighborhood layouts to test memory cells, a four-cell layout is utilized. This four-cell layout needs smaller test vectors, provides easier hardware implementation, and is more appropriate for both NPSFs and NBLSFs detection. A CMOS column decoder and the parallel comparator proposed by P. Mazumder are modified to implement the test procedure. Consequently, these reduce the number of transistors used for a BIST circuit. Also, we present algorithm properties such as the capability to detect stuck-at faults, transition faults, conventional pattern-sensitive faults, and neighborhood bit-line sensitive faults.

• Genomics & Informatics
• /
• v.4 no.3
• /
• pp.118-124
• /
• 2006

For the direct understanding of flow, pathway data are usually represented as directed graphs in biological journals and texts. Databases of metabolic pathways or signal transduction pathways inevitably contain these kinds of graphs to show the flow. KEGG, one of the representative pathway databases, uses the manually drawn figure which can not be easily maintained. Graph layout algorithms are applied for visualizing metabolic pathways in some databases, such as EcoCyc. Although these can express any changes of data in the real time, it exponentially increases the edge crossings according to the increase of nodes. For the understanding of genome scale flow of metabolism, it is very important to reduce the unnecessary edge crossings which exist in the automatic graph layout. We propose a metabolic pathway drawing algorithm for reducing the number of edge crossings by considering the fact that metabolic pathway graph is scale-free network. The experimental results show that the number of edge crossings is reduced about $37{\sim}40%$ by the consideration of scale-free network in contrast with non-considering scale-free network. And also we found that the increase of nodes do not always mean that there is an increase of edge crossings.

• Transactions of Materials Processing
• /
• v.23 no.8
• /
• pp.501-506
• /
• 2014

Progressive shearing with blanking dies is commonly employed to produce large quantities of tiny sheet metal electronic parts. Sheet metal pins, which are narrow and long, that are sheared with a progressive die set are often twisted. The twist in the sheet metal pins, which usually occurs in the final shearing operation, generally decreases with increasing blank holding force. The blank holding forces in all shearing operations are not the same because of different shearing positions and areas. In the current study, the optimal layout of the springs in a progressive die set to minimize the twist of the sheet metal pin is proposed. In order to find the holding force acting on the tiny narrow blanks produced with the proposed springs during the shearing process, the equivalent area method is used in the structural analysis. The shearing of the sheet-metal pin was simulated to compute the twist angle associated with the blank holding force. The constraint condition satisfying the pre-set blank holding force from the previous shearing operations was imposed. A design of experiments (DOE) was numerically implemented by analyzing the progressive die structure and by simulating the shearing process. From the meta-model created from the experimental results and by using a quadratic response surface method (PQRSM), the optimal layout of the springs was determined. The twist of sheet metal pin associated with the optimal layout of the springs found in the current study was compared with that of an existing progressive die to obtain a minimal amount of twist.

• Journal of Navigation and Port Research
• /
• v.35 no.8
• /
• pp.657-665
• /
• 2011

This study deals with an integrated problem for deciding sequencing and storage location of export containers together at its receiving operation in the container terminal with a perpendicular layout. The preferred storage location of an export container varies with the priority of the corresponding loading operation and the waiting time of an external truck depends on its storage time. This paper proposes the mixed integer programming model considering the expected arrival time and expected finish time of an external truck and the preferred storage location for its loading operation. And we suggest the heuristic algorithm based on a simulated annealing algorithm for real world adaption. We compare the heuristic algorithm with the optimum model in terms of the computation times and total cost and the performance of the heuristic algorithm is analyzed through a numerical experiment.