Numerical modelling of light gauge cold-formed steel compression members subjected to distortional buckling at elevated temperatures

Fire safety design of building structures has received greater attention in recent times due to continuing loss of properties and lives during fires. However, fire performance of light gauge cold-formed steel structures is not well understood despite its increased usage in buildings. Cold-formed steel compression members are susceptible to various buckling modes such as local and distortional buckling and their ultimate strength behaviour is governed by these buckling modes. Therefore a research project based on experimental and numerical studies was undertaken to investigate the distortional buckling behaviour of light gauge cold-formed steel compression members under simulated fire conditions. Lipped channel sections with and without additional lips were selected with three thicknesses of 0.6, 0.8, and 0.95 mm and both low and high strength steels (G250 and G550 steels). More than 150 compression tests were undertaken first at ambient and elevated temperatures. Finite element models of the tested compression members were then developed by including the degradation of mechanical properties with increasing temperatures. Comparison of finite element analysis and experimental results showed that the developed finite element models were capable of simulating the distortional buckling and strength behaviour at ambient and elevated temperatures up to 800 °C. The validated model was used to determine the effects of mechanical properties, geometric imperfections and residual stresses on the distortional buckling behaviour and strength of cold-formed steel columns. This paper presents the details of the numerical study and the results. It demonstrated the importance of using accurate mechanical properties at elevated temperatures in order to obtain reliable strength characteristics of cold-formed steel columns under fire conditions.

Shifting : one-inclusion mistake bounds and sample compression

We present new expected risk bounds for binary and multiclass prediction, and resolve several recent conjectures on sample compressibility due to Kuzmin and Warmuth. By exploiting the combinatorial structure of concept class F, Haussler et al. achieved a VC(F)/n bound for the natural one-inclusion prediction strategy. The key step in their proof is a d = VC(F) bound on the graph density of a subgraph of the hypercube—oneinclusion graph. The first main result of this paper is a density bound of n [n−1 <=d-1]/[n <=d] < d, which positively resolves a conjecture of Kuzmin and Warmuth relating to their unlabeled Peeling compression scheme and also leads to an improved one-inclusion mistake bound. The proof uses a new form of VC-invariant shifting and a group-theoretic symmetrization. Our second main result is an algebraic topological property of maximum classes of VC-dimension d as being d contractible simplicial complexes, extending the well-known characterization that d = 1 maximum classes are trees. We negatively resolve a minimum degree conjecture of Kuzmin and Warmuth—the second part to a conjectured proof of correctness for Peeling—that every class has one-inclusion minimum degree at most its VCdimension. Our final main result is a k-class analogue of the d/n mistake bound, replacing the VC-dimension by the Pollard pseudo-dimension and the one-inclusion strategy by its natural hypergraph generalization. This result improves on known PAC-based expected risk bounds by a factor of O(logn) and is shown to be optimal up to an O(logk) factor. The combinatorial technique of shifting takes a central role in understanding the one-inclusion (hyper)graph and is a running theme throughout.

Corrigendum to “Shifting : one-inclusion mistake bounds and sample compression” [J. Comput. System Sci. 75 (1) (2009) 37–59]

H. Simon and B. Szörényi have found an error in the proof of Theorem 52 of “Shifting: One-inclusion mistake bounds and sample compression”, Rubinstein et al. (2009). In this note we provide a corrected proof of a slightly weakened version of this theorem. Our new bound on the density of one-inclusion hypergraphs is again in terms of the capacity of the multilabel concept class. Simon and Szörényi have recently proved an alternate result in Simon and Szörényi (2009).

Shifting : one-inclusion mistake bounds and sample compression

We present new expected risk bounds for binary and multiclass prediction, and resolve several recent conjectures on sample compressibility due to Kuzmin and Warmuth. By exploiting the combinatorial structure of concept class F, Haussler et al. achieved a VC(F)/n bound for the natural one-inclusion prediction strategy. The key step in their proof is a d=VC(F) bound on the graph density of a subgraph of the hypercube—one-inclusion graph. The first main result of this report is a density bound of n∙choose(n-1,≤d-1)/choose(n,≤d) < d, which positively resolves a conjecture of Kuzmin and Warmuth relating to their unlabeled Peeling compression scheme and also leads to an improved one-inclusion mistake bound. The proof uses a new form of VC-invariant shifting and a group-theoretic symmetrization. Our second main result is an algebraic topological property of maximum classes of VC-dimension d as being d-contractible simplicial complexes, extending the well-known characterization that d=1 maximum classes are trees. We negatively resolve a minimum degree conjecture of Kuzmin and Warmuth—the second part to a conjectured proof of correctness for Peeling—that every class has one-inclusion minimum degree at most its VC-dimension. Our final main result is a k-class analogue of the d/n mistake bound, replacing the VC-dimension by the Pollard pseudo-dimension and the one-inclusion strategy by its natural hypergraph generalization. This result improves on known PAC-based expected risk bounds by a factor of O(log n) and is shown to be optimal up to a O(log k) factor. The combinatorial technique of shifting takes a central role in understanding the one-inclusion (hyper)graph and is a running theme throughout

Mechanical behaviours of pumpkin peel under compression test

Mechanical damages such as bruising, collision and impact during food processing stages diminish quality and quantity of productions as well as efficiency of operations. Studying mechanical characteristics of food materials will help to enhance current industrial practices. Mechanical properties of fruits and vegetables describe how these materials behave under loading in real industrial operations. Optimizing and designing more efficient equipments require accurate and precise information of tissue behaviours. FE modelling of food industrial processes is an effective method of studying interrelation of variables during mechanical operation. In this study, empirical investigation has been done on mechanical properties of pumpkin peel. The test was a part of FE modelling and simulation of mechanical peeling stage of tough skinned vegetables. The compression test has been conducted on Jap variety of pumpkin. Additionally, stress strain curve, bio-yield and toughness of pumpkin skin have been calculated. The required energy for reaching bio-yield point was 493.75, 507.71 and 451.71 N.mm for 1.25, 10 and 20 mm/min loading speed respectively. Average value of force in bio-yield point for pumpkin peel was 310 N.

Automated gathering of Web information: An in-depth examination of agents interacting with search engines

The Web has become a worldwide repository of information which individuals, companies, and organizations utilize to solve or address various information problems. Many of these Web users utilize automated agents to gather this information for them. Some assume that this approach represents a more sophisticated method of searching. However, there is little research investigating how Web agents search for online information. In this research, we first provide a classification for information agent using stages of information gathering, gathering approaches, and agent architecture. We then examine an implementation of one of the resulting classifications in detail, investigating how agents search for information on Web search engines, including the session, query, term, duration and frequency of interactions. For this temporal study, we analyzed three data sets of queries and page views from agents interacting with the Excite and AltaVista search engines from 1997 to 2002, examining approximately 900,000 queries submitted by over 3,000 agents. Findings include: (1) agent sessions are extremely interactive, with sometimes hundreds of interactions per second (2) agent queries are comparable to human searchers, with little use of query operators, (3) Web agents are searching for a relatively limited variety of information, wherein only 18% of the terms used are unique, and (4) the duration of agent-Web search engine interaction typically spans several hours. We discuss the implications for Web information agents and search engines.

Multimedia search capabilities of Chinese language search engines

This paper reports results from a study exploring the multimedia search functionality of Chinese language search engines. Web searching in Chinese (Mandarin) is a growing research area and a technical challenge for popular commercial Web search engines. Few studies have been conducted on Chinese language search engines. We investigate two research questions: which Chinese language search engines provide multimedia searching, and what multimedia search functionalities are available in Chinese language Web search engines. Specifically, we examine each Web search engine's (1) features permitting Chinese language multimedia searches, (2) extent of search personalization and user control of multimedia search variables, and (3) the relationships between Web search engines and their features in the Chinese context. Key findings show that Chinese language Web search engines offer limited multimedia search functionality, and general search engines provide a wider range of features than specialized multimedia search engines. Study results have implications for Chinese Web users, Website designers and Web search engine developers. © 2009 Elsevier Ltd. All rights reserved.

Defining a session on Web search engines

Detecting query reformulations within a session by a Web searcher is an important area of research for designing more helpful searching systems and targeting content to particular users. Methods explored by other researchers include both qualitative (i.e., the use of human judges to manually analyze query patterns on usually small samples) and nondeterministic algorithms, typically using large amounts of training data to predict query modification during sessions. In this article, we explore three alternative methods for detection of session boundaries. All three methods are computationally straightforward and therefore easily implemented for detection of session changes. We examine 2,465,145 interactions from 534,507 users of Dogpile.com on May 6, 2005. We compare session analysis using (a) Internet Protocol address and cookie; (b) Internet Protocol address, cookie, and a temporal limit on intrasession interactions; and (c) Internet Protocol address, cookie, and query reformulation patterns. Overall, our analysis shows that defining sessions by query reformulation along with Internet Protocol address and cookie provides the best measure, resulting in an 82% increase in the count of sessions. Regardless of the method used, the mean session length was fewer than three queries, and the mean session duration was less than 30 min. Searchers most often modified their query by changing query terms (nearly 23% of all query modifications) rather than adding or deleting terms. Implications are that for measuring searching traffic, unique sessions may be a better indicator than the common metric of unique visitors. This research also sheds light on the more complex aspects of Web searching involving query modifications and may lead to advances in searching tools.

Dynamic compression improves biosynthesis of human zonal chondrocytes from osteoarthritis patients

Objective: We hypothesize that chondrocytes from distinct zones of articular cartilage respond differently to compressive loading, and that zonal chondrocytes from osteoarthritis (OA) patients can benefit from optimized compressive stimulation. Therefore, we aimed to determine the transcriptional response of superficial (S) and middle/deep (MD) zone chondrocytes to varying dynamic compressive strain and loading duration. To confirm effects of compressive stimulation on overall matrix production, we subjected zonal chondrocytes to compression for 2 weeks. Design: Human S and MD chondrocytes from osteoarthritic joints were encapsulated in 2% alginate, pre-cultured, and subjected to compression with varying dynamic strain (5, 15, 50% at 1 Hz) and loading duration (1, 3, 12 h). Temporal changes in cartilage-specific, zonal, and dedifferentiation genes following compression were evaluated using quantitative real-time reverse transcriptase polymerase chain reaction (qRT-PCR). The benefits of long-term compression (50% strain, 3 h/day, for 2 weeks) were assessed by measuring construct glycosaminoglycan (GAG) content and compressive moduli, as well as immunostaining. Results: Compressive stimulation significantly induced aggrecan (ACAN), COL2A1, COL1A1, proteoglycan 4 (PRG4), and COL10A1 gene expression after 2 h of unloading, in a zone-dependent manner (P < 0.05). ACAN and PRG4 mRNA levels depended on strain and load duration, with 50% and 3 h loading resulting in highest levels (P < 0.05). Long-term compression increased collagen type II and ACAN immunostaining and total GAG (P < 0.05), but only S constructs showed more PRG4 stain, retained more GAG (P < 0.01), and developed higher compressive moduli than non-loaded controls. Conclusions: The biosynthetic activity of zonal chondrocytes from osteoarthritis joints can be enhanced with selected compression regimes, indicating the potential for cartilage tissue engineering applications. © 2012 Osteoarthritis Research Society International.

The effectiveness of a four layer compression bandage system in comparison to Class 3 compression hosiery on healing and quality of life for patients with venous leg ulcers : a randomised controlled trial

There are an increasing number of compression systems available for treatment of venous leg ulcers and limited evidence on the relative effectiveness of these systems. The purpose of this study was to conduct a randomised controlled trial to compare the effectiveness of a 4-layer compression bandage system with Class 3 compression hosiery on healing and quality of life in patients with venous leg ulcers. Data were collected from 103 participants on demographics, health, ulcer status, treatments, pain, depression and quality of life for 24 weeks. After 24 weeks, 86% of the 4-layer bandage group and 77% of the hosiery group were healed (p=0.24). Median time to healing for the bandage group was 10 weeks, in comparison to 14 weeks for the hosiery group (p=0.018). Cox proportional hazards regression found participants in the 4-layer system were 2.1 times (95% CI 1.2–3.5) more likely to heal than those in hosiery, while longer ulcer duration, larger ulcer area and higher depression scores significantly delayed healing. No differences between groups were found in quality of life or pain measures. Findings indicate these systems were equally effective in healing patients by 24 weeks, however a 4-layer system may produce a more rapid response.