Web crippling tests of hollow flange channel beams with flanges fastened to supports under two flange load cases

Thin-walled steel hollow flange channel beams known as LiteSteel beam (LSB) sections were developed for use as joists and bearers in various flooring systems. However, they are subjected to specific buckling and failure modes, one of them being web crippling. Despite considerable research in this area, much of the current design predictions for cold-formed steel sections are not directly applicable to LSBs. This is due to the geometry of the LSB, which consists of two closed rectangular hollow flanges, and its unique residual stress characteristics and initial geometric imperfections. Hence an experimental study was conducted to investigate the web crippling behaviour and capacities of LSBs with their flanges fastened to supports. Thirty nine web crippling tests were conducted under two flange load cases (End Two Flange (ETF) and Interior Two Flange (ITF)). Test results showed that for ETF load case the web crippling capacities increased by 50% on average while they increased by 97% for ITF load case when flanges were fastened to supports. Comparison of the ultimate web crippling capacities from tests showed that AS/NZS 4600 and AISI S100 web crippling design equations are conservative for LSB sections with flanges fastened to supports under ETF and ITF load cases. Hence new equations were proposed to determine the web crippling capacities of LSBs with flanges fastened to supports. This paper presents the details of the experimental study into the web crippling behaviour of LSB sections with their flanges fastened under ETF and ITF load cases, and the results.

Engineered protease inhibitors based on sunflower trypsin inhibitor-1 (SFTI-1) provide insights into the role of sequence and conformation in Laskowski mechanism inhibition

Laskowski inhibitors regulate serine proteases by an intriguing mode of action that involves deceiving the protease into synthesizing a peptide bond. Studies exploring naturally occurring Laskowski inhibitors have uncovered several structural features that convey the inhibitor's resistance to hydrolysis and exceptional binding affinity. However, in the context of Laskowski inhibitor engineering, the way that various modifications intended to fine-tune an inhibitor's potency and selectivity impact on its association and dissociation rates remains unclear. This information is important as Laskowski inhibitors are becoming increasingly used as design templates to develop new protease inhibitors for pharmaceutical applications. In this study, we used the cyclic peptide, sunflower trypsin inhibitor-1 (SFTI-1), as a model system to explore how the inhibitor's sequence and structure relate to its binding kinetics and function. Using enzyme assays, MD simulations and NMR spectroscopy to study SFTI variants with diverse sequence and backbone modifications, we show that the geometry of the binding loop mainly influences the inhibitor's potency by modulating the association rate, such that variants lacking a favourable conformation show dramatic losses in activity. Additionally, we show that the inhibitor's sequence (including both the binding loop and its scaffolding) influences its potency and selectivity by modulating both the association and the dissociation rates. These findings provide new insights into protease inhibitor function and design that we apply by engineering novel inhibitors for classical serine proteases, trypsin and chymotrypsin and two kallikrein-related peptidases (KLK5 and KLK14) that are implicated in various cancers and skin diseases.

Tris[4,4,4-trifluoro-1-(2-thienyl)butane-1,3-dionato]aluminium(III)-tris[4,4,4-trifluoro-1-(2-thienyl)butane-1,3-dionato]iron(III) (3/1)

In the title compound, [Al(C8H4F3O2S)3]3[Fe(C8H4F3O2S)3], the metal centre is statistically occupied by AlIII and FeIII cations in a 3:1 ratio. The metal centre is within an octahedral O6 donor set defined by three chelating substituted acetoacetonate anions. The ligands are arranged around the periphery of the molecule with a mer geometry of the S atoms.

Corrosion studies on the plasma-sprayed nanostructured titanium dioxide coating

Purpose: The purpose of this paper is to report the resistance of plasma-sprayed titanium dioxide (TiO2) nanostructured coatings in a corrosive environment.----- Design/methodology/approach: Weight loss studies are performed according to ASTM G31 specifications in 3.5?wt% NaCl. Electrochemical polarization resistance measurements are made according to ASTM G59-91 specifications. Corrosion resistance in a humid and corrosive environment is determined by exposing the samples in a salt spray chamber for 100?h. Microstructural studies are carried out using an atomic force microscope and scanning electron microscope.----- Findings: The nanostructured TiO2 coatings offer good resistance to corrosion, as shown by the results of immersion, electrochemical and salt spray studies. The corrosion resistance of the coating is dictated primarily by the geometry of splat lamellae, density of unmelted nanoparticles, magnitude of porosity and surface homogeneity.----- Practical implications: The TiO2 nanostructured coatings show promising potential for use as abrasion, wear-resistant and thermal barrier coatings for service in harsh environments.----- Originality/value: The paper relates the corrosion resistance of nanostructured TiO2 coatings to their structure and surface morphology.

Learning the kernel matrix with semidefinite programming

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive semidefinite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space - classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semidefinite programming (SDP) techniques. When applied to a kernel matrix associated with both training and test data this gives a powerful transductive algorithm -using the labeled part of the data one can learn an embedding also for the unlabeled part. The similarity between test points is inferred from training points and their labels. Importantly, these learning problems are convex, so we obtain a method for learning both the model class and the function without local minima. Furthermore, this approach leads directly to a convex method for learning the 2-norm soft margin parameter in support vector machines, solving an important open problem.

Learning the Kernel Matrix with Semi-Definite Programming

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive definite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space -- classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semi-definite programming (SDP) techniques. When applied to a kernel matrix associated with both training and test data this gives a powerful transductive algorithm -- using the labelled part of the data one can learn an embedding also for the unlabelled part. The similarity between test points is inferred from training points and their labels. Importantly, these learning problems are convex, so we obtain a method for learning both the model class and the function without local minima. Furthermore, this approach leads directly to a convex method to learn the 2-norm soft margin parameter in support vector machines, solving another important open problem. Finally, the novel approach presented in the paper is supported by positive empirical results.

The RatSLAM project : robot spatial navigation

Rats are superior to the most advanced robots when it comes to creating and exploiting spatial representations. A wild rat can have a foraging range of hundreds of meters, possibly kilometers, and yet the rodent can unerringly return to its home after each foraging mission, and return to profitable foraging locations at a later date (Davis, et al., 1948). The rat runs through undergrowth and pipes with few distal landmarks, along paths where the visual, textural, and olfactory appearance constantly change (Hardy and Taylor, 1980; Recht, 1988). Despite these challenges the rat builds, maintains, and exploits internal representations of large areas of the real world throughout its two to three year lifetime. While algorithms exist that allow robots to build maps, the questions of how to maintain those maps and how to handle change in appearance over time remain open. The robotic approach to map building has been dominated by algorithms that optimise the geometry of the map based on measurements of distances to features. In a robotic approach, measurements of distance to features are taken with range-measuring devices such as laser range finders or ultrasound sensors, and in some cases estimates of depth from visual information. The features are incorporated into the map based on previous readings of other features in view and estimates of self-motion. The algorithms explicitly model the uncertainty in measurements of range and the measurement of self-motion, and use probability theory to find optimal solutions for the geometric configuration of the map features (Dissanayake, et al., 2001; Thrun and Leonard, 2008). Some of the results from the application of these algorithms have been impressive, ranging from three-dimensional maps of large urban strucutures (Thrun and Montemerlo, 2006) to natural environments (Montemerlo, et al., 2003).

Compact multiport antenna with isolated ports

The small element spacing of compact multiport arrays introduces strong mutual coupling between the antenna ports. Due to this coupling, the input impedance of the array changes when elements excitations are varied, and consequently, the array cannot be matched for an arbitrary excitation. Decoupling networks have in the past been used to provide an additional connection between antenna ports in order to cancel the coupling between elements. An alternative approach is to design the antenna so that each port does not excite a single element, but all elements simultaneously instead. The geometry of the antenna is optimized so that this direct excitation of elements counteracts the mutual coupling, thus yielding decoupled ports. This paper describes the design of such a 4-port antenna.

New exact solutions for Hele-Shaw flow in doubly connected regions

Radial Hele-Shaw flows are treated analytically using conformal mapping techniques. The geometry of interest has a doubly-connected annular region of viscous fluid surrounding an inviscid bubble that is either expanding or contracting due to a pressure difference caused by injection or suction of the inviscid fluid. The zero-surface-tension problem is ill-posed for both bubble expansion and contraction, as both scenarios involve viscous fluid displacing inviscid fluid. Exact solutions are derived by tracking the location of singularities and critical points in the analytic continuation of the mapping function. We show that by treating the critical points, it is easy to observe finite-time blow-up, and the evolution equations may be written in exact form using complex residues. We present solutions that start with cusps on one interface and end with cusps on the other, as well as solutions that have the bubble contracting to a point. For the latter solutions, the bubble approaches an ellipse in shape at extinction.

Homo- and heteronuclear meso,meso-(E)-Ethene-1,2-diyl-Linked Diporphyrins : preparation, X-ray crystal structure, electronic absorption and emission spectra and density functional theory calculations

Homo-and heteronuclear meso,meso-(E)-ethene-1,2-diyl-linked diporphyrins have been prepared by the Suzuki coupling of porphyrinylboronates and iodovinylporphyrins. Combinations comprising 5,10,15-triphenylporphyrin (TriPP) on both ends of the ethene-1,2-diyl bridge M 210 (M 2=H 2/Ni, Ni 2, Ni/Zn, H 4, H 2Zn, Zn 2) and 5,15-bis(3,5-di-tert-butylphenyl)porphyrinato-nickel(II) on one end and H 2, Ni, and ZnTriPP on the other (M 211), enable the first studies of this class of compounds possessing intrinsic polarity. The compounds were characterized by electronic absorption and steady state emission spectra, 1H NMR spectra, and for the Ni 2 bis(TriPP) complex Ni 210, single crystal X-ray structure determination. The crystal structure shows ruffled distortions of the porphyrin rings, typical of Ni II porphyrins, and the (E)-C 2H 2 bridge makes a dihedral angle of 50° with the mean planes of the macrocycles. The result is a stepped parallel arrangement of the porphyrin rings. The dihedral angles in the solid state reflect the interplay of steric and electronic effects of the bridge on interporphyrin communication. The emission spectra in particular, suggest energy transfer across the bridge is fast in conformations in which the bridge is nearly coplanar with the rings. Comparisons of the fluorescence behaviour of H 410 and H 2Ni10 show strong quenching of the free base fluorescence when the complex is excited at the lower energy component of the Soret band, a feature associated in the literature with more planar conformations. TDDFT calculations on the gas-phase optimized geometry of Ni 210 reproduce the features of the experimental electronic absorption spectrum within 0.1 eV. © 2012 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Magnetic flux analysis in superconducting Fault Current Limiters under short-circuit conditions

In order to obtain a more compact Superconducting Fault Current limiter (SFCL), a special geometry of core and AC coil is required. This results in a unique magnetic flux pattern which differs from those associated with conventional round core arrangements. In this paper the magnetic flux density within a Fault Current Limiter (FCL) is described. Both experimental and analytical approaches are considered. A small scale prototype of an FCL was constructed in order to conduct the experiments. This prototype comprises a single phase. The analysis covers both the steady state and the short-circuit condition. Simulation results were obtained using commercial software based on the Finite Element Method (FEM). The magnetic flux saturating the cores, leakage magnetic flux giving rise to electromagnetic forces and leakage magnetic flux flowing in the enclosing tank are computed.

Exponential integrators and a dual-scale model for wood drying

For the timber industry, the ability to simulate the drying of wood is invaluable for manufacturing high quality wood products. Mathematically, however, modelling the drying of a wet porous material, such as wood, is a diffcult task due to its heterogeneous and anisotropic nature, and the complex geometry of the underlying pore structure. The well{ developed macroscopic modelling approach involves writing down classical conservation equations at a length scale where physical quantities (e.g., porosity) can be interpreted as averaged values over a small volume (typically containing hundreds or thousands of pores). This averaging procedure produces balance equations that resemble those of a continuum with the exception that effective coeffcients appear in their deffnitions. Exponential integrators are numerical schemes for initial value problems involving a system of ordinary differential equations. These methods differ from popular Newton{Krylov implicit methods (i.e., those based on the backward differentiation formulae (BDF)) in that they do not require the solution of a system of nonlinear equations at each time step but rather they require computation of matrix{vector products involving the exponential of the Jacobian matrix. Although originally appearing in the 1960s, exponential integrators have recently experienced a resurgence in interest due to a greater undertaking of research in Krylov subspace methods for matrix function approximation. One of the simplest examples of an exponential integrator is the exponential Euler method (EEM), which requires, at each time step, approximation of φ(A)b, where φ(z) = (ez - 1)/z, A E Rnxn and b E Rn. For drying in porous media, the most comprehensive macroscopic formulation is TransPore [Perre and Turner, Chem. Eng. J., 86: 117-131, 2002], which features three coupled, nonlinear partial differential equations. The focus of the first part of this thesis is the use of the exponential Euler method (EEM) for performing the time integration of the macroscopic set of equations featured in TransPore. In particular, a new variable{ stepsize algorithm for EEM is presented within a Krylov subspace framework, which allows control of the error during the integration process. The performance of the new algorithm highlights the great potential of exponential integrators not only for drying applications but across all disciplines of transport phenomena. For example, when applied to well{ known benchmark problems involving single{phase liquid ow in heterogeneous soils, the proposed algorithm requires half the number of function evaluations than that required for an equivalent (sophisticated) Newton{Krylov BDF implementation. Furthermore for all drying configurations tested, the new algorithm always produces, in less computational time, a solution of higher accuracy than the existing backward Euler module featured in TransPore. Some new results relating to Krylov subspace approximation of '(A)b are also developed in this thesis. Most notably, an alternative derivation of the approximation error estimate of Hochbruck, Lubich and Selhofer [SIAM J. Sci. Comput., 19(5): 1552{1574, 1998] is provided, which reveals why it performs well in the error control procedure. Two of the main drawbacks of the macroscopic approach outlined above include the effective coefficients must be supplied to the model, and it fails for some drying configurations, where typical dual{scale mechanisms occur. In the second part of this thesis, a new dual{scale approach for simulating wood drying is proposed that couples the porous medium (macroscale) with the underlying pore structure (microscale). The proposed model is applied to the convective drying of softwood at low temperatures and is valid in the so{called hygroscopic range, where hygroscopically held liquid water is present in the solid phase and water exits only as vapour in the pores. Coupling between scales is achieved by imposing the macroscopic gradient on the microscopic field using suitably defined periodic boundary conditions, which allows the macroscopic ux to be defined as an average of the microscopic ux over the unit cell. This formulation provides a first step for moving from the macroscopic formulation featured in TransPore to a comprehensive dual{scale formulation capable of addressing any drying configuration. Simulation results reported for a sample of spruce highlight the potential and flexibility of the new dual{scale approach. In particular, for a given unit cell configuration it is not necessary to supply the effective coefficients prior to each simulation.

How long does it take for aquifer recharge or aquifer discharge processes to reach steady state?

Groundwater flow models are usually characterized as being either transient flow models or steady state flow models. Given that steady state groundwater flow conditions arise as a long time asymptotic limit of a particular transient response, it is natural for us to seek a finite estimate of the amount of time required for a particular transient flow problem to effectively reach steady state. Here, we introduce the concept of mean action time (MAT) to address a fundamental question: How long does it take for a groundwater recharge process or discharge processes to effectively reach steady state? This concept relies on identifying a cumulative distribution function, $F(t;x)$, which varies from $F(0;x)=0$ to $F(t;x) \to \infty$ as $t\to \infty$, thereby providing us with a measurement of the progress of the system towards steady state. The MAT corresponds to the mean of the associated probability density function $f(t;x) = \dfrac{dF}{dt}$, and we demonstrate that this framework provides useful analytical insight by explicitly showing how the MAT depends on the parameters in the model and the geometry of the problem. Additional theoretical results relating to the variance of $f(t;x)$, known as the variance of action time (VAT), are also presented. To test our theoretical predictions we include measurements from a laboratory–scale experiment describing flow through a homogeneous porous medium. The laboratory data confirms that the theoretical MAT predictions are in good agreement with measurements from the physical model.

Semantic spaces : measuring the distance between different subspaces

Semantic Space models, which provide a numerical representation of words’ meaning extracted from corpus of documents, have been formalized in terms of Hermitian operators over real valued Hilbert spaces by Bruza et al. [1]. The collapse of a word into a particular meaning has been investigated applying the notion of quantum collapse of superpositional states [2]. While the semantic association between words in a Semantic Space can be computed by means of the Minkowski distance [3] or the cosine of the angle between the vector representation of each pair of words, a new procedure is needed in order to establish relations between two or more Semantic Spaces. We address the question: how can the distance between different Semantic Spaces be computed? By representing each Semantic Space as a subspace of a more general Hilbert space, the relationship between Semantic Spaces can be computed by means of the subspace distance. Such distance needs to take into account the difference in the dimensions between subspaces. The availability of a distance for comparing different Semantic Subspaces would enable to achieve a deeper understanding about the geometry of Semantic Spaces which would possibly translate into better effectiveness in Information Retrieval tasks.

Long-term experiments with an adaptive spherical view representation for navigation in changing environments

Real-world environments such as houses and offices change over time, meaning that a mobile robot’s map will become out of date. In this work, we introduce a method to update the reference views in a hybrid metrictopological map so that a mobile robot can continue to localize itself in a changing environment. The updating mechanism, based on the multi-store model of human memory, incorporates a spherical metric representation of the observed visual features for each node in the map, which enables the robot to estimate its heading and navigate using multi-view geometry, as well as representing the local 3D geometry of the environment. A series of experiments demonstrate the persistence performance of the proposed system in real changing environments, including analysis of the long-term stability.