Fatigue Life Assessment and Static Testing of Structural GFRP Tubes Based on Coupon Tests

Fiber-reinforced polymer (FRP) hollow tubes are used in structural applications, such as utility poles and pipelines. Concrete-filled FRP tubes (CFFTs) are also used as piles and bridge piers. Applications such as poles and marine piles are typically governed by cyclic bending. In this paper, the fatigue behavior of glass-FRP filament-wound tubes is studied using coupons cut from the tubes. Several coupon configurations were first examined in 24 tension and five compression monotonic loading tests. Fatigue tests were then conducted on 81 coupons to examine several parameters; namely, loading frequency as well as maximum-to-ultimate (max ult) and minimum-to-maximum (min max) stress ratios, including tension tension and tension compression, to simulate reversed bending. The study demonstrated the sensitivity of test results and failure mode to coupon configuration. The presence of compression loads reduced fatigue life, while increasing load frequency increased fatigue life. Stiffness degradation behavior was also established. To achieve at least one million cycles, it is recommended to limit (max ult) to 0.25. Models were used to simulate stiffness degradation and fatigue life curve of the tube. Fatigue life predictions of large CFFT beams showed good correlation with experimental results. © 2008 ASCE.

Swarm scheduling approaches for work-flow applications with security constraints in distributed data-intensive computing environments

The scheduling problem in distributed data-intensive computing environments has become an active research topic due to the tremendous growth in grid and cloud computing environments. As an innovative distributed intelligent paradigm, swarm intelligence provides a novel approach to solving these potentially intractable problems. In this paper, we formulate the scheduling problem for work-flow applications with security constraints in distributed data-intensive computing environments and present a novel security constraint model. Several meta-heuristic adaptations to the particle swarm optimization algorithm are introduced to deal with the formulation of efficient schedules. A variable neighborhood particle swarm optimization algorithm is compared with a multi-start particle swarm optimization and multi-start genetic algorithm. Experimental results illustrate that population based meta-heuristics approaches usually provide a good balance between global exploration and local exploitation and their feasibility and effectiveness for scheduling work-flow applications. © 2010 Elsevier Inc. All rights reserved.

Investigation of the M2/G2/1/ ∞, N Queue with Restricted Admission of Priority Customers and its Application to HSDPA Mobile Systems

This paper investigates a queuing system for QoS optimization of multimedia traffic consisting of aggregated streams with diverse QoS requirements transmitted to a mobile terminal over a common downlink shared channel. The queuing system, proposed for buffer management of aggregated single-user traffic in the base station of High-Speed Downlink Packet Access (HSDPA), allows for optimum loss/delay/jitter performance for end-user multimedia traffic with delay-tolerant non-real-time streams and partially loss tolerant real-time streams. In the queuing system, the real-time stream has non-preemptive priority in service but the number of the packets in the system is restricted by a constant. The non-real-time stream has no service priority but is allowed unlimited access to the system. Both types of packets arrive in the stationary Poisson flow. Service times follow general distribution depending on the packet type. Stability condition for the model is derived. Queue length distribution for both types of customers is calculated at arbitrary epochs and service completion epochs. Loss probability for priority packets is computed. Waiting time distribution in terms of Laplace-Stieltjes transform is obtained for both types of packets. Mean waiting time and jitter are computed. Numerical examples presented demonstrate the effectiveness of the queuing system for QoS optimization of buffered end-user multimedia traffic with aggregated real-time and non-real-time streams.

A Dynamic Buffer Management Scheme for End-to-End QoS Enhancement of Multi-flow Services in HSDPA

End-user multi-flow services support is a crucial aspect of current and next generation mobile networks. This paper presents a dynamic buffer management strategy for HSDPA end-user multi-flow traffic with aggregated real-time and non-real-time flows. The scheme incorporates dynamic priority switching between the flows for transmission on the HSDPA radio channel. The end-to-end performance of the proposed strategy is investigated with an end-user multi-flow session of simultaneous VoIP and TCP-based downlink traffic using detailed HSDPA system-level simulations. Compared to an equivalent static buffer management scheme, the results show that end-to-end throughput performance gains in the non-real-time flow and better HSDPA channel utilization is attainable without compromising the real-time VoIP flow QoS constraints

Invisible Targets, Strengthened Morale: Static Camouflage as a ‘Weapon of the Weak’

In the natural world, camouflage is habitually deployed by 'vulnerable' creatures to deceive predators. Such protective strategies have been culturally, socially and technologically translated into human societies, whereby camouflage has been used to mask intentions, actions, feelings and valuable objects or spaces. Through the material presence of such techniques, everyday spaces can become inscribed as places of sanctuary. Focusing on British civil camouflage work of the 1930s and 1940s, this paper explores the historical, cultural and political connotations of camouflage and how the attainment of invisibility, as a 'weapon of the weak', can both physically and affectively protect urban populations. © 2012 Copyright Taylor and Francis Group, LLC.

The temporal priority principle: at what age does this develop?

The temporal priority principle states that all causes must precede their effects. It is widely assumed that children's causal reasoning is guided by this principle from early in development. However, the empirical studies that have examined children's use of the principle, most of which were conducted some decades ago, in fact show inconsistent findings. Some researchers have argued that 3-year-olds reliably use this principle, whereas others have suggested that it is not until 5 years that children properly grasp the inviolability of the principle. To examine this issue, 100 children, 50 three-year-olds, and 50 four-year-olds, took part in a study in which they had to judge which of two causes yielded an effect. In the task, children saw one event (A), an effect (E), and then another event (B). The events A and B involved the rolling of balls down runways, and the effect E was a Jack-in-a-box popping up. The extent to which E left a visible trace was also varied, because comparisons across previous studies suggested that this may affect performance. As a group, 3- and 4-year-olds performed at above-chance levels, but performance improved with age. The nature of the effect did not have a significant impact on performance. Although some previous studies suggested that 3-year-olds may be more likely to choose B rather than A as a cause due to a recency effect, we found no evidence of this pattern of performance in the younger group. Potential explanations of the age-related improvement in performance are discussed. © 2013 Desmet.

Day-Ahead Optimal Charging/Discharging Scheduling for Electric Vehicles in Micro-Grids

A micro-grid is an autonomous system which can be operated and connected to an external system or isolated with the help of energy storage systems (ESSs). While the daily output of distributed generators (DGs) strongly depends on the temporal distribution of natural resources such as wind and solar, unregulated electric vehicle (EV) charging demand will deteriorate the imbalance between the daily load and generation curves. In this paper, a statistical model is presented to describe daily EV charging/discharging behaviour. An optimisation problem is proposed to obtain economic operation for the micro-grid based on this model. In day-ahead scheduling, with estimated information of power generation and load demand, optimal charging/discharging of EVs during 24 hours is obtained. A series of numerical optimization solutions in different scenarios is achieved by serial quadratic programming. The results show that optimal charging/discharging of EVs, a daily load curve can better track the generation curve and the network loss and required ESS capacity are both decreased. The paper also demonstrates cost benefits for EVs and operators.