Thermodynamics of the complexing of uranyl ions with 1-phenyl-3-methyl-4-benzoylpyrazolone-5 in aqueous dioxane

The thermodynamics of the complexing between hexavalent U and 1-phenyl-3-methyl-4-benzoylpyrazolone-5 (PMBP) have been studied in 70 vol% aqueous—dioxane medium at 25 and 35±0.1°C following the Bjerrum—Calvin pH titration technique, as applied by Van Uitert and Haas. The ligand is mono-protonic. The refinement of results of formation constants has been accomplished by the method of least squares treatment after an algebraic transformation. The formation of 1:1, 1:2 and 1:3 complexes has been observed, the order of stability being log K₁ > log K₂ > log K₃. The stability invariably increases with an increase in temperature both in aqueous as well as aqueous dioxane media. The changes in ΔG⁰, ΔH⁰ and ΔS⁰ at 25 and 35°C for the overall equilibrium constants have also been evaluated. Uranyl complexes of PMBP are entropy stabilized, the values of enthalpy changes being positive. Other factors which affect chelate stability are briefly discussed.     

Synthesis and characterization of ternary nanocomposites of TiO2/rGO/CdS as an efficient catalyst for photo-degradation of methyl orange

Novel ternary composite photocatalysts have been successfully prepared by TiO₂ nanofibers, reduced graphene oxide, and CdS nanoparticles (TiO₂/rGO/CdS) by using electrospinning technique with easy chemical methods. The structures and their properties are examined by X-ray diffraction (XRD), Fourier transform infrared (FTIR) spectroscopy, Raman spectroscopy, X-ray photoelectron spectroscopy (XPS), and field-emission scanning electron microscope (FESEM). The structural characterization of the composite reveals that pure TiO₂ NFs and CdS NPs crystalline very well and the reduced graphene oxide is tightly composed with TiO₂ NFs and CdS Nps. The photodegradation of methyl orange (MO) under UV light illumination is significantly enhanced compared with that of bare materials. This ternary composite degrades methyl orange within 75 min. The enhanced photocatalytic degradation performance resulted from effective separation of e–h pairs with rGO sheets and also contributed for high rate degradation efficiency. This novel ternary composite has a potential application of wastewater purification and utilization for energy conversions.     

Acetylene-Mediated Borophosphene Dirac Materials as Efficient Anode Materials for Lithium-Ion Batteries

Generally, graphynes have been generated by the insertion of acetylenic content (−C≡C−) in the graphene network in different ratios. Also, several aesthetically pleasing architectures of two-dimensional (2D) flatlands have been reported with the incorporation of acetylenic linkers between the heteroatomic constituents. Prompted by the experimental realization of boron phosphide, which has provided new insights on the boron-pnictogen family, we have modelled novel forms of acetylene-mediated borophosphene nanosheets by joining the orthorhombic borophosphene stripes with different widths and with different atomic constituents using acetylenic linkers. Structural stabilities and properties of these novel forms have been assessed using first-principles calculations. Investigation of electronic band structure elucidates that all the novel forms show the linear band crossing closer to the Fermi level at Dirac point with distorted Dirac cones. The linearity in the hole and electronic bands impose the high Fermi velocity to the charge carriers close to that of graphene. Finally, we have also unravelled the propitious features of acetylene-mediated borophosphene nanosheets as anodes in Li-ion batteries.     

2-(Phenyltelluromethyl)tetrahydrofuran (L) and 2-(2-{4-methoxyphenyl}telluroethyl)-1,3- dioxolane (L) and their palladium(II) and platinum(II) complexes

The nucleophile [ArTe⁻] generated in situ borohydride solution of Ar₂Te₂, reacts with 2-(chloromethyl) tetrahydrofuran and 2-(2-bromoethyl)-1,3-dioxolane resulting in L¹ and L², respectively. The complexes of palladium(II) and platinum(II) with L¹/L² having stoichiometries [MCl₂·L₂], [ML₂](ClO₄)₂, [(DPPE)ML₂](ClO)₄)₂, [(PPh₃)₂ML₂](ClO₄)₂ and [(phen)ML₂](ClO₄)₂ (where L = L¹/L² DPPE = Ph₂PC H₂CH₂PPh₂, PHEN = 1,10-phenanthroline and M = Pd/Pt) have been synthesized. IR, ¹H, ¹²⁵Te{¹H} and ³¹P{¹H} NMR and UV-vis spectral data of these species in conjunction with their molar conductance and molecular weight data have been used to authenticate the new species. In all complexes (1–20) the ligands L¹ and L² are coordinated through tellurium and in the complexes of formula [ML₂](ClO₄)₂ (M = Pd, Pt) the ligand is bidentate with the oxygen atom used in complexation. In solution, complexes PtCl₂L₂ exist as a mixture of cis and trans isomers whereas only the trans isomer was observed for the palladium analogues. The [(phen)PdL₂](ClO₄)₂(Q) quenches ¹O₂ readily. The plot of log [Q] vs time is linear. Mechanism compatible with the experimental observations is proposed.     

Relative Stanley–Reisner theory and Upper Bound Theorems for Minkowski sums

In this paper we settle two long-standing questions regarding the combinatorial complexity of Minkowski sums of polytopes: We give a tight upper bound for the number of faces of a Minkowski sum, including a characterization of the case of equality. We similarly give a (tight) upper bound theorem for mixed facets of Minkowski sums. This has a wide range of applications and generalizes the classical Upper Bound Theorems of McMullen and Stanley.Our main observation is that within (relative) Stanley–Reisner theory, it is possible to encode topological as well as combinatorial/geometric restrictions in an algebraic setup. We illustrate the technology by providing several simplicial isoperimetric and reverse isoperimetric inequalities in addition to our treatment of Minkowski sums.     

A Randomized Parallel Algorithm for Single-Source Shortest Paths

We give a randomized parallel algorithm for computing single-source shortest paths in weighted digraphs. We show that the exact shortest-path problem can be efficiently reduced to solving a series of approximate shortest-path subproblems. Our algorithm for the approximate shortest-path problem is based on the technique used by Ullman and Yannakakis in a parallel algorithm for breadth-first search.     

A fractional programming approach for retail category price optimization

We present a new mixed-integer programming (MIP) approach to study certain retail category pricing problems that arise in practice. The motivation for this research arises from the need to design innovative analytic retail optimization techniques at Oracle Corporation to not only predict the empirical effect of price changes on the overall sales and revenue of a category, but also to prescribe optimal dynamic pricing recommendations across a category or demand group. A multinomial logit nonlinear optimization model is developed, which is recast as a discrete, nonlinear fractional program (DNFP). The DNFP model employs a bi-level, predictive modeling framework to manage the empirical effects of price elasticity and competition on sales and revenue, and to maximize the gross-margin of the demand group, while satisfying certain practical side-constraints. This model is then transformed by using the Reformulation–Linearization Technique in tandem with a sequential bound-tightening scheme to recover an MIP formulation having a relatively tight underlying linear programming relaxation, which can be effectively solved by any commercial optimization software package. We present sample computational results using randomly generated instances of DNFP having different constraint settings and price range restrictions that are representative of common business requirements, and analyze the empirical effects of certain key modeling parameters. Our results indicate that the proposed retail price optimization methodology can be effectively deployed within practical retail category management applications for solving DNFP instances that typically occur in practice.     

Deriving crisp and consistent priorities for fuzzy AHP-based multicriteria systems using non-linear constrained optimization

Fuzzy optimization models are used to derive crisp weights (priority vectors) for the fuzzy analytic hierarchy process (AHP) based multicriteria decision making systems. These optimization models deal with the imprecise judgements of decision makers by formulating the optimization problem as the system of constrained non linear equations. Firstly, a Genetic Algorithm based heuristic solution for this optimization problem is implemented in this paper. It has been found that the crisp weights derived from this solution for fuzzy-AHP system, sometimes lead to less consistent or inconsistent solutions. To deal with this problem, we have proposed a consistency based constraint for the optimization models. A decision maker can set the consistency threshold value and if the solution exists for that threshold value then crisp weights can be derived, otherwise it can be concluded that the fuzzy comparison matrix for AHP is not consistent for the given threshold. Three examples are considered to demonstrate the effectiveness of the proposed method. Results with the proposed constraint based fuzzy optimization model are more consistent than the existing optimization models.