Determination of Electrical and Photoelectrical Properties of Schottky Diodes Made Using New Chitin Derivatives Synthesized as Interface Layer

Silicon - 5-(2,4-dichlorophenyl)-2-furoic acid and anthraquinone-2-carboxylic acid were reacted separately with chitin. The synthesized products were characterized by various spectroscopic methods...     

Environmentally friendly synthesis and photopolymerization of acrylated methyl ricinoleate for biomedical applications

In this study, we aimed to develop an efficient synthesis and photopolymerization of acrylated methyl ricinoleate (AMR) for biomedical applications. During the first step of the synthesis, methyl ricinoleate (MR) and boric acid were esterified via azeotropic distillation in toluene. Afterward, MR–boric acid ester was acrylated with acrylic acid at 165 °C via a boric acid ester acidolysis reaction. The bulk photopolymerization of AMR was performed in the presence of the photoinitiator 2,2-dimethoxy-2-phenyl acetophenone (DMPA) under 365 nm UV irradiation. Even with the use of 0.4% DMPA, a 35% monomer conversion was achieved within 30 min. Moreover, AMR, the plant-oil-based monomer, was also copolymerized with N-isopropyl acrylamide to obtain thermoresponsive hydrogels on the glass surface for biomedical applications. The synthesized materials were characterized by Fourier transform infrared (FTIR) spectroscopy, ¹H-NMR spectroscopy, and thermal characterization via thermogravimetric analysis (TGA) and differential scanning calorimetry techniques. The surfaces were characterized by FTIR and Energy Dispersive X-ray (EDS) spectroscopy. © 2019 Wiley Periodicals, Inc. J. Appl. Polym. Sci. 2019 , 136, 47969.     

Multichromic polymers based on pyrene clicked thienylpyrrole

In this study, the effect of pendant pyrene on the optical and electronic properties of poly(2,5‐dithienylpyrrole)s was studied. For this purpose a new pyrene coupled 2,5‐dithienylpyrrole derivative (SNS‐pyrene) was synthesized through click reaction. SNS‐pyrene was electrochemically polymerized and its electrochemical and optical properties were investigated by electrochemical and optical techniques. The polymer had a band gap of 3.36 eV and displayed light green to blue color variation upon oxidation in less than 2.48 s. Additionally, electrochemical copolymerization of SNS‐pyrene with 3,4‐ethylenedioxythiophene was achieved whilst a detailed investigation was performed on the effect of electrochemical polymerization conditions on the optoelectronic properties of the copolymers. Studies revealed that the copolymers exhibit multichromic reversible redox behavior with lower band gaps and shorter switching times than their parent polymer, P(SNS‐pyrene) © 2014 Society of Chemical Industry.     

Maximum Cardinality Search for Computing Minimal Triangulations of Graphs

We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical algorithms: LEX M and MCS. LEX M extends the fundamental concept used in Lex-BFS, resulting in an algorithm that not only recognizes chordality, but also computes a minimal triangulation of an arbitrary graph. MCS simplifies the fundamental concept used in Lex-BFS, resulting in a simpler algorithm for recognizing chordal graphs. The new algorithm MCS-M combines the extension of LEX M with the simplification of MCS, achieving all the results of LEX M in the same time complexity.     

FPGA implementations of fast Fourier transforms for real-time signal and image processing

Applications based on the fast Fourier transform (FFT), such as signal and image processing, require high computational power, plus the ability to experiment with algorithms. Reconfigurable hardware devices in the form of field programmable gate arrays (FPGAs) have been proposed as a way of obtaining high performance at an economical price. However, users must program FPGAs at a very low level and have a detailed knowledge of the architecture of the device being used. They do not therefore facilitate easy development of, or experimentation with, signal/image processing algorithms. To try to reconcile the dual requirements of high performance and ease of development, the paper reports on the design and realisation of a high level framework for the implementation of 1D and 2D FFTs for real-time applications. A wide range of FFT algorithms, including radix-2, radix-4, split-radix and fast Hartley transform (FHT) have been implemented under a common framework in order to enable system designers to meet different system requirements. Results show that the parallel implementation of 2D FFT achieves linear speed-up and real-time performance for large matrix sizes. Finally, an FPGA-based parametrisable environment based on 2D FFT is presented as a solution for frequency-domain image filtering application.     

Structural and magnetic characterization of norbornene-deuterated norbornene dicarboxylic acid diblock copolymers doped with iron oxide nanoparticles

A series of iron oxide doped norbornene (NOR)/deuterated norbornene dicarboxylic acid (NORCOOH) diblock copolymers were synthesized and characterized by X-ray photoelectron spectroscopy (XPS), small angle neutron scattering (SANS) and superconducting quantum interference device (SQUID) experiments. γ-Fe₂O₃ nanoparticles were synthesized within the microdomains of diblock copolymers with volume fractions of NOR/NORCOOH 0.64/0.36, 0.50/0.50 and 0.40/0.60. A spherical nanoparticle morphology was displayed in the polymer with 0.64/0.36 volume fraction. Polymers with 0.50/0.50 and 0.40/0.60 volume fractions exhibited interconnected metal oxide nanostructures. The observed changes in the shape and peak positions of the small-angle neutron scattering profiles of polymers after metal doping were related to the scattering from the metal oxide particles and to the possible deformed morphologies due to the strong interparticle interactions between metal particles, which may influence the polymer microphase separation. The combined scattering from both polymer domains and magnetic particles was depicted in SANS profiles of metal oxide doped polymers. γ-Fe₂O₃ containing block copolymers were superparamagnetic at room temperature. An increase in the blocking temperature (T_b) of interconnected nanoparticles was observed and was related to the interparticle interactions, which depends on the average distance (d) between particles and individual particle diameter (2R). The sample with volume fraction of 0.4/0.6 have the lowest d/(2R) ratio and exhibit the highest T_b at 115 K.     

Detecting Fixed Patterns in Chordal Graphs in Polynomial Time

The Contractibility problem takes as input two graphs G and H, and the task is to decide whether H can be obtained from G by a sequence of edge contractions. The Induced Minor and Induced Topological Minor problems are similar, but the first allows both edge contractions and vertex deletions, whereas the latter allows only vertex deletions and vertex dissolutions. All three problems are NP-complete, even for certain fixed graphs H. We show that these problems can be solved in polynomial time for every fixed H when the input graph G is chordal. Our results can be considered tight, since these problems are known to be W[1]-hard on chordal graphs when parameterized by the size of H. To solve Contractibility and Induced Minor, we define and use a generalization of the classic Disjoint Paths problem, where we require the vertices of each of the k paths to be chosen from a specified set. We prove that this variant is NP-complete even when k=2, but that it is polynomial-time solvable on chordal graphs for every fixed k. Our algorithm for Induced Topological Minor is based on another generalization of Disjoint Paths called Induced Disjoint Paths, where the vertices from different paths may no longer be adjacent. We show that this problem, which is known to be NP-complete when k=2, can be solved in polynomial time on chordal graphs even when k is part of the input. Our results fit into the general framework of graph containment problems, where the aim is to decide whether a graph can be modified into another graph by a sequence of specified graph operations. Allowing combinations of the four well-known operations edge deletion, edge contraction, vertex deletion, and vertex dissolution results in the following ten containment relations: (induced) minor, (induced) topological minor, (induced) subgraph, (induced) spanning subgraph, dissolution, and contraction. Our results, combined with existing results, settle the complexity of each of the ten corresponding containment problems on chordal graphs.     

Graphs of linear clique-width at most 3

A graph has linear clique-width at most k if it has a clique-width expression using at most k labels such that every disjoint union operation has an operand which is a single vertex graph. We give the first characterisation of graphs of linear clique-width at most 3, and we give the first polynomial-time recognition algorithm for graphs of linear clique-width at most 3. In addition, we present new characterisations of graphs of linear clique-width at most 2. We also give a layout characterisation of graphs of bounded linear clique-width; a similar characterisation was independently shown by Gurski and by Lozin and Rautenbach.