Random binary search tree with equal elements

AbstractWe consider random binary search trees when the input consists of a multiset, i.e. a set with multiple occurrences of equal elements, and prove that the randomized insertion and deletion algorithms given by Martínez and Roura (1998) [4] produce random search trees regardless of multiplicities; even if all the elements are equal during the tree updates, a search tree will maintain its randomness. Thus, equal elements do not degenerate a random search tree and they need not to be handled in any special way. We consider also stability of a search tree with respect to its inorder traversal and prove that the algorithms used produce stable trees. This implies an implicit indexing of equal elements giving another proof that multiplicities do not pose problems when maintaining random binary search trees

Exploration of Ideas for Sustaining Digital Innovation Management : A Case Study in the Ostrobothnia Region of Finland

Disruption of technologies, climate changes and epidemic crises have significantly affected individuals, organizations, and society. These phenomena force organizations to extend and innovate their business models to adapt to new circumstances. However, literature provides a limited coverage on how sustainable innovations ideas form and evaluate in practice. We thus focus on this issue in the present study. We used nominal focus group technique, C-K design theory for innovative design with citizen sciences as our study’s lenses. Data collection was from three groups of 81 participants who live in three cities in the Ostrobothnia region of Finland. The findings illustrate the process of establishing a sustainable innovation management idea and lesson learned on how to facilitate innovation groups in practice.©2022 Association for Information Systems.fi=vertaisarvioitu|en=peerReviewed

Exploration of Ideas for Sustaining Digital Innovation Management: A Case Study in the Ostrobothnia Region of Finland

Disruption of technologies, climate changes and epidemic crises have significantly affected individuals, organizations, and society. These phenomena force organizations to extend and innovate their business models to adapt to new circumstances. However, literature provides a limited coverage on how sustainable innovations ideas form and evaluate in practice. We thus focus on this issue in the present study. We used nominal focus group technique, C-K design theory for innovative design with citizen sciences as our study’s lenses. Data collection was from three groups of 81 participants who live in three cities in the Ostrobothnia region of Finland. The findings illustrate the process of establishing a sustainable innovation management idea and lesson learned on how to facilitate innovation groups in practice

Framework for evaluating believability of non-player characters in games

Computing Reviews (1998) Categories and Subject Descriptors: I.2.1 Artificial Intelligence: Applications and Expert Systems — games J.4 Social and Behavioral Science — psychology, sociologyWe present a framework for evaluating believability of characters in first-person shooter (FPS) games and look into the development of non-player character’s user-perceived believability. The used framework is composed of two aspects: firstly, character movement and animation, secondly, behavior. Examination of three different FPS games yields that the newer the game was, the better the believability of characters in the game. Moreover, the results from both the aspects of the framework were mutually balanced through all games examined

Why Using Robots to Teach Computer Science can be Successful Theoretical Reflection to Andragogy and Minimalism

Categories and Subject Descriptors K.3.1 [Computers and Education]: Computer Uses in Education – collaborative learning; K.3.2 [Computers and Education]: Computer and Information Science Education – computer science education, self-assessmentTo help students understand subjects such as theoretical aspects of computation, algorithmic reasoning and intelligence of machines, a number of publications report experiments to teach these topics with the help of Lego Mindstorms robots. In the publications, the researchers report how they have created various ways to approach the issues either in Computer Science or in Artificial Intelligence. The reported results of the experiments are based on the learning outcomes, the feedback from the students, and the perceived informal observations (i.e. “feelings”) of the instructors. But can anyone else benefit from the reportedly positive outcomes of the experiments? To give an answer to that question, this paper analyses the reported results through two support theories. The two theories chosen for this, andragogy and minimalism, are concerned with adult learning and how teaching adults should be approached. When reflecting the results of the four teaching experiments to the suggestions drawn from the theories, a more comprehensive answer to why the experiments have been successful can be given. The four teaching experiments analysed here were in many ways similar to each other. A connection to the chosen support theories was straightforward to make. Besides describing the artefacts of teaching with the robots, a deeper discussion on this teaching approach is provided. For an instructor, all these observations offer more concrete evidence about beneficial factors of teaching with robots

Human placental proteomics and exon variant studies link AAT/SERPINA1 with spontaneous preterm birth

Background: Preterm birth is defined as live birth before 37 completed weeks of pregnancy, and it is a major problem worldwide. The molecular mechanisms that lead to onset of spontaneous preterm birth are incompletely understood. Prediction and evaluation of the risk of preterm birth is challenging as there is a lack of accurate biomarkers. In this study, our aim was to identify placental proteins that associate with spontaneous preterm birth. Methods: We analyzed the proteomes from placentas to identify proteins that associate with both gestational age and spontaneous labor. Next, rare and potentially damaging gene variants of the identified protein candidates were sought for from our whole exome sequencing data. Further experiments we performed on placental samples and placenta-associated cells to explore the location and function of the spontaneous preterm labor-associated proteins in placentas. Results: Exome sequencing data revealed rare damaging variants in SERPINA1 in families with recurrent spontaneous preterm deliveries. Protein and mRNA levels of alpha-1 antitrypsin/SERPINA1 from the maternal side of the placenta were downregulated in spontaneous preterm births. Alpha-1 antitrypsin was expressed by villous trophoblasts in the placenta, and immunoelectron microscopy showed localization in decidual fibrinoid deposits in association with specific extracellular proteins. siRNA knockdown in trophoblast-derived HTR8/SVneo cells revealed that SERPINA1 had a marked effect on regulation of the actin cytoskeleton pathway, Slit–Robo signaling, and extracellular matrix organization. Conclusions: Alpha-1 antitrypsin is a protease inhibitor. We propose that loss of the protease inhibition effects of alpha-1 antitrypsin renders structures critical to maintaining pregnancy susceptible to proteases and inflammatory activation. This may lead to spontaneous premature birth.publishedVersionPeer reviewe

In-Place Sorting With Fewer Moves

. It is shown that an array of n elements can be sorted using O(1) extra space, O(n log n= log log n) element moves, and n log 2 n+O(n log log n) comparisons. This is the first in-place sorting algorithm requiring o(n log n) moves in the worst case while guaranteeing O(n log n) comparisons, but due to the constant factors involved the algorithm is predominantly of theoretical interest. Keywords. In-place algorithms, sorting, merging, mergesort, multiway merge. 1. Introduction In array sorting we are given an array of n elements, each consisting of a key and some information associated with that key, and the task is to reorder these in ascending order according to their keys. To carry out the sorting we assume that the only operations allowed for the elements are key comparisons and element moves. Moreover, we want to perform the sorting in-place, i.e., we assume that besides the input array there is a constant number of memory locations available for storing elements and a constant n..

Visualisation of Associations Between Nucleotides in SNP Neighbourhoods

A large number of single nucleotide polymorphisms have been mapped onto the human genome. Mutations are induced through endogenous and exogenous processes, and these procedures have been shown to be sequence-dependent. Association mining is a powerful tool for analyzing sequence neighbourhoods; however, visualisation is essential for pattern recognition because of the abundance of resulting association rules. A software tool was developed to visualize position interdependencies within the sequence variation data. The software is capable of interactive reorganization of the association rules, enabling fast and easy exploration of the data using a standard web browser. The software and its complete source code is freely available at