Accurately simulating the production of radiotherapy portal images using non-zero beam angles

In this study, the delivery and portal imaging of one square-field and one conformal radiotherapy treatment was simulated using the Monte Carlo codes BEAMnrc and DOSXYZnrc. The treatment fields were delivered to a humanoid phantom from different angles by a 6 MV photon beam linear accelerator, with an amorphous-silicon electronic portal imaging device (a-Si EPID) used to provide images of the phantom generated by each field. The virtual phantom preparation code CTCombine was used to combine a computed-tomography-derived model of the irradiated phantom with a simple, rectilinear model of the a-Si EPID, at each beam angle used in the treatment. Comparison of the resulting experimental and simulated a-Si EPID images showed good agreement, within \[gamma](3%, 3 mm), indicating that this method may be useful in providing accurate Monte Carlo predictions of clinical a-Si EPID images, for use in the verification of complex radiotherapy treatments.

Development of a high-level gene expression system for the production of bioplastics in sugarcane

Despite various approaches, the production of biodegradable plastics such as polyhydroxybutyrate (PHB) in transgenic plants has met with limited success due largely to low expression levels. Even in the few instances where high levels of protein expression have been reported, the transgenic plants have been stunted indicating PHB is phytotoxic (Poirier 2002). This PhD describes the application of a novel virus-based gene expression technology, termed InPAct („In Plant Activation.), for the production of PHB in tobacco and sugarcane. InPAct is based on the rolling circle replication mechanism by which circular ssDNA viruses replicate and provides a system for controlled, high-level gene expression. Based on these features, InPAct was thought to represent an ideal system to enable the controlled, high-level expression of the three phb genes (phbA, phbB and phbC) required for PHB production in sugarcane at a preferred stage of plant growth. A Tobacco yellow dwarf virus (TbYDV)-based InPAct-phbA vector, as well as linear vectors constitutively expressing phbB and phbC were constructed and different combinations were used to transform tobacco leaf discs. A total of four, eight, three and three phenotypically normal tobacco lines were generated from discs transformed with InPAct-phbA, InPAct-phbA + p1300-TaBV P-phbB/phbC- 35S T, p1300-35S P-phbA-NOS T + p1300-TaBV P-phbB/phbC-35S T and InPAct-GUS, respectively. To determine whether the InPAct cassette could be activated in the presence of the TbYDV Rep, leaf samples from the eight InPActphbA + p1300-TaBV P-phbB/phbC-35S T plants were agroinfiltrated with p1300- TbYDV-Rep/RepA. Three days later, successful activation was indicated by the detection of episomes using both PCR and Southern analysis. Leaf discs from the eight InPAct-phbA + p1300-TaBV P-phbB/phbC-35S T transgenic plant lines were agroinfiltrated with p1300-TbYDV-Rep/RepA and leaf tissue was collected ten days post-infiltration and examined for the presence of PHB granules. Confocal microscopy and TEM revealed the presence of typical PHB granules in five of the eight lines, thus demonstrating the functionality of InPActbased PHB production in tobacco. However, analysis of leaf extracts by HPLC failed to detect the presence of PHB suggesting only very low level expression levels. Subsequent molecular analysis of three lines revealed low levels of correctly processed mRNA from the catalase intron contained within the InPAct cassette and also the presence of cryptic splice sites within the intron. In an attempt to increase expression levels, new InPAct-phb cassettes were generated in which the castorbean catalase intron was replaced with a synthetic intron (syntron). Further, in an attempt to both increase and better control Rep/RepA-mediated activation of InPAct cassettes, Rep/RepA expression was placed under the control of a stably integrated alc switch. Leaf discs from a transgenic tobacco line (Alc ML) containing 35S P-AlcR-AlcA P-Rep/RepA were supertransformed with InPAct-phbAsyn or InPAct-GUSsyn using Agrobacterium and three plants (lines) were regenerated for each construct. Analysis of the RNA processing of the InPAct-phbAsyn cassette revealed highly efficient and correct splicing of the syntron, thus supporting its inclusion within the InPAct system. To determine the efficiency of the alc switch to activate InPAct, leaf material from the three Alc ML + InPAct-phbAsyn lines was either agroinfiltrated with 35S P-Rep/RepA or treated with ethanol. Unexpectedly, episomes were detected not only in the infiltrated and ethanol treated samples, but also in non-treated samples. Subsequent analysis of transgenic Alc ML + InPAct-GUS lines, confirmed that the alc switch was leaky in tissue culture. Although this was shown to be reversible once plants were removed from the tissue culture environment, it made the regeneration of Alc ML + InPAct-phbsyn plant lines extremely difficult, due to unintentional Rep expression and therefore high levels of phb expression and phytotoxic PHB production. Two Alc ML + InPAct-phbAsyn + p1300-TaBV P-phbB/phbC-35S T transgenic lines were able to be regenerated, and these were acclimatised, alcohol-treated and analysed. Although episome formation was detected as late as 21 days post activation, no PHB was detected in the leaves of any plants using either microscopy or HPLC, suggesting the presence of a corrupt InPAct-phbA cassette in both lines. The final component of this thesis involved the application of both the alc switch and the InPAct systems to sugarcane in an attempt to produce PHB. Initial experiments using transgenic Alc ML + InPAct-GUS lines indicated that the alc system was not functional in sugarcane under the conditions tested. The functionality of the InPAct system, independent of the alc gene switch, was subsequently examined by bombarding the 35S Rep/RepA cassette into leaf and immature leaf whorl cells derived from InPAct-GUS transgenic sugarcane plants. No GUS expression was observed in leaf tissue, whereas weak and irregular GUS expression was observed in immature leaf whorl tissue derived from two InPAct- GUS lines and two InPAct-GUS + 35S P-AlcR-AlcA P-GUS lines. The most plausible reason to explain the inconsistent and low levels of GUS expression in leaf whorls is a combination of low numbers of sugarcane cells in the DNA replication-conducive S-phase and the irregular and random nature of sugarcane cells bombarded with Rep/RepA. This study details the first report to develop a TbYDV-based InPAct system under control of the alc switch to produce PHB in tobacco and sugarcane. Despite the inability to detect quantifiable levels of PHB levels in either tobacco or sugarcane, the findings of this study should nevertheless assist in the further development of both the InPAct system and the alc system, particularly for sugarcane and ultimately lead to an ethanol-inducible InPAct gene expression system for the production of bioplastics and other proteins of commercial value in plants.

Aggravation of ADAMTS and MMP production and ERK1/2 pathway in the interaction of osteoarthritic subchondral bone osteoblasts and articular cartilage chondrocytes : a possible pathogenic role in osteoarthritis

Introduction: Degradative enzymes, such as A disintegrin and metalloproteinase with thrombospondin motifs (ADAMTS) and matrix metalloproteinases (MMPs), play key roles in osteoarthritis (OA) development. The aim of the present study was to investigate if cross-talk between subchondral bone osteoblasts (SBOs) and articular cartilage chondrocytes (ACCs) in OA alters the expression and regulation of ADAMTS5, ADAMTS4, MMP-1, MMP-2, MMP-3, MMP-8, MMP-9 and MMP-13, and also to test the possible involvement of mitogen activated protein kinase (MAPK) signaling pathway during this process. Methods: ACCs and SBOs were isolated from normal and OA patients. An in vitro co-culture model was developed to study the regulation of ADAMTS and MMPs under normal and OA joint cross-talk conditions. MAPK-ERK inhibitor, PD98059 was applied to delineate the involvement of specific pathway during this interaction process. Results: Indirect co-culture of OA SBOs with normal ACCs resulted in significantly increased expression of ADAMTS5, ADAMTS4, MMP-2, MMP-3 and MMP-9 in ACCs, whereas co-culture of OA ACCs led to increased MMP-1 and MMP-2 expression in normal SBOs. The upregulation of ADAMTS and MMPs under these conditions was correlated with activation of the MAPK-ERK1/2 signaling pathway and the addition of the MAPK-ERK inhibitor, PD98059, reversed the overexpression of ADAMTS and MMPs in co-cultures. Conclusion: In summary, we believe, these results add to the evidence that in human OA, altered bi-directional signals transmitted between SBOs and ACCs significantly impacts the critical features of both cartilage and bone by producing abnormal levels of ADAMTS and MMPs. Furthermore, we have demonstrated for the first time that this altered cross-talk was mediated by the phosphorylation of MAPK-ERK1/2 signaling pathway.

Competition and innovation : independent production in the Chinese TV industry

Independent television production is recognised for its capacity to generate new kinds of program content, as well as deliver innovation in formats. Globally, the television industry is entering into the post-broadcasting era where audiences are fragmented and content is distributed across multiple platforms. The effects of this convergence are now being felt in China, as it both challenges old statist models and presents new opportunities for content innovation. This thesis discusses the status of independent production in China, making relevant comparisons with independent production in other countries. Independent television production has become an important element in the reform of broadcasting in China in the past decade. The first independent TV production company was registered officially in 1994. While there are now over 4000 independent companies, the term „independent. does not necessarily constitute autonomy. The question the thesis addresses is: what is the status and nature of independence in China? Is it an appropriate term to use to describe the changing environment, or is it a misnomer? The thesis argues that Chinese independents operate alongside the mainstream state-owned system; they are „dependent. on the mainstream. Therefore independent television in China is a relative term. By looking at several companies in Beijing, mainly in entertainment, TV drama and animation, the thesis shows how the sector is injecting fresh ideas into the marketplace and how it plays an important role in improving innovation in many aspects of the television industry. The thesis shows how independent television companies in China are looking to protect their property rights. It demonstrates that far from being at the cutting edge, independents are reliant on a system that has many inbuilt structural problems. The thesis outlines many of the challenges facing 'independents'.

Analysis of productive performance of crop and animal production systems : an integrated analytical framework

This article presents a two-stage analytical framework that integrates ecological crop (animal) growth and economic frontier production models to analyse the productive efficiency of crop (animal) production systems. The ecological crop (animal) growth model estimates "potential" output levels given the genetic characteristics of crops (animals) and the physical conditions of locations where the crops (animals) are grown (reared). The economic frontier production model estimates "best practice" production levels, taking into account economic, institutional and social factors that cause farm and spatial heterogeneity. In the first stage, both ecological crop growth and economic frontier production models are estimated to calculate three measures of productive efficiency: (1) technical efficiency, as the ratio of actual to "best practice" output levels; (2) agronomic efficiency, as the ratio of actual to "potential" output levels; and (3) agro-economic efficiency, as the ratio of "best practice" to "potential" output levels. Also in the first stage, the economic frontier production model identifies factors that determine technical efficiency. In the second stage, agro-economic efficiency is analysed econometrically in relation to economic, institutional and social factors that cause farm and spatial heterogeneity. The proposed framework has several important advantages in comparison with existing proposals. Firstly, it allows the systematic incorporation of all physical, economic, institutional and social factors that cause farm and spatial heterogeneity in analysing the productive performance of crop and animal production systems. Secondly, the location-specific physical factors are not modelled symmetrically as other economic inputs of production. Thirdly, climate change and technological advancements in crop and animal sciences can be modelled in a "forward-looking" manner. Fourthly, knowledge in agronomy and data from experimental studies can be utilised for socio-economic policy analysis. The proposed framework can be easily applied in empirical studies due to the current availability of ecological crop (animal) growth models, farm or secondary data, and econometric software packages. The article highlights several directions of empirical studies that researchers may pursue in the future.

Adaptive cache aware multiprocessor scheduling framework

Computer resource allocation represents a significant challenge particularly for multiprocessor systems, which consist of shared computing resources to be allocated among co-runner processes and threads. While an efficient resource allocation would result in a highly efficient and stable overall multiprocessor system and individual thread performance, ineffective poor resource allocation causes significant performance bottlenecks even for the system with high computing resources. This thesis proposes a cache aware adaptive closed loop scheduling framework as an efficient resource allocation strategy for the highly dynamic resource management problem, which requires instant estimation of highly uncertain and unpredictable resource patterns. Many different approaches to this highly dynamic resource allocation problem have been developed but neither the dynamic nature nor the time-varying and uncertain characteristics of the resource allocation problem is well considered. These approaches facilitate either static and dynamic optimization methods or advanced scheduling algorithms such as the Proportional Fair (PFair) scheduling algorithm. Some of these approaches, which consider the dynamic nature of multiprocessor systems, apply only a basic closed loop system; hence, they fail to take the time-varying and uncertainty of the system into account. Therefore, further research into the multiprocessor resource allocation is required. Our closed loop cache aware adaptive scheduling framework takes the resource availability and the resource usage patterns into account by measuring time-varying factors such as cache miss counts, stalls and instruction counts. More specifically, the cache usage pattern of the thread is identified using QR recursive least square algorithm (RLS) and cache miss count time series statistics. For the identified cache resource dynamics, our closed loop cache aware adaptive scheduling framework enforces instruction fairness for the threads. Fairness in the context of our research project is defined as a resource allocation equity, which reduces corunner thread dependence in a shared resource environment. In this way, instruction count degradation due to shared cache resource conflicts is overcome. In this respect, our closed loop cache aware adaptive scheduling framework contributes to the research field in two major and three minor aspects. The two major contributions lead to the cache aware scheduling system. The first major contribution is the development of the execution fairness algorithm, which degrades the co-runner cache impact on the thread performance. The second contribution is the development of relevant mathematical models, such as thread execution pattern and cache access pattern models, which in fact formulate the execution fairness algorithm in terms of mathematical quantities. Following the development of the cache aware scheduling system, our adaptive self-tuning control framework is constructed to add an adaptive closed loop aspect to the cache aware scheduling system. This control framework in fact consists of two main components: the parameter estimator, and the controller design module. The first minor contribution is the development of the parameter estimators; the QR Recursive Least Square(RLS) algorithm is applied into our closed loop cache aware adaptive scheduling framework to estimate highly uncertain and time-varying cache resource patterns of threads. The second minor contribution is the designing of a controller design module; the algebraic controller design algorithm, Pole Placement, is utilized to design the relevant controller, which is able to provide desired timevarying control action. The adaptive self-tuning control framework and cache aware scheduling system in fact constitute our final framework, closed loop cache aware adaptive scheduling framework. The third minor contribution is to validate this cache aware adaptive closed loop scheduling framework efficiency in overwhelming the co-runner cache dependency. The timeseries statistical counters are developed for M-Sim Multi-Core Simulator; and the theoretical findings and mathematical formulations are applied as MATLAB m-file software codes. In this way, the overall framework is tested and experiment outcomes are analyzed. According to our experiment outcomes, it is concluded that our closed loop cache aware adaptive scheduling framework successfully drives co-runner cache dependent thread instruction count to co-runner independent instruction count with an error margin up to 25% in case cache is highly utilized. In addition, thread cache access pattern is also estimated with 75% accuracy.

Power relations and small and medium-sized enterprise strategies for capturing value in global production networks: visual effects (VFX) service firm in the Hollywood film industry

Power relations and small and medium-sized enterprise strategies for capturing value in global production networks: visual effects (VFX) service firms in the Hollywood film industry, Regional Studies. This paper provides insights into the way in which non-lead firms manoeuvre in global value chains in the pursuit of a larger share of revenue and how power relations affect these manoeuvres. It examines the nature of value capture and power relations in the global supply of visual effects (VFX) services and the range of strategies VFX firms adopt to capture higher value in the global value chain. The analysis is based on a total of thirty-six interviews with informants in the industry in Australia, the United Kingdom and Canada, and a database of VFX credits for 3323 visual products for 640 VFX firms.

Operations research for mining : a classification and literature review

In this paper, we describe the main processes and operations in mining industries and present a comprehensive survey of operations research methodologies that have been applied over the last several decades. The literature review is classified into four main categories: mine design; mine production; mine transportation; and mine evaluation. Mining design models are further separated according to two main mining methods: open-pit and underground. Moreover, mine production models are subcategorised into two groups: ore mining and coal mining. Mine transportation models are further partitioned in accordance with fleet management, truck haulage and train scheduling. Mine evaluation models are further subdivided into four clusters in terms of mining method selection, quality control, financial risks and environmental protection. The main characteristics of four Australian commercial mining software are addressed and compared. This paper bridges the gaps in the literature and motivates researchers to develop more applicable, realistic and comprehensive operations research models and solution techniques that are directly linked with mining industries.

Scheduling Trains with Priorities : a no-wait blocking parallel-machine job-shop scheduling model

The paper investigates train scheduling problems when prioritised trains and non-prioritised trains are simultaneously traversed in a single-line rail network. In this case, no-wait conditions arise because the prioritised trains such as express passenger trains should traverse continuously without any interruption. In comparison, non-prioritised trains such as freight 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, which is thought of as a relaxation of no-wait conditions. With thorough analysis of the structural properties of the No-Wait Blocking Parallel-Machine Job-Shop-Scheduling (NWBPMJSS) problem that is originated in this research, an innovative generic constructive algorithm (called NWBPMJSS_Liu-Kozan) is proposed to construct the feasible train timetable in terms of a given order of trains. In particular, the proposed NWBPMJSS_Liu-Kozan constructive algorithm comprises several recursively-used sub-algorithms (i.e. Best-Starting-Time-Determination Procedure, Blocking-Time-Determination Procedure, Conflict-Checking Procedure, Conflict-Eliminating Procedure, Tune-up Procedure and Fine-tune Procedure) to guarantee feasibility by satisfying the blocking, no-wait, deadlock-free and conflict-free constraints. A two-stage hybrid heuristic algorithm (NWBPMJSS_Liu-Kozan-BIH) is developed by combining the NWBPMJSS_Liu-Kozan constructive algorithm and the Best-Insertion-Heuristic (BIH) algorithm to find the preferable train schedule in an efficient and economical way. Extensive computational experiments show that the proposed methodology is promising because it can be applied as a standard and fundamental toolbox for identifying, analysing, modelling and solving real-world scheduling problems.

A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem

In practice, parallel-machine job-shop scheduling (PMJSS) is very useful in the development of standard modelling approaches and generic solution techniques for many real-world scheduling problems. In this paper, based on the analysis of structural properties in an extended disjunctive graph model, a hybrid shifting bottleneck procedure (HSBP) algorithm combined with Tabu Search metaheuristic algorithm is developed to deal with the PMJSS problem. The original-version SBP algorithm for the job-shop scheduling (JSS) has been significantly improved to solve the PMJSS problem with four novelties: i) a topological-sequence algorithm is proposed to decompose the PMJSS problem into a set of single-machine scheduling (SMS) and/or parallel-machine scheduling (PMS) subproblems; ii) a modified Carlier algorithm based on the proposed lemmas and the proofs is developed to solve the SMS subproblem; iii) the Jackson rule is extended to solve the PMS subproblem; iv) a Tabu Search metaheuristic algorithm is embedded under the framework of SBP to optimise the JSS and PMJSS cases. The computational experiments show that the proposed HSBP is very efficient in solving the JSS and PMJSS problems.

Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem

For the shop scheduling problems such as flow-shop, job-shop, open-shop, mixed-shop, and group-shop, most research focuses on optimizing the makespan under static conditions and does not take into consideration dynamic disturbances such as machine breakdown and new job arrivals. We regard the shop scheduling problem under static conditions as the static shop scheduling problem, while the shop scheduling problem with dynamic disturbances as the dynamic shop scheduling problem. In this paper, we analyze the characteristics of the dynamic shop scheduling problem when machine breakdown and new job arrivals occur, and present a framework to model the dynamic shop scheduling problem as a static group-shop-type scheduling problem. Using the proposed framework, we apply a metaheuristic proposed for solving the static shop scheduling problem to a number of dynamic shop scheduling benchmark problems. The results show that the metaheuristic methodology which has been successfully applied to the static shop scheduling problems can also be applied to solve the dynamic shop scheduling problem efficiently.

A fast tabu search algorithm for the group shop scheduling problem

Three types of shop scheduling problems, the flow shop, the job shop and the open shop scheduling problems, have been widely studied in the literature. However, very few articles address the group shop scheduling problem introduced in 1997, which is a general formulation that covers the three above mentioned shop scheduling problems and the mixed shop scheduling problem. In this paper, we apply tabu search to the group shop scheduling problem and evaluate the performance of the algorithm on a set of benchmark problems. The computational results show that our tabu search algorithm is typically more efficient and faster than the other methods proposed in the literature. Furthermore, the proposed tabu search method has found some new best solutions of the benchmark instances.

Metaheuristics for the mixed shop scheduling problem

In this paper, three metaheuristics are proposed for solving a class of job shop, open shop, and mixed shop scheduling problems. We evaluate the performance of the proposed algorithms by means of a set of Lawrence’s benchmark instances for the job shop problem, a set of randomly generated instances for the open shop problem, and a combined job shop and open shop test data for the mixed shop problem. The computational results show that the proposed algorithms perform extremely well on all these three types of shop scheduling problems. The results also reveal that the mixed shop problem is relatively easier to solve than the job shop problem due to the fact that the scheduling procedure becomes more flexible by the inclusion of more open shop jobs in the mixed shop.

A comparative study of algorithms for the flowshop scheduling problem

In this paper, we propose three meta-heuristic algorithms for the permutation flowshop (PFS) and the general flowshop (GFS) problems. Two different neighborhood structures are used for these two types of flowshop problem. For the PFS problem, an insertion neighborhood structure is used, while for the GFS problem, a critical-path neighborhood structure is adopted. To evaluate the performance of the proposed algorithms, two sets of problem instances are tested against the algorithms for both types of flowshop problems. The computational results show that the proposed meta-heuristic algorithms with insertion neighborhood for the PFS problem perform slightly better than the corresponding algorithms with critical-path neighborhood for the GFS problem. But in terms of computation time, the GFS algorithms are faster than the corresponding PFS algorithms.