• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.425-436
• /
• 2006

The e-learning system in which the learning is carried out by predefined procedures cannot offer proper learning suitable to the capability of individual learner. To solve this problem, SCORM sequencing can be used to define various learning procedures according to the capabilities of learners. Currently the sequencing is designed by teachers or learning contents producers to regularize the learning program. However, the predefined sequencing may not reflect the characteristics of the learning group. If inappropriate sequencing is designed it may cause the unnecessary repetition of learning. In this paper, we propose an automated evaluation system in which dynamic sequencing is applied. The dynamic sequencing reflects the evaluation results to the standard scores used by sequencing. By changing the standard scores, the sequencing changes dynamically according to the evaluation results of a learning group. Through several experiments, we verified that the proposed learning system that uses the dynamic sequencing is effective for providing the proper learning procedures suitable to the capabilities of learners.

• Journal of Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.81-94
• /
• 1986

A shortest path dynamic programming formulation is proposed and attemped to solve an uncapacitated expansion sequencing problem. It is also compared with the Extended Binary State Space approach with total capacity. Difficulties and merits associated with the formulation are discussed. The shortest path dynamic programming lacks the separability condition and an optimal solution is not guaranteed. However it has other merits and seems to be the practical solution procedure for the expansion sequencing problem in a sense that it finds near optimal solution with less state evaluations.

• Korean Journal of Microbiology
• /
• v.35 no.2
• /
• pp.121-127
• /
• 1999

An effective computer program for assembling fragments in DNA sequencing has been developed. The program, called SeqEditor (Sequence Editor), is usable on the pcrsonal computer systems of MS-Widows which is the mosl popular operating system in Korea. It c'm recd several sequence file formats such as GenBak, FASTA, and ASCII. In the SeqEditor program, a dynamic programming algorihm is applied to compute the maximalscoring overlapping alignment between each pjlr of fragments. A novel feature of the program is that SeqEdilor implemnents interaclive operation with a graphical user interface. The performance lests of the prograln 011 fragmen1 data from 16s and 18s rDNA sequencing pi-ojects produced saiisIactory results. This program may be useful to a person who has work of time with large-scale DNA sequencing projects.

• IE interfaces
• /
• v.20 no.2
• /
• pp.112-120
• /
• 2007

As the market rapidly changes, the speed of new product development is highlighted as a critical element which determines the success of firms. While firms endeavor to accelerate the development speed, frequent iterations in a development process hinders the effort of acceleration. For this reason, many previous researches tried to find the optimal structure of the development process which minimizes the number of iterations. However, such researches have a limitation in that they can be applied to only a single-project environment. In a multi-project environment, waiting time induced by lack of resources also delays the process as well as the iterations do. In this paper, we propose dynamic sequencing method focusing on both iterations and waiting time for reducing the durations of development projects in a multi-project environment. This method reduces the waiting time by changing the sequence of development tasks according to the states of resources. While the method incurs additional iterations, they are expected to be offset by the reduced waiting time. The results of simulation show that the dynamic sequencing method dramatically improves the efficiency of a development process. Especially, the improvement is more salient as projects are more crowded and the process is more unbalanced. This method gives a new insight in researches on managing multiple development projects.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.578-586
• /
• 2005

In this Paper we consider the problem of sequence alignment with quality scores. DNA sequences produced by a base-calling program (as part of sequencing) have quality scores which represent the confidence level for individual bases. However, previous sequence alignment algorithms do not consider such quality scores. To solve sequence alignment with quality scores, we propose a measure of an alignment of two sequences with orality scores. We show that an optimal alignment in this measure can be found by dynamic programming.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.8
• /
• pp.937-949
• /
• 1988

This paper proposes a code optimization algorithm for dealing with hazards which are occurred in pipelined architecture due to resource dependence between executed instructions. This algorithm solves timing hazard which results from resource conflict between concurrently executing instructions, and sequencing hazard due to the delay time for branch target decision by reconstructing of instruction sequence without pipeline interlock. The reconstructed codes can be generated efficiently by considering timing hazard and sequencing hazard simultaneously. And dynamic execution time of program is improved by considering structral hazard which can be existed when pipeline is controlled dynamically.

• Journal of Korean Institute of Industrial Engineers
• /
• v.5 no.1
• /
• pp.67-82
• /
• 1979

For many capacity expansion problems, distinct capacity types must be specified to identify capacity at different locations or capacities with different costs and operating characteristics. In this study, a project-sequencing model is developed that allows operating costs to influence the timing decisions for project establishment. Under certain conditions, the power expansion formulation is derived that may be solved through the dynamic programming approach, and its first application to planning in electric power systems is selected to investigate an optimal policy and to show the impact of requiring system to service more than one type of demand. Several sample testing results indicate that in some systems the efficiency of the large nuclear plants is higher than that of smell ones that it may overcome the effects of the drop in reliability.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.1
• /
• pp.74-82
• /
• 1986

The elliptic functions have a set of zeros on the jw axis. In acitve realization we decompose a function into product of biquads. In this paper, a simple method of pole-zero pairing is proposed for the enhancement of overall dynamic range. Secondly, the optimum sequencing of individual biquads is developed and it is demonstrated that the commonly accepted sequencing technique does not hold in the case of elliptic functions. This work is an approximation for Leuder's(1970)method.

• Water for future
• /
• v.14 no.2
• /
• pp.63-69
• /
• 1981

This Study is aimed at optimal sequencing of water supply projects for water demand from the application in water resources field of dynamic programming because a minimum present cost strategy for investment in water supply projects plays an important part of installation of some projects. In analysis, the relationships of the future water demand and numerous possible independent projects that are expected to meet water requirements up to some future data in Daegu city were used and future water demand were estimated from the exponential function method, the method used by the Water Works Bureau of Daegu City government which is a kind of geometric progression method and the mean value of these two methods. The results showed that the optimal sequencing of water supply projects using Dynamic Programming was reasonable and the changing of the estimation method of future water demand made a difference among optimal sequence of projects while the changing of annual rate of interest had influenced on present value cost only. In general, the best sequence for constructing the seven projects was the order of D-E-G-F-C-B-A, with the corresponding period for 33-38 years.

• Journal of Environmental Science International
• /
• v.25 no.4
• /
• pp.525-534
• /
• 2016

The biological wastewater treatment plant, which uses microbial community to remove organic matter and nutrients in wastewater, is known as its nonlinear behavior and uncertainty to operate. Therefore, operation of the biological wastewater treatment process much depends on observation and knowledge of operators. The manual inspection of human operators is essential to manage the process properly, however, it is impossible to detect a fault promptly so that the process can be exposed to improper condition not securing safe effluent quality. Among various process faults, equipment malfunction is critical to maintain normal operational state. To detect equipment faults automatically, the dynamic time warping was tested using on-line oxidation-reduction potential (ORP) and dissolved oxygen (DO) profiles in a sequencing batch reactor (SBR), which is a type of wastewater treatment process. After one cycle profiles of ORP and DO were measured and stored, they were warped to the template profiles which were prepared already and the distance result, accumulated distance (D) values were calculated. If the D values were increased significantly, some kinds of faults could be detected and an alarm could be sent to the operator. By this way, it seems to be possible to make an early detecting of process faults.