Delivering knowledge in the field: A telecommunications service provision and maintenance case

This paper proposes a novel approach to providing knowledge management services in a business process wherein field engineers are the main process actors, providing and maintaining telecommunications services. Cooperating multi-agents play a central role for the provision of knowledge management services by integrating heterogeneous systems to collect related knowledge for the execution of mobile tasks. The proposed system is expected to increase both the performance of the mobile workforce and customer satisfaction by supporting and encouraging knowledge sharing

Earning its keep: a social return of investment study of CCCU Arts & Culture at the Old Lookout Gallery, Broadstairs

In 2013 The Department of Media, Art & Design developed an inter-faculty research project with three aims focused upon evaluation, marketing and SROI: i. To evaluate the 2013 programme of events at The Old Lookout from the points of view of the artist(s) in residence; local businesses; gallery users (visitors) and non-users of the Gallery. ii. To gather marketing data in relation to the local communities knowledge of the Old Lookout Gallery and the programme of activities it offered and through this data improve subsequent advertising. iii. To pilot measures of Social Return on Investment (SROI) and if salient offer the tools for use across the University (and by partners) in order to provide a measure of SROI for other venues and activities. There are two types of Social Return on Investment (SROI): • Evaluative, which is conducted retrospectively and based on actual outcomes that have already taken place • Forecast, which predicts how much social value will be created if the activities meet their intended outcomes

Computation with narrow CTCs

We examine some variants of computation with closed timelike curves (CTCs), where various restrictions are imposed on the memory of the computer, and the information carrying capacity and range of the CTC. We give full characterizations of the classes of languages recognized by polynomial time probabilistic and quantum computers that can send a single classical bit to their own past. Such narrow CTCs are demonstrated to add the power of limited nondeterminism to deterministic computers, and lead to exponential speedup in constant-space probabilistic and quantum computation. We show that, given a time machine with constant negative delay, one can implement CTC-based computations without the need to know about the runtime beforehand.Comment: 16 pages. A few typo was correcte

Extending scientific computing system with structural quantum programming capabilities

We present a basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming languages and we use quantum pseudo-code based on QCL quantum programming language to describe them. We also present the implementation of introduced structures in GNU Octave language for scientific computing. Procedures used in the implementation are available as a package quantum-octave, providing a library of functions, which facilitates the simulation of quantum computing. This package allows also to incorporate high-level programming concepts into the simulation in GNU Octave and Matlab. As such it connects features unique for high-level quantum programming languages, with the full palette of efficient computational routines commonly available in modern scientific computing systems. To present the major features of the described package we provide the implementation of selected quantum algorithms. We also show how quantum errors can be taken into account during the simulation of quantum algorithms using quantum-octave package. This is possible thanks to the ability to operate on density matrices

A system of relational syllogistic incorporating full Boolean reasoning

We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: Some A are R-related to some B; Some A are R-related to all B; All A are R-related to some B; All A are R-related to all B. Such primitives formalize sentences from natural language like `All students read some textbooks'. Here A and B denote arbitrary sets (of objects), and R denotes an arbitrary binary relation between objects. The language of the logic contains only variables denoting sets, determining the class of set terms, and variables denoting binary relations between objects, determining the class of relational terms. Both classes of terms are closed under the standard Boolean operations. The set of relational terms is also closed under taking the converse of a relation. The results of the paper are the completeness theorem with respect to the intended semantics and the computational complexity of the satisfiability problem.Comment: Available at http://link.springer.com/article/10.1007/s10849-012-9165-

A coinductive semantics of the Unlimited Register Machine

We exploit (co)inductive specifications and proofs to approach the evaluation of low-level programs for the Unlimited Register Machine (URM) within the Coq system, a proof assistant based on the Calculus of (Co)Inductive Constructions type theory. Our formalization allows us to certify the implementation of partial functions, thus it can be regarded as a first step towards the development of a workbench for the formal analysis and verification of both converging and diverging computations

Young-Onset Gastrointestinal Adenocarcinoma Incidence and Survival Trends in the Northern Territory, Australia, with Emphasis on Indigenous Peoples

Background and Aims: A concerning rise in incidence of young-onset cancers globally led to the examination of trends in incidence and survival of gastrointestinal (GI) adenocarcinomas in the Northern Territory (NT), Australia, over a 28-year period, with a special emphasis on Indigenous peoples. Methods: This cross-sectional analysis of a prospective longitudinal database, NT Cancer Registry (1990–2017), includes all reported cases of GI (oesophagus, gastric, small intestinal, pancreas, colon, and rectum) adenocarcinomas. Poisson regression was used to estimate incidence ratio ratios, and survival was modelled using Cox proportional hazard models separately for people aged 18–50 years and >50 years. Results: A total of 1608 cases of GI adenocarcinoma were recorded during the time of the study. While the overall incidence in people 18–50 years remained unchanged over this time (p = 0.51), the rate in individuals aged >50 years decreased (IRR = 0.65 (95% CI 0.56–0.75; p 50 years (IRR = 0.67 95% CI 0.59–0.75; p 50 years IRR = 0.48 95% CI 0.40–0.57; p 50 years HR = 1.66 95% CI 1.32–2.08; p < 0.0001). Conclusions: There is a trend towards an increased incidence of young-onset GI adenocarcinomas in the NT. Young Indigenous patients have lower incidence but worse survival across all GI subsites, highlighting significant health inequities in life expectancy. Targeted, culturally safe Indigenous community-focussed programs are needed for early detection and patient-centred management of GI adenocarcinomas.Mia Shepherdson, Shalem Leemaqz, Gurmeet Singh, Courtney Ryder, Shahid Ullah, Karla Canuto, Joanne P. Young, Timothy J. Price, Ross A. McKinnon, Stephen J. Pandol, Claire T. Roberts, and Savio George Barret