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.     

Stokes问题一个矩形非协调元逼近

提出了一个新的矩形非协调混合元格式,把它应用于Stokes问题的数值逼近,得到了最优的误差估计.     

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)     

再生铅生产

该文简述了废铅料回收的重要性，国内外再生铅生产的现状及方法，并对我国再生铅的生产提出有关建议。     

解决高校贫困生问题对策研究

20世纪90年代中期以来,我国高校贫困生人数和比例迅速增长,贫困生问题日益突出。高校贫困生问题,是目前困扰高校的一个棘手问题,不仅影响着高校的稳定和发展,也对社会带来一定的负面影响,是建设社会主义和谐社会的一个亟待解决当然问题。解决高校贫困生问题是一个社会系统工程,既依赖经济的持续、健康、快速发展,也需要国家政策和制度的支持,同时更需要社会方方面面的努力。     

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.     

非饱和土二、三维固结方程简化计算方法

针对非饱和土的固结问题的复杂性,为了计算的简化,将非饱和土固结分为3个阶段:初期压密、气压消散和水压消散。假定前两个阶段是瞬间完成的,其后独立考虑水压的消散。分别建立3个阶段的二、三维控制方程,以计算各阶段的气压、水压、骨架应力、相应的土体变形和水量变化。算例的计算结果表明本文方法简便、实用。该简化方法主要适用于饱和度不太高的非饱和土,而对饱和度较高的非饱和土,由于气压消散过程较长,不宜采用。