نتایج جستجو برای: sudanian well known novelist
تعداد نتایج: 1999740 فیلتر نتایج به سال:
In this chapter I consider one of the necessary conditions for being a novelist, the ability to open up and sustain a fictional world. My approach will draw from psychopathology, phenomenology and neuroscience. Using the phenomenological concept of “multiple realities,” I argue that the novelist is in some ways like and in some ways unlike someone who experiences delusions insofar as the noveli...
‘romanticism’ and ‘romantic’ are among the most controversial terms in literature. most readers, when encountering these words, would think of the well-known period of romanticism of the first three decades of the nineteenth century and the great six english poets known as ‘the big six’ of this period. however, romanticism does not belong to certain artists in a special period; one may seek ele...
The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when we choose a digit set that does not contain 0. We prove that such digit sets exist and we provide infinitely many examples for every base b with |b| ≥ 4, and...
The choice of an operator in evolutionary computation is generally based on comparative runs of the algorithms. However, some statistical a priori measures, based on samples of (parents-oospring), have been proposed to avoid such brute comparisons. This paper surveys some of these works in the context of binary crossover operators. We rst extend these measures to overcome some of their limitati...
This paper proposes new factorizations for computing the Neumann series. The factorizations are based on fast algorithms for small prime sizes series and the splitting of large sizes into several smaller ones. We propose a different basis for factorizations other than the well-known binary and ternary basis. We show that is possible to reduce the overall complexity for the usual binary decompos...
T HIS provocative remark has been attributed to the famous industrial statistician, Cuthbert Daniel, by Box et al. (2005) in their well-known text on the design of experiments. Split-Plot experiments were invented by Fisher (1925) and their importance in industrial experimentation has been long recognized (Yates (1936)). It is also well known that many industrial experiments are fielded as spli...
We explore scalability issues of the text classification problem where using (multi)labeled training documents we try to build classifiers that assign documents into classes permitting classification in multiple classes. A new class of classification problems, called ‘scalable’ is introduced that models many problems from the area of Web mining. The property of scalability is defined as the abi...
We present a coalescent process where three particles merge at each coagulation step. Using a random walk representation, we prove duality with a fragmentation process, whose fragmentation law we specify explicitly. Furthermore, we give a second construction of the coalescent in terms of random binary forests and study asymptotic properties. Starting from N particles of unit mass, we obtain und...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید