• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.3
• /
• pp.205-215
• /
• 2004

The characteristic ratio assignment (CRA) method〔1〕 is new polynomial approach which allows to directly address the transient responses such as overshoot and speed of response time in time domain specifications. The method is based on the relationships between time response and characteristic ratios($\alpha_i$ ) and generalized time constant (T), which are defined in terms of coefficients of characteristic polynomial. However, even though the CRA can apply to developing a linear controller that meets good transient responses, there are still some fundamental questions to be explored. For the purpose of this, we have analyzed several sensitivities of a linear system with respect to the changes of coefficients itself and $\alpha_i$ of denominator polynomial. They are (i) the unnormalized root sensitivity : to determine how the poles change as $\alpha_i$ changes, and (ii) the function sensitivity to determine the sensitivity of step response to the change of o, and to analyze the sensitivity of frequency response as o, changes. As an other important result, it is shown that, under any fixed T and coefficient of the lowest order of s in denominator, the step response is dominantly affected merely by $\alpha_1, alpha_2 and alpha_3$ regardless of the order of denominator higher than 4. This means that the rest of the$\alpha_i$ s have little effect on the step response. These results provide some useful insight and background theory when we select $\alpha_i$ and T to compose a reference model, and in particular when we design a low order controllers such as PID controller.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.254-260
• /
• 2005

In the guaranteed service, a real-time scheduling algorithm must achieve both high level of network utilization and scalable implementation. Here, network utilization indicates the number of admitted real-time sessions. Unfortunately, existing scheduling algorithms either are lack of scalable implementation or can achieve low network utilization. For example, scheduling algorithms based on time-stamps have the problem of O(log N) scheduling complexity where N is the number of sessions. On the contrary, round-robin algorithms require O(1) complexity. but can achieve just a low level of network utilization. In this paper, we propose a scheduling algorithm that can achieve high network utilization without losing scalability. The proposed algorithm is a Hierarchical Round-Robin (H-RR) algorithm that utilizes multiple rounds with different interval sizes. It provides latency bounds similar to those by Packet-by-Packet Generalized Processor Sharing (PGPS) algorithm using a sorted-Priority queue. However, H-RR requires a constant time for implementation.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.2
• /
• pp.96-107
• /
• 1999

The generalized sidelobe cancellers(GSC's) ar used for suppressing an interference in array radar. The frequency-domain GSC's have a faster convergence rate than the time-domain GSC's because they remove the correlation between the interferences using a frequency-domain least mean square(LMS) algorithm. However, we have not fully used the advantage of the frequency-domain GSC's since we have always updated the weights of all frequency bins, even the interferer free frequency bin. In this paper, we propose a new frequency-domain GSC based on constant false-alarm rate(CFAR) detector, of which GSC adaptively determine the bin whose weight is updated according to the power of each frequency bin. This canceller updates the weight of only updated according to the power of each frequency bin. This canceller updates the weight of only the bin of which the power is high because of the interference signal. The computer simulation shows that the new GSC reduces the iteration number for convergence over the conventional GSC's by more than 100 iterations. The signal-to-noise ration(SNR) improvement is more than 5 dB. Moreover, the number of renewal weights required for the adaptation is much fewer than that of the conventional one.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.535-544
• /
• 2003

Integrated services networks should guarantee end-to-end delay bounds for real-time applications to provide high quality services. A real-time scheduler is installed on all the output ports to provide such guaranteed service. However, scheduling algorithms studied so far have problems with either network utilization or scalability. Here, network utilization indicates how many real-time sessions can be admitted. In this paper, we propose service curve allocation schemes that result in both high network utilization and scalability in a service curve algorithm. In service curve algorithm, an adopted service curve allocation scheme determines both network utilization and scalability. Contrary to the common belief, we have proved that only a part of a service curve is used to compute deadlines, not the entire curve. From this fact, we propose service curve allocation schemes that result in a constant time for computing deadlines. We through a simulation study that our proposed schemes can achieve better network utilizations than Generalized processor Sharing (GPS) algorithms including the multirate algorithm. To our knowledge, the service curve algorithm adopting our schemes can achieve the widest network utilization among existing scheduling algorithms that have the same scalability.

• Journal of the Korea Safety Management & Science
• /
• v.16 no.2
• /
• pp.217-230
• /
• 2014

The purpose of this study is to develop the Generalized Depreciation Function (GDF) and Winfrey Depreciation Function (WDF) by reviewing methods for the depreciation accountings. The Depreciation Accounting Models (DAM), including straight-line model, declining-balance model, sum-of-the-year-digit model and sinking fund model presented in this paper, are reclassified into the charging pattern of increasing type, decreasing type and constant type. This paper also discusses the development of the GDFs based on convex type, concave type and constant type according to the demand pattern of product, frequency of plant usage, deterioration of time, relative inadequacy, Capital Expenditure (CAPEX) and Operating Expenditure (OPEX) of the Total Productive Maintenance (TPM). The WDFs presented in this paper depict a sudden degradation of plant performance by measuring the change of TPM activity at the midpoint of useful life of asset. The WDFs are classified into left-modal type, symmetrical type and right-modal type by varying the value of skewness and kurtosis. Moreover, three increasing patterns, such as convex, concave and linear types, are used in this paper to present the distinct identification of WFDs by using Instantaneous Depreciation Rate (IDR) in terms of Performance Depreciation Function (PDF) and Depreciation Density Function (DDF). In order to have better understanding of depreciation models, the numerical examples are used for evaluating the Net Operating Less Adjusted Tax (NOPLAT) and Economic Value Added (EVA). It is concluded that the depreciation models showing a large dispersion of EVA require the adjustment of NOPLAT and Invested Capital (IC) based on the objective cash basis and net operating activity for reducing the variation of EVA.

• Applied Biological Chemistry
• /
• v.32 no.4
• /
• pp.332-337
• /
• 1989

Rheological properties of rehydrated freeze dried instant rice were investigated in comparison with that of cooked rice. The time changes in reciprocal hardness of instant rice grains at various rehydration temperatures$(60{\sim}90^{\circ}C)$ could be expressed by the first order reaction rate equation regardless of rehydration temperature and reaction rate constant increased as the rehydration temperature increased. Activation energy for rehydrating instant rice was 6.1 kcal/g-mol. Analysis of compressive stress relaxation test showed that the viscoelastic properties of both rehydrated instant rice and cooked rice grains could be expressed by 6-elements generalized Maxwell model. Rehydrated instant rice revealed higher relaxation decay than that of cooked rice and showed the elastic property increased by increasing the rehydration temperature.

• Journal of Korea Multimedia Society
• /
• v.4 no.3
• /
• pp.270-279
• /
• 2001

Since most program execution time is spent in the loop structure, extracting parallelism from sequential loop programs hale been focused. But, most programs hare implicit parallelism of interprocedure. This paper presents a generalized Parallelism extraction in loop\ulcorner with procedure calls. Most parallelization of loops with Procedure calls just focus on the uniform code which data dependency distance is constant. We presents algorithms which can be applied with uniform code, nonuniform code, and complex code. The proposed algorithm, loop extraction, loop embedding and procedure cloning transformation methods evaluate using CRAY-T3E. The result of performance evaluation is that proposed algorithm is an effect.

• International Journal of Concrete Structures and Materials
• /
• v.10 no.2
• /
• pp.205-219
• /
• 2016

High-early-strength-concrete (HESC) made of Type III cement reaches approximately 50-70 % of its design compressive strength in a day in ambient conditions. Experimental investigations were made in this study to observe the effects of temperature, curing time and concrete strength on the accelerated development of compressive strength in HESC. A total of 210 HESC cylinders of $100{\times}200mm$ were tested for different compressive strengths (30, 40 and 50 MPa) and different curing regimes (with maximum temperatures of 20, 30, 40, 50 and $60^{\circ}C$) at different equivalent ages (9, 12, 18, 24, 36, 100 and 168 h) From a series of regression analyses, a generalized rate-constant model was presented for the prediction of the compressive strength of HESC at an early age for its future application in precast prestressed units with savings in steam supply. The average and standard deviation of the ratios of the predictions to the test results were 0.97 and 0.22, respectively.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.34 no.3
• /
• pp.328-338
• /
• 1998

It is main objective of this approach to present a method to analyse stochastic design sensitivity for problems of structural dynamics with randomness in design parameters. A combination of the adjoint variable approach and the second oder perturbation method is used in the finite element approach. An alternative form of the constant functional that holds for all times is introduced to consider the time response of dynamic sensitivity. The terminal problem of the adjoint system is solved using equivalent homogeneous equations excited by initial velocities. The numerical procedures are shown to be much more efficient when based on the fold superposition method : the generalized co-ordinates are normalized and the correlated random variables are transformed to uncorrelated variables, where as the secularities are eliminated by the fast Fourier transform of complex valued sequences. Numerical algorithms have been worked out and proved to be accurate and efficient : they codes whose element derivative matrices can be explicitly generated. The numerical results of two cases - 2-dimensional portal frame and 3/4-cylindrical shell structure - for the deterministic and stochastic sensitivity analysis illustrates in this paper.

• Journal of Internet Computing and Services
• /
• v.2 no.4
• /
• pp.91-99
• /
• 2001

Since roost of the program execution time is spent in the loop structure, the problem of extracting parallelism from sequential loop has been one of the most important research issues. However. roost programs have Implicit interprocedure parallelism. This paper presents a generalized method extracting parallelism in loops having the procedure calls. Most parallelization of loops having procedure calls focus on the uniform code where data dependency distance is constant. We present algorithms which can be applied to uniform code, nonuniform code, and complex code. The performance of the proposed algorithm, loop extraction, loop embedding and procedure cloning transformation methods have been evaluated using CRAY-T3E. The result shows the effective of the proposed algorithm.