1,125 research outputs found

    Adding Symmetry Reduction to Uppaal

    No full text
    Contains fulltext : 60201.pdf (author's version ) (Open Access

    Do Humour Styles Impact Psychological Well-Being and Emotional Competence?

    No full text
    Humour is an emotional response that involves laughter and a perception of playful incongruity in a social context. Each humour style reflects the different ways in which individuals use humour in their daily lives habitually, spontaneously, and perhaps unconsciously. The present study aimed at studying the role of adaptive humour and its benefits on psychological well - being along with enhancing the emotional competencies of young adults while viewing humour as an important emotional regulation mechanism. The Humour Styles Questionnaire by Martin, Puhlik- Doris, Larsen, Gray, and Weir (2003), Ryff’s psychological well-being scale (1989) and Emotional Competence Scale by Sharma and Bhardwaj (1998) were used to collect data from 127 young adults aged 18-25 using convenience sampling and analysed using statistical measures such as Spearman's rank correlation and generalized linear models. The results showed that affiliative and self-enhancing humour styles have a significant positive relationship with overall psychological well-being, while aggressive and self-defeating humour styles have a significant negative relationship with it. Affiliative, self-enhancing, and self-defeating humour styles also predict psychological well-being. Emotional competence has a significant positive relationship with self-enhancing humour style and a significant negative relationship with self-defeating humour style. Both humour styles are significant predictors of emotional competence. The study highlights the importance of using humour adaptively to increase emotional competence and psychological well-being, which can aid in creating stronger interpersonal relationships, social skills, and vocational soft skills. It also encourages individuals to use humour adaptively as a conscious strategy to cope with stressful or difficult situations

    Author Name Disambiguation using Large Language Models: Contributions to a system for open reproducible publication research

    No full text
    Author name disambiguation, otherwise described as (publication) record linking, is a problem that has had considerable research dedicated to its solv- ing. Author attributions, calculating research met- rics and conducting literature reviews are amongst processes that experience increased difficulty due to ambiguous author names. In this study, a novel approach is presented to disambiguate au- thors related to scientific publications, using Large Language Models (LLMs) in combination with the Alexandria3k software package. LLMs have shown great potential in processing, analysing and drawing conclusions when presented with human- readable data. The approach presented in this study supplies a LLM with known attributes of publica- tion records and authors, such as names, affiliations and co-authors, to determine whether records writ- ten by authors with ambiguous names can be linked to the same real-world person. Using Alexan- dria3k, a dataset of authors and publications with confirmed identities is created to test and validate the approach. Finally, the approach is measured against state-of-the-art methods to disambiguate author names and different configurations are pre- sented and discussed.CSE3000 Research ProjectComputer Science and Engineerin

    High-k fluoropolymers dielectrics for low-bias ambipolar organic light emitting transistors (Olets)

    No full text
    Funding Information: Author Contributions: Conceptualization, A.A. and C.S.; methodology, A.A. and C.S.; validation, A.A., K.G.-R., and C.S.; data curation, A.A., K.G.-R., and C.S.; writing—original draft preparation, A.A. and C.S.; writing—review and editing, A.A., K.G.-R., and C.S.; supervision, C.S.; project administration, C.S.; funding acquisition, C.S. All authors have read and agreed to the published ver-sion ofFunding:the manuThescript.authors acknowledge the support from the Academy of Finland Flagship Program (Grant No.: 320167, PREIN) and the Aalto seed funding scheme. Publisher Copyright: © 2021 by the authors. Licensee MDPI, Basel, Switzerland.Organic light emitting transistors (OLETs) combine, in the same device, the function of an electrical switch with the capability of generating light under appropriate bias conditions. In this work, we demonstrate how engineering the dielectric layer based on high-k polyvinylidene fluoride (PVDF)-based polymers can lead to a drastic reduction of device driving voltages and the improvement of its optoelectronic properties. We first investigated the morphology and the dielectric response of these polymer dielectrics in terms of polymer (P(VDF-TrFE) and P(VDF-TrFE-CFE)) and solvent content (cyclopentanone, methylethylketone). Implementing these high-k PVDF-based dielectrics enabled low-bias ambipolar organic light emitting transistors, with reduced threshold voltages (<20 V) and enhanced light output (compared to conventional polymer reference), along with an overall improvement of the device efficiency. Further, we preliminary transferred these fluorinated high-k dielectric films onto a plastic substrate to enable flexible light emitting transistors. These findings hold potential for broader exploitation of the OLET platform, where the device can now be driven by commercially available electronics, thus enabling flexible low-bias organic electronic devices.Peer reviewe

    Analysis of Markov Jump Processes under Terminal Constraints

    No full text
    Many probabilistic inference problems such as stochastic filtering or the computation of rare event probabilities require model analysis under initial and terminal constraints. We propose a solution to this bridging problem for the widely used class of population-structured Markov jump processes. The method is based on a state-space lumping scheme that aggregates states in a grid structure. The resulting approximate bridging distribution is used to iteratively refine relevant and truncate irrelevant parts of the state-space. This way, the algorithm learns a well-justified finite-state projection yielding guaranteed lower bounds for the system behavior under endpoint constraints. We demonstrate the method’s applicability to a wide range of problems such as Bayesian inference and the analysis of rare events

    PARS: A Process Algebra with Resources and Schedulers.

    No full text
    In this paper, we introduce a dense time process algebraic formalism with support for specification of (shared) resource requirements and resource schedulers. The goal of this approach is to facilitate and formalize introduction of scheduling concepts into process algebraic specification using separate specifications for resource requiring processes, schedulers and systems composing the two. The benefits of this research are twofold. Firstly, it allows for formal investigation of scheduling strategies. Secondly, it provides the basis for an extension of schedulability analysis techniques to the formal verification process, facilitating the modelling of real-time systems in a process algebraic manner using the rich background of research in scheduling theory
    corecore