• Structural Engineering and Mechanics
• /
• v.9 no.6
• /
• pp.557-568
• /
• 2000

As time-variant reliability approaches become increasingly used for service life prediction of the aging infrastructure, the demand for computer solution methods continues to increase. Effcient computer techniques have become well established for the reliability analysis of structural systems. Thus far, however, this is largely limited to time-invariant reliability problems. Therefore, the requirements for time-variant reliability prediction of deteriorating structural systems under time-variant loads have remained incomplete. This study presents a computer program for $\underline{REL}$iability of $\underline{T}$ime-Variant $\underline{SYS}$tems, RELTSYS. This program uses a combined technique of adaptive importance sampling, numerical integration, and fault tree analysis to compute time-variant reliabilities of individual components and systems. Time-invariant quantities are generated using Monte Carlo simulation, whereas time-variant quantities are evaluated using numerical integration. Load distribution and post-failure redistribution are considered using fault tree analysis. The strengths and limitations of RELTSYS are presented via a numerical example.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.181-195
• /
• 2006

Resource-constrained project scheduling problems with variant processes can be represented and solved using a logic-based terminological language called RSV (resource constrained project scheduling with variant processes). We consider three different variants for formalizing the RSV-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the RSV- problem is NP-complete. Further we show that the optimizing variant (or number variant) of the RSV-problem is computable in polynomial time iff. the decision variant is computable in polynomial time.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.1
• /
• pp.20-28
• /
• 2012

We define a language $\mathcal{RS}$, a subclass of the scheduling language $\mathcal{RS}V$ (resource constrained project scheduling with variant processes). $\mathcal{RS}$ involves the determination of the starting times for ground activities of a project satisfying precedence and resource constraints, in order to minimize the total project duration. In $\mathcal{RS}$ ground activities and two structural symbols (operators) 'seq' and 'pll' are used to construct activity-terms representing scheduling problems. We consider three different variants for formalizing the $\mathcal{RS}$-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the problem $\mathcal{RS}$ is $\mathcal{NP}$-complete. Further we show that the optimizing variant (or number variant) of the $\mathcal{RS}$-problem is computable in polynomial time iff the decision variant is computable in polynomial time.

• Smart Structures and Systems
• /
• v.32 no.1
• /
• pp.9-21
• /
• 2023

The parameters of civil engineering structures have time-variant characteristics during their service. When extremely large external excitations, such as earthquake excitation to buildings or overweight vehicles to bridges, apply to structures, sudden or gradual damage may be caused. It is crucially necessary to detect the occurrence time and severity of the damage. The unscented Kalman filter (UKF), as one efficient estimator, is usually used to conduct the recursive identification of parameters. However, the conventional UKF algorithm has a weak tracking ability for time-variant structural parameters. To improve the identification ability of time-variant parameters, an adaptive UKF with forgetting factor (AUKF-FF) algorithm, in which the state covariance, innovation covariance and cross covariance are updated simultaneously with the help of the forgetting factor, is proposed. To verify the effectiveness of the method, this paper conducted two case studies as follows: the identification of time-variant parameters of a simply supported bridge when the vehicle passing, and the model updating of a six-story concrete frame structure with field test during the Yangbi earthquake excitation in Yunnan Province, China. The comparison results of the numerical studies show that the proposed method is superior to the conventional UKF algorithm for the time-variant parameter identification in convergence speed, accuracy and adaptability to the sampling frequency. The field test studies demonstrate that the proposed method can provide suggestions for solving practical problems.

• Structural Engineering and Mechanics
• /
• v.5 no.2
• /
• pp.115-126
• /
• 1997

Importance sampling methods have been developed with the aim of reducing the computational costs inherent in Monte Carlo methods. This study proposes a new algorithm called the adaptive kernel method which combines and modifies some of the concepts from adaptive sampling and the simple kernel method to evaluate the structural reliability of time variant problems. The essence of the resulting algorithm is to select an appropriate starting point from which the importance sampling density can be generated efficiently. Numerical results show that the method is unbiased and substantially increases the efficiency over other methods.

• Journal of Biosystems Engineering
• /
• v.26 no.6
• /
• pp.503-508
• /
• 2001

In this paper, time-fiequency analysis and multi-dimensional spectral analysis methods are applied for source identification and diagnosis of non-stationary sound/vibration signals. Sound or vibration problems of general vehicle and agricultural machinary are under 500 Hz. So We used linearly increased chirp signals under 500 Hz. By checking the coherences on concerned time, fur time-variant non-stationary signals, this simulation it very well coincident to expected results.

• Journal of Ocean Engineering and Technology
• /
• v.24 no.6
• /
• pp.1-6
• /
• 2010

A far field approximate solution of the slowly varying force on a 3 dimensional offshore structure in gravity ocean waves is presented. The first order potential, or at least the far field form of the Kochin function, of each frequency wave is assumed to be known. The momentum flux of the fluid domain is formulated to find the time variant force acting on the floating body in bichromatic waves. The second order difference frequency force is identified and extracted from the time variant force. The final solution is expressed as the circular integration of the product of Kochin functions. The limiting form of the slowly varying force is identical to the mean drift force. It shows that the slowly varying force components caused by the body disturbance potential can be evaluated at the far field.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8A
• /
• pp.815-820
• /
• 2008

Carrier frequency offset (CFO) is one of the most important problems in an orthogonal frequency division multiplexing (OFDM) system, which seriously degrades the performance of the systems due to its time-variant behavior. In this paper, the performance of a pilot-assisted fine CFO estimator in OFDM-based mobile WiMAX systems is analyzed. Analytical closed-form expression of the mean square error (MSE) of the post-FFT based CFO synchronization scheme is reported for time-variant fading channels. Taking into account the frame structure of the IEEE802.16e standard, simulation results are used to verify the theoretical analysis developed in this paper.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.12-15
• /
• 2007

Online parallel machine scheduling problems have been studied by many researchers and enormous results are appeared in the last 40 years. With the development of scheduling theory and application, new online scheduling problems where the partial information is known in advance, that is, semi-online, gained much interest due to their increased application in practice. So we consider the online scheduling of three machines with general eligibility and its semi-online variant where the total processing time is known in advance. For the online and semi-online problems, we develop algorithms with competitive ratio of 5/2 which are shown to be optimal.

• ETRI Journal
• /
• v.28 no.1
• /
• pp.31-44
• /
• 2006

In a packet switching network, congestion is unavoidable and affects the quality of real-time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well-known solutions for quality-of-service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.