Towards an Academic Social Network for Bologna Process

The Bologna Process aimed to build a European Higher Education Area promoting student's mobility. The adoption of Bologna Declaration directives requires a self management distributed approach to deal with student's mobility, allowing frequent updates in institutions rules or legislation. This paper suggests a computational system architecture, which follows a social network design. A set of structured annotations is proposed in order to organize the user's information. For instance, when the user is a student its annotations are organized into an academic record. The academic record data is used to discover interests, namely mobility interests, among students that belongs the academic network. These ideas have been applied into a demonstrator that includes a mobility simulator to compare and show the student's academic evolution.

Low Profile Multi-Band Antenna for Mobile Communications

In this paper, the design of low profile antennas by using Electromagnetic Band Gap (EBG) structures is introduced. Taking advantage of the fact that they can behave as Perfect Magnetic Conductor (PMC), it is shown that these structures exhibit dual band in-phase reflection at WLAN (Wireless Local Area Network) bands, the 2.4 GHz and 5.2 GHz bands. These structures are applied to PIFA (Planar Inverted-F Antenna) and the results show that it is possible to obtain low profile PIFA's.

A denoising approach for iterative side information creation in distributed video coding

In distributed video coding, motion estimation is typically performed at the decoder to generate the side information, increasing the decoder complexity while providing low complexity encoding in comparison with predictive video coding. Motion estimation can be performed once to create the side information or several times to refine the side information quality along the decoding process. In this paper, motion estimation is performed at the decoder side to generate multiple side information hypotheses which are adaptively and dynamically combined, whenever additional decoded information is available. The proposed iterative side information creation algorithm is inspired in video denoising filters and requires some statistics of the virtual channel between each side information hypothesis and the original data. With the proposed denoising algorithm for side information creation, a RD performance gain up to 1.2 dB is obtained for the same bitrate.

A model for heterogeneous networks management and Performance evaluation

In general, modern networks are analysed by taking several Key Performance Indicators (KPIs) into account, their proper balance being required in order to guarantee a desired Quality of Service (QoS), particularly, cellular wireless heterogeneous networks. A model to integrate a set of KPIs into a single one is presented, by using a Cost Function that includes these KPIs, providing for each network node a single evaluation parameter as output, and reflecting network conditions and common radio resource management strategies performance. The proposed model enables the implementation of different network management policies, by manipulating KPIs according to users' or operators' perspectives, allowing for a better QoS. Results show that different policies can in fact be established, with a different impact on the network, e.g., with median values ranging by a factor higher than two.

Academic social network in EHES

This paper presents the foundations of an Academic Social Network (ASN) focusing the Bologna Declaration and the Bologna Process (BP) mobility issues using ontological support. An ASN will permit students to share commons academic interests, preferences and mobility paths in the European Higher Education Space (EHES). The description of the conceptual support is ontology based allowing knowledge sharing and reuse. An approach is presented by merging Academic Ontology to Support the Bologna Mobility Process with Friend of a Friend ontology. The resulting ontology supports the student mobility profile in the ASN. The strategies to make available, in the network, knowledge about mobility issues, are presented including knowledge discovery and simulation approaches to cover student's mobility scenarios for BP.

Design and performance of a novel low-density parity-check code for distributed video coding

Low-density parity-check (LDPC) codes are nowadays one of the hottest topics in coding theory, notably due to their advantages in terms of bit error rate performance and low complexity. In order to exploit the potential of the Wyner-Ziv coding paradigm, practical distributed video coding (DVC) schemes should use powerful error correcting codes with near-capacity performance. In this paper, new ways to design LDPC codes for the DVC paradigm are proposed and studied. The new LDPC solutions rely on merging parity-check nodes, which corresponds to reduce the number of rows in the parity-check matrix. This allows to change gracefully the compression ratio of the source (DCT coefficient bitplane) according to the correlation between the original and the side information. The proposed LDPC codes reach a good performance for a wide range of source correlations and achieve a better RD performance when compared to the popular turbo codes.

Sequencing of a 9.9 kb segment on the right arm of yeast chromosome VII reveals four open reading frames, including PFK1, the gene coding for succinyl-CoA synthetase (beta-chain) and two ORFs sharing homology with ORFs of the yeast chromosome VIII

A 9.9 kb DNA fragment from the right arm of chromosome VII of Saccharomyces cerevisiae has been sequenced and analysed. The sequence contains four open reading frames (ORFs) longer than 100 amino acids. One gene, PFK1, has already been cloned and sequenced and the other one is the probable yeast gene coding for the beta-subunit of the succinyl-CoA synthetase. The two remaining ORFs share homology with the deduced amino acid sequence (and their physical arrangement is similar to that) of the YHR161c and YHR162w ORFs from chromosome VIII.

Fibras óticas de plástico em redes de acesso

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia de Eletrónica e Telecomunicações

Operação em ambiente móvel baseado em modelo de mercado

Projecto Final para obtenção do grau de Mestre em Engenharia Informática e de Computadores

Neural-network approach to modeling liquid crystals in complex confinement

Finding the structure of a confined liquid crystal is a difficult task since both the density and order parameter profiles are nonuniform. Starting from a microscopic model and density-functional theory, one has to either (i) solve a nonlinear, integral Euler-Lagrange equation, or (ii) perform a direct multidimensional free energy minimization. The traditional implementations of both approaches are computationally expensive and plagued with convergence problems. Here, as an alternative, we introduce an unsupervised variant of the multilayer perceptron (MLP) artificial neural network for minimizing the free energy of a fluid of hard nonspherical particles confined between planar substrates of variable penetrability. We then test our algorithm by comparing its results for the structure (density-orientation profiles) and equilibrium free energy with those obtained by standard iterative solution of the Euler-Lagrange equations and with Monte Carlo simulation results. Very good agreement is found and the MLP method proves competitively fast, flexible, and refinable. Furthermore, it can be readily generalized to the richer experimental patterned-substrate geometries that are now experimentally realizable but very problematic to conventional theoretical treatments.

A SON Enhanced Algorithm for Observed Time Differences Based Geolocation in Real 3G Networks

Conferência - 16th International Symposium on Wireless Personal Multimedia Communications (WPMC)- Jun 24-27, 2013

Influence of network effects on the diffusion of information systems: the case of open source

Doutoramento em Gestão

Avaliação do impacto energético resultante da utilização de repetidores em sistema LTE

Actualmente uma grande preocupação global refere-se ao continuo aumento do custo da energia, resultante da procura e do impacto ambiental. A escalada do custo da energia obriga a procura sistemática de melhores sistemas que permitam diminuir esse custo. Nas comunicações móveis sem fios a economia de energia obtida pelo aumento da eficiência do equipamento das estaçõesbase é insuficiente, pelo qual é necessário também encontrar soluções ao nível da arquitectura. O LTE define os repetidores como um recurso de baixo consumo para aumentar a cobertura e ou capacidade da rede. Nesta dissertação é avaliado um método de economia de energia baseado na substituição de uma estação-base central, circundada por outras estações-base, por um determinado número de repetidores. A cobertura e a capacidade resultante é avaliada assim como a energia poupada. Os resultados obtidos permitem verificar que se pode poupar até 1 000,00 € anuais e 20 kW diários com a substituição de uma estação-base, completamente rodeada por outras estações, por um número de repetidores compreendido entre 1 e 9 dependendo da ISD (até 1750 m). Verifica-se ainda um ganho de eficiência energética de até 13% ao nível do sistema.

Automatic tunning of Okumura-Hata model on railway communications

This paper presents the Genetic Algorithms (GA) as an efficient solution for the Okumura-Hata prediction model tuning on railways communications. A method for modelling the propagation model tuning parameters was presented. The algorithm tuning and validation were based on real networks measurements carried out on four different propagation scenarios and several performance indicators were used. It was shown that the proposed GA is able to produce significant improvements over the original model. The algorithm developed is currently been used on real GSM-R network planning process for an enhanced resources usage.

Coding mode decision algorithm for binary descriptor coding

In visual sensor networks, local feature descriptors can be computed at the sensing nodes, which work collaboratively on the data obtained to make an efficient visual analysis. In fact, with a minimal amount of computational effort, the detection and extraction of local features, such as binary descriptors, can provide a reliable and compact image representation. In this paper, it is proposed to extract and code binary descriptors to meet the energy and bandwidth constraints at each sensing node. The major contribution is a binary descriptor coding technique that exploits the correlation using two different coding modes: Intra, which exploits the correlation between the elements that compose a descriptor; and Inter, which exploits the correlation between descriptors of the same image. The experimental results show bitrate savings up to 35% without any impact in the performance efficiency of the image retrieval task. © 2014 EURASIP.