• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.53 no.4
• /
• pp.210-215
• /
• 2004

This paper proposes an implicit method for computing the minimum cost feedback vertex set for a graph. For an arbitrary graph, a Boolean function is derived, whose satisfying assignments directly correspond to feedback vertex sets of the graph. Importantly, cycles in the graph are never explicitly enumerated, but rather, are captured implicitly in this Boolean function. This function is then used to determine the minimum cost feedback vertex set. Even though computing the minimum cost satisfying assignment for a Boolean function remains an NP-hard problem, it is possible to exploit the advances made in the area of Boolean function representation in logic synthesis to tackle this problem efficiently in practice for even reasonably large sized graphs. The algorithm has obvious application in flip-flop selection for partial scan. The algorithm proposed in this paper is the first to obtain the MFVS solutions for many benchmark circuits.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.6
• /
• pp.1951-1967
• /
• 2017

We aim to introduce a further extension of a family of the extended Hurwitz-Lerch Zeta functions of two variables. We then systematically investigate several interesting properties of the extended function such as its integral representations which provide extensions of various earlier corresponding results of two and one variables, its summation formula, its Mellin-Barnes type contour integral representations, its computational representation and fractional derivative formulas. A multi-parameter extension of the extended Hurwitz-Lerch Zeta function of two variables is also introduced. Relevant connections of certain special cases of the main results presented here with some known identities are pointed out.

• Communications for Statistical Applications and Methods
• /
• v.19 no.6
• /
• pp.885-898
• /
• 2012

In this paper, we consider Bayesian approaches to partially linear models, in which a regression function is represented by a semiparametric additive form of a parametric linear regression function and a nonparametric regression function. We make a comparative study on the performance of widely used Bayesian partially linear models in terms of empirical analysis. Specifically, we deal with three Bayesian methods to estimate the nonparametric regression function, one method using Fourier series representation, the other method based on Gaussian process regression approach, and the third method based on the smoothness of the function and differencing. We compare the numerical performance of three methods by the root mean squared error(RMSE). For empirical analysis, we consider synthetic data with simulation studies and real data application by fitting each of them with three Bayesian methods and comparing the RMSEs.

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.226-229
• /
• 1987

This paper was aimed to, using a new data structure, develop a set of algorithms to execute the output function of Digital System. These functions were represented as directed, acyclic graphs. by applying many restrictions on vertices on graph, the efficient manipulation of boolean function was accomplished. The results were as follows; 1. A canonical representation of a boolean function was created by the reduction algorithm. 2. The operation of two functions was accomplished using t he apply algorithm, according to the binary operator. 3. The arguments having 1 as the value nf function were enumerated using the satisfy algorithm. 4. Composing TTL 74181 4-bit ALU and 74182 look-ahead carry generator, the ALU having 4-bit and 16-bit as word size was implemented.

• Communications of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.549-560
• /
• 2018

Since Mittag-Leffler introduced the so-called Mittag-Leffler function in 1903, due to its usefulness and diverse applications, a variety and large number of its extensions (and generalizations) and variants have been presented and investigated. In this sequel, we aim to introduce a new extension of the Mittag-Leffler function by using a known extended beta function. Then we investigate ceratin useful properties and formulas associated with the extended Mittag-Leffler function such as integral representation, Mellin transform, recurrence relation, and derivative formulas. We also introduce an extended Riemann-Liouville fractional derivative to present a fractional derivative formula for a known extended Mittag-Leffler function, the result of which is expressed in terms of the new extended Mittag-Leffler functions.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.407-410
• /
• 1998

Configuration is a set of building block processes, a series of selection and combining parts or components which composes a whole thing. A whole thing could be such a configurable object as manufacturing product, network system, financial portfolio, system development plan, project team, etc. Configuration problem could happen during any phase of product life cycle: design, production, sales, installation, and maintenance. Configuration has long been one of cost and time consuming work, because only high salaried technical experts on product and components can do configuration. Rework for error adjustments of configurations at later process causes far much cost and time, so accurate configuration is required. Under the on-line electronic commerce environment, configuration problem solving becomes more important, because component-based sales should be done automatically on the merchant web site. Automated product search, order placement, order fulfillment and payment make that manual configuration is no longer feasible. Automated configuration means that all the constraints among components should be checked and confirmed by configuration engine automatically. In addition, technical constraints and customer preferences like price range and a specific function required should be considered. This paper gives an brief overview of configuration problems: characteristics, representation paradigms, and solving algorithms and introduce CRSP(Constraint and Rule Satisfaction Problem) method. CRSP method adopts both constraint and rule for configuration domain knowledge representation. A survey and analysis on web sites adopting configuration functions are provided. Future directions of configuration for EC is discussed in the three aspects: methodology itself, companies adopting configuration function, and electronic commerce industry.

• Bulletin of the Korean Mathematical Society
• /
• v.29 no.2
• /
• pp.265-275
• /
• 1992

The characteristic free representation theory of the general linear group has found a wide range of applications, ranging from the theory of free resolutions to the symmetric function theory. Representation theory is used to facilitate the calculation of explicit free resolutions of large classes of ideals (and modules). Recently, K. Akin and D. A. Buchsbaum [2] realized the Jacobi-Trudi identity for a Schur function as a resolution of GL$_{n}$-modules. Over a field of characteristic zero, it was observed by A. Lascoux [6]. T.Jozefiak and J.Weyman [5] used the Koszul complex to realize a formula of D.E. Littlewood as a resolution of schur modules. This leads us to further study resolutions of Schur modules of a particular form. In this article we will describe some new classes of finite free resolutions associated to the Pieri type skew Young diagrams. As a special case of these finite free resolutions we obtain the generalized Koszul complex constructed in [1]. In section 2 we review some of the basic difinitions and properties of Schur modules that we shall use. In section 3 we describe certain exact complexes associated to the Pieri type skew partitions. Throughout this article, unless otherwise specified, R is a commutative ring with an identity element and a mudule F is a finitely generated free R-module.e.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.10 no.1
• /
• pp.99-108
• /
• 1990

A Synthetic Unit Hydrograph Method was investigated for representation of the effective rainfall-direct runoff hydrograph by using a Geomorphologic Instantaneous Unit Hydrograpb(GIUH) proposed by Gupta et al(1980). The response function of the basin was assumed to be the two-parameter gamma probability density function. The physical parameters of the response function(Nash Model) was determined by using the regression eqs. were parameterized in terms of Horton order ratios and the relations between the basin lag time and time-scale parameter. The capability of the Synthetic Unit Hydrograph to the real basin was tested for the Pyungchang river basin and Wi Stream basin, and its capability to reproduce the hydrologic response was investigate and compared with the Moment Method and the Least Square Method used incomplete gamma function. The representation of the peak flow, the time to peak and the hydrographs the derived Synthetic Unit Hydrograph were tested on some obseved flood data and showed promising, and it was approved to be used for prediction of the ungaged basins.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.4 no.4
• /
• pp.368-376
• /
• 1999

This paper studies the operational characteristics of thyristor controlled shunt compensator in a simple power t transmission system. With Fourier series representation of the thyristor switching action and the system parameters, t the thyristor current equations are derived, which transmit the required real power of the simple power transmission s system. Bisection algorithm is used to solve the thyristor current equations, which informs the thyristor firing an밍e, t the thyristor conduction an밍e, the power flows and the harmonic characteristics. The stability analysis is performed w with the theory of Poincare mapping for the nonlinear discrete periodic dynamic system. EMTP simulations at the v various operating points show the transient characteristics of the thyristor controlled shunt compensator and C correspond to the results calculated with Fourier series representation and the stability analysis.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2884-2896
• /
• 1998

For on-line signature verification, the local shape of a signature is an important information. The current approaches, in which signatures are represented into a function of time or a feature vector without regarding of local shape, have not used the various features of local shapes, for example, local variation of a signer, local complexity of signature or local difficulty of forger, and etc. In this paper, we propose a new technique for on-line signature verification based on a structural signature representation so as to analyze local shape and to make a selection of important local parts in matching process. That is. based on a structural representation of signature, a technique of important of local weighting and personalized decision threshold is newly introduced and its experimental results under different conditions are compared.