Intensive cognitive-behaviour therapy for depression : preliminary findings with four country residents

Describes a brief intensive program of cognitive therapy for depression that was designed for 4 adult residents of country towns in Australia, who resided some distance from treatment centers. Ss were assessed prior to treatment, at posttreatment, and at 4-wk, 8-wk, and 20-mo follow-ups. Treatments took place over 3 consecutive days for a total period of 15 hrs. Effects were highly consistent with the impact of group treatments delivered on a more traditional schedule. If confirmed in a controlled group study, these results suggest that cognitive therapy may be applied more economically and more widely than was previously realized.

The missing puzzle : birth of a format

The art of storytelling is one of the oldest forms of creative discourse. Apart from finding stories, the most important job in television is the construction of stories to have a broad audience appeal. This first-hand review of Missing Persons Unit, hereafter referred to as MPU, a prime time program on the Nine Network in Australia with immense audience appeal, is an original work by the executive producer (development and series producer Series One, executive producer Series Two and Three) based on an overview of two-and-a-half years of production on three series. Through a case study approach, this Masters project explores how story is constructed into a television format. The thesis comprises two parts: the creative component (weighted 50%) is demonstrated through two programs of MPU (one program for evaluation) and the academic component through a written exegesis (50%). This case study aims to demonstrate how observational hybrid series such as MPU can be managed to quick turn-around schedules with precise skill sets that cut across a number of traditional genre styles. With the advent of radio and then television, storytelling found a home and a series of labels called genres to help place them in a schedule for listeners and viewers to choose. Over recent years, with the advent of digital technology and the rush to collect the masses of content required to feed the growing television slate, storytelling has often been replaced by story gathering. Today even in factual series where a clear story construct is important, third party ‘quick fix’ specialists are hired to shape raw content shot by a field team, who never put their own work together and may never come into the edit suite during a project. This thesis explores the art of storytelling in fast turn-around television. In particular it explores the layer cake approach used in the production process of MPU, that enables producers of fast turn-around television to shepherd their own stories from field through to post-production. While each new hybrid series will require its own particular sets of skills, the exploration of the genesis of MPU will demonstrate the building blocks required to successfully produce this type of factual series. This study is also intended as a ‘road map’ for producers who wish to develop similar series.

Optimizing construction planning schedules by virtual prototyping enabled resource analysis

The inherent uncertainty and complexity of construction work make construction planning a particularly difficult task for project managers due to the need to anticipate and visualize likely future events. Conventional computer-assisted technology can help but is often limited to the constructability issues involved. Virtual prototyping, however, offers an improved method through the visualization of construction activities by computer simulation — enabling a range of ‘what-if’ questions to be asked and their implications on the total project to be investigated. This paper describes the use of virtual prototyping to optimize construction planning schedules by analyzing resource allocation and planning with integrated construction models, resource models, construction planning schedules and site-layout plans. A real-life case study is presented that demonstrates the use of a virtual prototyping enabled resource analysis to reallocate space, logistic on access road and arrange tower cranes to achieve a 6-day floor construction cycle.

Scheduling trains as a blocking parallel-machine job shop scheduling problem

In this paper, the train scheduling problem is modelled as a blocking parallel-machine job shop scheduling (BPMJSS) problem. In the model, trains, single-track sections and multiple-track sections, respectively, are synonymous with jobs, single machines and parallel machines, and an operation is regarded as the movement/traversal of a train across a section. Due to the lack of buffer space, the real-life case should consider blocking or hold-while-wait constraints, which means that a track section cannot release and must hold the train until next section on the routing becomes available. Based on literature review and our analysis, it is very hard to find a feasible complete schedule directly for BPMJSS problems. Firstly, a parallel-machine job-shop-scheduling (PMJSS) problem is solved by an improved shifting bottleneck procedure (SBP) algorithm without considering blocking conditions. Inspired by the proposed SBP algorithm, feasibility satisfaction procedure (FSP) algorithm is developed to solve and analyse the BPMJSS problem, by an alternative graph model that is an extension of the classical disjunctive graph models. The proposed algorithms have been implemented and validated using real-world data from Queensland Rail. Sensitivity analysis has been applied by considering train length, upgrading track sections, increasing train speed and changing bottleneck sections. The outcomes show that the proposed methodology would be a very useful tool for the real-life train scheduling problems

A robust reactive scheduling model for intensive care units

The ICU is an integral part of any hospital and is under great load from patient arrivals as well as resource limitations. Scheduling of patients in the ICU is complicated by the two general types; elective surgery and emergency arrivals. This complicated situation is handled by creating a tentative initial schedule and then reacting to uncertain arrivals as they occur. For most hospitals there is little or no flexibility in the number of beds that are available for use now or in the future. We propose an integer programming model to handle a parallel machine reacting system for scheduled and unscheduled arrivals.

Rostering ambulance services

This paper developed a model for rostering ambulance crew in order to maximise the coverage throughout a planning horizon and minimise the number of ambulance crew. Rostering Ambulance Services is a complex task, which considers a large number of conflicting rules related to various aspects such as limits on the number of consecutive work hours, the number of shifts worked by each ambulance staff and restrictions on the type of shifts assigned. The two-stage models are developed using nonlinear integer programming technique to determine the following sub-problems: the shift start times; the number of staff required to work for each shift; and a balanced schedule of ambulance staff. At the first stage, the first two sub-problems have been solved. At the second stage, the third sub-problem has been solved using the first stage outputs. Computational experiments with real data are conducted and the results of the models are presented.

Online scheduling in the operating theatre

Online scheduling is considered in this paper for the Operating Theatre. Robust elective schedules are determined in the offline environment prior to the day of surgery for the online environment. Changes to the offline schedule during project implementation are minimized using an online scheduling model that operates in real-time. The model aims to minimise cancellations of pre-scheduled elective patients whilst also allowing for additional scheduling of emergency cases, time permitting, which may arise during the schedules implementation. Surgical durations are modelled with a lognormal distribution. The single theatre case is solved and the computationally complex multiple theatre case, which is left for future work, is discussed.

A sequencing approach for creating new train timetables

Train scheduling is a complex and time consuming task of vital importance. To schedule trains more accurately and efficiently than permitted by current techniques a novel hybrid job shop approach has been proposed and implemented. Unique characteristics of train scheduling are first incorporated into a disjunctive graph model of train operations. A constructive algorithm that utilises this model is then developed. The constructive algorithm is a general procedure that constructs a schedule using insertion, backtracking and dynamic route selection mechanisms. It provides a significant search capability and is valid for any objective criteria. Simulated Annealing and Local Search meta-heuristic improvement algorithms are also adapted and extended. An important feature of these approaches is a new compound perturbation operator that consists of many unitary moves that allows trains to be shifted feasibly and more easily within the solution. A numerical investigation and case study is provided and demonstrates that high quality solutions are obtainable on real sized applications.

Signs, symptoms and comorbidities in contact lens-related microbial keratitis

Purpose: The aim of this study was to characterize the clinical signs, symptoms, and ocular and systemic comorbidities in a large case series of contact lens-related microbial keratitis. Methods: Two hundred ninety-seven cases of contact lens-related microbial keratitis, aged between 15 and 64 years were detected through surveillance of hospital and community based ophthalmic practitioners in Australia and New Zealand. Full clinical data were available for 190 cases and 90 were interviewed by telephone. Clinical data included the size, location, and degree of anterior chamber response. Symptom data were available from the practitioner and from participant self-report. Associations between symptoms and disease severity were evaluated. Data on ocular and systemic disease were collected from participants and practitioners. The frequency of comorbidities was compared between the different severities of disease and to population norms. Results: More severe disease was associated with greater symptom severity and pain was the most prevalent symptom reported. Ninety-one percent of cases showed progression of ocular symptoms after lens removal, and symptom progression was associated with all severities of disease. Twenty-five percent of cases reported prior episodes requiring emergency attention. Thyroid disease (p 0.05) and self-reported poor health (p 0.001) were more common in cases compared with age-matched population norms. Discussion: Information on the signs, symptoms, and comorbidities associated with contact lens-related microbial keratitis may be useful in patient education and for practitioners involved in the fitting of lenses and management of complications. Although pain was the most common symptom experienced, progression of symptoms despite lens removal was close to universal. Poor general health, particularly respiratory disease and thyroid disease was more common in cases than in the general population, which may prompt practitioners to recommend flexibility in wear schedules when in poor health or the selection of a lower risk wear schedule in at risk patients

The key lessons learnt from producing the ABC programme Talking Heads a talk show/documentary hybrid in a fast turnaround environment

The following exegesis will detail the key advantages and disadvantages of combining a traditional talk show genre with a linear documentary format using a small production team and a limited budget in a fast turnaround weekly environment. It will deal with the Australian Broadcasting Corporation series Talking Heads, broadcast weekly in the early evening schedule for the network at 18.30 with the presenter Peter Thompson. As Executive Producer for the programme at its inception I was responsible for setting it up for the ABC in Brisbane, a role that included selecting most of the team to work on the series and commissioning the music, titles and all other aspects required to bring the show to the screen. What emerged when producing this generic hybrid will be examined at length, including: „h The talk show/documentary hybrid format needs longer than 26¡¦30¡¨ to be entirely successful. „h The type of presenter ideally suited to the talk show/documentary format requires someone who is genuinely interested in their guests and flexible enough to maintain the format against tangential odds. „h The use of illustrative footage shot in a documentary style narrative improves the talk show format. iv „h The fast turnaround of the talk show/documentary hybrid puts tremendous pressure on the time frames for archive research and copyright clearance and therefore needs to be well-resourced. „h In a fast turnaround talk show/documentary format the field components are advantageous but require very low shooting ratios to be sustainable. „h An intimate set works best for a talk show hybrid like this. Also submitted are two DVDs of recordings of programmes I produced and directed from the first and third series. These are for consideration in the practical component of this project and reflect the changes that I made to the series.

Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion

In the paper, the flow-shop scheduling problem with parallel machines at each stage (machine center) is studied. For each job its release and due date as well as a processing time for its each operation are given. The scheduling criterion consists of three parts: the total weighted earliness, the total weighted tardiness and the total weighted waiting time. The criterion takes into account the costs of storing semi-manufactured products in the course of production and ready-made products as well as penalties for not meeting the deadlines stated in the conditions of the contract with customer. To solve the problem, three constructive algorithms and three metaheuristics (based one Tabu Search and Simulated Annealing techniques) are developed and experimentally analyzed. All the proposed algorithms operate on the notion of so-called operation processing order, i.e. the order of operations on each machine. We show that the problem of schedule construction on the base of a given operation processing order can be reduced to the linear programming task. We also propose some approximation algorithm for schedule construction and show the conditions of its optimality.

How environmental and organizational complexity affects opportunity recognition and exploitation in development projects

Principal Topic: Project structures are often created by entrepreneurs and large corporate organizations to develop new products. Since new product development projects (NPDP) are more often situated within a larger organization, intrapreneurship or corporate entrepreneurship plays an important role in bringing these projects to fruition. Since NPDP often involves the development of a new product using immature technology, we describe development of an immature technology. The Joint Strike Fighter (JSF) F-35 aircraft is being developed by the U.S. Department of Defense and eight allied nations. In 2001 Lockheed Martin won a $19 billion contract to develop an affordable, stealthy and supersonic all-weather strike fighter designed to replace a wide range of aging fighter aircraft. In this research we define a complex project as one that demonstrates a number of sources of uncertainty to a degree, or level of severity, that makes it extremely difficult to predict project outcomes, to control or manage project (Remington & Zolin, Forthcoming). Project complexity has been conceptualized by Remington and Pollock (2007) in terms of four major sources of complexity; temporal, directional, structural and technological complexity (See Figure 1). Temporal complexity exists when projects experience significant environmental change outside the direct influence or control of the project. The Global Economic Crisis of 2008 - 2009 is a good example of the type of environmental change that can make a project complex as, for example in the JSF project, where project managers attempt to respond to changes in interest rates, international currency exchange rates and commodity prices etc. Directional complexity exists in a project where stakeholders' goals are unclear or undefined, where progress is hindered by unknown political agendas, or where stakeholders disagree or misunderstand project goals. In the JSF project all the services and all non countries have to agree to the specifications of the three variants of the aircraft; Conventional Take Off and Landing (CTOL), Short Take Off/Vertical Landing (STOVL) and the Carrier Variant (CV). Because the Navy requires a plane that can take off and land on an aircraft carrier, that required a special variant of the aircraft design, adding complexity to the project. Technical complexity occurs in a project using technology that is immature or where design characteristics are unknown or untried. Developing a plane that can take off on a very short runway and land vertically created may highly interdependent technological challenges to correctly locate, direct and balance the lift fans, modulate the airflow and provide equivalent amount of thrust from the downward vectored rear exhaust to lift the aircraft and at the same time control engine temperatures. These technological challenges make costing and scheduling equally challenging. Structural complexity in a project comes from the sheer numbers of elements such as the number of people, teams or organizations involved, ambiguity regarding the elements, and the massive degree of interconnectedness between them. While Lockheed Martin is the prime contractor, they are assisted in major aspects of the JSF development by Northrop Grumman, BAE Systems, Pratt & Whitney and GE/Rolls-Royce Fighter Engineer Team and innumerable subcontractors. In addition to identifying opportunities to achieve project goals, complex projects also need to identify and exploit opportunities to increase agility in response to changing stakeholder demands or to reduce project risks. Complexity Leadership Theory contends that in complex environments adaptive and enabling leadership are needed (Uhl-Bien, Marion and McKelvey, 2007). Adaptive leadership facilitates creativity, learning and adaptability, while enabling leadership handles the conflicts that inevitably arise between adaptive leadership and traditional administrative leadership (Uhl-Bien and Marion, 2007). Hence, adaptive leadership involves the recognition and opportunities to adapt, while and enabling leadership involves the exploitation of these opportunities. Our research questions revolve around the type or source of complexity and its relationship to opportunity recognition and exploitation. For example, is it only external environmental complexity that creates the need for the entrepreneurial behaviours, such as opportunity recognition and opportunity exploitation? Do the internal dimensions of project complexity, such as technological and structural complexity, also create the need for opportunity recognition and opportunity exploitation? The Kropp, Zolin and Lindsay model (2009) describes a relationship between entrepreneurial orientation (EO), opportunity recognition (OR), and opportunity exploitation (OX) in complex projects, with environmental and organizational contextual variables as moderators. We extend their model by defining the affects of external complexity and internal complexity on OR and OX. ---------- Methodology/Key Propositions: When the environment complex EO is more likely to result in OR because project members will be actively looking for solutions to problems created by environmental change. But in projects that are technologically or structurally complex project leaders and members may try to make the minimum changes possible to reduce the risk of creating new problems due to delays or schedule changes. In projects with environmental or technological complexity project leaders who encourage the innovativeness dimension of EO will increase OR in complex projects. But projects with technical or structural complexity innovativeness will not necessarily result in the recognition and exploitation of opportunities due to the over-riding importance of maintaining stability in the highly intricate and interconnected project structure. We propose that in projects with environmental complexity creating the need for change and innovation project leaders, who are willing to accept and manage risk, are more likely to identify opportunities to increase project effectiveness and efficiency. In contrast in projects with internal complexity a much higher willingness to accept risk will be necessary to trigger opportunity recognition. In structurally complex projects we predict it will be less likely to find a relationship between risk taking and OP. When the environment is complex, and a project has autonomy, they will be motivated to execute opportunities to improve the project's performance. In contrast, when the project has high internal complexity, they will be more cautious in execution. When a project experiences high competitive aggressiveness and their environment is complex, project leaders will be motivated to execute opportunities to improve the project's performance. In contrast, when the project has high internal complexity, they will be more cautious in execution. This paper reports the first stage of a three year study into the behaviours of managers, leaders and team members of complex projects. We conduct a qualitative study involving a Group Discussion with experienced project leaders. The objective is to determine how leaders of large and potentially complex projects perceive that external and internal complexity will influence the affects of EO on OR. ---------- Results and Implications: These results will help identify and distinguish the impact of external and internal complexity on entrepreneurial behaviours in NPDP. Project managers will be better able to quickly decide how and when to respond to changes in the environment and internal project events.

Violence, Spatiality and other Rurals

Occidentalism, which treats the other as the same, can be detected in both the criminological and rural sociological treatment of violence in the sociospatial sites of rural countrysides. Criminology tends to mistakenly assume that violence in the modern world is primarily an urban phenomenon (Baldwin & Bottoms, 1976, p. 1; Braithwaite, 1989, p. 47). If violence in rural settings is encountered it tends to be treated as a smaller scale version of the urban problem, or the importation of an otherwise urban problem - as the corrupting influence of the gesellschaft within the gemeinschaft. Within much rural sociology violence is rendered invisible by the assumption that rural communities conform to the idealised conception of the typical gemeinschaft society, small-scale traditional societies based on strong cohesiveness, intimacy and organic forms of solidarity. What these bonds conceal, rather than reveal - violence within the family - remains invisible to the public gaze. The visibility of violence within Aboriginal families and communities presents a major exception to the spatially ordered social relations which render so much white family violence hidden. The need to take into account the complexity and diversity of these sociospatial relations is concretely highlighted in our research which has taken us out of the urban context and confronted us not only with the phenomenon of the violence of other rurals, but also with fundamentally competing claims on, and conceptions of, space and place in the context of a racially divided Australian interior. This article represents the second installment of conceptual reflections on this research, with the first having been published in this journal in 1998.

Modelling and solving train scheduling problems under capacity constraints

Many large coal mining operations in Australia rely heavily on the rail network to transport coal from mines to coal terminals at ports for shipment. Over the last few years, due to the fast growing demand, the coal rail network is becoming one of the worst industrial bottlenecks in Australia. As a result, this provides great incentives for pursuing better optimisation and control strategies for the operation of the whole rail transportation system under network and terminal capacity constraints. This PhD research aims to achieve a significant efficiency improvement in a coal rail network on the basis of the development of standard modelling approaches and generic solution techniques. Generally, the train scheduling problem can be modelled as a Blocking Parallel- Machine Job-Shop Scheduling (BPMJSS) problem. In a BPMJSS model for train scheduling, trains and sections respectively are synonymous with jobs and machines and an operation is regarded as the movement/traversal of a train across a section. To begin, an improved shifting bottleneck procedure algorithm combined with metaheuristics has been developed to efficiently solve the Parallel-Machine Job- Shop Scheduling (PMJSS) problems without the blocking conditions. Due to the lack of buffer space, the real-life train scheduling should consider blocking or hold-while-wait constraints, which means that a track section cannot release and must hold a train until the next section on the routing becomes available. As a consequence, the problem has been considered as BPMJSS with the blocking conditions. To develop efficient solution techniques for BPMJSS, extensive studies on the nonclassical scheduling problems regarding the various buffer conditions (i.e. blocking, no-wait, limited-buffer, unlimited-buffer and combined-buffer) have been done. In this procedure, an alternative graph as an extension of the classical disjunctive graph is developed and specially designed for the non-classical scheduling problems such as the blocking flow-shop scheduling (BFSS), no-wait flow-shop scheduling (NWFSS), and blocking job-shop scheduling (BJSS) problems. By exploring the blocking characteristics based on the alternative graph, a new algorithm called the topological-sequence algorithm is developed for solving the non-classical scheduling problems. To indicate the preeminence of the proposed algorithm, we compare it with two known algorithms (i.e. Recursive Procedure and Directed Graph) in the literature. Moreover, we define a new type of non-classical scheduling problem, called combined-buffer flow-shop scheduling (CBFSS), which covers four extreme cases: the classical FSS (FSS) with infinite buffer, the blocking FSS (BFSS) with no buffer, the no-wait FSS (NWFSS) and the limited-buffer FSS (LBFSS). After exploring the structural properties of CBFSS, we propose an innovative constructive algorithm named the LK algorithm to construct the feasible CBFSS schedule. Detailed numerical illustrations for the various cases are presented and analysed. By adjusting only the attributes in the data input, the proposed LK algorithm is generic and enables the construction of the feasible schedules for many types of non-classical scheduling problems with different buffer constraints. Inspired by the shifting bottleneck procedure algorithm for PMJSS and characteristic analysis based on the alternative graph for non-classical scheduling problems, a new constructive algorithm called the Feasibility Satisfaction Procedure (FSP) is proposed to obtain the feasible BPMJSS solution. A real-world train scheduling case is used for illustrating and comparing the PMJSS and BPMJSS models. Some real-life applications including considering the train length, upgrading the track sections, accelerating a tardy train and changing the bottleneck sections are discussed. Furthermore, the BPMJSS model is generalised to be a No-Wait Blocking Parallel- Machine Job-Shop Scheduling (NWBPMJSS) problem for scheduling the trains with priorities, in which prioritised trains such as express passenger trains are considered simultaneously with non-prioritised trains such as freight trains. In this case, no-wait conditions, which are more restrictive constraints than blocking constraints, arise when considering the prioritised trains that should traverse continuously without any interruption or any unplanned pauses because of the high cost of waiting during travel. In comparison, non-prioritised trains are allowed to enter the next section immediately if possible or to remain in a section until the next section on the routing becomes available. Based on the FSP algorithm, a more generic algorithm called the SE algorithm is developed to solve a class of train scheduling problems in terms of different conditions in train scheduling environments. To construct the feasible train schedule, the proposed SE algorithm consists of many individual modules including the feasibility-satisfaction procedure, time-determination procedure, tune-up procedure and conflict-resolve procedure algorithms. To find a good train schedule, a two-stage hybrid heuristic algorithm called the SE-BIH algorithm is developed by combining the constructive heuristic (i.e. the SE algorithm) and the local-search heuristic (i.e. the Best-Insertion- Heuristic algorithm). To optimise the train schedule, a three-stage algorithm called the SE-BIH-TS algorithm is developed by combining the tabu search (TS) metaheuristic with the SE-BIH algorithm. Finally, a case study is performed for a complex real-world coal rail network under network and terminal capacity constraints. The computational results validate that the proposed methodology would be very promising because it can be applied as a fundamental tool for modelling and solving many real-world scheduling problems.