• 한국축산식품학회지
• /
• 제40권5호
• /
• pp.785-794
• /
• 2020

Food Codex regulations have set freshness limits for oils used to fry food, such as potato and fish products, and fried food itself; however, no such freshness limits have been set for meat products, such as sweet and sour pork. The freshness standard suggest that acid values (AVs) and peroxide values (POVs) for frying oil should be less than 2.5 and 50, respectively, whereas AVs and POVs for common fried food should be less than 5.0 and 60, respectively. Therefore, in this study, we investigate the effect of the number of frying cycles on oxidation-promoted changes in the oils used to fry sweet and sour pork and fried food itself during repeated frying over 10 d by determining their AVs and POVs, which were found to be highly correlated. Soybean, canola, palm, and pork lard oils could be reused approximately 37, 32, 58, and 87 times, respectively, to fry sweet and sour pork based on oil freshness, and 78, 78, 81, and 286 times, respectively, based on the freshness of fried food. Our data may help establish food-quality regulations for oils used to fry animal-based foods.

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

퍼지숫자는 보통숫자와는 달리 애매모호한 값을 표현하기 때문에, 어느 퍼지숫자가 다른 퍼지숫자보다 큰지 작은지를 명확히 기술하기 어렵다. 따라서, 주어진 퍼지숫자의 집합 내에서, 어느 퍼지숫자가 몇 번째로 큰지, 또는 k번째로 큰 퍼지숫자가 어느 것인지 역시 애매모호할 수밖에 없다. 본 논문에서는 퍼지숫자의 순위와 k번째로 큰 퍼지숫자를 결정하기 위하여 퍼지집합을 이용하는 방법을 제안한다. 제안하는 방법은 퍼지숫자들 사이에 퍼지대소관계가 주어졌다고 가정하며, 이를 이용하여 퍼지숫자의 순위와 k번째 큰 퍼지숫자를 결정한다. 제안하는 방법은 어느 한 퍼지숫자가 취할 수 있는 모든 순위를 퍼지집합으로 표현하며, k번째로 큰 퍼지숫자가 될 수 있는 모든 퍼지숫자들을 퍼지집합으로 표현한다.

• 디지털융복합연구
• /
• 제11권11호
• /
• pp.343-349
• /
• 2013

러프집합에서는 동치류와 근사공간의 개념을 이용하여 데이터 마이닝 분야에서 중복되는 정보로부터 특징점을 효율적으로 추출하여 최적화된 제어규칙을 유도할 수 있다. 이러한 추출과정에서 가장 중요하게 고려되어져야 할 부분은 많은 속성에 대한 감축이다. 본 논문에서는 속성간의 관계에서 러프엔트로피를 이용하여 가장 신뢰도가 우수한 속성을 구할 수 있는 정보이론적인 척도를 제시한다. 제안된 방법은 러프엔트로피를 기반으로 불필요한 속성을 제거함으로써 유용한 리덕트를 생성하고 이들에 대한 코어를 형성한다. 결과적으로 원시정보의 내용은 변하지 않으면서 지식감축을 통하여 간소화된 제어규칙을 구축할 수 있음을 보인다.

• International Journal of Precision Engineering and Manufacturing
• /
• 제7권1호
• /
• pp.3-8
• /
• 2006

This paper deals with an automated computer-aided process planning and die design system by which designer can determine operation sequences even if they have a little experience in process planning and die design for axisymmetric products. An attempt is made to link programs incorporating a number of expert design rules with the process variables obtained by commercial FEM softwares, DEFORM and ANSYS, to form a useful package. The system can provide a flexible process based on either the reduction in the number of forming sequences by combining the possible two processes in sequence, or the reduction of deviation of the distribution on the level of the required forming loads by controlling the forming ratios. Especially in die design module optimal design technique and horizontal split of die insert were investigated for determining appropriate dimensions of components of multi-former die set. Results obtained, using the modules, enable the design and manufacture of a die set for a multi-former to be more efficiently performed.

• 복식
• /
• 제52권8호
• /
• pp.15-27
• /
• 2002

To set the measurements of bras for women in their 20s, considering the comfortableness in wearing and tightness, this paper conducted a questionnaire survey concerning breasts and bras as well as measurements of body and contact surface pressure. Easier and more accurate method of determining cup sizes based on the breast circumference is recommended to make up for the problem of current bra size system that can falsely measure cup sizes. Lower chest circumference was set at 5 cm equal intervals, and the breast circumference applicable to the cup size was set starting from the standard, 18 cm (A-cup), at 2 cm equal intervals, which gave the best coverage (88.1%).

• Mass Spectrometry Letters
• /
• 제7권3호
• /
• pp.74-78
• /
• 2016

Targeted glycoproteomics is an effective way to discover disease-associated glycoproteins in proteomics and serial affinity chromatography (SAC) using lectin and glycan-targeting antibodies shows glycan diversity on the captured glycoproteins. This study suggests a way to determine glycan heterogeneity and structural analysis on the post-translationally modified proteins through serial affinity column set (SACS) using four Lycopersicon esculentum lectin (LEL) columns. The great advantage of this method is that it differentiates between glycoproteins on the basis of their binding affinity. Through this study, some proteins were identified to have glycoforms with different affinity on a single glycoprotein. It will be particularly useful in determining biomarkers in which the disease-specific feature is a unique glycan, or a group of glycans.

• 한국시뮬레이션학회논문지
• /
• 제14권3호
• /
• pp.137-146
• /
• 2005

In parametric approach to a signature verification, it generally uses so many redundant features unsuitable for each individual signature that it causes harm, instead. This paper proposes a method of determining personalized weights of a feature set in signature verification with parametric approach by identifying the characteristics of each feature. For an individual signature, we define a degree of how difficult it is for any other person to forge the one's (called 'DFD' as the Degree of Forgery Difficulty). According to the statistical characteristics and the intuitional characteristics of each feature, the standard features are classified into four types. Four types of DFD functions are defined and applied into the distance calculation as a personalized weight factor. Using this method, the error rate of signature verification is reduced and the variation of the performance is less sensitive to the changes of decision threshold.

• 소성∙가공
• /
• 제10권1호
• /
• pp.53-58
• /
• 2001

Set-up reference values, used in determining the optimum downcoiling tension, we experimentally verified in this study. During the actual downcoiling, the strip suffers both tension and bending force through the rotation of mandrel. Therefore, simulative test which can measure both tension and bending resistance of strip was performed to estimate set-up reference value for strip tension during downcoiling operations. The values obtained from the simulative test were correlated with the yield stress which has conventionally been used as reference values for downcoiling tension. The correlative analysis showed that the yield stress of strip can be a good reference value for downcoiling tension. Furthermore, the bending load also shows strong correlation with simulated values due to the close relationship between yield stress and bending load.

• International Journal of Contents
• /
• 제12권2호
• /
• pp.42-48
• /
• 2016

We present efficient algorithms for computing centroid directions for each of the three types of monotonicity in a polyhedron: strong, weak, and directional monotonicity, which can be used for optimizing directions in many 3D manufacturing processes. Strongly- and directionally-monotone directions are the poles of great circles separating a set of spherical polygons on the unit sphere, the centroids of which are shown to be obtained by applying the previous result for determining the maximum intersection of the set of their dual spherical polygons. Especially in this paper, we focus on developing an efficient method for approximating the weakly-monotone centroid, which is the pole of one of the great circles intersecting a set of spherical polygons on the unit sphere. The original problem is approximately reduced into computing the intersection of great bands for avoiding complicated computational complexity of non-convex objects on the unit sphere, which can be realized with practical linear-time operations.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2000년도 추계학술대회 및 정기총회
• /
• pp.113-116
• /
• 2000

The purpose of this study is to present a method for determining the k most vital arcs in shortest path problem using an evolutionary algorithm. The problem of finding the k most vital arcs in shortest path problem is to find a set of k arcs whose simultaneous removal from the network causes the greatest increase in the total length of shortest path. The problem determining the k most vital arcs in shortest path problem has known as NP-hard. Therefore, in order to deal with the problem of real world the heuristic algorithm is needed. In this study we propose to the method of finding the k-MVA in shortest path problem using an evolutionary algorithm which known as the most efficient algorithm among heuristics. For this, the expression method of individuals compatible with the characteristics of shortest path problem, the parameter values of constitution gene, size of the initial population, crossover rate and mutation rate etc. are specified and then the effective genetic algorithm will be proposed. The method presented in this study is developed using the library of the evolutionary algorithm framework (EAF) and then the performance of algorithm is analyzed through the computer experiment.