• Journal of Korean Elementary Science Education
• /
• v.33 no.4
• /
• pp.700-709
• /
• 2014

The purpose of this study was to examine the effects of question-generating strategy on science academic achievement, scientific attitude in elementary science class. To examine the effects of question-generating strategy this learning materials were applied to elementary science curriculum, and an experimental group and a control group were selected from $5^{th}$ graders at H elementary school located in Gyeonggi-do. Students were taught for 6 weeks. Control group take traditional lessons and solve questions presented textbook. Question generated group generate questions, solve them and feed back by themselves. The results of this study were found statistically significant difference in the pupil's enhancement of the science academic achievement, scientific attitude (p<.05). Thus question-generating strategy for elementary science inquiry instruction that has a positive effect on interests in class is useful and better be widely applied to science education.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.8
• /
• pp.1382-1389
• /
• 2007

This paper presents a new approach for solving the problem of maintenance scheduling of generating units using a binary particle swarm optimization (BPSO). In this paper, we find the optimal solution of the maintenance scheduling of generating units within a specific time horizon using a binary particle swarm optimization algorithm, which is the discrete version of a conventional particle swarm optimization. It is shown that the BPSO method proposed in this paper is effective in obtaining feasible solutions in the maintenance scheduling of generating unit. IEEE reliability test systems(1996) including 32-generators are selected as a sample system for the application of the proposed algorithm. From the result, we can conclude that the BPSO can find the optimal solution of the maintenance scheduling of the generating unit with the desirable degree of accuracy and computation time, compared to other heuristic search algorithm such as genetic algorithms. It is also envisaged that BPSO can be easily implemented for similar optimizations and scheduling problems in power system problems to obtain better solutions and improve convergence performance.

• Honam Mathematical Journal
• /
• v.16 no.1
• /
• pp.47-54
• /
• 1994

We present a generating function and three semi-orthogonal relations for a class of hypergeometric functions. We employ semi-orthogonal relations to generate a theory concerning finite series expansions involving our hypergeometric functions.

• Journal of the Korean Mathematical Society
• /
• v.50 no.5
• /
• pp.1067-1082
• /
• 2013

In this paper, we will find some recurrence relations of classical multiple OPS between the same family with different parameters using the generating functions, which are useful to find structure relations and their connection coefficients. In particular, the differential-difference equations of Jacobi-Pineiro polynomials and multiple Bessel polynomials are given.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1909-1920
• /
• 2018

In the paper, the authors find a common solution to three series of differential equations related to the generating function of the Bernoulli numbers of the second kind and present a recurrence relation, an explicit formula in terms of the Stirling numbers of the first kind, and a determinantal expression for the Bernoulli numbers of the second kind.

• Communications of the Korean Mathematical Society
• /
• v.28 no.1
• /
• pp.87-105
• /
• 2013

The aim of the present paper is to study some generating functions of generalized Bateman's and Pasternak's polynomials of two variables.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.771-784
• /
• 1998

In this paper we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutest ex-actly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets at O(e.n) {where e,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.2
• /
• pp.125-132
• /
• 2001

An algorithm for generating all hexahedral meshes for three dimensional objects has been presented. This algorithm is based on the sweeping and the grafting method. In sweeping process internal nodes generating method has been modified by employing the distances between nodes on connecting surfaces and on source surfaces. In addition to the sweeping processes grafting algorithm is also modified to obtain more effective meshes by refining elements near grafting surfaces. With this method two and a half dimensional hexahedral meshes for three dimensional objects can be generated effectively. Sample meshes are constructed to demonstrate the mesh generating capability of the proposed algorithm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.6
• /
• pp.879-885
• /
• 1990

The geometrical algorithm for generating a 3-phase SPWM signal for VVVF (Variable Voltage, Variable Frequency) inverter drives is proposed. In this techniques, it is suitable for micro-processor based implementation since the pulsewiths are computable in real time from simple analytic expressions. System hardware consists of the inverter circuit and the 3-phase SPWM signal generating circuit. The inverter circuit is a 3-phase SPWM signal generating circuit is single board micro-processor consisting of Z-80A CPU, EPROMXI, CTC, PIO. The method of controlling VVVF at the inverter output is discussed here.

• Journal of applied mathematics & informatics
• /
• v.38 no.3_4
• /
• pp.291-300
• /
• 2020

This type of polynomial is a generating function that substitutes e^λt for e^t in the denominator of the generating function for the Bernoulli polynomial, but polynomials by using this generating function has interesting properties involving the location of the roots. We define these generation functions and observe the properties of the generation functions.