• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.04a
• /
• pp.6-15
• /
• 1993

A generalization of one machine maximum lateness minimization problem is considered. There are one achine with controllable speed and n weighting jobs $J_{j}$, j=1, 2, ..., n with ambiguous duedates. Introducing fuzzy formulation, a membership function of the duedate associated with each job $J_{j}$, which describes the satisfaction level with respect to completion time of $J_{j}$. Thus the duedates are not constants as in conventional scheduling problems but decision variables reflecting the fuzzy circumstance of the job completing. We develop the polynomial time algorithm to find an optimal schedule and jobwise machine speeds, and to minimize the total sum of costs associated with jobwise machine speeds and dissatisfaction with respect to completion times of weighting jobs. jobs.

• Korean Journal of Mathematics
• /
• v.23 no.3
• /
• pp.427-438
• /
• 2015

The Schensted algorithm first described by Robinson [5] is a remarkable combinatorial correspondence associated with the theory of symmetric functions. $Sch{\ddot{u}}tzenberger's$ jeu de taquin[10] can be used to give alternative descriptions of both P- and Q-tableaux of the Schensted algorithm as well as the ordinary and dual Knuth relations. In this paper we describe the jeu de taquin on shifted rim hook tableaux using the switching rule, which shows that the sum of the weights of the shifted rim hook tableaux of a given shape and content does not depend on the order of the content if content parts are all odd.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.609-614
• /
• 1989

A collision avoidance algorithm based on a heuristic graph search and subgoals is presented. The joint angle space is quantized into cells. The evaluation function for a heuristic search is defined by the sum of the distance between the links of a manipulator and middle planes among the obstables and the distance between the end-effector and the subgoals on desired trajectory. These subgoals reduce the combinatorial explosion in the search space. This method enables us to avoid a dead-lock in searching. Its effectiveness has been verified by simulation studies.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.10 no.2
• /
• pp.193-200
• /
• 2002

Simple spring-damper-mass models have been widely used to investigate whole-body vortical biodynamic response characteristics of the seated vehicle driver. Most previous models have not considered the effect of wobbling masses; i.e. heart, lungs, liver, intestine, etc. In this study, 4 -DOF seated driver model including one non-rigid mass representing wobbling visceral mass, 5-DOF model including intestine, and 10-DOF model including five lumbar vertebral masses were proposed. The model parameters were identified by a combinatorial optimization technique. simulated annealing method. The objective function was chosen as the sum of error between model response of seat-to-head transmissibility and driving point mechanical impedance and those of experimental data for subjects seated erect without backrest support. The model response showed a good agreement with the experimental response characteristics. Using a 10-DOF model, calculated resonance frequency of lumbar spine at 4Hz was matched well with experimental results of Panjabi et al.

• International Journal of Contents
• /
• v.2 no.2
• /
• pp.17-24
• /
• 2006

The work presented in this paper is divided into two parts. The first part presents finite urn problems which generate truncated negative binomial random variables. Some combinatorial identities that arose from the negative binomial sampling and truncated negative binomial sampling are established. These identities are constructed and serve important roles when we deal with these distributions and their characteristics. Other important results including cumulants and moments of the distributions are given in somewhat simple forms. Second, the distributions of the maximum of two chi-square variables and the distributions of the maximum correlated F-variables are then derived within the negative binomial sampling scheme. Although multinomial theory applied to order statistics and standard transformation techniques can be used to derive these distributions, the negative binomial sampling approach provides more information and deeper insight regarding the nature of the relationship between the sampling vehicle and the probability distributions of these functions of chi-square variables. We also provide an algorithm to compute the percentage points of these distributions. We supplement our findings with exact simple computational methods where no interpolations are involved.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.1
• /
• pp.73-82
• /
• 2016

The utility of exponential generating functions is that they are relevant for combinatorial problems involving sets and subsets. Sequences of polynomials play a fundamental role in applied mathematics, such sequences can be described using the exponential generating functions. The actuarial polynomials ${\alpha}^{({\beta})}_n(x)$, n = 0, 1, 2, ${\cdots}$, which was suggested by Toscano, have the following exponential generating function: $${\limits\sum^{\infty}_{n=0}}{\frac{{\alpha}^{({\beta})}_n(x)}{n!}}t^n={\exp}({\beta}t+x(1-e^t))$$. A linear functional on polynomial space can be identified with a formal power series. The set of formal power series is usually given the structure of an algebra under formal addition and multiplication. This algebra structure, the additive part of which agree with the vector space structure on the space of linear functionals, which is transferred from the space of the linear functionals. The algebra so obtained is called the umbral algebra, and the umbral calculus is the study of this algebra. In this paper, we investigate some umbral representations in the actuarial polynomials.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.420-428
• /
• 2016

In this paper, we investigate the scheduling and power allocation for coordinated multi-point transmission in downlink long term evolution advanced (LTE-A) systems, where orthogonal frequency division multiple-access is used. The proposed scheme jointly optimizes user selection, power allocation, and modulation and coding scheme (MCS) selection to maximize the weighted sum throughput with fairness consideration. Considering practical constraints in LTE-A systems, the MCSs for the resource blocks assigned to the same user need to be the same. Since the optimization problem is a combinatorial and non-convex one with high complexity, a low-complexity algorithm is proposed by separating the user selection and power allocation into two subproblems. To further simplify the optimization problem for power allocation, the instantaneous signal-to-interference-plus-noise ratio (SINR) and the average SINR are adopted to allocate power in a single cell and multiple coordinated cells, respectively. Simulation results show that the proposed scheme can improve the average system throughput and the cell-edge user throughput significantly compared with the existing schemes with limited feedback.

• Journal of The Korean Association of Information Education
• /
• v.16 no.4
• /
• pp.463-474
• /
• 2012

The necessity of computer science education has been increased in the society which has been changing rapidly by the development of information science. But most elementary school teachers don't realize its necessity and don't recognize the notion of computational thinking which is the fundamental principle of computer science. In this research, we designed and implemented an algorithm learning program based on computational thinking with using Logo, which was for pre-service elementary school teachers to be able to realize the necessity of computer science education and recognize computational thinking. As the findings analyzed between pre- and post-test, the averages of correlational reasoning, combinatorial reasoning and the sum of overall logical thinking increased significantly. Also, participants' awareness of computer science education and computational thinking changed positively.