• Corrosion Science and Technology
• /
• 제14권4호
• /
• pp.166-171
• /
• 2015

Knowledge of how metal releases from the stainless steels used in food processing applications and cooking utensils is essential within the framework of human health risk assessment. A new European standard test protocol for testing metal release in food contact materials made from metals and alloys has recently been published by the Council of Europe. The major difference from earlier test protocols is the use of citric acid as the worst-case food simulant. The objectives of this study were to assess the effect of citric acid at acidic, neutral, and alkaline solution pH on the extent of metal release for stainless steel grades AISI 304 and 316, commonly used as food contact materials. Both grades released lower amounts of metals than the specific release limits when they were tested according to test guidelines. The released amounts of metals were assessed by means of graphite furnace atomic absorption spectroscopy, and changes in the outermost surface composition were determined using X-ray photoelectron spectroscopy. The results demonstrate that both the pH and the complexation capacity of the solutions affected the extent of metal release from stainless steel and are discussed from a mechanistic perspective. The outermost surface oxide was significantly enriched in chromium upon exposure to citric acid, indicating rapid passivation by the acid. This study elucidates the effect of several possible mechanisms, including complex ion- and ligand-induced metal release, that govern the process of metal release from stainless steel under passive conditions in solutions that contain citric acid.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2013년도 추계학술대회 논문집
• /
• pp.372-373
• /
• 2013

• 충청수학회지
• /
• 제33권4호
• /
• pp.413-427
• /
• 2020

In this work we study 0-commuting matrix C(0) under relationships with the Pascal matrix C(1). Like kth power C(1)k is an arithmetic matrix of (kx+y)n with yx = xy (k ≥ 1), we express C(0)k as an arithmetic matrix of certain polynomial with yx = 0.

• 경영과학
• /
• 제25권2호
• /
• pp.81-88
• /
• 2008

This paper presents a new algorithm for the K shortest paths problem in a network. After a shortest path is produced with Dijkstra algorithm. detouring paths through inward arcs to every vertex of the shortest path are generated. A length of a detouring path is the sum of both the length of the inward arc and the difference between the shortest distance from the origin to the head vertex and that to the tail vertex. K-1 shorter paths are selected among the detouring paths and put into the set of K paths. Then detouring paths through inward arcs to every vertex of the second shortest path are generated. If there is a shorter path than the current Kth path in the set. this path is placed in the set and the Kth path is removed from the set, and the paths in the set is rearranged in the ascending order of lengths. This procedure of generating the detouring paths and rearranging the set is repeated until the $K^{th}-1$ path of the set is obtained. The computational results for networks with about 1,000,000 nodes and 2,700,000 arcs show that this algorithm can be applied to a problem of generating the detouring paths in the metropolitan traffic networks.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.60-66
• /
• 2006

This paper presents a new algorithm for the K shortest path problem in a directed network. After a shortest path is produced with Dijkstra algorithm, detouring paths through inward arcs to every vertex of the shortest path are generated. A length of a detouring path is the sum of both the length of the inward arc and the difference between the shortest distance from the origin to the head vertex and that to the tail vertex. K-1 shorter paths are selected among the detouring paths and put into the set of K paths. Then detouring paths through inward arcs to every vertex of the second shortest path are generated. If there is a shorter path than the current Kth path in the set, this path is placed in the set and the Kth path is removed from the set, and the paths in the set is rearranged in the ascending order of lengths. This procedure of generating the detouring paths and rearranging the set is repeated for the K-1 st path of the set. This algorithm can be applied to a problem of generating the detouring paths in the navigation system for ITS and also for vehicle routing problems.

• 한국기계가공학회지
• /
• 제3권4호
• /
• pp.88-94
• /
• 2004

High manganese steel was maintained stability of Non-Magnetics performance. Fatigue tests were carried out under constant stress amplitude, using a non-magnetic high manganese steel. The fatigue crack growth mechanism of the high manganese steel was clarified from results such as observation of crack growth path and fracture surface. The result of getting this study was shown as following: 1) Remarkably ${\Delta}Kth$ of the high manganese steel is big with about 3 times of the general steel product. 2) In the low ${\Delta}K$ value region, da/dN is dependent on Kmax, and in the high ${\Delta}K$ value region, it is dependent on ${\Delta}Keff$. The reason of this behavior is crack closure due to fracture surface roughness and fretting oxide. 3) It seems to ease the stress concentration of crack tip crack growth behavior in the ${\Delta}Kth$ vicinity by the generation of the secondary crack.

• 한국조명전기설비학회지:조명전기설비
• /
• 제8권1호
• /
• pp.53-56
• /
• 1994

PID 제어기는 많은 서보 제어 시스템에 사용되고 있다. 하지만 제어 시스템이 외란이나 시변특성을 가졌을 때 시스템의 강인제어가 어렵게 된다. 이에 대한 보완적인 한 방법으로 본 논문에서는 PID 제어기가 퍼지 레귤레이터를 갖는 제어기법을 제시하였다. 퍼지 레귤레이터는 에러와 에러 변화분에 의해서 설계되며, k번째 제어 입력은 k번째와(k-1)번째 비퍼지화 값의 덧셈에 의해 결정된다. 제어입력은 입력측에 전달된다. 퍼지 레귤레이터에 의한 강인한 제어기능은 시뮬레이션에 의해 확인하였다.

• 대한수학회지
• /
• 제42권2호
• /
• pp.365-386
• /
• 2005

Let L be the free Lie superalgebra generated by a $Z_2$-graded vector space V over C. Suppose that g is a Lie superalgebra gl(m, n) or q(n). We study the g-module structure on the kth homogeneous component Lk of L when V is the natural representation of g. We give the multiplicities of irreducible representations of g in Lk by using the character of Lk. The multiplicities are given in terms of the character values of irreducible (projective) representations of the symmetric groups.

• Journal of the Korean Statistical Society
• /
• 제30권1호
• /
• pp.115-125
• /
• 2001

We consider the threshold autoregressive moving average(TARMA) process and find a sufficient condition for strict stationarity of the proces. Given region for stationarity of TARMA(p,q) model is the same as that of TAR(p) model given by Chan and Tong(1985), which shows that the moving average part of TARMA(p,q) process does not affect the stationarity of the process. We find also a sufficient condition for the existence of kth moments(k$\geq$1) of the process with respect to the stationary distribution.

• Korean Journal of Mathematics
• /
• 제18권1호
• /
• pp.29-35
• /
• 2010

A Fermat-type equation deals with representing a nonzero constant as a sum of kth powers of nonconstant functions. Suppose that $k{\geq}2$. Consider $\sum_{i=1}^{p}\;f_i(z)^k=1$. Let p be the smallest number of functions that give the above identity. We consider the Fermat-type equation for MAobius transformations and obtain $k{\leq}p{\leq}k+1$.