• 한국식품위생안전성학회지
• /
• 제29권4호
• /
• pp.278-284
• /
• 2014

본 연구는 들깻잎과 들깻잎 생산 환경을 대상으로 S. aureus를 분리하고 MLVA를 이용해 분리된 S. aureus의 오염경로를 분석하였다. 그 결과, 들깻잎에서 S. aureus의 검출빈도는 7.9% (9/114)였고 검출수준은 $0{\sim}2.92{\log}_{10}CFU/g$였으며 2곳의 농가에서 S. aureus가 $2.00{\log}_{10}CFU/g$ 이상으로 검출되었다. S. aureus가 분리된 5농가를 대상으로 들깻잎과 직접 접촉하는 시료에서 S. aureus를 분리하였으며 5 농가 중 3농가의 작업환경 (농가의 포장대, 포장비닐, 작업자 손, 복장 등)에서 S. aureus가 검출되었다. 들깻잎과 생산 환경에서 분리된 S. aureus를 대상으로 MLVA를 수행했을 때 포장대, 작업자의 손, 포장비닐 및 관개용수에서 분리된 균주와 들깻잎에서 분리된 S. aureus가 동일한 패턴을 보여 들깻잎의 오염은 이들 시료와 연관되어 있을 것으로 추정된다. 따라서 MLVA를 이용한 유전자 typing은 농산물이나 식품 중 S. aureus의 오염원을 신속하고 경제적으로 구명하는데 활용할 수 있을 것으로 판단된다.

• International Journal of Automotive Technology
• /
• 제8권2호
• /
• pp.165-177
• /
• 2007

Predictions of diesel particulate filtration are typically made by modeling of a particle collection, and providing particle trapping levels in terms of a pressure drop. In the present study, a series of single channel diesel particulate filter (DPF) experiments are conducted, the pressure traces are inversely analyzed and essential filtration parameters are deducted for model closure. A DPF filtration model is formulated with a non-linear description of soot cake regression. Dependence of soot cake porosity, packing density, permeability, and soot density in filter walls on convective-diffusive particle transportation is examined. Sensitivity analysis was conducted on model parameters, relevant to the mode of transition. Soot cake porosity and soot packing density show low degrees of dispersion with respect to the Peclet number and have asymptotes at 0.97 and $70\;kg/m^3$, respectively, at high Peclet number. Soot density in the filter wall, which is inversely proportional to filter wall Peclet number, controls the filtration mode transition but exerts no influence on termination pressure drop. The percolation constant greatly alters the extent of pressure drop, but is insensitive to volumetric flow rate or temperature of exhaust gas at fixed operation mode.

• 한국컴퓨터정보학회논문지
• /
• 제20권10호
• /
• pp.61-68
• /
• 2015

This paper deals with the pre-marshalling problem that the containers of container yard at container terminal are relocated in consensus sequence of loading schedule of container vessel. This problem is essential to improvement of competitive power of terminal. This problem has to relocate the all of containers in a bay with minimum number of movement. There are various algorithms such as metaheuristic as genetic algorithm and heuristic algorithm in order to find the solution of this problem. Nevertheless, there is no unique general algorithm that is suitable for various many data. And the main drawback of metaheuristic methods are not the solution finding rule but can be find the approximated solution with many random trials and by coincidence. This paper can be obtain the solution with O(m) time complexity that this problem deals with bin packing problem for m stack bins with descending order of take out ranking. For various experimental data, the proposed algorithm can be obtain the optimal solutions for all of data. And to conclude, this algorithm can be show that most simple and general algorithm with simple optimal solution finding rule.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2003년도 춘계공동학술대회논문집
• /
• pp.242-248
• /
• 2003

본 논문에서는 다양한 종류와 다양한 크기의 화물에 대해 3차원 적재하는 방법으로서 휴리스틱 기법을 이용한 해법을 제안하였다. 먼저, 컨테이너 비용을 적재비용, 수송비용 및 처리비용의 합으로 나타내며. 화물간 우선순위 및 화물 내에서의 개수 간 우선순위를 적용하였다. 주어진 화물을 적재 공간 및 중량을 만족하면서 위의 컨테이너 비용을 최소화하는 컨테이너 종류 및 개수를 산출하였으며, 적재 시 화물의 팔레타이져 및 디팔레타이져로서 컨테이너 내의 공간 이용률을 극대화시켰다. 마지막으로 화물의 무게 균등화를 고려하여 취급중의 화물의 손상방지를 행하였다.

• 대한수학회보
• /
• 제38권4호
• /
• pp.797-801
• /
• 2001

The purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewords in a binary code of word length n with minimum distance 4 between codewords. We have improved upper bound for A[12k+11,4]. In this correspondence we prove $A[23,4]\leq173716$.

• 전자공학회논문지C
• /
• 제36C권6호
• /
• pp.9-17
• /
• 1999

본 논문에서는 시간제약 조건을 고려한 새로운 CPLD 기술매핑 알고리즘을 제안한다. 본 기술매핑 알고리즘은 주어진 논리식을 DAG로 구성하여 각 노드를 검색한 후, 출력에지가 2이상인 노드를 분할하지 않고 노드를 복제(replication)하여 DAG을 재구성함으로써 지연시간과 CLB의 개수가 최소화 되도록 하였다. 즉, 시간제약 조건과 소자의 지연시간을 이용하여 그래프 분할이 가능한 다단의 수를 정한다. 그런 다음 각 노드의 초기비용과 전체비용을 계산하여 CLB의 k-OR텀수보다 비용이 초과되는 노드를 분할하여 서브그래프를 구성한다. 분할된 서브그래프들은 collapsing을 통해 노드들을 병합하고 네 번째로 주어진 소자의 CLB안에 있는 k-OR텀 개수에 맞게 Bin packing를 수행하였다. 본 논 문에서 제안한 기술매핑 알고리즘을 MCNC 논리합성 벤치마크 회로들에 적용하여 실험한 결과 기존의 기술 매핑 툴인 TEMPLA에 비해 CLB의 개수가 18% 감소되었다.

• Industrial Engineering and Management Systems
• /
• 제7권2호
• /
• pp.126-132
• /
• 2008

The bin packing problem (BPP) is an NP-Complete Problem. The problem can be described as there are $N=\{1,2,{\cdots},n\}$ which is a set of item indices and $L=\{s1,s2,{\cdots},sn\}$ be a set of item sizes sj, where $0<sj{\leq}1$, ${\forall}j{\in}N$. The objective is to minimize the number of bins used for packing items in N into a bin such that the total size of items in a bin does not exceed the bin capacity. Assume that the bins have capacity equal to one. In the past, many researchers put on effort to find the heuristic algorithms instead of solving the problem to optimality. Then, the quality of solution may be measured by the asymptotic worst-case ratio or the average-case ratio. The First Fit Decreasing (FFD) is one of the algorithms that its asymptotic worst-case ratio equals to 11/9. Many researchers prove the asymptotic worst-case ratio by using the weighting function and the proof is in a lengthy format. In this study, we found an easier way to prove that the asymptotic worst-case ratio of the First Fit Decreasing (FFD) is not more than 11/9. The proof comes from two ideas which are the occupied space in a bin is more than the size of the item and the occupied space in the optimal solution is less than occupied space in the FFD solution. The occupied space is later called the weighting function. The objective is to determine the maximum occupied space of the heuristics by using integer programming. The maximum value is the key to the asymptotic worst-case ratio.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권3호
• /
• pp.819-837
• /
• 2014

Data centers, which implement cloud service, have been faced up with quick growth of energy consumption and low efficiency of energy. 60GHz wireless communication technology, as a new option to data centers, can provide feasible approach to alleviate the problems. Aiming at energy optimization in 60GHz wireless data centers (WDCs), we investigate virtualization technology to assign virtual resources to minimum number of servers, and turn off other servers or adjust them to the state of low power. By comprehensive analysis of wireless data centers, we model virtual network and physical network in WDCs firstly, and propose Virtual Resource Mapping Packing Algorithm (VRMPA) to solve energy management problems. According to VRMPA, we adopt packing algorithm and sort physical resource only once, which improves efficiency of virtual resource allocation. Simulation results show that, under the condition of guaranteeing network load, VPMPA algorithm can achieve better virtual request acceptance rate and higher utilization rate of energy consumption.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2001년도 추계학술대회 논문집
• /
• pp.46-50
• /
• 2001

Due to its ability in producing a net-shape product to high precision in a very shot cycle time, injection molding has become one of the most important polymer-processings in the industry today. Recently the CAE applications in the field of injection molding have provided significant contributions to the mold design and process optimization. As a part of such an application the packing process has been studied using C-PARK. The prediction of pressure variations during post-filling stage for amorphous material has been compared with an experimental observation for a simple rectangular geometry of uniform thickness. And the optimal packing processes were calculated using the cavity pressure curve near the gate. As a case study, a warpage simulation was carried out for a DY-HOLDER with the variable number of gates.

• 한국경영과학회지
• /
• 제25권3호
• /
• pp.17-33
• /
• 2000

We consider the Steiner tree packing problem. For a given undirected graph G =(V, E) with positive integer capacities and non-negative weights on its edges, and a list of node sets(nets), the problem is to find a connection of nets which satisfies the edge capacity limits and minimizes the total weights. We focus on the switchbox routing problem in knock-knee model and formulate this problem as an integer programming using Steiner tree variables. The model contains exponential number of variables, but the problem can be solved using a polynomial time column generation procedure. We test the algorithm on some standard test instances and compare the performances with the results using cutting plane approach. Computational results show that our algorithm is competitive to the cutting plane algorithm presented by Grotschel et al. and can be used to solve practically sized problems.