An online fiber-optic UV-visible detector for continuous free-flow electrophoresis

A PC-controlled, scanning online UV detector for continuous free-flow electrophoresis (CFFE) was designed to allow for single UV wavelength monitoring across a 1-D array of 48 longitudinal flow cells interfaced to a CFFE apparatus. In the detection scheme, the UV light is sequentially passed through each of the flow cells. The design integrates online acquisition of absorbance spectra of components separated by CFFE. Benzoic acid standard solutions were used to examine the performance of the detector. Chloroquine diphosphate and 4-nitrophenol were used as test solutes to determine the detector's ability to distinguish analytes separated in the CFFE.     

Monitoring industrial wastewater by online GC-MS with direct aqueous injection

An online GC–MS-system for automated monitoring of crude wastewater at a complex chemical production site is presented. The modular system is, in principal, based on commercial equipment, but utilizes a special, two-stage injector, which consists of a splitless vaporization chamber on top of a PTV injector filled with Tenax. This set-up enables direct injection of wastewater. Almost 140 volatile and semi-volatile compounds are calibrated down to 1 mg L⁻¹, which is sufficient for analysis of the influent of the wastewater-treatment plant. Two instruments analyze alternately, every 20 min, and the instrument cycle time is 40 min. The quantitative results are transferred to a database which is connected to a process-control system. Depending on the nature and concentration of a compound, an alarm can be generated and the wastewater stream can be diverted into an “off spec tank” if necessary. The GC–MS-system operates quasi-continuously with a system availability >98%. Data quality is automatically controlled in each run and by daily analysis of a quality-control sample. The development of a novel stacked PTV–PTV injector design to expand the range of analytes to selected basic compounds is described.     

On the sum minimization version of the online bin covering problem

Given a set of m identical bins of size 1, the online input consists of a (potentially infinite) stream of items in (0,1]. Each item is to be assigned to a bin upon arrival. The goal is to cover all bins, that is, to reach a situation where a total size of items of at least 1 is assigned to each bin. The cost of an algorithm is the sum of all used items at the moment when the goal is first fulfilled. We consider three variants of the problem, the online problem, where there is no restriction of the input items, and the two semi-online models, where the items arrive sorted by size, that is, either by non-decreasing size or by non-increasing size. The offline problem is considered as well.     

Weak aggregating algorithm for the distribution-free perishable inventory problem

We formulate the multiperiod, distribution-free perishable inventory problem as a problem of prediction with expert advice and apply an online learning method (the Weak Aggregating Algorithm) to solve it. We show that the asymptotic average performance of this method is as good as that of any time-dependent stocking rule in a given parametric class.     

Joint decision on production and pricing for online dual channel supply chain system

Online dual channel supply chain system and its joint decision on production and pricing under information asymmetry are investigated. First, optimal production and pricing strategies are depicted according to the centralized system. Next, two kinds of contracts are designed for the decentralized system to coordinate the channel system, and their production and pricing decisions are depicted using a principle-agent method for the asymmetric information on the traditional channel. Finally, some interesting insights are found: the centralized system is not always being better than the decentralized system with a feasible contract if the traditional and professional retailer has lower selling cost. When uncertainty in the traditional channel information is higher, the manufacturer prefers a menu of contracts according to different channel settings. When uncertainty is lower, the manufacturer prefers a single contract. Furthermore, the higher the uncertainty in the traditional channel, the more the information welfare of the traditional retailer will gain. Performance with a menu of contracts cannot outperform that with a single contract integrating optimistic and pessimistic market setting well; their difference in performance is bigger when uncertainty in the traditional channel information is less.     

六氟偏磷酸锂的热分解动力

采用在线耦合TGA-FTIR技术,分别研究了非等温和等温两种条件下六氟磷酸锂(LiPF₆)的热分解动力学和其气态产物. 结果表明LiPF₆分解反应为单步反应,其产物为固态LiF和气态PF₅. 在两种条件下,LiPF₆分解动力学均遵循基于柱坐标对称的二维相界面移动模型. LiPF₆分解活化能为104 kJ/mol(非等温)和92 kJ/mol(等温).     

Structure and stability of online chat networks built on emotion-carrying links

High-resolution data of online chats are studied as a physical system in the laboratory in order to quantify collective behavior of users. Our analysis reveals strong regularities characteristic of natural systems with additional features. In particular, we find self-organized dynamics with long-range correlations in user actions and persistent associations among users that have the properties of a social network. Furthermore, the evolution of the graph and its architecture with specific k$k$-core structure are shown to be related with the type and the emotion arousal of exchanged messages. Partitioning of the graph by deletion of the links which carry high arousal messages exhibits critical fluctuations at the percolation threshold.     

Selecting optimal selling format of a product in B2C online auctions with boundedly rational customers

The advancement of Internet technology has enabled new formats for selling products in the B2C online auctions. At present, on the major online auction sites, there exist three popular selling formats, namely, the posted price, pure auction and buy-price auction formats. It is an important decision problem for a firm to select the most profitable format to sell its products through the Internet. The customer behavior is of course a crucial element of the decision process. To the best of our knowledge, most models available today assume that customers are perfectly rational. To better understand the decision process, in this paper, we incorporate the concept of bounded rationality into consideration. We first present a “behavior choice function” to characterize the behavior of the customers with bounded rationality. Then corresponding to each selling format, we construct a revenue model based on the bounded rationality for analysis. Finally, we conduct some elaborate computational experiments to investigate the performance of each revenue model for developing new managerial insights. Our computational results clearly demonstrate how the bounded rationality of customer behavior affects the choice of a preferable selling format for a B2C firm in an online auction.     

Competitive strategies for an online generalized assignment problem with a service consecution constraint

This work studies a variant of the online generalized assignment problem, where there are m ? 2 heterogeneous servers to process n requests which arrive one by one over time. Each request must either be assigned to one of the servers or be rejected upon its arrival, before knowing any information of future requests. There is a corresponding weight (or revenue) for assigning each request to a server, and the objective is to maximize the total weights obtained from all the requests. We study the above problem with a service consecution constraint, such that at any time each server is only allowed to process up to d consecutive requests.     

线上线下混合式实验教学模式的改革与探索

大学化学实验课程是培养材料、化学、化工等专业人才应用基本操作和理论解决实际问题的综合性实践训练环节。文章探讨了当前大学化学实验发展由于受到仪器设备大型化、专业化、成本大、更新快等因素限制出现瓶颈,设计了线上线下混合实验教学模式,进行相应的软硬件建设,并开展线上线下混合式实验教学模式的改革与探索。该教学模式具有良好的教学效果,并且可复制可推广,为创新人才的培养和实验教学的创新提供了有益的借鉴。