Search

While digital infrastructure is clearly a critical factor in addressing the digital divide for rural society, it is only one component in realising the benefits of information and communication technology (ICT). It is increasingly acknowledged that citizens, governments, and businesses need to develop skills and motivations to use technologies. It is also recognised that young people and their rural communities are among those who gain the least from opportunities to engage in and benefit from an ever-evolving digital society. As with other areas of rural development, local community institutions and actors assume their own leadership in developing initiatives to overcome challenges and advance digital literacy and in this regard, public libraries have led and continue to hold considerable potential to champion this area. This article reports on the experiences of a 14-month community-based collaborative research project with public libraries engaged in a process of developing coding clubs for children and youth in rural Manitoba, Canada. Our research sets out to answer the questions: first, whether it is viable for public libraries to cultivate advanced digital skills among rural youth and contribute to bridging the rural-urban digital divide by running coding clubs following the CoderDojo model? And second, what are the critical conditions to ensure the success of public library coding clubs? In examining some of the experiences encountered in adopting the coding club as a model of digital literacy building, we discuss wider themes for rural public libraries interested in advancing digital literacy building within their communities.

The prognosis for pancreatic ductal adenocarcinoma (PDAC) patients has not significantly improved in the past 3 decades, highlighting the need for more effective treatment approaches. Poor patient outcomes and lack of response to therapy can be attributed, in part, to the dense, fibrotic nature of PDAC tumours, which impedes the uptake of systemically administered drugs. Wet-spun alginate fibres loaded with the chemotherapeutic agent gemcitabine have been developed as a potential tool for overcoming the physical and biological barriers presented by the PDAC tumour microenvironment and deliver high concentrations of drug to the tumour directly over an extended period of time. While exciting, the practicality, safety, and effectiveness of these devices in a clinical setting requires further investigation. Furthermore, an in-depth assessment of the drug-release rate from these devices needs to be undertaken to determine whether an optimal release profile exists. Using a hybrid computational model (agent-based model and partial differential equation system), we developed a simulation of pancreatic tumour growth and response to treatment with gemcitabine loaded alginate fibres. The model was calibrated using in vitro and in vivo data and simulated using a finite volume method discretization. We then used the model to compare different intratumoural implantation protocols and gemcitabine-release rates. In our model, the primary driver of pancreatic tumour growth was the rate of tumour cell division and degree of extracellular matrix deposition. We were able to demonstrate that intratumoural placement of gemcitabine loaded fibres was more effective than peritumoural placement. Additionally, we found that an exponential gemcitabine release rate would improve the tumour response to fibres placed peritumourally. Altogether, the model developed here is a tool that can be used to investigate other drug delivery devices to improve the arsenal of treatments available for PDAC and other difficult-to-treat cancers in the future.Author SummaryPancreatic cancer has a dismal prognosis with a median survival of 3-5 months for untreated disease. The treatment of pancreatic cancer is challenging due to the dense nature of pancreatic tumours which impedes retention of drug at the tumour site. As such, systemic administration of chemotherapies, such as gemcitabine, has a limited efficacy. To overcome this, sustained-release devices have been proposed. These devices are injected locally and release drug slowly over time, providing a concentrated local, sustained drug concentration. To investigate the possible efficacy of these devices, we developed a mathematical model that would allow us to probe treatment perturbations in silico. We modelled the individual cancer cells and their growth and death from gemcitabine loaded into the sustained delivery devices. Our platform allows future investigations for these devices to be run in silico so that we may better understand the forms of the drug release-profile that are necessary for optimal treatment.

We find that individuals are confused by the titles used by investment professionals and cannot distinguish between investment advisers and brokers. This confusion persists even among those with in...

Similarity-based search of sequence collections is a core task in bioinformatics, one dominated for most of the genomic era by exact and heuristic alignment-based algorithms. However, even efficient heuristics such as BLAST may not scale to the data sets now emerging, motivating a range of alignment-free alternatives exploiting the underlying lexical structure of each sequence.In this paper, we introduce SuperVec, a novel supervised approach to learning sequence embeddings. Our method extends earlier Representation Learning (RL) based methods to include jointly contextual and class-related information for each sequence during training. This ensures that related sequence fragments have proximal representations in the target space, better reflecting the structure of the domain.Such representations may be used for downstream machine learning tasks or employed directly. Here, we apply SuperVec embeddings to a sequence retrieval task, where the goal is to retrieve sequences with the same family label as a given query. The SuperVec approach is extended further through H-SuperVec, a tree-based hierarchical method which learns embeddings across a range of feature spaces based on the class labels and their exclusive and exhaustive subsets.Experiments show that supervised learning of embeddings based on sequence labels using SuperVec and H-SuperVec provides a substantial improvement in retrieval performance over existing (unsupervised) RL-based approaches. Further, the new methods are an order of magnitude faster than BLAST for the database retrieval task, supporting hybrid approaches in which SuperVec rapidly filters the collection so that only potentially relevant records remain, allowing slower, more accurate methods to be executed quickly over a far smaller dataset. Thus, we may achieve faster query processing and higher precision than before.Finally, for some problems, direct use of embeddings is already sufficient to yield high levels of precision and recall. Extending this work to encompass weaker homology is the subject of ongoing research.

Background Sequencing highly-variable 16S regions is a common and often effective approach to the study of microbial communities, and next-generation sequencing (NGS) technologies provide abundant quantities of data for analysis. However, the speed of existing analysis pipelines may limit our ability to work with these quantities of data. Furthermore, the limited coverage of existing 16S databases may hamper our ability to characterise these communities, particularly in the context of complex or poorly studied environments. Results In this article we present the SigClust algorithm, a novel clustering method involving the transformation of sequence reads into binary signatures. When compared to other published methods, SigClust yields superior cluster coherence and separation of metagenomic read data, while operating within substantially reduced timeframes. We demonstrate its utility on published Illumina datasets and on a large collection of labelled wound reads sourced from patients in a wound clinic. The temporal analysis is based on tracking the dominant clusters of wound samples over time. The analysis can identify markers of both healing and non-healing wounds in response to treatment. Prominent clusters are found, corresponding to bacterial species known to be associated with unfavourable healing outcomes, including a number of strains of Staphylococcus aureus. Conclusions SigClust identifies clusters rapidly and supports an improved understanding of the wound microbiome without reliance on a reference database. The results indicate a promising use for a SigClust-based pipeline in wound analysis and prediction, and a possible novel method for wound management and treatment.

Microservice migration is a promising technique to incrementally modernize monolithic legacy enterprise applications and enable them to exploit the benefits of cloud-computing environments. This article elaborates on three challenges of microservice migration: multitenancy, statefulness, and data consistency. The authors show how to identify each of these challenges in legacy code and explain refactoring and architectural pattern-based migration techniques relevant to microservice architectures. They explain how multitenancy enables microservices to be utilized by different organizations with distinctive requirements, why statefulness affects both the availability and reliability of a microservice system, and why data consistency challenges are encountered when migrating legacy code that operates on a centralized data repository to microservices operating on decentralized data repositories. They also explain the interdependencies between multitenancy, statefulness, and data consistency.

All-to-all comparison problems represent a class of big data processing problems widely found in many application domains. To achieve high performance for distributed computing of such problems, storage usage, data locality and load balancing should be considered during the data distribution phase in the distributed environment. Existing data distribution strategies, such as the Hadoop one, are designed for problems with MapReduce pattern and do not consider comparison tasks at all. As a result, a huge amount of data must be re-arranged at runtime when the comparison tasks are executed, degrading the overall computing performance significantly. Addressing this problem, a scalable and efficient data distribution strategy is presented in this paper with comparison tasks in mind for distributed computing of all-to-all comparison problems. Specifically designed for problems with all-to-all comparison pattern, it not only saves storage space and data distribution time but also achieves load balancing and good data locality for all comparison tasks of the all-to-all comparison problems. Experiments are conducted to demonstrate the presented approaches. It is shown that about 90% of the ideal performance capacity of the multiple machines can be achieved through using the approach presented in this paper.