The idea, the machine, and the art: word and image in the 21st century

Taking in recent advances in neuroscience and digital technology, Gander and Garland assess the state of the inter-arts in America and the Western world, exploring and questioning the primacy of affect in an increasingly hypertextual everyday environment. In this analysis they signal a move beyond W. J. T. Mitchell’s coinage of the ‘imagetext’ to an approach that centres the reader-viewer in a recognition, after John Dewey, of ‘art as experience’. New thinking in cognitive and computer sciences about the relationship between the body and the mind challenges any established definitions of ‘embodiment’, ‘materiality’, ‘virtuality’ and even ‘intelligence, they argue, whilst ‘Extended Mind Theory���, they note, marries our cognitive processes with the material forms with which we engage, confirming and complicating Marshall McLuhan’s insight, decades ago, that ‘all media are “extensions of man”’. In this chapter, Gander and Garland open paths and suggest directions into understandings and critical interpretations of new and emerging imagetext worlds and experiences.

Using Graph Components Derived from an Associative Concept Dictionary to Predict fMRI Neural Activation Patterns that Represent the Meaning of Nouns

In this study, we introduce an original distance definition for graphs, called the Markov-inverse-F measure (MiF). This measure enables the integration of classical graph theory indices with new knowledge pertaining to structural feature extraction from semantic networks. MiF improves the conventional Jaccard and/or Simpson indices, and reconciles both the geodesic information (random walk) and co-occurrence adjustment (degree balance and distribution). We measure the effectiveness of graph-based coefficients through the application of linguistic graph information for a neural activity recorded during conceptual processing in the human brain. Specifically, the MiF distance is computed between each of the nouns used in a previous neural experiment and each of the in-between words in a subgraph derived from the Edinburgh Word Association Thesaurus of English. From the MiF-based information matrix, a machine learning model can accurately obtain a scalar parameter that specifies the degree to which each voxel in (the MRI image of) the brain is activated by each word or each principal component of the intermediate semantic features. Furthermore, correlating the voxel information with the MiF-based principal components, a new computational neurolinguistics model with a network connectivity paradigm is created. This allows two dimensions of context space to be incorporated with both semantic and neural distributional representations.

Triangular Objects and Systematic K-Theory

We investigate modules over “systematic” rings. Such rings are “almost graded” and have appeared under various names in the literature; they are special cases of the G-systems of Grzeszczuk. We analyse their K-theory in the presence of conditions on the support, and explain how this generalises and unifies calculations of graded and filtered K-theory scattered in the literature. Our treatment makes systematic use of the formalism of idempotent completion and a theory of triangular objects in additive categories, leading to elementary and transparent proofs throughout.

A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph

A family of quadratic programming problems whose optimal values are upper bounds on the independence number of a graph is introduced. Among this family, the quadratic programming problem which gives the best upper bound is identified. Also the proof that the upper bound introduced by Hoffman and Lovász for regular graphs is a particular case of this family is given. In addition, some new results characterizing the class of graphs for which the independence number attains the optimal value of the above best upper bound are given. Finally a polynomial-time algorithm for approximating the size of the maximum independent set of an arbitrary graph is described and the computational experiments carried out on 36 DIMACS clique benchmark instances are reported.

On the Faria's inequality for the Laplacian and signless Laplacian spectra: a unified approach

Let p(G)p(G) and q(G)q(G) be the number of pendant vertices and quasi-pendant vertices of a simple undirected graph G, respectively. Let m_L±(G)(1) be the multiplicity of 1 as eigenvalue of a matrix which can be either the Laplacian or the signless Laplacian of a graph G. A result due to I. Faria states that mL±(G)(1) is bounded below by p(G)−q(G). Let r(G) be the number of internal vertices of G. If r(G)=q(G), following a unified approach we prove that mL±(G)(1)=p(G)−q(G). If r(G)>q(G) then we determine the equality mL±(G)(1)=p(G)−q(G)+mN±(1), where mN±(1) denotes the multiplicity of 1 as eigenvalue of a matrix N±. This matrix is obtained from either the Laplacian or signless Laplacian matrix of the subgraph induced by the internal vertices which are non-quasi-pendant vertices. Furthermore, conditions for 1 to be an eigenvalue of a principal submatrix are deduced and applied to some families of graphs.

Sediment dynamics and tidal inlet relocation in mixed-energy settings: the case of Ancão inlet (Algarve - Portugal)

Tese de dout., Ciências do Mar, Faculdade de Ciências do Mar e do Ambiente, Univ. do Algarve, 2003

Models and tools for value systems analysis in collaborative environments

Dissertation to obtain the degree of Doctor in Electrical and Computer Engineering, specialization of Collaborative Networks

Work satisfaction and affective commitment of classical musicians: The European Union Youth Orchestra

This work project investigates career paths in the music field, by testing the application of general career and social theories for musicians. Using a sample from the European Union Youth Orchestra’ Alumni, the Boundaryless Career Theory, Intelligent Career Framework and Social Identity Theory were analysed through the impact on individual outcomes - musicians’ Overall work satisfaction and Affective commitment to the orchestra. Results suggest support for the three theories, and show their applicability for classical musicians’ careers.

Process virtualization theory (PVT) and institutional theory (INT) to explain SAAS adoption

Software as a service (SaaS) is a service model in which the applications are accessible from various client devices through internet. Several studies report possible factors driving the adoption of SaaS but none have considered the perception of the SaaS features and the pressures existing in the organization’s environment. We propose an integrated research model that combines the process virtualization theory (PVT) and the institutional theory (INT). PVT seeks to explain whether SaaS processes are suitable for migration into virtual environments via an information technology-based mechanism. INT seeks to explain the effects of the institutionalized environment on the structure and actions of the organization. The research makes three contributions. First, it addresses a gap in the SaaS adoption literature by studying the internal perception of the technical features of SaaS and external coercive, normative, and mimetic pressures faced by an organization. Second, it empirically tests many of the propositions of PVT and INT in the SaaS context, thereby helping to determine how the theory operates in practice. Third, the integration of PVT and INT contributes to the information system (IS) discipline, deepening the applicability and strengths of these theories.

Properties and algorithms of the (n, k)-arrangement graphs

The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is more flexible in degree and diameter. However, there are few algorithms designed for the (n, k)-arrangement graph up to present. In this thesis, we will focus on finding graph theoretical properties of the (n, k)- arrangement graph and developing parallel algorithms that run on this network. The topological properties of the arrangement graph are first studied. They include the cyclic properties. We then study the problems of communication: broadcasting and routing. Embedding problems are also studied later on. These are very useful to develop efficient algorithms on this network. We then study the (n, k )-arrangement network from the algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms such as prefix sums computation, sorting, merging and basic geometry computation: finding convex hull on the (n, k )-arrangement graph. A literature review of the state-of-the-art in relation to the (n, k)-arrangement network is also provided, as well as some open problems in this area.

Properties and Algorithms of the KCube Interconnection Networks

The KCube interconnection network was first introduced in 2010 in order to exploit the good characteristics of two well-known interconnection networks, the hypercube and the Kautz graph. KCube links up multiple processors in a communication network with high density for a fixed degree. Since the KCube network is newly proposed, much study is required to demonstrate its potential properties and algorithms that can be designed to solve parallel computation problems. In this thesis we introduce a new methodology to construct the KCube graph. Also, with regard to this new approach, we will prove its Hamiltonicity in the general KC(m; k). Moreover, we will find its connectivity followed by an optimal broadcasting scheme in which a source node containing a message is to communicate it with all other processors. In addition to KCube networks, we have studied a version of the routing problem in the traditional hypercube, investigating this problem: whether there exists a shortest path in a Qn between two nodes 0n and 1n, when the network is experiencing failed components. We first conditionally discuss this problem when there is a constraint on the number of faulty nodes, and subsequently introduce an algorithm to tackle the problem without restrictions on the number of nodes.

International Business Cycles: What Are the Facts?

Modern business cycle theory involves developing models that explain stylized facts. For this strategy to be successful, these facts should be well established. In this paper, we focus on the stylized facts of international business cycles. We use the generalized method of moments and quarterly data from nineteen industrialized countries to estimate pairwise cross-country and within-country correlations of macroeconomic aggregates. We calculate standard errors of the statistics for our unique panel of data and test hypotheses about the relative sizes of these correlations. We find a lower cross-country correlation of all aggregates and especially of consumption than in previous studies. The cross-country correlations of consumption, output and Solow residuals are not significantly different from one another over the whole sample, but there are significant differences in the post-1973 subsample.

Studies on Some Graph Classes

Department of Mathematics, Cochin University of Science and Technology

Studies on the Spectrum and the Energy of Graphs

Department of Mathematics, Cochin University of Science and Technology