A new approach for the preparation of hydrophilic poly(L‐lactide) porous scaffold for tissue engineering by using lamellar single crystals

The aim of the present work was to study the possibility of building a porous scaffold for tissue engineering with a new bottom‐up approach, obtained by assembling two‐dimensional‐micro, one‐dimensional‐nano sized poly(L ‐lactide) lamellar single crystals. This choice was dictated by the fact that polymer single crystals have structural and morphological features which can be exploited for chemical surface modifications to give a system characterized by a high specific active surface area. Indeed, the outermost amorphous regions can undergo functionalization reactions easily, whereas the inner, relatively inaccessible and inert crystalline core ensures morphological and mechanical stability. The assembling method employed to give the porous structures is based on a mould pressing, salt leaching technique and was found to be facile and versatile. In the first part of this paper we report the experimental results obtained to find the best conditions to achieve a suitable frame in terms of morphology, porosity and mechanical properties. In the second part of the paper, we describe the biological tests performed by using mouse fibroblasts seeded onto scaffolds prepared from pristine and surface hydrolysed lamellae. The results show that the samples obtained are suitable for sustaining cells which can proliferate and reach the inner pores of the scaffold containing hydrolysed single crystals much better than those prepared from pristine lamellae. Copyright © 2012 Society of Chemical Industry     

MCFC-based CO2 capture system for small scale CHP plants

Carbon dioxide emissions into the atmosphere are considered among the main reasons of the greenhouse effect. The largest share of CO₂ is emitted by power plants using fossil fuels. Nowadays there are several technologies to capture CO₂ from power plants' exhaust gas but each of them consumes a significant part of the electric power generated by the plant. The Molten Carbonate Fuel Cell (MCFC) can be used as concentrator of CO₂, due to the chemical reactions that occurs in the cell stack: carbon dioxide entering into the cathode side is transported to the anode side via CO₃⁼ ions and is finally concentrated in the anodic exhaust. MCFC systems can be integrated in existing power plants (retro fitting) to separate CO₂ in the exhaust gas and, at the same time, produce additional energy. The aim of this study is to find a feasible system design for medium scale cogeneration plants which are not considered economically and technically interesting for existing technologies for carbon capture, but are increasing in numbers with respect to large size power plants. This trend, if confirmed, will increase number of medium cogeneration plants with consequent benefit for both MCFC market for this application and effect on global CO₂ emissions. System concept has been developed in a numerical model, using AspenTech engineering software. The model simulates a plant, which separates CO₂ from a cogeneration plant exhaust gases and produces electric power. Data showing the effect of CO₂ on cell voltage and cogenerator exhaust gas composition were taken from experimental activities in the fuel cell laboratory of the University of Perugia, FCLab, and from existing CHP plants. The innovative aspect of this model is the introduction of recirculation to optimize the performance of the MCFC. Cathode recirculation allows to decrease the carbon dioxide utilization factor of the cell keeping at the same time system CO₂ removal efficiency at high level. At anode side, recirculation is used to reduce the fuel consumption (due to the unreacted hydrogen) and to increase the CO₂ purity in the stored gas. The system design was completely introduced in the model and several analyses were performed. CO₂ removal efficiency of 63% was reached with correspondent total efficiency of about 35%. System outlet is also thermal power, due to the high temperature of cathode exhaust off gases, and it is possible to consider integration of this outlet with the cogeneration system. This system, compared to other post-combustion CO₂ removal technologies, does not consume energy, but produces additional electrical and thermal power with a global efficiency of about 70%.     

ATR-FTIR and NMR spectroscopic studies on the structure of polymeric gel electrolytes for biomedical applications

The structure of polymeric gel membranes to be used as electrolytes in the recording of bioelectrical signals has been investigated by means of ATR-FTIR and ⁷Li and ¹³C MAS NMR spectroscopies. The membranes, based on PMMA, 1,2-diethoxyethane and lithium perchlorate, showed different ionic conductivity as a function of their composition. Such differences have been analyzed on the basis of spectroscopic data and the existence of interactions with the ester function in the polymeric matrix was determined. Spectroscopic data allowed to establish the optimal lithium concentration needed to achieve best ionic conductivity.     

Approximating the Metric TSP in Linear Time

Given a metric graph G=(V,E) of n vertices, i.e., a complete graph with a non-negative real edge cost function satisfying the triangle inequality, the metricity degree of G is defined as \(\beta=\max_{x,y,z\in V}\{\frac{c(x,y)}{c(x,z)+c(y,z)}\}\in[\frac{1}{2},1]\). This value is instrumental to establish the approximability of several NP-hard optimization problems definable on G, like for instance the prominent traveling salesman problem, which asks for finding a Hamiltonian cycle of G of minimum total cost. In fact, this problem can be approximated quite accurately depending on the metricity degree of G, namely by a ratio of either \(\frac{2-\beta}{3(1-\beta)}\) or \(\frac{3\beta^{2}}{3\beta^{2}-2\beta+1}\), for \(\beta<\frac{2}{3}\) or \(\beta\geq \frac{2}{3}\), respectively. Nevertheless, these approximation algorithms have O(n ³) and O(n ^2.5log?^1.5 n) running time, respectively, and therefore they are superlinear in the Θ(n ²) input size. Thus, since many real-world problems are modeled by graphs of huge size, their use might turn out to be unfeasible in practice, and alternative approaches requiring only O(n ²) time are sought. However, with this restriction, all the currently available approaches can only guarantee a 2-approximation ratio for the case β=1, which means a \(\frac{2\beta^{2}}{2\beta^{2}-2\beta+1}\)-approximation ratio for general β<1. In this paper, we show how to elaborate—without affecting the space and time complexity—one of these approaches, namely the classic double-MST heuristic, in order to obtain a 2β-approximate solution. This improvement is effective, since we show that the double-MST heuristic has in general a performance ratio strictly larger than 2β, and we further show that any alternative elaboration of it cannot lead to a performance ratio better than 2β?ε, for any ε>0. Our theoretical results are complemented with an extensive series of experiments, that show the practical appeal of our approach.     

Constraint-based correctness proofs for logic program transformations

Many approaches proposed in the literature for proving the correctness of unfold/fold transformations of logic programs make use of measures associated with program clauses. When from a program P ₁ we derive a program P ₂ by applying a sequence of transformations, suitable conditions on the measures of the clauses in P ₂ guarantee that the transformation of P ₁ into P ₂ is correct, that is, P ₁ and P ₂ have the same least Herbrand model. In the approaches proposed so far, clause measures are fixed in advance, independently of the transformations to be proved correct. In this paper we propose a method for the automatic generation of clause measures which, instead, takes into account the particular program transformation at hand. During the application of a sequence of transformations we construct a system of linear equalities and inequalities over nonnegative integers whose unknowns are the clause measures to be found, and the correctness of the transformation is guaranteed by the satisfiability of that system. Through some examples we show that our method is more powerful and practical than other methods proposed in the literature. In particular, we are able to establish in a fully automatic way the correctness of program transformations which, by using other methods, are proved correct at the expense of fixing in advance sophisticated clause measures.     

Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast

Abstract. Let G=(V,E) be a 2-edge connected, undirected and nonnegatively weighted graph, and let S(r) be a single source shortest paths tree (SPT) of G rooted at r ∈ V . Whenever an edge e in S(r) fails, we are interested in reconnecting the nodes now disconnected from the root by means of a single edge e' crossing the cut created by the removal of e . Such an edge e' is named a swap edge for e . Let S _e/e' (r) be the swap tree (no longer an SPT, in general) obtained by swapping e with e' , and let S _e be the set of all possible swap trees with respect to e . Let F be a function defined over S _e that expresses some feature of a swap tree, such as the average length of a path from the root r to all the nodes below edge e , or the maximum length, or one of many others. A best swap edge for e with respect to F is a swap edge f such that F(S _e/f (r)) is minimum. In this paper we present efficient algorithms for the problem of finding a best swap edge, for each edge e of S(r) , with respect to several objectives. Our work is motivated by a scenario in which individual connections in a communication network suffer transient failures. As a consequence of an edge failure, the shortest paths to all the nodes below the failed edge might completely change, and it might be desirable to avoid an expensive switch to a new SPT, because the failure is only temporary. As an aside, what we get is not even far from a new SPT: our analysis shows that the trees obtained from the swapping have features very similar to those of the corresponding SPTs rebuilt from scratch.     

Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems

Given a 2-edge-connected, real weighted graph G with n vertices and m edges, the 2-edge-connectivity augmentation problem is that of finding a minimum weight set of edges of G to be added to a spanning subgraph H of G to make it 2-edge-connected. While the general problem is NP-hard and 2 -approximable, in this paper we prove that it becomes polynomial time solvable if H is a depth-first search tree of G . More precisely, we provide an efficient algorithm for solving this special case which runs in O(M · α(M,n)) time, where α is the classic inverse of Ackermann's function and M=m · α(m,n) . This algorithm has two main consequences: first, it provides a faster 2 -approximation algorithm for the general 2 -edge-connectivity augmentation problem; second, it solves in O(m · α(m,n)) time the problem of restoring, by means of a minimum weight set of replacement edges, the 2 -edge-connectivity of a 2-edge-connected communication network undergoing a link failure.     

Strongly polynomial-time truthful mechanisms in one shot

One of the main challenges in algorithmic mechanism design is to turn (existing) efficient algorithmic solutions into efficient truthful mechanisms. Building a truthful mechanism is indeed a difficult process since the underlying algorithm must obey certain “monotonicity” properties and suitable payment functions need to be computed (this task usually represents the bottleneck in the overall time complexity).