Bang and bust: almost everything you wanted to know about sex and the mining boom (but were afraid to ask)

Recent growth and expansion of the fly-in/fly-out (FIFO) model of mining in remote rural Australia has led to concerns about the health and well-being of those employed by the mines and those in the small rural communities where they are based. A particular concern has been the potential disruption to sexual norms in mining towns and increases in sexually transmitted infections (STIs) and HIV.

An investigation into the effect of infrastructure on fly-in fly-out mining workers

Objective: To explore fly-in fly-out (FIFO) mining workers' attitudes towards the leisure time they spend in mining camps, the recreational and social aspects of mining camp culture, the camps' communal and recreational infrastructure and activities, and implications for health. Design: In-depth semistructured interviews. Setting: Individual interviews at locations convenient for each participant. Participants: A total of seven participants, one female and six males. The age group varied within 20–59 years. Marital status varied across participants. Main outcome measures: A qualitative approach was used to interview participants, with responses thematically analysed. Findings highlight how the recreational infrastructure and activities at mining camps impact participants' enjoyment of the camps and their feelings of community and social inclusion. Results: Three main areas of need were identified in the interviews, as follows: (i) on-site facilities and activities; (ii) the role of infrastructure in facilitating a sense of community; and (iii) barriers to social interaction. Conclusion: Recreational infrastructure and activities enhance the experience of FIFO workers at mining camps. The availability of quality recreational facilities helps promote social interaction, provides for greater social inclusion and improves the experience of mining camps for their temporary FIFO residents. The infrastructure also needs to allow for privacy and individual recreational activities, which participants identified as important emotional needs. Developing appropriate recreational infrastructure at mining camps would enhance social interactions among FIFO workers, improve their well-being and foster a sense of community. Introducing infrastructure to promote social and recreational activities could also reduce alcohol-related social exclusion.

The flip side of fly-in-fly-out : the use of 457 visas by smaller firms in the Western Australian resources sector

The focus in this article is how the extensive use of fly-in fly-out (FIFO) working arrangements in the Western Australian resources sector has an impact directly and indirectly on smaller firms and their ability to recruit workers in remote locations. We argue that the growth of FIFO working arrangements has disadvantaged smaller resource-sector firms by increasing their employment costs and decreasing their ability to attract skilled workers. As a result, smaller resource-sector firms are recruiting skilled workers on 457 visas to secure their business stability and growth, despite the complexity, costs, and risks involved.

Some Methods for Summarizing Survivorship Data in Nonstandard Situations

One difficulty in summarising biological survivorship data is that the hazard rates are often neither constant nor increasing with time or decreasing with time in the entire life span. The promising Weibull model does not work here. The paper demonstrates how bath tub shaped quadratic models may be used in such a case. Further, sometimes due to a paucity of data actual lifetimes are not as certainable. It is shown how a concept from queuing theory namely first in first out (FIFO) can be profitably used here. Another nonstandard situation considered is one in which lifespan of the individual entity is too long compared to duration of the experiment. This situation is dealt with, by using ancilliary information. In each case the methodology is illustrated with numerical examples.

RECONNECT: A NoC for polymorphic ASICs using a low overhead single cycle router

A polymorphic ASIC is a runtime reconfigurable hardware substrate comprising compute and communication elements. It is a ldquofuture proofrdquo custom hardware solution for multiple applications and their derivatives in a domain. Interoperability between application derivatives at runtime is achieved through hardware reconfiguration. In this paper we present the design of a single cycle Network on Chip (NoC) router that is responsible for effecting runtime reconfiguration of the hardware substrate. The router design is optimized to avoid FIFO buffers at the input port and loop back at output crossbar. It provides virtual channels to emulate a non-blocking network and supports a simple X-Y relative addressing scheme to limit the control overhead to 9 bits per packet. The 8times8 honeycomb NoC (RECONNECT) implemented in 130 nm UMC CMOS standard cell library operates at 500 MHz and has a bisection bandwidth of 28.5 GBps. The network is characterized for random, self-similar and application specific traffic patterns that model the execution of multimedia and DSP kernels with varying network loads and virtual channels. Our implementation with 4 virtual channels has an average network latency of 24 clock cycles and throughput of 62.5% of the network capacity for random traffic. For application specific traffic the latency is 6 clock cycles and throughput is 87% of the network capacity.

Australian fly-in, fly-out operations: Impacts on communities, safety workers and their families

Background Australia’s mineral, resource and infrastructure sectors continues to expand as operations in rural and remote locations increasingly rely on fly-in, fly-out or drive-in, drive-out workforces in order to become economically competitive. The issues in employing these workforces are becoming more apparent and include a range of physical, mental, psychosocial, safety and community challenges. Objectives This review aims to consolidate a range of research conducted to communicate potential challenges for industry in relation to a wide variety of issues when engaging and using FIFO/DIDO workforces which includes roster design, working hours, fatigue, safety performance, employee wellbeing, turnover, psychosocial relationships and community concerns. Methods A wide literature review was performed using EBSCOhost and Google Scholar, with a focus on FIFO or DIDO workforces engaged within the resources sector. Results A number of existing gaps in the management of FIFO workforces and potential for future research were identified. This included the identification of various roster designs and hours worked across the resources industry and how to best understand the influences of roster swings, and work hours on fatigue, safety, psychological wellbeing and job satisfaction. Fatigue management, particularly in relation to travelling after extended work shifts can increase the risk for road safety and influence safety performance while at work due to a culmination of long hours, roster cycle and accumulated sleep debt. Further challenges associated with the engagement of this workforce include feelings of isolation, physiological and general health and lifestyle concerns. Conclusions FIFO workforces appear to be at an increased risk physically and mentally due to a wide range of influences of this unique lifestyle, particularly in relation to rosters, length of shift and feelings of community disengagement. Research and data collected has been limited in understanding the influences on employee engagement, satisfaction, retention and safety. Ensuring the challenges associated with FIFO employment are understood, addressed and communicated to workers and their families may assist.

Non-resident workers: A comparison of family support services for resource, health, and defence communities

Non-resident workforces experience high labour turnover, which has an impact on organisational operations and affects worker satisfaction and, in turn, partners’ ability to cope with work-related absences. Research suggests that partner satisfaction may be increased by providing a range of support services, which include professional, practical, and social support. A search was conducted to identify support available for resources and health-industry non-resident workers. These were compared to the supports available to families of deployed defence personnel. They were used to compare and contrast the spread available for each industry. The resources industry primarily provided social support, and lacked an inclusion of professional and practical supports. Health-professional support services were largely directed towards extended locum support, rather than to Fly-In Fly-Out workers. Improving sources of support which parallel support provided to the Australian Defence Force is suggested as a way to increase partner satisfaction. The implications are to understand the level of uptake, perceived importance, and utilisation of such support services.

An efficient and scalable checkpointing and recovery algorithm for distributed systems

In this paper, we describe an efficient coordinated-checkpointing and recovery algorithm which can work even when the channels are assumed to be non-FIFO, and messages may be lost. Nodes are assumed to be autonomous, and they do not block while taking checkpoints. Based on the local conditions, any process can request the previous coordinator for the 'permission' to initiate a new checkpoint. Allowing multiple initiators of checkpoints avoids the bottleneck associated with a single initiator, but the algorithm permits only a single instance of checkpointing process at any given time, thus reducing much of the overhead associated with multiple initiators of distributed algorithms.

Emulating Optimal Replacement with a Shepherd Cache

The inherent temporal locality in memory accesses is filtered out by the L1 cache. As a consequence, an L2 cache with LRU replacement incurs significantly higher misses than the optimal replacement policy (OPT). We propose to narrow this gap through a novel replacement strategy that mimics the replacement decisions of OPT. The L2 cache is logically divided into two components, a Shepherd Cache (SC) with a simple FIFO replacement and a Main Cache (MC) with an emulation of optimal replacement. The SC plays the dual role of caching lines and guiding the replacement decisions in MC. Our pro- posed organization can cover 40% of the gap between OPT and LRU for a 2MB cache resulting in 7% overall speedup. Comparison with the dynamic insertion policy, a victim buffer, a V-Way cache and an LRU based fully associative cache demonstrates that our scheme performs better than all these strategies.

An adaptive reliable transport protocol based on automatic reSend reQuest(ASQ) technique for wireless sensor networks

There are many wireless sensor network(WSN) applications which require reliable data transfer between the nodes. Several techniques including link level retransmission, error correction methods and hybrid Automatic Repeat re- Quest(ARQ) were introduced into the wireless sensor networks for ensuring reliability. In this paper, we use Automatic reSend request(ASQ) technique with regular acknowledgement to design reliable end-to-end communication protocol, called Adaptive Reliable Transport(ARTP) protocol, for WSNs. Besides ensuring reliability, objective of ARTP protocol is to ensure message stream FIFO at the receiver side instead of the byte stream FIFO used in TCP/IP protocol suite. To realize this objective, a new protocol stack has been used in the ARTP protocol. The ARTP protocol saves energy without affecting the throughput by sending three different types of acknowledgements, viz. ACK, NACK and FNACK with semantics different from that existing in the literature currently and adapting to the network conditions. Additionally, the protocol controls flow based on the receiver's feedback and congestion by holding ACK messages. To the best of our knowledge, there has been little or no attempt to build a receiver controlled regularly acknowledged reliable communication protocol. We have carried out extensive simulation studies of our protocol using Castalia simulator, and the study shows that our protocol performs better than related protocols in wireless/wire line networks, in terms of throughput and energy efficiency.

基于神经计算机的高速数据通道设计

Submitted by 阎军 (yanj@red.semi.ac.cn) on 2010-04-07T05:12:26Z No. of bitstreams: 1 刘蕾.pdf: 905512 bytes, checksum: 70a01dddda97f75dad960dd632bb30e0 (MD5)

平台式FPGA中可重构存储器模块的设计

可重构静态存储器(SRAM)模块是场可编程门阵列(FPGA)的重要组成部分,它必须尽量满足用户不同的需要,所以要有良好的可重构性能.本文设计了一款深亚微米工艺下的16-kb的高速,低功耗双端口可重构SRAM.它可以重构成16Kx1,8Kx2,4Kx4,2Kx8,1Kx16和512x32六种不同的工作模式.基于不同的配置选择,此SRAM可以配置为双端口SRAM,单端口SRAM,ROM,FIFO,大的查找表或移位寄存器,本文完整介绍了该SRAM的设计方法,重点介绍了一种新颖的存储单元电路结构:三端口存储单元,以及用于实现可重构功能的电路的设计方法.

基于DSP的磁场电源控制器软件设计

为了使兰州重离子加速器冷却储存环的磁场电源控制器及时更新输出的波形数据,以TI公司的TM320C6713芯片为中央处理器,结合FPGA逻辑编程,采用双FIFO数据缓存机制和Aitken插值算法,编写并优化了磁场电源控制器软件系统。利用数据驱动模式的编程方式提高了系统的执行效率和可维护性。同时通过对更新的波形数据做Aitken插值运算,使其大小减少为原始数据的1/1024,提高了数据的传输和存储效率。经现场测试,本软件系统运行稳定可行,达到设计要求。

Time-dependent Hyperstar algorithm for robust vehicle navigation in time-dependent stochastic road networks.

The vehicle navigation problem studied in Bell (2009) is revisited and a time-dependent reverse Hyperstar algorithm is presented. This minimises the expected time of arrival at the destination, and all intermediate nodes, where expectation is based on a pessimistic (or risk-averse) view of unknown link delays. This may also be regarded as a hyperpath version of the Chabini and Lan (2002) algorithm, which itself is a time-dependent A* algorithm. Links are assigned undelayed travel times and maximum delays, both of which are potentially functions of the time of arrival at the respective link. The driver seeks probabilities for link use that minimise his/her maximum exposure to delay on the approach to each node, leading to the determination of the pessimistic expected time of arrival. Since the context considered is vehicle navigation where the driver is not making repeated trips, the probability of link use may be interpreted as a measure of link attractiveness, so a link with a zero probability of use is unattractive while a link with a probability of use equal to one will have no attractive alternatives. A solution algorithm is presented and proven to solve the problem provided the node potentials are feasible and a FIFO condition applies for undelayed link travel times. The paper concludes with a numerical example.

Efficiently and Fairly Allocating Bandwidth at a Highly Congested Link

We consider the problem of efficiently and fairly allocating bandwidth at a highly congested link to a diverse set of flows, including TCP flows with various Round Trip Times (RTT), non-TCP-friendly flows such as Constant-Bit-Rate (CBR) applications using UDP, misbehaving, or malicious flows. Though simple, a FIFO queue management is vulnerable. Fair Queueing (FQ) can guarantee max-min fairness but fails at efficiency. RED-PD exploits the history of RED's actions in preferentially dropping packets from higher-rate flows. Thus, RED-PD attempts to achieve fairness at low cost. By relying on RED's actions, RED-PD turns out not to be effective in dealing with non-adaptive flows in settings with a highly heterogeneous mix of flows. In this paper, we propose a new approach we call RED-NB (RED with No Bias). RED-NB does not rely on RED's actions. Rather it explicitly maintains its own history for the few high-rate flows. RED-NB then adaptively adjusts flow dropping probabilities to achieve max-min fairness. In addition, RED-NB helps RED itself at very high loads by tuning RED's dropping behavior to the flow characteristics (restricted in this paper to RTTs) to eliminate its bias against long-RTT TCP flows while still taking advantage of RED's features at low loads. Through extensive simulations, we confirm the fairness of RED-NB and show that it outperforms RED, RED-PD, and CHOKe in all scenarios.