• Structural Engineering and Mechanics
• /
• v.80 no.6
• /
• pp.711-726
• /
• 2021

This paper presents a multiple parameters-based recursive methodology for the reliability quantification of civil structures subjected to meteorological disasters. Recognizing the challenge associated with characterizing at a single stroke all the meteorological disasters that may hit a structure during its service life, the proposed methodology by contrast features a multiparameter recursive mechanism to describe the meteorological demand of the structure. The benefit of the arrangements is that the essentially inevitable deviation of the practically observed meteorological data from those in the existing model can be mitigated in an adaptive manner. In particular, the implications of potential climate change to the relevant reliability of civil structures are allowed for. The application of the formulated methodology of recursive reliability quantification is illustrated by first considering the reliability quantification of a linear shear frame against simulated strong wind loads. A parametric study is engaged in this application to examine the effect of some hyperparameters in the configured hierarchical model. Further, the application is extended to a nonlinear hysteretic shear frame involving some field-observed cyclone data, and the incompleteness of the relevant structural diagnosis data that may arise in reality is taken into account. Also investigated is another application scenario where the reliability of a building envelope is assessed under hailstone impacts, and the emphasis is to demonstrate the recursive incorporation of newly obtained meteorological data.

• Proceedings of the KIEE Conference
• /
• 1979.08a
• /
• pp.166-167
• /
• 1979

Performances of three computational algorithms for one-dimensional frequency filtering are compared and tradeoffs are studied. If the size of the filter impulse response is small, it is well-known that the conventional convolution is superior than the FFT convolution. If the size of the impulse response is large, it was suggested that the recursive filter might be competitive in terms of speed to the FFT convolution. We, therefore, have developed an computational, algorithm for the recursive filter to compare the speed advantages over the FFT convolution and the results are presented.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.1107-1112
• /
• 2015

A recursive family $\{F_n\}$ of holomorphic functions on the Riemann sphere is defined and some elementary properties of this family is described. Then the Julia set of $F_n$ is computed. Finally this family as a real recursive family is studied and it is shown that $F_n$ is chaotic on a specific subset of $\mathbb{R}$.

• Journal of the Korean Statistical Society
• /
• v.28 no.3
• /
• pp.297-309
• /
• 1999

A sequential procedure of fixed-width confidence intervals for quantiles satisfying a condition of coverage probability is provided based on recursive density estimators. It is shown that the proposed sequential procedure is asymptotically efficient. In addition, the asymptotic normality for the proposed stopping time is derived.

• Korean Journal of Logic
• /
• v.7 no.1
• /
• pp.1-22
• /
• 2004

The Kantian idea that some judgments are synthetic even in the area of a priori judgments cannot be accepted in its original version, but a modification of the notions 'analytic' and 'synthetic' discovers a rational core of that idea. The new definition of 'analytic' concerns concepts and makes it possible to distinguish between analytic concepts, which are effective ways of computing recursive functions, and synthetic concepts, which either define non-recursive functions, or define recursive functions in an ineffective way. To justify this claim we have to construe concepts as abstract procedures not reducible to set-theoretical entities.

• Journal of the Korean Geophysical Society
• /
• v.4 no.4
• /
• pp.231-238
• /
• 2001

In this paper, an efficient LP method ofr discrete harmonic spectra is proposed and discussed. A new efficient LP method is a combination of recursive and frequency selective LP. While the recursive LP provides better spectral matching in spectral hills, frequency selective LP eliminates numerical instability and improves spectral matching when the harmonics are confined in the low frequncy region. The proposed LP method is applied to the HILN coder. Simulation results using a verification model(VM) software for real audio signals show a definite trend of significant improvement.

• Journal of the Korea Society for Simulation
• /
• v.4 no.2
• /
• pp.79-92
• /
• 1995

In this paper we present an efficient parallel simulation algorithm in recursive feedforward network(RFN) which can reduce the simulation delay while decreasing the number of null messages compared to the previous result. As a preprocessing step, we first determine the group and type of each oupput channel for the nodes using DFS(Depth First Search) algorithm, and show that the number of null messages as well as the simulation scheme. By the new scheme we decide if null messages are sent to the output channels or not according to the group to which it belongs.

• The Journal of the Acoustical Society of Korea
• /
• v.25 no.2E
• /
• pp.43-48
• /
• 2006

Abstract-Using the recursive generalized eigendecomposition method, we develop a recursive form solution to the data least squares (DLS) problem, in which the error is assumed to lie in the data matrix only. Simulations demonstrate that DLS outperforms ordinary least square for certain types of deconvolution problems.

• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.99-103
• /
• 2003

In this note we find the exact Probability distribution of d$\_$n, i/ the outdegree of the node i, in a random recursive tree with n nodes. For i = i$\_$n/ increasing as a linear function on n, we show that d$\_$n/,i$\_$n/ is asymptotically normal.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.651-654
• /
• 1999

This paper investigates the varying characteristics of the performance degradation resulting from the different combination of wordlength in fixed-point implementation of recursive sinusoidal transform. The performance degradation is analytically derived in the form of noise-to-signal power ratio. The best wordlength combination is shown to be the equal length distribution of the given number of bits between the transform coefficients and the data. The analysis results are also verified through the computer simulations.