Toward Figural Fantasy : The Representation of Consciousness in Modern American Fantasy Literature

Tajunnanesitys amerikkalaisessa heterodiegeettisessä fantasiakirjallisuudessa on muuttunut merkittävästi viimeisen kolmen vuosikymmenen aikana: kerrontaa orientoiva ja tarinamaailmaa havainnoiva tajunta on vähin erin vaihtunut kaikkitietävästä kertojasta tarinan sisäiseksi henkilöhahmoksi. Kertoja on samalla vetäytynyt yhä syvemmälle kerronnan kulissien taakse. Tämä tutkielma hahmottaa ja analysoi kyseistä muutosta siirtymänä kertojakeskeisestä kerronnasta kohti henkilökeskeistä kerrontaa. Tutkielmassa tajunnanesityksen teoreettisen kehyksen muodostavat F. K. Stanzelin kertojakeskeisen ja henkilökeskeisen kerrontatilanteen käsitteet. Kerrontatilanteita tarkennetaan fokalisaation, vapaan epäsuoran esityksen, sisäisen monologin ja psykonarraation teorioiden avulla. Tutkielma jakaantuu kahteen osaan. Ensimmäisessä osassa vertaillaan kahta prototyyppistä fantasiaromaania syväluotaavan narratologisen analyysin keinoin. Kertojakeskeistä kerrontaa edustaa Fritz Leiberin "The Swords of Lankhmar" (1968) ja henkilökeskeistä kerrontaa George R. R. Martinin "A Game of Thrones" (1996). Toisessa osassa tarkastellaan pääpiirteittäin kuuttatoista muuta aikaansa edustavaa fantasiaromaania ja hahmotetaan tajunnanesityksen muutoksen kronologista kulkua. Yhdessä osat ilmentävät, kuinka amerikkalainen heterodiegeettinen fantasiakirjallisuus on muuttunut kerrontateknisesti henkilökeskeisemmäksi. Tutkielma on ensimmäinen laatuaan, ja sen on tarkoitus luoda pohjaa uudenlaiselle modernin fantasiakirjallisuuden tutkimukselle ja kirjalliselle arvostukselle.

Representation of functional dependencies in relational databases using linear graphs

Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) dependency relation, (2) equipotence relation, (3) dissidence relation, (4) completion relation, and dual relations of each of them are described. Any one of these eight relations can be used to represent the functional dependencies in a database. Results from linear graph theory are found helpful in obtaining these representations. The dependency relation directly gives the functional dependencies. The equipotence relation specifies the dependencies in terms of attribute sets which functionally determine each other. The dissidence relation specifies the dependencies in terms of saturated sets in a very indirect way. Completion relation represents the functional dependencies as a function, the range of which turns out to be a lattice. Depletion relation which is the dual of the completion relation can also represent functional dependencies and similarly can the duals of dependency, equipotence, and dissidence relations. The class of depleted sets, which is the dual of saturated sets, is defined and used in the study of depletion relations.

Leveraging Lean Production Philosophy for Rationalising a Non-Linear Representation of Construction Specifications

This paper presents an approach, based on Lean production philosophy, for rationalising the processes involved in the production of specification documents for construction projects. Current construction literature erroneously depicts the process for the creation of construction specifications as a linear one. This traditional understanding of the specification process often culminates in process-wastes. On the contrary, the evidence suggests that though generalised, the activities involved in producing specification documents are nonlinear. Drawing on the outcome of participant observation, this paper presents an optimised approach for representing construction specifications. Consequently, the actors typically involved in producing specification documents are identified, the processes suitable for automation are highlighted and the central role of tacit knowledge is integrated into a conceptual template of construction specifications. By applying the transformation, flow, value (TFV) theory of Lean production the paper argues that value creation can be realised by eliminating the wastes associated with the traditional preparation of specification documents with a view to integrating specifications in digital models such as Building Information Models (BIM). Therefore, the paper presents an approach for rationalising the TFV theory as a method for optimising current approaches for generating construction specifications based on a revised specification writing model.

Linear time geometrical design rule checker based on quadtree representation of VLSI mask layouts

An efficient geometrical design rule checker is proposed, based on operations on quadtrees, which represent VLSI mask layouts. The time complexity of the design rule checker is O(N), where N is the number of polygons in the mask. A pseudoPascal description is provided of all the important algorithms for geometrical design rule verification.

Difference covering arrays and pseudo-orthogonal Latin squares

A pair of Latin squares, A and B, of order n, is said to be pseudo-orthogonal if each symbol in A is paired with every symbol in B precisely once, except for one symbol with which it is paired twice and one symbol with which it is not paired at all. A set of t Latin squares, of order n, are said to be mutually pseudo-orthogonal if they are pairwise pseudo-orthogonal. A special class of pseudo-orthogonal Latin squares are the mutually nearly orthogonal Latin squares (MNOLS) first discussed in 2002, with general constructions given in 2007. In this paper we develop row complete MNOLS from difference covering arrays. We will use this connection to settle the spectrum question for sets of 3 mutually pseudo-orthogonal Latin squares of even order, for all but the order 146.

Reflexive Incidence Matrx (RIM) Representation of Petr Nets

Although incidence matrix representation has been used to analyze the Petri net based models of a system, it has the limitation that it does not preserve reflexive properties (i.e., the presence of selfloops) of Petri nets. But in many practical applications self-loops play very important roles. This paper proposes a new representation scheme for general Petri nets. This scheme defines a matrix called "reflexive incidence matrix (RIM) c which is a combination of two matrices, a "base matrix Cb,,, and a "power matrix CP." This scheme preserves the reflexive and other properties of the Petri nets. Through a detailed analysis it is shown that the proposed scheme requires less memory space and less processing time for answering commonly encountered net queries compared to other schemes. Algorithms to generate the RIM from the given net description and to decompose RIM into input and output function matrices are also given. The proposed Petri net representation scheme is very useful to model and analyze the systems having shared resources, chemical processes, network protocols, etc., and to evaluate the performance of asynchronous concurrent systems.

Representation of functional dependencies in relational databases using linear graphs

Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) dependency relation, (2) equipotence relation, (3) dissidence relation, (4) completion relation, and dual relations of each of them are described. Any one of these eight relations can be used to represent the functional dependencies in a database. Results from linear graph theory are found helpful in obtaining these representations. The dependency relation directly gives the functional dependencies. The equipotence relation specifies the dependencies in terms of attribute sets which functionally determine each other. The dissidence relation specifies the dependencies in terms of saturated sets in a very indirect way. Completion relation represents the functional dependencies as a function, the range of which turns out to be a lattice. Depletion relation which is the dual of the completion relation can also represent functional dependencies and similarly can the duals of dependency, equipotence, and dissidence relations. The class of depleted sets, which is the dual of saturated sets, is defined and used in the study of depletion relations.

Concepts and Object-Oriented Knowledge Representation

Tutkielma käsittelee nykyisiä kognitiotieteen teorioita käsitteistä ja niiden mallintamista oliokeskeisillä tietämyksen esittämisen menetelmillä. Käsiteteorioista käsitellään klassinen, määritelmäteoria, prototyyppiteoria, duaaliteoriat, uusklassinen teoria, teoria-teoria ja atomistinen teoria. Oliokeskeiset menetelmät ovat viime aikoina jakautuneet kahden tyyppisiin kieliin: oliopohjaisiin ja luokkapohjaisiin. Uudet olio-pohjaiset olio-ohjelmointikielet antavat käsitteiden representointiin mahdollisuuksia, jotka puuttuvat aikaisemmista luokka-pohjaisista kielistä ja myös kehysmenetelmistä. Tutkielma osoittaa, että oliopohjaisten kielten uudet piirteet tarjoavat keinoja, joilla käsitteitä voidaan esittää symbolisessa muodossa paremmin kuin perinteisillä menetelmillä. Niillä pystytään simuloimaan kaikkea mitä luokkapohjaisilla kielillä voidaan, mutta ne pystyvät lisäksi simuloimaan perheyhtäläisyyskäsitteitä ja mahdollistavat olioiden dynaamisen muuttamisen ilman, että siinä rikotaan psykologisen essentialismin periaatetta. Tutkielma osoittaa lisäksi vakavia puutteitta, jotka koskevat koko oliokeskeistä menetelmää. Avainsanat: käsitteet, käsiteteoriat, tekoäly, komputationaalinen psykologia, olio-ohjelmointi, tiedon esittäminen

A new formalism for representation of binary thermodynamic data

The applicability of a formalism involving an exponential function of composition x1 in interpreting the thermodynamic properties of alloys has been studied. The excess integral and partial molar free energies of mixing are expressed as: $$\begin{gathered} \Delta F^{xs} = a_o x_1 (1 - x_1 )e^{bx_1 } \hfill \\ RTln\gamma _1 = a_o (1 - x_1 )^2 (1 + bx_1 )e^{bx_1 } \hfill \\ RTln\gamma _2 = a_o x_1^2 (1 - b + bx_1 )e^{bx_1 } \hfill \\ \end{gathered} $$ The equations are used in interpreting experimental data for several relatively weakly interacting binary systems. For the purpose of comparison, activity coefficients obtained by the subregular model and Krupkowski’s formalism have also been computed. The present equations may be considered to be convenient in describing the thermodynamic behavior of metallic solutions.

Representation and properties of para-Bose oscillator operators. II. Coherent states and the minimum uncertainty states

The energy, position, and momentum eigenstates of a para-Bose oscillator system were considered in paper I. Here we consider the Bargmann or the analytic function description of the para-Bose system. This brings in, in a natural way, the coherent states ||z;alpha> defined as the eigenstates of the annihilation operator ?. The transformation functions relating this description to the energy, position, and momentum eigenstates are explicitly obtained. Possible resolution of the identity operator using coherent states is examined. A particular resolution contains two integrals, one containing the diagonal basis ||z;alpha><−z;alpha||. We briefly consider the normal and antinormal ordering of the operators and their diagonal and discrete diagonal coherent state approximations. The problem of constructing states with a minimum value of the product of the position and momentum uncertainties and the possible alpha dependence of this minimum value is considered. Journal of Mathematical Physics is copyrighted by The American Institute of Physics.

Representation of Stereoisomers in ALWIN

Tlhe well-known Cahn-lngold-Prelog method of specifying the stereoisomers is introduced within the framework of ALWIN-Algorithmic Wiswesser Notation. Given the structural diagram, the structural ALWIN is first formed; the speclflcation symbols are then introduced at the appropriate places to describe the stereoisomers.

Multiple instance dictionary learning for activity representation

This paper presents an effective feature representation method in the context of activity recognition. Efficient and effective feature representation plays a crucial role not only in activity recognition, but also in a wide range of applications such as motion analysis, tracking, 3D scene understanding etc. In the context of activity recognition, local features are increasingly popular for representing videos because of their simplicity and efficiency. While they achieve state-of-the-art performance with low computational requirements, their performance is still limited for real world applications due to a lack of contextual information and models not being tailored to specific activities. We propose a new activity representation framework to address the shortcomings of the popular, but simple bag-of-words approach. In our framework, first multiple instance SVM (mi-SVM) is used to identify positive features for each action category and the k-means algorithm is used to generate a codebook. Then locality-constrained linear coding is used to encode the features into the generated codebook, followed by spatio-temporal pyramid pooling to convey the spatio-temporal statistics. Finally, an SVM is used to classify the videos. Experiments carried out on two popular datasets with varying complexity demonstrate significant performance improvement over the base-line bag-of-feature method.