Stacie Friend’s theory of fiction departs from those approaches that seek to identify the necessary and sufficient conditions for a work to count as fiction. She argues that this goal cannot really be achieved; instead, she appeals to the notion of genre to distinguish between fiction and nonfiction. This notion is significantly more flexible, since it invites us to identify standard—but not necessary—and counter-standard features of works of fiction in light of our classificatory practices. More specifically, Friend argues that the genre of fiction has the genre of nonfiction—and only that genre—as its contrast class. I will refer to the particular way in which Friend elaborates this claim as the contrast view. I have, nevertheless, the impression that this view unnecessarily narrows down the array of perspectives and attitudes from which we can approach works of fiction. I will thus develop a line of reasoning to the effect that the contrast view should rather be construed as picking out a particular way of relating to works of fiction that lies at the end of a continuum defined by different degrees of reflectivity and estrangement. This implies that the contrast view is false as a general claim about how we experience works of fiction, even though this view may appropriately depict a specific way of approaching such works.
This paper deals with the global position control problem of robot manipulators in joint space, a new family of control schemes consisting of a suitable combination of hyperbolic functions is presented. The proposed control family includes a large class of bounded hyperbolic-type control schemes to drive both position error and derivative action terms plus gravity compensation. To ensure global asymptotic stability of closed-loop system equilibrium point, we propose an energy-shaping based strict Lyapunov function. To verify the efficiency of the proposed control algorithm, an experimental comparative analysis between the well known unbounded linear PD control and three hyperbolic-type control schemes of the proposed family on a three degrees of freedom direct-drive robot manipulator is analysed.
We investigate the category $\text{mod}\Lambda $ of finite length modules over the ring $\Lambda =A\otimes _k\Sigma $, where $\Sigma $ is a V-ring, i.e. a ring for which every simple module is injective, $k$ a subfield of its centre and $A$ an elementary $k$-algebra. Each simple module $E_j$ gives rise to a quasiprogenerator $P_j=A\otimes E_j$. By a result of K. Fuller, $P_j$ induces a category equivalence from which we deduce that $\text{mod}\Lambda \simeq \coprod _jbad hbox P_j$. As a consequence we can (1) construct for each elementary $k$-algebra $A$ over a finite field $k$ a nonartinian noetherian ring $\Lambda $ such that $\text{mod}A\simeq \text{mod}\Lambda $, (2) find twisted versions $\Lambda $ of algebras of wild representation type such that $\Lambda $ itself is of finite or tame representation type (in mod), (3) describe for certain rings $\Lambda $ the minimal almost split morphisms in $\text{mod} \Lambda $ and observe that almost all of these maps are not almost split in $\text{Mod}\Lambda $.
In this paper, we demonstrate the computational consequences of making a simple assumption on production cost structures in capacitated lot-size problems. Our results indicate that our cost assumption of increased productivity over time has dramatic effects on the problem sizes which are solvable. Our experiments indicate that problems with more than 1000 products in more than 1000 time periods may be solved within reasonable time. The Lagrangian decomposition algorithm we use does of course not guarantee optimality, but our results indicate surprisingly narrow gaps for such large-scale cases - in most cases significantly outperforming CPLEX. We also demonstrate that general CLSP's can benefit greatly from applying our proposed heuristic.
The paper presents a simple method to check a positiveness of symmetric multivariate polynomials on the unit multi-circle. The method is based on the sampling polynomials using the fast Fourier transform. The algorithm is described and its possible applications are proposed. One of the aims of the paper is to show that presented algorithm is significantly faster than commonly used method based on the semi-definite programming expression.
This paper discusses an experiment in cognitive psychology called the Linda problem. Firstly, some natural conditions for the correctness of the interpretation of psychological experiments (such as the Linda problem) are formulated. The article is essentially a critique of the interpretation of the results of the Linda problem experiment provided by Kahneman and Tversky as well as – indirectly – their concept of heuristics. It is shown that the interpretation provided by Kahneman and Tversky does not meet the aforementioned conditions for correctness. The main argument is justified utilizing such rules of rationality as conditional probability and Grice’s conversational maxims. It is also pointed out that this argument can be reformulated in terms of the intuitive system of reasoning., Tento příspěvek pojednává o experimentu v kognitivní psychologii nazývaném problém Lindy. Za prvé jsou formulovány některé přírodní podmínky pro správnost interpretace psychologických experimentů (jako je problém Lindy). Článek je v podstatě kritikou interpretace výsledků problému Linda, který poskytli Kahneman a Tversky, stejně jako - nepřímo - jejich pojetí heuristiky. Ukazuje se, že výklad poskytnutý Kahnemanem a Tversky nesplňuje výše uvedené podmínky správnosti. Hlavní argument je odůvodněn použitím takových pravidel racionality jako podmíněné pravděpodobnosti a Griceho konverzačních maxim. Rovněž je zdůrazněno, že tento argument lze přeformulovat z hlediska intuitivního systému uvažování., and Adam Olszewski
The perturbed Laplacian matrix of a graph G is defined as DL = D−A, where D is any diagonal matrix and A is a weighted adjacency matrix of G. We develop a Fiedler-like theory for this matrix, leading to results that are of the same type as those obtained with the algebraic connectivity of a graph. We show a monotonicity theorem for the harmonic eigenfunction corresponding to the second smallest eigenvalue of the perturbed Laplacian matrix over the points of articulation of a graph. Furthermore, we use the notion of Perron component for the perturbed Laplacian matrix of a graph and show how its second smallest eigenvalue can be characterized using this definition., Israel Rocha, Vilmar Trevisan., and Obsahuje seznam literatury
Dieser Artikel erforscht die Quellen, analysiert die Sprache, erötert den historischen Kontext und die Umstände der Entstehung der ruthenischen Übersetzung des Liedes der Lieder aus dem tschechischen. Die Handschrift, die ein Bestandteil einer handschriftlichen Sammlung aus den 15.-16. Jahrhunderten ist, liegt heute in dem Staatlichen Historischen Museum in Moskau unter der Nr. 558 in der Abteilung der Handschriften aus der Bibliothek des Heiligen Synods. Die linguistische und textologische Analyse der Übersetzung, wie auch der handschriftlichen Sammlung im ganzen, legt die Hypothese nahe, daß die Entstehung der ruthenischen Übersetzung des Liedes der Lieder mit der Missionsaktivität der Mönchen - Glagoljaši bei der orthodoxen Bevölkerung südwestlichen Rußlands (Ruthenia) verbunden war. Diese waren von Wladyslaw Jagiello aus dem Emmaus-Kloster in Prag eingeladen worden, um hier die slavische Liturgie "nach dem Gesetz des römischen Hofes" einzuführen.
Matrix polynomials play an important role in the theory of matrix differential equations. We develop a fixed point method to compute solutions of matrix polynomials equations, where the matricial elements of the matrix polynomial are considered separately as complex polynomials. Numerical examples illustrate the method presented.
For a $C^1$-function $f$ on the unit ball $\mathbb B \subset \mathbb C ^n$ we define the Bloch norm by $\|f\|_\mathfrak B=\sup \|\tilde df\|,$ where $\tilde df$ is the invariant derivative of $f,$ and then show that $$ \|f\|_\mathfrak B= \sup _{z,w\in {\mathbb B} \atop z\neq w} (1-|z|^2)^{1/2}(1-|w|^2)^{1/2}\frac {|f(z)-f(w)|}{|w-P_wz-s_wQ_wz|}.$$.