A frequency-domain receiver for asynchronous systems employing CP-assisted DS-CDMA schemes

In this paper we consider the uplink transmission within CP-assisted (Cyclic Pre¯x) DS-CDMA (Direct Sequence Code Division Multiple Access) systems and we present a frequency-domain MUD (MultiUser Detection) receiver with iterative estimation and compensation of residual frequency errors. The proposed receiver is suitable for broadband wireless systems, with performances that can be close to the single-user MFB (Matched Filter Bound), even for fully loaded systems and/or in the presence of strong interfering signals. The receiver is powerful enough for typical asynchronous scenarios, requiring only a coarse synchronization between users.

Frequency- domain multiuser detection for highly overloaded DS-CDMA systems

A DS-CDMA (Direct Sequence-Coded Division Multiple Access) system has maximum spectral efficiency if the system is fully loaded (i.e., the number of users is equal to the spreading factor) and we employ signals with bandwidth equal to the chip rate. However, due to implementation constraints we need to employ signals with higher bandwidth, decreasing the system’s spectral efficiency. In this paper we consider prefixassisted DS-CDMA systems with bandwidth that can be significantly above the chip rate. To allow high spectral efficiency we consider highly overloaded systems where the number of users can be twice the spreading factor or even more. To cope with the strong interference levels we present an iterative frequencydomain receiver that takes full advantage of the total bandwidth of the transmitted signals. Our performance results show that the proposed receiver can have excellent performance, even for highly overloaded systems. Moreover, the overall system performance can be close to the maximum theoretical spectral efficiency, even with transmitted signals that have bandwidth significantly above the chip rate.

Role of Automated Open Source Systems in the Intelligence Analysis of a High-Level Domain Expert

Open-domain web-based multiple document : question answering for list questions with support for temporal restrictors

Tese de doutoramento, Informática (Ciências da Computação), Universidade de Lisboa, Faculdade de Ciências, 2015

Georg Lukács as a Communications Scholar: Cultural and Digital Labour in the Context of Lukács’ Ontology of Social Being

The task of this work is to apply thoughts from Georg Lukács’ final book, the Ontology of Social Being, for the theoretical analysis of cultural and digital labour. It discusses Lukács’ concepts of work and communication and relates them to the analysis of cultural and digital work. It also analyses his conception of the relation of labour and ideology and points out how we can make use of it for critically understanding social media ideologies. Lukács opposes the dualist separation of the realms of work and ideas. He introduces in this context the notion of teleological positing that allows us to better understand cultural and digital labour as well as associated ideologies, such as the engaging/connecting/sharing-ideology, today. The analysis shows that Lukács’ Ontology is in the age of Facebook, YouTube, and Twitter still a very relevant book, although it has thus far not received the attention that it deserves. This article also introduces the Ontology’s main ideas on work and culture, which is important because large parts of the book have not been translated from the German original into English. Lukács’ notion of teleological positing is crucial for understanding the common features of the economy and culture.

The N-terminal domain modulates α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid (AMPA) receptor desensitization

AMPA receptors are tetrameric glutamate-gated ion channels that mediate fast synaptic neurotransmission in mammalian brain. Their subunits contain a two-lobed N-terminal domain (NTD) that comprises over 40% of the mature polypeptide. The NTD is not obligatory for the assembly of tetrameric receptors, and its functional role is still unclear. By analyzing full-length and NTD-deleted GluA1-4 AMPA receptors expressed in HEK 293 cells, we found that the removal of the NTD leads to a significant reduction in receptor transport to the plasma membrane, a higher steady state-to-peak current ratio of glutamate responses, and strongly increased sensitivity to glutamate toxicity in cell culture. Further analyses showed that NTD-deleted receptors display both a slower onset of desensitization and a faster recovery from desensitization of agonist responses. Our results indicate that the NTD promotes the biosynthetic maturation of AMPA receptors and, for membrane-expressed channels, enhances the stability of the desensitized state. Moreover, these findings suggest that interactions of the NTD with extracellular/synaptic ligands may be able to fine-tune AMPA receptor-mediated responses, in analogy with the allosteric regulatory role demonstrated for the NTD of NMDA receptors.

Withdrawing from Atmosphere: An Ontology of Air partitioning and Affective Engineering

The main objective of this text is to warn against atmospherics. However comfortable it might appear, an atmosphere is politically suspicious because it numbs a body into an affective embrace of stability and permanence. It becomes doubly suspicious because a body desires to be part of the atmosphere. For this reason, I rethink both affect and atmosphere ontologically rather than phenomenologically. I argue that an atmosphere is engineered by subsuming individual affects to what I call, following Sloterdijk, an atmospheric glasshouse. I suggest that this happens in four steps: a distinction between inside and outside through partitioning; inclusion of the outside inside; illusion of synthesis; and dissimulation. In order to do this, I begin with air as the elemental paradox of ontological continuum and rupture. I carry on with the passage from air to atmosphere while retaining the discourse around continuum and rupture. Finally, I indicate a way of rupturing the atmospheric continuum through the ontological movement of withdrawal from the atmosphere. The ultimate goal of the article is to sketch a problematic of atmospherics that puts together without synthesising an elemental ontology of continuum and rupture.

Withdrawing from atmosphere: An ontology of air partitioning and affective engineering

The main objective of this text is to warn against atmospherics. However comfortable it might appear, an atmosphere is politically suspicious because it numbs a body into an affective embrace of stability and permanence. It becomes doubly suspicious because a body desires to be part of the atmosphere. For this reason, I rethink both affect and atmosphere ontologically rather than phenomenologically. I argue that an atmosphere is engineered by subsuming individual affects to what I call, following Sloterdijk, an atmospheric glasshouse. I suggest that this happens in four steps: a distinction between inside and outside through partitioning; inclusion of the outside inside; illusion of synthesis; and dissimulation. In order to do this, I begin with air as the elemental paradox of ontological continuum and rupture. I carry on with the passage from air to atmosphere while retaining the discourse around continuum and rupture. Finally, I indicate a way of rupturing the atmospheric continuum through the ontological movement of withdrawal from the atmosphere. The ultimate goal of the article is to sketch a problematic of atmospherics that puts together without synthesising an elemental ontology of continuum and rupture.

Business Process Modelling based on formal temporal theory with an application to hospital patient flows

Existing Workflow Management Systems (WFMSs) follow a pragmatic approach. They often use a proprietary modelling language with an intuitive graphical layout. However the underlying semantics lack a formal foundation. As a consequence, analysis issues, such as proving correctness i.e. soundness and completeness, and reliable execution are not supported at design level. This project will be using an applied ontology approach by formally defining key terms such as process, sub-process, action/task based on formal temporal theory. Current business process modelling (BPM) standards such as Business Process Modelling Notation (BPMN) and Unified Modelling Language (UML) Activity Diagram (AD) model their constructs with no logical basis. This investigation will contribute to the research and industry by providing a framework that will provide grounding for BPM to reason and represent a correct business process (BP). This is missing in the current BPM domain, and may result in reduction of the design costs and avert the burden of redundant terms used by the current standards. A graphical tool will be introduced which will implement the formal ontology defined in the framework. This new tool can be used both as a modelling tool and at the same time will serve the purpose of validating the model. This research will also fill the existing gap by providing a unified graphical representation to represent a BP in a logically consistent manner for the mainstream modelling standards in the fields of business and IT. A case study will be conducted to analyse a catalogue of existing ‘patient pathways’ i.e. processes, of King’s College Hospital NHS Trust including current performance statistics. Following the application of the framework, a mapping will be conducted, and new performance statistics will be collected. A cost/benefits analysis report will be produced comparing the results of the two approaches.

A general framework for Business Process Modelling (BPM) based on Formal Temporal Theory with an application to Hospital Patient flows

Existing Workflow Management Systems (WFMSs) follow a pragmatic approach. They often use a proprietary modelling language with an intuitive graphical layout. However the underlying semantics lack a formal foundation. As a consequence, analysis issues, such as proving correctness i.e. soundness and completeness, and reliable execution are not supported at design level. This project will be using an applied ontology approach by formally defining key terms such as process, sub-process, action/task based on formal temporal theory. Current business process modelling (BPM) standards such as Business Process Modelling Notation (BPMN) and Unified Modelling Language (UML) Activity Diagram (AD) model their constructs with no logical basis. This investigation will contribute to the research and industry by providing a framework that will provide grounding for BPM to reason and represent a correct business process (BP). This is missing in the current BPM domain, and may result in reduction of the design costs and avert the burden of redundant terms used by the current standards. A graphical tool will be introduced which will implement the formal ontology defined in the framework. This new tool can be used both as a modelling tool and at the same time will serve the purpose of validating the model. This research will also fill the existing gap by providing a unified graphical representation to represent a BP in a logically consistent manner for the mainstream modelling standards in the fields of business and IT. A case study will be conducted to analyse a catalogue of existing ‘patient pathways’ i.e. processes, of King’s College Hospital NHS Trust including current performance statistics. Following the application of the framework, a mapping will be conducted, and new performance statistics will be collected. A cost/benefits analysis report will be produced comparing the results of the two approaches.

Ontologies for reusing data cleaning knowledge

The emergence of new business models, namely, the establishment of partnerships between organizations, the chance that companies have of adding existing data on the web, especially in the semantic web, to their information, led to the emphasis on some problems existing in databases, particularly related to data quality. Poor data can result in loss of competitiveness of the organizations holding these data, and may even lead to their disappearance, since many of their decision-making processes are based on these data. For this reason, data cleaning is essential. Current approaches to solve these problems are closely linked to database schemas and specific domains. In order that data cleaning can be used in different repositories, it is necessary for computer systems to understand these data, i.e., an associated semantic is needed. The solution presented in this paper includes the use of ontologies: (i) for the specification of data cleaning operations and, (ii) as a way of solving the semantic heterogeneity problems of data stored in different sources. With data cleaning operations defined at a conceptual level and existing mappings between domain ontologies and an ontology that results from a database, they may be instantiated and proposed to the expert/specialist to be executed over that database, thus enabling their interoperability.

Analysis of the domain of applicability of an algorithm for a resources system selection problem for Distributed/Agile/Virtual Enterprises integration

The process of resources systems selection takes an important part in Distributed/Agile/Virtual Enterprises (D/A/V Es) integration. However, the resources systems selection is still a difficult matter to solve in a D/A/VE, as it is pointed out in this paper. Globally, we can say that the selection problem has been equated from different aspects, originating different kinds of models/algorithms to solve it. In order to assist the development of a web prototype tool (broker tool), intelligent and flexible, that integrates all the selection model activities and tools, and with the capacity to adequate to each D/A/V E project or instance (this is the major goal of our final project), we intend in this paper to show: a formulation of a kind of resources selection problem and the limitations of the algorithms proposed to solve it. We formulate a particular case of the problem as an integer programming, which is solved using simplex and branch and bound algorithms, and identify their performance limitations (in terms of processing time) based on simulation results. These limitations depend on the number of processing tasks and on the number of pre-selected resources per processing tasks, defining the domain of applicability of the algorithms for the problem studied. The limitations detected open the necessity of the application of other kind of algorithms (approximate solution algorithms) outside the domain of applicability founded for the algorithms simulated. However, for a broker tool it is very important the knowledge of algorithms limitations, in order to, based on problem features, develop and select the most suitable algorithm that guarantees a good performance.

Time domain design of fractional differintegrators using least-squares

In this paper we propose the use of the least-squares based methods for obtaining digital rational approximations (IIR filters) to fractional-order integrators and differentiators of type sα, α∈R. Adoption of the Padé, Prony and Shanks techniques is suggested. These techniques are usually applied in the signal modeling of deterministic signals. These methods yield suboptimal solutions to the problem which only requires finding the solution of a set of linear equations. The results reveal that the least-squares approach gives similar or superior approximations in comparison with other widely used methods. Their effectiveness is illustrated, both in the time and frequency domains, as well in the fractional differintegration of some standard time domain functions.

An Extension of Estimation of Domain of Attraction for Fractional Order Linear System Subject to Saturation Control

This paper employs the Lyapunov direct method for the stability analysis of fractional order linear systems subject to input saturation. A new stability condition based on saturation function is adopted for estimating the domain of attraction via ellipsoid approach. To further improve this estimation, the auxiliary feedback is also supported by the concept of stability region. The advantages of the proposed method are twofold: (1) it is straightforward to handle the problem both in analysis and design because of using Lyapunov method, (2) the estimation leads to less conservative results. A numerical example illustrates the feasibility of the proposed method.