A material model for flexural crack simulation in reinforced concrete elements using ABAQUS

This paper presents a material model to simulate load induced cracking in Reinforced Concrete (RC) elements in ABAQUS finite element package. Two numerical material models are used and combined to simulate complete stress-strain behaviour of concrete under compression and tension including damage properties. Both numerical techniques used in the present material model are capable of developing the stress-strain curves including strain softening regimes only using ultimate compressive strength of concrete, which is easily and practically obtainable for many of the existing RC structures or those to be built. Therefore, the method proposed in this paper is valuable in assessing existing RC structures in the absence of more detailed test results. The numerical models are slightly modified from the original versions to be comparable with the damaged plasticity model used in ABAQUS. The model is validated using different experiment results for RC beam elements presented in the literature. The results indicate a good agreement with load vs. displacement curve and observed crack patterns.

Experimental investigation on extruded snack products from rice and Mung bean : optimization of parameters

Experiments were undertaken to study effect of initial conditions on the expansion ratio of two grains in a laboratory scale, single speed, single screw extruder at Naresuan University, Thailand. Jasmine rice and Mung bean were used as the material. Three different initial moisture contents were adjusted for the grains and classified them into three groups according to particle sizes. Mesh sizes used are 12 and 14. Expansion ratio was measured at a constant barrel temperature of 190oC. Response surface methodology was used to obtain optimum conditions between moisture content and particle size of the materials concerned.

Lateral distortional buckling tests of a new hollow flange channel beam

The LiteSteel beam (LSB) is a new hollow flange channel section developed by OneSteel Australian Tube Mills using their patented dual electric resistance welding and automated continuous roll-forming process. It has a unique geometry consisting of torsionally rigid rectangular hollow flanges and a relatively slender web. The LSBs are commonly used as flexural members in buildings. However, the LSB flexural members are subjected to lateral distortional buckling, which reduces their member moment capacities. Unlike the commonly observed lateral torsional buckling of steel beams, the lateral distortional buckling of LSBs is characterised by simultaneous lateral deflection, twist, and cross sectional change due to web distortion. An experimental study including more than 50 lateral buckling tests was therefore conducted to investigate the behaviour and strength of LSB flexural members. It included the available 13 LSB sections with spans ranging from 1200 to 4000 mm. Lateral buckling tests based on a quarter point loading were conducted using a special test rig designed to simulate the required simply supported and loading conditions accurately. Experimental moment capacities were compared with the predictions from the design rules in the Australian cold-formed steel structures standard. The new design rules in the standard were able to predict the moment capacities more accurately than previous design rules. This paper presents the details of lateral distortional buckling tests, in particular the features of the lateral buckling test rig, the results and the comparisons. It also includes the results of detailed studies into the mechanical properties and residual stresses of LSBs.

Using Fiber Bragg Grating (FBG) sensors to measure vertical displacements of bridges : a preliminary study

In many bridges, vertical displacements are the most relevant parameter for monitoring in the both short and long term. However, it is difficult to measure vertical displacements of bridges and yet they are among the most important indicators of structural behaviour. Therefore, it prompts a need to develop a simple, inexpensive and yet more practical method to measure vertical displacements of bridges. With the development of fiber-optics technologies, fiber Bragg grating (FBG) sensors have been widely used in structural health monitoring. The advantages of these sensors over the conventional sensors include multiplexing capabilities, high sample rate, small size and electro magnetic interference (EMI) immunity. In this paper, methods of vertical displacement measurements of bridges are first reviewed. Then, FBG technology is briefly introduced including principle, sensing system, characteristics and different types of FBG sensors. Finally, the methodology of vertical displacement measurements using FBG sensors is presented and a trial test is described. It is concluded that using FBG sensors is feasible to measure vertical displacements of bridges. This method can be used to understand global behaviour of bridge‘s span and can further develop for structural health monitoring techniques such as damage detection.

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.

Bounded parameter Markov Decision Processes with average reward criterion

Bounded parameter Markov Decision Processes (BMDPs) address the issue of dealing with uncertainty in the parameters of a Markov Decision Process (MDP). Unlike the case of an MDP, the notion of an optimal policy for a BMDP is not entirely straightforward. We consider two notions of optimality based on optimistic and pessimistic criteria. These have been analyzed for discounted BMDPs. Here we provide results for average reward BMDPs. We establish a fundamental relationship between the discounted and the average reward problems, prove the existence of Blackwell optimal policies and, for both notions of optimality, derive algorithms that converge to the optimal value function.

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.