Transaction Processing over Geo-Partitioned Data

Databases are a fundamental component of any web service, storing and managing all the service data. In large-scale web services, it is essential that the data storage systems used consider techniques such as partial replication, geo-replication, and weaker consistency models so that the expectations of these systems regarding availability and latency can be met as best as possible. In this dissertation, we address the problem of executing transactions on data that is partially replicated. In this sense, we adopt the transactional causal consistency semantics, the consistency model where a transaction accesses a causally consistent snapshot of the database. However, implementing this consistency model in a partially replicated setting raises several challenges regarding handling transactions that access data items replicated in different nodes. Our work aims to design and implement a novel algorithm for executing transactions over geo-partitioned data with transactional causal consistency semantics. We discuss the problems and design choices for executing transactions over partially replicated data and present a design to implement the proposed algorithm by extending a weakly consistent geo-replicated key-value store with partial replication, adding support for executing transactions involving geo-partitioned data items. In this context, we also addressed the problem of deciding the best strategy for searching data in replicas that hold only a part of the total data of a service and where the state of each replica might diverge. We evaluate our solution using microbenchmarks based on the TPC-H database. Our results show that the overhead of the system is low for the expected scenario of a low ratio of remote transactions.As bases de dados representam um componente fundamental de qualquer serviço web, armazenando e gerindo todos os dados do serviço. Em serviços web de grande escala, é essencial que os sistemas de armazenamento de dados utilizados considerem técnicas como a replicação parcial, geo-replicação e modelos de consistência mais fracos, de forma a que as expectativas dos utilizadores desses sistemas em relação à disponibilidade e latência possam ser atendidas da melhor forma possível. Nesta dissertação, abordamos o problema de executar transações sobre dados que estão parcialmente replicados. Nesse sentido, adotamos uma semântica de consistência transacional causal, o modelo de consistência em que uma transação acede a um snapshot causalmente consistente da base de dados. No entanto, implementar este modelo de consistência numa configuração parcialmente replicada levanta vários desafios relativamente à execução de transações que acedem a dados replicados em nós diferentes. O objetivo do nosso trabalho é projetar e implementar um novo algoritmo para a execução de transações sobre dados geo-particionados com semântica de consistência causal transacional. Discutimos os problemas e as opções de design para a execução de transações em dados parcialmente replicados e apresentamos um design para implementar o algoritmo proposto, estendendo um sistema de armazenamento chave-valor geo-replicado de consistência fraca com replicação parcial, adicionando suporte para executar transações envolvendo dados geo-particionados. Nesse contexto, também abordamos o problema de decidir a melhor estratégia para procurar dados em réplicas que guardam apenas uma parte total dos dados de um serviço e onde o estado de cada réplica pode divergir. Avaliamos a nossa solução utilizando microbenchmarks baseados na base de dados TPC-H. Os nossos resultados mostram que a carga adicional do sistema é baixa para o cenário esperado de uma baixa percentagem de transações remotas

ADAM : a decentralized parallel computer architecture featuring fast thread and data migration and a uniform hardware abstraction

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.Includes bibliographical references (p. 247-256).The furious pace of Moore's Law is driving computer architecture into a realm where the the speed of light is the dominant factor in system latencies. The number of clock cycles to span a chip are increasing, while the number of bits that can be accessed within a clock cycle is decreasing. Hence, it is becoming more difficult to hide latency. One alternative solution is to reduce latency by migrating threads and data, but the overhead of existing implementations has previously made migration an unserviceable solution so far. I present an architecture, implementation, and mechanisms that reduces the overhead of migration to the point where migration is a viable supplement to other latency hiding mechanisms, such as multithreading. The architecture is abstract, and presents programmers with a simple, uniform fine-grained multithreaded parallel programming model with implicit memory management. In other words, the spatial nature and implementation details (such as the number of processors) of a parallel machine are entirely hidden from the programmer. Compiler writers are encouraged to devise programming languages for the machine that guide a programmer to express their ideas in terms of objects, since objects exhibit an inherent physical locality of data and code. The machine implementation can then leverage this locality to automatically distribute data and threads across the physical machine by using a set of high performance migration mechanisms.(cont.) An implementation of this architecture could migrate a null thread in 66 cycles - over a factor of 1000 improvement over previous work. Performance also scales well; the time required to move a typical thread is only 4 to 5 times that of a null thread. Data migration performance is similar, and scales linearly with data block size. Since the performance of the migration mechanism is on par with that of an L2 cache, the implementation simulated in my work has no data caches and relies instead on multithreading and the migration mechanism to hide and reduce access latencies.by Andrew "bunnie" Huang.Ph.D

ADAM: A Decentralized Parallel Computer Architecture Featuring Fast Thread and Data Migration and a Uniform Hardware Abstraction

The furious pace of Moore's Law is driving computer architecture into a realm where the the speed of light is the dominant factor in system latencies. The number of clock cycles to span a chip are increasing, while the number of bits that can be accessed within a clock cycle is decreasing. Hence, it is becoming more difficult to hide latency. One alternative solution is to reduce latency by migrating threads and data, but the overhead of existing implementations has previously made migration an unserviceable solution so far. I present an architecture, implementation, and mechanisms that reduces the overhead of migration to the point where migration is a viable supplement to other latency hiding mechanisms, such as multithreading. The architecture is abstract, and presents programmers with a simple, uniform fine-grained multithreaded parallel programming model with implicit memory management. In other words, the spatial nature and implementation details (such as the number of processors) of a parallel machine are entirely hidden from the programmer. Compiler writers are encouraged to devise programming languages for the machine that guide a programmer to express their ideas in terms of objects, since objects exhibit an inherent physical locality of data and code. The machine implementation can then leverage this locality to automatically distribute data and threads across the physical machine by using a set of high performance migration mechanisms. An implementation of this architecture could migrate a null thread in 66 cycles -- over a factor of 1000 improvement over previous work. Performance also scales well; the time required to move a typical thread is only 4 to 5 times that of a null thread. Data migration performance is similar, and scales linearly with data block size. Since the performance of the migration mechanism is on par with that of an L2 cache, the implementation simulated in my work has no data caches and relies instead on multithreading and the migration mechanism to hide and reduce access latencies

Ant Colony Algorithms for the Resolution of Semantic Searches in P2P Networks

Tesis por compendio[EN] The long-lasting trend in the field of computation of stress and resource distribution has found its way into computer networks via the concept of peer-to-peer (P2P) connectivity. P2P is a symmetrical model, where each network node is enabled a comparable range of capacities and resources. It stands in a stark contrast to the classical, strongly asymmetrical client-server approach. P2P, originally considered only a complimentary, server-side structure to the straightforward client-server model, has been shown to have the substantial potential on its own, with multiple, widely known benefits: good fault tolerance and recovery, satisfactory scalability and intrinsic load distribution. However, contrary to client-server, P2P networks require sophisticated solutions on all levels, ranging from network organization, to resource location and managing. In this thesis we address one of the key issues of P2P networks: performing efficient resource searches of semantic nature under realistic, dynamic conditions. There have been numerous solutions to this matter, with evolutionary, stigmergy-based, and simple computational foci, but few attempt to resolve the full range of challenges this problem entails. To name a few: real-life P2P networks are rarely static, nodes disconnect, reconnect and change their content. In addition, a trivial incorporation of semantic searches into well-known algorithms causes significant decrease in search efficiency. In our research we build a solution incrementally, starting with the classic Ant Colony System (ACS) within the Ant Colony Optimization metaheuristic (ACO). ACO is an algorithmic framework used for solving combinatorial optimization problems that fits contractually the problem very well, albeit not providing an immediate solution to any of the aforementioned problems. First, we propose an efficient ACS variant in structured (hypercube structured) P2P networks, by enabling a path-post processing algorithm, which called Tabu Route Optimization (TRO). Next, we proceed to resolve the issue of network dynamism with an ACO-compatible information diffusion approach. Consequently, we attempt to incorporate the semantic component of the searches. This initial approximation to the problem was achieved by allowing ACS to differentiate between search types with the pheromone-per-concept idea. We called the outcome of this merger Routing Concept ACS (RC-ACS). RC-ACS is a robust, static multipheromone implementation of ACS. However, we were able to conclude from it that the pheromone-per-concept approach offers only limited scalability and cannot be considered a global solution. Thus, further progress was made in this respect when we introduced to RC-ACS our novel idea: dynamic pheromone creation, which replaces the static one-to-one assignment. We called the resulting algorithm Angry Ant Framework (AAF). In AAF new pheromone levels are created as needed and during the search, rather than prior to it. The final step was to enable AAF, not only to create pheromone levels, but to reassign them to optimize the pheromone usage. The resulting algorithm is called EntropicAAF and it has been evaluated as one of the top-performing algorithms for P2P semantic searches under all conditions.[ES] La popular tendencia de distribución de carga y recursos en el ámbito de la computación se ha transmitido a las redes computacionales a través del concepto de la conectividad peer-to-peer (P2P). P2P es un modelo simétrico, en el cual a cada nodo de la red se le otorga un rango comparable de capacidades y recursos. Se trata de un fuerte contraste con el clásico y fuertemente asimétrico enfoque cliente-servidor. P2P, originalmente considerado solo como una estructura del lado del servidor complementaria al sencillo modelo cliente-servidor, ha demostrado tener un potencial considerable por sí mismo, con múltiples beneficios ampliamente conocidos: buena tolerancia a fallos y recuperación, escalabilidad satisfactoria y distribución de carga intrínseca. Sin embargo, al contrario que el modelo cliente-servidor, las redes P2P requieren de soluciones sofisticadas a todos los niveles, desde la organización de la red hasta la gestión y localización de recursos. Esta tesis aborda uno de los problemas principales de las redes P2P: la búsqueda eficiente de recursos de naturaleza semántica bajo condiciones dinámicas y realistas. Ha habido numerosas soluciones a este problema basadas en enfoques evolucionarios, estigmérgicos y simples, pero pocas han tratado de resolver el abanico completo de desafíos. En primer lugar, las redes P2P reales son raramente estáticas: los nodos se desconectan, reconectan y cambian de contenido. Además, la incorporación trivial de búsquedas semánticas en algoritmos conocidos causa un decremento significativo de la eficiencia de la búsqueda. En esta investigación se ha construido una solución de manera incremental, comenzando por el clásico Ant Colony System (ACS) basado en la metaheurística de Ant Colony Optimization (ACO). ACO es un framework algorítmico usado para búsquedas en grafos que encaja perfectamente con las condiciones del problema, aunque no provee una solución inmediata a las cuestiones mencionadas anteriormente. En primer lugar, se propone una variante eficiente de ACS para redes P2P estructuradas (con estructura de hipercubo) permitiendo el postprocesamiento de las rutas, al que hemos denominado Tabu Route Optimization (TRO). A continuación, se ha tratado de resolver el problema del dinamismo de la red mediante la difusión de la información a través de una estrategia compatible con ACO. En consecuencia, se ha tratado de incorporar el componente semántico de las búsquedas. Esta aproximación inicial al problema ha sido lograda permitiendo al ACS diferenciar entre tipos de búsquedas através de la idea de pheromone-per-concept. El resultado de esta fusión se ha denominado Routing Concept ACS (RC-ACS). RC-ACS es una implementación multiferomona estática y robusta de ACS. Sin embargo, a partir de esta implementación se ha podido concluir que el enfoque pheromone-per-concept ofrece solo escalabilidad limitada y que no puede ser considerado una solución global. Por lo tanto, para lograr una mejora a este respecto, se ha introducido al RC-ACS una novedosa idea: la creación dinámica de feromonas, que reemplaza la asignación estática uno a uno. En el algoritmo resultante, al que hemos denominado Angry Ant Framework (AAF), los nuevos niveles de feromona se crean conforme se necesitan y durante la búsqueda, en lugar de crearse antes de la misma. La mejora final se ha obtenido al permitir al AAF no solo crear niveles de feromona, sino también reasignarlos para optimizar el uso de la misma. El algoritmo resultante se denomina EntropicAAF y ha sido evaluado como uno de los algoritmos más exitosos para las búsquedas semánticas P2P bajo todas las condiciones.[CA] La popular tendència de distribuir càrrega i recursos en el camp de la computació s'ha estès cap a les xarxes d'ordinadors a través del concepte de connexions d'igual a igual (de l'anglès, peer to peer o P2P). P2P és un model simètric on cada node de la xarxa disposa del mateix nombre de capacitats i recursos. P2P, considerat originàriament només una estructura situada al servidor complementària al model client-servidor simple, ha provat tindre el suficient potencial per ella mateixa, amb múltiples beneficis ben coneguts: una bona tolerància a errades i recuperació, una satisfactòria escalabilitat i una intrínseca distribució de càrrega. No obstant, contràriament al client-servidor, les xarxes P2P requereixen solucions sofisticades a tots els nivells, que varien des de l'organització de la xarxa a la localització de recursos i la seua gestió. En aquesta tesi s'adreça un dels problemes clau de les xarxes P2P: ser capaç de realitzar eficientment cerques de recursos de naturalesa semàntica sota condicions realistes i dinàmiques. Existeixen nombroses solucions a aquest tema basades en la computació simple, evolutiva i també basades en l'estimèrgia (de l'anglès, stigmergy), però pocs esforços s'han realitzat per intentar resoldre l'ampli conjunt de reptes existent. En primer lloc, les xarxes P2P reals són rarament estàtiques: els nodes es connecten, desconnecten i canvien els seus continguts. A més a més, la incorporació trivial de cerques semàntiques als algorismes existents causa una disminució significant de l'eficiència de la cerca. En aquesta recerca s'ha construït una solució incremental, començant pel sistema clàssic de colònia de formigues (de l'anglés, Ant Colony System o ACS) dins de la metaheurística d'optimització de colònies de formigues (de l'anglès, Ant Colony Optimization o ACO). ACO és un entorn algorísmic utilitzat per cercar en grafs i que aborda el problema de forma satisfactòria, tot i que no proveeix d'una solució immediata a cap dels problemes anteriorment mencionats. Primer, s'ha proposat una variant eficient d'ACS en xarxes P2P estructurades (en forma d'hipercub) a través d'un algorisme de processament post-camí el qual s'ha anomenat en anglès Tabu Route Optimization (TRO). A continuació, s'ha procedit a resoldre el problema del dinamisme de les xarxes amb un enfocament de difusió d'informació compatible amb ACO. Com a conseqüència, s'ha intentat incorporar la component semàntica de les cerques. Aquest enfocament inicial al problema s'ha realitzat permetent a ACS diferenciar entre tipus de cerques amb la idea de ''feromona per concepte'', i s'ha anomenat a aquest producte Routing Concept ACS o RC-ACS. RC-ACS és una implementació multi-feromona robusta i estàtica d'ACS. No obstant, s'ha pogut concloure que l'enfocament de feromona per concepte ofereix només una escalabilitat limitada i no pot ser considerada una solució global. En aquest respecte s'ha realitzat progrés posteriorment introduint una nova idea a RC-ACS: la creació dinàmica de feromones, la qual reemplaça a l'assignació un a un de les mateixes. A l'algorisme resultant se l'ha anomenat en anglès Angry Ant Framework (AAF). En AAF es creen nous nivells de feromones a mesura que es necessiten durant la cerca, i no abans d'aquesta. El progrés final s'ha aconseguit quan s'ha permès a AAF, no sols crear nivells de feromones, sinó reassignar-los per optimitzar la utilització de feromones. L'algorisme resultant s'ha anomenat EntropicAAF i ha sigut avaluat com un dels algorismes per a cerques semàntiques P2P amb millors prestacions.Krynicki, KK. (2016). Ant Colony Algorithms for the Resolution of Semantic Searches in P2P Networks [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/61293TESISPremios Extraordinarios de tesis doctoralesCompendi

Estratégias biomiméticas usando a técnica camada-a-camada para aplicações biomédicas e engenharia de tecidos

The development of a suitable coating or material, which physico-chemical, mechanical or biological properties, that can be tailored according the features of the target tissue, has been gaining increased importance in biomedical and tissue engineering and regenerative medicine (TERM) fields. Biomimetic strategies have contributed significantly for the progress of biomedical field during the last years. This is possible to be achieved at different levels: imitating Nature form or function and mimicking natural processes and systems are the most used biomimetic approaches. In this thesis, Layer-by-Layer (LbL) methodology was used as a hierarchical biomimetic tool to modify surfaces and to produce freestanding membranes based on polyelectrolyte multilayers (PEMs). The possibility to functionalize or engineer biomaterials combined with the ability to incorporate a wide range of building blocks, makes LbL a powerful processing technique in the biomedical field. Synthetic polymers have been used to construct PEMs for biomedical and TERM applications; however, they lack often on adhesive cues for cell attachment and tissue growth. To overcome such issue, biomimetic synthetic polymers have been developed. Elastin-like polypeptides (ELPs) are a class of nature-inspired polymers, nonimmunogenic, genetically encodable and biocompatible. These materials are based on the repetition of short peptides considered to be building blocks in natural elastin and can include specific bioactive sequences, as the tripeptide Arginine-Glycine-Aspartame (RGD) known by promoting cell adhesion. For the first work of this thesis, ELPs were functionalized with azide and alkyne groups to introduce the reactivity required to carry out the 1,3-dipolar cycloaddition under mild biocompatible conditions, with no toxic by-products and in short reaction times. This reaction was done by means of a LbL assembly, driven by covalent interactions instead of being driven by electrostatic interactions, obtaining a bioactive and biomimetic multilayer coating. Moreover, these polymers are characterized by a critical temperature, known as the transition temperature in aqueous solution (Tt), which is related with a conformational reorganization. Thus, below Tt the polymer chains were soluble in water and above Tt they formed nano- and micro-aggregates becoming insoluble in a reversible process, making these coatings stimuli-responsive. In the following chapters, several polysaccharides as chitosan (CHT), alginate (ALG), hyaluronic acid (HA) or chondroitin sulfate (CS) were used to produce freestanding structured membranes through LbL processes, mainly driven by electrostatic interactions. The use of PEMs containing biopolymers are particularly appealing to coat and develop multilayered structures with biochemical functionalities, biocompatibility, and to mimic the interactions observed in native extracellular matrix (ECM). CHI/CS multilayers were used throughout the thesis, revealing some unique properties, when compared with other polysaccharide-based multilayers, such as their elasticity and degradation rate. However, natural origin polymer-based multilayers present low stiffness and higher hydration rates, which hinder cell adhesion. To overcome this, the CHT/CS multilayers were crosslinked with genipin. This is also a natural product, that is extracted from gardenia fruits and presents the ability to improve the mechanical properties, while preserves the biocompatibility and even enhances the cell adhesive properties. The ability to tailor the multilayers properties can be applied during their assembly or postassembly. Upon adjusting cross-linking parameters (e.g., cross-linker concentration and reaction time) the morphology, thickness, water uptake, rate of biodegradation, mechanical properties and cell adhesive properties can be tuned. Studies of shape-memory of these multilayered films, presented promising results regarding their use in biomedical applications. The mechanical properties of the multilayers can be further improved combining covalent and ionic crosslinking, which gives rise to a full interpenetrating polymer network. More interesting, it was possible to create a well-organized patterned topography at the surface of the freestanding multilayered membrane, just by using a different underlying substrate. This strategy envisaged to mimic the topography of the ECM of some tissues, as bone, skin or nerves, creating grooves on the material’s surface at nanoscale. Using this approach, it was possible to control some cellular functions and behavior as alignment and differentiation. Further in this thesis and inspired by the composition of the adhesive proteins in mussels, freestanding multilayered membranes containing dopamine-modified hyaluronic acid (HA-DN) were produced. The presence of DN along with the thickness of the membranes presented better lap-shear adhesion strength than the control membranes (hyaluronic acid and alginate films – two polysaccharides often regarded as good natural adhesives – were assembled together). Moreover, in vitro tests showed an enhanced cell adhesion for the membranes containing HA-DN and ability to use such kind of membranes for different biomedical and TERM applications, particularly for bone regeneration and skin wound healing. Combining different biomimetic concepts, it was also possible to recreate the complex environment of osteoarthritic articular cartilage by preparing human circular discs of superficially damaged articular cartilage from human samples. Herein, the adhesive freestanding multilayered membranes were used as a vehicle to deliver human adipose stem cells (hASCs) to help to repair the damaged cartilage. hASCs temporarily adhered to the adhesive LbL-based membranes, and were transported to the cartilage discs, creating a bridge of cells between the membranes and the surface of the cartilage. The cells started to migrate into the defects of the cartilage, proliferating and secreting factors capable of repairing the cartilage. Overall, the developed work in this thesis shows that LbL is a very versatile technique that provides the means to develop a wide range of solutions to be useful in biomedical and TERM applications.O desenvolvimento de um revestimento ou material cujas propriedades físicoquímica, mecânicas ou biológicas podem ser modificadas de acordo com as propriedades do tecido alvo, tem ganho cada vez mais importância, nomeadamente para fins biomédicos e de engenharia de tecidos e medicina regenerativa. Durante os últimos anos, diferentes estratégias biomiméticas têm contribuído significativamente para o progresso destas áreas. Estas são possíveis de implementar a diferentes níveis: imitar formas e funções existentes na natureza ou mimetizar processos e sistemas naturais. Na presente tese, a técnica camada-a-camada (LbL) foi usada como uma ferramenta biomimética para modificar superfícies ou produzir membranas com base em múltiplas camadas de polieletrólitos. A crescente utilização desta técnica, concretamente na área biomédica, prende-se com a possibilidade de funcionalizar ou produzir biomateriais aliada à capacidade de incorporar uma gama alargada de blocos de construção. Aqui, diferentes polímeros sintéticos e naturais têm sido usados para construir estruturas multicamada; no entanto, a generalidade dos polímeros sintéticos não apresenta naturalmente locais de ligação e adesão celular. Para contornar este obstáculo, algumas modificações químicas aos polímeros sintéticos têm sido sugeridas e novos compostos têm sido desenvolvidos, inspirados na composição de sistemas naturais. Por exemplo, polipéptidos tipo-elastina (ELPs) são uma classe de polímeros inspirados na natureza, que apresentam propriedades não-imunogénicas e biocompatíveis, podendo ser geneticamente programados conforme desejado. A sua composição baseia-se na repetição de pequenos péptidos também presentes na elastina humana, com a possibilidade também de incorporar outras sequências bioativas especificas, como o tripéptido Arginina-GlicinaÁcido Aspártico (RGD), reconhecido por promover a adesão celular. Para esta tese foram produzidos ELPs, que mais tarde foram funcionalizados com grupos azida e alquino para introduzir a reatividade necessária para uma reação 1,3-dipolar de ciclo-adição se realizar em condições biocompatíveis, sem produtos tóxicos resultantes e em curtos tempos de reação. Esta reação foi realizada sob a técnica LbL, mas conduzida por interações covalentes ao invés de electroestáticas, para atuar como revestimento biomédico. Estes polímeros são ainda reconhecidos pela sua temperatura de transição (Tt) em solução aquosa, relacionada com uma reorganização conformacional da cadeia polimérica. Abaixo da Tt as suas cadeias poliméricas são solúveis, mas acima de Tt formam-se micro-agregados; este é um processo reversível que confere propriedades responsivas aos revestimentos. Nos seguintes capítulos, diferentes polissacarídeos como quitosano (CHT), alginato (ALG), sulfato de condroitina (CS) ou ácido hialurónico (HA), foram usados para produzir membranas multicamadas conduzidas maioritariamente via interações electroestáticas. Esta abordagem tem ganho cada vez mais importância para desenvolver materiais com funcionalidade bioquímica, biocompatibilidade e para mimetizar algumas interações observadas na matriz extracelular (ECM). Ao longo desta tese foram usadas membranas multicamada de CHT/CS; estes materiais revelaram algumas propriedades muito particulares, quando comparadas com outros sistemas de multicamada, como a sua elasticidade e taxas de degradação mais rápidas. No entanto, a baixa rigidez e maiores taxas de hidratação, que muitas vezes impedem a adesão celular, surgem frequentemente associados a sistemas multicamada compostos somente por polissacarídeos. Para contornar este obstáculo, as membranas multicamada de CHT/CS foram reticuladas com genipina. De notar que este composto é de origem natural, sendo extraído da fruta da gardénia; a pós-modificação das membranas com genipina resultou na melhoria das propriedades mecânicas e biocompatibilidade, e ainda, no aumentando das propriedades bio-adesivas. Na realidade, a possibilidade de modular as propriedades destes sistemas multicamada por reticulação química pode ser conseguida logo durante a adsorção de cada camada ou no fim do processo. Características dos biomateriais como a morfologia, espessura, taxas de adsorção de água ou biodegradação, propriedades mecânicas e biológicas podem ser moduladas ajustando certos parâmetros de reticulação (por exemplo, agente de reticulação, concentração ou tempo de reação). Para além do mais, estudos de memória de forma destas membranas multicamada mostraram resultados promissores, considerando o seu uso para fins biomédicos. As propriedades mecânicas destes sistemas foram melhoradas combinando as ligações electroestáticas já existentes com ligações covalentes conferidas pela reticulação química, dando origem a uma rede polimérica multicamada, mas interpenetrada. Na continuação deste trabalho foi possível criar uma topografia com padrão bem organizado na superfície das membranas, alterando somente o material onde efetuamos a deposição das multicamadas. Esta estratégia visou mimetizar a topografia da ECM de diferentes tecidos, como o osso, a pele ou os nervos, criando canais alinhados na superfície do material. Usando este tipo de materiais multicamada padronizados foi possível modular funções e comportamentos celulares como o alinhamento ou a diferenciação. Em seguida, inspirados pela composição das proteínas que conferem adesividade aos mexilhões, foram produzidas membranas multicamada contendo HA modificado com dopamina (DN). A presença de DN ao longo da espessura das membranas multicamada parece ter contribuído para uma melhor e maior força de adesão, quando comparadas com as membranas controlo (membranas multicamada CHT/HA e CHT/ALG). Para além do mais, os testes in vitro resultaram em uma significante melhoria da adesão celular às membranas contendo DN. Esta estratégia mostrou ser promissora para diferentes aplicações biomédicas e de engenharia de tecidos, particularmente para a regeneração de tecido ósseo e a cicatrização de feridas da pele. Combinando diferentes estratégias e conceitos biomiméticos, foi também possível recriar um sistema complexo associado à cartilagem articular e concretamente a doenças como a osteoartrite. Assim sendo, na última parte desta tese, estas membranas multicamada com propriedades adesivas foram utilizadas como veículo para transportar células estaminais humanas do tecido adiposo (hASCs) para o local onde a cartilagem se encontra danificada. A presença deste tipo de células tem sido utilizada como tratamento para cartilagem danificada. Aqui, hASCs aderiram temporariamente às membranas multicamada, e foram assim transportadas diretamente para discos de cartilagem humana danificada, permitindo a criação de uma ponte celular entre as membranas e a superfície da cartilagem. Desta forma, estas células começaram a proliferar na superfície da cartilagem começando a migrar para os defeitos (em profundidade), segregando fatores capazes de ajudar na reparação da cartilagem. No geral, o trabalho desenvolvido para a presente tese mostra a grande versatilidade da técnica LbL, que proporciona os meios necessários para desenvolver uma gama alargada de materiais, estratégias e soluções muito necessárias e promissoras para aplicações biomédicas e de engenharia de tecidos e medicina regenerativa.Programa Doutoral em Químic

Electrospun Composite Nanofibers for Functional Applications

This reprint includes research articles on various applications of electrospun nanofibers. Nanofibers have potential to be used in tissue engineering, energy harvesting, sensors, separators, water filtration, air filtration, and other applications as well. This Special Issue has received 11 interesting research articles, which covers such application areas

ENERGY-AWARE OPTIMIZATION FOR EMBEDDED SYSTEMS WITH CHIP MULTIPROCESSOR AND PHASE-CHANGE MEMORY

Over the last two decades, functions of the embedded systems have evolved from simple real-time control and monitoring to more complicated services. Embedded systems equipped with powerful chips can provide the performance that computationally demanding information processing applications need. However, due to the power issue, the easy way to gain increasing performance by scaling up chip frequencies is no longer feasible. Recently, low-power architecture designs have been the main trend in embedded system designs. In this dissertation, we present our approaches to attack the energy-related issues in embedded system designs, such as thermal issues in the 3D chip multiprocessor (CMP), the endurance issue in the phase-change memory(PCM), the battery issue in the embedded system designs, the impact of inaccurate information in embedded system, and the cloud computing to move the workload to remote cloud computing facilities. We propose a real-time constrained task scheduling method to reduce peak temperature on a 3D CMP, including an online 3D CMP temperature prediction model and a set of algorithm for scheduling tasks to different cores in order to minimize the peak temperature on chip. To address the challenging issues in applying PCM in embedded systems, we propose a PCM main memory optimization mechanism through the utilization of the scratch pad memory (SPM). Furthermore, we propose an MLC/SLC configuration optimization algorithm to enhance the efficiency of the hybrid DRAM + PCM memory. We also propose an energy-aware task scheduling algorithm for parallel computing in mobile systems powered by batteries. When scheduling tasks in embedded systems, we make the scheduling decisions based on information, such as estimated execution time of tasks. Therefore, we design an evaluation method for impacts of inaccurate information on the resource allocation in embedded systems. Finally, in order to move workload from embedded systems to remote cloud computing facility, we present a resource optimization mechanism in heterogeneous federated multi-cloud systems. And we also propose two online dynamic algorithms for resource allocation and task scheduling. We consider the resource contention in the task scheduling

Quantum Prudent Contracts with Applications to Bitcoin

Smart contracts are cryptographic protocols that are enforced without a judiciary. Smart contracts are used occasionally in Bitcoin and are prevalent in Ethereum. Public quantum money improves upon cash we use today, yet the current constructions do not enable smart contracts. In this work, we define and introduce quantum payment schemes, and show how to implement prudent contracts -- a non-trivial subset of the functionality that a network such as Ethereum provides. Examples discussed include: multi-signature wallets in which funds can be spent by any 2-out-of-3 owners; restricted accounts that can send funds only to designated destinations; and "colored coins" that can represent stocks that can be freely traded, and their owner would receive dividends. Our approach is not as universal as the one used in Ethereum since we do not reach a consensus regarding the state of a ledger. We call our proposal prudent contracts to reflect this. The main building block is either quantum tokens for digital signatures (Ben-David and Sattath QCrypt'17, Coladangelo et al. Crypto'21), semi-quantum tokens for digital signatures (Shmueli'22) or one-shot signatures (Amos et al. STOC'20). The solution has all the benefits of public quantum money: no mining is necessary, and the security model is standard (e.g., it is not susceptible to 51\% attacks, as in Bitcoin). Our one-shot signature construction can be used to upgrade the Bitcoin network to a quantum payment scheme. Notable advantages of this approach are: transactions are locally verifiable and without latency, the throughput is unbounded, and most importantly, it would remove the need for Bitcoin mining. Our approach requires a universal large-scale quantum computer and long-term quantum memory; hence we do not expect it to be implementable in the next few years.Comment: Minor change