970 resultados para completion
Resumo:
In 2001 the International Law Commission finally adopted on second reading the Draft Articles on Responsibility of States for Internationally Wrongful Acts with commentaries, bringing to an end nearly 50 years of ILC work on the subject. This article reviews the final group of changes to the text, focusing on the definitions of ‘injury’ and ‘damage’, assurances of non‐repetition in the light of the
Resumo:
Completing a PhD on time is a complex process, influenced by many interacting factors. In this paper we take a Bayesian Network approach to analyzing the factors perceived to be important in achieving this aim. Focusing on a single research group in Mathematical Sciences, we develop a conceptual model to describe the factors considered to be important to students and then quantify the network based on five individual perspectives: the students, a supervisor and a university research students centre manager. The resultant network comprised 37 factors and 40 connections, with an overall probability of timely completion of between 0.6 and 0.8. Across all participants, the four factors that were considered to most directly influence timely completion were personal aspects, the research environment, the research project, and incoming skills.
Resumo:
We identify relation completion (RC) as one recurring problem that is central to the success of novel big data applications such as Entity Reconstruction and Data Enrichment. Given a semantic relation, RC attempts at linking entity pairs between two entity lists under the relation. To accomplish the RC goals, we propose to formulate search queries for each query entity α based on some auxiliary information, so that to detect its target entity β from the set of retrieved documents. For instance, a pattern-based method (PaRE) uses extracted patterns as the auxiliary information in formulating search queries. However, high-quality patterns may decrease the probability of finding suitable target entities. As an alternative, we propose CoRE method that uses context terms learned surrounding the expression of a relation as the auxiliary information in formulating queries. The experimental results based on several real-world web data collections demonstrate that CoRE reaches a much higher accuracy than PaRE for the purpose of RC.
Resumo:
This is a case study of a young university striving to generate and sustain a vibrant Research Training culture. The university’s research training framework is informed by a belief in a project management approach to achieving successful research candidature. This has led to the definition and reporting of key milestones during candidature. In turn, these milestones have generated a range of training programs to support Higher Degree Research (HDR) students to meet these milestones in a timely fashion. Each milestone focuses on a specific set of skills blended with supporting the development of different parts of the doctoral thesis. Data on student progress and completion has provided evidence in highlighting the role that the milestones and training are playing in supporting timely completion. A university-wide reporting cycle generated data on the range of workshops and training provided to Higher Degree Research students and supervisors. The report provided details of thesis topic and format, as well as participation in research training events and participant evaluation of those events. Analysis of the data led to recommendations and comments on the strengths and weaknesses of the current research training program. Discussion considered strategies and drivers for enhancements into the future. In particular, the paper reflects on the significant potential role of centrally curated knowledge systems to support HDR student and supervisor access, and engagement and success. The research training program was developed using blended learning as a model. It covered face-to-face workshops as well as online modules. These were supplemented by web portals that offered a range of services to inform and educate students and supervisors and included opportunities for students to interact with each other. Topics ranged from the research life cycle, writing and publication, ethics, managing research data, managing copyright, and project management to use of software and the University’s Code of Conduct for Research. The challenges discussed included: How to reach off campus students and those studying in external modes? How best to promote events to potential participants? How long and what format is best for face-to-face sessions? What online resources best supplement face-to-face offerings? Is there a place for peer-based learning and what form should this take? These questions are raised by a relatively young university seeking to build and sustain a vibrant research culture. The rapid growth in enrolments in recent years has challenged previous one-to-one models of support. This review of research training is timely in seeking strategies to address changing research training support capacity and student needs. Part of the discussion will focus on supervisory training, noting that good supervision is the one remaining place where one-to-one support is provided. Ensuring that supervisors are appropriately equipped to address student expectations is considered in the context of the research training provisions. The paper concludes with reflection on the challenges faced, and recommended ways forward as the number of research students grows into the future.
Resumo:
In a pilot application based on web search engine calledWeb-based Relation Completion (WebRC), we propose to join two columns of entities linked by a predefined relation by mining knowledge from the web through a web search engine. To achieve this, a novel retrieval task Relation Query Expansion (RelQE) is modelled: given an entity (query), the task is to retrieve documents containing entities in predefined relation to the given one. Solving this problem entails expanding the query before submitting it to a web search engine to ensure that mostly documents containing the linked entity are returned in the top K search results. In this paper, we propose a novel Learning-based Relevance Feedback (LRF) approach to solve this retrieval task. Expansion terms are learned from training pairs of entities linked by the predefined relation and applied to new entity-queries to find entities linked by the same relation. After describing the approach, we present experimental results on real-world web data collections, which show that the LRF approach always improves the precision of top-ranked search results to up to 8.6 times the baseline. Using LRF, WebRC also shows performances way above the baseline.
Resumo:
Purpose Many haematological cancer survivors report long-term physiological and psychosocial effects, which persist far beyond treatment completion. Cancer services have been required to extend care to the post-treatment phase to implement survivorship care strategies into routine practice. As key members of the multidisciplinary team, cancer nurses’ perspectives are essential to inform future developments in survivorship care provision. Methods This is a pilot survey study, involving 119 nurses caring for patients with haematological malignancy in an Australian tertiary cancer care centre. The participants completed an investigator developed survey designed to assess cancer care nurses’ perspectives on their attitudes, confidence levels, and practice in relation to post-treatment survivorship care for patients with a haematological malignancy. Results Overall, the majority of participants agreed that all of the survivorship interventions included in the survey should be within the scope of the nursing role. Nurses reported being least confident in discussing fertility and employment/financial issues with patients and conducting psychosocial distress screening. The interventions performed least often included, discussing fertility, intimacy and sexuality issues and communicating survivorship care with the patient’s primary health care providers. Nurses identified lack of time, limited educational resources, lack of dedicated end-of-treatment consultation and insufficient skills/knowledge as the key barriers to survivorship care provision. Conclusion Cancer centres should implement an appropriate model of survivorship care and provide improved training and educational resources for nurses to enable them to deliver quality survivorship care and meet the needs of haematological cancer survivors.
Resumo:
Executive Summary: Completion of the Veloway 1 (V1) will provide a dedicated and safe route for cyclists between the Brisbane CBD and the Gateway Motorway off-ramp at Eight Mile Plains alongside the South East Motorway. The V1 is being delivered in stages and when completed will provide a dedicated 3m wide cycleway 17km in length. Two stages (D and E) remain to be constructed to complete the V1. Major trip attractors along the V1 include the Mater, Princes Alexandra and Greenslopes Hospitals, two campuses of Griffith University, Garden City shopping centre and the Australian Tax Office. This report assesses the available evidence on the impacts on cycling behaviour of the recently completed V1 Stage C. The data sources informing this review include three intercept surveys, motion activated traffic cameras and travel time surveys on the V1 and adjoining South East Freeway Bikeway (SEFB), Strava app data, and cyclist crash data along Logan Road. The key findings from the evidence are that the completed V1 Stage C has: a Attracted cyclists from Holland Park, Holland Park West, Mt Gravatt and southern parts of Tarragindi onto the V1 Stage C. b Reduced the crash exposure of pedestrians to cyclists by attracting higher speed cyclists off the adjoining SEFB onto the cycling dedicated V1 Stage C. c Reduced the potential crash exposure of cyclists to motor vehicles by attracting cyclists off Logan Road on to the V1. d Provided travel time benefits to cyclists and reduced road crossings (eight down to two). e Predominantly attracted adults commuting alone to and from work and university. The evidence shows that the two traffic crossings across Birdwood Road (required as a temporary measure until the V1 is completed) negate much of the travel time gains of the V1 Stage C compared to the adjoining SEFB for southbound cyclists. Many cyclists accessing the V1 Stage C from the south are cycling in high-volume vehicular traffic lanes to reduce their travel time along Birdwood Road, but in the process are increasing their exposure to crashes with motor vehicles. Based on these findings this report recommends that TMR: a. Continue with plans to complete the V1 Veloway b. Undertake an engineering feasibility assessment to determine the viability of constructing a section of the V1 Stage E from the intersection Weller and Birdwood Roads over Marshall Road and along Bapaume Road on the western side of the Motorway to the intersection of Bapaume and Sterculia Roads. c. In the interim, improve signage and Birdwood Road crossing points for cyclists accessing and egressing the southern end of the V1 Stage C. d. Work with Brisbane City Council to identify the safest and most practical bicycle facilities to facilitate cycle travel between Logan Road and the V1 south of Birdwood Road. e. Improve the awareness of the V1 Stage C through signage for cyclists approaching from the north with the aim of providing a better understanding of the route of the V1 to the south. f. Refine the use of motion activated traffic cameras to improve the capture rate of useable images and obtain an ongoing collection over time of V1 usage data. g. Undertake discussions with Strava, Inc. to refine the presentation of Strava data to improve visual understanding of maps showing before and after cycle route volumes along and on roads leading to the V1.
Resumo:
Lateral or transaxial truncation of cone-beam data can occur either due to the field of view limitation of the scanning apparatus or iregion-of-interest tomography. In this paper, we Suggest two new methods to handle lateral truncation in helical scan CT. It is seen that reconstruction with laterally truncated projection data, assuming it to be complete, gives severe artifacts which even penetrates into the field of view. A row-by-row data completion approach using linear prediction is introduced for helical scan truncated data. An extension of this technique known as windowed linear prediction approach is introduced. Efficacy of the two techniques are shown using simulation with standard phantoms. A quantitative image quality measure of the resulting reconstructed images are used to evaluate the performance of the proposed methods against an extension of a standard existing technique.
Resumo:
We completed the genome sequence of Lettuce necrotic yellows virus (LNYV) by determining the nucleotide sequences of the 4a (putative phosphoprotein), 4b, M (matrix protein), G (glycoprotein) and L (polymerase) genes. The genome consists of 12,807 nucleotides and encodes six genes in the order 3′ leader-N-4a(P)-4b-M-G-L-5′ trailer. Sequences were derived from clones of a cDNA library from LNYV genomic RNA and from fragments amplified using reverse transcription-polymerase chain reaction. The 4a protein has a low isoelectric point characteristic for rhabdovirus phosphoproteins. The 4b protein has significant sequence similarities with the movement proteins of capillo- and trichoviruses and may be involved in cell-to-cell movement. The putative G protein sequence contains a predicted 25 amino acids signal peptide and endopeptidase cleavage site, three predicted glycosylation sites and a putative transmembrane domain. The deduced L protein sequence shows similarities with the L proteins of other plant rhabdoviruses and contains polymerase module motifs characteristic for RNA-dependent RNA polymerases of negative-strand RNA viruses. Phylogenetic analysis of this motif among rhabdoviruses placed LNYV in a group with other sequenced cytorhabdoviruses, most closely related to Strawberry crinkle virus.
Resumo:
The visual systems of humans and animals represent physical reality in a modified way, depending on the specific demands that the species in question has for survival. The ability to perceive visual illusions is found in independently evolved visual systems, from honeybees to humans. In humans, the ability emerges early, at the age of four months. Thus the perception of illusion is likely to reflect visual processes of fundamental importance for object perception in natural vision. The experiments reported in this thesis employed various modifications of the Kanizsa triangle, a drawn configuration composed of three black disks with missing sectors on a white background. The sectors appear to form the tips of a triangle. The visual system completes the physically empty area between the disks, generally called inducers, with giving the perception of an illusory triangle. The illusory triangle consists of an illusory surface bounded by illusory contours; the triangle appears brighter than and to lie above the background. If the sectors are coloured, the colour fills the illusory area, a phenomenon known as neon colour spreading . We investigated spatial limitations on the perception of Kanizsa-type illusions and how other stimuli and viewing parameters affected these limitations. We also studied complex configurations thick, bent, mobile and chromatic inducers - to determine whether illusions combining several attributes can be perceived. The results suggest that the visual system is highly effective in completing a percept. The perception of an illusory figure is spatially scale invariant when perceived at threshold. The processing time and the number of fixations modify the percept, making the perception of the illusion more probable in various viewing conditions. Furthermore, the fact that the illusion can be perceived when only one inducer is physically present at any given moment indicates the potential of single inducers. Apparently, modelling illusory figure perception will require a combination of low-level, local processes and higher-level integrative processes. Our studies with stimuli combining several attributes relevant to object perception demonstrate that the perception of an illusory figure is flexible and is maintained also when it contains colour and volume and when shown in movement. All in all, the results confirm the assumed importance of the visual processes related with the perception of illusory figures in everyday viewing. This is indicated by the variety of inducer modifications that can be made without destroying the percept. Furthermore, the illusion can acquire additional attributes from such modifications. Due to individual differences in the perception of illusory figures, universal values for absolute performance are not always meaningful, but stable trends and general relations do exist.
Resumo:
We consider the problem of minimizing the total completion time on a single batch processing machine. The set of jobs to be scheduled can be partitioned into a number of families, where all jobs in the same family have the same processing time. The machine can process at most B jobs simultaneously as a batch, and the processing time of a batch is equal to the processing time of the longest job in the batch. We analyze that properties of an optimal schedule and develop a dynamic programming algorithm of polynomial time complexity when the number of job families is fixed. The research is motivated by the problem of scheduling burn-in ovens in the semiconductor industry
Resumo:
We study the problem of minimizing total completion time on single and parallel batch processing machines. A batch processing machine is one which can process up to B jobs simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. This problem is motivated by burn-in operations in the final testing stage of semiconductor manufacturing and is expected to occur in other production environments. We provide an exact solution procedure for the single-machine problem and heuristic algorithms for both single and parallel machine problems. While the exact algorithms have limited applicability due to high computational requirements, extensive experiments show that the heuristics are capable of consistently obtaining near-optimal solutions in very reasonable CPU times.