• Journal of the Institute of Convergence Signal Processing
• /
• v.23 no.2
• /
• pp.84-90
• /
• 2022

Machine tool state monitoring is a process that automatically detects the states of machine. In the manufacturing process, the efficiency of machining and the quality of the product are affected by the condition of the tool. Wear and broken tools can cause more serious problems in process performance and lower product quality. Therefore, it is necessary to develop a system to prevent tool wear and damage during the process so that the tool can be replaced in a timely manner. This paper proposes a method for diagnosing five tool states using a deep learning-based hierarchical convolutional neural network to change tools at the right time. The one-dimensional acoustic signal generated when the machine cuts the workpiece is converted into a frequency-based power spectral density two-dimensional image and use as an input for a convolutional neural network. The learning model diagnoses five tool states through three hierarchical steps. The proposed method showed high accuracy compared to the conventional method. In addition, it will be able to be utilized in a smart factory fault diagnosis system that can monitor various machine tools through real-time connecting.

• Journal of Korean Society of Steel Construction
• /
• v.25 no.1
• /
• pp.35-45
• /
• 2013

The concrete-filled tube column has the excellent structural performance. But it is difficult to connect with column and beam because of closed section. It suggests that pipe should be produced by welding two sides together where two shapes are joined after a channel is pre-welded onto the three sides in order to form an internal diaphragm. The upper diaphragm of the connection used the horizontal plate and the lower diaphragm used the Vertical plate. This research performed 6 monotonic tension experiments describing the connection upside and downside in order to evaluate the structural capability of the offered connection. And the cyclic loading experiment was performed about 2 T-Type column to beam connections. As to the experimental result edge cutting geometry, there was no big effect. An increase in the number of holes of the plate ultimate strength was increased by 5% and The thickness of the plate increases, the maximum strength was increased by 4%. T-Type connections until it reaches the plastic moment showed a stable behavior.

• Korean Chemical Engineering Research
• /
• v.50 no.2
• /
• pp.310-316
• /
• 2012

The chromaticity of polyethylene glycol (PEG) generated from the recyling of a silicone slurry waste was improved by using activated carbon powder and a carbon filter. The color change of the PEG waste was investigated by changing the amount of adsorbent, adsorption time and temperature. The surface area of activated carbon did not have a significant impact on improving the color of the PEG waste. According to the results for the APHA color variation of the PEG waste changing the amount of the carbon adsorbent, the optimal usage to achieve the low APHA value was 100~150 mg-C/g-PEG. From the investigatnion on the effect of the adsorption temperature range from $25^{\circ}C$ to $100^{\circ}C$, it was found that the optimal temperatures were $40{\sim}50^{\circ}C$ in terms of achieving the lowest APHA value. The variation of the APHA color was investigated by changing the operation condition of the activated carbon filters. The use of ACF was a good way to enhance the chromaticity of the PEG waste. As a result, the APHA value of the PEG waste (APHA=53 at the initial waste) was reduced to be 10 through the ACF purification. It was also confirmed that the performance of the used carbon adsorbent can be recovered by the washing with purified water.

• Journal of the Korean Wood Science and Technology
• /
• v.47 no.4
• /
• pp.425-441
• /
• 2019

In this study, sound absorption capability and sound transmission loss of several kinds of target densities and thickness for six species of wood bark particle were estimated by the transfer function and transfer matrix methods. Resultantly, the mean sound absorption coefficient of a 100-mm thick Hinoki wood bark particle mat was 0.90 in the frequency range of 100-6400 Hz, whereas the mean sound absorption rate of a 50-mm thick Hinoki wood bark particle mat was 0.84 in the same frequency range. Particularly, at a thickness of 100 mm, it reached almost up to 100% in the frequency range of 1 KHz. The sound transmission losses of 100-mm thick Hinoki wood bark particle mat with a target density of 0.16 at 500 and 1000 Hz were 15.30 and 15.73 dB, respectively. When a 10-mm thick plywood was attached to the back of the wood particle mat, the sound transmission losses was increased by 20-30 dB. Wood bark can be used as an acoustical material owing to its high sound absorption rate and transmission loss.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.188-198
• /
• 2005

The Goldschmidt iterative algorithm for finding a floating point square root calculated it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's square root algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the square root of a floating point number F, the algorithm repeats the following operations: $R_i=\frac{3-e_r-X_i}{2},\;X_{i+1}=X_i{\times}R^2_i,\;Y_{i+1}=Y_i{\times}R_i,\;i{\in}\{{0,1,2,{\ldots},n-1} }}'$with the initial value is $'\;X_0=Y_0=T^2{\times}F,\;T=\frac{1}{\sqrt {F}}+e_t\;'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 28 for the single precision floating point, and 58 for the doubel precision floating point. Let $'X_i=1{\pm}e_i'$, there is $'\;X_{i+1}=1-e_{i+1},\;where\;'\;e_{i+1}<\frac{3e^2_i}{4}{\mp}\frac{e^3_i}{4}+4e_{r}'$. If '|X_i-1|<2^{\frac{-p+2}{2}}\;'$ is true, $'\;e_{i+1}<8e_r\;'$ is less than the smallest number which is representable by floating point number. So, $\sqrt{F}$ is approximate to $'\;\frac{Y_{i+1}}{T}\;'$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal square root tables ($T=\frac{1}{\sqrt{F}}+e_i$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.2
• /
• pp.380-389
• /
• 2005

The Goldschmidt iterative algorithm for a floating point divide calculates it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's divide algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To calculate a floating point divide '$\frac{N}{F}$', multifly '$T=\frac{1}{F}+e_t$' to the denominator and the nominator, then it becomes ’$\frac{TN}{TF}=\frac{N_0}{F_0}$'. And the algorithm repeats the following operations: ’$R_i=(2-e_r-F_i),\;N_{i+1}=N_i{\ast}R_i,\;F_{i+1}=F_i{\ast}R_i$, i$\in${0,1,...n-1}'. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than ‘$e_r=2^{-p}$'. The value of p is 29 for the single precision floating point, and 59 for the double precision floating point. Let ’$F_i=1+e_i$', there is $F_{i+1}=1-e_{i+1},\;e_{i+1}',\;where\;e_{i+1}, If '$[F_i-1]<2^{\frac{-p+3}{2}}$ is true, ’$e_{i+1}<16e_r$' is less than the smallest number which is representable by floating point number. So, ‘$N_{i+1}$ is approximate to ‘$\frac{N}{F}$'. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal tables ($T=\frac{1}{F}+e_t$) with varying sizes. 1'he superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a divider. Also, it can be used to construct optimized approximate reciprocal tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.413-420
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal square mot calculates it by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal square root algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the rediprocal square root of a floating point number F, the algorithm repeats the following operations: '$X_{i+1}=\frac{{X_i}(3-e_r-{FX_i}^2)}{2}$, $i\in{0,1,2,{\ldots}n-1}$' with the initial value is '$X_0=\frac{1}{\sqrt{F}}{\pm}e_0$'. The bits to the right of p fractional bits in intermediate multiplication results are truncated and this truncation error is less than '$e_r=2^{-p}$'. The value of p is 28 for the single precision floating point, and 58 for the double precision floating point. Let '$X_i=\frac{1}{\sqrt{F}}{\pm}e_i$, there is '$X_{i+1}=\frac{1}{\sqrt{F}}-e_{i+1}$, where '$e_{i+1}{<}\frac{3{\sqrt{F}}{{e_i}^2}}{2}{\mp}\frac{{Fe_i}^3}{2}+2e_r$'. If '$|\frac{\sqrt{3-e_r-{FX_i}^2}}{2}-1|<2^{\frac{\sqrt{-p}{2}}}$' is true, '$e_{i+1}<8e_r$' is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to '$\frac{1}{\sqrt{F}}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications Per an operation is derived from many reciprocal square root tables ($X_0=\frac{1}{\sqrt{F}}{\pm}e_0$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.95-102
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal which is widely used for a floating point division, calculates the reciprocal by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the reciprocal of a floating point number F, the algorithm repeats the following operations: '$'X_{i+1}=X=X_i*(2-e_r-F*X_i),\;i\in\{0,\;1,\;2,...n-1\}'$ with the initial value $'X_0=\frac{1}{F}{\pm}e_0'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 27 for the single precision floating point, and 57 for the double precision floating point. Let $'X_i=\frac{1}{F}+e_i{'}$, these is $'X_{i+1}=\frac{1}{F}-e_{i+1},\;where\;{'}e_{i+1}, is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to $'\frac{1}{F}{'}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal tables $(X_0=\frac{1}{F}{\pm}e_0)$ with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal unit. Also, it can be used to construct optimized approximate reciprocal tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia scientific computing, etc.

• Journal of Korean Society of Steel Construction
• /
• v.20 no.5
• /
• pp.633-644
• /
• 2008

The structural framework design uses high-strength bolts and welding in column splices. However, for the column under high compression, the number of the required high-strength bolts can be excessive and the increase of welding results in difficulty of quality inspection, the transformation of the structural steels, and the increase of erection time. According to the AISC criteria, when columns have bearing plates, or they are finished to bear at splices, there shall be sufficient connections to hold all parts securely in place. The Korean standard sets the maximum 25% of the load as criteria. Using direct contact makes it possible to transfer all compressive force through it. The objective of this study is to examine the generally applied stress path mechanism of welded or bolted columns and to verify the bending moment and compression transfer mechanism of the column splice according to metal touch precision. For this study,22 specimens of various geometric shapes were constructed according to the change in the variables for each column splice type, which includes the splice method, gap width, gap axis, presence or absence of splice material, and connector type. The results show that the application of each splice can be improved through the examination of the stress path mechanism upon metal contact. Moreover, the revision of the relative local code on direct contact needs to be reviewed properly for the economics and efficiency of the splices.

• Composites Research
• /
• v.24 no.4
• /
• pp.23-28
• /
• 2011

Recently CFRP laminate joints process by bolts and nets are developed rapidly in aircraft industries. However, there are serious drawback during jointing process. Many hole processes are needed for the manufacturing and structural applications using composite materials. Generally, very durable polycrystalline crystalline diamond (PCD) drill has been used for the CFRP hole process. However, due to the expensive price and slow process speed, chemical vapor deposition (CVD) diamond drill has been used increasingly which are relatively-low durability but easily-adjustable process speed via drill shape change and price is much lower. In this study, the comparison of hole process between PCD and CVD diamond coated drills was done. First of all, CFRP hole processbility was evaluated using the equations of hole processing conditions (feed amount per blade, feed speed). The comparison on thermal damage occurring from the CFRP specimen was also studied during drilling process. Empirical equation was made from the temperature photo profile being taken during hole process by infrared thermal camera. In addition, hole processability was compared by checking hole inside condition upon chip exhausting state for two drills. Generally, although the PCD can exhibit better hole processability, hole processing speed of CVD diamond drill exhibited faster than PCD case.