Experimental and numerical studies of hollow flange channel beams subject to web crippling under ETF and ITF load cases

This paper presents the details of experimental and numerical studies on the web crippling behaviour of hollow flange channel beams, known as LiteSteel beams (LSB). The LSB has a unique shape of a channel beam with two rectangular hollow flanges, made using a unique manufacturing process. Experimental and numerical studies have been carried out to evaluate the behaviour and design of LSBs subject to pure bending actions, predominant shear actions and combined actions. To date, however, no investigation has been conducted into the web crippling behaviour and strength of LSB sections under ETF and ITF load conditions. Hence experimental studies consisting of 28 tests were first conducted in this research to assess the web crippling behaviour and strengths of LSBs under two flange load cases (ETF and ITF). Experimental web crippling capacity results were then compared with the predictions from AS/NZS 4600 and AISI S100 design rules, which showed that AS/NZS 4600 and AISI S100 design equations are very unconservative for LSBs under ETF and ITF load cases. Hence improved equations were proposed to determine the web crippling capacities of LSBs. Finite element models of the tested LSBs were then developed, and used to determine the elastic buckling loads of LSBs under ETF and ITF load cases. New equations were proposed to determine the corresponding elastic buckling coefficients of LSBs. Finally suitable design rules were also developed under the Direct Strength Method format using the test results and buckling analysis results from finite element analyses.

Shear tests of rivet fastened rectangular hollow flange channel beams with web openings

The rivet-fastened rectangular hollow flange channel beam (RHFCB) is a new cold-formed hollow section proposed as an alternative to welded hollow flange steel beams. No research has been undertaken on the shear behaviour and strength of rivet fastened RHFCBs with web openings. Hence a detailed experimental study involving 30 shear tests was undertaken to investigate the shear behaviour and strength of rivet fastened RHFCBs with web openings. Experimental results showed that the current design rules are inadequate for the shear design of Rivet fastened RHFCBs with web openings. Improved design equations have been proposed for the shear strength of rivet fastened RHFCBs with web openings.

Web crippling tests of rivet fastened rectangular hollow flange channel beams under two-flange load cases

The rivet-fastened rectangular hollow flange channel beam (RHFCB) is a new cold-formed hollow section proposed as an alternative to welded hollow flange steel beams. To date, no investigation has been conducted on their web crippling behaviour and strengths. Hence an experimental study was conducted to investigate the web crippling behaviour and capacities of rivet fastened RHFCBs under End Two Flange (ETF) and Interior Two Flange (ITF) load cases. Experimental results showed that the current design rules are unconservative for rivet fastened RHFCB sections under ETF and ITF load cases. Hence new equations were proposed to determine the web crippling capacities of rivet fastened RHFCBs.

Invertebrate predation and trophic cascades in a pelagic food web : The multiple roles of Chaoborus flavicans (Meigen) in a clay-turbid lake

In lake ecosystems, both fish and invertebrate predators have dramatic effects on their prey communities. Fish predation selects large cladocerans while invertebrate predators prefer prey of smaller size. Since invertebrate predators are the preferred food items for fish, their occurrence at high densities is often connected with the absence or low number of fish. It is generally believed that invertebrate predators can play a significant role only if the density of planktivorous fish is low. However, in eutrophic clay-turbid Lake Hiidenvesi (southern Finland), a dense population of predatory Chaoborus flavicans larvae coexists with an abundant fish population. The population covers the stratifying area of the lake and attains a maximum population density of 23000 ind. m-2. This thesis aims to clarify the effects of Chaoborus flavicans on the zooplankton community and the environmental factors facilitating the coexistence of fish and invertebrate predators. In the stratifying area of Lake Hiidenvesi, the seasonal succession of cladocerans was exceptional. The spring biomass peak of cladocerans was missing and the highest biomass occurred in midsummer. In early summer, the consumption rate by chaoborids clearly exceeded the production rate of cladocerans and each year the biomass peak of cladocerans coincided with the minimum chaoborid density. In contrast, consumption by fish was very low and each study year cladocerans attained maximum biomass simultaneously with the highest consumption by smelt (Osmerus eperlanus). The results indicated that Chaoborus flavicans was the main predator of cladocerans in the stratifying area of Lake Hiidenvesi. The clay turbidity strongly contributed to the coexistence of chaoborids and smelt at high densities. Turbidity exceeding 30 NTU combined with light intensity below 0.1 μE m-2 s-1provides an efficient daytime refuge for chaoborids, but turbidity alone is not an adequate refuge unless combined with low light intensity. In the non-stratifying shallow basins of Lake Hiidenvesi, light intensity exceeds this level during summer days at the bottom of the lake, preventing Chaoborus forming a dense population in the shallow parts of the lake. Chaoborus can be successful particularly in deep, clay-turbid lakes where they can remain high in the water column close to their epilimnetic prey. Suspended clay alters the trophic interactions by weakening the link between fish and Chaoborus, which in turn strengthens the effect of Chaoborus predation on crustacean zooplankton. Since food web management largely relies on manipulations of fish stocks and the cascading effects of such actions, the validity of the method in deep clay-turbid lakes may be questioned.

SSMBS: a web server to locate sequentially separated motifs in biological sequences

The identification of sequence (amino acids or nucleotides) motifs in a particular order in biological sequences has proved to be of interest. This paper describes a computing server, SSMBS, which can locate anddisplay the occurrences of user-defined biologically important sequence motifs (a maximum of five) present in a specific order in protein and nucleotide sequences. While the server can efficiently locate motifs specified using regular expressions, it can also find occurrences of long and complex motifs. The computation is carried out by an algorithm developed using the concepts of quantifiers in regular expressions. The web server is available to users around the clock at http://dicsoft1.physics.iisc.ernet.in/ssmbs/.

A combinatorial procurement auction for QoS-aware web services

Business processes and application functionality are becoming available as internal web services inside enterprise boundaries as well as becoming available as commercial web services from enterprise solution vendors and web services marketplaces. Typically there are multiple web service providers offering services capable of fulfilling a particular functionality, although with different Quality of Service (QoS). Dynamic creation of business processes requires composing an appropriate set of web services that best suit the current need. This paper presents a novel combinatorial auction approach to QoS aware dynamic web services composition. Such an approach would enable not only stand-alone web services but also composite web services to be a part of a business process. The combinatorial auction leads to an integer programming formulation for the web services composition problem. An important feature of the model is the incorporation of service level agreements. We describe a software tool QWESC for QoS-aware web services composition based on the proposed approach.

Techno Teacher Moms: Web 2.0 Connecting Mothers in the Home Education Community

Home education is on the rise in Australia. However, unlike parents who choose mainstream schooling, these parents often lack the support of a wider community to help them on their educational and parenting journey. This support is especially lacking as many people in the wider community find the choice to home education confronting. As such, these parents may feel isolated and alienated in the general population as their choice to home educate is questioned at best, and ridiculed at worst. These parents often find sanctuary online in homeschool groups on Facebook. This chapter explores the ways that Facebook Groups are used by marginalized and disenfranchised families who home educate to meet with others who are likeminded and aligned with their beliefs and philosophies. It is through these groups that parents, in relation to schooling it is especially mothers, are able to ask for advice, to vent, to explore options and find connections that may be lacking in the wider community.

E-learning in a rural context: Alternative media and contemporary applications

This report has been written as part of the E-ruralnet –project that addresses e-learning as a means for enhancing lifelong learning opportunities in rural areas, with emphasis on SMEs, micro-enterprises, self-employed and persons seeking employment. E-ruralnet is a European network project part-funded by the European Commission in the context of the Lifelong Learning Programme, Transversal projects-ICT. This report aims to address two issues identified as requiring attention in the previous Observatory study: firstly, access to e-learning for rural areas that have not adequate ICT infrastructure; and secondly new learning approaches introduced through new interactive ICT tools such as web 2.0., wikis, podcasts etc. The possibility of using alternative technology in addition to computers is examined (mobile telephones, DVDs) as well as new approaches to learning (simulation, serious games). The first part of the report examines existing literature on e-learning and what e-learning is all about. Institutional users, learners and instructors/teachers are all looked at separately. We then turn to the implementation of e-learning from the organizational point of view and focus on quality issues related to e-learning. The report includes a separate chapter or e-learning from the rural perspective since most of Europe is geographically speaking rural and the population in those areas is that which could most benefit from the possibilities introduced by the e-learning development. The section titled “Alternative media”, in accordance with the project terminology, looks at standalone technology that is of particular use to rural areas without proper internet connection. It also evaluates the use of new tools and media in e-learning and takes a look at m-learning. Finally, the use of games, serious games and simulations in learning is considered. Practical examples and cases are displayed in a box to facilitate pleasant reading.

Developing Peer-To-Peer Web Applications

As the virtual world grows more complex, finding a standard way for storing data becomes increasingly important. Ideally, each data item would be brought into the computer system only once. References for data items need to be cryptographically verifiable, so the data can maintain its identity while being passed around. This way there will be only one copy of the users family photo album, while the user can use multiple tools to show or manipulate the album. Copies of users data could be stored on some of his family members computer, some of his computers, but also at some online services which he uses. When all actors operate over one replicated copy of the data, the system automatically avoids a single point of failure. Thus the data will not disappear with one computer breaking, or one service provider going out of business. One shared copy also makes it possible to delete a piece of data from all systems at once, on users request. In our research we tried to find a model that would make data manageable to users, and make it possible to have the same data stored at various locations. We studied three systems, Persona, Freenet, and GNUnet, that suggest different models for protecting user data. The main application areas of the systems studied include securing online social networks, providing anonymous web, and preventing censorship in file-sharing. Each of the systems studied store user data on machines belonging to third parties. The systems differ in measures they take to protect their users from data loss, forged information, censorship, and being monitored. All of the systems use cryptography to secure names used for the content, and to protect the data from outsiders. Based on the gained knowledge, we built a prototype platform called Peerscape, which stores user data in a synchronized, protected database. Data items themselves are protected with cryptography against forgery, but not encrypted as the focus has been disseminating the data directly among family and friends instead of letting third parties store the information. We turned the synchronizing database into peer-to-peer web by revealing its contents through an integrated http server. The REST-like http API supports development of applications in javascript. To evaluate the platform’s suitability for application development we wrote some simple applications, including a public chat room, bittorrent site, and a flower growing game. During our early tests we came to the conclusion that using the platform for simple applications works well. As web standards develop further, writing applications for the platform should become easier. Any system this complex will have its problems, and we are not expecting our platform to replace the existing web, but are fairly impressed with the results and consider our work important from the perspective of managing user data.

Developing Peer-To-Peer Web Applications

As the virtual world grows more complex, finding a standard way for storing data becomes increasingly important. Ideally, each data item would be brought into the computer system only once. References for data items need to be cryptographically verifiable, so the data can maintain its identity while being passed around. This way there will be only one copy of the users family photo album, while the user can use multiple tools to show or manipulate the album. Copies of users data could be stored on some of his family members computer, some of his computers, but also at some online services which he uses. When all actors operate over one replicated copy of the data, the system automatically avoids a single point of failure. Thus the data will not disappear with one computer breaking, or one service provider going out of business. One shared copy also makes it possible to delete a piece of data from all systems at once, on users request. In our research we tried to find a model that would make data manageable to users, and make it possible to have the same data stored at various locations. We studied three systems, Persona, Freenet, and GNUnet, that suggest different models for protecting user data. The main application areas of the systems studied include securing online social networks, providing anonymous web, and preventing censorship in file-sharing. Each of the systems studied store user data on machines belonging to third parties. The systems differ in measures they take to protect their users from data loss, forged information, censorship, and being monitored. All of the systems use cryptography to secure names used for the content, and to protect the data from outsiders. Based on the gained knowledge, we built a prototype platform called Peerscape, which stores user data in a synchronized, protected database. Data items themselves are protected with cryptography against forgery, but not encrypted as the focus has been disseminating the data directly among family and friends instead of letting third parties store the information. We turned the synchronizing database into peer-to-peer web by revealing its contents through an integrated http server. The REST-like http API supports development of applications in javascript. To evaluate the platform s suitability for application development we wrote some simple applications, including a public chat room, bittorrent site, and a flower growing game. During our early tests we came to the conclusion that using the platform for simple applications works well. As web standards develop further, writing applications for the platform should become easier. Any system this complex will have its problems, and we are not expecting our platform to replace the existing web, but are fairly impressed with the results and consider our work important from the perspective of managing user data.

Protein Block Expert (PBE): a web-based protein structure analysis server using a structural alphabet

Encoding protein 3D structures into 1D string using short structural prototypes or structural alphabets opens a new front for structure comparison and analysis. Using the well-documented 16 motifs of Protein Blocks (PBs) as structural alphabet, we have developed a methodology to compare protein structures that are encoded as sequences of PBs by aligning them using dynamic programming which uses a substitution matrix for PBs. This methodology is implemented in the applications available in Protein Block Expert (PBE) server. PBE addresses common issues in the field of protein structure analysis such as comparison of proteins structures and identification of protein structures in structural databanks that resemble a given structure. PBE-T provides facility to transform any PDB file into sequences of PBs. PBE-ALIGNc performs comparison of two protein structures based on the alignment of their corresponding PB sequences. PBE-ALIGNm is a facility for mining SCOP database for similar structures based on the alignment of PBs. Besides, PBE provides an interface to a database (PBE-SAdb) of preprocessed PB sequences from SCOP culled at 95% and of all-against-all pairwise PB alignments at family and superfamily levels. PBE server is freely available at http://bioinformatics.univ-reunion.fr/ PBE/.

Cascade PSI-BLAST web server: a remote homology search tool for relating protein domains

Owing to high evolutionary divergence, it is not always possible to identify distantly related protein domains by sequence search techniques. Intermediate sequences possess sequence features of more than one protein and facilitate detection of remotely related proteins. We have demonstrated recently the employment of Cascade PSI-BLAST where we perform PSI-BLAST for many 'generations', initiating searches from new homologues as well. Such a rigorous propagation through generations of PSI-BLAST employs effectively the role of intermediates in detecting distant similarities between proteins. This approach has been tested on a large number of folds and its performance in detecting superfamily level relationships is similar to 35% better than simple PSI-BLAST searches. We present a web server for this search method that permits users to perform Cascade PSI-BLAST searches against the Pfam, SCOP and SwissProt databases. The URL for this server is http://crick.mbu.iisc.ernet.in/similar to CASCADE/CascadeBlast.html.