Analytical and numerical solutions for the time and space-symmetric fractional diffusion equation

We consider a time and space-symmetric fractional diffusion equation (TSS-FDE) under homogeneous Dirichlet conditions and homogeneous Neumann conditions. The TSS-FDE is obtained from the standard diffusion equation by replacing the first-order time derivative by the Caputo fractional derivative and the second order space derivative by the symmetric fractional derivative. Firstly, a method of separating variables is used to express the analytical solution of the tss-fde in terms of the Mittag–Leffler function. Secondly, we propose two numerical methods to approximate the Caputo time fractional derivative, namely, the finite difference method and the Laplace transform method. The symmetric space fractional derivative is approximated using the matrix transform method. Finally, numerical results are presented to demonstrate the effectiveness of the numerical methods and to confirm the theoretical claims.

Response of tall buildings with symmetric setbacks under blast loading

This study explores three-dimensional nonlineardynamic responses of typical tall buildings with and without setbacks under blast loading. These 20 storey reinforced concrete buildings have been designed for normal (dead, live and wind)loads. The influence of the setbacks on the lateral load response due to blasts in terms of peak deflections, accelerations, inter-storey drift and bending moments at critical locations (including hinge formation) were investigated. Structural response predictions were performed with a commercially available three-dimensional finite element analysis programme using non-linear direct integration time history analyses. Results obtained for buildings with different setbacks were compared and conclusions made. The comparisons revealed that buildings have setbacks that protect the tower part above the setback level from blast loading show considerably better response in terms of peak displacement and interstorey drift, when compared to buildings without setbacks. Rotational accelerations were found to depend on the periods of the rotational modes. Abrupt changes in moments and shears are experienced near the levels of the setbacks. Typical twenty storey tall buildings with shear walls and frames that are designed for only normaln loads perform reasonably well, without catastrophic collapse, when subjected to a blast that is equivalent to 500 kg TNT at a standoff distance of 10 m.

Design of decoupling networks for circulant symmetric antenna arrays

Small element spacing in compact arrays results in strong mutual coupling between array elements. Performance degradation associated with the strong coupling can be avoided through the introduction of a decoupling network consisting of interconnected reactive elements. We present a systematic design procedure for decoupling networks of symmetrical arrays with more than three elements and characterized by circulant scattering parameter matrices. The elements of the decoupling network are obtained through repeated decoupling of the characteristic eigenmodes of the array, which allows the calculation of element values using closed-form expressions.

Single-layer decoupling networks for circulant symmetric arrays

Reduced element spacing in antenna arrays gives rise to strong mutual coupling between array elements and may cause significant performance degradation. These effects can be alleviated by introducing a decoupling network consisting of interconnected reactive elements. The existing design approach for the synthesis of a decoupling network for circulant symmetric arrays allows calculation of element values using closed-form expressions, but the resulting circuit configuration requires multilayer technology for implementation. In this paper, a new structure for the decoupling of circulant symmetric arrays of more than four elements is presented. Element values are no longer obtained in closed form, but the resulting circuit is much simpler and can be implemented on a single layer.

Plastic bending behaviour and section moment capacities of mono-symmetric LiteSteel Beams with web openings

Recently developed cold-formed LiteSteel beam (LSB) sections have found increasing popularity in residential, industrial and commercial buildings due to their light weight and cost-effectiveness. Currently, there is significant interest in the use of LSB sections as flexural members in floor joist systems, although they can be used as flexural and compression members in a range of building systems. The plastic bending behaviour and section moment capacity of LSB sections with web holes can be assumed to differ from those without, but have yet to be investigated. Hence, no appropriate design rules for determining the section moment capacity of LSB sections with web holes are yet available. This paper presents the results of an investigation of the plastic bending behaviour and section moment capacity of LSB sections with circular web holes. LSB sections with varying circular hole diameters and degrees of spacing were considered. The paper also describes the simplified finite element (FE) modelling technique employed in this study, which incorporates all of the significant behavioural effects that influence the plastic bending behaviour and section moment capacity of these sections. The numerical and experimental test results and associated findings are also presented.

Numerical method for predicting the elastic lateral distortional buckling moment of a mono-symmetric beam with web openings

When used as floor joists, the new mono-symmetric LiteSteel beam (LSB) sections require web openings to provide access for inspections and various services. The LSBs consist of two rectangular hollow flanges connected by a slender web, and are subjected to lateral distortional buckling effects in the intermediate span range. Their member capacity design formulae developed to date are based on their elastic lateral buckling moments, and only limited research has been undertaken to predict the elastic lateral buckling moments of LSBs with web openings. This paper addresses this research gap by reporting the development of web opening modelling techniques based on an equivalent reduced web thickness concept and a numerical method for predicting the elastic buckling moments of LSBs with circular web openings. The proposed numerical method was based on a formulation of the total potential energy of LSBs with circular web openings. The accuracy of the proposed method’s use with the aforementioned modelling techniques was verified through comparison of its results with those of finite strip and finite element analyses of various LSBs.

Member moment capacities of mono-symmetric LiteSteel beam floor joists with web openings

Recently developed cold-formed LiteSteel beam (LSB) sections have found increasing popularity in residential, industrial and commercial buildings due to their light weight and cost-effectiveness. Another beneficial characteristic is that they allow torsionally rigid rectangular flanges to be combined with economical fabrication processes. Currently, there is significant interest in the use of LSB sections as flexural members in floor joist systems. When used as floor joists, these sections require openings in the web to provide access for inspection and other services. At present, however, there is no design method available that provides accurate predictions of the moment capacities of LSBs with web openings. This paper presents the results of an investigation of the buckling and ultimate strength behaviour of LSB flexural members with web openings. A detailed fine element analysis (FEA)-based parametric study was conducted with the aim of developing appropriate design rules and making recommendations for the safe design of LSB floor joists. The results include the required moment capacity curves for LSB sections with a range of web opening combinations and spans and the development of appropriate design rules for the prediction of the ultimate moment capacities of LSBs with web openings.

The effect of surface tension and kinetic undercooling on a radially-symmetric melting problem

The addition of surface tension to the classical Stefan problem for melting a sphere causes the solution to blow up at a finite time before complete melting takes place. This singular behaviour is characterised by the speed of the solid-melt interface and the flux of heat at the interface both becoming unbounded in the blow-up limit. In this paper, we use numerical simulation for a particular energy-conserving one-phase version of the problem to show that kinetic undercooling regularises this blow-up, so that the model with both surface tension and kinetic undercooling has solutions that are regular right up to complete melting. By examining the regime in which the dimensionless kinetic undercooling parameter is small, our results demonstrate how physically realistic solutions to this Stefan problem are consistent with observations of abrupt melting of nanoscaled particles.

Permutation polynomials of the form (xp −x +δ)s +L(x)

Recently, several classes of permutation polynomials of the form (x2 + x + δ)s + x over F2m have been discovered. They are related to Kloosterman sums. In this paper, the permutation behavior of polynomials of the form (xp − x + δ)s + L(x) over Fpm is investigated, where L(x) is a linearized polynomial with coefficients in Fp. Six classes of permutation polynomials on F2m are derived. Three classes of permutation polynomials over F3m are also presented.

Random projections on manifolds of symmetric positive definite matrices for image classification

Recent advances suggest that encoding images through Symmetric Positive Definite (SPD) matrices and then interpreting such matrices as points on Riemannian manifolds can lead to increased classification performance. Taking into account manifold geometry is typically done via (1) embedding the manifolds in tangent spaces, or (2) embedding into Reproducing Kernel Hilbert Spaces (RKHS). While embedding into tangent spaces allows the use of existing Euclidean-based learning algorithms, manifold shape is only approximated which can cause loss of discriminatory information. The RKHS approach retains more of the manifold structure, but may require non-trivial effort to kernelise Euclidean-based learning algorithms. In contrast to the above approaches, in this paper we offer a novel solution that allows SPD matrices to be used with unmodified Euclidean-based learning algorithms, with the true manifold shape well-preserved. Specifically, we propose to project SPD matrices using a set of random projection hyperplanes over RKHS into a random projection space, which leads to representing each matrix as a vector of projection coefficients. Experiments on face recognition, person re-identification and texture classification show that the proposed approach outperforms several recent methods, such as Tensor Sparse Coding, Histogram Plus Epitome, Riemannian Locality Preserving Projection and Relational Divergence Classification.

Revisiting Polya's summation techniques using a spreadsheet : from addition tables to Bernoulli polynomials

Recurrence relations in mathematics form a very powerful and compact way of looking at a wide range of relationships. Traditionally, the concept of recurrence has often been a difficult one for the secondary teacher to convey to students. Closely related to the powerful proof technique of mathematical induction, recurrences are able to capture many relationships in formulas much simpler than so-called direct or closed formulas. In computer science, recursive coding often has a similar compactness property, and, perhaps not surprisingly, suffers from similar problems in the classroom as recurrences: the students often find both the basic concepts and practicalities elusive. Using models designed to illuminate the relevant principles for the students, we offer a range of examples which use the modern spreadsheet environment to powerfully illustrate the great expressive and computational power of recurrences.

Learning with symmetric label noise: The importance of being unhinged

Convex potential minimisation is the de facto approach to binary classification. However, Long and Servedio [2008] proved that under symmetric label noise (SLN), minimisation of any convex potential over a linear function class can result in classification performance equivalent to random guessing. This ostensibly shows that convex losses are not SLN-robust. In this paper, we propose a convex, classification-calibrated loss and prove that it is SLN-robust. The loss avoids the Long and Servedio [2008] result by virtue of being negatively unbounded. The loss is a modification of the hinge loss, where one does not clamp at zero; hence, we call it the unhinged loss. We show that the optimal unhinged solution is equivalent to that of a strongly regularised SVM, and is the limiting solution for any convex potential; this implies that strong l2 regularisation makes most standard learners SLN-robust. Experiments confirm the unhinged loss’ SLN-robustness.