Numerical blow-up analysis of the explicit L1-scheme for fractional ordinary differential equations

Numerical Algorithms - This paper deals with the blow-up behavior of numerical solutions to nonlinear fractional ordinary differential equations with a dissipative term. Based on the positivity...     

一般工商业零售电价套餐适应性评估与优化方法

在电力体制改革的大背景下,合理评估零售电价套餐适应性,对控制电网经营风险和推进售电侧改革有重要意义。针对我国电力市场以及一般工商业的特点,首先从竞争、用户以及市场环境角度出发建立了一般工商业零售电价套餐评估指标体系;其次将层次分析法和改进的灰色白化权函数相结合,对电价套餐进行适应性评估;最后针对该评估方法建立了基于蚁群算法的优化模型,以最小成本得到提高电价套餐适应性等级的优化方案,并验证了该方法具有良好的鲁棒性,具有一定的参考意义。     

A Review of Results on Axially Symmetric Navier-Stokes Equations,with Addendum by X. Pan and Q. Zhang

In this paper, we give a brief survey of recent results on axially symmetric Navier-Stokes equations (ASNS) in the following categories: regularity criterion, Liouville property for ancient solutions, decay and vanishing of stationary solutions. Some discussions also touch on the full 3 dimensional equations. Two results, closing of the scaling gap for ASNS and vanishing of homogeneous D solutions in 3 dimensional slabs will be described in more detail.In the addendum, two new results in the 3rd category will also be presented, which are generalizations of recently published results by the author and coauthors.     

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.     

Luminescence centers in porous silicon

Photoluminescence studies on porous silicon show that there are luminescence centers present in the surface states. By taking photoluminescence spectra of porous silicon with respect to temperature, a distinct peak can be observed in the temperature range 100–150 K. Both linear and nonlinear relationships were observed between excitation laser power and the photoluminescence intensity within this temperature range. In addition, there was a tendency for the photoluminescence peak to red shift at low temperature as well as at low excitation power. This is interpreted as indicating that the lower energy transition becomes dominant at low temperature and excitation power. The presence of these luminescence centers can be explained in terms of porous silicon as a mixture of silicon clusters and wires in which quantum confinement along with surface passivation would cause a mixing of andX band structure between the surface states and the bulk. This mixing would allow the formation of luminescence centers.     

Hydrolysis of 2-aminoethanethiolsulfate ions

The kinetics of the acid catalyzed hydrolysis of 2-aminoethanethiolsulfate (AETS) ions were investigated. The dependence of the hydrolysis rate constant on acidity and temperature was determined. The hydrolysis rate equation can be expressed as where H_o is the Hammett acidity function. The rate constant, k, can be expressed as The pK_a's for the compound were measured and literature value of pK_a was found to be in error. The values determined in this study are pK_a1 < ?0.5 and pK_a2 = 9.1 ± 0.1. General acid catalysis of the hydrolysis reaction was found not to proceed to a significant degree. © 1994 John Wiley & Sons, Inc.

1 This article is a US Government work and, as such, is in the public domain in the United States of America.

     

Clumping Data in 2-Way Tables: A User-Orientated Perspective

Following a critique of existing algorithms, an algorithm is presented which will re-organize a 2-way data table to bring like rows together, and like columns together. Extensions of the method are described, and justified, to accommodate distances measured in modular arithmetic, and with bipolar columns/rows, as in repertory grid analysis. One value of the algorithms is that the user can see relationships in the tables without the data in the cells themselves ever having been transformed. Thus, users will continue to feel they own their data.