• 제목/요약/키워드: Feasible Cluster

검색결과 56건 처리시간 0.026초

가용 성형한계영역을 이용한 스템핑 공정의 효율적 설계방법 (An Effective Design Method of Stamping Process by Feasible Formability Diagram)

  • 차승훈;이찬주;이상곤;김봉환;고대철;김병민
    • 한국정밀공학회지
    • /
    • 제26권11호
    • /
    • pp.108-115
    • /
    • 2009
  • In metal forming technologies, the stamping process is one of the significant manufacturing processes to produce sheet metal components. It is important to design stamping process which can produce sound products without defect such as fracture and wrinkle. The objective of this study is to propose the feasible formability diagram which denotes the safe region without fracture and wrinkle for effective design of stamping process. To determine the feasible formability diagram, FE-analyses were firstly performed for the combinations of process parameters and then the characteristic values for fracture and wrinkle were estimated from the results of FE-analyses based on forming limit diagram. The characteristic values were extended through training of the artificial neural network. The feasible formability diagram was finally determined for various combinations of process parameters. The stamping process of turret suspension to support suspension module was taken as an example to verify the effectiveness of feasible formability diagram. The results of FE-analyses for process conditions within fracture and wrinkle as well as safe regions were in good agreement with experimental ones.

면적과 지연 시간을 고려한 CLB 구조의 CPLD 저전력 기술 매핑 알고리즘 (A CLB based CPLD Low-power Technology Mapping Algorithm consider Area and Delay time)

  • 김재진;조남경;전종식;김희석
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 II
    • /
    • pp.1169-1172
    • /
    • 2003
  • In this paper, a CLB-based CPLD low-power technology mapping algorithm consider area and delay time is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low power technology mapping based on the CLBs is packing the feasible clusters into the several proper CLBs. The proposed algorithm is examined by using benchmarks in SIS. In the case of that the number of OR-terms is 5, the experiments results show that reduce the power consumption by 30.73% comparing with that of TEMPLA, and 17.11% comparing with that of PLAmap respectively.

  • PDF

시간 제약 조건 하에서 저전력을 고려한 CLB구조의 CPLD 기술 매핑 알고리즘 (CLB-Based CPLD Technology Mapping Algorithm for Power Minimization under Time Constraint)

  • 김재진;김희석
    • 대한전자공학회논문지SD
    • /
    • 제39권8호
    • /
    • pp.84-91
    • /
    • 2002
  • In this paper, we proposed a CLB-based CPLD technology mapping algorithm for power minimization under time constraint in combinational circuit. The main idea of our algorithm is to exploit the "cut enumeration and feasible cluster" technique to generate possible mapping solutions for the sub-circuit rooted at each node. In our technology mapping algorithm conducted a low power by calculating TD and EP of each node and decomposing them on the circuit composed of DAG. It also takes the number of input, output, and OR-term into account on condition that mapping can be done up to the base of CLB, and so it generates the feasible clusters to meet the condition of time constraint. Of the feasible clusters, we should first be mapping the one that h3s the least output for technology mapping of power minimization and choose to map the other to meet the condition of time constraint afterwards. To demonstrate the efficiency of our approach, we applied our algorithm to MCNC benchmarks and compared the results with those of the exiting algorithms. The experimental results show that our approach is shown a decrease of 46.79% compared with DDMAP and that of 24.38% for TEMPLA in the power consumption.

군집 방법을 이용한 비만 여성의 기성복 하의류 치수 체계에 관한 연구 (A Study on the Sizing System of the lower Ready-to wear for the Obese Women)

  • 이진희
    • 대한가정학회지
    • /
    • 제38권9호
    • /
    • pp.33-40
    • /
    • 2000
  • The purpose of this proper is to set up the sizing system of the lower, which would be a guide for obese women for selecting ready-to-wear of suitable size. This study was carried out on 130 obese women and was done by cluster analysis with two(waist girth and hip girth) or three(abdomen circumference, hip girth and crotch length) variables. The results were as fellows: First, it was found that 3-5 sizes were suitable by cluster analysis with two variable. Second, 3-4 sizes were suitable with three variables. Finally, the number of sizes to product was 5 with two variables as a feasible solution, and 4 with three variables.

  • PDF

두 팔을 가진 화학 박막 증착용 클러스터 장비의 스케줄링과 공정 시간 결정 (Scheduling and Determination of Feasible Process Times for CVD Cluster Tools with a Dual End Effector)

  • 이환용;이태억
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
    • /
    • pp.107-110
    • /
    • 2000
  • 화학 박막 증착용(CVD : Chemical Vapor Deposition) 클러스터 장비는 다양한 공정 경로가 가능하며 물류 흐름이 매우 복잡해질 수 있다. 또한, 공정이 종료된 웨이퍼는 제한 시간 내에 챔버에서 꺼내져야만 한다. 클러스터 장비는 두 개의 팔을 가진 로봇이며, 빈 쪽 팔을 이용하여 공정이 종료된 웨이퍼를 꺼낸 후, 다른 쪽 팔을 이용하여 이전 공정에서 가져온 웨이퍼를 해당 공정에 넣어 주는 스왑(SWAP) 방식으로 운영된다. 이러한 스왑 방식에서는 로봇 작업 순서가 결정되어 진다. 그러나, 로봇의 팔 이외에 임시버퍼가 없고, 각 챔버는 엄격한 체제 시간 제약(Residency Time Constraint)을 가지고 있기 때문에 로봇의 작업 시점의 제어가 필요하다. 본 논문에서는 간단한 Earliest Starting 방식으로 로봇의 작업 시점을 제어한다고 가정했을 때, 스왑 방식을 운용하면서 체제 시간 제약을 만족하는 공정 시간들의 조건을 제시한다. 공정 시간은 엔지니어에 의해 다소 조정이 가능하므로 공정 시간들의 조건은 엔지니어에게 스케줄 가능한 공정 시간을 결정할 수 있도록 지원해 주는 시스템에 활용 가능하다. 또한, 본 논문에서는 FSM(Finite State Machine)을 이용하여 CTC(Cluster Tool Controller) 내부의 실시간 스케줄러 구현 방법을 제안한다.

  • PDF

Hatch를 고려한 컨테이너 터미널 적재순서 최적화 연구 (A Study on the Optimization of Stowage Planning for Container Terminal Considered by Hatch)

  • 이상헌;김문규;안태호
    • 산업공학
    • /
    • 제19권4호
    • /
    • pp.270-280
    • /
    • 2006
  • The shipping plan for an efficient augmentation of terminal is NP-hard problem which is subordinate to a shipping quantity. The load location problem and stowage planning problem are two important tactical problems for the efficient operations of container terminals. This paper is concerned with reduction of feasible region in constraints for stowage planning. After designing model which minimizes the number of shifting and the travel distance of the transfer crane, the simulated annealing algorithm is employed to search optimal solution quickly and accurately. In order to apply more realistic approach, the partial restriction through adding hatch is complemented to stowage planning decision problem applied in cluster. A variety of numerical experiments demonstrated that solutions by simulated annealing algorithm are useful and applicable in practice.

퍼지 클러스터링 알고리즘을 이용한 타이어 접지면 패턴의 분류 (Tire Tread Pattern Classification Using Fuzzy Clustering Algorithm)

  • 강윤관;정순원;배상욱;김진헌;박귀태
    • 한국지능시스템학회논문지
    • /
    • 제5권2호
    • /
    • pp.44-57
    • /
    • 1995
  • 본논문에서는 GFI(Generalized Fuzzy Isodata)와 FI(Fuzzy Isodata) 알고리즘에 관한 이론을 고찰하고 이를 타이어 접지면 패턴 분류에 적용해 보았다. GFI 알고리즘은 FI 알고리즘의 일반화된 형태로서 분할된 군집에 대해서도 퍼지 분할 행렬(fuzzy partition matrix)을 고려해 다시 군집화(clustering)를 가능하게 하는 알고리즘이다. GFI 알고리즘을 사용하여 이진 트리를 구성함에 있어서 각 노드에서의 분할 여부, 즉 군잡화의 타당성(clustering validity) 점검 및 최종적인 이진 트리의 완성은 FDH(Fuzzy Divisve Hierarchical) 군집화알고리즘을 통해 이루어진다. 타이어 접지면에 대한 표준 특징량을 선정하거나 패턴 분류를 수행함에 있어서 이들 알고리즘은모두 우수한 성능을 가짐을 알 수 있었다. 패턴의 특징량으로는 전처리된 타이어 접지면 영상에 나타나는 윤곽선(edge)의 각도 성분을 선정하였으며 이렇게 선정된 특징량은 패턴의 특징을 잘 표현해 주는 유용한 정보를 가진 것으로 생각된다.

  • PDF

Influence of Ammonia Solvation on the Structural Stability of Ethylene Cluster Ions

  • Jung Kwang Woo;Choi Sung-Seen;Jung Kwang Woo;Hang Du-Jeon
    • Bulletin of the Korean Chemical Society
    • /
    • 제13권3호
    • /
    • pp.306-311
    • /
    • 1992
  • The stable structures of pure ethylene and mixed ethylene-ammonia cluster ions are studied using an electron impact ionization time-of-flight mass spectrometer. Investigations on the relative cluster ion distributions of $(C_2H_4)_n(NH_3)_m^+$ under various experimental conditions suggest that $(C_2H_4)_2(NH_3)_3^+$ and $(C_2H_4)_3(NH_3)_2^+$ ions have the enhanced structural stabilities, which give insight into the feasible structure of solvated ions. For the stable configurations of these ionic species, we report an experimental evidence that both $(C_2H4)_2^+(C_2H_4)_3^+$ clusters as the central cations provide three and two hydrogen-bonding sites, respectively, for the surrounding $NH_3$ molecules. This interpretation is based on the structural stability for ethylene clusters and the intracluster ion-molecular rearrangement of the complex ion under the presence of ammonia solvent molecules.

차세대 집중형 항행 서비스를 위한 이동체 웹 서버 클러스터 설계 (Vehicular Web Server Cluster Design for Next Generation Centralized Navigation Services)

  • 김용호;김영용
    • 한국항행학회논문지
    • /
    • 제13권5호
    • /
    • pp.669-676
    • /
    • 2009
  • HTTP나 오디오/비디오 스트리밍 서비스는 미래 집중형 항행 시스템에서 사용될 수 있는 가장 유력한 서비스들로 이러한 서비스들을 제공하기 위해서 서비스 사업자들은 웹 서버들의 묶음인 웹 서버 클러스터를 사용하는 것이 권장된다. 본 논문에서는 사용자의 등급에 따라 우선순위를 고려한 차등 접속을 제공할 수 있는 웹 서버 클러스터에 대한 수학적 모델링과 성능 분석 그리고 설계 방법을 제공한다. 몇 가지 가능한 시나리오를 통해 사용자 등급에 따라 차등 서비스를 제공해 줄 수 있는 효과적인 웹 서버 클러스터 방법을 대기행렬 이론을 이용한 성능 모델링을 통하여 분석해 보았다. 또한 효과적인 웹 서버 클러스터 방법을 제공해 줄 수 있는 트래픽 부하 조절기 설계에 대한 효율적인 기준도 제시하였다. 마지막으로 제안된 수학적 모델의 정확도를 컴퓨터 모의실험을 통하여 검증하였다.

  • PDF

Identification of Adaptive Traits Facilitating the Mechanized Harvesting of Adzuki Bean (Vigna angularis)

  • Xiaohan Wang;Yu-Mi Choi;Sukyeung Lee;Myoung-Jae Shin;Jung Yoon Yi;Kebede Taye Desta;Hyemyeong Yoon
    • 한국자원식물학회지
    • /
    • 제35권6호
    • /
    • pp.785-795
    • /
    • 2022
  • Traditional germplasms are unsuitable for mechanized production, limiting adzuki bean production. The creation of cultivars that can be harvested by mechanized means is an urgent task for breeders. The bottom pod height (BPH), lodging resistance, and synchronous maturing of adzuki beans are critical factors for the reduction of losses due to mechanized harvesting. In this study, 14 traits of 806 adzuki bean accessions were analyzed. All growth stages and the yield, lodging score, and synchronous maturing correlated negatively with the BPH. These negative correlations reflect the increased difficulty of breeding to simultaneously satisfy the needs for no lodging, high synchronous maturing rates, BPHs > 10 cm, and high yield. We screened three germplasms with no lodging, high synchronous maturing rates, and BPHs > 10 cm that were used as mechanization-adapted breeding material for crossing with high-yield cultivars. Agronomic trait diversity in adzuki beans was also examined in this study. Principal component and cluster analyses were conducted for 806 germplasms resulting in three clusters with the yield and three growth stage traits serving as the main discriminating factors. Cluster 1 included high-yield germplasms with the number of pods per plant and the number of seeds per pod being the major discriminant factors. Cluster 2 included germplasms with long growth periods and large 100-seed weights while cluster 3 contained germplasms with high BPHs. In general, the characteristics that make mechanical harvesting feasible and those assessed in this study could be utilized to choose and enhance adzuki beans production.