• Wind and Structures
• /
• 제36권3호
• /
• pp.149-160
• /
• 2023

Lightness and flexibility of membrane roofs make them very sensitive to any external load. One of the most important parameters that controls their behavior, especially under wind load is the sag/span ratio of edge cables. Based on the value of the pretension force in the edge cables and the horizontal projection of the actual area covered by the membrane, an optimized design range of cable sag/span ratios has been determined through carrying on several membrane form-finding analyses. Fully coupled fluid structure dynamic analyses of these membrane roofs are performed under wind load with several conditions using the CFD method. Through investigating the numerical results of these analyses, the behavior of membrane roofs with cables sag/span ratios selected from the previously determined optimized design range has been evaluated.

• 한국통신학회논문지
• /
• 제30권8C호
• /
• pp.801-809
• /
• 2005

본 논문에서는 디인터레이싱 방법 중에서 가장 중요한 요소인 공간 필터의 성능 개선을 위한 새로운 알고리즘을 제안한다. 기존의 에지 기반 알고리즘들은 보간의 성능을 좌우하는 정확한 에지 방향을 판단함에 있어서 만족스럽지 못하다. 제안하는 알고리즘은 에지 대신에 원 영상의 이진화 된 영상을 근간으로 에지의 방향과 기울기를 판단함으로써 효율성과 정확도를 증가시켰으며 보다 완만한 각에서의 방향판단을 위하여 탐색 윈도우 수평 크기를 IS로 증가시켰다. 기존의 에지를 이용한 방항 판단보다 이진화 된 이미지를 근간으로 에지의 방항과 기울기를 판단하여 보간 했을 때 판단의 오류를 최소화하여 차질을 향상시킬 수 있었다. 다양한 종류의 영상에 대한 컴퓨터 모의 실험 결과를 통하여 기존의 에지 기반의 보간 방법들에 비해 성능이 매우 우수함을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.939-955
• /
• 2010

With the progress of IT and mobile positioning technologies, various types of location-based services (LBS) have been proposed and implemented. Finding a shortest path between two nodes is one of the most fundamental tasks in many LBS related applications. So far, there have been many research efforts on the shortest path finding problem. For instance, $A^*$ algorithm estimates neighboring nodes using a heuristic function and selects minimum cost node as the closest one to the destination. Pruning method, which is known to outperform the A* algorithm, improves its routing performance by avoiding unnecessary exploration in the search space. For pruning, shortest paths for all node pairs in a map need to be pre-computed, from which a shortest path container is generated for each edge. The container for an edge consists of all the destination nodes whose shortest path passes through the edge and possibly some unnecessary nodes. These containers are used during routing to prune unnecessary node visits. However, this method shows poor performance as the number of unnecessary nodes included in the container increases. In this paper, we focus on this problem and propose a new border line-based pruning scheme for path routing which can reduce the number of unnecessary node visits significantly. Through extensive experiments on randomly-generated, various complexity of maps, we empirically find out optimal number of border lines for clipping containers and compare its performance with other methods.

• 한국공작기계학회논문집
• /
• 제11권4호
• /
• pp.75-81
• /
• 2002

In this study, experiments were carried out to investigate the characteristics of grinding and wear process of diamond wheel during grinding ceramic materials. Normal component of grinding resistance was decreasing while increase of spindle speed. The resistance of vitrified bond wheel was less then that of resinoid bond wheel because of imbedded large holes on the surface of cutting edge. Surface roughness was decreasing while increase of spindle speed. The surface roughness using vitrified bond wheel was less than that of resinoid bond wheel because of small elastic deformation. After continuous finding of ceramics, cutting edge ratio of resinoid bond wheel decreased. For the case of vitrified bond wheel, cutting edge ratio did not change.

• Management Science and Financial Engineering
• /
• 제16권3호
• /
• pp.85-93
• /
• 2010

Given an undirected network with a set of source-sink pairs, we are assumed to get a benefit if a pair of source and sink nodes are connected. The k-edge survivability of a network is defined as the total benefit secured after arbitrarily selected k edges are destroyed. The problem of computing k-edge survivability is known to be NP-hard and has applications of evaluating the survivability or vulnerability of a network. In this paper, we consider the k-edge survivability problem restricted to ring networks and develop an algorithm to solve it in O($n^3$|K|) time where n is the number of nodes and K is the set of source-sink pairs.

• 한국경영과학회지
• /
• 제6권2호
• /
• pp.25-34
• /
• 1981

In this paper, we propose a non-edge following method for linear programs. Unlike alledged poor performance of algorithms of this type, this method performs well at least with 25 randomly generated problems. This method is comparable to Rosen's gradient projection method as applied to the dual formulation. The latter is of general purpose, and no implementation rules are available for linear program applications. This paper suggests ways of finding improving dual feasible directions, and of allowing to move across the extreme faces of a higher dimension polyhedron. Rather simple computational rules are provided for projection operations needed at each iteration.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1986년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 17-18 Oct. 1986
• /
• pp.383-386
• /
• 1986

In this paper, ultrasonic range finding module for the self-contained robot, INHAE-1, is presented. This system is processed, using Z-80 microprocessor, a much of information on the surrounding condition in real time and is realted a sensor for many side data acqusition with a stepping motor. Also this system can obtain the more correct edge of the obstacle using the standard deviation of the least-square method. In this experiment, it gives more correct information to mobile robot of the blind guidance and improves the orientation of the robot path.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 컴퓨터소사이어티 추계학술대회논문집
• /
• pp.199-202
• /
• 2003

In the research for Unmaned Air Vehicles(UAVs), the use of Vision-sensor has been increased. It is possible to calculate the position information of air vehicle by finding a horizontal line. In this paper, we proposed a vision-based algorithm for finding the horizontal line. Experimental results show that the proposed algorithm is faster than an existing algorithm.

• 한국컴퓨터정보학회논문지
• /
• 제20권3호
• /
• pp.107-113
• /
• 2015

본 논문은 되먹임 집합 문제인 무방향 그래프의 정점과 간선, 방향 그래프의 노드와 호 문제들 중 간선 문제에 한정한 최소 원소개수 되먹임 간선 집합과 최소 가중치 되먹임 간선 집합 문제의 최적 해를 다항시간으로 얻는 알고리즘을 제안하였다. 제안된 알고리즘은 그래프의 간선 집합은 최대신장트리 간선 집합과 최소 되먹임 간선집합의 합이 되는 특성을 적용하였다. 즉, 최소 되먹임 간선집합은 최대신장트리 간선 집합의 여집합인 특성이 있다. 제안된 알고리즘은 최소신장트리를 얻는 Kruskal 알고리즘을 변형시켜 간선들의 가중치를 내림차순으로 정렬시켜 사이클이 발생하지 않는 간선은 최대신장트리 간선 집합 MXST로, 사이클이 발생하는 간선은 되먹임 간선 집합 FES로 양분하는 방법으로 최적 해를 얻었다. 제안된 알고리즘은 그래프의 간선 수 만큼 수행하는 선형시간 복잡도를 갖는 특징이 있다. 간선 가중치가 없는 경우와 가중치가 있는 다양한 무방향 그래프에 제안된 알고리즘을 적용한 결과 100% 쉽게 최적 해를 얻는데 성공하였다.

• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2005년도 BIOINFO 2005
• /
• pp.228-233
• /
• 2005

The protein side-chain packing problem (SCPP) is known to be NP-complete. Various graph theoretic based side-chain packing algorithms have been proposed. However as the size of the protein becomes larger, the sampling space increases exponentially. Hence, one approach to cope with the time complexity is to decompose the graph of the protein into smaller subgraphs. Some existing approaches decompose the graph into biconnected components at an articulation point (resulting in an at-most 21-residue subgraph) or solve the SCPP by tree decomposition (4-, 5-residue subgraph). In this regard, we had also presented a deterministic based approach called as SPWCQ using the notion of maximum edge weight clique in which we reduce SCPP to a graph and then obtain the maximum edge-weight clique of the obtained graph. This algorithm performs well for a protein of less than 500 residues. However, it fails to produce a feasible solution for larger proteins because of the size of the search space. In this paper, we present a new heuristic approach for the side-chain packing problem based on the maximum edge-weight clique finding algorithm that enables us to compute the side-chain packing of much larger proteins. Our new approach can compute side-chain packing of a protein of 874 residues with an RMSD of 1.423${\AA}$.