Uniform G-Convexity for Vector-Valued Lp Spaces

2000 Mathematics Subject Classification: 46B20.

ON SPACES OF COMPACT OPERATORS ON C(K, X) SPACES

This paper concerns the spaces of compact operators kappa(E,F), where E and F are Banach spaces C([1, xi], X) of all continuous X-valued functions defined on the interval of ordinals [1, xi] and equipped with the supremun norm. We provide sufficient conditions on X, Y, alpha, beta, xi and eta, with omega <= alpha <= beta < omega 1 for the following equivalence: (a) kappa(C([1, xi], X), C([1, alpha], Y)) is isomorphic to kappa(C([1,eta], X), C([1, beta], Y)), (b) beta < alpha(omega). In this way, we unify and extend results due to Bessaga and Pelczynski (1960) and C. Samuel (2009). Our result covers the case of the classical spaces X = l(p) and Y = l(q) with 1 < p, q < infinity.

On state representations of nonlinear implicit systems

This work considers a semi-implicit system A, that is, a pair (S, y), where S is an explicit system described by a state representation (x)over dot(t) = f(t, x(t), u(t)), where x(t) is an element of R(n) and u(t) is an element of R(m), which is subject to a set of algebraic constraints y(t) = h(t, x(t), u(t)) = 0, where y(t) is an element of R(l). An input candidate is a set of functions v = (v(1),.... v(s)), which may depend on time t, on x, and on u and its derivatives up to a Finite order. The problem of finding a (local) proper state representation (z)over dot = g(t, z, v) with input v for the implicit system Delta is studied in this article. The main result shows necessary and sufficient conditions for the solution of this problem, under mild assumptions on the class of admissible state representations of Delta. These solvability conditions rely on an integrability test that is computed from the explicit system S. The approach of this article is the infinite-dimensional differential geometric setting of Fliess, Levine, Martin, and Rouchon (1999) (`A Lie-Backlund Approach to Equivalence and Flatness of Nonlinear Systems`, IEEE Transactions on Automatic Control, 44(5), (922-937)).

On state representations of time-varying nonlinear systems

This work considers a nonlinear time-varying system described by a state representation, with input u and state x. A given set of functions v, which is not necessarily the original input u of the system, is the (new) input candidate. The main result provides necessary and sufficient conditions for the existence of a local classical state space representation with input v. These conditions rely on integrability tests that are based on a derived flag. As a byproduct, one obtains a sufficient condition of differential flatness of nonlinear systems. (C) 2009 Elsevier Ltd. All rights reserved.

Branching processes and computational collapse of discretized unimodal mappings

In computer simulations of smooth dynamical systems, the original phase space is replaced by machine arithmetic, which is a finite set. The resulting spatially discretized dynamical systems do not inherit all functional properties of the original systems, such as surjectivity and existence of absolutely continuous invariant measures. This can lead to computational collapse to fixed points or short cycles. The paper studies loss of such properties in spatial discretizations of dynamical systems induced by unimodal mappings of the unit interval. The problem reduces to studying set-valued negative semitrajectories of the discretized system. As the grid is refined, the asymptotic behavior of the cardinality structure of the semitrajectories follows probabilistic laws corresponding to a branching process. The transition probabilities of this process are explicitly calculated. These results are illustrated by the example of the discretized logistic mapping.

Non-compact generalized variational inequalities for quasi-monotone and hemi-continuous operators with applications

Some results are obtained for non-compact cases in topological vector spaces for the existence problem of solutions for some set-valued variational inequalities with quasi-monotone and lower hemi-continuous operators, and with quasi-semi-monotone and upper hemi-continuous operators. Some applications are given in non-reflexive Banach spaces for these existence problems of solutions and for perturbation problems for these set-valued variational inequalities with quasi-monotone and quasi-semi-monotone operators.

Planeamento e optimização em redes celulares móveis auto-geridas assentes em LTE

O objectivo deste trabalho consiste em avaliar os benefícios das Self Organizing Networks (SON), no que concerne ao planeamento e optimização de redes Long Term Evolution (LTE), não só através do seu estudo, como também através do desenvolvimento e teste de algoritmos, que permitem avaliar o funcionamento de algumas das suas principais funções. O estudo efectuado sobre as SON permitiu identificar um conjunto de funções, tais como a atribuição automática de Physical Cell Id (PCI), o Automatic Neighbour Relation (ANR) e a optimização automática de parâmetros de handover, que permitem facilitar ou mesmo substituir algumas das tarefas mais comuns em planeamento e optimização de redes móveis celulares, em particular, redes LTE. Recorrendo a um simulador LTE destinado à investigação académica, em código aberto e desenvolvido em Matlab®, foi desenvolvido um conjunto de algoritmos que permitiram a implementação das funções em questão. Para além das funções implementadas, foram também introduzidas alterações que conferem a este simulador a capacidade de representar e simular redes reais, permitindo uma análise mais coerente dos algoritmos desenvolvidos. Os resultados obtidos, para além de evidenciarem claramente o benefício dos algoritmos desenvolvidos, foram ainda comparados com os obtidos pela ferramenta profissional de planeamento e optimização Atoll®, tendo-se verificado a franca proximidade de desempenho em algumas das funções. Finalmente, foi desenvolvida uma interface gráfica que permite o desenho, configuração e simulação de cenários, bem como a análise de resultados.

Consultoria de gestão operacional e gestão da formação

Relatório de estágio apresentado ao Instituto de Contabilidade e Administração do Porto para a obtenção do título de Mestre em Auditoria Orientada por Dr. Rodrigo Carvalho Coorientador: Dr. José Rui Dias

An R package for the integrated analysis of metabolomics and spectral data

Recently, there has been a growing interest in the field of metabolomics, materialized by a remarkable growth in experimental techniques, available data and related biological applications. Indeed, techniques as Nuclear Magnetic Resonance, Gas or Liquid Chromatography, Mass Spectrometry, Infrared and UV-visible spectroscopies have provided extensive datasets that can help in tasks as biological and biomedical discovery, biotechnology and drug development. However, as it happens with other omics data, the analysis of metabolomics datasets provides multiple challenges, both in terms of methodologies and in the development of appropriate computational tools. Indeed, from the available software tools, none addresses the multiplicity of existing techniques and data analysis tasks. In this work, we make available a novel R package, named specmine, which provides a set of methods for metabolomics data analysis, including data loading in different formats, pre-processing, metabolite identification, univariate and multivariate data analysis, machine learning, and feature selection. Importantly, the implemented methods provide adequate support for the analysis of data from diverse experimental techniques, integrating a large set of functions from several R packages in a powerful, yet simple to use environment. The package, already available in CRAN, is accompanied by a web site where users can deposit datasets, scripts and analysis reports to be shared with the community, promoting the efficient sharing of metabolomics data analysis pipelines.

Codis no lineals en Magma: noves construccions

L'objectiu principal d'aquest projecte és ampliar la llibreria BinaryCodes, iniciada al 2007, que ens permet construir i manipular codis binaris lineals i no lineals. Per aquest motiu, s'han desenvolupat una sèrie de funcions, amb els seus corresponents tests i exemples, en l'entorn de programació matemàtica Magma. Aquestes funcions consisteixen bàsicament en la construcció de nous codis a partir d'altres ja existents.

Incidència, mortalitat i supervivència per càncer a Catalunya 2007

Projecte de recerca elaborat a partir d’una estada a la Universitat de Bonn, Alemanya, entre agost i desembre del 2008. Recentement, arran de la creació del Registre de Càncer de Catalunya, s'ha el.laborat un nou "estat de la qüestió" del càncer a Catalunya, que ha permès obtenir una imatge complerta de la incidència, mortalitat i supervivència del càncer a Catalunya, a partir de les dades obtingudes pels registres poblacionals del càncer de Girona i Tarragona pel que fa a la incidència del càncer, i pel registre de Mortalitat de Catalunya, pel que fa a la mortalitat per càncer. El projecte realitzat ha tingut dos objectius principals. En primer lloc, desenvolupar un conjunt integrat de funcions per al càlcul automatitzat de la incidència, mortalitat i supervivència, així com l'ajust dels models estadístics que permeten avaluar les tendències i obtenir les projeccions del càncer pels anys futurs. En segon lloc, s'han aplicat les funcions a les dades disponibles i s'han obtingut els resultats a Catalunya, que inclou les projeccions de la incìdència i mortalitat per càncer a Catalunya fins a l'any 2020. Tos dos objectius han estat substancialment assolits. Pel que fa al primer, s'ha desenvolupat un fitxer font en R que conté les macros i funcions utilitzades. Pel que fa al segon, les anàlisis realitzades han estat emprades per a la realització d'una monografia sobre el càncer a Catalunya, que actualment està acceptada per la seva publicació. Els resultats mostren que la incidència per càncer ha augmentat i està previst que així continuï, tot i que es preveu un esmoertiment de l'augment pels homes. Pel que fa a la mortalitat s'observa un recent decrement que es preveu que es mantingui en el futur, essent aquest major pels homes respecte les dones.

Cross-species and cross-platform gene expression studies with the Bioconductor-compliant R package 'annotationTools'.

Background: The variety of DNA microarray formats and datasets presently available offers an unprecedented opportunity to perform insightful comparisons of heterogeneous data. Cross-species studies, in particular, have the power of identifying conserved, functionally important molecular processes. Validation of discoveries can now often be performed in readily available public data which frequently requires cross-platform studies.Cross-platform and cross-species analyses require matching probes on different microarray formats. This can be achieved using the information in microarray annotations and additional molecular biology databases, such as orthology databases. Although annotations and other biological information are stored using modern database models ( e. g. relational), they are very often distributed and shared as tables in text files, i.e. flat file databases. This common flat database format thus provides a simple and robust solution to flexibly integrate various sources of information and a basis for the combined analysis of heterogeneous gene expression profiles.Results: We provide annotationTools, a Bioconductor-compliant R package to annotate microarray experiments and integrate heterogeneous gene expression profiles using annotation and other molecular biology information available as flat file databases. First, annotationTools contains a specialized set of functions for mining this widely used database format in a systematic manner. It thus offers a straightforward solution for annotating microarray experiments. Second, building on these basic functions and relying on the combination of information from several databases, it provides tools to easily perform cross-species analyses of gene expression data.Here, we present two example applications of annotationTools that are of direct relevance for the analysis of heterogeneous gene expression profiles, namely a cross-platform mapping of probes and a cross-species mapping of orthologous probes using different orthology databases. We also show how to perform an explorative comparison of disease-related transcriptional changes in human patients and in a genetic mouse model.Conclusion: The R package annotationTools provides a simple solution to handle microarray annotation and orthology tables, as well as other flat molecular biology databases. Thereby, it allows easy integration and analysis of heterogeneous microarray experiments across different technological platforms or species.

Sequential estimation of multipath MIMO-OFDM channels

Wireless “MIMO” systems, employing multiple transmit and receive antennas, promise a significant increase of channel capacity, while orthogonal frequency-division multiplexing (OFDM) is attracting a good deal of attention due to its robustness to multipath fading. Thus, the combination of both techniques is an attractive proposition for radio transmission. The goal of this paper is the description and analysis of a new and novel pilot-aided estimator of multipath block-fading channels. Typical models leading to estimation algorithms assume the number of multipath components and delays to be constant (and often known), while their amplitudes are allowed to vary with time. Our estimator is focused instead on the more realistic assumption that the number of channel taps is also unknown and varies with time following a known probabilistic model. The estimation problem arising from these assumptions is solved using Random-Set Theory (RST), whereby one regards the multipath-channel response as a single set-valued random entity.Within this framework, Bayesian recursive equations determine the evolution with time of the channel estimator. Due to the lack of a closed form for the solution of Bayesian equations, a (Rao–Blackwellized) particle filter (RBPF) implementation ofthe channel estimator is advocated. Since the resulting estimator exhibits a complexity which grows exponentially with the number of multipath components, a simplified version is also introduced. Simulation results describing the performance of our channel estimator demonstrate its effectiveness.

Sovellusintegraation toteutus pk-yrityksen projektijärjestelmiin

Tässä diplomityössä käydään läpi lähestymistapoja sovellusintegraatioon ja niiden käyttöä yritysmaailmassa. Sovellusintegraatiolla tarkoitetaan prosessia jolla yhdistetään toimintoja tai tietoa kahdesta tai useammasta sovelluksesta ja luodaan yhtenäinen kokonaisuus toiminnallisuuksia tai tietoa. Sovellusintegraation toteuttamiseksi on olemassa erilaisia lähestymistapoja ja menetelmiä. Näillä prosesseilla pyritään linkittämään kaksi tai useampia sovelluksia toisiinsa. Sovellusintegraation avulla saadaan jo olemassa olevista järjestelmistä tietoa, pystytään hyödyntämään elektronista kaupankäyntiä, saadaan integroituja toimitusketjuja, ja saadaan jaettua tarpeelliset prosessit. Sovellusintegraatio on strateginen lähestymistapa monen tietojärjestelmän yhteensitomiseksi. Tietojen vaihto ja reaaliaikainen toiminta on tärkeää. Sovellusintegraation tuloksena käytettävissä oleva informaatio ja prosessit sisäisten- ja ulkoisten systeemien välillä tuottavat selkeää strategista etua. Työssä toteutettiin kohdeyritykselle järjestelmä jonka avulla voidaan siirtää työtunnit projektinhallintajärjestelmästä taloushallinnon järjestelmään.

Building Successful, Open Repository Software Ecosystems: Technology and Community

Panel at Open Repositories 2014, Helsinki, Finland, June 9-13, 2014