Controlled synthesis and processing of a poly(L-lactide-co-ε-caprolactone) copolymer for biomedical use as an absorbable monofilament surgical suture

Poly(L-lactide-co-ε-caprolactone) 75:25% mol, P(LL-co-CL), was synthesized via bulk ring-opening polymerisation (ROP) using a novel tin(II)alkoxide initiator, [Sn(Oct)]2DEG, at 130oC for 48 hrs. The effectiveness of this initiator was compared withthe well-known conventional tin(II) octoateinitiator, Sn(Oct)2. The P(LL-co-CL) copolymersobtained were characterized using a combination of analytical technique including: nuclear magnetic resonance spectroscopy (NMR), differential scanning calorimetry (DSC), thermogravimetry (TG) and gel permeation chromatography (GPC). The P(LL-co-CL) was melt-spun into monofilament fibres of uniform diameter and smooth surface appearance. Modification of the matrix morphology was then built into the as-spun fibresvia a series of controlled off-line annealing and hot-drawing steps. © (2014) Trans Tech Publications, Switzerland.

Self-adapting parallel metric-space search engine for variable query loads

This research focuses on automatically adapting a search engine size in response to fluctuations in query workload. Deploying a search engine in an Infrastructure as a Service (IaaS) cloud facilitates allocating or deallocating computer resources to or from the engine. Our solution is to contribute an adaptive search engine that will repeatedly re-evaluate its load and, when appropriate, switch over to a dierent number of active processors. We focus on three aspects and break them out into three sub-problems as follows: Continually determining the Number of Processors (CNP), New Grouping Problem (NGP) and Regrouping Order Problem (ROP). CNP means that (in the light of the changes in the query workload in the search engine) there is a problem of determining the ideal number of processors p active at any given time to use in the search engine and we call this problem CNP. NGP happens when changes in the number of processors are determined and it must also be determined which groups of search data will be distributed across the processors. ROP is how to redistribute this data onto processors while keeping the engine responsive and while also minimising the switchover time and the incurred network load. We propose solutions for these sub-problems. For NGP we propose an algorithm for incrementally adjusting the index to t the varying number of virtual machines. For ROP we present an ecient method for redistributing data among processors while keeping the search engine responsive. Regarding the solution for CNP, we propose an algorithm determining the new size of the search engine by re-evaluating its load. We tested the solution performance using a custom-build prototype search engine deployed in the Amazon EC2 cloud. Our experiments show that when we compare our NGP solution with computing the index from scratch, the incremental algorithm speeds up the index computation 2{10 times while maintaining a similar search performance. The chosen redistribution method is 25% to 50% faster than other methods and reduces the network load around by 30%. For CNP we present a deterministic algorithm that shows a good ability to determine a new size of search engine. When combined, these algorithms give an adapting algorithm that is able to adjust the search engine size with a variable workload.