One-Electron Reduction of 2-Nitrotoluene, Nitrocyclopentane, and 1-Nitrobutane in Room Temperature Ionic Liquids: A Comparative Study of Butler–Volmer and Symmetric Marcus–Hush Theories Using Microdisk Electrodes

The voltammetry for the reduction of 2-nitrotoluene at a gold microdisk electrode is reported in two ionic liquids: trihexyltetradecylphosphonium tris(pentafluoroethyl)trifluorophosphate ([P-14,P-6,P-6,P-6][FAP]) and 1-ethyl-3-methylimidazolium bis[(trifluoromethyl)sulfonyl]imide ([Emim][NTf2]). The reduction of nitrocyclopentane (NCP) and 1-nitrobutane (BuN) was investigated using voltammetry at a gold microdisk electrode in the ionic liquid [P-14,P-6,P-6,P-6][FAP]. Simulated voltammograms, generated through the use of ButlerVolmer theory and symmetric MarcusHush theory, were compared to experimental data, with both theories parametrizing the data similarly well. An experimental value for the Marcusian parameter, 1 was also determined in all cases. For the reduction of 2-nitrotoluene, this was 0.5 +/- 0.1 eV in both solvents, while for NCP and BuN in [P-14,P-6,P-6,P-6][FAP], it was 2 +/- 0.1 and 5 +/- 0.1 eV, respectively. This is attributed to the localization of charge on the nitro group and the primary nitro alkyls increased interaction with the environment, resulting in a larger reorganization energy.

STRIBOB: Authenticated Encryption from GOST R 34.11-2012 LPS Permutation.

Authenticated encryption algorithms protect both the confidentiality and integrity of messages in a single processing pass. We show how to utilize the L◦P ◦S transform of the Russian GOST R 34.11-2012 standard hash “Streebog” to build an efficient, lightweight algorithm for Authenticated Encryption with Associated Data (AEAD) via the Sponge construction. The proposed algorithm “StriBob” has attractive security properties, is faster than the Streebog hash alone, twice as fast as the GOST 28147-89 encryption algorithm, and requires only a modest amount of running-time memory. StriBob is a Round 1 candidate in the CAESAR competition.

A new Nawaz–Enscore–Ham-based heuristic for permutation flow-shop problem with bicriteria of makespan and machine idle-time

A new heuristic based on Nawaz–Enscore–Ham (NEH) algorithm is proposed for solving permutation flowshop scheduling problem in this paper. A new priority rule is proposed by accounting for the average, mean absolute deviation, skewness and kurtosis, in order to fully describe the distribution style of processing times. A new tie-breaking rule is also introduced for achieving effective job insertion for the objective of minimizing both makespan and machine idle-time. Statistical tests illustrate better solution quality of the proposed algorithm, comparing to existing benchmark heuristics.