• Journal of the Korean Mathematical Society
• /
• v.47 no.2
• /
• pp.409-424
• /
• 2010

We express Gauss sums for symplectic and orthogonal groups over finite fields as averages of exponential sums over certain maximal tori. Together with our previous results, we obtain some interesting identities involving various classical Gauss and Kloosterman sums.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.3
• /
• pp.463-474
• /
• 2001

We find Rodrigues type formula for multi-variate orthogonal polynomial solutions of second order partial differential equations.

• East Asian mathematical journal
• /
• v.24 no.4
• /
• pp.389-398
• /
• 2008

In this paper, some results of [6] concerning orthogonal ($\sigma$, $\tau$)-derivations and generalized ($\sigma$, $\tau$)-derivations are generalized for a nonzero ideal of a semiprime ring.

• Communications of the Korean Mathematical Society
• /
• v.10 no.2
• /
• pp.471-482
• /
• 1995

We give a simple unified proof of various characterizations of discrete classical orthogonal polynomials including two new ones.

• Kyungpook Mathematical Journal
• /
• v.52 no.3
• /
• pp.279-290
• /
• 2012

In this paper we present some results on absolute almost generalized N$\ddot{o}$rlund summability of orthogonal series. The most important corollaries of the main results also are deduced.

• East Asian mathematical journal
• /
• v.23 no.2
• /
• pp.197-206
• /
• 2007

The purpose of this paper is to show some results of M. Bresar and J. Vukman concerning orthogonal derivations of semiprime rings in [3] for (${\sigma},\;{\tau}$)-derivations and generalized (${\sigma},\;{\tau}$)-derivations in $\Gamma$-rings.

• Bulletin of the Korean Mathematical Society
• /
• v.36 no.2
• /
• pp.363-370
• /
• 1999

A new and simple estimate using a convex function for convergence factors of Schwarz algorithms orthogonal spline collocation method is presented. The estimated convergence factors in this context depend only on a way to split a given domain.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.19 no.1
• /
• pp.42-49
• /
• 2010

In general, the direct experimental approach to study machining processes is expensive and time consuming, especially when a wide range of parameters are included: tool, geometry, materials, cutting conditions, etc. The aim of this study is to verify the effectiveness of finite element method for orthogonal cutting process by comparing the simulated cutting forces with measured results. Two commercialized finite element codes $AdvantEdge^{TM}$ and Deform-$2D^{TM}$ have been used to simulate the cutting forces in orthogonal cutting process. In this paper, estimated cutting and feed force components are compared with experimental results for different two materials. As a result, it has been found that FEM simulation is effective for understanding and predicting the orthogonal cutting process although some improvements on friction model and remeshing process are needed.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1571-1581
• /
• 2011

In this paper, we construct inequivalent Hadamard matrices based on several new and old full orthogonal designs, using circulant and symmetric block matrices. Not all orthogonal designs produce inequivalent Hadamard matrices, because the corresponding systems of equations do not possess solutions. The systems of equations arising when we search for inequivalent Hadamard matrices from full orthogonal designs using circulant and symmetric block matrices, can be concisely described using the periodic autocorrelation function of the generators of the block matrices. We use Maple, Magma, C and Unix tools to find many new inequivalent Hadamard matrices.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.858-863
• /
• 2004

In the optimized design of an actual structure, the design variable should be selected among any certain values or corresponds to a discrete design variable that needs to handle the size of a pre-formatted part. Various algorithms have been developed for discrete design. As recently reported, the sequential algorithm with orthogonal arrays(SOA), which is a local minimum search algorithm in discrete space, has excellent local minimum search ability. It reduces the number of function evaluation using orthogonal arrays. However it only finds a local minimum and the final solution depends on the initial value. In this research, the genetic algorithm, which defines an initial population with the potential solution in a global space, is adopted in SOA. The new algorithm, sequential algorithm with orthogonal arrays and genetic algorithm(SOAGA), can find a global solution with the properties of genetic algorithm and the solution is found rapidly with the characteristics of SOA.