• 동아시아식생활학회지
• /
• 제4권3호
• /
• pp.75-86
• /
• 1994

The study was conducted to research the desirable method for fermentation of acidic apple beverage in the farmhouse. Step by step fermentation(SSF), complex fermentation after crushing of the fruit(CCF), complex fermentation after slicing of the fruit(SCF) and natural fermentation added yeast only after slicing of the fruit(SYNF) were compared. The brief fermentor for using stationary complex fermentation in the farmhouse was made in this experiment. The ability of acid production, flavor, taste and color were measured by sensory evaluation and mechanical methods. The quality of vinegar by SYNF and SCF were estimated by color, flavor, content, composition of sugar, and organic acids, and which was a suitable fermentation method for the farmhouse. The strains of acetobacter, SYNF-1 and 2 were isolated from the SYNF vinegar, and if has been shown that the SYNF-1 was a main strain in this study.

• 동아시아식생활학회지
• /
• 제4권3호
• /
• pp.135-146
• /
• 1994

The study was conducted to research the desirable method for fermentation of acidic beverage in the farmhouse using peach dropped at harvesting periods. Step by step fermentation(SSF), complex fermentation after crushing of the fruit(CCF), complex fermentation after slicing of the fruit(SCF) and natural fermenation added yeast only after slicing of the fruit(SYNF) were compared. The brief stationary fermentor for complex fermentation in the farmhouse was made in this experiment. The ability of acid production, flavor, taste and color were measured by sensory evaluation and mechanical methods. The quality of vinegar by SYNF was the most desirable, estimated by the color, the flavor, the content and composition of sugar, and of organic acids, and which was a suitable fermentation method for the farmhouse. The strains of acetobacter SYNF-1, 2 and 3 were isolated from the SYNF vinegar, and the SYNF-1 was a main strain.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1996년도 춘계학술대회 논문집
• /
• pp.587-591
• /
• 1996

Usually triangular patches are used to transfer geometric shape in Rpaid Prototyping CAM system. STL, a list of triangles, is de facto in RP industry. Because STL has no topology data, it can cause errornous results. So, STL should be verified before using. After adding support structures to anchor the part to the platform and to prevent sagging or distortion, slicing and layer by layer manufacturing process are done. But triangular patch is surface model and cannot provide dufficient information on geometry in the above processes. So, geometric modeling is necessary in verifying STL, adding support structures, and slicing. It is natural that triangle based modeling is the best when traingular patches are used as input. Considering support structures, solid and faces coexist in RP process. Therefore non-manifold modeler is required. In this study, triangle based non-manifold geometric modeling is proposed for RP system consitent with STL input.

• 대한기계학회논문집A
• /
• 제29권6호
• /
• pp.895-903
• /
• 2005

In this paper, we present a cutter location (CL) surface deformation approach for constant scallop height tool path generation from triangular mesh. The triangular mesh model of the stereo lithography (STL) format is offset to the CL surface and then deformed in accordance with the deformation vectors, which are computed by the slope and the curvature of the CL surface. In addition, the tool path which is computed by slicing the deformed CL surface is inversely deformed by those same deformation vectors to a tool path with a constant scallop height. The proposed method is implemented, and a tool path generated by the proposed method is tested by simulation and by numerical control (NC) machining. The scallop height was found to be constant over the entire machined surface, demonstrating much better quality than that of mesh slicing, under the same constraints for machining time.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.298-298
• /
• 2000

This paper presents the optimization technique to analyze the effect of the design parameters of rapid prototyping system for human brain model fabrication. The optimization method considers the functional relationships among the design parameters such as thickness gap, shrink rate, and laser speed that govern the operation of fabrication system. This paper applies a discrete optimization technique as the optimization method to determine the dominant parameter values. Additional study includes manner of complement surface image of ellipse which approximates the brain model using the adaptive slicing and the offset contour. According to the parameters tuning and interaction of effect, more suitable parameter values can be obtained by enhanced 3D brain model fabrication.

• 한국국방경영분석학회지
• /
• 제14권1호
• /
• pp.42-52
• /
• 1988

Many programmers start debugging by reading the faulty program from start to bottom without investigating carefully the erroneous program. Expert programmers, however, trace backward from a particular variable in a specific statement to identify all possible sources of influence on the value of variable (program slice). Weiser proposed a slicing algorithm (method) that is complex, iterative and still in modification [3,4]. This paper presents a method to generate a program slice by use of matrix computation which represents all possible slices of the program. The matrix representation of a program is soundly based on the graph theory of data dependency.

• 산업경영시스템학회지
• /
• 제34권4호
• /
• pp.129-137
• /
• 2011

To date, facility layout problems has been solved and applied for job shop situations. Since flow shop has more restrictions, the solution space is much smaller than job shop. An efficient heuristic algorithm for facility layout problems for flow shop layouts is needed to be developed. In this thesis, a heuristic algorithm for rectangular bay layouts in a flow shop situation is presented. The proposed algorithm is developed by using slicing tree representation and applied to various flow shop layout problems. The effectiveness of the proposed algorithm in terms of exploration rate and objective function value are shown by comparing our results to simulated annealing.

• 한국국방경영분석학회지
• /
• 제13권2호
• /
• pp.42-52
• /
• 1987

Many programmers start debugging by reading the faulty program from start to bottom without investigating carefully the erroneous program. Expert programmers, however, trace backward from a particular variable in a specific statement to identify all possible sources of influence on the value of variable (program slice). Weiser proposed a slicing algorithm (method) that is complex, iterative and still in modification [3,4]. This paper presents a method to generate a program slice by use of matrix computation which represents all possible slices of the program. The matrix representation of a program is soundly based on the graph theory of data dependency.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제27권8호
• /
• pp.877-885
• /
• 2000

정적 분할이란 가능한 모든 입력값을 고려할 때 프로그램 내의 한 지점에서 계산되는 값에 영향을 줄 수 있는 프로그램 부분들의 집합을 말한다. 본 논문에서는 일차 함수형 언어의 오퍼레이셔널 의미 정의에 기반하여 정적 분할을 정형적으로 정의하고 요약 해석을 통한 정적 분할의 분석 방법을 제시 하였으며, 제시된 분석 방법이 건전함을 증명하였다.

• Journal of information and communication convergence engineering
• /
• 제17권3호
• /
• pp.185-190
• /
• 2019

The explosive growth of data traffic and services has created cost challenges for networks. Studies have attempted to effectively apply network slicing in fifth generation networks to provide high speed, low latency, and various compatible services. However, in network slicing using mixed-integer linear programming, the operation count increases exponentially with the number of physical servers and virtual network functions (VNFs) to be allocated. Therefore, we propose an efficient slice allocation method based on cluster technology, comprising the following three steps: i) clustering physical servers; ii) selecting an appropriate cluster to allocate a VNF; iii) selecting an appropriate physical server for VNF allocation. Solver runtimes of the existing and proposed methods are compared, under similar settings, with respect to intra-slice isolation. The results show that solver runtime decreases, by approximately 30% on average, with an increase in the number of physical servers within the cluster in the presence of intra-slice isolation.