This paper introduces the concept of safety-related (SR) uncertainty and the methodology to measure SR uncertainty. SR uncertainty is concerned with the effect of parameter uncertainty on the uncertainty of system unsafety (defined with respect to achieved safety integrity level), which is in direct contrast to the effect on overall system uncertainty. The properties of SR uncertainty are discu...

The aim of this paper is to investigate the methods of maintaining desired flow conditions in the reaches of the ecologically valuable upper reaches of the River Narew taking into account the uncertainty in modelling process. The study is based on Global Sensitivity Analysis (GSA) and Generalised Likelihood Uncertainty Estimation (GLUE) techniques applied to a 1-D river flow model. We compare s...

Many mathematical and computational models used in engineering produce multivariate output that shows some degree of correlation. However, conventional approaches to Global Sensitivity Analysis (GSA) assume that the output variable is scalar. These approaches are applied on each output variable leading to a large number of sensitivity indices that shows a high degree of redundancy making the in...

A global boundary defensive k-alliance in a graph G = (V,E) is a dominating set S of vertices of G with the property that every vertex in S has k more neighbors in S than it has outside of S. A global boundary offensive k-alliance in a graph G is a set S of vertices of G with the property that every vertex in V − S has k more neighbors in S than it has outside of S. We define a global boundary ...

This paper examines the efficient variance-based global sensitivity analysis (GSA), quantified by estimating first-/higher-order and total-effect Sobol’ indices, for applications involving complex numerical models high-dimensional outputs. Two different, recently developed, techniques are combined to address associated challenges. Principal component (PCA) is first considered as a dimensionalit...

A global offensive alliance in a graph G is a set S of vertices with the property that every vertex not belonging to S has at least one more neighbor in S than it has outside of S. The global offensive alliance number of G, γo(G), is the minimum cardinality of a global offensive alliance in G. A set S of vertices of a graph G is a dominating set for G if every vertex not belonging to S has at l...

Presently, the introduction of intelligent models to optimize structural problems has become an important issue in civil engineering and almost all other fields of engineering. Optimization models in artificial intelligence have enabled us to provide powerful and practical solutions to structural optimization problems. In this study, a novel method for optimizing structures as well as solving s...

Global optimization is widely used in various aspects both in industry and academia. Although different methods in operations research have been proposed to solve the global optimization, simulated annealing and its variations have been favored for their simplicity in the implementation. In order to reach the global optimum from the current solution, a walking mechanism must be planned so that ...

Gravitational search algorithm (GSA) is a new member of swarm intelligence algorithms. It stems from Newtonian law of gravity and motion. The performance of synchronous GSA (S-GSA) and asynchronous GSA (A-GSA) is studied here using statistical analysis. The agents in S-GSA are updated synchronously, where the whole population is updated after each member’s performance is evaluated. On the other...

A global offensive alliance in a graph G = (V,E) is a subset S of V such that for every vertex v not in S at least half of the vertices in the closed neighborhood of v are in S. We give an upper bound on the global offensive alliance number of a graph in terms of its degree sequence. We also study global offensive alliances of random graphs.