• 호남수학학술지
• /
• 제30권4호
• /
• pp.589-602
• /
• 2008

As a survey-type article, the paper reviews various digital topological utilities from digital covering theory. Digital covering theory has strongly contributed to the calculation of the digital k-fundamental group of both a digital space(a set with k-adjacency or digital k-graph) and a digital product. Furthermore, it has been used in classifying digital spaces, establishing almost Van Kampen theory which is the digital version of van Kampen theorem in algebrate topology, developing the generalized universal covering property, and so forth. Finally, we remark on the digital k-surface structure of a Cartesian product of two simple closed $k_i$-curves in ${\mathbf{Z}}^n$, $i{\in}{1,2}$.

• 한국ITS학회 논문지
• /
• 제12권1호
• /
• pp.121-135
• /
• 2013

전 세계적으로 지구온난화로 인한 환경문제가 심각한 위기로 인식되어지면서 세계 각국에서는 전 산업분야에 걸쳐 이산화탄소 배출을 줄이고자 노력하고 있다. 국내 에너지 부문 CO2 배출량의 약 20%를 차지하는 수송 분야의 이산화탄소 배출을 감소시키기 위해서는 전기자동차 보급 확산이 필수적이다. 최근 정부에서 전기자동차 보급 활성화를 위해 많은 노력을 기울이고 있으나 긴 충전시간과 배터리의 가격에 의한 비싼 차량가격, 짧고 불규칙한 운행거리와 부족한 충전 인프라 등으로 인하여 향후 전기자동차의 보급 확대는 매우 불투명한 상태이다. 이러한 단점을 해결하고 효과적으로 전기자동차를 보급할 수 있는 방법 중 하나가 바로 배터리 공용제 기반의 배터리 자동교환형 전기자동차 시스템이다. 이를 위해서는 배터리를 자동으로 교환해주는 시설인 배터리 교환소 (BSS: Battery Swapping Stations)가 필요하게 되는데, BSS는 배터리 교환을 통해 전기자동차가 긴 충전시간을 소모할 필요 없이 짧은 시간 내에 배터리를 충전하고 이동할 수 있도록 하는 시스템이다. 이러한 시스템을 대중교통, 특히 공공버스에 적용함으로써 보다 빠른 시간 안에 전기자동차를 보급, 확산시키는 것이 가능하다. 일반버스를 전기버스로 전환하여 버스 노선을 운영할 경우 전기버스가 중간에 멈추지 않도록 적절한 위치에 충전시설을 구축할 필요가 있다. 전기버스에 대한 충전시설은 버스 노선의 기 종점 및 기존 버스정류장에 추가로 설치하여 버스가 승객의 승 하차를 위해 정차할 때 신속하게 배터리를 교환할 수 있게 구축해야 한다. 본 연구에서는 전기버스를 위한 배터리 자동교환충전시설의 위치선정 문제를 Set Covering Problem에 적용하여 해결하였다. 배터리 충전 시 최대 주행거리를 영향권으로 설정하였으며 메타 휴리스틱 기법인 그리디 알고리즘을 활용하여 배터리 교환형 충전인프라 배치 최적화 모델을 개발하였고 현재 운영 중인 서울시의 버스노선을 대상으로 실제 충전시설의 위치를 선정하였다.

• 한국ITS학회 논문지
• /
• 제16권4호
• /
• pp.13-24
• /
• 2017

본 연구에서는 무인택배함의 최적입지를 선정하기 위한 입지조건 정의, 설치개수 결정, 최적입지 선정의 과정을 순차적으로 결합한 방법론을 개발한다. 우선 입지조건으로는 블록화, 접근성, 지역 중심공공시설이 제시되며, 선정된 입지에 대해 set-covering모형과 p-median 모형을 적용하여 설치개수와 최적입지를 각각 결정한다. 이러한 과정을 실제 사례에 적용해봄으로써 모형의 타당성과 실효성을 검증해 본다. 일반주택과 다세대주택으로만 구성된 안산의 한 지역을 대상으로 분석한 결과, 필요한 무인택배함은 2개로 결정되었으며, 5개 후보지 중 가장 적절한 2개 장소가 최적입지로 제시되었다. 이러한 방법론은 무인택배함 설치시 최적의 결정을 내리기 위한 가이드라인을 제공하며, 택배 관련 강력범죄 예방 및 택배이용 활성화를 통한 경제적 파급효과를 기대해 볼 수 있다.

• Journal of applied mathematics & informatics
• /
• 제4권2호
• /
• pp.535-543
• /
• 1997

The application of Hadamard matrix to the paral-lel routings on the hypercube network was presented by Rabin. In this matrix every two rows differ from each other by exactly n/2 positions. A set of n disjoint paths on n-dimensional hypercube net-work was designed using this peculiar property of Hadamard ma-trix. Then the data is dispersed into n packets and these n packet are transmitted along these n disjoint paths. In this paper Rabin's routing algorithm is analyzed in terms of covering problem and as-signment problem. Finally we conclude that n packets dispersed are placed in well-distributed positions during transmisson and the ran-domly selected paths are almost a set of n edge-disjoint paths with high probability.

• Journal of Information Processing Systems
• /
• 제13권5호
• /
• pp.1345-1357
• /
• 2017

A prototype selection method chooses a small set of training points from a whole set of class data. As the data size increases, the selected prototypes play a significant role in covering class regions and learning a discriminate rule. This paper discusses the methods for selecting prototypes in a classification framework. We formulate a prototype selection problem into a set covering optimization problem in which the sets are composed with distance metric and predefined classes. The formulation of our problem makes us draw attention only to prototypes per class, not considering the other class points. A training point becomes a prototype by checking the number of neighbors and whether it is preselected. In this setting, we propose a greedy algorithm which chooses the most relevant points for preserving the class dominant regions. The proposed method is simple to implement, does not have parameters to adapt, and achieves better or comparable results on both artificial and real-world problems.

• 한국경영과학회지
• /
• 제10권1호
• /
• pp.1-8
• /
• 1985

By introducing the concept of reliability of parallel systems the set covering. A branch-and-bound algorithm is developed and illustrated by a numerical example. The procedure has been coded and its computational efficiency is studied.

• Journal of applied mathematics & informatics
• /
• 제7권1호
• /
• pp.335-346
• /
• 2000

This paper discusses the relation of fuzzy sets satisfying some types of fuzzy covering properties. We give some characterizations of such fuzzy sets and investigate a few properties.

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

In interconnection network for parallel processing, the cycle partitioning problem for parallel transmission with faulty vertieces or edges is very important. In this paper, we assume that k($\leq$m-1) edges do not share any vertices of m dimension hypercube Q$_{m}$ and show that it is possible to construct a cycle set which consists of k cycles covering all the vertices of the hypercube and one cycle including one of the given edges. This cycle set can be used to parallel transmission between two vertices joined by faulty edges.s.

• Journal of Information Processing Systems
• /
• 제13권5호
• /
• pp.1089-1102
• /
• 2017

In software systems, it has been observed that a fault is often caused by an interaction between a small number of input parameters. Even for moderately sized software systems, exhaustive testing is practically impossible to achieve. This is either due to time or cost constraints. Combinatorial (t-way) testing provides a technique to select a subset of exhaustive test cases covering all of the t-way interactions, without much of a loss to the fault detection capability. In this paper, an approach is proposed to generate 2-way (pairwise) test sets using genetic algorithms. The performance of the algorithm is improved by creating an initial solution using the overlap coefficient (a similarity matrix). Two mutation strategies have also been modified to improve their efficiency. Furthermore, the mutation operator is improved by using a combination of three mutation strategies. A comparative survey of the techniques to generate t-way test sets using genetic algorithms was also conducted. It has been shown experimentally that the proposed approach generates faster results by achieving higher percentage coverage in a fewer number of generations. Additionally, the size of the mixed covering arrays was reduced in one of the six benchmark problems examined.

• 수산해양기술연구
• /
• 제32권1호
• /
• pp.33-41
• /
• 1996

In order to obtain the most favourable classification system for fishing gears, the problems in the existing systems were investigated and a new system in which the fishing method was adopted as the criterion of classification and the kinds of fishing gears were obtained by exchanging the word method into gear in the fishing methods classified newly for eliminating the problems was established. The new system to which the actual gears are arranged is as follows ; (1)Harvesting gear \circled1Plucking gears : Clamp, Tong, Wrench, etc. \circled2Sweeping gears : Push net, Coral sweep net, etc. \circled3Dredging gears : Hand dredge net, Boat dredge net, etc. (2)Sticking gears \circled1Shot sticking gears : Spear, Sharp plummet, Harpoon, etc. \circled2Pulled sticking gears : Gaff, Comb, Rake, Hook harrow, Jerking hook, etc. \circled3Left sticking gears : Rip - hook set line. (3)Angling gears \circled1Jerky angling gears (a)Single - jerky angling gears : Hand line, Pole line, etc. (b)Multiple - jerky angling gears : squid hook. \circled2Idly angling gears (a)Set angling gears : Set long line. (b)Drifted angling gears : Drift long line, Drift vertical line, etc. \circled3Dragged angling gears : Troll line. (4)Shelter gears : Eel tube, Webfoot - octopus pot, Octopus pot, etc. (5)Attracting gears : Fishing basket. (6)Cutoff gears : Wall, Screen net, Window net, etc. (7)Guiding gears \circled1Horizontally guiding gears : Triangular set net, Elliptic set net, Rectangular set net, Fish weir, etc. \circled2Vertically guiding gears : Pound net. \circled3Deeply guiding gears : Funnel net. (8)Receiving gears \circled1Jumping - fish receiving gears : Fish - receiving scoop net, Fish - receiving raft, etc. \circled2Drifting - fish receiving gears (a)Set drifting - fish receiving gears : Bamboo screen, Pillar stow net, Long stow net, etc. (b)Movable drifting - fish receiving gears : Stow net. (9)Bagging gears \circled1Drag - bagging gears (a)Bottom - drag bagging gears : Bottom otter trawl, Bottom beam trawl, Bottom pair trawl, etc. (b)Midwater - drag gagging gears : Midwater otter trawl, Midwater pair trawl, etc. (c)Surface - drag gagging gears : Anchovy drag net. \circled2Seine - bagging gears (a)Beach - seine bagging gears : Skimming scoop net, Beach seine, etc. (b)Boat - seine bagging gears : Boat seine, Danish seine, etc. \circled3Drive - bagging gears : Drive - in dustpan net, Inner drive - in net, etc. (10)Surrounding gears \circled1Incomplete surrounding gears : Lampara net, Ring net, etc. \circled2Complete surrounding gears : Purse seine, Round haul net, etc. (11)Covering gears \circled1Drop - type covering gears : Wooden cover, Lantern net, etc. \circled2Spread - type covering gears : Cast net. (12)Lifting gears \circled1Wait - lifting gears : Scoop net, Scrape net, etc. \circled2Gatherable lifting gears : Saury lift net, Anchovy lift net, etc. (13)Adherent gears \circled1Gilling gears (a)Set gilling gears : Bottom gill net, Floating gill net. (b)Drifted gilling gears : Drift gill net. (c)Encircled gilling gears : Encircled gill net. (d)Seine - gilling gears : Seining gill net. (e)Dragged gilling gears : Dragged gill net. \circled2Tangling gears (a)Set tangling gears : Double trammel net, Triple trammel net, etc. (b)Encircled tangling gears : Encircled tangle net. (c)Dragged tangling gears : Dragged tangle net. \circled3Restrainting gears (a)Drifted restrainting gears : Pocket net(Gen - type net). (b)Dragged restrainting gears : Dragged pocket net. (14)Sucking gears : Fish pumps.