建立实施职业健康安全管理体系迎接入世挑战

建立和实施职业健康安全管理体系 (OHSMS) ,改善职工健康状况 ,改善劳动条件已成为刻不容缓的任务。介绍了柳钢职业健康安全管理体系的建立和实施情况 ,并提出了建立文化OHSMS和QMS整合型管理体系的设想及建立整合型管理体系应注意的问题。     

江西铜工业存在的问题及对策探讨

简要介绍了我国铜工业概况，重点分析了江西铜工业存在的问题，并提出发展对策，如优化铜产品结构、利用国内外两种资源和大力发展湿法炼铜等。江西要发挥潜在优势，建立我国铜加工材生产基地，利用外力，提高铜加工材的竞争力，由进口替代逐步走向增加出口。     

A globally convergent algorithm for transportation continuous network design problem

The continuous network design problem (CNDP) is characterized by a bilevel programming model, in which the upper level problem is generally to minimize the total system cost under limited expenditure, while at the lower level the network users make choices with regard to route conditions following the user equilibrium principle. In this paper, the bilevel programming model for CNDP is transformed into a single level convex programming problem by virtue of an optimal-value function tool and the relationship between System Optimum (SO) and User Equilibrium (UE). By exploring the inherent nature of the CNDP, the optimal-value function for the lower level user equilibrium problem is proved to be continuously differentiable and its derivative in link capacity enhancement can be obtained efficiently by implementing user equilibrium assignment subroutine. However, the reaction (or response) function between the upper and lower level problem is implicit and its gradient is difficult to obtain. Although, here we approximately express the gradient with the difference concept at each iteration, based on the method of successive averages (MSA), we propose a globally convergent algorithm to solve the single level convex programming problem. Comparing with widely used heuristic algorithms, such as sensitivity analysis based (SAB) method, the proposed algorithm needs not strong hypothesis conditions and complex computation for the inverse matrix. Finally, a numerical example is presented to compare the proposed method with some existing algorithms.     

An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs

A graph is distance-hereditary if the distance stays the same between any of two vertices in every connected induced subgraph containing both. Two well-known classes of graphs, trees and cographs, both belong to distance-hereditary graphs. In this paper, we first show that the perfect domination problem can be solved in sequential linear-time on distance-hereditary graphs. By sketching some regular property of the problem, we also show that it can be easily parallelized on distance-hereditary graphs.     

Neighborhood disadvantage moderates associations of parenting and older sibling problem attitudes and behavior with conduct disorders in African American children.

Data from 296 sibling pairs (mean ages 10 and 13 years), their primary caregivers, and census records were used to test the hypothesis that African American children's likelihood of developing conduct problems associated with harsh parenting, a lack of nurturant-involved parenting, and exposure to an older sibling's deviance-prone attitudes and behavior would be amplified among families residing in disadvantaged neighborhoods. A latent construct representing harsh-inconsistent parenting and low levels of nurturant-involved parenting was positively associated with younger siblings' conduct disorder symptoms, as were older siblings' problematic attitudes and behavior. These associations were strongest among families residing in the most disadvantaged neighborhoods. Future research and prevention programs should focus on the specific neighborhood processes associated with increased vulnerability for behavior problems. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Ergodicity of filtering process by vanishing discount approach

A new approach to study ergodicity of filtering processes is presented. It is based on the vanishing discount approach to discounted functional of filtering process. We show that limit superior of the Cesaro averages of the functionals is the same for all initial conditions from which the uniqueness of invariant measures of filtering processes follows. The approach is based on certain assumption for which we provide a sufficient condition using concavity arguments. In addition we show the existence of solutions to the Poisson equation corresponding to filtering process with concave functional. The assumptions are then extended to the controlled case and using similar concave arguments we obtain the existence of solutions to the Bellman equation corresponding to partially observed average cost per unit time problem.     

Hybrid numerical scheme for time-evolving wave fields

Many problems in geophysics, acoustics, elasticity theory, cancer treatment, food process control and electrodynamics involve study of wave field synthesis (WFS) in some form or another. In the present work, modelling of wave propagation phenomena is studied as a static problem, using finite element method and treating time as an additional spatial dimension. In particular, WFS problems are analysed using discrete methods. It is shown that a fully finite element-based scheme is very natural and effective method for the solution of such problems. Distributed WFS in the context of two-dimensional problems is outlined and incorporation of any geometric or material non-linearities is shown to be straightforward. This has significant implications for problems in geophysics or biological media, where material inhomogeneities are quite prevalent. Numerical results are presented for several problems referring to media with material inhomogeneities and predefined absorption profiles. The method can be extended to three-dimensional problems involving anisotropic media properties in a relatively straightforward manner. Copyright © 2006 John Wiley & Sons, Ltd.     

The problem of demodulating across argument and literal boundaries

This article is the twenty-fourth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find an appropriate theory for modulating across argument and across literal boundaries. Because demodulation has proved so useful—is most cases, even crucial—to automated reasoning, extending this concept to permit canonicalization to be applied at the predicate and at the clause and subclause levels merits exploration. For evaluating a proposed solution to this research problem, we suggest problems from mathematics, logic, program verification, database inquiry, and the world of puzzles.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract W-31-109-Eng-38.     

Metaheuristic downhill simplex method in combinatorial optimization

The concept of combinatorial objects is formalized. It allows strict definition of a combinatorial optimization problem (COP). An efficient metaheuristic method to solve COPs (H-method) is considered. It includes stochastic local search algorithms as a built-in procedure. A parallel implementation of the H-method is set forth and analyzed. The results from a numerical experiment and solution of some well-known COPs on personal computers and on the SKIT cluster supercomputer are presented. The study was supported by INTAS (Project 06-1000017-8909). __________ Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 70–79, November–December 2007.     

Multicast key distribution schemes based on Stinson-Van Trung designs

The efficiency characteristics of multicast key distribution schemes based on (v, b, r, λ)-designs are investigated. The stability and connectivity of such designs are estimated. These estimates generalize and enhance the well-known estimates for the efficiency characteristics of multicast key distribution schemes based on incomplete block designs. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 100–111, May–June 2007.