On the accuracy of a nonlinear finite volume method for the solution of diffusion problems using different interpolations strategies

In this paper, we consider a nonlinear finite volume method to solve the steady‐state diffusion equation in nonhomogeneous and non‐isotropic media. The method is nonlinear even if the original problem is linear. In its original form, the scheme is monotone, because the coefficient matrix is monotone under certain assumptions and, as a consequence, whenever the analytic operator demands, it preserves the positivity of numerical solutions. On the other hand, the scheme is unable to reproduce piecewise linear solutions exactly. In order to recover this interesting feature, we use two different interpolation strategies. In this case, even though we are unable to prove monotonicity, we show some numerical evidences that the combined method has an improved behavior, producing second order accurate solutions, even for nonhomogeneous and strongly anisotropic media. Copyright © 2013 John Wiley & Sons, Ltd.     

Chiral separability of boron cluster species studied by screening approaches utilizing polysaccharide‐based chiral stationary phases

In this study, the screening steps of chiral separation strategies with polysaccharide‐based chiral stationary phases were applied on boron cluster compounds in normal‐phase liquid chromatography (NPLC) and polar organic solvents chromatography (POSC). Since the screening steps were initially developed to analyze organic compounds, their applicability for boron clusters was investigated. Overall, the screening steps in NPLC were applicable for the separation of zwitterions, while for anions mostly no elution was observed. A hypothesis for the latter behavior is precipitation of anions in the nonpolar mobile phases. Ten out of 11 compounds could be partially or baseline separated on the NPLC screening systems. In POSC, all zwitterions were separated on at least one of the screening systems, with an overall lower retention as in NPLC. Anions were detected but not separated in the majority of the experiments. Also their retention on the chiral stationary phases was very limited. This study showed that the chiral discrimination potential of chemically modified polysaccharides is meaningful for chiral separations of structurally chiral boron cluster species, but needs further systematic research, in which recognition mechanisms should be further explored. In addition, some unusual peaks also indicated that conditions with a high separation efficiency must first be searched for some of the tested systems. Copyright © 2014 John Wiley & Sons, Ltd.     

Superlinearly Convergent Infeasible-Interior-Point Algorithm for Degenerate LCP

A large-step infeasible path-following method is proposed for solving general linear complementarity problems with sufficient matrices. If the problem has a solution, the algorithm is superlinearly convergent from any positive starting points, even for degenerate problems. The algorithm generates points in a large neighborhood of the central path. Each iteration requires only one matrix factorization and at most three (asymptotically only two) backsolves. It has been recently proved that any sufficient matrix is a P _*()-matrix for some 0. The computational complexity of the algorithm depends on as well as on a feasibility measure of the starting point. If the starting point is feasible or close to being feasible, then the iteration complexity is . Otherwise, for arbitrary positive and large enough starting points, the iteration complexity is O((1 + )² nL). We note that, while computational complexity depends on , the algorithm itself does not.     

Optimal strategies for asset allocation and consumption under stochastic volatility

Selecting optimal asset allocation and consumption strategies is an important, but difficult, topic in modern finance. The dynamics is governed by a nonlinear partial differential equation. Stochastic volatility adds further complication. Even to obtain a numerical solution is challenging. Here, we develop a closed-form approximate solution. We show that our theoretical predictions for the optimal asset allocation strategy and the optimal consumption strategy are in surprisingly good agreement with the results from full numerical computations.     

Improved Deep Q-Network for User-Side Battery Energy Storage Charging and Discharging Strategy in Industrial Parks

Battery energy storage technology is an important part of the industrial parks to ensure the stable power supply, and its rough charging and discharging mode is difficult to meet the application requirements of energy saving, emission reduction, cost reduction, and efficiency increase. As a classic method of deep reinforcement learning, the deep Q-network is widely used to solve the problem of user-side battery energy storage charging and discharging. In some scenarios, its performance has reached the level of human expert. However, the updating of storage priority in experience memory often lags behind updating of Q-network parameters. In response to the need for lean management of battery charging and discharging, this paper proposes an improved deep Q-network to update the priority of sequence samples and the training performance of deep neural network, which reduces the cost of charging and discharging action and energy consumption in the park. The proposed method considers factors such as real-time electricity price, battery status, and time. The energy consumption state, charging and discharging behavior, reward function, and neural network structure are designed to meet the flexible scheduling of charging and discharging strategies, and can finally realize the optimization of battery energy storage benefits. The proposed method can solve the problem of priority update lag, and improve the utilization efficiency and learning performance of the experience pool samples. The paper selects electricity price data from the United States and some regions of China for simulation experiments. Experimental results show that compared with the traditional algorithm, the proposed approach can achieve better performance in both electricity price systems, thereby greatly reducing the cost of battery energy storage and providing a stronger guarantee for the safe and stable operation of battery energy storage systems in industrial parks.     

基于Tikhonov正则参量后验选择策略的PCS颗粒粒度反演方法

采用基于Morozov偏差原理的后验策略来选择最优正则参量,并采用此方法对单峰和多峰分布颗粒系的模拟电场自相关函数进行了反演,结果表明,对于单峰颗粒体系,当电场自相关函数的扰动误差小于0.05时,反演得到的峰值准确,当电场自相关函数的扰动误差大于0.05时,反演得到的峰值偏离所模拟的颗粒粒径.正则参量初始值在0.000 02～2范围内,在反演所得的峰值准确的基础上,正则参量初始值越小,反演得到的分布宽度越窄.收敛误差在0.000 05～50范围内,在保持反演结果稳定的基础上,收敛误差取值越大,反演得到的分布宽度越窄.对于多峰颗粒体系,当颗粒系中的颗粒粒径差别较小时,峰值向平均值偏移,当颗粒系中的颗粒粒径差别较大时,小颗粒粒径分布以噪音的形式出现.     

Zero-Sum Ergodic Semi-Markov Games with Weakly Continuous Transition Probabilities

Zero-sum ergodic semi-Markov games with weakly continuous transition probabilities and lower semicontinuous, possibly unbounded, payoff functions are studied. Two payoff criteria are considered: the ratio average and the time average. The main result concerns the existence of a lower semicontinuous solution to the optimality equation and its proof is based on a fixed-point argument. Moreover, it is shown that the ratio average as well as the time average payoff stochastic games have the same value. In addition, one player possesses an ε-optimal stationary strategy (ε>0), whereas the other has an optimal stationary strategy. A. Jaśkiewicz is on leave from Institute of Mathematics and Computer Science, Wrocław University of Technology. This work is supported by MNiSW Grant 1 P03A 01030.     

A mathematical model for the first-pass dynamics of antibiotics acting on the cardiovascular system

We present a preliminary first-pass dynamic model for delivery of drug compounds to the lungs and heart. We use a compartmental mass-balance approach to develop a system of nonlinear differential equations for mass accumulated in the heart as a result of intravenous injection. We discuss sensitivity analysis as well as methodology for minimizing mass in the heart while maximizing mass delivered to the lungs on a first circulatory pass.     

一类线性与框式约束凸规划问题的原始-对偶内点算法

本文对一类具有线性和框式约束的凸规划问题给出了一个原始-对偶内点算法, 该算法可在任一原始-对偶可行内点启动, 并且全局收敛,当初始点靠近中心路径时, 算法成为中心路径跟踪算法。 数值实验表明, 算法对求解大型的这类问题是有效的。     

不同推介模式下网络零售商广告策略研究

研究了不同推介模式下网络零售商的广告策略问题,通过Nash静态博弈方法求解无推介、单向推介以及双向推介三种模式下零售商均衡零售价格、广告努力水平及利润。研究发现:无推介情况下,两零售商均衡广告策略为同时投入广告。单向推介情况下,若利润分享比例较小,则两零售商同时投入广告;若利润分享比例较大,则随着广告成本系数的增大,两零售商均衡广告策略从仅有被推介零售商投入广告转变为同时投入广告。双向推介情况下,若广告成本系数较小,则两家零售商都不投入广告;若广告成本系数较大,则两家零售商同时投入广告。此外,还分析了零售商均衡广告策略下的推介动力问题。