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.

Augmenting spaces and creating interactive experiences using video camera networks

This research addresses the problem of creating interactive experiences to encourage people to explore spaces. Besides the obvious spaces to visit, such as museums or art galleries, spaces that people visit can be, for example, a supermarket or a restaurant. As technology evolves, people become more demanding in the way they use it and expect better forms of interaction with the space that surrounds them. Interaction with the space allows information to be transmitted to the visitors in a friendly way, leading visitors to explore it and gain knowledge. Systems to provide better experiences while exploring spaces demand hardware and software that is not in the reach of every space owner either because of the cost or inconvenience of the installation, that can damage artefacts or the space environment. We propose a system adaptable to the spaces, that uses a video camera network and a wi-fi network present at the space (or that can be installed) to provide means to support interactive experiences using the visitor’s mobile device. The system is composed of an infrastructure (called vuSpot), a language grammar used to describe interactions at a space (called XploreDescription), a visual tool used to design interactive experiences (called XploreBuilder) and a tool used to create interactive experiences (called urSpace). By using XploreBuilder, a tool built of top of vuSpot, a user with little or no experience in programming can define a space and design interactive experiences. This tool generates a description of the space and of the interactions at that space (that complies with the XploreDescription grammar). These descriptions can be given to urSpace, another tool built of top of vuSpot, that creates the interactive experience application. With this system we explore new forms of interaction and use mobile devices and pico projectors to deliver additional information to the users leading to the creation of interactive experiences. The several components are presented as well as the results of the respective user tests, which were positive. The design and implementation becomes cheaper, faster, more flexible and, since it does not depend on the knowledge of a programming language, accessible for the general public.

A conspiracy theory for clefts : the syntax and interpretation of cleft constructions

O objetivo final deste estudo é contribuir para a discussão sobre qual a medida em que conceitos semânticos e discursivos estão sintaticamente codificados. Mais especificamente, investiga-se se existe alguma correlação consistente entre alguns aspetos interpretativos e sintáticos de quatro construções clivadas do Português Europeu, e como se deve dar conta teoricamente destas potenciais correlações. As clivadas consideradas são as clivadas canónicas, as pseudoclivadas, as clivadas de é que e as clivadas de SER. Sintaticamente podemos distinguir dois tipos: clivadas bioracionais (canónicas e pseudoclivadas) e clivadas mono-oracionais (clivadas de é que e de SER). Todas as estruturas têm um constituinte clivado focalizado que pode constituir tanto um foco informacional como um foco contrastivo, e uma oração clivada que introduz uma pressuposição existencial. Adicionalmente, o constituinte clivado identifica exaustivamente uma posição vazia na oração clivada. Adota-se a semântica alternativa para o foco (Rooth 1985), segundo a qual o foco entoacional contribui uniformemente um conjunto de alternativas na Forma Lógica. Regras pragmáticas operando neste conjunto dão origem a duas implicaturas que podem ser suspensas: pressuposição existencial e exaustividade. Dado que as clivadas de é que e as de SER têm a mesma interpretação que orações não-clivadas, conclui-se que a sua estrutura sintática particular não contribui para estas propriedades interpretativas. Em contrapartida, as clivadas bioracionais, que são orações copulativas especificacionais, têm uma presuposição existencial e uma interpretação exaustiva que não pode ser suspensa, tal como as orações especificacionais não-clivadas. Argumenta-se que isto se deve ao facto de o constituinte clivado identificar uma variável introduzida por uma descrição definida. Demonstra-se que a oração clivada, uma relativa em posição de complemento de um determinador definido nas clivadas canónicas e uma relativa livre nas pseudoclivadas, tem a mesma denotação que um DP definido, e portanto tem uma pressuposição existencial inerente. A interpretação exaustiva deve-se à relação identificacional entre o constituinte clivado e a descrição definida. Além disso, defende-se que em Português Europeu um traço de foco não desencadeia movimento-A’ para um FocP especializado. Os constituintes focalizados movem-se antes por razões independentes do foco. Isto é confirmado pelo facto de apenas o constituinte clivado das clivadas de é que ter propriedades de movimento A’, os outros parecem estar in situ. Propõe-se que o constituinte clivado das clivadas de é que é um tópico com um traço de foco que se move para um TopP. Esta análise dá conta da existência de restrições discursivas semelhantes para tópicos não focalizados e para o constituinte clivado das clivadas de é que. O traço quantificacional de foco arrastado pela topicalização dá origem a efeitos de intervenção, causando a não-recursividade do foco na periferia esquerda e a sua incompatibilidade com movimento de outros constituintes com traços quantificacionais. A análise prediz as restrições de encaixe observadas para as clivadas de é que. Finalmente, desenvolve-se uma análise sintática das clivadas de SER que aproxima estas estruturas das estruturas com partículas de foco. Propõe-se que a cópula é um operador sensível ao foco que é merged juntamente com o constituinte clivado. As restrições distribucionais da cópula devem-se a requisitos selecionais de núcleos.

An interactive learning approach to accounting classes

This working paper explores the use of interactive learning tools, such as business simulations, to facilitate the active learning process in accounting classes. Although business simulations were firstly introduced in the United States in the 1950s, the vast majority of accounting professors still use traditional teaching methods, based in end-of-chapter exercises and written cases. Moreover, the current students’ generation brings new challenges to the classroom related with their video, game, internet and mobile culture. Thus, a survey and an experimentation were conducted to understand, on one hand, if accounting professors are willing to adjust their teaching methods with the adoption of interactive learning tools and, on the other hand, if the adoption of interactive learning tools in accounting classes yield better academic results and levels of satisfaction among students. Students using more interactive learning approaches scored significantly higher means than others that did not. Accounting professors are clearly willing to try, at least once, the use of an accounting simulator in classes.

An interactive web-based tool for breast reduction surgery simulation

In this work, we present a 3D web-based interactive tool for numerical modeling and simulation approach to breast reduction surgery simulation, to assist surgeons in planning all aspects related to breast reduction surgery before the actual procedure takes place, thereby avoiding unnecessary risks. In particular, it allows the modeling of the initial breast geometry, the definition of all aspects related to the surgery and the visualization of the post-surgery breast shape in a realistic environment.

Quantum field theory approach to the optical conductivity of strained and deformed graphene

The computation of the optical conductivity of strained and deformed graphene is discussed within the framework of quantum field theory in curved spaces. The analytical solutions of the Dirac equation in an arbitrary static background geometry for one dimensional periodic deformations are computed, together with the corresponding Dirac propagator. Analytical expressions are given for the optical conductivity of strained and deformed graphene associated with both intra and interbrand transitions. The special case of small deformations is discussed and the result compared to the prediction of the tight-binding model.

Pseudofermion dynamical theory for the spin dynamical correlation functions of the half-filled 1D Hubbard model

A modified version of the metallic-phase pseudofermion dynamical theory (PDT) of the 1D Hubbard model is introduced for the spin dynamical correlation functions of the half-filled 1D Hubbard model Mott– Hubbard phase. The Mott–Hubbard insulator phase PDT is applied to the study of the model longitudinal and transverse spin dynamical structure factors at finite magnetic field h, focusing in particular on the sin- gularities at excitation energies in the vicinity of the lower thresholds. The relation of our theoretical results to both condensed-matter and ultra-cold atom systems is discussed.

On the temperature dependence of the absorption cross section for black holes in string theory

We study the low frequency absorption cross section of spherically symmetric nonextremal d-dimensional black holes. In the presence of α′ corrections, this quantity must have an explicit dependence on the Hawking temperature of the form 1/TH. This property of the low frequency absorption cross section is shared by the D1-D5 system from type IIB superstring theory already at the classical level, without α′ corrections. We apply our formula to the simplest example, the classical d-dimensional Reissner-Nordstr¨om solution, checking that the obtained formula for the cross section has a smooth extremal limit. We also apply it for a d-dimensional Tangherlini-like solution with α′3 corrections.

Absorption of scalars by nonextremal charged black holes in string theory

We analyze the low frequency absorption cross section of minimally coupled massless scalar fields by different kinds of charged static black holes in string theory, namely the D1–D5 system in d=5 and a four dimensional dyonic four-charged black hole. In each case we show that this cross section always has the form of some parameter of the solution divided by the black hole Hawking temperature. We also verify in each case that, despite its explicit temperature dependence, such quotient is finite in the extremal limit, giving a well defined cross section. We show that this precise explicit temperature dependence also arises in the same cross section for black holes with string \alpha' corrections: it is actually induced by them.

Genetic regulatory mechanisms by means of extended interactive Petri nets

In our work we have chosen to integrate formalism for knowledge representation with formalism for process representation as a way to specify and regulate the overall activity of a multi-cellular agent. The result of this approach is XP,N, another formalism, wherein a distributed system can be modeled as a collection of interrelated sub-nets sharing a common explicit control structure. Each sub-net represents a system of asynchronous concurrent threads modeled by a set of transitions. XP,N combines local state and control with interaction and hierarchy to achieve a high-level abstraction and to model the complex relationships between all the components of a distributed system. Viewed as a tool XP,N provides a carefully devised conflict resolution strategy that intentionally mimics the genetic regulatory mechanism used in an organic cell to select the next genes to process.

Verificación de Sistemas Basada en Teoría de Tipos. System verification in type theory

Este proyecto se enmarca en la utlización de métodos formales (más precisamente, en la utilización de teoría de tipos) para garantizar la ausencia de errores en programas. Por un lado se plantea el diseño de nuevos algoritmos de chequeo de tipos. Para ello, se proponen nuevos algoritmos basados en la idea de normalización por evaluación que sean extensibles a otros sistemas de tipos. En el futuro próximo extenderemos resultados que hemos conseguido recientemente [16,17] para obtener: una simplificación de los trabajos realizados para sistemas sin regla eta (acá se estudiarán dos sistemas: a la Martin Löf y a la PTS), la formulación de estos chequeadores para sistemas con variables, generalizar la noción de categoría con familia utilizada para dar semántica a teoría de tipos, obtener una formulación categórica de la noción de normalización por evaluación y finalmente, aplicar estos algoritmos a sistemas con reescrituras. Para los primeros resultados esperados mencionados, nos proponemos como método adaptar las pruebas de [16,17] a los nuevos sistemas. La importancia radica en que permitirán tornar más automatizables (y por ello, más fácilmente utilizables) los asistentes de demostración basados en teoría de tipos. Por otro lado, se utilizará la teoría de tipos para certificar compiladores, intentando llevar adelante la propuesta nunca explorada de [22] de utilizar un enfoque abstracto basado en categorías funtoriales. El método consistirá en certificar el lenguaje "Peal" [29] y luego agregar sucesivamente funcionalidad hasta obtener Forsythe [23]. En este período esperamos poder agregar varias extensiones. La importancia de este proyecto radica en que sólo un compilador certificado garantiza que un programa fuente correcto se compile a un programa objeto correcto. Es por ello, crucial para todo proceso de verificación que se base en verificar código fuente. Finalmente, se abordará la formalización de sistemas con session types. Los mismos han demostrado tener fallas en sus formulaciones [30], por lo que parece conveniente su formalización. Durante la marcha de este proyecto, esperamos tener alguna formalización que dé lugar a un algoritmo de chequeo de tipos y a demostrar las propiedades usuales de los sistemas. La contribución es arrojar un poco de luz sobre estas formulaciones cuyos errores revelan que el tema no ha adquirido aún suficiente madurez o comprensión por parte de la comunidad. This project is about using type theory to garantee program correctness. It follows three different directions: 1) Finding new type-checking algorithms based on normalization by evaluation. First, we would show that recent results like [16,17] extend to other type systems like: Martin-Löf´s type theory without eta rule, PTSs, type systems with variables (in addition to systems in [16,17] which are a la de Bruijn), systems with rewrite rules. This will be done by adjusting the proofs in [16,17] so that they apply to such systems as well. We will also try to obtain a more general definition of categories with families and normalization by evaluation, formulated in categorical terms. We expect this may turn proof-assistants more automatic and useful. 2) Exploring the proposal in [22] to compiler construction for Algol-like languages using functorial categories. According to [22] such approach is suitable for verifying compiler correctness, claim which was never explored. First, the language Peal [29] will be certified in type theory and we will gradually add funtionality to it until a correct compiler for the language Forsythe [23] is obtained. 3) Formilizing systems for session types. Several proposals have shown to be faulty [30]. This means that a formalization of it may contribute to the general understanding of session types.

Darwin and after Darwin. An exposition of the Darwinian theory and a discussion of post-Darwinian questions, by George John Romanes ...

3

Darwin and after Darwin. An exposition of the Darwinian theory and a discussion of post-Darwinian questions, by George John Romanes ...

2

Darwin and after Darwin. An exposition of the Darwinian theory and a discussion of post-Darwinian questions, by George John Romanes ...

1