Corrosion prevention of mild steel in acidic medium by 2-Pyrrolidin-1-yl-1,3-thiazole-5-carboxylic acid: Theoretical and experimental approach

The inhibition efficiency of 2-Pyrrolidin-1-yl-1,3-thiazole-5-carboxylic acid (PTCA) against mild steel (MS) corrosion was investigated in acidic solution by using quantum chemical calculations based on Density Functional Theory (DFT) method and electrochemical measurements. The electrochemical impedance spectroscopy (EIS), potentiodynamic, potential zero charge (pzc) analysis and electrochemical noise (EN) measurements at various concentrations (from 0.1 to 10 mM) and immersion times were utilized in experimental part. The surface analysis was achieved scanning electron microscope (SEM) and contact angle measurements in the absence and presence of 10 mM PTCA. According to DFT results, PTCA exhibited 3.737 eV band gap and 8.130 Debye dipole moment which were a signal of potentially convenient corrosion inhibitor properties. PTCA has a remarkable corrosion inhibition capability to mild steel, which inhibited both anodic and cathodic corrosion rates, relying on it's physically adsorption on the metal solution interface and protection ability was increased with increasing PTCA concentration. The obtained adsorption equilibrium constant was 11.11 × 10³ M^-1 and calculated standard free energy of adsorption was ?33.03 kJ mol^?1. The determined activation energy values were 55.58 kJ mol^?1 and 96.86 kJ mol^?1 in 0.5 M HCl in the absence and presence of 10 mM PTCA, respectively. PTCA demonstrated a strong inhibition efficiency of 98.3%, after 168 h immersion, according to the EIS results. As a consequently, we recommend that PTCA is a convenient inhibitor in 0.1 M HCl for mild steel protection against corrosion.     

Three-dimensional polarization-independent visible-frequency carpet invisibility cloak

We miniaturize all features in a previously introduced polarization-independent three-dimensional carpet invisibility cloak by more than a factor of 2. This leads to operation wavelengths in the visible. The structures are characterized by electron and optical microscopy. In contrast to our previous work at IR wavelengths, we can directly measure two-dimensional images at visible frequencies, perform control experiments from the backside, and compare the images with theory. We find excellent agreement. Furthermore, we study the wavelength dependence in the range from 900 nm down to 500 nm. Cloaking action deteriorates as the woodpile stop band at around 575 nm is approached.     

Viscous dissipation effect on heat transfer characteristics of rectangular microchannels under slip flow regime and H1 boundary conditions

Viscous dissipation effect on heat transfer characteristics of a rectangular microchannel is studied. Flow is governed by the Navier–Stokes equations with the slip flow and temperature jump boundary conditions. Integral transform technique is applied to derive the temperature distribution and Nusselt number. The velocity distribution is taken from literature. The solution method is verified for the case where viscous dissipation is neglected. It is found that, the viscous dissipation is negligible for gas flows in microchannels, since the contribution of this effect on Nu number is about 1%. However, this effect should be taken into account for much more viscous flows, such as liquid flows. Neglecting this effect for a flat microchannel with an aspect ratio of 0.1 for Br=0.04 underestimates the Nu number about 5%.     

Requiem for the Miller–Tucker–Zemlin subtour elimination constraints?

The Miller–Tucker–Zemlin (MTZ) Subtour Elimination Constraints (SECs) and the improved version by Desrochers and Laporte (DL) have been and are still in regular use to model a variety of routing problems. This paper presents a systematic way of deriving inequalities that are more complicated than the MTZ and DL inequalities and that, in a certain way, “generalize” the underlying idea of the original inequalities. We present a polyhedral approach that studies and analyses the convex hull of feasible sets for small dimensions. This approach allows us to generate generalizations of the MTZ and DL inequalities, which are “good” in the sense that they define facets of these small polyhedra. It is well known that DL inequalities imply a subset of Dantzig–Fulkerson–Johnson (DFJ) SECs for two-node subsets. Through the approach presented, we describe a generalization of these inequalities which imply DFJ SECs for three-node subsets and show that generalizations for larger subsets are unlikely to exist. Our study presents a similar analysis with generalizations of MTZ inequalities and their relation with the lifted circuit inequalities for three node subsets.     

Monetary policy rules in practice: Re-examining the case of Turkey

This paper investigates possible asymmetries in the monetary policy reaction function of the Central Bank of Republic of Turkey over the business cycles. It is found that the bank reacted more aggressively towards output stabilisation during recessions than expansions. The empirical evidence suggests that the inflation targeting policy of the Turkish Central Bank was accommodative rather than stabilising. Furthermore, it is found that although the Central Bank of Republic of Turkey responded to foreign reserves, real exchange rates and short-term capital inflows both in expansion and recession periods, the bank targeted money growth, budget deficits, and net foreign assets only in expansion periods.     

The bi-objective Pollution-Routing Problem

The bi-objective Pollution-Routing Problem is an extension of the Pollution-Routing Problem (PRP) which consists of routing a number of vehicles to serve a set of customers, and determining their speed on each route segment. The two objective functions pertaining to minimization of fuel consumption and driving time are conflicting and are thus considered separately. This paper presents an adaptive large neighborhood search algorithm (ALNS), combined with a speed optimization procedure, to solve the bi-objective PRP. Using the ALNS as the search engine, four a posteriori methods, namely the weighting method, the weighting method with normalization, the epsilon-constraint method and a new hybrid method (HM), are tested using a scalarization of the two objective functions. The HM combines adaptive weighting with the epsilon-constraint method. To evaluate the effectiveness of the algorithm, new sets of instances based on real geographic data are generated, and a library of bi-criteria PRP instances is compiled. Results of extensive computational experiments with the four methods are presented and compared with one another by means of the hypervolume and epsilon indicators. The results show that HM is highly effective in finding good-quality non-dominated solutions on PRP instances with 100 nodes.     

Montgomery Multiplication in GF(2k)

We show that the multiplication operation c=a · b · r^-1 in the field GF(2^k can be implemented significantly faster in software than the standard multiplication, where r is a special fixed element of the field. This operation is the finite field analogue of the Montgomery multiplication for modular multiplication of integers. We give the bit-level and word-level algorithms for computing the product, perform a thorough performance analysis, and compare the algorithm to the standard multiplication algorithm in GF(2^k. The Montgomery multiplication can be used to obtain fast software implementations of the discrete exponentiation operation, and is particularly suitable for cryptographic applications where k is large.     

An adaptive large neighborhood search heuristic for the Pollution-Routing Problem

The Pollution-Routing Problem (PRP) is a recently introduced extension of the classical Vehicle Routing Problem with Time Windows which consists of routing a number of vehicles to serve a set of customers, and determining their speed on each route segment so as to minimize a function comprising fuel, emission and driver costs. This paper presents an adaptive large neighborhood search for the PRP. Results of extensive computational experimentation confirm the efficiency of the algorithm.