• 제목/요약/키워드: optimal packing

검색결과 104건 처리시간 0.025초

DAF(Dissolved Air Flotation)를 이용한 팽화 슬러지 농축 (Thickening of Bulking Sludge using DAF (Dissolved Air Flotation))

  • 김동석;박영식
    • 한국환경과학회지
    • /
    • 제15권1호
    • /
    • pp.77-84
    • /
    • 2006
  • An effective technique of sludge separation is required for excess sludge of sewage or wastewater plant. The separation of bulking sludge of paper manufacturing plant was studied using DAF(Dissolved Air Flotation) system. The effects of parameters such as nozzle type, A/S(air/solid) ratio. pressure, injection time of pressured water and saturation time were examined. The results showed that the best nozzle type was flat which had small orifice hole, The optimum A/S ratio and pressure were $7.070\times10^{-3}$(recycle ratio of pressured water $20\%$) and 5atm, respectively. Injection times of pressurized water around 20-25 sesc and flotation time of 30 min appeared to be optimal for the DAF operation. The order of performance of packing was 18 mm > 22 mm > 32 mm.

자동차 암레스트의 사출성형과 인몰드코팅에 관한 해석 (Analysis for injection molding and in-mold coating of automotive armrests)

  • 박종락;이호상
    • Design & Manufacturing
    • /
    • 제13권1호
    • /
    • pp.48-54
    • /
    • 2019
  • Analytical and experimental study were carried out in order to achieve simultaneous coating and injection molding of an automotive armrest. A mold was designed to be included one core and two cavities, which were composed of a substrate cavity and a coating cavity. The materials used were PC/ABS for substrate and 2-component Polyurethane for coating. The predicted flow patterns were in good agreement with experimental results in injection molding and in-mold coating. Based on analysis and experiment, it was found that the optimal processing conditions were packing pressure of 90MPa and holding time of 7sec.

The Asymptotic Worst-Case Ratio of the Bin Packing Problem by Maximum Occupied Space Technique

  • Ongkunaruk, Pornthipa
    • 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.

경로설정과 파장 배정 문제의 독립집합 상자 채우기 알고리즘 (Independent Set Bin Packing Algorithm for Routing and Wavelength Assignment (RWA) Problem)

  • 이상운
    • 한국컴퓨터정보학회논문지
    • /
    • 제20권1호
    • /
    • pp.111-118
    • /
    • 2015
  • 본 논문은 광통신망에서 (s,t)에 대한 다중 패킷 통신 요구에 대해 최적의 광 경로를 설정하고, 최소 파장 수를 배정하는 경로설정과 파장 배정 문제 (RWAP)를 다룬다. RWAP는 지금까지 다항시간으로 최적 해를 구하는 알고리즘이 알려져 있지 않은 NP-완전으로 근사 해를 다항시간으로 구하고 있다. 본 논문은 주어진 망의 모든 (s,t)에 대해 최단 광 경로로 동일한 홉 수를 갖는 주경로와 대체경로를 사전에 결정하고, (s,t)에 대한 실제 특정 다중 패킷 통신이 요구될 때 이들 이중 경로를 이용하여 최대로 이용되는 간선의 이용횟수를 b개로 줄이고, b개의 파장 수 상자에 중복 간선 없이 담는 방법으로 O(kn) 계산 복잡도로 최적 해를 구할 수 있었다. 2개의 실험 데이터 망에 적용한 결과, 제안된 알고리즘은 기존에 알려진 최적 해를 얻을 수 있음을 보였다.

포기조에 충진된 고정상 담체가 A2/O공정에서 질소제거에 미치는 영향 (The Effect of the Attached Growth in Aerobic Reactor on Nitrogen Removal in A2/O processes)

  • 황규대;배성현
    • 한국물환경학회지
    • /
    • 제22권6호
    • /
    • pp.1022-1030
    • /
    • 2006
  • Activated sludge reactors maintaining an MLSS of 3,000 mg/L and packed Bio Contact Media (BCM fixed beds) was studied in lab-scale to determine the optimal packing ratio and an HRT of aerobic reactor in terms of organic removal, nitrification, denitrification efficiencies. At all HRTs of 3 hr, 5 hr, 7 hr respectively, reactors without BCM, control reactors, had the lowest TCODcr removal efficiency about 74.6%, and reactors with the BCM packing ratios of 10%, 15%, 20% had a greater TCODcr removal efficiency above 81.4%. As HRT decreased, the TCODcr removal efficiency decreased also in all reactors. However, a better utilization of TCODcr even at a higher organic loading was observed in reactors with BCM. The nitrification efficiency at all reactors was greater than 94%, and reactor with 20% packing of BCM had the highest nitrification efficiency at 97.9% while the TKN loading increased at $0.085mgTKN/m^3{\ast}day$ as HRT decreased, In terms of denitrification efficiency, the reactor without BCM ranged from 11.6% to 13.7%, and the reactors with BCM ranged from 28.3% to 63.4% which suggests that the more BCM is packed in the reactors, the higher the denitrification efficiency is achieved. Two parallel $A^2/O$ systems maintaining an MLSS of 3,000 mg/L were operated to investigate the effect of BCM packing ratio of 20% on organic removal, nitrification, denitrification efficiencies. Packing with BCM in system of aerobic reactor affected the SCODcr removal efficiency that increased from 73% to 78%. The nitrification efficiency for both systems with or without BCM was greater than 95%. The denitrification efficiency of systems with BCM and without BCM was 85.8% and 81.8%, respectively which appears that the denitrification efficiency was increased slightly by packing BCM. Compared denitrification efficiency in $A^2/O$ system to previous experimental study with activated sludge reactors operates with the same HRT $A^2/O$ system showed only 29% greater denitrification efficiency. It suggests that $A^2/O$ system with BCM can achieve a similar level of denitrification efficiency when the HRT of anoxic reactor is decreased to some extent.

선회류 생물학적 유동상의 최적 메디아 충전량에 관한 연구 (A Study on Optimal Packing Volume of Media in Swirl Flow Biological Fluidized Bed)

  • 최두형;김환기
    • 대한환경공학회지
    • /
    • 제22권2호
    • /
    • pp.331-340
    • /
    • 2000
  • 기존의 2상 생물학적 유동상은 산소 공급의 한계 및 유동 분산판 폐쇄 등의 문제점을 가지고 있다. 이러한 문제를 해결하기 위하여 3상의 선회류 유동상을 고안하여 그 운전특성을 연구하였다. 합성 폐수의 평균 TOC농도는 약 $70mg/{\ell}$($62{\sim}84mg-TOC/{\ell}$)이었고, HRT는 1.6시간, 평균입경이 0.397 mm인 모래의 충전량을 200에서 $600m{\ell}/{\ell}$까지 단계적으로 변화시키며, 미생물의 농도 및 처리 수질을 측정하였다. 실험 결과 기존 유동상 반응기의 분산장치의 폐색과 산소공급의 제한 등 연속운전에 지장을 주는 단점을 보완할 수 있었다. 실험 기간 중에 반응조의 DO의 농도는 $3mg/{\ell}$이상을 유지할 수 있었으며, TOC 제거율은 91~94 %, MLVSS농도는 $2,360{\sim}3,860mg/{\ell}$, F/M 비는 $0.59{\sim}1.04kg-TOC/kg-MLVSS{\cdot}day$, 생물막의 두께는 $35{\sim}71{\mu}m$, Media-g당 MLVSS는 8.4~17.3 mg/g, 그리고 슬러지 발생량은 $1.08{\sim}2.35kg-SS/m^3{\cdot}day$의 변화를 보였다. 충전량에 따른 MLVSS농도 변화를 분석한 결과 충전량이 $400{\sim}450m{\ell}/{\ell}$일 때 MLVSS농도를 가장 높게 유지할 수 있었고, Media-g당 MLVSS농도 측면에서는 충전량이 $250m{\ell}/{\ell}$일 때 가장 높은 농도를 유지할 수 있었다. 유출수의 SS는 $350{\sim}450m{\ell}/{\ell}$에서 낮게 나타났다. 적정 처리효율에서 F/M 비가 낮고, 슬러지 발생량이 적은 최적조건에서의 생물막의 두께는 약 $54{\mu}m$, g-Media당 MLVSS의 농도는 13 mg이였으며, 충진량은 $350{\sim}400m{\ell}/{\ell}$(35~40%)임을 알 수 있었다. 최적 충전 상태에서 광학 현미경으로 Media를 관찰할 때 Epistylis sp.의 고착성미생물을 일부 관찰할 수 있었으며, Media 표면을 전자현미경으로 촬영한 결과 구균류가 부착 성장하는 것을 알 수 있었다.

  • PDF

바지선 적재 문제의 최대이득 물품 우선 적재 알고리즘 (Maximum Profit Priority Goods First Loading Algorithm for Barge Loading Problem)

  • 이상운
    • 한국컴퓨터정보학회논문지
    • /
    • 제19권10호
    • /
    • pp.169-173
    • /
    • 2014
  • 최적 해를 다항시간으로 얻을 수 있는 알고리즘이 알려져 있지 않은 NP-완전인 상자포장 문제의 일종인 바지선 적재 문제에 대해, Gu$\acute{e}$ret et al.은 $O(m^4)$ 수행 복잡도의 선형계획법으로 해를 얻고자 하였다. 반면에, 본 논문에서는 이득 우선순위로 적재하는 규칙인 O(m log m) 복잡도의 알고리즘을 제안하였다. 제안된 방법은 첫 번째로 이득 우선순위를 결정하였다. 다음으로, 이득 우선순위 물품들을 바지선에 적재하는 방법으로 초기 적재 결과를 얻었다. 마지막으로, 바지선 적재 용량을 미달하는 경우, 이전에 적재된 물품과 미선적된 물품을 상호 교환하여 바지선 적재용량을 충족시켰다. 실험 결과, 제안된 알고리즘은 NP-완전 문제인 바지선 적재 문제에 대해 선형계획법의 $O(m^4)$를 O(m log m)으로 단축시켰다.

최적회로 연결선 구조를 위한 설계 및 해석도구 (DATOIS) (Design and analysis tool for optimal interconnect structures (DATOIS))

  • 박종흠;김준희;김석윤
    • 전자공학회논문지C
    • /
    • 제35C권7호
    • /
    • pp.20-29
    • /
    • 1998
  • As the packing density of ICs in recent submicron IC design increases, interconnects gain importance. Because interconnects directly affect on two major components of circuit performance, power dissipation and operating speed, circuit engineers are concerned with the optimal design of interconnects and the aid tool to design them. When circuit models of interconnects are given (including geometry and material information), the analysis process for the given structure is not an easy task, but conversely, it is much more difficult to design an interconnect structure with given circuit characteristics. This paper focuses on the latter process that has not been foucsed on much till now due to the complexity of the problem, and prsents a design aid tool(DATOIS) to synthesize interconnects. this tool stroes the circuit performance parameters for normalized interconnect geometries, and has two oeprational modes:analysis mode and synthesis mode. In the analysis mode, circuit performance parameters are obtained by searching the internal database for a given geometry and interpolates results if necessary . In thesynthesis mode, when a given circuit performance parameter satisfies a set of geometry condition in the database, those geometry structures are printed out.

  • PDF

Optimization of Multiple Quality Characteristics for Polyether Ether Ketone Injection Molding Process

  • Kuo Chung-Feng Jeffrey;Su Te-Li
    • Fibers and Polymers
    • /
    • 제7권4호
    • /
    • pp.404-413
    • /
    • 2006
  • This study examines multiple quality optimization of the injection molding for Polyether Ether Ketone (PEEK). It also looks into the dimensional deviation and strength of screws that are reduced and improved for the molding quality, respectively. This study applies the Taguchi method to cut down on the number of experiments and combines grey relational analysis to determine the optimal processing parameters for multiple quality characteristics. The quality characteristics of this experiment are the screws' outer diameter, tensile strength and twisting strength. First, one should determine the processing parameters that may affect the injection molding with the $L_{18}(2^1{\times}3^7)$ orthogonal, including mold temperature, pre-plasticity amount, injection pressure, injection speed, screw speed, packing pressure, packing time and cooling time. Then, the grey relational analysis, whose response table and response graph indicate the optimum processing parameters for multiple quality characteristics, is applied to resolve this drawback. The Taguchi method only takes a single quality characteristic into consideration. Finally, a processing parameter prediction system is established by using the back-propagation neural network. The percentage errors all fall within 2%, between the predicted values and the target values. This reveals that the prediction system established in this study produces excellent results.

유니폼 멀티프로세서 환경에서 단순 주기성 태스크를 위한 최적 RM 스케줄링 (Optimal RM Scheduling for Simply Periodic Tasks on Uniform Multiprocessors)

  • 정명조;조문행;김주만;이철훈
    • 한국콘텐츠학회논문지
    • /
    • 제9권12호
    • /
    • pp.52-63
    • /
    • 2009
  • 본 논문에서는 유니폼 멀티프로세서 환경에서 단순 주기성 태스크 시스템을 성공적으로 스케줄 할 수 있는 알고리즘을 제안한다. 멀티프로세서 환경에서 주기성 태스크를 스케줄하기 위한 파티션드(partitioned) 스케줄링 알고리즘은 bin-packing 문제와 같은 문제로써 해결하는 게 불가능하다고 알려져 있다. 본 논문에서는 "task-splitting"기법을 이용하여 단순 주기성 태스크 시스템을 다른 단순 주기성 태스크 시스템으로 변환하는 글로벌(global) 스케줄링 알고리즘을 제시하고, 변환과정을 거친 단순 주기성 태스크 시스템은 유니폼 멀티프로세서에서 파티션드 스케줄링 알고리즘에 의해 성공적으로 스케줄 된다. 그리고 유니폼 멀티프로세서 환경에서 제안한 알고리즘이 이론적으로 최대 이용률 범위(utilization bound)까지 성공적으로 스케줄 할 수 있음을 증명한다.