775 research outputs found

    Heterogeneous nucleation and heat flux avalanches in La(Fe, Si)13 magnetocaloric compounds near the critical point

    Get PDF
    The phase transformation kinetics of LaFe11.41Mn0.30Si1.29-H1.65 magnetocaloric compound is addressed by low rate calorimetry experiments. Scans at 1 mK/s show that its first order phase transitions are made by multiple heat flux avalanches. Getting very close to the critical point, when the transition becomes of the second order type, the step-like discontinuous behaviour associated with avalanches is smoothed out and the thermal hysteresis disappears. This result is confirmed by magneto-resistivity measurements and allows to obtain accurate values of the temperature hysteresis (DThyst = 0.37 K) at zero external magnetic field and of the critical field (Hc = 1.19 T). The number and magnitude of heat flux avalanches change as the magnetic field strength is increased, showing the interplay between the intrinsic energy barrier between phases and the microstructural disorder of the sample

    Locality of Not-So-Weak Coloring

    Get PDF
    Many graph problems are locally checkable: a solution is globally feasible if it looks valid in all constant-radius neighborhoods. This idea is formalized in the concept of locally checkable labelings (LCLs), introduced by Naor and Stockmeyer (1995). Recently, Chang et al. (2016) showed that in bounded-degree graphs, every LCL problem belongs to one of the following classes: - "Easy": solvable in O(logn)O(\log^* n) rounds with both deterministic and randomized distributed algorithms. - "Hard": requires at least Ω(logn)\Omega(\log n) rounds with deterministic and Ω(loglogn)\Omega(\log \log n) rounds with randomized distributed algorithms. Hence for any parameterized LCL problem, when we move from local problems towards global problems, there is some point at which complexity suddenly jumps from easy to hard. For example, for vertex coloring in dd-regular graphs it is now known that this jump is at precisely dd colors: coloring with d+1d+1 colors is easy, while coloring with dd colors is hard. However, it is currently poorly understood where this jump takes place when one looks at defective colorings. To study this question, we define kk-partial cc-coloring as follows: nodes are labeled with numbers between 11 and cc, and every node is incident to at least kk properly colored edges. It is known that 11-partial 22-coloring (a.k.a. weak 22-coloring) is easy for any d1d \ge 1. As our main result, we show that kk-partial 22-coloring becomes hard as soon as k2k \ge 2, no matter how large a dd we have. We also show that this is fundamentally different from kk-partial 33-coloring: no matter which k3k \ge 3 we choose, the problem is always hard for d=kd = k but it becomes easy when dkd \gg k. The same was known previously for partial cc-coloring with c4c \ge 4, but the case of c<4c < 4 was open

    Malar augmentation with zygomatic osteotomy in orthognatic surgery: Bone and soft tissue changes threedimensional evaluation: Malar Augmentation in Orthognatic Surgery

    Get PDF
    Background: The aim of this prospective study is to objectively assess 3D soft tissue and bone changes of the malar region by using the malar valgization osteotomy in concomitant association with orthognatic surgery. Materials and methods: From January 2015 to January 2018, 10 patients who underwent single stage bilateral malar valgization osteotomy in conjunction with maxillo-mandibular orthognatic procedures for aesthetic and functional correction were evaluated. Clinical and surgical reports were collected and patient satisfaction was evaluated with a VAS score. For each patient, maxillofacial CT-scans were collected 1 month preoperatively (T0) and 6 months after the operation (T1). DICOM data were imported and elaborated in the software MatLab, which creates a 3D soft tissue model of the face. 3D Bone changes were assessed importing DICOM data into iPlan (BrainLAB 3.0) software and the superimposition process was achieved using autofusion. Descriptive statistical analyses were obtained for soft tissue and bone changes. Results: Considering bone assessment the comparison by superimposition between T0 and T1 showed an increase of the distance between bilateral malar prominence (Pr – Pl) and a slight forward movement (87,65 ± 1,55 to 97,60 ± 5,91); p-value 0.007. All of the patients had improvement of α angle, ranging from 36,30 ± 1,70 to 38,45 ± 0,55, p-value 0,04 (αr) and 36,75 ± 1,58 to 38,45 ± 0,35; p-value 0,04 (αl). The distance S increased from 78,05 ± 2,48 to 84,2 ± 1,20; p-value 0,04 (Sr) and 78,65 ± 2,16 to 82,60 ± 0,90 (Sl); p-value 0,03. Considering the soft tissue, the comparison by superimposition between T0 and T1 showed an antero-lateral movement (p-value 0.008 NVL; p-value 0.001 NVR) of the malar bone projection together with an increase in width measurements (p-value 0,05 VL; p-value 0,01 VR). Angular measurement confirmed the pattern of the bony changes (p-value 0.034 αL; p-value 0,05 αR). Conclusion: The malar valgization osteotomy in conjunction with orthognatic surgery is effective in improving zygomatic projection contributing to a balanced facial correction in midface hypoplasia.3D geometrical based volume and surface analysis demonstrate an increase in transversal and forward direction. The osteotomy can be safely performed in conjunction with orthognatic procedures

    Algebraic damping in the one-dimensional Vlasov equation

    Get PDF
    We investigate the asymptotic behavior of a perturbation around a spatially non homogeneous stable stationary state of a one-dimensional Vlasov equation. Under general hypotheses, after transient exponential Landau damping, a perturbation evolving according to the linearized Vlasov equation decays algebraically with the exponent -2 and a well defined frequency. The theoretical results are successfully tested against numerical NN-body simulations, corresponding to the full Vlasov dynamics in the large NN limit, in the case of the Hamiltonian mean-field model. For this purpose, we use a weighted particles code, which allows us to reduce finite size fluctuations and to observe the asymptotic decay in the NN-body simulations.Comment: 26 pages, 8 figures; text slightly modified, references added, typos correcte

    Generic Modal Cut Elimination Applied to Conditional Logics

    Full text link
    We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide variety of logics outside the realm of normal modal logic. We give extensive example instantiations of our framework to various conditional logics. For these, we obtain fully internalised calculi which are substantially simpler than those known in the literature, along with leaner proofs of cut elimination and complexity. In one case, conditional logic with modus ponens and conditional excluded middle, cut elimination and complexity were explicitly stated as open in the literature

    Economics of End-of-Life Materials Recovery: A Study of Small Appliances and Computer Devices in Portugal

    Get PDF
    The challenges brought on by the increasing complexity of electronic products, and the criticality of the materials these devices contain, present an opportunity for maximizing the economic and societal benefits derived from recovery and recycling. Small appliances and computer devices (SACD), including mobile phones, contain significant amounts of precious metals including gold and platinum, the present value of which should serve as a key economic driver for many recycling decisions. However, a detailed analysis is required to estimate the economic value that is unrealized by incomplete recovery of these and other materials, and to ascertain how such value could be reinvested to improve recovery processes. We present a dynamic product flow analysis for SACD throughout Portugal, a European Union member, including annual data detailing product sales and industrial-scale preprocessing data for recovery of specific materials from devices. We employ preprocessing facility and metals pricing data to identify losses, and develop an economic framework around the value of recycling including uncertainty. We show that significant economic losses occur during preprocessing (over $70 M USD unrecovered in computers and mobile phones, 2006–2014) due to operations that fail to target high value materials, and characterize preprocessing operations according to material recovery and total costs.Portuguese Foundation for International Cooperation in Science, Technology and Higher EducationMIT Portugal Progra
    corecore