• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2015년도 추계학술대회
• /
• pp.1093-1094
• /
• 2015

다양한 디바이스에서의 웹의 표현은 반응형 웹의 사용으로 좀 더 통일된 모습으로 구현이 가능하다. 본 논문에서는 그 중 가변 레이아웃을 구현할 수 있는 방법에 대한 연구를 진행 하였다. 최신 기술인 플렉서블 박스로 가변 레이아웃을 구성하는 방법을 살펴보고, 그 장단점을 기술한다. 또한 플렉서블 박스 적용으로 발생한 문제들을 해결할 수 있는 방법들을 제안한다.

• 대한전자공학회논문지
• /
• 제19권3호
• /
• pp.19-27
• /
• 1982

LSI, 프린트 기판등의 배치 문제에 있어서의 목적 함수로써 총배선장의 최소화, 통과선선의 최소화가 지금까지 채용되어 왔었다. 이 목적 함수는 layout의 궁극적인 목표(100% 결선률)를 대국적으로는 반영하고 있다고 말할 수 있지만 국기적으로 혼잡한 배선 상태를 나타내고 있지 않기 때문에 목적 함수로써 불충분한 경우가 많이 보여 지고 있다. 본 논문에서는 국소적인 배선 혼잡도를 나타내기 위해 쎄그먼트(segment) 혼잡도라고 하는 새로운 개념을 도입하여 이 쎄그먼트 혼잡도를 최소로 하는 것을 목적 함수로 하는 것을 제안하였다. 그리고 이 목적 함수를 최적화 하기 위해 능률 좋은 휴리스틱 알고리즘을 제안하고 프로그램 실험에 의해 그 유용성을 확인하였다. 쎄그먼트 혼잡도의 최대치는 총배선장이 짧게 되면 적게 되고 총배선장이 길게 되면 크게 되는 것이 실험의 결과로 얻어져 총배선장을 ?게 하고 동시에 쌔그먼트 혼잡도의 최대치를 적게 하는 제어 파라미터 (혼잡도 Parameter)의 값의 범위를 실험적으로 구하였다.

• 의료ㆍ복지 건축 : 한국의료복지건축학회 논문집
• /
• 제13권2호
• /
• pp.27-36
• /
• 2007

Recently, hospital patients experience anxiety, confusion, and stress about wayfinding as the spacial layout and treatment circulatory system of hospitals have become complicated due to their oversized and complex structure. As part of finding a solution to the problem, this study seeks to examine what are the essential elements of the wayfinding planning of O.P.D. in general hospitals, to develop the model of wayfinding, and to suggest the methods of improving the wayfinding system. The research methods of this study adopted were literature review in wayfinding cognition, plan analysis of ten general hospitals, space analysis of these hospitals through space syntax, analysis of the system of visual-perceptual information through a field study, and analysis of surveys and follow-up surveys conducted to support the results. Based on these results, the proposals for finding decision points, providing the information, and developing a model planning are listed as follows. 1) The comprehensive understanding of O.P.D. spacial layout and the visual-perceptual information system is necessary to find the essential elements of wayfinding. 2) The decision points are found through the full understanding of spacial functions, circulation systems, and facility configuration, considering the spacial layout, the bound of the visual-perceptual information system, and the circulatory system. Furthermore, the information decision points could be confined by space syntax. 3) The checklist and color compound & color codes, developed through the planning of signage system and color system could be applied to the methods of providing the information. 4) The planning of wayfinding system according to the whole process of practices for outpatients was mentioned above. The system of visual-perceptual information developed through the process of this study should be integrated in the spacial layout of the whole O.P.D.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -1
• /
• pp.361-364
• /
• 2002

Shortest path problem belongs to the combinatorial optimization problem and plays an important role in the field of computer aided design. It can either be directly applied as in the case of routing or serves as a important subroutine in more complex problems. In this paper, a systolic array for the SSSP(single-source shortest path problem) was derived. The array was modeled and simulated in RTL level using VHDL, then synthesized to a schematic and finally implemented to a layout using the cell library based on 0.35 $\mu\textrm{m}$ CMOS 1-poly 4-metal CMOS technology.

• 대한안전경영과학회지
• /
• 제13권1호
• /
• pp.133-142
• /
• 2011

Overhead facility design problem(OFDP) is one of the shortest rectilinear flow network problem(SRFNP)[4]. Genetic algorithm(GA), artificial immune system(AIS), population management genetic algorithm (PM) and greedy randomized adaptive search procedures (GRASP) were introduced to solve OFDP. A path matrix formed individual was designed to represent rectilinear path between each facility. An exchange crossover operator and an exchange mutation operator were introduced for OFDP. Computer programs for each algorithm were constructed to evaluate the performance of algorithms. Computation experiments were performed on the quality of solution and calculations time by using randomly generated test problems. The average object value of PM was the best of among four algorithms. The quality of solutions of AIS for the big sized problem were better than those of GA and GRASP. The solution quality of GRASP was the worst among four algorithms. Experimental results showed that the calculations time of GRASP was faster than any other algorithm. GA and PM had shown similar performance on calculation time and the calculation time of AIS was the worst.

• 산업경영시스템학회지
• /
• 제24권62호
• /
• pp.21-32
• /
• 2001

The two-dimensional guillotine cutting problem is to maximize sum of piece profits that cut from one stock rectangle and widely applied in the industry. The branch-and-bound method for this problem uses complementarily several upper bounds(the Gilmore and Gomoryp[8]'s two-dimensional knapsack function and the Hifi and Zissimopoulos[10]'s method using one-dimensional knapsack problem, etc) to reduce the number of searched nodes. These upper bounds has a shortcoming that does not consider the bound and layout of pieces simultaneously. In this paper, we propose an efficient upper bound which can complement the shortcoming of existing upper bounds. The proposed upper bound needs less memory spaces and computing time. Computational results show that the proposed upper bound significantly contribute to reduce the computational amount of time and number of searched nodes in tree.

• 한국경영과학회지
• /
• 제34권3호
• /
• pp.43-53
• /
• 2009

The pallet loading problem(PLP) requires the best orthogonal layout that loads the maximum number of identical boxes(small rectangle) onto a pallet(large rectangle). Since the high pallet utilization saves the distribution and storage costs, many heuristic and exact algorithms have been developed so far. Martins and Dell have found the optimal layouts for the all PLPs less than or equal to 100 boxes except for only 5 problems in their recent research. This paper defines the 'stair structure' and proposes a new exact algorithm applying it. In order to show the priority of the proposed algorithm, computational results are compared to previous algorithms and the optimal layouts for the S unsolved problems are given.

• 대한산업공학회지
• /
• 제27권3호
• /
• pp.281-288
• /
• 2001

We consider in this article a multi-objective part-machine grouping problem in which parts have alternative process plans and expected annual demand of each part is known. This problem is characterized as optimally determining part sets and corresponding machine cells such that total sum of distance (or dissimilarity) between parts and total sum of load differences between machines are simultaneously minimized. Two heuristic algorithms are proposed, and examples are given to compare the performance of the algorithms.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1991년도 춘계공동학술대회 발표논문 및 초록집; 전북대학교, 전주; 26-27 Apr. 1991
• /
• pp.464-464
• /
• 1991

We address the problem of designing a physical CATV network with switched-star topology in which the broadband interactive service is provided. There are two types of decision variables: One is where to place conduit paths, and the other is how many cable units to be installed on each link traversed by an established conduit path. Due to the serious drawback of the conventional approach partitioning the problem into two subproblems, the unified approach handled in one setting is used here to attack the whole problem without dividing into two ones. In this paper, we present a mathematical design model and propose an efficient solution method exploiting the nice structure of it. In addition to this physical design, some results on logical network configuration have also been made. Finally, computaional experiments are conducted to illustrate the efficiency of our design approach.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.552-552
• /
• 2000

In recent years, a number of successful nesting approaches have been developed by using the various heuristic algorithms, and due to their application potential several commercial CAD/CAM packages include a nesting module for solving the layout problem. Since a large portion of the complexity of the part nesting problem results from the overlapping computation, the geometric representation is one of the most important factors to reduce the complexity of the problem. The proposed part representation method can easily handle parts and raw materials with widely varying geometrical shape by using the redesigning modules. This considerably reduces the amount of processed data and consequently the run time of the computer. The aim of this research is to develop parametric macro for two-dimensional cutting stock on the Auto-CAD system. Therefore, this research can be called "pre-nesting"