• Research in Mathematical Education
• /
• v.17 no.2
• /
• pp.133-152
• /
• 2013

In this research, we investigated students' understanding of the definitions of sequence of continuous functions and its uniform convergence. We selected three female and three male students out of the senior class of a university and conducted questionnaire surveys 4 times. We examined students' concept images of sequence of continuous functions and its uniform convergence and also how they approach to the right concept definitions for those through several progressive questions. Furthermore, we presented some suggestions for effective teaching-learning for the sequences of continuous functions.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.199-202
• /
• 2003

In this paper, we propose a new 3D coding method for heterogeneous systems over enhanced Access Grid (e-AG) with 3D display using spatio-temporal scalability. The proposed encoder produces four bit-streams: one base layer and enhancement layer l, 2 and 3. The base layer represents a video sequence for left eye with lower spatial resolution. An enhancement layer l provides additional bit-stream needed for reproduction of frames produced in base layer with full resolution. Similarly, the enhancement layer 2 represents a video sequence for right eye with lower spatial resolution and an enhancement layer 3 provides additional bit-stream needed for reproduction of its reference pictures with full resolution. In this system, temporal resolution reduction is obtained by dropping B-frames in the receiver according to network condition. The receiver system can select the spatial and temporal resolution of video sequence with its display condition by properly combining bit-streams.

• BMB Reports
• /
• v.43 no.6
• /
• pp.407-412
• /
• 2010

Homeodomain (HD) is a highly conserved DNA-binding domain composed of helix-turn-helix motif. Drosophila Vnd (Ventral nervous system defective) containing HD acts as a regulator to either enhance or suppress gene expression upon binding to its target sequence. In this study, kinetic analysis of Vnd binding to DNA was performed. The result demonstrates that DNA-binding affinity of the recombinant protein containing HD and NK2-specific domain (NK2-SD) was higher than that of the full-length Vnd. To access whether phosphorylation sites within HD and NK2-SD affect the interaction of the protein with the target sequence, alanine substitutions were introduced. The result shows that S631A mutation within NK2-SD does not contribute significantly to the DNA-binding affinity. However, S571A and T600A mutations within HD showed lower affinity for DNA binding. In addition, DNA-binding analysis using embryonic nuclear protein also demonstrates that Vnd interacts with other nuclear proteins, suggesting the existence of Vnd as a complex.

• Nuclear Engineering and Technology
• /
• v.49 no.2
• /
• pp.313-326
• /
• 2017

The systematic management of plant risk is crucial for enhancing the safety of nuclear power plants and for designing new nuclear power plants. Accident sequence precursor (ASP) analysis may be able to provide risk significance of operational experience by using probabilistic risk assessment to evaluate an operational event quantitatively in terms of its impact on core damage. In this study, an ASP methodology for two operation mode, full power and low power/shutdown operation, has been developed and applied to significant accident precursors that may occur during the operation of nuclear power plants. Two operational events, loss of feedwater and steam generator tube rupture, are identified as ASPs. Therefore, the ASP methodology developed in this study may contribute to identifying plant risk significance as well as to enhancing the safety of nuclear power plants by applying this methodology systematically.

• Structural Engineering and Mechanics
• /
• v.45 no.5
• /
• pp.703-722
• /
• 2013

In this paper a study about concrete arch bridges built by lattice cantilevers is presented. Lattice cantilevers are partial structures composed of deck, arch, piers and provisional steel diagonals, organized as reticular cantilever girders, in order to build arch bridges without the use of centrings, supports or temporary towers. Characteristics of this construction methodology with its variants are explained together with their implications in the erection sequence. Partial elastic scheme method is implemented in order to find initial forces of temporary cables and a forward analysis is carried out to follow the actual sequence of construction, by extending a procedure already applied to concrete cable-stayed bridges and to arches built by the classical suspended cantilever method. A numerical application on a case-study of a concrete arch bridge is performed together with a comparison between different methodologies followed for its construction sequence. Differences between erection by lattice cantilevers and cable-stayed cantilevers, are discussed. Results can be useful for designers in conceptual design of concrete arch bridges.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.2
• /
• pp.157-160
• /
• 2003

In this paper, we describe how to represent lower case hand-written English alphabets by a sequence of two to seven fuzzy sets. Each fuzzy set represents an arc segment of the character and each arc segment is assumed to be a part of an ellipse. The part of an ellipse is defined by five quantities; its short and long radii, its orientation angle, whether it is a part of the lower half or the upper half, and whether it is the full half or a part of a half. Hence, we use the Cartesian product of five fuzzy sets to represent each arc segment. We show that this representation is a translation, rotation, and scaling invariant and that it can be used to generate the hand-written English alphabets. The representation we describe is different from the one proposed earlier by the author and when compared with the previous representation, the one described in this paper simulates more closely the behavior of how one writes English characters.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.2
• /
• pp.59-64
• /
• 2001

In this paper, we propose an alternate method for determining the uniqueness of the reconstruction of a complex sequence from its phase. Uniqueness constraints could be derived in terms of the zeros of a complex polynomial defined by the DFT of the sequence. However, rooting of complex polynomials of high order is a very difficult problem. Instead of finding zeros of a complex polynomial, the proposed uniqueness criteria show that non-singularity of a matrix can guarantee the uniqueness of the reconstruction of a complex sequence from its phase-only data. It has clear advantage over the rooting method in numerical stability and computational time.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1267-1270
• /
• 1997

An assembly sequence is considered to be optimal when it minimizes assembly cost while satisfying assembly constraints. to generate such sequences for robotic assembly, this paper proposes a method using a genetic algorithm (GA). This method denotes an assembly sequence as an individual, which is assigned a fitness related to the assembly cost. Then, a population consisting of a number of individuals evolves to the next generation through genetic operations of crossover and mutation based upon the fitness of the individuals. The population continues to repetitively evolve, and finally the fittest individual and its corresponding assembly sequence is found. Through case study for an electrical relay, the effectiveness of the proposed method is demonstrated. Also, the performance is evaluated by-comparing with those of previously presented approaches such as a neural-netowork-based method and a simulated annealing method.

• Journal of KIISE:Software and Applications
• /
• v.30 no.9
• /
• pp.803-811
• /
• 2003

Multiple sequence alignment is a useful tool to identify the relationships among protein sequences. Dynamic programming is the most widely used algorithm to obtain multiple sequence alignment with optimal cost. However, dynamic programming cannot be applied to certain cost function due to its drawback and cannot be used to produce optimal multiple sequence alignment. We propose sub-alignment refinement algorithm to overcome the problem of dynamic programming. Also we show proposed algorithm can solve the problem of dynamic programming efficiently.

• Journal of the Korean housing association
• /
• v.12 no.4
• /
• pp.123-129
• /
• 2001

The purpose of this study is to understand a view in the light of sequence by human\\`s moving by quantitatively dealing with the elements of sequence view of multiple dwelling zone and to explain its characteristics. As a result, this study found that the sequence view of multiple dwelling zone makes difference according to the degree of sequential changes, layout form, width and moving interval in the zone, as well as view elements outside the zone. The changes in view elements are also treated qualitatively in comparing each multiple dwelling zone in order to explain the characteristics of view of multiple dwelling zone using their mean value and change coefficient.