Borate adsorption at Pt(111) in acidic medium

The adsorption/desorption process of borate was studied at Pt(111) in acidic solution by cyclic voltammetry. A so-called butterfly wave in the cyclic voltammogram of Pt(111) in HClO₄ shifted to negative direction upon the addition of boric acid with the disappearance of its sharp spikes. The shift in potential was found to be −57 mV with a tenfold increase of boric acid concentration. This illustrates that this anomalous wave is due to borate adsorption/desorption by a one-electron transfer process. The borate adsorption/desorption wave was observed to shift by −63 mV/pH. At pH>3, the anomalous wave splits forming two separate waves, depending on the pH and the scan rate. The appearance of two waves is assigned to the change in the adsorption mode of borate or the participation of OH in the adsorption process.     

Coordination of solvent molecules to VO(acac)<Subscript>2</Subscript> complexes in solution studied by hyperfine sublevel correlation spectroscopy and pulsed electron nuclear double resonance

Interactions and binding sites of the solvent molecules chloroform and ethanol to bis(acetylacetonate)oxovanadium(IV) (VO(acac)₂) complexes in (frozen) solutions have been investigated by pulsed electron nuclear double resonance, sum peak electron spin echo envelope modulation and hyperfine sublevel correlation spectroscopy. The experimental proton hyperfine coupling data of coordinating solvent molecules have been interpreted using quantum chemical calculations (density functional theory). Experimental and computed hyperfine couplings indicate that ethanol coordinates to vanadium in the equatorial plane of VO(acac)₂ and chloroform interacts via hydrogen bonding to oxygens of the acac ligands.     

Indium(I) bromide-mediated coupling of dibromoacetonitrile with aldehydes followed by Boord elimination of bromine and oxygen of β-bromo alkoxides for preparation of 3-organyl-2-alkenenitriles

The organoindium compound derived from indium monobromide and dibromoacetonitrile reacts with carbonyl compounds to afford the corresponding 2-bromo-2-cyano-indium(III) alkoxide. The action of a second equivalent of indium monobromide onto the alkoxides derived from aldehydes promotes the Boord elimination of the β-related oxygen and bromine atoms leading to 2-alkenenitriles.     

Infinite-server systems with Hawkes arrivals and Hawkes services

Queueing Systems - This paper is devoted to the study of the number of customers in infinite-server systems driven by Hawkes processes. In these systems, the self-exciting arrival process is...     

Orientation control of perovskite thin films on glass substrates by the application of a seed layer prepared from oxide nanosheets

Orientation control of perovskite compounds was investigated by the application of a seed layer prepared from oxide nanosheets. An aqueous suspension of oxide nanosheets was prepared by the exfoliation of a layered compound of KCa₂Nb₃O₁₀ oxide grains. A seed layer composed of (TBA)Ca₂Nb₃O₁₀ nanosheets (TBA = tetrabutylammonium) was formed on a glass substrate by simply dip coating it in the suspension. Two kinds of perovskite compounds, LaNiO₃ (LNO) and Pb(Zr,Ti)O₃ (PZT) with a preferred orientation of (00l) were successfully grown on this seeded glass substrate. In this study, the relation between lattice mismatch and electrical properties is investigated. A large, oriented PZT film with a size of 5 ×4 cm shows an improved P-E hysteresis behavior by use of this orientation control.     

汽车滚装码头泊位调度优化模型与算法研究

本文研究滚装码头混合泊位分配和劳动力分配的联合调度优化问题。首先,考虑潮汐时间窗约束、装卸劳动力约束、泊位缆桩分布约束以及泊位不规则布局因素,建立以最小化船舶总服务时间为目标的混合整数规划模型。其次,采用内外嵌套算法设计策略,提出求解该类问题的组合算法。其中,外层是多种群并行进化的遗传算法,生成多种船舶计划顺序,内层为基于规则的启发式算法,用于计算给定计划顺序的目标函数值。然后,基于实际运营数据,生成多组不同规模的算例进行全面数值实验,结果表明所提出的算法可在10分钟内求解包含50艘船、100个泊段的算例。最后,开展基于真实滚装码头运营实例的案例分析,对所提模型和算法在实际码头调度问题中的适用性与高效性进行验证。     

Safety Stock Determination with Serially Correlated Demand in a Periodic-Review Inventory System

We consider a periodic-review inventory replenishment model with an order-up-to-R operating doctrine for the case of deterministic lead times and a covariance-stationary stochastic demand process. A method is derived for setting the inventory safety stock to achieve an exact desired stockout probability when the autocovariance function for Gaussian demand is known. Because the method does not require that parametric time-series models be fit to the data, it is easily implemented in practice. Moreover, the method is shown to be asymptotically valid when the autocovariance function of demand is estimated from historical data. The effects on the stockout rate of various levels of autocorrelated demand are demonstrated for situations in which autocorrelation in demand goes undetected or is ignored by the inventory manager. Similarly, the changes to the required level of safety stock are demonstrated for varying levels of autocorrelation.     

Optimal Control of an <Emphasis Type="Italic">M/E</Emphasis><Subscript><Emphasis Type="Italic">k</Emphasis></Subscript>/1 Queueing System with a Removable Service Station

This paper studies the optimal operation of an M/E _k /1 queueing system with a removable service station under steady-state conditions. Analytic closed-form solutions of the controllable M/E _k /1 queueing system are derived. This is a generalization of the controllable M/M/1, the ordinary M/E _k /1, and the ordinary M/M/1 queueing systems in the literature. We prove that the probability that the service station is busy in the steady-state is equal to the traffic intensity. Following the construction of the expected cost function per unit time, we determine the optimal operating policy at minimum cost.     

An Algorithm for the Economic Design of <Emphasis Type="Italic">np</Emphasis> Charts for a Multiplicity of Assignable Causes

Chiu, in 1976, studied the economic design of np charts for processes subject to a multiplicity of assignable causes. Chiu developed a two-step minimization procedure to obtain the three control variables, namely, the sampling interval, the sample size and the acceptance number. Although Chiu's two-step minimization procedure is simple, applicable and down to earth, it is rather inefficient and has some drawbacks. This paper presents an algorithm to overcome these drawbacks. The results and the execution times of all numerical examples show that the accuracy and the efficiency of the algorithm is reasonably good.     

A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs

We consider a scheduling problem where a set of n jobs has to be processed on a set of m machines and arbitrary precedence constraints between operations are given. Moreover, for any two operations i and j values a _ij >0 and a _ji >0 may be given where a _ij is the minimal difference between the starting times of operations i and j when operation i is processed first. Often, the objective is to minimize the makespan but we consider also arbitrary regular criteria. Even the special cases of the classical job shop problem J//C_max belong to the set of NP-hard problems. Therefore, approximation or heuristic algorithms are necessary to handle large-dimension problems. Based on the mixed graph model we give a heuristic decomposition algorithm for such a problem, i.e. the initial problem is partitioned into subproblems that can be solved exactly or approximately with a small error bound. These subproblems are obtained by a relaxation of a subset of the set of undirected edges of the mixed graph. The subproblems are successively solved and a proportion of the results obtained for one subproblem is kept for further subproblem definitions. Numerical results of the algorithm presented here are given.