• 한국멀티미디어학회논문지
• /
• 제6권4호
• /
• pp.736-745
• /
• 2003

Traditional slicing techniques make slices through dependence graphs. They also improve the accuracy of slices. However, traditional slicing techniques require many vertices and edges in order to express a data communication link because they are based on static slicing techniques. Therefore the graph becomes very complicated, and size of the slices is larger. We propose the representation of a dynamic object-oriented program dependence graph so as to process the slicing of object-oriented programs that is composed of related programs in order to process certain jobs. We also propose an efficient slicing algorithm using the relations of relative tables in order to compute dynamic slices of object-oriented programs. Consequently, the efficiency of the proposed efficient dynamic object-oriented program dependence graph technique is also compared with the dependence graph techniques discussed previously As a result, this is certifying that an efficient dynamic object-oriented program dependence graph is more efficient in comparison with the traditional object-oriented dependence graphs and dynamic object-oriented program dependence graph.

• 한국컴퓨터산업학회논문지
• /
• 제2권9호
• /
• pp.1199-1208
• /
• 2001

프로그램 슬라이싱은 테스팅 및 유지보수 작업의 효율성을 높이기 위한 프로그램 분해 기술이다. 본 논문에서는 객체지향 프로그램 실행부의 슬라이싱 방법을 제안하고 정확성을 분석하였다. 또한 프로그램이 주어졌을 때 클래스 선언부에서 필요 없는 함수와 사용하지 않는 데이터멤버 및 서브객체를 제거하는 클래스 인터페이스 슬라이싱 방법을 제안하고 정확성을 증명하였다. 또 클래스 선언부만을 가지고 주어진 데이터멤버에 영향을 주는 또는 영향을 받는 부분을 추출해 내는 클래스 계층구조의 슬라이싱 방법을 제안하였다. 이러한 기술은 클래스 테스팅 같은 분야에서 정보분석 작업에 이용될 수 있다.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 2008년도 추계 공동 국제학술대회
• /
• pp.651-655
• /
• 2008

Traditional slicing techniques make slices through dependence graphs. They also improve the accuracy of slices. However, traditional slicing techniques require many vertices and edges in order to express a data communication links. Therefore the graph becomes complicated, and size of the slices is larger. We propose the representation of a dynamic object-oriented program dependence graph so as to process the slicing of object-oriented programs that is composed of related programs in order to process certain jobs. The efficiency of the proposed efficient dynamic object-oriented program dependence graph technique is also compared with the dependence graph techniques discussed previously. As a result, this is certifying that an efficient dynamic object-oriented program dependence graph is more efficient in comparison with the traditional dynamic object-oriented program dependence graph.

• 한국정밀공학회지
• /
• 제16권7호
• /
• pp.85-93
• /
• 1999

In this study, PC-based slicing machine and driving software were constructed for the purpose of automation of semi-conductor cutting process. The biggest feature of software is variation of parameter and include data base, signal monitoring, error report, corresponding action or automatic motion planing. Parameters were drawn and algorithms were developed to make software by GUI interface. The cutting experiment was done for sampled wafer to see the effectiveness of the soft automation. From the experimented and implemented results, it is shown that parameters for automation of slicing process could be drawn, then its algorithms constructed. It could be considered what is the merit of this slicing machine by comparing the PC-based and the NC-based.

• International Journal of Precision Engineering and Manufacturing
• /
• 제8권3호
• /
• pp.64-70
• /
• 2007

Of all the rapid tooling (RT) methods currently available, thick-layer laminated tooling is the most suitable for large-scale, low-cost dies and molds. Currently, the determination of a lamina's contour or profile and the associated slicing algorithms are based on existing rapid prototyping (RP) data manipulation technology. This paper presents a new adaptive slicing algorithm developed exclusively for profiled edge laminae (PEL) tooling PEL tooling is a thick-layer RT technique that involves the assembly of an array of laminae, whose top edges are simultaneously profiled and beveled using a line-of-sight cutting method based on a CAD model of the intended tool surface. The cutting profiles are based on the intersection curve obtained directly from the CAD model to ensure geometrical accuracy. The slicing algorithm determines the lamina thicknesses that minimize the dimensional error using a new tool shape error index. At the same time, the algorithm considers the available lamination thicknesses and desired lamina interface locations. We demonstrate the new slicing algorithm by developing a simple industrial PEL tool based on a CAD part shape.

• 한국멀티미디어학회논문지
• /
• 제5권3호
• /
• pp.331-341
• /
• 2002

기존의 슬라이싱 기법들은 슬라이스를 생성하며 생성된 슬라이스의 정확성을 위해 종속 그래프를 사용한다. 그러나, 기존의 많은 슬라이싱 기법들은 동적 슬라이싱 기법에 바탕을 두고 데이터 통신 링크를 표현하기 때문에 많은 정점들(vertices)과 간선들(edges)을 필요로 한다. 그러므로 그 그래프는 매우 복잡하다. 어떤 프로그램 시스템에 대한 소프트웨 어 슬라이싱을 처리하기 위해 본 논문에서는 동적 시스템 종속그래프를 제안한다. 그리고, 소프트웨어 시스템의 동적 슬라이스를 산출하기 위해 관련 테이블들의 관계도를 이용한 효율적인 슬라이싱 알고리즘을 제안한다. 동적 슬라이스의 생성을 위한 동적시스템종속그래프는 제안된 알고리즘으로부터 얻어진 마킹테이블을 사용해서 얻어진다. 슬라이스의 최종 결과는 이 그래프를 추적함으로써 얻어진다. 결론적으로 제안된 동적시스템종속그래프 기법의 효율성을 기존의 종속그래프 기법과 비교하였다.

• 대한산업공학회지
• /
• 제20권1호
• /
• pp.99-112
• /
• 1994

This paper describe the development of a systematic method of slicing solid parts based on a data structure called Sliced Profile Data Structure(SPDS). SPDS is an augmented polygon data structure that allows multiple layers of sliced profiles to be connected together. The method consists of five steps: (1) Selection of slicing directions, (2) Determination of slicing levels, (3) Creation of sliced profiles, (4) Connection of sliced profiles, and (5) Refinement. The presented method is aimed at enhancing the applicability of CSG for manufacturing by overcoming the problem of non-uniqueness and global nature. The SPDS-based method of feature extraction is suitable for recognizing broad scope of features with detailed information. The method is also suitable for identifying the global relationships among features and is capable of incorporating the context dependency of feature extraction.

• 한국CDE학회논문집
• /
• 제3권1호
• /
• pp.15-21
• /
• 1998

Several adaptive and direct slicing methods have been developed to make the slice data for RP parts with better accuracy and speed. This research deals with a new adaptive slicing algorithm that shows drastic improvement in computing time for calculating the slices of a part. First, it uses less number of sampling points fur each slice in determining the thickness of the next slice. Secondly, the idea of contour map is utilized to determine the optimal sampling point on each slice. Thirdly, the calculation efficiency is further improved by introducing vertical character lines of the given part. The results in terms of accuracy and speed are compared with the existing methods.

• 정보처리학회논문지D
• /
• 제10D권6호
• /
• pp.999-1010
• /
• 2003

프로그램 슬라이싱은 프로그램의 특정 지점에 나타난 변수의 값에 영향을 미치는 문장들을 프로그램으로부터 추출하는 방법이다. 프로그램 슬라이싱은 프로그램 디버깅, 프로그램 테스팅, 프로그램 통합, 병렬 프로그램 실행, 소프트웨어 메트릭스, 역공학, 유지보수 등 여러 응용 분야에 적용할 수 있다. 본 논문에서는 포인터 변수, 포인터 변수가 참조하는 객체, 배열, 구조체가 같은 복잡한 자료구조가 나타나는 프로그램에서 정확한 슬라이스를 추가하기 위한 알고리즘을 제안한다. 복잡한 자료구조가 나타나는 프로그램 상에서 객체의 보다 더 정확한 정적 분석 정보를 생성하기 위해 객체 참조상태 그래프를 제안하고, 그 효율성을 보였다.

• International Journal of Quality Innovation
• /
• 제7권2호
• /
• pp.141-156
• /
• 2006

This study describes a novel algorithm for optimizing the quality yield of silicon wafer slicing. 12 inch wafer slicing is the most difficult in terms of semiconductor manufacturing yield. As silicon wafer slicing directly impacts production costs, semiconductor manufacturers are especially concerned with increasing and maintaining the yield, as well as identifying why yields decline. The criteria for establishing the proposed algorithm are derived from a literature review and interviews with a group of experts in semiconductor manufacturing. The modified Delphi method is then adopted to analyze those results. The proposed algorithm also incorporates the analytic hierarchy process (AHP) to determine the weights of evaluation. Additionally, the proposed algorithm can select the evaluation outcomes to identify the worst machine of precision. Finally, results of the exponential weighted moving average (EWMA) control chart demonstrate the feasibility of the proposed AHP-based algorithm in effectively selecting the evaluation outcomes and evaluating the precision of the worst performing machines. So, through collect data (the quality and quantity) to judge the result by AHP, it is the key to help the engineer can find out the manufacturing process yield quickly effectively.