Explosion pressure prediction via polynomial mathematical correlation based on advanced CFD Modelling

Computational Fluid Dynamics CFD can be used as a powerful tool supporting engineers throughout the steps of the design. The combination of CFD with response surface methodology can play an important role in such cases. During the conceptual engineering design phase, a quick response is always a matter of urgency. During this phase even a sketch of the geometrical model is rare. Therefore, the utilisation of typical response surface developed for congested and confined environment rather than CFD can be an important tool to help the decision making process, when the geometrical model is not available, provided that similarities can be considered when taking into account the characteristic of the geometry in which the response surface was developed. The present work investigates how three different types of response surfaces behave when predicting overpressure in accidental scenarios based on CFD input. First order, partial second order and complete second order polynomial expressions are investigated. The predicted results are compared with CFD findings for a classical offshore experiment conducted by British Gas on behalf of Mobil and good agreement is observed for higher order response surfaces. The higher order response surface calculations are also compared with CFD calculations for a typical offshore module and good agreement is also observed. © 2011 Elsevier Ltd.

Robust network reconstruction in polynomial time

This paper presents an efficient algorithm for robust network reconstruction of Linear Time-Invariant (LTI) systems in the presence of noise, estimation errors and unmodelled nonlinearities. The method here builds on previous work [1] on robust reconstruction to provide a practical implementation with polynomial computational complexity. Following the same experimental protocol, the algorithm obtains a set of structurally-related candidate solutions spanning every level of sparsity. We prove the existence of a magnitude bound on the noise, which if satisfied, guarantees that one of these structures is the correct solution. A problem-specific model-selection procedure then selects a single solution from this set and provides a measure of confidence in that solution. Extensive simulations quantify the expected performance for different levels of noise and show that significantly more noise can be tolerated in comparison to the original method. © 2012 IEEE.

Designing folding rings using polynomial continuation

© 2014 by ASME. Two types of foldable rings are designed using polynomial continuation. The first type of ring, when deployed, forms regular polygons with an even number of sides and is designed by specifying a sequence of orientations which each bar must attain at various stages throughout deployment. A design criterion is that these foldable rings must fold with all bars parallel in the stowed position. At first, all three Euler angles are used to specify bar orientations, but elimination is also used to reduce the number of specified Euler angles to two, allowing greater freedom in the design process. The second type of ring, when deployed, forms doubly plane-symmetric (irregular) polygons. The doubly symmetric rings are designed using polynomial continuation, but in this example a series of bar end locations (in the stowed position) is used as the design criterion with focus restricted to those rings possessing eight bars.

on quadratic bent functions in polynomial forms

In this correspondence, we construct some new quadratic bent functions in polynomial forms by using the theory of quadratic forms over finite fields. The results improve some previous work. Moreover, we solve a problem left by Yu and Gong in 2006.

LEAST-SQUARES POLYNOMIAL SMOOTHING FOR INDUCTIVELY COUPLED PLASMA ATOMIC EMISSION-SPECTRA

The use of least-squres polynomial smoothing in ICP-AES is discussed and a method of points insertion into spectral scanning intervals is proposed in the present paper. Optimal FWHM/SR ratio can be obtained, and distortion of smoothed spectra can be avoided by use of the recommended method.

Permutation Tests for Classification

We introduce and explore an approach to estimating statistical significance of classification accuracy, which is particularly useful in scientific applications of machine learning where high dimensionality of the data and the small number of training examples render most standard convergence bounds too loose to yield a meaningful guarantee of the generalization ability of the classifier. Instead, we estimate statistical significance of the observed classification accuracy, or the likelihood of observing such accuracy by chance due to spurious correlations of the high-dimensional data patterns with the class labels in the given training set. We adopt permutation testing, a non-parametric technique previously developed in classical statistics for hypothesis testing in the generative setting (i.e., comparing two probability distributions). We demonstrate the method on real examples from neuroimaging studies and DNA microarray analysis and suggest a theoretical analysis of the procedure that relates the asymptotic behavior of the test to the existing convergence bounds.

Information sets and partial permutation decoding for codes from finite geometries

Mavron, Vassili; McDonough, T.P.; Key, J.D., (2006) 'Information sets and partial permutation decoding for codes from finite geometries', Finite Fields and their applications 12(2) pp.232-247 RAE2008

On the Performance of Polynomial-time CLIQUE Approximation Algorithms on Very Large Graphs

The performance of a randomized version of the subgraph-exclusion algorithm (called Ramsey) for CLIQUE by Boppana and Halldorsson is studied on very large graphs. We compare the performance of this algorithm with the performance of two common heuristic algorithms, the greedy heuristic and a version of simulated annealing. These algorithms are tested on graphs with up to 10,000 vertices on a workstation and graphs as large as 70,000 vertices on a Connection Machine. Our implementations establish the ability to run clique approximation algorithms on very large graphs. We test our implementations on a variety of different graphs. Our conclusions indicate that on randomly generated graphs minor changes to the distribution can cause dramatic changes in the performance of the heuristic algorithms. The Ramsey algorithm, while not as good as the others for the most common distributions, seems more robust and provides a more even overall performance. In general, and especially on deterministically generated graphs, a combination of simulated annealing with either the Ramsey algorithm or the greedy heuristic seems to perform best. This combined algorithm works particularly well on large Keller and Hamming graphs and has a competitive overall performance on the DIMACS benchmark graphs.

Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy

It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether a given quantum basis state appears with nonzero amplitude in a superposition, or whether a given quantum bit has positive expectation value at the end of a quantum computation. This result is achieved by showing that the complexity class NQP of Adleman, Demarrais, and Huang, a quantum analog of NP, is equal to the counting class coC=P.