• 한국정보디스플레이학회:학술대회논문집
• /
• 2006.08a
• /
• pp.27-32
• /
• 2006

The present status and prospects for further development of thin-film electroluminescent (TFEL) devices using oxide phosphors are described. High-luminance oxide TFEL devices have been recently developed using a new combinatorial deposition technique featuring rf magnetron sputtering with a subdivided powder target. In addition, new flexible oxide TFEL devices have been fabricated on an oxide ceramic sheet and operated stably in air above $200^{\circ}C$.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.69.2-69
• /
• 2002

Process measurements contain random and gross errors and the size estimation of gross errors is required for production accounting. Mixed integer programming technique had been applied to identify and estimate the gross errors simultaneously. However, the compensate model based on mixed integer programming used all measured variables or spanning tree as gross error candidates. This makes gross error estimation problem combinatorial or computationally expensive. Mixed integer programming with test statistics is proposed for computationally inexpensive gross error identification /estimation. The gross error candidates are identified by measurement test and the set of gross error candidates are...

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1-8
• /
• 2006

This paper considers an interesting transportation problem where trailers and tractors are involved in moving material. We identified a class of combinatorial optimization problems for minimizing the number of tractors and trailers required to accommodate the transportation needs. Then, we show that the fundamental problem is NP-hard and analyze its properties to develop efficient heuristic to handle the problem effectively.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.629-632
• /
• 1986

Both combinatorial and parametric optimization are used in computer-aided design(CAD). The most commonly occuring parametric optimization problems in engineering design such as design of control systems, design of electric circuits are usually expressed either as differentiable or as nondifferentiable semi-infinite programming(SIP) problems. In this paper we express algorithms for a class of computer-aided design problems arising in control systems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.59
• /
• pp.37-42
• /
• 2000

The parallel machines scheduling problems is one of the combinatorial optimization problems that often occurs in the real world. This problem is classified into two cases, one of which is the case which processing time are identical and the other, nonidentical. Not so much researches have been made on the case that nonidentical parallel machines scheduling problem. This study proposes Tabu Search methods for solving parallel machines scheduling problems related to due dates: minimizing mean tardiness, minimizing the number of tardy jobs, minimizing the maximum tardiness.

• Journal of the Korean Statistical Society
• /
• v.33 no.1
• /
• pp.35-58
• /
• 2004

For fixed positive integers and $\textit{k}\;(n\;{\geq}\;{\textit{k}}\;+\;2)$, the exact probability distributions of non-overlapping and overlapping patterns of two failures separated by (i) exactly $textsc{k}$ successes, (ii) at least $\textit{k}$ successes and (iii) at most $\textit{k}$ successes have been obtained for Bernoulli independent and Markov dependent trials by using combinatorial technique. The waiting time distributions for the first occurrence and the $r^{th}$ (r > 1) occurrence of the patterns have also been obtained.

• Journal of applied mathematics & informatics
• /
• v.36 no.5_6
• /
• pp.475-489
• /
• 2018

In this paper, by using the polylogarithm function, we introduce a generalized poly-Bernoulli numbers and polynomials with variable a. We find several combinatorial identities and properties of the polynomials. We give some properties that is connected with the Stirling numbers of second kind. Symmetric properties can be proved by new configured special functions. We display the zeros of the generalized poly-Bernoulli polynomials with variable a and investigate their structure.

• Journal of the Korean Mathematical Society
• /
• v.45 no.2
• /
• pp.479-491
• /
• 2008

In [4], the authors studied the Pascal matrix and the Stirling matrices of the first kind and the second kind via the Fibonacci matrix. In this paper, we consider generalizations of Pascal matrix, Fibonacci matrix and Pell matrix. And, by using Riordan method, we have factorizations of them. We, also, consider some combinatorial identities.

• Journal of applied mathematics & informatics
• /
• v.3 no.1
• /
• pp.65-78
• /
• 1996

The properties of a toric variety have strong connection with the combinatorial structure of the corresponding fan and the rela-tions among the generators. Using this fact we have described explic-itly the Chow ring for a Q-factorial toric variety as the Stanley-Reisner ring for the corresponding fan modulo the linear equivalence relation. In this paper we calculate the Chow ring for 3-dimensional Q-factorial toric varieties having one bad isolated singularity.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.105-113
• /
• 2004

An open problem proposed by Safavi-Naini and Seberry in IEEE transactions on information theory(1991) can be reduced to a combinatorial problem on partitioning a subset of binary matrices. We solve the generalized Naini-Seberry's open problem by considering a certain class of binary matrices. Thus a subliminal channel of r 〉 1 bit capacity is systematically established for Naini-Seberry's authentication schemes. We also construct concrete examples.