TY - JOUR A1 - Raman Venkatesan, Thulasinath A1 - Smykalla, David A1 - Ploss, Bernd A1 - Wübbenhorst, Michael A1 - Gerhard, Reimund T1 - Tuning the relaxor-ferroelectric properties of Poly(vinylidene fluoride-trifluoroethylene-chlorofluoroethylene) Terpolymer films by means of thermally induced micro- and nanostructures JF - Macromolecules : a publication of the American Chemical Society N2 - The effects of thermal processing on the micro- and nanostructural features and thus also on the relaxor-ferroelectric properties of a P(VDF-TrFE-CFE) terpolymer were investigated in detail by means of dielectric experiments, such as dielectric relaxation spectroscopy (DRS), dielectric hysteresis loops, and thermally stimulated depolarization currents (TSDCs). The results were correlated with those obtained from differential scanning calorimetry (DSC), wide-angle X-ray diffraction (WAXD), and Fourier-transform infrared spectroscopy (FTIR). The results from DRS and DSC show that annealing reduces the Curie transition temperature of the terpolymer, whereas the results from WAXD scans and FTIR spectra help to understand the shift in the Curie transition temperatures as a result of reducing the ferroelectric phase fraction, which by default exists even in terpolymers with relatively high CFE contents. In addition, the TSDC traces reveal that annealing has a similar effect on the midtemperature transition by altering the fraction of constrained amorphous phase at the interphase between the crystalline and the amorphous regions. Changes in the transition temperatures are in turn related to the behavior of the hysteresis curves on differently heat-treated samples. During heating, evolution of the hysteresis curves from ferroelectric to relaxor-ferroelectric, first exhibiting single hysteresis loops and then double hysteresis loops near the Curie transition of the sample, is observed. When comparing the dielectric-hysteresis loops obtained at various temperatures, we find that annealed terpolymer films show higher electric-displacement values and lower coercive fields than the nonannealed sample, irrespective of the measurement temperature, and also exhibit ideal relaxor- ferroelectric behavior at ambient temperatures, which makes them excellent candidates for applications at or near room temperature. By tailoring the annealing conditions, it has been shown that the application temperature could be increased by fine tuning the induced micro- and nanostructures. KW - Annealing (metallurgy) KW - Hysteresis KW - Insulators KW - Phase transitions KW - Polarization Y1 - 2022 U6 - https://doi.org/10.1021/acs.macromol.2c00302 SN - 0024-9297 SN - 1520-5835 VL - 55 IS - 13 SP - 5621 EP - 5635 PB - American Chemical Society CY - Washington ER - TY - JOUR A1 - Bordihn, Henning A1 - Mitrana, Victor A1 - Negru, Maria C. A1 - Paun, Andrei A1 - Paun, Mihaela T1 - Small networks of polarized splicing processors are universal JF - Natural computing : an innovative journal bridging biosciences and computer sciences ; an international journal N2 - In this paper, we consider the computational power of a new variant of networks of splicing processors in which each processor as well as the data navigating throughout the network are now considered to be polarized. While the polarization of every processor is predefined (negative, neutral, positive), the polarization of data is dynamically computed by means of a valuation mapping. Consequently, the protocol of communication is naturally defined by means of this polarization. We show that networks of polarized splicing processors (NPSP) of size 2 are computationally complete, which immediately settles the question of designing computationally complete NPSPs of minimal size. With two more nodes we can simulate every nondeterministic Turing machine without increasing the time complexity. Particularly, we prove that NPSP of size 4 can accept all languages in NP in polynomial time. Furthermore, another computational model that is universal, namely the 2-tag system, can be simulated by NPSP of size 3 preserving the time complexity. All these results can be obtained with NPSPs with valuations in the set as well. We finally show that Turing machines can simulate a variant of NPSPs and discuss the time complexity of this simulation. KW - Computing with DNA KW - Splicing KW - Splicing processor KW - Polarization KW - 2-tag system KW - Turing machine Y1 - 2018 U6 - https://doi.org/10.1007/s11047-018-9691-0 SN - 1567-7818 SN - 1572-9796 VL - 17 IS - 4 SP - 799 EP - 809 PB - Springer CY - Dordrecht ER -