• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.551-554
• /
• 2002

The paper discusses new approach for machining operation simulation using enhanced Z map algorithm. To extract the required geometric information from NC code, suggested algorithm uses supersampling method to enhance the efficiency of a simulation process. By executing redundant Boolean operations in a grid cell and averaging down calculated data, presented algorithm can accurately represent material removal volume though tool swept volume is negligibly small. Supersampling method is the most common form of antialiasing and usually used with polygon mesh rendering in computer graphics. The key advantage of enhanced Z map model is that the data structure is same with conventional Z map model, though it can acquire higher accuracy and reliability with same or lower computation time. By simulating machining operation efficiently, this system can be used to improve the reliability and efficiency of NC machining process as well as the quality of the final product.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.4
• /
• pp.194-200
• /
• 2012

In this paper we analyze the code sequence generating algorism defined on $GF(2^n)$ proposed by S.Bostas and V.Kumar[7] and derive the implementation functions of code sequence generator using Boolean functions which can map the vector space $F_2^n$ of all binary vectors of length n, to the finite field with two elements $F_2$. We find the code sequence generating boolean functions based on two kinds of the primitive polynomials of degree, n=5 and n=7 from trace function. We then design and implement the code sequence generators using these functions, and produce two code sequence groups. The two groups have the period 31 and 127 and the magnitudes of out of phase(${\tau}{\neq}0$) autocorrelation and crosscorrelation functions {-9, -1, 7} and {-17, -1, 15}, satisfying the period $L=2^n-1$ and the correlation functions $R_{ij}({\tau})=\{-2^{(n+1)/2}-1,-1,2^{(n+l)/2}-1\}$ respectively. Through these results, we confirm that the code sequence generators using boolean functions are designed and implemented correctly.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.547-552
• /
• 2003

In mold machining, there are many concave machining regions where chatter and tool deflection occur since MRR (material removal rate) increases as curvature increases even though cutting speed and depth of cut are constant. Boolean operation between stock and tool model is widely used to compute MRR in NC milling simulation. In finish cutting, the side step is reduced to about 0.3mm and tool path length is sometimes over 300m. so Boolean operation takes long computation time and includes much error if the resolution of stock and tool model is larger than the side step. In this paper, curvature of CL(cutter location) surface and side step of tool path is used to compute the feedrate for constant MRR machining. The data structure of CL surface is Z-map generated from NC tool path. The algorithm to get local curvature from discrete data was developed and applied to compute local curvature of CL surface. The side step of tool path was computed by point density map which includes cutter location point density at each grid element. The feedrate computed from curvature and side step is inserted to new tool path to regulate MRR. The resultants wire applied to feedrate optimization system which generates new tool path with feedrate from NC codes for finish cutting. The system was applied to speaker mold machining. The finishing time was reduced to 12.6%. tool wear was reduced from 2mm to 1.1mm and chatter marks and over cut on corner were removed.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.11
• /
• pp.1017-1026
• /
• 2015

Infrared (IR) target detection is one of the key technologies in Automatic Target Detection/Recognition (ATD/R) for military applications. However, IR sensors have limitations due to the weather sensitivity and atmospheric effects. In recent years, sensor information fusion study is an active research topic to overcome these limitations. SAR sensor is adopted to sensor fusion, because SAR is robust to various weather conditions. In this paper, a Boolean Map Visual Theory-Morphology (BMVT-M) method is proposed to detect targets in SAR and IR images. Moreover, we suggest the IR and SAR image registration and decision level fusion algorithm. The experimental results using OKTAL-SE synthetic images validate the feasibility of sensor fusion-based target detection.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.616-619
• /
• 2002

The z-map structure is widely used for NC tool path verification as it is very simple and fast in calculation of Boolean operations. However, if the number of the x-y grid points in a z-map is increased to enhance its accuracy, the computation time for NC verification increases rapidly. To reduce this computation time, we proposed a NC verification method using 3-D graphic acceleration hardwares. In this method, the z-map of the resultant workpiece machined by a NC program is obtained by rendering tool swept volumes along tool pathos and reading the depth buffer of the graphic card. The experimental results show that this hardware-based method is faster than the conventional software-based method.

• Korean Journal of Mathematics
• /
• v.22 no.1
• /
• pp.37-43
• /
• 2014

In this paper, we show that for any ${\sigma}$-complete Boolean subalgebra $\mathcal{M}$ of $\mathcal{R}(X)$ containing $Z(X)^{\sharp}$, the Stone-space $S(\mathcal{M})$ of $\mathcal{M}$ is a basically diconnected cover of ${\beta}X$ and that the subspace {${\alpha}{\mid}{\alpha}$ is a fixed $\mathcal{M}$-ultrafilter} of the Stone-space $S(\mathcal{M})$ is the the minimal basically disconnected cover of X if and only if it is a basically disconnected space and $\mathcal{M}{\subseteq}\{\Lambda_X(A){\mid}A{\in}Z({\Lambda}X)^{\sharp}\}$.

• Korean Journal of Mathematics
• /
• v.20 no.4
• /
• pp.517-524
• /
• 2012

In this paper, we first show that for any space X, there is a Boolean subalgebra $\mathcal{G}(z_X)$ of R(X) containg $\mathcal{G}(X)$. Let X be a strongly zero-dimensional space such that $z_{\beta}^{-1}(X)$ is the minimal cloz-coevr of X, where ($E_{cc}({\beta}X)$, $z_{\beta}$) is the minimal cloz-cover of ${\beta}X$. We show that the minimal cloz-cover $E_{cc}(X)$ of X is a subspace of the Stone space $S(\mathcal{G}(z_X))$ of $\mathcal{G}(z_X)$ and that $E_{cc}(X)$ is a strongly zero-dimensional space if and only if ${\beta}E_{cc}(X)$ and $S(\mathcal{G}(z_X))$ are homeomorphic. Using these, we show that $E_{cc}(X)$ is a strongly zero-dimensional space and $\mathcal{G}(z_X)=\mathcal{G}(X)$ if and only if ${\beta}E_{cc}(X)=E_{cc}({\beta}X)$.

• The Pure and Applied Mathematics
• /
• v.21 no.2
• /
• pp.113-120
• /
• 2014

In this paper, we first show that for any space X, there is a ${\sigma}$-complete Boolean subalgebra of $\mathcal{R}$(X) and that the subspace {${\alpha}{\mid}{\alpha}$ is a fixed ${\sigma}Z(X)^{\sharp}$-ultrafilter} of the Stone-space $S(Z({\Lambda}_X)^{\sharp})$ is the minimal basically disconnected cover of X. Using this, we will show that for any countably locally weakly Lindel$\ddot{o}$f space X, the set {$M{\mid}M$ is a ${\sigma}$-complete Boolean subalgebra of $\mathcal{R}$(X) containing $Z(X)^{\sharp}$ and $s_M^{-1}(X)$ is basically disconnected}, when partially ordered by inclusion, becomes a complete lattice.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.1
• /
• pp.25-35
• /
• 2013

Automatically deriving only individual don't-care minterms that can effectively reduce a Boolean logic expressions are being investigated. Don't-care conditions play an important role in optimizing logic design. The type of unknown don't-care minterms that can always reduce the number of product terms in Boolean expression are referred as single hypothetical don't-care (S-HDC) minterms. This paper describes the Quasi Quine-McCluskey method that systematically derives S-HDC minterms. For the most part, this method is similar to the original Quine-McCluskey method in deriving the prime implicants. However, the Quasi Quine-McCluskey method further derives S-HDC minterms by applying so-called a combinatorial comparison operation. Upon completion of the procedure, the designer can review generated S-HDC minterms to test its appropriateness for a particular application.

• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.53-57
• /
• 2008

The discretized saw-tooth map with the 16-bit finite precision which is one of the 1-dimensional chaotic maps is designed, and the circuit of chaotic binary sequence generator using the discretized saw-tooth map is presented also in this brief. The real implementation of designed chaotic map is accomplished by connecting the input and output lines exactly according to the simplified Boolean functions of output variables obtained from truth table which is discretized. The random binary output sequences generated by mLFSR generator were used for the inputs of descretized saw-tooth map, and, by the descretized map, chaotic binary sequence which has more long period of 16 times minimally is generated as a results.