1,270 research outputs found
LIPIcs, Volume 251, ITCS 2023, Complete Volume
LIPIcs, Volume 251, ITCS 2023, Complete Volum
Systemic Circular Economy Solutions for Fiber Reinforced Composites
This open access book provides an overview of the work undertaken within the FiberEUse project, which developed solutions enhancing the profitability of composite recycling and reuse in value-added products, with a cross-sectorial approach. Glass and carbon fiber reinforced polymers, or composites, are increasingly used as structural materials in many manufacturing sectors like transport, constructions and energy due to their better lightweight and corrosion resistance compared to metals. However, composite recycling is still a challenge since no significant added value in the recycling and reprocessing of composites is demonstrated. FiberEUse developed innovative solutions and business models towards sustainable Circular Economy solutions for post-use composite-made products. Three strategies are presented, namely mechanical recycling of short fibers, thermal recycling of long fibers and modular car parts design for sustainable disassembly and remanufacturing. The validation of the FiberEUse approach within eight industrial demonstrators shows the potentials towards new Circular Economy value-chains for composite materials
Utilitarian Welfare Optimization in the Generalized Vertex Coloring Games: An Implication to Venue Selection in Events Planning
We consider a general class of multi-agent games in networks, namely the
generalized vertex coloring games (G-VCGs), inspired by real-life applications
of the venue selection problem in events planning. Certain utility responding
to the contemporary coloring assignment will be received by each agent under
some particular mechanism, who, striving to maximize his own utility, is
restricted to local information thus self-organizing when choosing another
color. Our focus is on maximizing some utilitarian-looking welfare objective
function concerning the cumulative utilities across the network in a
decentralized fashion. Firstly, we investigate on a special class of the
G-VCGs, namely Identical Preference VCGs (IP-VCGs) which recovers the
rudimentary work by \cite{chaudhuri2008network}. We reveal its convergence even
under a completely greedy policy and completely synchronous settings, with a
stochastic bound on the converging rate provided. Secondly, regarding the
general G-VCGs, a greediness-preserved Metropolis-Hasting based policy is
proposed for each agent to initiate with the limited information and its
optimality under asynchronous settings is proved using theories from the
regular perturbed Markov processes. The policy was also empirically witnessed
to be robust under independently synchronous settings. Thirdly, in the spirit
of ``robust coloring'', we include an expected loss term in our objective
function to balance between the utilities and robustness. An optimal coloring
for this robust welfare optimization would be derived through a second-stage
MH-policy driven algorithm. Simulation experiments are given to showcase the
efficiency of our proposed strategy.Comment: 35 Page
A comparative analysis between two heuristic algorithms for the graph vertex coloring problem
This study focuses on two heuristic algorithms for the graph vertex coloring problem: the sequential (greedy) coloring algorithm (SCA) and the Welsh–Powell algorithm (WPA). The code of the algorithms is presented and discussed. The methodology and conditions of the experiments are presented. The execution time of the algorithms was calculated as the average of four different starts of the algorithms for all analyzed graphs, taking into consideration the multitasking mode of the operating system. In the graphs with less than 600 vertices, in 90% of cases, both algorithms generated the same solutions. In only 10% of cases, the WPA algorithm generates better solutions. However, in the graphs with more than 1,000 vertices, in 35% of cases, the WPA algorithm generates better solutions. The results show that the difference in the execution time of the algorithms for all graphs is acceptable, but the quality of the solutions generated by the WPA algorithm in more than 20% of cases is better compared to the SC algorithm. The results also show that the quality of the solutions is not related to the number of iterations performed by the algorithms
Processing-Structure-Property Relationships in Ni-based Superalloy René 41
The cast and wrought Nickel based superalloy René 41 combines excellent strength, toughness, and corrosion properties. Its mechanical properties outperform all similar competitor aerospace alloys such as Waspaloy and Haynes 282. However, processing of René 41 remains challenging due to cracking and inhomogeneous grain size distributions, resulting in poor yield, limiting more wide-spread application. Therefore, despite having been developed in the 1950s, René 41 is not yet widely applied, and published research is limited. However, trends towards higher efficiency aircraft engines have now reignited interest in René 41 as a candidate material in next generation engines due to its excellent property profile. This necessitates new research to reduce the knowledge gaps in the processing-microstructure-property relationships of René 41.
Correlative high-resolution microscopy is successfully applied to identify previously ambiguous secondary phases in René 41. This approach reveals complete space group, as well as high quality compositional information. These insights are applied to the development of an experimental precipitation study, and to update a current thermodynamic database for superalloys. The updated database has improved predictive quality regarding phase stability and composition of the grain boundary carbides M6C and M23C6. Applying these results to kinetic simulations also demonstrates higher predictive power. Such improved simulations are required to optimize the precipitation behaviour and predict material properties after processing. Comparison to literature data shows that the updated database yields improvements for other alloys besides René 41 as well, such as Haynes 282, Waspaloy and alloys in the Nimonic series. Further, dynamic restoration processes are studied based on laboratory scale hot-working experiments. Targeted design of the temperature profiles, allows the effect of nm scale γ’ precipitates on microstructural evolution to be isolated. Implementing the gained insights in simulations and phenomenological models advances the capabilities of modern software tools, providing better insights into microstructural processes.
The results presented in this thesis will thus advance the understanding of the microstructural evolution in René 41 and the descriptive capabilities of modern thermodynamic simulation packages. This will facilitate higher yield in processing and enable future alloy design for next generation aerospace applications
Simulation and Control of Running Models
This work focuses on the locomotion of one-legged robots, with focus on approaches that stabilize passive limit cycles. Locomotion based on the socalled passive gaits promises to greatly reduce the actuation effort required for legged robots to move. In this work, the passive gaits of robots of varying complexity are characterized and stabilizing controllers are reviewed from the literature and newly formulated. The robots are modelled as hybrid dynamical systems and numerically simulated, thereby allowing to validate the proposed control strategies.
Firstly, the vertical control through energy regulation of a one-dimensional hopper is considered.
Secondly, the SLIP model is reviewed and then extended to the “pitchingSLIP”, with the aim of characterizing its passive gaits with somersaults. Two controllers based on energy and angular momentum regulation are then formulated to stabilize passive gaits with somersaults, making the control effort converge to zero. A further extension of the SLIP template, denominated “bodySLIP”, is then used to test the control approach on a more realistic model. The controllers shall be later extended to more complex cases, in which the somersaults are not necessarily present in the passive gaits.
Thirdly, the locomotion of a one-legged robot with a body link is studied.
Raibert’s control approach based on the foot placement algorithm is reviewed and compared to the non-dissipative touchdown controller of Hyon and Emura.
The latter is then extended to be used with continuous torque profiles and to perform velocity tracking. Moreover, damping is added to the joints in order to study its effect on the controller, which was then modified to achieve stable running even in such conditions. The results obtained shall lay the foundations for a later test on hardware on DLR’s quadruped Bert
Path Protection Switching in Information Centric Networks (ICN)
Since its formation, the Internet has experienced tremendous growth, constantly increasing traffic and new applications, including voice and video. However, it still keeps its original architecture drafted almost 40 years ago built on the end-to-end principle; this has proven to be problematic when there are failures as routing convergence is slow for unicast networks and even slower for multicast which has to rely upon slow multicast routing as no protection switching exists for multicast. This thesis investigates protection in an alternative approach for network communication, namely information centric networking (ICN) using the architecture proposed by the PSIRP/PURSUIT projects. This uses Bloom Filters to allow both unicast and multicast forwarding. However, the PSIRP/PURSUIT ICN approach did not investigate protection switching and this problem forms the main aim of this thesis. The work builds on the research by Grover and Stamatelakis who introduced the concept of pre-configured protection p-cycles in 2000 for optical networks and, with modification, applicable to unicast IP or packet networks. This thesis shows how the p-cycle concept can be directly applied to packet networks that use PSIRP/PURSUIT ICN and extends the approach to encompass both unicast and multicast protection switching. Furthermore, it shows how the chosen p-cycles can be optimised to reduce the redundancy overhead introduced by the protection mechanism. The work evaluates the approach from two aspects, the first is how the proposed approach compares to existing switching state and traffic in an MPLS multicast architecture. The second considers the redundancy overhead in three known network topologies for synthetic traffic matrices. The thesis is the first work to demonstrate the efficiency of Bloom filter based switching for multicast (and unicast) protection switching
The long-range Falicov-Kimball model and the amorphous Kitaev model: Quantum many-body systems I have known and loved
Large systems of interacting objects can give rise to a rich array of emergent behaviours. Make those objects quantum and the possibilities only expand. Interacting quantum many-body systems, as such systems are called, include essentially all physical systems. Luckily, we don't usually need to consider this full quantum many-body description. The world at the human scale is essentially classical (not quantum), while at the microscopic scale of condensed matter physics we can often get by without interactions. Strongly correlated materials, however, do require the full description. Some of the most exciting topics in modern condensed matter fall under this umbrella: the spin liquids, the fractional quantum Hall effect, high temperature superconductivity and much more. Unfortunately, strongly correlated materials are notoriously difficult to study, defying many of the established theoretical techniques within the field. Enter exactly solvable models, these are interacting quantum many-body systems with extensively many local symmetries. The symmetries give rise to conserved charges. These charges break the model up into many non-interacting quantum systems which are more amenable to standard theoretical techniques. This thesis will focus on two such exactly solvable models.
The first, the Falicov-Kimball (FK) model is an exactly solvable limit of the famous Hubbard model which describes itinerant fermions interacting with a classical Ising background field. Originally introduced to explain metal-insulator transitions, it has a rich set of ground state and thermodynamic phases. Disorder or interactions can turn metals into insulators and the FK model features both transitions. We will define a generalised FK model in 1D with long-range interactions. This model shows a similarly rich phase diagram to its higher dimensional cousins. We use an exact Markov Chain Monte Carlo method to map the phase diagram and compute the energy resolved localisation properties of the fermions. This allows us to look at how the move to 1D affects the physics of the model. We show that the model can be understood by comparison to a simpler model of fermions coupled to binary disorder.
The second, the Kitaev Honeycomb (KH) model, was the one of the first solvable 2D models with a Quantum Spin Liquid (QSL) ground state. QSLs are generally expected to arise from Mott insulators, when frustration prevents magnetic ordering all the way to zero temperature. The QSL state defies the traditional Landau-Ginzburg-Wilson paradigm of phases being defined by local order parameters. It is instead a topologically ordered phase. Recent work generalising non-interacting topological insulator phases to amorphous lattices raises the question of whether interacting phases like the QSLs can be similarly generalised. We extend the KH model to random lattices with fixed coordination number three generated by Voronoi partitions of the plane. We show that this model remains solvable and hosts a chiral amorphous QSL ground state. The presence of plaquettes with an odd number of sides leads to a spontaneous breaking of time reversal symmetry. We unearth a rich phase diagram displaying Abelian as well as a non-Abelian QSL phases with a remarkably simple ground state flux pattern. Furthermore, we show that the system undergoes a phase transition to a conducting thermal metal state and discuss possible experimental realisations.Open Acces
- …