Measurement uncertainty of selenium determination in the reference material Seronorm Trace Elements Serum by hydride generation atomic fluorescence spectrometry

 An analytical result is not considered to be complete without a statement of the measurement uncertainty associated with it. Evaluation of measurement uncertainty is therefore an essential part of every determination. In the present study the measurement uncertainty of the result of determination of selenium in the reference material Seronorm Trace Elements Serum was studied. The combination of a digestion procedure using sulfuric acid, V₂O₅ in H₂SO₄ and hydrogen peroxide and the continuous flow approach of hydride generation atomic fluorescence spectrometry (HG-AFS) detection was used for selenium determination. The total uncertainty budget was calculated with the help of the GUM Workbench program, in which computations follow the rules of the ’ISO guide to the expression of uncertainty in measurement’. The major sources of uncertainty were found to be due to the recovery of the procedure, measurement of peak heights and the purity of Na₂SeO₃. A selenium mass fraction of 77.1±4.8 ng/g (with a coverage factor of 2.1, 95% probability) was determined, which is comparable with the recommended value of 80 ng/g. Received: 13 September 2002 Accepted: 23 December 2002 Acknowledgements We would like to thank Tinkara Buˇcar, B.Sc. for useful discussions and the IAEA Vienna, for financial support of the project 11553/RO. Presented at CERMM-3, Central European Reference Materials and Measurements Conference: The function of reference materials in the measurement process, May 30–June 1, 2002, Rogaška Slatina, Slovenia Correspondence to V. Stibilj     

Experience of Control over Process of Chemical-Informational Synthesis

Conditions under which various kinds of carbon nanoparticles are obtained by thermal oxidative conversion of methane in chlorine in the temperature range 20-500°C were studied. The influence exerted by conditions of synthesis of nanodispersed carbon on the properties of its samples was analyzed.     

Working group report: Neutrino and astroparticle physics

This is the report of neutrino and astroparticle physics working group at WHEPP-7. Discussions and work on CP violation in long baseline neutrino experiments, ultra high energy neutrinos, supernova neutrinos and water Cerenkov detectors are discussed.     

A Branch & Cut algorithm for a four-index assignment problem

In this paper, we examine the orthogonal Latin squares (OLS) problem from an integer programming perspective. The OLS problem has a long history and its significance arises from both theoretical aspects and practical applications. The problem is formulated as a four-index assignment problem whose solutions correspond to OLS. This relationship is exploited by various routines (preliminary variable fixing, branching, etc) of the Branch & Cut algorithm we present. Clique, odd-hole and antiweb inequalities implement the ‘Cut’ component of the algorithm. For each cut type a polynomial-time separation algorithm is implemented. Extensive computational analysis examines multiple aspects concerning the design of our algorithm. The results illustrate clearly the improvement achieved over simple Branch & Bound.     

Subgame Consistent Cooperative Solutions in Stochastic Differential Games

Subgame consistency is a fundamental element in the solution of cooperative stochastic differential games. In particular, it ensures that: (i) the extension of the solution policy to a later starting time and to any possible state brought about by the prior optimal behavior of the players would remain optimal; (ii) all players do not have incentive to deviate from the initial plan. In this paper, we develop a mechanism for the derivation of the payoff distribution procedures of subgame consistent solutions in stochastic differential games with transferable payoffs. The payoff distribution procedure of the subgame consistent solution can be identified analytically under different optimality principles. Demonstration of the use of the technique for specific optimality principles is shown with an explicitly solvable game. For the first time, analytically tractable solutions of cooperative stochastic differential games with subgame consistency are derived.     

Asymptotic Properties of Random Multidimensional Assignment Problems

The multidimensional assignment problem (MAP) is a NP-hard combinatorial optimization problem, occurring in many applications, such as data association. In this paper, we prove two conjectures made in Ref. 1 and based on data from computational experiments on MAPs. We show that the mean optimal objective function cost of random instances of the MAP goes to zero as the problem size increases, when assignment costs are independent exponentially or uniformly distributed random variables. We prove also that the mean optimal solution goes to negative infinity when assignment costs are independent normally distributed random variables.     

Dihydropyridine-based MCRs. New reaction pathways in the interaction with ethyl glyoxalate and non-aromatic amines

The Lewis acid-catalyzed interaction of dihydropyridines with ethyl glyoxalate and primary aliphatic amines yields, depending on the reaction conditions, bicyclic aminals or rearranged tetrahydropyridines in one-pot multicomponent reactions.     

An Approach to Fuzzy Noncooperative Nash Games

Systems that involve more than one decision maker are often optimized using the theory of games. In the traditional game theory, it is assumed that each player has a well-defined quantitative utility function over a set of the player decision space. Each player attempts to maximize/minimize his/her own expected utility and each is assumed to know the extensive game in full. At present, it cannot be claimed that the first assumption has been shown to be true in a wide variety of situations involving complex problems in economics, engineering, social and political sciences due to the difficulty inherent in defining an adequate utility function for each player in these types of problems. On the other hand, in many of such complex problems, each player has a heuristic knowledge of the desires of the other players and a heuristic knowledge of the control choices that they will make in order to meet their ends.In this paper, we utilize fuzzy set theory in order to incorporate the players' heuristic knowledge of decision making into the framework of conventional game theory or ordinal game theory. We define a new approach to N-person static fuzzy noncooperative games and develop a solution concept such as Nash for these types of games. We show that this general formulation of fuzzy noncooperative games can be applied to solve multidecision-making problems where no objective function is specified. The computational procedure is illustrated via application to a multiagent optimization problem dealing with the design and operation of future military operations.