• Title/Summary/Keyword: Packing Time

Search Result 406, Processing Time 0.027 seconds

Optimal 3-D Packing using 2-D Slice Data for Multiple Parts Layout in Rapid Prototyping (신속시작작업에서 2차원 단면데이터를 이용한 3차원 물체의 최적자동배치를 위한 알고리즘의 개발)

  • 허정훈;이건우;안재홍
    • Korean Journal of Computational Design and Engineering
    • /
    • v.2 no.3
    • /
    • pp.195-210
    • /
    • 1997
  • In Rapid Prototyping process, the time required to build multiple prototype parts can be reduced by packing several parts optimally in a work volume. Interactive arrangement of the multiple parts is a tedious process and does not guarantee the optimal placement of all the parts. In this case, packing is a kind of 3-D nesting problem because parts are represented by STL files with 3-D information. 3-D nesting is well known to be a problem requiring an intense computation and an efficient algorithm to solve the problem is still under investigation. This paper proposes that packing 3-D parts can be simplified into a 2-D irregular polygon nesting problem by using the characteristic of rapid prototyping process that the process uses 2-dimensional slicing data of the parts and that slice of the STL parts are composed of polygons. Our algorithm uses no-fit-polygon (NFP) to place each slice without overlapping other slices in the same z-level. The allowable position of one part at a fixed orientation for given parts already packed can be determined by obtaining the union of all NFP's that are obtained from each slice of the part. Genetic algorithm is used to determine the order of parts to be placed and orientations of each part for the optimal packing. Optimal orientation of a part is determined while rotating it about the axis normal to the slice by finite angles and flipping upside down. This algorithm can be applied to any rapid prototyping process that does not need support structures.

  • PDF

Effectiveness of Polyvinyl Acetate Sheeted with Carboxymethyl Cellulose as a Packing Material after Septoplasty (비중격성형술 후 Carboxymethyl Cellulose 시트로 둘러싼 Polyvinyl Acetate의 비 패킹 재료로서 유용성)

  • Kim, Sung-Dong;Kim, Dongwon;Kim, Deok-Soo;Kim, Ji-a;Lee, Dong-Joo;Cho, Kyu-Sup
    • Journal of Rhinology
    • /
    • v.25 no.2
    • /
    • pp.86-90
    • /
    • 2018
  • Background and Objectives: Although polyvinyl acetate ($Merocel^{(R)}$) has been widely used as a packing material after septoplasty, removable nasal packing can increase patient discomfort, local pain, and pressure. Furthermore, the removal of nasal packing has been described as the most uncomfortable and distressing feature associated with septoplasty. The purpose of this study was to investigate the efficacy of polyvinyl acetate with carboxymethyl cellulose sheet ($Rhinocel^{(R)}$) nasal packing on patient subjective symptoms, degree of bleeding, hemostasis, and wound healing following septoplasty. Subjects and Method: Forty patients with nasal septum deviation requiring septoplasty were included. Following surgery, one nasal cavity was packed with $Rhinocel^{(R)}$ and the other one with $Merocel^{(R)}$. Patient subjective symptoms while the packing was in situ, hemostatic properties, pain on removal, degree of bleeding on removal, duration of hemostasis after removal, postoperative wound healing, and the cost of the pack were evaluated. Results: Although the two types of packing materials were equally effective in controlling postoperative bleeding after septoplasty, $Rhinocel^{(R)}$ was significantly more comfortable while in situ and less painful on removal than $Merocel^{(R)}$, which was associated with significantly more bleeding on removal and so more time was needed to control hemorrhage. There was no significant difference in postoperative wound healing or pack cost. Conclusion: The use of $Rhinocel^{(R)}$ after septoplasty has less discomfort, greater patient satisfaction, and less bleeding on removal with no adverse reactions compared to $Merocel^{(R)}$ packing. Therefore, $Rhinocel^{(R)}$ may be a useful packing material after septoplasty.

The pests survey of paprika export complexes and packing house in Korea (우리나라 파프리카 수출단지 및 선과장의 병해충 조사)

  • Kim, Gi-Don;Lee, Siwon;Kang, Eun-Ha;Shin, Yong-Gil;Jeon, Jae-Yong;Heo, Noh-Yeol;Lee, Heung-Sik
    • Korean Journal of Agricultural Science
    • /
    • v.40 no.2
    • /
    • pp.93-99
    • /
    • 2013
  • The disease and insect were surveyed locally in greenhouse, fruit packing house and store house of 51 farms in 13 towns having purpose of paprika exportation. By analysis, various disease and insect were not only founded locally but more ones detected in farms having old facilities and no natural enemy. We found 15 pathogens such as Fusarium spp., Alternaria solani, Leveilluila taurica, PepMV (Pepino mosaic virus) and TMV (Tobacco mosaic virus) in greenhouse, Fusarium spp. in fruit packing house and Penicillium spp. in store house. We found 15 insects in greenhouse such as Bemisia tabaci, rialeurodes vaporariorum and Myzus persicae in greenhouse, Hylobitelus haroldi in fruit packing house. However, the problem quarantine disease and insect for importation and exportation were not detected in inspection time.

Tactical Data Link Message Packing Scheme for Imagery Air Operations (이미지 항공작전을 위한 전술데이터링크 메시지 패킹 기법)

  • Kim, Young-Goo;Lim, Jae-Sung;Noh, Houng-Jun;Lee, Kyu-Man
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.4B
    • /
    • pp.278-287
    • /
    • 2012
  • In this paper, we propose an allocation scheme for variable message packings to increase efficiency of military operation using Link-16 which is well-known for tactical data link by delivering imagery information rapidly. We propose a variable message packing scheme using COC waveform to support variable data rate under some coverage limitation. Variety of message packing makes Link-16 vary transmission rate appropriately for tactical environment. We also propose a allocation scheme to assign message packing to time slot properly. Finally we verify the performance and superiority of proposed ideas by simulations.

A Survey of Human Injury and Crowd Packing in Mass Gathering (군중집회 시의 인명피해 및 군중눌림 현상의 고찰)

  • Wang, Soon-Joo;Byun, Hyun-Joo
    • Journal of the Society of Disaster Information
    • /
    • v.7 no.1
    • /
    • pp.12-20
    • /
    • 2011
  • This study was performed for identifying the characteristics of mass gathering and human injury in mass gathering based on the literature survey and analysis of mass gathering and crowd packing. The size and density of crowd influenced the characteristics of mass gathering according to type of mass gathering. The variables and causes of human injuries of mass gathering have positive or negative influences based on the weather, attendance, duration, location, mobility, event type, crowd mood, alcohol, drug, crowd density and age. Based on the physical mechanism of crowd packing, the degree of crowd packing was influenced by crowd pressure, crowd density and lasting time. But the magnitude of pressure for pedestrian injury criteria remains for further research.

Analysis of Particle Packing Process by Contact Model in Discrete Element Method (입자 패킹 공정에 대한 접촉모델별 이산요소법 해석)

  • Lyu, Jaehee;Park, Junyoung
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.18 no.3
    • /
    • pp.59-65
    • /
    • 2019
  • In many industries, particle packing is adopted quite frequently. In the particle packing process, the Discrete Element Method (DEM) can analyze the multi-collision of particles efficiently. Two types of contact models are frequently used for the DEM. One is the linear spring model, which has the fastest calculation time, and the other is the Hertz-Mindlin model, which is the most frequently used contact model employing the DEM. Meanwhile, very tiny particles in the micrometer order are used in modern industries. In the micro length order, surface force is important to decreased particle size. To consider the effect of surface force in this study, we performed a simulation with the Hertz-Mindlin model and added the Johnson-Kendall-Roberts (JKR) theory depicting surface force with surface energy. In addition, three contact models were compared with several parameters. As a result, it was found that the JKR model has larger residual stress than the general contact models because of the pull-off force. We also validated that surface force can influence particle behavior if the particles are small.

An Approximation Algorithm based on First-fit Strategy for Template Packing Problem (First-fit 전략을 사용하는 템플럿 패킹 문제를 위한 근사 알고리즘)

  • Song, Ha-Joo;Kwon, Oh-Heum
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.2
    • /
    • pp.443-450
    • /
    • 2016
  • This paper deals with a kind of packing problem of which the goal is to compose one or more templates which will be used to produce the items of different types. Each template consists of a fixed number of slots which are assigned to the different types of items and the production of the items is accomplished by printing the template repeatedly. The objective is to minimize the total number of produced items. This problem is known to be NP-hard. We present a polynomial time approximation algorithm which has a constant approximation ratio. The proposed algorithm is based on the well-known first-fit strategy.

Removal of NH(sub)3-N by Using Immobilized Nitrifier Consortium in PVA[Polyvinyl Alcohol]-I. Effect of Packing Fraction and Aeration Rate on Ammonia Nitrogen Removal (PVA에 고정화된 질화세균군에 의한 암모니아성 질소 제거 I. 충진율 및 공기 유입량이 암모니아성 질소제거에 미치는 영향)

  • 서근학;김병진;오창섭
    • KSBB Journal
    • /
    • v.16 no.3
    • /
    • pp.314-319
    • /
    • 2001
  • A nitrifier consortium immobilized in polyvinyl alcohol was used to remove ammonia nitrogen from synthetic wastewater in an airlift bioreactor. The minimum aeration rates were 0.4, 0.6, 0.8 and 1.0 vvm for 5, 10, 15 and 20% immobilized bead packing volume fraction, respectively. The efficient packing fraction and the aeration rate for ammonia nitrogen removal were 15% and 2.4 vvm, respectively. With a hydraulic retention time of 0.5hr, the removal rate and the efficiency of ammonia nitrogen removal were 1685 g/㎥$.$day and 48% at an influent ammonia nitrogen concentration of 75 g/㎥.

  • PDF

Application of Tabu Search to the Two-Dimensional Bin Packing Problem (타부서치를 이용한 2차원 직사각 적재문제에 관한 연구)

  • Lee, Sang-Heon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.311-314
    • /
    • 2004
  • The 2 DBPP(Two-Dimensional Bin Packing Problem) is a problem of packing each item into a bin so that no two items overlap and the number of required bins is minimized under the set of rectangular items which may not be rotated and an unlimited number of identical rectangular bins. The 2 DBPP is strongly NP-hard and finds many practical applications in industry. In this paper we discuss a tabu search approach which includes tabu list, intensifying and diversification strategies. The HNFDH(Hybrid Next Fit Decreasing Height) algorithm is used as an internal algorithm. We find that use of the proper parameter and function such as maximum number of tabu list and space utilization function yields a good solution in a reduced time. We present a tabu search algorithm and its performance through extensive computational experiments.

  • PDF

Test Scheduling of NoC-Based SoCs Using Multiple Test Clocks

  • Ahn, Jin-Ho;Kang, Sung-Ho
    • ETRI Journal
    • /
    • v.28 no.4
    • /
    • pp.475-485
    • /
    • 2006
  • Network-on-chip (NoC) is an emerging design paradigm intended to cope with future systems-on-chips (SoCs) containing numerous built-in cores. Since NoCs have some outstanding features regarding design complexity, timing, scalability, power dissipation and so on, widespread interest in this novel paradigm is likely to grow. The test strategy is a significant factor in the practicality and feasibility of NoC-based SoCs. Among the existing test issues for NoC-based SoCs, test access mechanism architecture and test scheduling particularly dominate the overall test performance. In this paper, we propose an efficient NoC-based SoC test scheduling algorithm based on a rectangle packing approach used for current SoC tests. In order to adopt the rectangle packing solution, we designed specific methods and configurations for testing NoC-based SoCs, such as test packet routing, test pattern generation, and absorption. Furthermore, we extended and improved the proposed algorithm using multiple test clocks. Experimental results using some ITC'02 benchmark circuits show that the proposed algorithm can reduce the overall test time by up to 55%, and 20% on average compared with previous works. In addition, the computation time of the algorithm is less than one second in most cases. Consequently, we expect the proposed scheduling algorithm to be a promising and competitive method for testing NoC-based SoCs.

  • PDF