ISICS2011, an updated version of ISICS: A program for calculation K-, L-, and M-shell cross sections from PWBA and ECPSSR theories using a personal computer

In this new version of ISICS, called ISICS2011, a few omissions and incorrect entries in the built-in file of electron binding energies have been corrected; operational situations leading to un-physical behavior have been identified and flagged.

New version program summary

Program title: ISICS2011Catalogue identifier: ADDS_v5_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADDS_v5_0.htmlProgram obtainable from: CPC Program Library, Queen?s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 6011No. of bytes in distributed program, including test data, etc.: 130 587Distribution format: tar.gzProgramming language: CComputer: 80486 or higher-level PCsOperating system: WINDOWS XP and all earlier operating systemsClassification: 16.7Catalogue identifier of previous version: ADDS_v4_0Journal reference of previous version: Comput. Phys. Commun. 180 (2009) 1716.Does the new version supersede the previous version?: YesNature of problem: Ionization and X-ray production cross section calculations for ion–atom collisions.Solution method: Numerical integration of form factor using a logarithmic transform and Gaussian quadrature, plus exact integration limits.Reasons for new version: General need for higher precision in output format for projectile energies; some built-in binding energies needed correcting; some anomalous results occur due to faulty read-in data or calculated parameters becoming un-physical; erroneous calculations could result for the L and M shells when restricted K-shell options are inadvertently chosen; to achieve general compatibility with ISICSoo, a companion C++ version that is portable to Linux and MacOS platforms, has been submitted for publication in the CPC Program Library approximately at the same time as this present new standalone version of ISICS [1].Summary of revisions: The format field for projectile energies in the output has been expanded from two to four decimal places in order to distinguish between closely spaced energy values. There were a few entries in the executable binding energy file that needed correcting; K shell of Eu, M shells of Zn, M1 shell of Kr. The corrected values were also entered in the ENERGY.DAT file. In addition, an alternate data file of binding energies is included, called ENERGY_GW.DAT, which is more up-to-date [2]. Likewise, an alternate atomic parameters data file is now included, called FLOURE_JC.DAT, which is more up-to-date [3] fluorescence yields for the K and L shells and Coster–Kronig parameters for the L shell. Both data files can be read in using the -f usage option. To do this, the original energy file should be renamed and saved (e.g., ENERGY_BB.DAT) and the new file (ENERGY_GW.DAT ) should be duplicated as ENERGY.DAT to be read in using the -f option. Similarly for reading in an alternate FLOURE.DAT file. As with previous versions, the user can also simply input different values of any input quantity by invoking the “specify your own parameters” option from the main menu. You can also use this option to simply check the values of the built-in values of the parameters. If it still happens that a zero binding energy for a particular sub-shell is read in, the program will not completely abort, but will calculate results for the other sub-shells while setting the affected sub-shell output to zero. In calculating the Coulomb deflection factor, if the quantity inside the radical sign of the parameter zs becomes zero or negative, to prevent the program from aborting, the PWBA cross sections are still calculated while the ECPSSR cross sections are set to zero. This situation can happen for very low energy collisions, such as were noticed for helium ions on copper at energies of E?11.2 keV. It was observed during the engineering of ISICSoo [1] that erroneous calculations could result for the L- and M-shell cases when restricted K-shell R or HSR scaling options were inappropriately chosen. The program has now been fixed so that these inappropriate options are ignored for the L and M shells. In the previous versions, the usage for inputting a batch data file was incorrectly stated in the Users Manual as -Bxxx; the correct designation is -Fxxx, or alternatively, -Ixxx, as indicated on the usage screen in running the program.A revised Users Manual is also available.Restrictions: The consumed CPU time increases with the atomic shell (K, L, M), but execution is still very fast.Running time: This depends on which shell and the number of different energies to be used in the calculation. The running time is not significantly changed from the previous version.References:

• [1] 

  M. Batic, M.G. Pia, S. Cipolla, Comput. Phys. Commun. (2011), submitted for publication.

• [2] 

  http://www.jlab.org/~gwyn/ebindene.html.

• [3] 

  J. Campbell, At. Data Nucl. Data Tables 85 (2003) 291.

     

The minimum information about failures for solving non-local tasks in message-passing systems

We first define the basic notions of local and non-local tasks for distributed systems. Intuitively, a task is local if, in a system with no failures, each process can compute its output value locally by applying some local function on its own input value (so the output value of each process depends only on the process’ own input value, not on the input values of the other processes); a task is nonlocal otherwise. All the interesting distributed tasks, including all those that have been investigated in the literature (e.g., consensus, set agreement, renaming, atomic commit, etc.) are non-local. In this paper we consider non-local tasks and determine the minimum information about failures that is necessary to solve such tasks in message-passing distributed systems. As part of this work, we also introduces weak set agreement—a natural weakening of set agreement—and show that, in some precise sense, it is the weakest nonlocal task in message-passing systems.     

Failure detection and consensus in the crash-recovery model

Summary. We study the problems of failure detection and consensus in asynchronous systems in which processes may crash and recover, and links may lose messages. We first propose new failure detectors that are particularly suitable to the crash-recovery model. We next determine under what conditions stable storage is necessary to solve consensus in this model. Using the new failure detectors, we give two consensus algorithms that match these conditions: one requires stable storage and the other does not. Both algorithms tolerate link failures and are particularly efficient in the runs that are most likely in practice – those with no failures or failure detector mistakes. In such runs, consensus is achieved within time and with 4 n messages, where is the maximum message delay and n is the number of processes in the system. Received: May 1998 / Accepted: November 1999     

Symbolic computation with finite biquandles

A method of computing a basis for the second Yang–Baxter cohomology of a finite biquandle with coefficients in Q$\mathbb{Q}$ and _Zp${\mathbb{Z}}_p$ from a matrix presentation of the finite biquandle is described. We also describe a method for computing the Yang–Baxter cocycle invariants of an oriented knot or link represented as a signed Gauss code. We provide a URL for our Maple implementations of these algorithms.     

钓鱼冠军赛

钓鱼,是一项非常休闲的户外活动,大家对此一定不会陌生。笔者就是一个钓鱼迷,而且笔者相信绝大多数人也都有钓鱼的经历。但是你有没有试过在电脑中钓鱼呢？那些不曾钓过鱼的朋友也不用心急,先玩玩这个游戏体验一下钓鱼的感觉吧。     

Recovery and grade prediction of pilot plant flotation column concentrate by a hybrid neural genetic algorithm

Today flotation column has become an acceptable means of froth flotation for a fairly broad range of applications, in particular the cleaning of sulfides. Even after having been used for several years in mineral processing plants, the full potential of the flotation column process is still not fully exploited. There is no prediction of process performance for the complete use of available control capabilities. The on-line estimation of grade usually requires a significant amount of work in maintenance and calibration of on-stream analyzers, in order to maintain good accuracy and high availability. These difficulties and the high cost of investment and maintenance of these devices have encouraged the approach of prediction of metal grade and recovery. In this paper, a new approach has been proposed for metallurgical performance prediction in flotation columns using Artificial Neural Network (ANN). Despite of the wide range of applications and flexibility of NNs, there is still no general framework or procedure through which the appropriate network for a specific task can be designed. Design and structural optimization of NNs is still strongly dependent upon the designer’s experience. To mitigate this problem, a new method for the auto-design of NNs was used, based on Genetic Algorithm (GA). The new proposed method was evaluated by a case study in pilot plant flotation column at Sarcheshmeh copper plant. The chemical reagents dosage, froth height, air, wash water flow rates, gas holdup, Cu grade in the rougher feed, flotation column feed, column tail and final concentrate streams were used to the simulation by GANN. In this work, multi-layer NNs with Back Propagation (BP) algorithm with 8-17-10-2 and 8-13-6-2 arrangements have been applied to predict the Cu and Mo grades and recoveries, respectively. The correlation coefficient (R) values for the testing sets for Cu and Mo grades were 0.93, 0.94 and for their recoveries were 0.93, 0.92, respectively. The results discussed in this paper indicate that the proposed model can be used to predict the Cu and Mo grades and recoveries with a reasonable error.     

Operation, system architectures, and physical Layer design considerations of distributed MAC protocols for UWB

Impulse-based ultra wideband (I-UWB) is an attractive radio technology for large ad hoc and sensor networks due to its robustness to harmful multipath effects, sub-centimeter ranging ability, simple hardware, and low radiated power. To scale to large sizes, networks often implement distributed medium access control (MAC) protocols. However, most MAC protocols for I-UWB are centralized, and they target small wireless personal area networks and cellular networks. We propose three distributed MAC protocols suitable for I-UWB. Two multichannel protocols, called multichannel pulse sense multiple access (M-PSMA) and multichannel ALOHA achieve high aggregate throughput. A busy-signal protocol, called busy-signal multiple access (BSMA), reduces the energy wasted from re-transmitted packets. This paper describes the three protocols in terms of the protocol's operation, the supporting system architecture, and the I-UWB physical layer. Physical layer simulations confirm the feasibility of implementing the proposed systems and also provide parameters for network simulations. Network simulations show that the throughput of M-PSMA exceeds that of a centralized time-division multiple-access protocol and that the energy efficiency of BSMA far surpasses that of other distributed protocols.     

MLS‐based variable‐node elements compatible with quadratic interpolation. Part I: formulation and application for non‐matching meshes

Two‐dimensional variable‐node elements compatible with quadratic interpolation are developed using the moving least‐square (MLS) approximation. The mapping from the parental domain to the physical element domain is implicitly obtained from MLS approximation, with the shape functions and their derivatives calculated and saved only at the numerical integration points. It is shown that the present MLS‐based variable‐node elements meet the patch test if a sufficiently large number of integration points are employed for numerical integration. The cantilever problem with non‐matching meshes is chosen to check the feasibility of the present MLS‐based variable‐node elements, and the result is compared with that from the lower‐order case compatible with linear interpolation. Copyright © 2005 John Wiley & Sons, Ltd.     

A simple receding horizon control for state delayed systems and its stability criterion

In this paper, a simple receding horizon (or model predictive) control for state delayed systems is presented and its solution is given in a closed form by a reduction method. While the control for a time-delay system is usually complex, the proposed controller is simple to construct and therefore can be simply implemented in real applications. To check the closed-loop stability of the proposed controller, a sufficient condition is provided by linear matrix inequalities. In addition, a numerical algorithm is presented for computing the eigenvalues of systems with distributed time delays, which can be used as a necessary and sufficient condition to check closed-loop stability. It is shown by simulation that this simple control can be a stabilizing control for time-delay systems.     

One-Dimensional Numerical Model for Nonuniform Sediment Transport under Unsteady Flows in Channel Networks

In this study, the proposed one-dimensional model simulates the nonequilibrium transport of nonuniform total load under unsteady flow conditions in dendritic channel networks with hydraulic structures. The equations of sediment transport, bed changes, and bed-material sorting are solved in a coupling procedure with a direct solution technique, while still decoupled from the flow model. This coupled model for sediment calculation is more stable and less likely to produce negative values for bed-material gradation than the traditional fully decoupled model. The sediment transport capacity is calculated by one of four formulas, which have taken into consideration the hiding and exposure mechanism of nonuniform sediment transport. The fluvial erosion at bank toes and the mass failure of banks are simulated to complement the modeling of bed morphological changes in channels. The tests in several cases show that the present model is capable of predicting sediment transport, bed changes, and bed-material sorting in various situations, with reasonable accuracy and reliability.