Abstract. Using templates for conceptual modeling is becoming a fashionable way to guide and facilitate Domain Experts in providing rich and good quality knowledge. A possibility to build templates without starting from scratch is grounding them on existing foundational and core ontologies. In this paper we investigate how these ontologies can be effectively used for the construction of templat...

Aims and method To explore core psychiatry trainees' experiences of cognitive-behavioural therapy (CBT) training by using interpretative phenomenological analysis of semi-structured interviews conducted with seven core trainee psychiatrists in Yorkshire and the Humber Deanery. Results Four key themes emerged: (1) barriers to training; (2) guidance, with emphasis on the importance of supervision...

A common conceptual infrastructure is crucial for multilingual language processing and documentation. Global Wordnet (GWN) was proposed as the common infrastructure for linguistically motivated conceptual representations for all languages. Two critical issues in this line of research are: the scarcity of lexical semantic information (especially from endangered languages), and the lack of a shar...

A simple general synthetic concept to build dendritic core-shell architectures with pH-labile linkers based on hyperbranched PEI cores and biocompatible PEG shells is presented. Using these dendritic core-shell architectures as nanocarriers, the encapsulation and transport of polar dyes of different sizes is studied. The results show that the acid-labile nanocarriers exhibit much higher transpo...

We assert that digital signal processing (DSP) can and should be taught early (sophomore-junior) in the electrical and computer engineering curricula. This paper looks at the impact this has on the rest of the curriculum, both in electrical and computer engineering and in other engineering curricula. While the early introduction of basic DSP makes it possible to offer better senior electives an...

Discovering dense subgraphs and understanding the relations among them is a fundamental problem in graph mining. We want to not only identify dense subgraphs, but also build a hierarchy among them (e.g., larger but sparser subgraphs formed by two smaller dense subgraphs). Peeling algorithms (k-core, k-truss, and nucleus decomposition) have been effective to locate many dense subgraphs. However,...

MOTIVATION The prediction of the regions of homology models that can be 'restrained by' or 'copied from' the basis structures is a vital step in correct model generation, because these regions are the models most accurate part. However, there is no ideal method for the identification of their limits. In most algorithms their length depends on the number of family members and definitions of seco...