The breakdown of the minimum polarizability principle in vibrational motions as an indicator of the most aromatic center

The vibrational motions that disobey the minimum polarizability principle (MPP) in pi-conjugated molecules are distortions of the equilibrium geometry that produce a reduction in the polarizability due to the localization of pi electrons. For aromatic species, this electronic localization is responsible for the subsequent reduction in the aromaticity of the system. In the present work, we diagonalize the Hessian matrix of the polarizability with respect to the vibrational nontotally symmetric normal coordinates, to calculate the nontotally symmetric distortions that produce the maximum breakdown of the MPP in a series of twenty polycyclic aromatic hydrocarbons. It is shown that the nuclear displacements that break the MPP have larger components in those rings that possess the highest local aromaticity. Thus, these vibrational motions can be used as an indicator of local aromaticity.     

The assessment of compliance with legal limits. Part 2. How to consider both type I and type II errors when working in the concentration domain

Considering the uncertainty of measurement when assessing compliance with reference values given in compositional specifications and statutory limits is still a controversial matter. In theory, assessing compliance requires considering both type I (false positive) and type II (false negative) errors. The more the concentration of the analyte in the sample under investigation is close to the allowed concentration limit, the more critical it is to consider both types of errors. This paper describes how this could be done. The matter is discussed in the light of the most recent literature information.     

Ab initio studies of the protonation of CO,N2 and NO+: Calculation of the minimum energy reaction paths

Ab initio molecular orbital calculations employing a 4-31G basis set have been used to study the minimum energy paths for the formation of HCO⁺, COH⁺, and HCOH²⁺ from CO by protonation. The protonation of N₂ to give NNH⁺ and HNNH²⁺ and of NO⁺ to form HNO²⁺ and NOH²⁺ have also been investigated. All species formed have linear equilibrium geometries and the minimum energy path for approach of the proton is along the line-of-centers of the heavy atoms. Energy barriers to the formation of the various species are given, where appropriate, and changes in geometry, ordering of molecular orbitals and orbital occupancy are discussed.     

Effect of bovine serum albumin on the surface properties of ionic liquid-type Gemini surfactant

The effect of bovine serum albumin on the surface properties of IL-type gemini surfactant ([C₁₀-4-C₁₀im]Br₂), have been investigated by surface tension method. The critical micelle concentration (CMC) as a function of BSA concentrations at various temperatures was investigated. The CMC of [C₁₀-4-C₁₀im]Br₂ increases with increasing the concentration of BSA as well as the temperature of the system. The interfacial parameters viz; maximum surface excess concentration (Γ_max), the minimum area per molecule (A_min), and surface pressure at CMC (Π_cmc) were calculated. In addition, thermodynamic parameters of adsorption and micellization were evaluated by using surface tension data. The results indicated that the binding of [C₁₀-4-C₁₀im]Br₂ to BSA is spontaneous and exothermic in nature. The process is entropy driven and hydrophobic interactions are the major driving forces.     

A safe minimum standard,the elasticity of substitution,and the cleanup of the Ganges in Varanasi

Despite repeated calls for a thorough cleanup of water pollution in the Ganges river, there are only two papers in the social sciences by Batabyal and Beladi (2017, 2019) that have shed theoretical light on this cleanup problem and its connection to the sustainability of tourism in Varanasi. Hence, we extend the above‐mentioned analyses and focus on two specific questions. First, we introduce the notion of a safe minimum standard (SMS) into the study and show how to analyze a probabilistic model of the Ganges cleanup problem when the SMS is accounted for. Second, for a representative citizen of Varanasi, we study how the magnitude of the elasticity of substitution between a composite consumption good and water quality in the Ganges—modeled by the SMS—affects the tradeoff between consumption and water quality maintenance.     

A semidefinite programming approach to the hypergraph minimum bisection problem

The hypergraph minimum bisection (HMB) problem is the problem of partitioning the vertices of a hypergraph into two sets of equal size so that the total weight of hyperedges crossing the sets is minimized. HMB is an NP-hard problem that arises in numerous applications – for example, in digital circuit design. Although many heuristics have been proposed for HMB, there has been no known mathematical program that is equivalent to HMB. As a means of shedding light on HMB, we study the equivalent, complement problem of HMB (called CHMB), which attempts to maximize the total weight of non-crossing hyperedges. We formulate CHMB as a quadratically constrained quadratic program, considering its semidefinite programming relaxation and providing computational results on digital circuit partitioning benchmark problems. We also provide results towards an approximation guarantee for CHMB.     

Two improved formulations for the minimum latency problem

In network problems, latency is associated with the metric used to evaluate the length of the path from a root vertex to each vertex in the network. In this work we are dealing with two applications or variations of the minimum latency problem known as the repairman problem and the deliveryman problem. We have developed two integer formulations for the minimum latency problem and compared them with other two formulations from the literature for the time-dependent traveling salesman problem. The present work highlights the similarities and differences between the different formulations. In addition, we discuss the convenience of including a set of constraints in order to reduce the computation time needed to reach the optimal solution. We have carried out extensive computational experimentation on asymmetrical instances, since they provide the characteristics of the deliveryman and repairman problems in a better way.     

基于有限非阿贝尔群的密钥交换

从一般线性群GL（n,F）和对称群Sn上的困难问题出发,构造了几个密钥交换算法,新算法具有更高的效率.同时,指出基于一般线性群的密钥交换算法的安全性直接依赖于广义矩阵覆盖问题,基于对称群的密钥交换协议的安全性直接依赖于置换群上的共轭问题.