• Communications for Statistical Applications and Methods
• /
• v.22 no.6
• /
• pp.647-653
• /
• 2015

Extreme value theory concerns the distributional properties of the maximum of a random sample; subsequently, it has been significantly extended to stationary random sequences satisfying weak dependence restrictions. We focus on distributional mixing condition $D(u_n)$ and the Berman condition based on covariance among weak dependence restrictions. The former is assumed for general stationary sequences and the latter for stationary normal processes; however, both imply the same distributional limit of the maximum of the normal process. In this paper $D(u_n)$ condition is shown weaker than Berman's covariance condition. Examples are given where the Berman condition is satisfied but the distributional mixing is not.

• Proceedings of the KIEE Conference
• /
• 1990.11a
• /
• pp.303-308
• /
• 1990

The stand alone induction generator has been excited by capacitor bank or voltage source inverters. The conventional excitation methods offer several restrictions on the operation of the induction generator in various operating conditions. To overcome the restrictions, this paper presents the induction generator system excited by the current controlled inverter which operates on the principle of vector control. The proposed control scheme is based on the rotor flux oriented indirect vector control. The steady state characteristics are investigated to yield control ranges under various operating conditions. Through the simulation, it is confirmed that the system has good dynamic characteristics wi thin the controllable ranges given by the steady state analysis.

• The Pure and Applied Mathematics
• /
• v.9 no.1
• /
• pp.81-90
• /
• 2002

The least informative (favorable) distributions, minimizing Fisher information for a multivariate location parameter, are derived in the parametric class of the exponential-power spherically symmetric distributions under the following characterizing restrictions; (i) a bounded variance, (ii) a bounded value of a density at the center of symmetry, and (iii) the intersection of these restrictions. In the first two cases, (i) and (ii) respectively, the least informative distributions are the Gaussian and Laplace, respectively. In the latter case (iii) the optimal solution has three branches, with relatively small variances it is the Gaussian, them with intermediate variances. The corresponding robust minimax M-estimators of location are given by the $L_2$-norm, the $L_1$-norm and the $L_{p}$ -norm methods. The properties of the proposed estimators and their adaptive versions ar studied in asymptotics and on finite samples by Monte Carlo.

• Korean Journal of Organic Agriculture
• /
• v.11 no.1
• /
• pp.1-19
• /
• 2003

Nowadays liquid manure can no longer be regarded as a waste product, but as a compound fertilizer, which should be used as efficiently as possible, especially on the farm. Additionally, there is the intensified public discussion about environmental issues. With respect to the ecological effects of the proper application of liquid manure, administrative regulations in the form of guidelines, decrees and ordinances have been established in region. It is questionable though, if such quantifying restrictions bring a reduction of ground water pollution, or if not through these measures new problems will be created, i. e. be temporarily postponed. Moreover, in this Study, possible Operation and technical Improvement are presented.

• Architectural research
• /
• v.11 no.2
• /
• pp.43-49
• /
• 2009

Since the late 1980s, the schedule technique applied to the construction industry around the world has rapidly changed from the traditional ADM (Arrow Diagramming Method) to the PDM (Precedence Diagramming Method) technique. The main reason for this change is to overcome the limits and inconveniences of the traditional ADM technique. The time-cost trade-off is one of the core scheduling techniques to establish the best optimized combination plan in terms of a relationship between the cost and schedule. However, most of the schedule-related textbooks and research papers have discussed and proposed applications of a time-cost trade-off technique based only on the Finish to Start relationship. Therefore, there are almost no consideration and discussion of problems or restrictions that emerge when the time-cost trade-off technique is applied to the PDM network that has overlapping relationships. This paper proposes the lead-time adjustment method as a methodology for overcoming some restrictions that are encountered when the time-cost trade-off technique is applied to the overlapping relationships of the PDM network.

• Korean Journal of Mathematics
• /
• v.28 no.2
• /
• pp.343-359
• /
• 2020

The paper aim is to resolve the issue of ranking to the fuzzy numbers in decision analysis, artificial intelligence and optimization. In the literature lot of ideologies have been established for ranking to the fuzzy numbers, that ideologies have some restrictions and limitations. In this paper, we proposed a method based on cubic picture fuzzy information's, for ranking to defeat the existing restrictions. Further introduced some cubic picture fuzzy algebraic and cubic picture fuzzy algebraic^* aggregated operators for aggregated the information. Finally, a multi-attribute decision making problem is assumed as a practical application to establish the appropriateness and suitability of the proposed ranking approach.

• The Korean Journal of Applied Statistics
• /
• v.24 no.5
• /
• pp.799-807
• /
• 2011

This study investigates long and short run responses of variables to exogenous shocks by imposing prior restrictions on a contemporaneous structural shock coefficient matrix of the model to identify shocks by endogenous variables in the vector autoregression. The relative importance of each structural shock in variation of each variable is calculated through the identification of proper restrictions (not based on any specific theory but on researcher judgment corresponding to actual situations) and an estimation of the structural vector autoregression. The results of the analyses are found to maintain consistency.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.8
• /
• pp.969-976
• /
• 1999

This paper is concerned with the generation of a balancing trajectory for improving the walking performance. The balancing motion has been determined by solving a second -order differential equation. However, this method caused some difficulties in linearizing and approximating the equation and had restrictions on using various balancing trajectories. The proposed difficulties in linearizing and approximating the equation and had restrictions on using various balancing trajectories. The proposed method i this paper is based on the genetic algorithm for minimizing the motins of balancing joints, whose trajectories are generated by the fifth-order polynomial interpolation after planning leg trajectories. The real walking experiments are made on the biped robot IWR-III, developed by our Automatic Control Laboratory. The system has 8 degrees of freedom and the structure of three pitches in each leg, and one roll and one prismatic joint in the balancing joints. The experimental result shows the validity and applicability of the new proposed algorithm.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2008.05a
• /
• pp.57-60
• /
• 2008

There exist a lot of factors and restrictions for the design of solid rocket motors like burning rate, of solid propellant, demanded thrust, chamber pressure, diameter, length, weight and acceleration. For the optimization of these factors and restrictions, integrated design software for internal/external ballistic analysis was developed and verified by the performance test of solid rocket motors.

• Journal of Industrial Technology
• /
• v.28 no.B
• /
• pp.15-25
• /
• 2008

This paper is to develop a network reorganization method to consider the constraints which are turn restrictions, U-turns, and P-turns in two way traffic network for Intelligent Transport System(ITS). Several kinds of traffic constraints can be represented in reorganized network using virtual nodes and arc values. The evolution program is also developed to search the multiple shortest paths in this reorganized traffic network within limited time.