• 대한치과의료관리학회지
• /
• 제5권1호
• /
• pp.31-37
• /
• 2017

감염관리는 전반적인 의료행위에서 중요성이 부각되고 있으며 치과 또한 철저한 감염관리가 필요하다. 감염의 매개체에는 여러 가지가 있고, 그 중 의료진 의복으로 인한 감염이 있다. 병원 직원의 오염된 의복은 원내감염의 매개체가 될 수 있다. 이에 스케일링 시 에어로졸에 의한 의복오염도를 실험하였다. 가슴, 배, 허벅지, 소매 끝, 바지 끝 부위를 실험 대상으로 하였다. 실험한 자료는 IBM SPSS (ver20.0) 통계프로그램으로 분석하였다. 스케일링 전(대조군)과 스케일링 후(실험군) colony수의 평균값은 ANOVA (일원배치분산분석)을 사용하였으며, 사후 분석은 Scheffe를 시행하였다. 스케일링 전-후 colony수의 평균값에 대한 유의성 검증은 Paired t-test 비모수 검정방법을 사용하였다. 1. 의복의 가슴 부위에서 스케일링 전 colony수의 평균은 2.13 CFU이고, 스케일링 후 colony 수의 평균은 50.00 CFU로 약 25배 증가한 것으로 나타났다(p=0.012). 2. 의복의 배 부위에서 스케일링 전 colony수의 평균은 4.00 CFU이고, 스케일링 후 colony수의 평균은 16.63 CFU로 약 4배 증가한 것으로 나타났다(p=0.018). 3. 의복의 허벅지 부위에서 스케일링 전 colony수의 평균은 3.63 CFU이고, 스케일링 후 colony수의 평균은 22.88 CFU로 약 7배 증가한 것으로 나타났다(p=0.017). 4. 의복 소매 끝에서 스케일링 전 colony수의 평균은 3.63 CFU이고, 스케일링 후 colony수의 평균은 17.38 CFU로 약 6배 증가한 것으로 나타났다(p=0.028). 5. 의복 바지 끝에서 스케일링 전 colony수의 평균은 2.38 CFU이고, 스케일링 후 colony수의 평균은 33.63 CFU로 약 17배 증가한 것으로 나타났다(p=0.012). 6. 스케일링 후 의복 부위에서 colony수의 평균은 가슴, 바지 끝, 허벅지, 배, 소매 끝 순으로 높게 나타났다. 7. 스케일링 전-후 colony수의 증가율은 가슴, 바지 끝, 허벅지, 소매 끝, 배 순으로 높게 나타났다. 스케일링 시 에어졸로에 의해 의복이 오염되는 것을 확인하였다. 그러므로 우리는 스케일링에 의한 에어로졸로 의복이 오염되는 것을 인지하고 스케일링 후에는 의복을 깨끗이 해야 할 필요성이 있다. 이에 따라 치과기구관리와 함께 의복도 감염방지 대책이 시급한 것으로 보인다. 또한 치과 의료인들에게 자세한 감염교육이 필요할 것이다. 실험 결과로 의복오염의 심각성을 일깨우고, 의복에 대한 감염의식을 높여야 된다.

• International Journal of Industrial Entomology and Biomaterials
• /
• 제9권1호
• /
• pp.95-99
• /
• 2004

This study was carried out to investigate the effect of body weight of queen on the developmental characteristics of foundation queens in the Bombus ignitus collected in Korean locality. Queens were classified into six groups based on their body weight (i.e., 0.4 g, 0.5 g, 0.6 g, 0.7 g, 0.8 g and 0.9 g). The average weight of 200 foundation queens collected was 0.657${\times}40.095 g and 0.6 g-class was most abundant (38 %) among six weight classes. The queen that had the heavy body weight showed the trends of higher rate of oviposition, colony foundation and progeny-queen production and shorter periods of preoviposition and colony foundation, suggesting the positive correlation between the body weight of queen and colony developmental characteristics. Also, the numbers of worker and progeny-queen emerged from the queen with heavy body weight were slightly higher than those with light body weight queen.

• International Journal of Industrial Entomology and Biomaterials
• /
• 제7권2호
• /
• pp.151-154
• /
• 2003

The effect of photoperiodic regimes on the oviposition and colony development of Bombus ignitus queens was examined with 0L, 8L, and 16L under $27^{\circ}C$ and 65% R. H. Among these photoperiod regimes, the oviposition rate at 8L and 16L was 80.2% and 83.1%, respectively, which was 12-15% higher than that at the dark condition (0L). Duration up to first oviposition at 8L and 16L was 17.5 days and 16.5 days, respectively, which was 2-3 days shorter than that at 0L. The colony foundation rate at 8L and 16L was 9.2% and 10.4%, respectively, which corresponded to 1.7-2.0-fold higher than the value at 0L. In addition, the rate of progeny-queen production at 8L and 16L was also two fold higher than that at 0L. Taken these together, the light conditions (8L and 16L) rather than dark condition (0L) were more suitable for oviposition and colony development for B. ignitus in the indoor rearing condition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권9호
• /
• pp.3496-3514
• /
• 2015

One of the challenging tasks in Mobile Ad hoc Network is to discover precise optimal routing solution due to the infrastructure-less dynamic behavior of wireless mobile nodes. Ant Colony Optimization, a swarm Intelligence technique, inspired by the foraging behaviour of ants in colonies was used in the past research works to compute the optimal path. In this paper, we propose a Recurrent Ant Colony Optimization (RECACO) that executes the actual Ant Colony Optimization iteratively based on recurrent value in order to obtain an optimal path convergence. Each iteration involves three steps: Pheromone tracking, Pheromone renewal and Node selection based on the residual energy in the mobile nodes. The novelty of our approach is the inclusion of new pheromone updating strategy in both online step-by-step pheromone renewal mode and online delayed pheromone renewal mode with the use of newly proposed metric named ELD (Energy Load Delay) based on energy, Load balancing and end-to-end delay metrics to measure the performance. RECACO is implemented using network simulator NS2.34. The implementation results show that the proposed algorithm outperforms the existing algorithms like AODV, ACO, LBE-ARAMA in terms of Energy, Delay, Packet Delivery Ratio and Network life time.

• 정보처리학회논문지B
• /
• 제10B권3호
• /
• pp.237-242
• /
• 2003

Ant Colony System(ACS) 알고리즘은 조합 최적화 문제를 해결하기 위한 메타 휴리스틱 탐색 방법이다. 이것은 greedy search뿐만 아니라 exploitation of positive feedback을 사용한 모집단에 근거한 접근법으로 Traveling Salesman Problem(TSP)를 풀기 위해 제안되었다. 본 논문에서는 전통적 전역갱신과 지역갱신 방법에 개미들이 방문한 각 간선에 대한 방문 횟수를 강화값으로 추가한 새로운 방법의 ACS를 제안한다. 그리고 여러 조건 하에서 TCS 문제를 풀어보고 그 성능에 대해 기존의 ACS 방법과 제안된 ACS 방법을 비교 평가해, 최적해에 더 빨리 수렴함을 실험을 통해 알 수 있었다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• pp.308-311
• /
• 2008

The ant colony optimization (ACO) is a metaheuristic inspired by the behavior of real ants. Recently, ACO has been widely used to solve the difficult combinatorial optimization problems. In this paper, we propose an ACO algorithm to solve the two disjoint paths problem with dual link cost structure (TDPDCP). We propose a dual pheromone structure and a procedure for solution construction which is appropriate for the TDPDCP. Computational comparisons with the state-of-the-arts algorithms are also provided.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.77-78
• /
• 2008

This paper proposes a new algorithm for path planning and obstacles avoidance using the ant colony optimization algorithm and the particle swarm optimization. The proposed algorithm is a new hybrid algorithm that composes of the ant colony algorithm method and the particle swarm optimization method. At first, we produce paths of a mobile robot in the static environment. And then, we find midpoints of each path using the Maklink graph. Finally, the hybrid algorithm is adopted to get a shortest path. We prove the performance of the proposed algorithm is better than that of the path planning algorithm using the ant colony optimization only through simulation.

• Asian-Australasian Journal of Animal Sciences
• /
• 제9권6호
• /
• pp.671-677
• /
• 1996

Erythrocytes from three different animal species were used to determine mannose-sensitive hemagglutination (MSHA) and mannose-resistant hemagglutination (MRHA) of 755 isolates obtained from rectal swabs of healthy pig. In addition, colony hybridization using digoxigenin-dUTP labeled polynucleotide probes was performed for the detection of heat-stable and heat-labile enterotoxin genes carried by MRHA positive isolates. Of 755 strains, 9, 4 and 28 strains gave a positive MRHA with bovine, equine and pig erythrocytes, respectively. Of these isolates, 28 (3.7%) were characterized for positive MRHA by at least one blood. Seven isolates gave a positive MRHA with two kinds of blood. Three gave a positive MRHA with three kinds of blood. Twenty-eight strains, while positive in MRHA, yielded negative signals in the colony hybridization assay for the detection of heat-stable (STaI and STaII) and heat-labile (LT) enterotoxin genes in E. coli.

• Journal of Computing Science and Engineering
• /
• 제8권4호
• /
• pp.199-206
• /
• 2014

The ant colony optimization (ACO) algorithm is a new heuristic algorithm that offers good robustness and searching ability. With in-depth exploration, the ACO algorithm exhibits slow convergence speed, and yields local optimization solutions. Based on analysis of the ACO algorithm and the genetic algorithm, we propose a novel hybrid genetic ant colony optimization (NHGAO) algorithm that integrates multi-population strategy, collaborative strategy, genetic strategy, and ant colony strategy, to avoid the premature phenomenon, dynamically balance the global search ability and local search ability, and accelerate the convergence speed. We select the traveling salesman problem to demonstrate the validity and feasibility of the NHGAO algorithm for solving complex optimization problems. The simulation experiment results show that the proposed NHGAO algorithm can obtain the global optimal solution, achieve self-adaptive control parameters, and avoid the phenomena of stagnation and prematurity.

• 경영과학
• /
• 제28권1호
• /
• pp.43-52
• /
• 2011

The basic objective of broadcast scheduling is to get the smallest length TDMA frame, where many nodes are allowed to transmit simultaneously in a single time slot in a conflict-free manner. The secondary objective is to maximize the number of such transmissions for maximum use of the channel. An Artificial Bee Colony (ABC) with ranking strategy is proposed in this paper for the broadcast scheduling problem. Our proposed method is very efficient for generating initial and neighbor feasible solutions. We can get the best number of time slots and transmission utilization comparing to previous researches.