• Journal of the military operations research society of Korea
• /
• v.17 no.1
• /
• pp.146-158
• /
• 1991

In this paper, we deal with the TSP (Traveling Salesperson Problem) which is well-known as NP-complete optimization problem. the TSP is applicable to network routing. task allocation or scheduling. and VLSI wiring. Well known numerical methods such as Newton's Metheod. Gradient Method, Simplex Method can not be applicable to find Global Solution but the just give Local Minimum. Exhaustive search over all cyclic paths requires 1/2 (n-1) ! paths, so there is no computer to solve more than 15-cities. Heuristic algorithm. Simulated Annealing, Artificial Neural Net method can be used to get reasonable near-optimum with polynomial execution time on problem size. Therefore, we are able to select the fittest one according to the environment of problem domain. Three methods are simulated about symmetric TSP with 30 and 50-city samples and are compared by means of the quality of solution and the running time.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.231-243
• /
• 2007

The existence of solutions of a class of two-point boundary value problems for higher order differential equations is studied. Sufficient conditions for the existence of at least one solution are established. It is of interest that the nonlinearity f in the equation depends on all lower derivatives, and the growth conditions imposed on f are allowed to be super-linear (the degrees of phases variables are allowed to be greater than 1 if it is a polynomial). The results are different from known ones since we don't apply the Green's functions of the corresponding problem and the method to obtain a priori bound of solutions are different enough from known ones. Examples that can not be solved by known results are given to illustrate our theorems.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.282-284
• /
• 1988

In this paper, a method for constructing parallel-in, parallel-out multipliers in GF($2^{m}$) is presented. The proposed system is composed of two operational parts by using shift register. One is a multiplicative arithmetical operation part capable of the multiplicative arithmetic and modulo 2 operation to all product terms with the same degree. And the other is an irreducible polynomial operation part to outputs from the multiplicative arithmetical operation part. Since the total hardware is linearly m dependant to an GF($2^{m}$), this system has a reasonable merit when m increases. And also this system is suited for VLSI implementation due to simple, regular, and concurrent properties.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.318-321
• /
• 2000

This paper propose the method of constructing the highly efficiency adder and multiplier systems over finite fie2, degree of uk terms, therefore we decrease k into m-1 degree using irreducible primitive polynomial. We propose two method of control signal generation for perform above decrease process. One method is the combinational logic expression and the other method is universal signal generation. The proposed method of constructing the highly adder/multiplier systems is as following. First of all, we obtain algorithms for addition and multiplication arithmetic operation based on the mathematical properties over finite fields, next we construct basic cell of A-cell and M-cell using T-gate and modP cyclic gate. Finally we construct adder module and multiplier module over finite fields after synthesize ${\alpha}$$\^$k/ generation module and control signal CSt generation module with A-cell and M-cell. Then, we propose the future research and prospects.

• Archives of Pharmacal Research
• /
• v.19 no.3
• /
• pp.183-190
• /
• 1996

There are a wide variety of semi-solid ointments used for healing the skin diseases, whose therapeutic and skin penetration abililties may greatly differ from one another depending on the compositions of ointment vehicles. A computer optimization technique was applied to obtain the optimum formula of o/w type ointment giving the in vitro maximum absorption rate through hairless rat skin membrane. Some of the formulations were selected to find out a relationship between skin penetration of ointment and its Theological characteristics. The experimental value of absorption rate obtained from the ointment by optimum formula agreed well with the theoretical value obtained from a polynomial regression analysis, Three kinds of ointments selected among 15 formulations were obtained with a concentric cylinder type rheometer (Model; Rheolab SM-HM Physica, Germany) at 20, 30, 40 and $50^{\circ}C$ for rheograms of rhelolgical properties of o/w type ointments. As the temperature was raised, all products showed a decrease in both shear stress and yield values. The higher skin penetration, the lower shear stress showed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.275-277
• /
• 2003

본 논문에서는 GF(2$^{m}$ )상에서 비트 직렬 Linear Feedback Shift Register (LFSR) 구조와 비트 병렬 셀룰라 오토마타(Cellular Automata, CA)구조를 혼합한 새로운 하이브리드(Hybrid) 형식의 A$B^2$곱셈기를 제안한다. 본 논문에서 제안한 곱셈기는 제곱연산을 위해 구조적으로 가장 간단한 비트 직렬 구조를 이용하고, 곱셈연산을 위해 시간 지연이 적은 비트 병렬 구조를 이용한다. 제안된 구조는 LFSR의 구조적인 특징과 Periodic Boundary CA (PBCA)의 특성, 그리고 All One Polynomial (AOP)의 특성을 조화시킴으로써 기존의 구조에 비하여 정규성을 높이고 지연 시간을 줄일 수 있는 구조이다. 제안된 곱셈기는 공개키 암호화의 핵심이 되는 지수기의 구현을 위한 효율적인 기본구조로 사용될 것으로 기대된다.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.977-986
• /
• 2015

Let G be a graph on the vertex set $V(G)=\{x_1,{\cdots},x_n\}$ with the edge set E(G), and let $R=K[x_1,{\cdots},x_n]$ be the polynomial ring over a field K. Two monomial ideals are associated to G, the edge ideal I(G) generated by all monomials $x_i,x_j$ with $\{x_i,x_j\}{\in}E(G)$, and the vertex cover ideal $I_G$ generated by monomials ${\prod}_{x_i{\in}C}{^{x_i}}$ for all minimal vertex covers C of G. A minimal vertex cover of G is a subset $C{\subset}V(G)$ such that each edge has at least one vertex in C and no proper subset of C has the same property. Indeed, the vertex cover ideal of G is the Alexander dual of the edge ideal of G. In this paper, for an unmixed bipartite graph G we consider the lattice of vertex covers $L_G$ and we explicitly describe the minimal free resolution of the ideal associated to $L_G$ which is exactly the vertex cover ideal of G. Then we compute depth, projective dimension, regularity and extremal Betti numbers of R/I(G) in terms of the associated lattice.

• Bulletin of the Korean Mathematical Society
• /
• v.31 no.2
• /
• pp.237-242
• /
• 1994

One of the most well-known geometric lattices is a partition lattice. Every upper interval of a partition lattice is a partition lattice. The whitney numbers of a partition lattices are the Stirling numbers, and the characteristic polynomial is a falling factorial. The set of partitions with a single non-trivial block containing a fixed element is a Boolean sublattice of modular elements, so the partition lattice is supersolvable in the sense of Stanley [6]. In this paper, we rephrase four results due to Heller[1] and Murty [4] in terms of matroids and give several characterizations of partition lattices. Our notation and terminology follow those in [8,9]. To clarify our terminology, let G, be a finte geometric lattice. If S is the set of points (or rank-one flats) in G, the lattice structure of G induces the structure of a (combinatorial) geometry, also denoted by G, on S. The size vertical bar G vertical bar of the geometry G is the number of points in G. Let T be subset of S. The deletion of T from G is the geometry on the point set S/T obtained by restricting G to the subset S/T. The contraction G/T of G by T is the geometry induced by the geometric lattice [cl(T), over ^1] on the set S' of all flats in G covering cl(T). (Here, cl(T) is the closure of T, and over ^ 1 is the maximum of the lattice G.) Thus, by definition, the contraction of a geometry is always a geometry. A geometry which can be obtained from G by deletions and contractions is called a minor of G.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.1
• /
• pp.93-99
• /
• 2003

One of the methods to simplify the design process for a fuzzy logic controller (FLC) is to reduce the number of variables representing the rule antecedent. This in turn decreases the number of control rules, membership functions, and scaling factors. For this purpose, we designed a single-input FLC that uses a sole fuzzy input variable. However, it is still deficient in the capability of adapting some varying operating conditions although it provides a simple method for the design of FLC's. We here design two simple-structured adaptive fuzzy logic controllers (SAFLC's) using the concept of the single-input FLC. Linguistic fuzzy control rules are directly incorporated into the controller by a fuzzy basis function. Thus some parameters of the membership functions characterizing the linguistic terms of the fuzzy control rules can be adjusted by an adaptive law. In our controllers, center values of fuzzy sets are directly adjusted by an adaptive law. Two SAFLC's are designed. One of them uses a Hurwitz error dynamics and the other a switching function of the sliding mode control (SMC). We also prove that 1） their closed-loop systems are globally stable in the sense that all signals involved are bounded and 2） their tracking errors converge to zero asymptotically. We perform computer simulations using a nonlinear plant.

• Journal of the Society of Naval Architects of Korea
• /
• v.42 no.5 s.143
• /
• pp.534-541
• /
• 2005

Until now, Korean shipyards have accumulated a great amount of data. But they do not have appropriate tools to utilize the data in practical works. Engineering data contains experts' experience and know-how in its own. It is very useful to extract knowledge or information from the accumulated existing data by using data mining technique This paper treats an evolutionary computation based on genetic programming (GP), which can be one of the components to realize data mining. The paper deals with linear models of GP for the regression or approximation problem when given learning samples are not sufficient. The linear model, which is a function of unknown parameters, is built through extracting all possible base functions from the standard GP tree by utilizing the symbolic processing algorithm. In addition to a standard linear model consisting of mathematic functions, one variant form of a linear model, which can be built using low order Taylor series and can be converted into the standard form of a polynomial, is considered in this paper. The suggested model can be utilized as a designing tool to predict design parameters with small accumulated data.