• Computers and Concrete
• /
• v.27 no.2
• /
• pp.175-184
• /
• 2021

The incorporation of pozzolans to Portland cement pastes adds value in the development of new materials for the construction industry. This study presents a new computational method, complementary to the pozzolanic identification by compressive strength at 28 days method, for supporting the validation of pozzolanic mortars for non-structural purposes. An algorithm capable of classifying the pixels of micrographs of specimens fragments was developed. Therefore, comparative analyses were generated from fractional Gaussian representations in four intervals of the same amplitude that indicated the predispositions to form larger void indices (intervals 1 and 2). The results showed that the computational method indicators are in accordance with the physical and chemical indicators.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.2141-2155
• /
• 2020

In order to meet the requirements of background change, illumination variation, moving shadow interference and high accuracy in object detection of moving camera, and strive for real-time and high efficiency, this paper presents an object detection algorithm based on sparse approximation recursion and sparse coding migration in subspace. First, low-rank sparse decomposition is used to reduce the dimension of the data. Combining with dictionary sparse representation, the computational model is established by the recursive formula of sparse approximation with the video sequences taken as subspace sets. And the moving object is calculated by the background difference method, which effectively reduces the computational complexity and running time. According to the idea of sparse coding migration, the above operations are carried out in the down-sampling space to further reduce the requirements of computational complexity and memory storage, and this will be adapt to multi-scale target objects and overcome the impact of large anomaly areas. Finally, experiments are carried out on VDAO datasets containing 59 sets of videos. The experimental results show that the algorithm can detect moving object effectively in the moving camera with uniform speed, not only in terms of low computational complexity but also in terms of low storage requirements, so that our proposed algorithm is suitable for detection systems with high real-time requirements.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.57-62
• /
• 2011

In this paper an efficient LT decoding scheme using GE triangularization is proposed. The proposed algorithm has the desirable performance in terms of both overhead and computational complexity. Belief propagation algorithm is a fast and simple decoding scheme for LT codes. However, for a small code block length k, it requires a large overhead to decode, and OFG which has a small overhead has a large computational complexity. Simulation results show that the proposed algorithm noticeably reduces the computational complexity by more than 1/5 with respect to that of OFG and also its overhead has a small value about 1~5%.

• Advances in aircraft and spacecraft science
• /
• v.4 no.3
• /
• pp.297-316
• /
• 2017

With rapid growth in the complexity of large scale engineering systems, the application of multidisciplinary analysis and design optimization (MDO) in the engineering design process has garnered much attention. MDO addresses the challenge of integrating several different disciplines into the design process. Primary challenges of MDO include computational expense and poor scalability. The introduction of a distributed, collaborative computational environment results in better utilization of available computational resources, reducing the time to solution, and enhancing scalability. SORCER, a Java-based network-centric computing platform, enables analyses and design studies in a distributed collaborative computing environment. Two different optimization algorithms widely used in multidisciplinary engineering design-VTDIRECT95 and QNSTOP-are implemented on a SORCER grid. VTDIRECT95, a Fortran 95 implementation of D. R. Jones' algorithm DIRECT, is a highly parallelizable derivative-free deterministic global optimization algorithm. QNSTOP is a parallel quasi-Newton algorithm for stochastic optimization problems. The purpose of integrating VTDIRECT95 and QNSTOP into the SORCER framework is to provide load balancing among computational resources, resulting in a dynamically scalable process. Further, the federated computing paradigm implemented by SORCER manages distributed services in real time, thereby significantly speeding up the design process. Part 1 covers SORCER and the algorithms, Part 2 presents results for aircraft panel design with curvilinear stiffeners.

• Advances in aircraft and spacecraft science
• /
• v.4 no.3
• /
• pp.317-334
• /
• 2017

With rapid growth in the complexity of large scale engineering systems, the application of multidisciplinary analysis and design optimization (MDO) in the engineering design process has garnered much attention. MDO addresses the challenge of integrating several different disciplines into the design process. Primary challenges of MDO include computational expense and poor scalability. The introduction of a distributed, collaborative computational environment results in better utilization of available computational resources, reducing the time to solution, and enhancing scalability. SORCER, a Java-based network-centric computing platform, enables analyses and design studies in a distributed collaborative computing environment. Two different optimization algorithms widely used in multidisciplinary engineering design-VTDIRECT95 and QNSTOP-are implemented on a SORCER grid. VTDIRECT95, a Fortran 95 implementation of D. R. Jones' algorithm DIRECT, is a highly parallelizable derivative-free deterministic global optimization algorithm. QNSTOP is a parallel quasi-Newton algorithm for stochastic optimization problems. The purpose of integrating VTDIRECT95 and QNSTOP into the SORCER framework is to provide load balancing among computational resources, resulting in a dynamically scalable process. Further, the federated computing paradigm implemented by SORCER manages distributed services in real time, thereby significantly speeding up the design process. Part 1 covers SORCER and the algorithms, Part 2 presents results for aircraft panel design with curvilinear stiffeners.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.2
• /
• pp.166-172
• /
• 2005

With the development of RAIM techniques for single failure, increasing interest has been shown in the multiple failure problem. As a result, numerous approaches have been used in attempts to tackle this problem. This paper considers the two failure problem with total least squares (TLS) technique, a solution that has rarely been addressed because TLS requires an immense number of computations. In this paper, the special form of the observation matrix H, (that is, one column is exactly known) is exploited so as to develop an algorithm in a sequential form, thereby reducing computational load. The algorithm permits the advantages of TLS without the excessive computational burden. The proposed algorithm is verified through a numerical simulation.

• Journal of Mechanical Science and Technology
• /
• v.16 no.8
• /
• pp.1033-1038
• /
• 2002

Genetic alsorithm (GA) , compared to the gradient-based optimization, has advantages of convergence to a global optimized solution. The genetic algorithm requires so many number of analyses that may cause high computational cost for genetic search. This paper proposes a personal computer network programming based on TCP/IP protocol and client-server model using socket, to improve processing speed of the genetic algorithm for optimization of composite laminated structures. By distributed processing for the generated population, improvement in processing speed has been obtained. Consequently, usage of network-based genetic algorithm with the faster network communication speed will be a very valuable tool for the discrete optimization of large scale and complex structures requiring high computational cost.

• Structural Engineering and Mechanics
• /
• v.47 no.5
• /
• pp.713-727
• /
• 2013

In current study, natural frequency response of fiber metal laminated (FML) fibrous composite panels is optimized under different combination of the three classical boundary conditions using particle swarm optimization (PSO) algorithm and finite strip method (FSM). The ply angles, numbers of layers, panel length/width ratios, edge conditions and thickness of metal sheets are chosen as design variables. The formulation of the panel is based on the classical laminated plate theory (CLPT), and numerical results are obtained by the semi-analytical finite strip method. The superiority of the PSO algorithm is demonstrated by comparing with the simple genetic algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2627-2631
• /
• 2003

With the development of RAIM techniques for single failure, there has been increasing interest in the multiple failure problem. There have been many approaches to tackle the problem from various points of view. This paper approaches to two failure problem with total least squares (TLS) technique, which has rarely been addressed because TLS requires a great number of computations. In this paper, the special form of the observation matrix H, that is, one column is exactly known, is exploited so as to develop an algorithm in a sequential form, which reduces computational burden. The algorithm makes us enjoy the advantages of TLS without much computational burden. The proposed algorithm is verified through a numerical simulation.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.04b
• /
• pp.177-186
• /
• 2000

An improved multi-level（IML) optimization algorithm using automatic differentiation (AD) for multi-objective optimum design of framed structures is proposed in this paper. In order to optimize the steel frames under seismic load, two main objective functions need to be considered for minimizing the structural weight and maximizing the strain energy. For the efficiency of the proposed algorithm, multi-level optimization techniques using decomposition method that separately utilizes both system-level and element-level optimizations and an artificial constraint deletion technique are incorporated in the algorithm. And also to save the numerical efforts, an efficient reanalysis technique through approximated structural responses such as moments, frequencies, and strain energy with respect to intermediate variables is proposed in the paper. Sensitivity analysis of dynamic structural response is executed by AD that is a powerful technique for computing complex or implicit derivatives accurately and efficiently with minimal human effort. The efficiency and robustness of the IML algorithm, compared with a plain multi-level (PML) algorithm, is successfully demonstrated in the numerical examples.