A New Variant of Emissive RNA Alphabets

2022 ◽  
Author(s):  
Paul Ludford ◽  
Shenghua Yang ◽  
Marcela S Bucardo ◽  
Yitzhak Tor
Keyword(s):  
New Variant

Estimating the Valence of Single Stimuli: A New Variant of the Affective Simon Task

2003 ◽  
Vol 50 (2) ◽  
pp. 86-96 ◽  
Author(s):  
Andreas Voß ◽  
Klaus Rothermund ◽  
Dirk Wentura
Keyword(s):  
Simon Task ◽  
Emotional Expressions ◽  
Evaluation Task ◽  
New Variant ◽  
Game Context

Abstract. In this article, a modified variant of the Affective Simon Task (AST; De Houwer & Eelen, 1998 ) is presented as a measure of implicit evaluations of single stimuli. In the AST, the words “good” or “bad” have to be given as responses depending on the color of the stimuli. The AST was combined with an evaluation task to increase the salience of the valence of the presented stimuli. Experiment 1 investigated evaluations of schematic faces showing emotional expressions. In Experiment 2 we measured the valence of artificial stimuli that acquired valence in a game context during the experiment. Both experiments confirm the validity of the modified AST. The results also revealed a dissociation between explicit and implicit evaluations.

The Economic Theory of the Firm: A Generalization

2012 ◽  
pp. 41-66 ◽  
Author(s):  
M. Storchevoy
Keyword(s):  
Economic Theory ◽  
General Theory ◽  
Contract Theory ◽  
Theory Of The Firm ◽  
Material Structure ◽  
Structural Factors ◽  
Boundaries Of The Firm ◽  
Opportunistic Behaviour ◽  
New Variant

The paper deals with development of a general theory of the firm. It discusses the demand for such a theory, reviews existing approaches to its generalization, and offers a new variant of general theory of the firm based on the contract theory. The theory is based on minimization of opportunistic behaviour determined by the material structure of production (a classification of ten structural factors is offered). This framework is applied to the analysis of three boundaries problems (boundaries of the job, boundaries of the unit, boundaries of the firm) and five integration dilemmas (vertical, horizontal, functional, related, and conglomerate).

System of suborder Schistosomatida (Platyhelminthes: Trematoda)

2018 ◽  
Vol 12 (2) ◽  
pp. 11-12
Author(s):  
D.A. Azimov ◽  
F.D. Akramova ◽  
E.B. Shakarboev
Keyword(s):  
Current System ◽  
Research System ◽  
New Variant ◽  
Trichobilharzia Ocellata

The purpose of the research: system retrofit of suborder Schistosomatidа in reliance on their morfo-biological distinctions. Materials and methods. Samples of adult and 5 species of larvas have been collected and tested: Schistosoma turkestanicum Skryabin, 1913, Bilharziella polonica (Kowalewsky, 1899), Trichobilharzia ocellata (La Valette, 1854), Dendritobilharzia loossi Skryabin, 1924 and Gigantobilharzia acotylea Odhner, 1910. Adult phases of trematode have been identified in accordance to common methods. Identification of cercaria larva produced by water living shell-fish (Lymnaeidae, Planorbidae, Physidae, Melanoididae) has been carried out according to indicators. Current system of trematode suborder Schistosomatidа - vertebrate animals and man parasites are analyzed. Results and discussion. New variant of system of trematode suborder Schistosomatidа order is proposed. Schistosomatida morfo-biological distinctions and biocycles are taken as a basis. Two families are distinguished in this suborder: Schistosomatidae and Bilharziellidae, which represent parasites of warm-blooded vertebrate animals. There are two families of Sanguinicolidae and Spirorchiidae in suborder Sanguinicolida, which consist of fish and reptile parasites respectively. For Schistosomatida order the new underclass Schistosomatidea is founded. Sanguinicolida order is left as the part of Digenea underclass consisting of androgynous fluke.

New variant of ISOMAP for imperfect manifold

2013 ◽  
Vol 32 (7) ◽  
pp. 1987-1990
Author(s):  
Chao SHAO ◽  
Hui-juan ZHANG
Keyword(s):  
New Variant

scholarly journals Construction of a demand and capacity model for intensive care and hospital ward beds, and mortality from COVID-19

2021 ◽  
Vol 21 (1) ◽  
Author(s):  
Christopher Martin ◽  
Stuart McDonald ◽  
Steve Bale ◽  
Michiel Luteijn ◽  
Rahul Sarkar
Keyword(s):  
Intensive Care ◽  
National Level ◽  
Direct Consequence ◽  
Hospital Ward ◽  
Model Parameters ◽  
Capacity Model ◽  
New Variant ◽  
Pessimistic Scenario ◽  
Demand And Capacity ◽  
Excess Deaths

Abstract Background This paper describes a model for estimating COVID-19 related excess deaths that are a direct consequence of insufficient hospital ward bed and intensive care unit (ICU) capacity. Methods Compartmental models were used to estimate deaths under different combinations of ICU and ward care required and received in England up to late April 2021. Model parameters were sourced from publicly available government information and organisations collating COVID-19 data. A sub-model was used to estimate the mortality scalars that represent increased mortality due to insufficient ICU or general ward bed capacity. Three illustrative scenarios for admissions numbers, ‘Optimistic’, ‘Middling’ and ‘Pessimistic’, were modelled and compared with the subsequent observations to the 3rd February. Results The key output was the demand and capacity model described. There were no excess deaths from a lack of capacity in the ‘Optimistic’ scenario. Several of the ‘Middling’ scenario applications resulted in excess deaths—up to 597 deaths (0.6% increase) with a 20% reduction compared to best estimate ICU capacity. All the ‘Pessimistic’ scenario applications resulted in excess deaths, ranging from 49,178 (17.0% increase) for a 20% increase in ward bed availability, to 103,735 (35.8% increase) for a 20% shortfall in ward bed availability. These scenarios took no account of the emergence of the new, more transmissible, variant of concern (b.1.1.7). Conclusions Mortality is increased when hospital demand exceeds available capacity. No excess deaths from breaching capacity would be expected under the ‘Optimistic’ scenario. The ‘Middling’ scenario could result in some excess deaths—up to a 0.7% increase relative to the total number of deaths. The ‘Pessimistic’ scenario would have resulted in significant excess deaths. Our sensitivity analysis indicated a range between 49,178 (17% increase) and 103,735 (35.8% increase). Given the new variant, the pessimistic scenario appeared increasingly likely and could have resulted in a substantial increase in the number of COVID-19 deaths. In the event, it would appear that capacity was not breached at any stage at a national level with no excess deaths. it will remain unclear if minor local capacity breaches resulted in any small number of excess deaths.

scholarly journals The look ahead trace back optimizer for genomic selection under transparent and opaque simulators

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Fatemeh Amini ◽  
Felipe Restrepo Franco ◽  
Guiping Hu ◽  
Lizhi Wang
Keyword(s):  
Genomic Selection ◽  
Genetic Gain ◽  
Genomic Prediction ◽  
In Planta ◽  
Data Set ◽  
Look Ahead ◽  
Trace Back ◽  
New Variant ◽  
The Look ◽  
Partially Observable

AbstractRecent advances in genomic selection (GS) have demonstrated the importance of not only the accuracy of genomic prediction but also the intelligence of selection strategies. The look ahead selection algorithm, for example, has been found to significantly outperform the widely used truncation selection approach in terms of genetic gain, thanks to its strategy of selecting breeding parents that may not necessarily be elite themselves but have the best chance of producing elite progeny in the future. This paper presents the look ahead trace back algorithm as a new variant of the look ahead approach, which introduces several improvements to further accelerate genetic gain especially under imperfect genomic prediction. Perhaps an even more significant contribution of this paper is the design of opaque simulators for evaluating the performance of GS algorithms. These simulators are partially observable, explicitly capture both additive and non-additive genetic effects, and simulate uncertain recombination events more realistically. In contrast, most existing GS simulation settings are transparent, either explicitly or implicitly allowing the GS algorithm to exploit certain critical information that may not be possible in actual breeding programs. Comprehensive computational experiments were carried out using a maize data set to compare a variety of GS algorithms under four simulators with different levels of opacity. These results reveal how differently a same GS algorithm would interact with different simulators, suggesting the need for continued research in the design of more realistic simulators. As long as GS algorithms continue to be trained in silico rather than in planta, the best way to avoid disappointing discrepancy between their simulated and actual performances may be to make the simulator as akin to the complex and opaque nature as possible.

False‐negative tests in Huntington's disease: A new variant within primer hybridization site

2021 ◽  
Author(s):  
Jaroslaw Dulski ◽  
Anna Sulek ◽  
Magdalena Krygier ◽  
Wiktoria Radziwonik ◽  
Jaroslaw Slawek
Keyword(s):  
Huntington's Disease ◽  
Huntington’S Disease ◽  
False Negative ◽  
Hybridization Site ◽  
New Variant

scholarly journals Computationally Efficient Approach to Implementation of the Chinese Remainder Theorem Algorithm in Minimally Redundant Residue Number System

2021 ◽  
Author(s):  
Mikhail Selianinau
Keyword(s):  
Chinese Remainder Theorem ◽  
Number System ◽  
Residue Number System ◽  
Computer Applications ◽  
Efficient Approach ◽  
Residue Modulo ◽  
Modern Computer ◽  
New Variant ◽  
Residue Number ◽  
Residue Code

AbstractIn this paper, we deal with the critical problem of performing non-modular operations in the Residue Number System (RNS). The Chinese Remainder Theorem (CRT) is widely used in many modern computer applications. Throughout the article, an efficient approach for implementing the CRT algorithm is described. The structure of the rank of an RNS number, a principal positional characteristic of the residue code, is investigated. It is shown that the rank of a number can be represented by a sum of an inexact rank and a two-valued correction to it. We propose a new variant of minimally redundant RNS, which provides low computational complexity for the rank calculation, and its effectiveness analyzed concerning conventional non-redundant RNS. Owing to the extension of the residue code, by adding the excess residue modulo 2, the complexity of the rank calculation goes down from $O\left (k^{2}\right )$ O k 2 to $O\left (k\right )$ O k with respect to required modular addition operations and lookup tables, where k equals the number of non-redundant RNS moduli.

Sign in / Sign up

Export Citation Format

Share Document