• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.2
• /
• pp.173-179
• /
• 2009

Reduction scheme is remarkably useful in the case requiring the repeated calculation procedure. Recently, the efficiency of the reduction scheme has been improved by combining scheme of sub-domain method. But, when the global domain is partitioned into a few sub-domains, sub-domains without constraints can be produced. it is needed to extract the ritz vector from each sub-domain to construct the reduced system of each sub-domain. it is easy to extract the ritz vector from sub-domain with constraint. on the other hand, pseudo inverse method should be employed to extract the ritz vector from sub-domain without constraint. generally, the pseudo inverse takes a large number of computing time to obtain a reduced system of a sub-domain without boundary condition. This trouble can be overcome by the reduced pseudo inverse scheme which proposed in this study. This scheme is based on the static condensation that is not related with selection of the primary degrees of freedom. Numerical examples demonstrate that present method saves computational cost effectively. In addition, it is shown that the reduced system based on the proposed scheme predicts the accurate eigenvalues of global system.

• Journal of information and communication convergence engineering
• /
• v.16 no.3
• /
• pp.166-172
• /
• 2018

A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It’s a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.7
• /
• pp.526-531
• /
• 2003

Recently, many BIST(Built-in Self Test) schemes have been researched to reduce test time and hardware. But, most BIST schemes about pattern generation are for deterministic pattern generation. In this paper a new pseudo-random BIST scheme is provided to reduce the existing test hardware and keep a reasonable length of test time. Theoretical study demonstrates the possibility of the reduction of the hardware for pseudo-random test with some explanations and examples. Also the experimental results show that in the proposed test scheme the hardware for the pseudo-random test is much less than in the previous scheme and provide comparison of test time between the proposed scheme and the current one.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.8
• /
• pp.610-618
• /
• 2003

Recently, many deterministic built-in self-test schemes to reduce test time have been researched. These schemes can achieve a good quality test by shortening the whole test process, but require complex algorithms or much hardware. In this paper, a new deterministic BIST scheme is provided that reduces the additional hardware requirements, as well as keeping test time to a minimum. The proposed BIST (Built-In Self-Test) methodology brings about the reduction of the hardware requirements for pseudo-random tests as well. Theoretical study demonstrates the possibility of reducing the hardware requirements for both pseudo-random and deterministic tests, with some explanations and examples. Experimental results show that in the proposed test scheme the hardware requirements for the pseudo-random test and deterministic test are less than in previous research.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.10 no.3
• /
• pp.29-38
• /
• 1990

A totally, new approach of Lagrangian formulation named 'Pseudo Lagrangian Formulation(PLF)' for large deformation analysis of continue and structures by the finite of element method has been presented, and the efficiency and accuracy of nonlinear analysis beam element formulated by PLF has been discussed by solving several numerical examples. In PLF, the deformation of a body is maeasured by assigning a nonphysical 'Pseudo' configuration as reference. The Lagrangian deformation and the finite element mapping of the traditonal Lagrangian approaches are then carried out directly at the same time, The result of numerical tests shows superior performance of PLF to the traditional Lagrangian methods, Applications of PLF to small and finite deformation problems indicate that PLF not only serves as an alternative but has certain implementational advantages over total or updated Lagrangian formulations.

• Journal of Ocean Engineering and Technology
• /
• v.23 no.6
• /
• pp.131-135
• /
• 2009

We present an optimum design method for a rectangular reinforced concrete beam using Genetic Algorithms. The optimum design procedure in this paper employs 2 design cases: i) all of the design variables (b, d, As) of the rectangular reinforced concrete section are used pseudo-continuously, ii) one is pseudo-continuous for the concrete cross section (b, d) and the other is discrete, using an index for the steel area (As). The optimum design in this paper uses Chakrabarty's model. In this paper, the Genetic Algorithms use the method of Elitism and penalty parameters to improve the fitness in the reproduction process, which leads to very practical designs. The optimum design of the steel area in the examples uses ASTM standard reinforcing bars (#3~#11, #14, #18).

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.10
• /
• pp.899-906
• /
• 2004

In this paper, fault tolerant algorithm is presented for a servo manipulator system. For fault tolerance of a servo manipulator system, reconfiguration algorithm accommodating a motor's failure has been presented. The algorithm considers a transport's degree of freedoms as redundant joints of a servo manipulator. The reconfiguration algorithm recovers the end effector's motion in spite of one motor's failure A modified pseudo inverse redistribution method has been proposed for the reconfiguration algorithm. Numerical examples and hardware tests have been presented to verify the proposed methods.

• Steel and Composite Structures
• /
• v.14 no.6
• /
• pp.605-620
• /
• 2013

This paper provides an innovative iteration technique for the large deflection problem of annular plate. After some manipulation, the problem is reduced to a couple of ODEs (ordinary differential equation). Among them, one is derived from the plane stress problem for plate, and other is derived from the bending of plate. Since the large deflection for plate is assumed in the problem, the relevant non-linear terms appear in the resulting ODEs. The pseudo-linearization procedure is suggested to solve the problem and the nonlinear ODEs can be solved in the way for the solution of linear ODE. To obtain the final solution, it is necessary to use the iteration. Several numerical examples are provided. In the study, the assumed value for non-dimensional loading is larger than those in the available references.

• The Korean Journal of Applied Statistics
• /
• v.25 no.6
• /
• pp.947-958
• /
• 2012

When modeling event times in biomedical studies, the outcome might be incompletely observed. In this paper, we assume that the outcome is recorded as current status failure time data. Despite well-developed literature the routine practical use of many current status data modeling methods remains infrequent due to the lack of specialized statistical software, the difficulty to assess model goodness-of-fit, as well as the possible loss of information caused by covariate grouping or discretization. We propose a model based on pseudo-observations that is convenient to implement and that allows for flexibility in the choice of the outcome. Parameter estimates are obtained based on generalized estimating equations. Examples from studies in bile duct hyperplasia and breast cancer in conjunction with simulated data illustrate the practical advantages of this model.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06a
• /
• pp.674-679
• /
• 1994

Acoustic signal such as speech and scattered sound, are generally a nonstationary process whose frequency contents vary at any instant of time. For time-varying signal, whether a nonstationary or a deterministic transient signal, a traditional frequency domain representation does not reveal the contents of signal characteristics and may lead to erroneous results such as the loss of desired characteristics features or the mis-interpretation for a wrong conclusion. A time-frequency domain representation is needed to characterize such signatures. Pseudo Wigner-Ville distribution (PWVD) is ideally suited for portraying nonstationary signal time-frequency domain and carried out by adapting the fast Fourier transform algorithm. In this paper, the important properties of PWVD were investigated using both stationary and nonstationry signatures by numerical examples PWVD was applied to acoustic sigtnatures to demonstrate its application for time-ferquency domain analysis.