• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.14 no.6
• /
• pp.1289-1298
• /
• 1994

The new p-version crack model is proposed to estimate the stress intensity factors of the thick cracked plate under flexure. The proposed model is based on high order theory and $C^{\circ}$-plate element including shear deformation. The displacements fields are defined by integrals of Legendre polynomials which can be classified into three groups such as basic mode, side mode and internal mode. The computer implementation allows arbitrary variations of p-level Up to a maximum value of 10. The stress intensity factors are computed by virtual crack extention approach. The effects of ratios of thickness to crack length(h/a), crack length to width(a/W) and boundary conditions are investigated. Very good agreement with the existing solution in the literature are shown for the uncracked plate as well as the cracked plate.

• Asian-Australasian Journal of Animal Sciences
• /
• v.31 no.10
• /
• pp.1542-1549
• /
• 2018

Objective: Because lactation periods in dairy cows lengthen with increasing total milk production, it is important to predict individual productivities after 305 days in milk (DIM) to determine the optimal lactation period. We therefore examined whether the random regression (RR) coefficient from 306 to 450 DIM (M2) can be predicted from those during the first 305 DIM (M1) by using a RR model. Methods: We analyzed test-day milk records from 85,690 Holstein cows in their first lactations and 131,727 cows in their later (second to fifth) lactations. Data in M1 and M2 were analyzed separately by using different single-trait RR animal models. We then performed a multiple regression analysis of the RR coefficients of M2 on those of M1 during the first and later lactations. Results: The first-order Legendre polynomials were practical covariates of RR for the milk yields of M2. All RR coefficients for the additive genetic (AG) effect and the intercept for the permanent environmental (PE) effect of M2 had moderate to strong correlations with the intercept for the AG effect of M1. The coefficients of determination for multiple regression of the combined intercepts for the AG and PE effects of M2 on the coefficients for the AG effect of M1 were moderate to high. The daily milk yields of M2 predicted by using the RR coefficients for the AG effect of M1 were highly correlated with those obtained by using the coefficients of M2. Conclusion: Milk production after 305 DIM can be predicted by using the RR coefficient estimates of the AG effect during the first 305 DIM.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.5
• /
• pp.533-541
• /
• 2007

The Zienkiewicz-Zhu(Z/Z) error estimate is slightly modified for the hierarchical p-refinement, and is then applied to L-shaped plates subjected to bending to demonstrate its effectiveness. An adaptive procedure in finite element analysis is presented by p-refinement of meshes in conjunction with a posteriori error estimator that is based on the superconvergent patch recovery(SPR) technique. The modified Z/Z error estimate p-refinement is different from the conventional approach because the high order shape functions based on integrals of Legendre polynomials are used to interpolate displacements within an element, on the other hand, the same order of basis function based on Pascal's triangle tree is also used to interpolate recovered stresses. The least-square method is used to fit a polynomial to the stresses computed at the sampling points. The strategy of finding a nearly optimal distribution of polynomial degrees on a fixed finite element mesh is discussed such that a particular element has to be refined automatically to obtain an acceptable level of accuracy by increasing p-levels non-uniformly or selectively. It is noted that the error decreases rapidly with an increase in the number of degrees of freedom and the sequences of p-distributions obtained by the proposed error indicator closely follow the optimal trajectory.

• Journal of the Korea Concrete Institute
• /
• v.21 no.1
• /
• pp.105-116
• /
• 2009

Reinforced concrete (RC) structures have been most widely used because of their good economic efficiency. However, it is very weak in tensile stresses and difficult to control deflection due to the heavy self-weight of concrete. On the other hand, it is generally known that prestressed concrete structures can be the most effective to overcome the demerits of RC structures by using various tendon lay-out and its amount. In the prestressed concrete members, the inflection points of tendons should be placed effectively for the deflection control and the moment reduction. Therefore, in this study, the equations of tendon profiles are derived in terms of polynomials that satisfy essential conditions of tendon geometries such as inflection points and natural curved shapes of tendons placed in continuous members, from which vertical components of prestressing forces can be also calculated. The derived high order polynomial expression for the distributed shape of the upward and downward forces was transformed to an simplified equivalent uniform vertical force in order to improve the applicability in the calculation of member deflection. The influences of vertical forces by tendons to deflection and moment in a continuous slab were also considered depending on the distance from column face to the location of tendons. The applicability of the proposed method was examined by an example of deflection calculation for the cases of slabs with and without tendons, and the efficiency of deflection control by tendons was also quantitatively estimated.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.4
• /
• pp.343-350
• /
• 2000

In this paper, we propose the Multi-FPNN(Fuzzy Polynomial Neural Networks) model based on FNN and PNN(Polyomial Neural Networks) for optimal system identifacation. Here FNN structure is designed using fuzzy input space divided by each separated input variable, and urilized both in order to get better output performace. Each node of PNN structure based on GMDH(Group Method of Data handing) method uses two types of high-order polynomials such as linearane and quadratic, and the input of that node uses three kinds of multi-variable inputs such as linear and quadratic, and the input of that node and Genetic Algorithms(GAs) to identify both the structure and the prepocessing of parameters of a Multi-FPNN model. Here, HCM clustering method, which is carried out for data preproessing of process system, is utilized to determine the structure method, which is carried out for data preprocessing of process system, is utilized to determance index with a weighting factor is used to according to the divisions of input-output space. A aggregate performance inddex with a wegihting factor is used to achieve a sound balance between approximation and generalization abilities of the model. According to the selection and adjustment of a weighting factor of this aggregate abjective function which it is acailable and effective to design to design and optimal Multi-FPNN model. The study is illustrated with the aid of two representative numerical examples and the aggregate performance index related to the approximation and generalization abilities of the model is evaluated and discussed.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.3
• /
• pp.59-67
• /
• 2013

Reed-Solomon (RS) codes are powerful error-correcting codes used in diverse applications. Recently, algebraic soft-decision decoding algorithm for RS codes that can correct the errors beyond the error correcting bound has been proposed. The algorithm requires very intensive computations for interpolation, therefore an efficient VLSI architecture, which is realizable in hardware with a moderate hardware complexity, is mandatory for various applications. In this paper, we propose an efficient architecture with low hardware complexity for interpolation in soft-decision list decoding of Reed-Solomon codes. The proposed architecture processes the candidate polynomial in such a way that the terms of X degrees are processed in serial and the terms of Y degrees are processed in parallel. The processing order of candidate polynomials adaptively changes to increase the efficiency of memory access for coefficients; this minimizes the internal registers and the number of memory accesses and simplifies the memory structure by combining and storing data in memory. Also, the proposed architecture shows high hardware efficiency, since each module is balanced in terms of latency and the modules are maximally overlapped in schedule. The proposed interpolation architecture for the (255, 239) RS list decoder is designed and synthesized using the DongbuHitek $0.18{\mu}m$ standard cell library, the number of gate counts is 25.1K and the maximum operating frequency is 200 MHz.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.1
• /
• pp.123-136
• /
• 2004

In this paper, complexity and regularity of polynomial multiplication over $GF({2^n})$ are defined by using Hamming weight of rows and columns of the matrix ever GF(2) which represents polynomial multiplication. It is shown experimentally that in order to construct the block cipher robust against differential cryptanalysis, polynomial multiplication of substitution layer and the permutation layer should have high complexity and high regularity. With result of the experiment, a way of constituting S box and G function is suggested in the block cipher whose structure is similar to SEED, which is KOREA standard of 128-bit block cipher. S box can be formed with a nonlinear function and an affine transform. Nonlinear function must be strong with differential attack and linear attack, and it consists of an inverse number over $GF({2^8})$ which has neither a fixed pout, whose input and output are the same except 0 and 1, nor an opposite fixed number, whose output is one`s complement of the input. Affine transform can be constituted so that the input/output correlation can be the lowest and there can be no fixed point or opposite fixed point. G function undergoes linear transform with 4 S-box outputs using the matrix of 4${\times}$4 over $GF({2^8})$. The components in the matrix of linear transformation have high complexity and high regularity. Furthermore, G function can be constituted so that MDS(Maximum Distance Separable) code can be formed, SAC(Strict Avalanche Criterion) can be met, and there can be no weak input where a fixed point an opposite fixed point, and output can be two`s complement of input. The primitive polynomials of nonlinear function affine transform and linear transformation are different each other. The S box and G function suggested in this paper can be used as a constituent of the block cipher with high security, in that they are strong with differential attack and linear attack with no weak input and they are excellent at diffusion.