• Title/Summary/Keyword: order sequence

Search Result 2,181, Processing Time 0.024 seconds

Virtual Flux and Positive-Sequence Power Based Control of Grid-Interfaced Converters Against Unbalanced and Distorted Grid Conditions

  • Tao, Yukun;Tang, Wenhu
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.3
    • /
    • pp.1265-1274
    • /
    • 2018
  • This paper proposes a virtual flux (VF) and positive-sequence power based control strategy to improve the performance of grid-interfaced three-phase voltage source converters against unbalanced and distorted grid conditions. By using a second-order generalized integrator (SOGI) based VF observer, the proposed strategy achieves an AC voltage sensorless and grid frequency adaptive control. Aiming to realize a balanced sinusoidal line current operation, the fundamental positive-sequence component based instantaneous power is utilized as the control variable. Moreover, the fundamental negative-sequence VF feedforward and the harmonic attenuation ability of a sequence component generator are employed to further enhance the unbalance regulation ability and the harmonic tolerance of line currents, respectively. Finally, the proposed scheme is completed by combining the foregoing two elements with a predictive direct power control (PDPC). In order to verify the feasibility and validity of the proposed SOGI-VFPDPC, the scenarios of unbalanced voltage dip, higher harmonic distortion and grid frequency deviation are investigated in simulation and experimental studies. The corresponding results demonstrate that the proposed strategy ensures a balanced sinusoidal line current operation with excellent steady-state and transient behaviors under general grid conditions.

Analogical Transfer: Sequence and Connection

  • LIM, Mi-Ra
    • Educational Technology International
    • /
    • v.9 no.1
    • /
    • pp.79-96
    • /
    • 2008
  • The issue of connection between entities has a lengthy history in educational research, especially since it provides the necessary bridge between base and target in analogical transfer. Recently, the connection has been viewed through the application of technology to bridge between sequences in order to be cognitively useful. This study reports the effect of sequence type (AT vs. TA) and connection type (fading vs. popping) on the achievement and analogical transfer in a multimedia application. In the current research, 10th -grade and 11th -grade biology students in Korea were randomly assigned to five groups to test the effects of presentation sequence and entity connection type on analogical transfer. Consistent with previous studies, sequence type has a significant effect: analogical transfer performance was better when base representations were presented first followed by target representations rather than the reverse order. This is probably because presenting a familiar base first helps in understanding a less familiar target. However, no fully significant differences were found with the entity connection types (fading vs. popping) in analogical transfer. According to the Markman and Gentner's (2005) spatial model, analogy in a space is influenced only by the differences between concepts, not by distance in space. Thus connection types fail on the basis of this spatial model in analogical transfer test. The findings and their implications for sequence and connection research and practice are discussed. Leveraging on the analogical learning process, specific implications for scaffolding learning processes and the development of adaptive expertise are drawn.

Existence Condition for the Stationary Ergodic New Laplace Autoregressive Model of order p-NLAR(p)

  • Kim, Won-Kyung;Lynne Billard
    • Journal of the Korean Statistical Society
    • /
    • v.26 no.4
    • /
    • pp.521-530
    • /
    • 1997
  • The new Laplace autoregressive model of order 2-NLAR92) studied by Dewald and Lewis (1985) is extended to the p-th order model-NLAR(p). A necessary and sufficient condition for the existence of an innovation sequence and a stationary ergodic NLAR(p) model is obtained. It is shown that the distribution of the innovation sequence is given by the probabilistic mixture of independent Laplace distributions and a degenrate distribution.

  • PDF

Numerical study of a new constructive sequence for movable scaffolding system (MSS) application

  • Teran, Jose Ramon Diaz de;Haach, Vladimir Guilherme;Turmo, Jose;Jorquera, Juan Jose
    • Advances in concrete construction
    • /
    • v.4 no.3
    • /
    • pp.173-194
    • /
    • 2016
  • This paper consists in a study of a new contructive sequence of road viaducts with Movable Scaffolding System (MSS) using numerical tools based on finite element method (FEM). Traditional and new sequences are being used in Spain to build viaducts with MSS. The new sequence permits an easier construction of one span per week but implies some other issues related to the need of two prestressing stages per span. In order to improve the efficiency of the new sequence by reducing the number of prestressing stages per span, two solutions are suggested in this study. Results show that the best solution is to introduce the 100% of the prestressing force at the self-supporting core in order to improve the road viaduct construction with movable scaffolding system by reducing execution time without increasing economic costs.

DESIGN AND ANALYSIS OF PREDICTIVE SORTING ALGORITHMS

  • Yun, Min-Young
    • Journal of applied mathematics & informatics
    • /
    • v.3 no.1
    • /
    • pp.11-24
    • /
    • 1996
  • The focus of this research is the class of sequential al-gorithms called predictive sorting algorithms for sorting a given set of n elements using pairwise comparisons. The order in which these pairwise comparisons are made is defined by a fixed sequence of all un-ordered pairs of distinct integers{1,2 ···,n} called a sort sequence. A predictive sorting algorithm associated with a sort sequence spec-ifies pairwise comparisons of elements in the input set in the order defined by the sort sequence except that the comparisons whose out-comes can be inferred from the preceding pairs of comparisons are not performed. in this paper predictive sorting algorithms are obtained based on known sorting algorithms and are shown to be required on the average O(n log n) comparisons.

THE G-SEQUENCE OF A MAP AND ITS EXACTNESS

  • Pan, Ian-Zhong;Shen, Xin-Yao;Woo, Moo-Ha
    • Journal of the Korean Mathematical Society
    • /
    • v.35 no.2
    • /
    • pp.281-294
    • /
    • 1998
  • In this paper, we extend the G-sequence of a CW-pair to the G-sequence of a map and show the existence of a map with nonexact G-sequence. We also give an example of a finite CW-pair with nontrivial $\omega$-homology in high order.

  • PDF

A Study of Parameter Estimation for First Order System with Dead Time (지연요소를 수반하는 일차계통의 패러미터 추정에 관한 연구)

  • Joo Shik Ha
    • 전기의세계
    • /
    • v.18 no.1
    • /
    • pp.15-23
    • /
    • 1969
  • A lot of recent researches have shown that a Pseudo Random Binary Signal is a quite effective test signal to measure the impulse response of a plant. Generally speaking, however, such a response itself is not satisfactory to determine the appropriate control parameters or control inputs. Here, the author intends to estimate the unknown parameters of the First Order Plant with Dead Time by means of correlation method using M-sequence signal. The time constant T and the dead time L of the plant are eatimated with one tracking loop by automatically adjusting delay time .tau. of M-sequence signal according to variations of T and L. In this paper, a three level M-sequence signal is used as a test signal in order to avoid troublesome operations to calculate partial derivatives of a given performance index with respect to the parameters which are usually required in the Model Method. Several experiments with analogue computer using low pass filters as averaging circuits showed good results as expected.

  • PDF

CYCLIC CODES FROM THE FIRST CLASS TWO-PRIME WHITEMAN'S GENERALIZED CYCLOTOMIC SEQUENCE WITH ORDER 6

  • Kewat, Pramod Kumar;Kumari, Priti
    • Bulletin of the Korean Mathematical Society
    • /
    • v.56 no.2
    • /
    • pp.285-301
    • /
    • 2019
  • Let $p_1$ and $p_2$ be two distinct odd primes with gcd($p_1-1$, $p_2-1$) = 6. In this paper, we compute the linear complexity of the first class two-prime Whiteman's generalized cyclotomic sequence (WGCS-I) of order d = 6. Our results show that their linear complexity is quite good. So, the sequence can be used in many domains such as cryptography and coding theory. This article enrich a method to construct several classes of cyclic codes over GF(q) with length $n=p_1p_2$ using the two-prime WGCS-I of order 6. We also obtain the lower bounds on the minimum distance of these cyclic codes.

A Study on Teaching the Notion of Limit of the Sequence in High School Mathematics (고등학교 수학에서 수열의 극한개념의 지도에 관한 연구)

  • 김기원;왕수민
    • The Mathematical Education
    • /
    • v.42 no.5
    • /
    • pp.707-723
    • /
    • 2003
  • Teaching the notion of limit of the sequence in high school mathematics needs special attention and accurate teaching methods, for it is one of the most important bases of the advanced mathematics. Therefore it is necessary for high school students to have the right understanding of the notion of limit of the sequence. In this paper, we survey several teaching methods of the notion of limit of the sequence in high school mathematics and introduce a new method using Excell program. Also through questionnaire survey we discuss and analyse students' reaction when they learn the notion of limit of the sequence. And based on that, we suggest a method that would be believed to improve the students' understanding for the notion of limit It should be also notified that questionnaire survey was performed in order to find out which method would be appropriate to teach the notion of limit of the sequence, and that the survey result was fully reflected in the guideline that suggested.

  • PDF

Assembly Sequence Planning for Multiple Robots Along a Conveyer Line (다수의 로봇을 이용한 컨베어상의 조립순서 계획)

  • 박장현
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.15 no.4
    • /
    • pp.111-117
    • /
    • 1998
  • In order to increase productivity of an assembly system composed of multiple robots along a conveyer line, an efficient sequence planning is necessary because the assembly time is dependent upon the assembly sequence. In this paper, a two-robot assembly system is considered in which two robots operate simultaneously and transfer parts from the part feeders to the workpiece on the conveyer one by one. In this case, the distance from the feeder to the workpiece varies with time because the workpiece moves at a constant speed on the conveyer. Hence, the sequence programming is not a trivial problem. Also, the two robots may interfere with each other kinematically and dynamically due to the simultaneous operation, so the sequence should be programmed to avoid the interferences. In this paper, the task sequence optimization problem is formulated and is solved by employing the simulated annealing which has been shown to be effective for solving large combinatorial optimizations.

  • PDF