A utilização de smartphones numa experiência turística em Portugal : estudo sobre a participação nos media sociais através de aplicações para dispositivos móveis

O turismo é uma das maiores indústrias do mundo que gera receitas muito elevadas, sendo uma das principais áreas de atividade económica num número alargado de países e, por isso, torna-se essencial prestar um serviço eficiente e eficaz aproveitando, sempre que possível, as soluções e tendências tecnológicas disponíveis. A utilização dos media sociais através dos smartphones numa experiência turística vai acrescentar valor não só às viagens dos utilizadores como também ao turismo em si, pois há uma troca de experiências e opiniões entre todos os intervenientes. A presente investigação tem por objetivo geral identificar as atividades participativas realizadas por portugueses nos media sociais em smartphones nas diversas fases de uma experiência turística em Portugal, ou seja, no antes, no durante e no depois da mesma. Como hipóteses de investigação admite-se que as atividades realizadas em media sociais, o tipo de media publicado e partilhado da autoria do próprio utilizador e da autoria de terceiros e as aplicações utilizadas em smartphones diferem consoante a fase da experiência turística em que o utilizador se encontra. Assim, tornou-se essencial questionar sobre quais as atividades que são realizadas por portugueses a nível de partilha de informação através de smartphones numa experiência turística em Portugal. Apresenta-se uma análise e reflexão crítica sobre a importância da utilização dos media sociais em smartphones numa experiência turística. Primeiro procedendo-se a uma revisão do estado da arte sobre a problemática da investigação tendo como base os conceitos chave definidos anteriormente, para posteriormente fazer o estudo não só de aplicações portuguesas gratuitas para smartphones que utilizam o sistema operativo Android e que de alguma forma acrescentam valor a uma experiência turística de um utilizador, através de uma grelha de observação, mas, também, o estudo da utilização dos media sociais em smartphones numa experiência turística em Portugal, através de um inquérito por questionário. Um dos objetivos desta investigação é contribuir para o estudo e compreensão das dinâmicas de interação, a nível da partilha de informação, que os utilizadores mais recorrem nas diferentes fases de uma experiência turística e obter indicações, que se esperam úteis, sobre boas práticas e estratégias que podem ser adotadas por entidades turísticas com o objetivo de incluir os media sociais nas suas atividades de marketing e comunicação.

Cooperative positioning for heterogeneous wireless systems

Future emerging market trends head towards positioning based services placing a new perspective on the way we obtain and exploit positioning information. On one hand, innovations in information technology and wireless communication systems enabled the development of numerous location based applications such as vehicle navigation and tracking, sensor networks applications, home automation, asset management, security and context aware location services. On the other hand, wireless networks themselves may bene t from localization information to improve the performances of di erent network layers. Location based routing, synchronization, interference cancellation are prime examples of applications where location information can be useful. Typical positioning solutions rely on measurements and exploitation of distance dependent signal metrics, such as the received signal strength, time of arrival or angle of arrival. They are cheaper and easier to implement than the dedicated positioning systems based on ngerprinting, but at the cost of accuracy. Therefore intelligent localization algorithms and signal processing techniques have to be applied to mitigate the lack of accuracy in distance estimates. Cooperation between nodes is used in cases where conventional positioning techniques do not perform well due to lack of existing infrastructure, or obstructed indoor environment. The objective is to concentrate on hybrid architecture where some nodes have points of attachment to an infrastructure, and simultaneously are interconnected via short-range ad hoc links. The availability of more capable handsets enables more innovative scenarios that take advantage of multiple radio access networks as well as peer-to-peer links for positioning. Link selection is used to optimize the tradeo between the power consumption of participating nodes and the quality of target localization. The Geometric Dilution of Precision and the Cramer-Rao Lower Bound can be used as criteria for choosing the appropriate set of anchor nodes and corresponding measurements before attempting location estimation itself. This work analyzes the existing solutions for node selection in order to improve localization performance, and proposes a novel method based on utility functions. The proposed method is then extended to mobile and heterogeneous environments. Simulations have been carried out, as well as evaluation with real measurement data. In addition, some speci c cases have been considered, such as localization in ill-conditioned scenarios and the use of negative information. The proposed approaches have shown to enhance estimation accuracy, whilst signi cantly reducing complexity, power consumption and signalling overhead.

Mining biomedical information from scientific literature

The rapid evolution and proliferation of a world-wide computerized network, the Internet, resulted in an overwhelming and constantly growing amount of publicly available data and information, a fact that was also verified in biomedicine. However, the lack of structure of textual data inhibits its direct processing by computational solutions. Information extraction is the task of text mining that intends to automatically collect information from unstructured text data sources. The goal of the work described in this thesis was to build innovative solutions for biomedical information extraction from scientific literature, through the development of simple software artifacts for developers and biocurators, delivering more accurate, usable and faster results. We started by tackling named entity recognition - a crucial initial task - with the development of Gimli, a machine-learning-based solution that follows an incremental approach to optimize extracted linguistic characteristics for each concept type. Afterwards, Totum was built to harmonize concept names provided by heterogeneous systems, delivering a robust solution with improved performance results. Such approach takes advantage of heterogenous corpora to deliver cross-corpus harmonization that is not constrained to specific characteristics. Since previous solutions do not provide links to knowledge bases, Neji was built to streamline the development of complex and custom solutions for biomedical concept name recognition and normalization. This was achieved through a modular and flexible framework focused on speed and performance, integrating a large amount of processing modules optimized for the biomedical domain. To offer on-demand heterogenous biomedical concept identification, we developed BeCAS, a web application, service and widget. We also tackled relation mining by developing TrigNER, a machine-learning-based solution for biomedical event trigger recognition, which applies an automatic algorithm to obtain the best linguistic features and model parameters for each event type. Finally, in order to assist biocurators, Egas was developed to support rapid, interactive and real-time collaborative curation of biomedical documents, through manual and automatic in-line annotation of concepts and relations. Overall, the research work presented in this thesis contributed to a more accurate update of current biomedical knowledge bases, towards improved hypothesis generation and knowledge discovery.

Majorantes para a ordem de subgrafos induzidos k-regulares

Muitos dos problemas de otimização em grafos reduzem-se à determinação de um subconjunto de vértices de cardinalidade máxima que induza um subgrafo k-regular. Uma vez que a determinação da ordem de um subgrafo induzido k-regular de maior ordem é, em geral, um problema NP-difícil, são deduzidos novos majorantes, a determinar em tempo polinomial, que em muitos casos constituam boas aproximações das respetivas soluções ótimas. Introduzem-se majorantes espetrais usando uma abordagem baseada em técnicas de programação convexa e estabelecem-se condições necessárias e suficientes para que sejam atingidos. Adicionalmente, introduzem-se majorantes baseados no espetro das matrizes de adjacência, laplaciana e laplaciana sem sinal. É ainda apresentado um algoritmo não polinomial para a determinação de umsubconjunto de vértices de umgrafo que induz umsubgrafo k-regular de ordem máxima para uma classe particular de grafos. Finalmente, faz-se um estudo computacional comparativo com vários majorantes e apresentam-se algumas conclusões.

Polyhedral study of mixed integer sets arising from inventory problems

“Branch-and-cut” algorithm is one of the most efficient exact approaches to solve mixed integer programs. This algorithm combines the advantages of a pure branch-and-bound approach and cutting planes scheme. Branch-and-cut algorithm computes the linear programming relaxation of the problem at each node of the search tree which is improved by the use of cuts, i.e. by the inclusion of valid inequalities. It should be taken into account that selection of strongest cuts is crucial for their effective use in branch-and-cut algorithm. In this thesis, we focus on the derivation and use of cutting planes to solve general mixed integer problems, and in particular inventory problems combined with other problems such as distribution, supplier selection, vehicle routing, etc. In order to achieve this goal, we first consider substructures (relaxations) of such problems which are obtained by the coherent loss of information. The polyhedral structure of those simpler mixed integer sets is studied to derive strong valid inequalities. Finally those strong inequalities are included in the cutting plane algorithms to solve the general mixed integer problems. We study three mixed integer sets in this dissertation. The first two mixed integer sets arise as a subproblem of the lot-sizing with supplier selection, the network design and the vendor-managed inventory routing problems. These sets are variants of the well-known single node fixed-charge network set where a binary or integer variable is associated with the node. The third set occurs as a subproblem of mixed integer sets where incompatibility between binary variables is considered. We generate families of valid inequalities for those sets, identify classes of facet-defining inequalities, and discuss the separation problems associated with the inequalities. Then cutting plane frameworks are implemented to solve some mixed integer programs. Preliminary computational experiments are presented in this direction.

All-optical routing functionalities

All-optical solutions for switching and routing packet-based traffic are crucial for realizing a truly transparent network. To meet the increasing requirements for higher bandwidth, such optical packet switched networks may require the implementation of digital functions in the physical layer. This scenario stimulated us to research and develop innovative high-speed all-optical storage memories, focusing mainly on bistables whose state switching is triggered by a pulsed clock signal. In clocked devices, a synchronization signal is responsible for controlling the enabling of the bistable. This thesis also presents novel solutions to implement optical logic gates, which are basic building blocks of any processing system and a fundamental element for the development of complex processing functionalities. Most of the proposed schemes developed in this work are based on SOA-MZI structures due to their inherent characteristics such as, high extinction ratio, high operation speed, high integration capability and compactness. We addressed the experimental implementation of an all-optical packet routing scheme, with contention resolution capability, using interconnected SOAMZIs. The impact on the system performance of the reminiscent power of the blocked packets, from the non ideal switching performed by the SOA-MZIs, was also assessed.

On the application of optimal control techniques in lossy fieldbuses

The performance of real-time networks is under continuous improvement as a result of several trends in the digital world. However, these tendencies not only cause improvements, but also exacerbates a series of unideal aspects of real-time networks such as communication latency, jitter of the latency and packet drop rate. This Thesis focuses on the communication errors that appear on such realtime networks, from the point-of-view of automatic control. Specifically, it investigates the effects of packet drops in automatic control over fieldbuses, as well as the architectures and optimal techniques for their compensation. Firstly, a new approach to address the problems that rise in virtue of such packet drops, is proposed. This novel approach is based on the simultaneous transmission of several values in a single message. Such messages can be from sensor to controller, in which case they are comprised of several past sensor readings, or from controller to actuator in which case they are comprised of estimates of several future control values. A series of tests reveal the advantages of this approach. The above-explained approach is then expanded as to accommodate the techniques of contemporary optimal control. However, unlike the aforementioned approach, that deliberately does not send certain messages in order to make a more efficient use of network resources; in the second case, the techniques are used to reduce the effects of packet losses. After these two approaches that are based on data aggregation, it is also studied the optimal control in packet dropping fieldbuses, using generalized actuator output functions. This study ends with the development of a new optimal controller, as well as the function, among the generalized functions that dictate the actuator’s behaviour in the absence of a new control message, that leads to the optimal performance. The Thesis also presents a different line of research, related with the output oscillations that take place as a consequence of the use of classic co-design techniques of networked control. The proposed algorithm has the goal of allowing the execution of such classical co-design algorithms without causing an output oscillation that increases the value of the cost function. Such increases may, under certain circumstances, negate the advantages of the application of the classical co-design techniques. A yet another line of research, investigated algorithms, more efficient than contemporary ones, to generate task execution sequences that guarantee that at least a given number of activated jobs will be executed out of every set composed by a predetermined number of contiguous activations. This algorithm may, in the future, be applied to the generation of message transmission patterns in the above-mentioned techniques for the efficient use of network resources. The proposed task generation algorithm is better than its predecessors in the sense that it is capable of scheduling systems that cannot be scheduled by its predecessor algorithms. The Thesis also presents a mechanism that allows to perform multi-path routing in wireless sensor networks, while ensuring that no value will be counted in duplicate. Thereby, this technique improves the performance of wireless sensor networks, rendering them more suitable for control applications. As mentioned before, this Thesis is centered around techniques for the improvement of performance of distributed control systems in which several elements are connected through a fieldbus that may be subject to packet drops. The first three approaches are directly related to this topic, with the first two approaching the problem from an architectural standpoint, whereas the third one does so from more theoretical grounds. The fourth approach ensures that the approaches to this and similar problems that can be found in the literature that try to achieve goals similar to objectives of this Thesis, can do so without causing other problems that may invalidate the solutions in question. Then, the thesis presents an approach to the problem dealt with in it, which is centered in the efficient generation of the transmission patterns that are used in the aforementioned approaches.

Multiplicity results for some classes of Schrödinger-Poisson systems

In this thesis, we study the existence and multiplicity of solutions of the following class of Schr odinger-Poisson systems: u + u + l(x) u = (x; u) in R3; = l(x)u2 in R3; where l 2 L2(R3) or l 2 L1(R3). And we consider that the nonlinearity satis es the following three kinds of cases: (i) a subcritical exponent with (x; u) = k(x)jujp 2u + h(x)u (4 p < 2 ) under an inde nite case; (ii) a general inde nite nonlinearity with (x; u) = k(x)g(u) + h(x)u; (iii) a critical growth exponent with (x; u) = k(x)juj2 2u + h(x)jujq 2u (2 q < 2 ). It is worth mentioning that the thesis contains three main innovations except overcoming several di culties, which are generated by the systems themselves. First, as an unknown referee said in his report, we are the rst authors concerning the existence of multiple positive solutions for Schr odinger- Poisson systems with an inde nite nonlinearity. Second, we nd an interesting phenomenon in Chapter 2 and Chapter 3 that we do not need the condition R R3 k(x)ep 1dx < 0 with an inde nite noncoercive case, where e1 is the rst eigenfunction of +id in H1(R3) with weight function h. A similar condition has been shown to be a su cient and necessary condition to the existence of positive solutions for semilinear elliptic equations with inde nite nonlinearity for a bounded domain (see e.g. Alama-Tarantello, Calc. Var. PDE 1 (1993), 439{475), or to be a su cient condition to the existence of positive solutions for semilinear elliptic equations with inde nite nonlinearity in RN (see e.g. Costa-Tehrani, Calc. Var. PDE 13 (2001), 159{189). Moreover, the process used in this case can be applied to study other aspects of the Schr odinger-Poisson systems and it gives a way to study the Kirchho system and quasilinear Schr odinger system. Finally, to get sign changing solutions in Chapter 5, we follow the spirit of Hirano-Shioji, Proc. Roy. Soc. Edinburgh Sect. A 137 (2007), 333, but the procedure is simpler than that they have proposed in their paper.

Novos materiais com polioxotungstatos substituídos com metais d e f

The present work reports studies on the new compounds obtained by the combination of polyoxoanions derived from the Keggin and Lindquist structures with several cations. The studies were first focused on the monolacunary Keggin polyoxoanions [PW11O39M(H2O)]n- (M = FeIII, MnIII and n = 4; M = CoII and n = 5) and its combination with the organic cation 1-butyl-3-methylimidazolium (Bmim+). The association of Bmim+ cation with the polyoxoanion [PW11O39Fe(H2O)]4- allowed to isolate for the first time both the monomeric and the dimeric [PW11O39Fe)2O]10- anions, with the same cation and using simple bench techniques by pH manipulation. Studies regarding the stability of these inorganic species in solution indicated that both species are present in solution in equilibrium. However, the inability to up until now isolate the dimeric unit through simple bench methods, lead to the hypothesis that the cation had a role to play in the selective precipitation of either the monomer or the dimer. Repetition of the same procedures with the polyoxoanions [SiW11O39Fe(H2O)]5- and [PW11O39M(H2O)]n- (M = FeIII, MnIII and n = 4; M = Co and n = 5), afforded only the corresponding monomeric compounds, (Bmim)5[SiW11O39FeIII(H2O)]· 4H2O (3), (Bmim)5[PW11O39CoII(H2O)]· 0.5 H2O, (4) and (Bmim)5[PW11O39MnIII(H2O)]· 0.5 H2O (5). Moreover, the combination of Bmim+ and the polyoxotungstate [PW11O39Co(H2O)]5- afforded two different crystal structures, depending on the synthetic conditions. Thus, a ratio Bmim+:POM of 5:1 and the presence of K+ cations (due to addition of KOH) led to a formula Na2K(Bmim)2[PW11.2O39Co0.8(H2O)]·7H2O (4a), whilst a ratio Bmim:POM of 7:1 led to the formation of a crystal with the chemical formula Na2(Bmim)8[PW11O39Co(H2O)]2·3H2O (4b). Electrochemical studies were performed with carbon paste electrodes modified with BmimCl to investigate the influence of the Bmim+ cation in the performance of the electrodes. The voltametric measurements obtained from solutions containing the anions [PW11O39]7- and [SiW11O39]8- are presented. Results pointed to an improvement of the acquired voltametric signal with a slight addition of BmimCl (up to 2.5% w/w), specially in the studies regarding pH variation. Additional synthesis were carried out with both the cations Omim+ and THTP+.

Para uma interpretação na guitarra das sonatas BMW 1001/1003/1005 de Bach inspirada numa memorabília das práticas interpretativas

O presente trabalho procura compreender as abordagens interpretativas desenvolvidas na guitarra das sonatas para violino BWV 1001, 1003 e 1005 de Bach e apresenta uma proposta de interpretação inspirada no autógrafo original. Sistematiza características de transcrições e gravações das obras no instrumento, e considera as respectivas inferências interpretativas. Face ao significativo número de autores e intérpretes que, adaptando o texto de Bach, privilegiam a faceta harmónica da guitarra e desvalorizam o uso de recursos expressivos da prática interpretativa barroca implícitos e explícitos na notação, problematiza os desafios colocados a uma interpretação num instrumento harmónico que mantém o texto escrito para um outro predominantemente melódico, e faz da articulação o seu centro, facultando propostas de realização. O texto de Bach para violino, as práticas barrocas e o legado dos discursos interpretativos sobre as obras integram o repositório de memórias que inspiraram e fundamentaram a criação de uma interpretação. Nela se tomam opções estéticas e encontram as respectivas soluções de realização técnica na sequência da procura de novos caminhos interpretativos, através da recuperação de alguns aspectos que teriam tido expressão numa imaginária interpretação oitocentista – criando uma outra memória.

Novel hardware and software combination for automotive motorsport vehicles based on direct processing of graphical functions

The main motivation for the work presented here began with previously conducted experiments with a programming concept at the time named "Macro". These experiments led to the conviction that it would be possible to build a system of engine control from scratch, which could eliminate many of the current problems of engine management systems in a direct and intrinsic way. It was also hoped that it would minimize the full range of software and hardware needed to make a final and fully functional system. Initially, this paper proposes to make a comprehensive survey of the state of the art in the specific area of software and corresponding hardware of automotive tools and automotive ECUs. Problems arising from such software will be identified, and it will be clear that practically all of these problems stem directly or indirectly from the fact that we continue to make comprehensive use of extremely long and complex "tool chains". Similarly, in the hardware, it will be argued that the problems stem from the extreme complexity and inter-dependency inside processor architectures. The conclusions are presented through an extensive list of "pitfalls" which will be thoroughly enumerated, identified and characterized. Solutions will also be proposed for the various current issues and for the implementation of these same solutions. All this final work will be part of a "proof-of-concept" system called "ECU2010". The central element of this system is the before mentioned "Macro" concept, which is an graphical block representing one of many operations required in a automotive system having arithmetic, logic, filtering, integration, multiplexing functions among others. The end result of the proposed work is a single tool, fully integrated, enabling the development and management of the entire system in one simple visual interface. Part of the presented result relies on a hardware platform fully adapted to the software, as well as enabling high flexibility and scalability in addition to using exactly the same technology for ECU, data logger and peripherals alike. Current systems rely on a mostly evolutionary path, only allowing online calibration of parameters, but never the online alteration of their own automotive functionality algorithms. By contrast, the system developed and described in this thesis had the advantage of following a "clean-slate" approach, whereby everything could be rethought globally. In the end, out of all the system characteristics, "LIVE-Prototyping" is the most relevant feature, allowing the adjustment of automotive algorithms (eg. Injection, ignition, lambda control, etc.) 100% online, keeping the engine constantly working, without ever having to stop or reboot to make such changes. This consequently eliminates any "turnaround delay" typically present in current automotive systems, thereby enhancing the efficiency and handling of such systems.

O problema da árvore de suporte de custo mínimo com restrições de peso

Nesta tese abordam-se várias formulações e diferentes métodos para resolver o Problema da Árvore de Suporte de Custo Mínimo com Restrições de Peso (WMST – Weight-constrained Minimum Spanning Tree Problem). Este problema, com aplicações no desenho de redes de comunicações e telecomunicações, é um problema de Otimização Combinatória NP-difícil. O Problema WMST consiste em determinar, numa rede com custos e pesos associados às arestas, uma árvore de suporte de custo mínimo de tal forma que o seu peso total não exceda um dado limite especificado. Apresentam-se e comparam-se várias formulações para o problema. Uma delas é usada para desenvolver um procedimento com introdução de cortes baseado em separação e que se tornou bastante útil na obtenção de soluções para o problema. Tendo como propósito fortalecer as formulações apresentadas, introduzem-se novas classes de desigualdades válidas que foram adaptadas das conhecidas desigualdades de cobertura, desigualdades de cobertura estendida e desigualdades de cobertura levantada. As novas desigualdades incorporam a informação de dois conjuntos de soluções: o conjunto das árvores de suporte e o conjunto saco-mochila. Apresentam-se diversos algoritmos heurísticos de separação que nos permitem usar as desigualdades válidas propostas de forma eficiente. Com base na decomposição Lagrangeana, apresentam-se e comparam-se algoritmos simples, mas eficientes, que podem ser usados para calcular limites inferiores e superiores para o valor ótimo do WMST. Entre eles encontram-se dois novos algoritmos: um baseado na convexidade da função Lagrangeana e outro que faz uso da inclusão de desigualdades válidas. Com o objetivo de obter soluções aproximadas para o Problema WMST usam-se métodos heurísticos para encontrar uma solução inteira admissível. Os métodos heurísticos apresentados são baseados nas estratégias Feasibility Pump e Local Branching. Apresentam-se resultados computacionais usando todos os métodos apresentados. Os resultados mostram que os diferentes métodos apresentados são bastante eficientes para encontrar soluções para o Problema WMST.

Treatment of aqueous effluents contaminated with ionic liquids

Ionic liquids are a class of solvents that, due to their unique properties, have been proposed in the past few years as alternatives to some hazardous volatile organic compounds. They are already used by industry, where it was possible to improve different processes by the incorporation of this kind of non-volatile and often liquid solvents. However, even if ionic liquids cannot contribute to air pollution, due to their negligible vapour pressures, they can be dispersed thorough aquatic streams thus contaminating the environment. Therefore, the main goals of this work are to study the mutual solubilities between water and different ionic liquids in order to infer on their environmental impact, and to propose effective methods to remove and, whenever possible, recover ionic liquids from aqueous media. The liquid-liquid phase behaviour of different ionic liquids and water was evaluated in the temperature range between (288.15 and 318.15) K. For higher melting temperature ionic liquids a narrower temperature range was studied. The gathered data allowed a deep understanding on the structural effects of the ionic liquid, namely the cation core, isomerism, symmetry, cation alkyl chain length and the anion nature through their mutual solubilities (saturation values) with water. The experimental data were also supported by the COnductor-like Screening MOdel for Real Solvents (COSMO-RS), and for some more specific systems, molecular dynamics simulations were also employed for a better comprehension of these systems at a molecular level. On the other hand, in order to remove and recover ionic liquids from aqueous solutions, two different methods were studied: one based on aqueous biphasic systems, that allowed an almost complete recovery of hydrophilic ionic liquids (those completely miscible with water at temperatures close to room temperature) by the addition of strong salting-out agents (Al2(SO4)3 or AlK(SO4)2); and the other based on the adsorption of several ionic liquids onto commercial activated carbon. The first approach, in addition to allowing the removal of ionic liquids from aqueous solutions, also makes possible to recover the ionic liquid and to recycle the remaining solution. In the adsorption process, only the removal of the ionic liquid from aqueous solutions was attempted. Nevertheless, a broad understanding of the structural effects of the ionic liquid on the adsorption process was attained, and a final improvement on the adsorption of hydrophilic ionic liquids by the addition of an inorganic salt (Na2SO4) was also achieved. Yet, the development of a recovery process that allows the reuse of the ionic liquid is still required for the development of sustainable processes.

Extraction of added-value products from biomass using ionic liquids

The main purpose of this thesis is to investigate the potential of ionic liquids (ILs) as a new class of extractive solvents for added-value products from biomass. These include phenolic compounds (vanillin, gallic, syringic and vanillic acids), alkaloids (caffeine) and aminoacids (L-tryptophan). The interest on these natural compounds relies on the wide variety of relevant properties shown by those families and further application in the food, cosmetic and pharmaceutical industries. Aiming at developping more benign and effective extraction/purification techniques than those used, a comprehensive study was conducted using aqueous biphasic systems (ABS) composed of ILs and inorganic/organic salts. In addition, ILs were characterized by a polarity scale, using solvatochromic probes, aiming at providing prior indications on the ILs affinity for particular added-value products. Solid-liquid (S-L) extractions from biomass and using aqueous solution of ILs were also investigated. In particular, and applying and experimental factorial design to optimize the operational conditions, caffeine was extracted from guaraná seeds and spent coffee. With both types of extractions it was found that it is possible to recover the high-value compounds and to recycle the IL and salt solutions. Finally, aiming at exploring the recovery of added-value compounds from biomass using a simpler and more suistainable technique, the solubility of gallic acid, vanillin and caffeine was studied in aqueous solutions of several ILs and common salts. With the gathered results it was possible to demonstrate that ILs act as hydrotropes and that water can be used as an adequate antisolvent. This thesis describes the use of ILs towards the development of more effective and sustainable processes.

Seamless integration of heterogeneous networks in multicast environments

Nowadays, communication environments are already characterized by a myriad of competing and complementary technologies that aim to provide an ubiquitous connectivity service. Next Generation Networks need to hide this heterogeneity by providing a new abstraction level, while simultaneously be aware of the underlying technologies to deliver richer service experiences to the end-user. Moreover, the increasing interest for group-based multimedia services followed by their ever growing resource demands and network dynamics, has been boosting the research towards more scalable and exible network control approaches. The work developed in this Thesis enables such abstraction and exploits the prevailing heterogeneity in favor of a context-aware network management and adaptation. In this scope, we introduce a novel hierarchical control framework with self-management capabilities that enables the concept of Abstract Multiparty Trees (AMTs) to ease the control of multiparty content distribution throughout heterogeneous networks. A thorough evaluation of the proposed multiparty transport control framework was performed in the scope of this Thesis, assessing its bene ts in terms of network selection, delivery tree recon guration and resource savings. Moreover, we developed an analytical study to highlight the scalability of the AMT concept as well as its exibility in large scale networks and group sizes. To prove the feasibility and easy deployment characteristic of the proposed control framework, we implemented a proof-of-concept demonstrator that comprehends the main control procedures conceptually introduced. Its outcomes highlight a good performance of the multiparty content distribution tree control, including its local and global recon guration. In order to endow the AMT concept with the ability to guarantee the best service experience by the end-user, we integrate in the control framework two additional QoE enhancement approaches. The rst employs the concept of Network Coding to improve the robustness of the multiparty content delivery, aiming at mitigating the impact of possible packet losses in the end-user service perception. The second approach relies on a machine learning scheme to autonomously determine at each node the expected QoE towards a certain destination. This knowledge is then used by di erent QoE-aware network management schemes that, jointly, maximize the overall users' QoE. The performance and scalability of the control procedures developed, aided by the context and QoE-aware mechanisms, show the advantages of the AMT concept and the proposed hierarchical control strategy for the multiparty content distribution with enhanced service experience. Moreover we also prove the feasibility of the solution in a practical environment, and provide future research directions that bene t the evolved control framework and make it commercially feasible.