the cultivar khavaran has come out of the national potato breeding program started in 2001 and continued for ten years in the seed and plant improvement institute karaj, iran. the breeding methodology has initiated by selection among germplasm consisting an open pollination of the clone 397097-13. the khavaran release included single plant selection, visual assessment, preliminary observation n...

The article is focused on meme-generating trends related to the COVID-19 pandemic, continuing a string of papers published issue meme definition, classification and analysis. Based modern European, American Ukrainian research, this study aimed at describing, analyzing illustrating influence pandemic its ‘newspeak’ memes generated in 2020-2021 by general public. Memes are prominent part communic...

The article defines the concept of “Internet meme”, analyzes its main characteristics, types, describes methodology content analysis memes. purpose this study is to carry out a computer memes, identify their features, and determine functions. Researchers analyzed 240 Internet memes about Russian-Ukrainian war in 2022. Ukrainian social networks were used as source sampling period: from February ...

This paper proposes a new visualization and reification framework for the integrated interactive access and reuse of both database records and Web contents including services. Our framework has integrated the database visualization and reification framework and the Web application wrapping framework. The Web application wrapping framework allows users to specify arbitrary HTML nodes on an arbit...

We introduce a new motif-discovery algorithm, DIMDom, which exploits two additional kinds of information not commonly exploited: (a) the characteristic pattern of binding site classes, where class is determined based on biological information about transcription factor domains and (b) posterior probabilities of these classes. We compared the performance of DIMDom with MEME on all the transcript...

Finitarily Markovian processes are those processes {Xn}n=−∞ for which there is a finite K (K = K({Xn} 0 n=−∞) such that the conditional distribution of X1 given the entire past is equal to the conditional distribution of X1 given only {Xn} 0 n=1−K . The least such value of K is called the memory length. We give a rather complete analysis of the problems of universally estimating the least such ...