Applying machine learning: a multi-role perspective

Machine (and deep) learning technologies are more and more present in several fields. It is undeniable that many aspects of our society are empowered by such technologies: web searches, content filtering on social networks, recommendations on e-commerce websites, mobile applications, etc., in addition to academic research. Moreover, mobile devices and internet sites, e.g., social networks, support the collection and sharing of information in real time. The pervasive deployment of the aforementioned technological instruments, both hardware and software, has led to the production of huge amounts of data. Such data has become more and more unmanageable, posing challenges to conventional computing platforms, and paving the way to the development and widespread use of the machine and deep learning. Nevertheless, machine learning is not only a technology. Given a task, machine learning is a way of proceeding (a way of thinking), and as such can be approached from different perspectives (points of view). This, in particular, will be the focus of this research. The entire work concentrates on machine learning, starting from different sources of data, e.g., signals and images, applied to different domains, e.g., Sport Science and Social History, and analyzed from different perspectives: from a non-data scientist point of view through tools and platforms; setting a problem stage from scratch; implementing an effective application for classification tasks; improving user interface experience through Data Visualization and eXtended Reality. In essence, not only in a quantitative task, not only in a scientific environment, and not only from a data-scientist perspective, machine (and deep) learning can do the difference.

Military Capabilities: From Pooling & Sharing to a Permanent and Structured Approach. Security Policy Brief No. 37, September 2012

In 2013 the European Council for the first time since long will deal with European defence. An excellent opportunity: to move key Pooling & Sharing projects to the implementation stage in the short term, and to launch a permanent and structured approach to the development of European military capabilities for the long term.

Sonification supports eyes-free respiratory monitoring and task time-sharing

Three experiments explored the effectiveness of continuous auditory displays, or sonifications, for conveying information about a simulated anesthetized patient's respiration. Experiment 1 established an effective respiratory sonification. Experiment 2 showed an effect of expertise in the use of respiratory sonification and revealed that some apparent differences in sonification effectiveness could be accounted for by response bias. Experiment 3 showed that sonification helps anesthesiologists to maintain high levels of awareness of the simulated patient's state while performing other tasks more effectively than when relying upon visual monitoring of the simulated patient state. Overall, sonification of patient physiology beyond traditional pulse oximetry appears to be a viable and useful adjunct to visual monitors. Actual and potential applications of this research include monitoring in a wide variety of busy critical care contexts.

IBD sharing around the PPARG locus is not increased in dizygotic twins or their mothers

We observe no evidence of linkage to the region around the PPARG locus in several samples of DZ twins who have been genotyped at multiple markers on chromosome 3 (Fig. 1). Among 199 Australian DZ twins ascertained for a history of wheezing2, mean identity by descent (IBD) sharing at the position of PPARG is 0.463 (99% bootstrapped confidence interval=0.412−0.516). We obtained a similar result with 232 pairs of Australian adolescent DZ twins taking part in a longitudinal study of naevus development3 (0.444, 0.390−0.499), and a set of 125 Australian adult DZ twin pairs assessed for anxiety4 (0.508, 0.435−0.580). A Dutch scan of 160 DZ twin pairs5 obtained slightly more encouraging results (0.553, 0.482−0.587, peak maximum lod score (MLS)=0.57). Pooling all these samples gives 0.477 (0.454−0.512) at the position of PPARG. The test for heterogeneity of sharing between studies was not significant (P=0.10). In the combined dataset, the peak IBD sharing (MLS=0.70) is 50 cM closer to the centromere than PPARG. Finally, in a sample of 203 Australian and New Zealand sister pairs where each had given birth to DZ twins6, sharing across the region is also not increased (0.433). We do not replicate linkage in the populations we study to survival of a twin pregnancy or polyovulation.

Reverse transcriptase activity and untranslated region sharing of a new RTE-like, non-long terminal repeat retrotransposon from the human blood fluke, Schistosoma japonicum

A new RTE-like, non-long terminal repeat retrotransposon, termed SjR2, from the human blood fluke, Schistosoma japonicum, is described. SjR2 is similar to3.9 kb in length and is constituted of a single open reading frame encoding a polyprotein with apurinic/apyrimidinic endonuclease and reverse transcriptase domains. The open reading frame is bounded by 5'- and 3'-terininal untranslated regions and, at its 3-terminus, SjR2 bears a short (TGAC)(3) repeat. Phylogenetic analyses based on conserved domains of reverse transcriptase or endonuclease revealed that SjR2 belonged to the RTE clade of non-long terminal repeat retrotransposons. Further, SjR2 was homologous, but probably not orthologous, to SR2 front the African blood fluke, Schistosoma mansoni; this RTE-like family of non-long terminal repeat retrotransposons appears to have arisen before the divergence of the extant schistosome species. Hybridisation analyses indicated that similar to 10,000 copies of SjR2 were dispersed throughout the S. japonicum chromosomes, accounting for up to 14% of the nuclear genome. Messenger RNAs encoding the reverse transcriptase and endonuclease domains of SjR2 were detected in several developmental stages of the schistosome, indicating that the retrotransposon was actively replicating within the genome of the parasite. Exploration of the coding and non-coding regions of SjR2 revealed two notable characteristics. First, the recombinant reverse transcriptase domain of SjR2 expressed in insect cells primed reverse transcription of SjR2 mRNA in vitro. By contrast, recombinant SjR2-endonuclease did not appear to cleave schistosome or plasmid DNA. Second, the 5'-untranslated region of SjR2 was >80% identical to the 3-untranslated region of a schistosome heat shock protein-70 gene (hsp-70) in the antisense orientation, indicating that SjR2-like elements were probably inserted into the non-coding regions of ancestral S. japonicum HSP-70, probably after the species diverged from S. mansoni. (C) 2002 Australian Society for Parasitology Inc. Published by Elsevier Science Ltd. All rights reserved.

Knowledge sharing and learning processes: case study of portuguese technological schools and higher education institutions

Paper to be presented at the ESREA Conference Learning to Change? The Role of Identity and Learning Careers in Adult Education, 7-8 December, 2006, Université Catholique Louvain, Louvain–la-Neuve, Belgium

Advances in smart grids - benefits on sharing background experiences from Portugal, Central Europe and Brazil

This paper presents ELECON - Electricity Consumption Analysis to Promote Energy Efficiency Considering Demand Response and Non-technical Losses, an international research project that involves European and Brazilian partners. ELECON focuses on energy efficiency increasing through consumer´s active participation which is a key area for Europe and Brazil cooperation. The project aims at significantly contributing towards the successful implementation of smart grids, focussing on the use of new methods that allow the efficient use of distributed energy resources, namely distributed generation, storage and demand response. ELECON puts together researchers from seven European and Brazilian partners, with consolidated research background and evidencing complementary competences. ELECON involves institutions of 3 European countries (Portugal, Germany, and France) and 4 Brazilian institutions. The complementary background and experience of the European and Brazilian partners is of main relevance to ensure the capacities required to achieve the proposed goals. In fact, the European Union (EU) and Brazil have very different resources and approaches in what concerns this area. Having huge hydro and fossil resources, Brazil has not been putting emphasis on distributed renewable based electricity generation. On the contrary, EU has been doing huge investments in this area, taking into account environmental concerns and also the economic EU external dependence dictated by huge requirements of energy related products imports. Sharing these different backgrounds allows the project team to propose new methodologies able to efficiently address the new challenges of smart grids.

Sequencing of a 9.9 kb segment on the right arm of yeast chromosome VII reveals four open reading frames, including PFK1, the gene coding for succinyl-CoA synthetase (beta-chain) and two ORFs sharing homology with ORFs of the yeast chromosome VIII

A 9.9 kb DNA fragment from the right arm of chromosome VII of Saccharomyces cerevisiae has been sequenced and analysed. The sequence contains four open reading frames (ORFs) longer than 100 amino acids. One gene, PFK1, has already been cloned and sequenced and the other one is the probable yeast gene coding for the beta-subunit of the succinyl-CoA synthetase. The two remaining ORFs share homology with the deduced amino acid sequence (and their physical arrangement is similar to that) of the YHR161c and YHR162w ORFs from chromosome VIII.

Capacity sharing and stealing in serverbased real-time systems

A dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers is proposed. Overloads are handled by an efficient reclaiming of residual capacities originated by early completions as well as by allowing reserved capacity stealing of non-guaranteed bandwidth servers. The proposed dynamic budget accounting mechanism ensures that at a particular time the currently executing server is using a residual capacity, its own capacity or is stealing some reserved capacity, eliminating the need of additional server states or unbounded queues. The server to which the budget accounting is going to be performed is dynamically determined at the time instant when a capacity is needed. This paper describes and evaluates the proposed scheduling algorithm, showing that it can efficiently reduce the mean tardiness of periodic jobs. The achieved results become even more significant when tasks’ computation times have a large variance.

A framework for programming sensor networks with scheduling and resource-sharing optimizations

Several projects in the recent past have aimed at promoting Wireless Sensor Networks as an infrastructure technology, where several independent users can submit applications that execute concurrently across the network. Concurrent multiple applications cause significant energy-usage overhead on sensor nodes, that cannot be eliminated by traditional schemes optimized for single-application scenarios. In this paper, we outline two main optimization techniques for reducing power consumption across applications. First, we describe a compiler based approach that identifies redundant sensing requests across applications and eliminates those. Second, we cluster the radio transmissions together by concatenating packets from independent applications based on Rate-Harmonized Scheduling.

A capacity sharing and stealing strategy for open real-time systems

This paper focuses on the scheduling of tasks with hard and soft real-time constraints in open and dynamic real-time systems. It starts by presenting a capacity sharing and stealing (CSS) strategy that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) reclaiming unused reserved capacity when jobs complete in less than their budgeted execution time and (ii) stealing reserved capacity from inactive non-isolated servers used to schedule best-effort jobs. CSS is then combined with the concept of bandwidth inheritance to efficiently exchange reserved bandwidth among sets of inter-dependent tasks which share resources and exhibit precedence constraints, assuming no previous information on critical sections and computation times is available. The proposed Capacity Exchange Protocol (CXP) has a better performance and a lower overhead when compared against other available solutions and introduces a novel approach to integrate precedence constraints among tasks of open real-time systems.

Capacity sharing and stealing in dynamic server-based real-time systems

This paper proposes a dynamic scheduler that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft-tasks’ overloads by making additional capacity available from two sources: (i) residual capacity allocated but unused when jobs complete in less than their budgeted execution time; (ii) stealing capacity from inactive non-isolated servers used to schedule best-effort jobs. The effectiveness of the proposed approach in reducing the mean tardiness of periodic jobs is demonstrated through extensive simulations. The achieved results become even more significant when tasks’ computation times have a large variance.

Shared resources and precedence constraints with capacity sharing and stealing

This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a greedy capacity sharing and stealing policy to efficiently exchange bandwidth among tasks, minimising the degree of deviation from the ideal system's behaviour caused by inter-application blocking. The proposed capacity exchange protocol (CXP) focus on exchanging extra capacities as early, and not necessarily as fairly, as possible. This loss of optimality is worth the reduced complexity as the protocol's behaviour nevertheless tends to be fair in the long run and outperforms other solutions in highly dynamic scenarios, as demonstrated by extensive simulations.

The simple economics of risk-sharing agreements between the NHS and the pharmaceutical industry

The Janssen-Cilag proposal for a risk-sharing agreement regarding bortezomib received a welcome signal from NICE. The Office of Fair Trading report included risk-sharing agreements as an available tool for the National Health Service. Nonetheless, recent discussions have somewhat neglected the economic fundamentals underlying risk-sharing agreements. We argue here that risk-sharing agreements, although attractive due to the principle of paying by results, also entail risks. Too many patients may be put under treatment even with a low success probability. Prices are likely to be adjusted upward, in anticipation of future risk-sharing agreements between the pharmaceutical company and the third-party payer. An available instrument is a verification cost per patient treated, which allows obtaining the first-best allocation of patients to the new treatment, under the risk sharing agreement. Overall, the welfare effects of risk-sharing agreements are ambiguous, and care must be taken with their use.