• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.15-15
• /
• 2003

We provide some recent results of approximation algorithms for solving Markov Games and discuss their applications to problems that arise in Computer Science. We consider a receding horizon approach as an approximate solution to two-person zero-sum Markov games with an infinite horizon discounted cost criterion. We present error bounds from the optimal equilibrium value of the game when both players take “correlated” receding horizon policies that are based on exact or approximate solutions of receding finite horizon subgames. Motivated by the worst-case optimal control of queueing systems by Altman, we then analyze error bounds when the minimizer plays the (approximate) receding horizon control and the maximizer plays the worst case policy. We give two heuristic examples of the approximate receding horizon control. We extend “parallel rollout” and “hindsight optimization” into the Markov game setting within the framework of the approximate receding horizon approach and analyze their performances. From the parallel rollout approach, the minimizing player seeks to combine dynamically multiple heuristic policies in a set to improve the performances of all of the heuristic policies simultaneously under the guess that the maximizing player has chosen a fixed worst-case policy. Given $\varepsilon$>0, we give the value of the receding horizon which guarantees that the parallel rollout policy with the horizon played by the minimizer “dominates” any heuristic policy in the set by $\varepsilon$, From the hindsight optimization approach, the minimizing player makes a decision based on his expected optimal hindsight performance over a finite horizon. We finally discuss practical implementations of the receding horizon approaches via simulation and applications.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.2140_2141
• /
• 2009

We used the eddy current sensor for a 22.9kV distribution power line insulation cable diagnosis. The insulation cable which is used in the 22.9kV distribution power line is having element wire from 6 to 18. Consequently, currently to ECT applications it has a limit in the distribution power line. We about under producing to apply in pick-up coil forms and the differential total coil form where becomes sum of zero in order to have. From measurement result, partial broken cable was confirmed 500 mV~980 mV changes from normal state.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.113-143
• /
• 1997

Most of the conflict problems between 2 persons can be represented as a bi-matrix game, because player's utilities, in general, are non-zero sum and change according to the progress of game. In the bi-matrix game the equilibrium point set which satisfies the Pareto optimality can be a good bargaining or coordination solution. Under the condition of incomplete information about the risk attitudes of the players, the bargaining or coordination solution depends on additional elements, namely, the players' methods of making inferences when they reach a node in the extensive form of the game that is off the equilibrium path. So the investigation about the players' inference type and its effects on the solution is essential. In addition to that, the effect of an individual's aversion to risk on various solutions in conflict problems, as expressed in his (her) utility function, must be considered. Those kinds of incomplete information make decision maker Bayesian, since it is often impossible to get correct information for building a decision making model. In Baysian point of view, this paper represents an analytic frame for guessing and learning opponent's attitude to risk for getting better reward. As an example for that analytic frame. 2 persons'bi-matrix game is considered. This example explains that a bi-matrix game can be transformed into a kind of matrix game through the players' implicitly cooperative attitude and the need of arbitration.

• World Technopolis Review
• /
• v.1 no.1
• /
• pp.6-15
• /
• 2012

Science and technology parks have been popular among policy-makers at several spatial levels to promote innovation and economic growth of certain localities. However, this mainly property-led policy tool has been criticised for two reasons. First, it often failed to successfully support regional networking and technology transfer to regional firms. Only unplanned science and technology parks, such as Silicon Valley, seem to have been successfully fostering regional networking and technology transfer which has led, in turn, to the development of competitive innovative clusters. Secondly, it has too often bet on the same horses and become too specialised in the same fields, such as in micro-electronics or in biotechnology. This specialisation has been theoretically supported by the cluster concept. It has led to both a zero sum game of competition between locations as well as potentially negative path dependence and lock-ins. This paper suggests increasingly supporting diversification in science and technology parks by bringing together hitherto unconnected technologies. Several recently discussed concepts could be used to support diversification, such as related variety (Frenken et al. 2007), regional branching (Boschma and Frenken 2011), regional innovation platforms (Harmaakorpi et al. 2011) and transversality (Cooke 2011).

• Communications of the Korean Mathematical Society
• /
• v.9 no.4
• /
• pp.881-889
• /
• 1994

Let ($X, \Beta, \mu$) be a measure space with the $\sigma$-algebra $\Beta$ and the probability measure $\mu$. Throughouth this article set equalities and inclusions are understood as being so modulo measure zero sets. A transformation T defined on a probability space X is said to be measure preserving if $\mu(T^{-1}E) = \mu(E)$ for $E \in B$. It is said to be ergodic if $\mu(E) = 0$ or i whenever $T^{-1}E = E$ for $E \in B$. Consider the sequence ${x, Tx, T^2x,...}$ for $x \in X$. One may ask the following questions: What is the relative frequency of the points $T^nx$ which visit the set E\ulcorner Birkhoff Ergodic Theorem states that for an ergodic transformation T the time average $lim_{n \to \infty}(1/N)\sum^{N-1}_{n=0}{f(T^nx)}$ equals for almost every x the space average $(1/\mu(X)) \int_X f(x)d\mu(x)$. In the special case when f is the characteristic function $\chi E$ of a set E and T is ergodic we have the following formula for the frequency of visits of T-iterates to E : $$ lim_{N \to \infty} \frac{$\mid${n : T^n x \in E, 0 \leq n $\mid$}{N} = \mu(E) $$ for almost all $x \in X$ where $$\mid$\cdot$\mid$$ denotes cardinality of a set. For the details, see [8], [10].

• 한국연소학회:학술대회논문집
• /
• 2000.05a
• /
• pp.122-132
• /
• 2000

Computational fluid dynamic simulation is performed for the floating turbulent premixed flames stabilized in stagnation flows of Cho et al. [1] and Cheng and Shepherd [2]. They are both in the wrinkled flamelet regime far from the extinction limit with $u'/S^{0}_{L}$ less than unity. The turbulent flux is given in the first moment closure as a sum of the classical gradient flux due to turbulent motions and the countergradient flux due to thermal expansion. The parameter $N_{B}'s$ are greater than unity with the countergradient flux dominant over the gradient flux. The countergradient flux is assumed to be zero in $\bar{c}<0.05$. The flame surface density is modeled as a symmetric parabolic function with respect to $\bar{c}$. The product of the maximum flame surface density and the mean stretch factor is considered as a tuning constant to match the flame location. Good agreement is achieved with the measured $\tilde{w}$ and $\bar{c}$ profiles along the axis in both flames.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.173-179
• /
• 1999

In reverse engineering, when a shape containing multi-patched surfaces is digitized, the boundaries of these surfaces should be detected. The objective of this paper is to introduce a computationally efficient segmentation technique for extracting edges, ad partitioning the 3D measuring point data based on the location of the boundaries. The procedure begins with the identification of the edge points. An automatic edge-based approach is developed on the basis of local geometry. A parametric quadric surface approximation method is used to estimate the local surface curvature properties. the least-square approximation scheme minimizes the sum of the squares of the actual euclidean distance between the neighborhood data points and the parametric quadric surface. The surface curvatures and the principal directions are computed from the locally approximated surfaces. Edge points are identified as the curvature extremes, and zero-crossing, which are found from the estimated surface curvatures. After edge points are identified, edge-neighborhood chain-coding algorithm is used for forming boundary curves. The original point set is then broke down into subsets, which meet along the boundaries, by scan line algorithm. All point data are applied to each boundary loops to partition the points to different regions. Experimental results are presented to verify the developed method.

• Journal of the Korean Institute of Telematics and Electronics D
• /
• v.36D no.4
• /
• pp.18-24
• /
• 1999

The design method of a wave absorber for a perfectly conducting sphere is presented. The backscattered field from a coated sphere can be represented as the sum of the reflected field and the creeping wave. The wave absorber for a curved surface has been designed from that the reflection coefficient of the reflected field is zero. For the design of wave absorber for a small sized conducting sphere, the creeping wave should be considered as well as the reflected field. The perfect absorbing conditions are numerically searched using the Newton-Raphson method from the backscattered field of the eigenfunction series solution from a coated sphere. The wave absorber designed by this method exhibits a superior performance of absorption to that designed from the plate type absorbing condition.

• ETRI Journal
• /
• v.38 no.2
• /
• pp.217-226
• /
• 2016

We propose an architecture that reduces the power consumption and active area of such a modulator through a reduction in the number of active components and a simplification of the topology. The proposed architecture reduces the power consumption and active area by reducing the number of active components and simplifying the modulator topology. A novel second-order loop filter that uses a single operational amplifier resonator reduces the number of active elements and enhances the controllability of the transfer function. A trapezoidal-shape half-delayed return-to-zero feedback DAC eliminates the loop-delay compensation circuitry and improves pulse-delay sensitivity. These simple features of the modulator allow higher frequency operation and more design flexibility. Implemented in a 130 nm CMOS technology, the prototype modulator occupies an active area of $0.098mm^2$ and consumes 5.23 mW power from a 1.2 V supply. It achieves a dynamic range of 62 dB and a peak SNDR of 60.95 dB over a 15 MHz signal bandwidth with a sampling frequency of 780 MHz. The figure-of-merit of the modulator is 191 fJ/conversion-step.

• Journal of the Korean Ceramic Society
• /
• v.35 no.2
• /
• pp.123-128
• /
• 1998

Multilayer ceramic capacitors(MLCC) were prepared by laminating the layer of composition with dif-ferent Curie temperature to improve temperature coefficient in the Pb(Mg1/3Nb2/3)O3-PbTiO3 binary system. Green sheet was formed by tape casting using Pb(Mg1/3Nb2/3)O3-PbTiO3 and PbTiO3 synthesized with solid state reaction of PBO. Nb2O5 MgO and TiO2. Green sheet with electrode of 70Ag-30Pd was laminated under 300 kg/cm2 at 70$^{\circ}C$ and sintered at 1100$^{\circ}C$ for 2hr. Curie temperatues for MLCC with 10 layers of pure PMN and 0.9PMN-0.1PT were lowered to -22$^{\circ}C$ and 36$^{\circ}C$ respectively. MLCC with 7 layers of PMN and 3 layers of 0.9PMN-0.1PT showed nearly zero temperature coefficient of capacitance in the range of -20∼30$^{\circ}C$ and sum of dissipation factor of each layer.