《中华人民共和国煤炭法》亟待修订

当前,由于《煤炭法》颁布的时代背景发生很大变化,该法已经不能适应形势发展和实际工作的需要。该法存在的主要问题包括煤炭开采市场准入门槛设置过低、对煤炭生产开发规划规定过分原则等。我们应以科学发展观为指导,按照市场经济规律的要求,针对存在的问题尽快对《煤炭法》进行修订和完善。     

Smaller superconcentrators of density 28

An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known that linear-size and bounded-degree superconcentrators exist. Here it is proved that such superconcentrators exist (by a random construction of certain expander graphs as building blocks) having density 28 (where the density is the number of edges divided by N). The best known density before this paper was 34.2 [U. Schöning, Construction of expanders and superconcentrators using Kolmogorov complexity, J. Random Structures Algorithms 17 (2000) 64-77] or 33 [L.A. Bassalygo, Personal communication, 2004].     

A note on the first-passage problem and VanMarcke’s approximation — short communication

Given a scalar, stationary, Markov process, this short communication presents a closed-form solution for the first-passage problem for a fixed threshold b. The derivation is based on binary processes and the general formula of Siegert [Siegert AJF. On the first-passage time probability problem. Physical Review 1951; 81:617–23]. The relation for the probability density function of the first-passage time is identical to the commonly used formula that was derived by VanMarcke [VanMarcke E. On the distribution of the first-passage time for normal stationary random processes. Journal of Applied Mechanics ASME 1975; 42:215–20] for Gaussian processes. The present derivation is based on more general conditions and reveals the criteria for the validity of the approximation. Properties of binary processes are also used to derive a hierarchy of upper bounds for any scalar process.     

Using what we know: Consequences of intentionally retrieving gist versus item-specific information.

The effect of a prior gist-based versus item-specific retrieval orientation on recognition of objects and words was examined. Prior item-specific retrieval increased item-specific recognition of episodically related but not previously tested objects relative to both conceptual- and perceptual-gist retrieval. An item-specific retrieval advantage also was found when the stimuli were words (synonyms) rather than objects but not when participants overtly named objects during gist-based recognition testing, which suggests that they did not always label objects under general gist-retrieval instructions. Unlike verbal overshadowing, labeling objects during recognition attenuated (but did not eliminate) test- and interference-related forgetting. A full understanding of how retrieval affects subsequent memory, even for events or facts that are not themselves retrieved, must take into account the specificity with which that retrieval occurs. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

计算机模拟溃坝洪水问题的程序设计

随着计算机性能的提高，计算机模拟技术日益复杂，在研究使用计算机模拟洪水的演进，以期给出准确的预警，最大限度减少损失和人员伤亡方面也取得一定进步。本文尝试用MATLAB程序模拟溃坝洪水，并在最后给出一个算例。     

Locational analysis for regionalization of Turkish Red Crescent blood services

After a series of earthquakes in 1999, Turkish Red Crescent (TRC) has engaged in a restructuring for all of its activities, including the blood services. Our study on the blood management system had been started as part of this initiative to restructure the blood services and improve both their effectiveness and efficiency. In the current system of TRC, not much consideration has been given to how the locational decisions affect the performance of blood centers, stations and mobile units. In recent years, however, there has been much discussion regarding the regionalization of the blood management system in Turkey. In this study, we develop several mathematical models to solve the location–allocation decision problems in regionalization of blood services. We report our computational results, obtained by using real data, for TRC blood services.     

Heat loss and thermoelectric generator design

With the object of evaluating its importance to thermoelectric generator design, heat loss is introduced into the standard thermoelectric generator design theory. The theory for both the constant hot and cold junction temperatures model and the constant heat input model are so modified. The modification is first order and, therefore, is limited to small leg heat-transfer coefficients. Numerical results using representative properties show that significant differences can exist between the optimum geometry and performance of a generator idealized as lossless and those of a generator designed by the modified theory. The largest differences occur with the constant heat input model.     

Fast parallel Preconditioned Conjugate Gradient algorithms for robot manipulator dynamics simulation

In this paper fast parallel Preconditioned Conjugate Gradient (PCG) algorithms for robot manipulator forward dynamics, or dynamic simulation, problem are presented. By exploiting the inherent structure of the forward dynamics problem, suitable preconditioners are devised to accelerate the iterations. Also, based on the choice of preconditioners, a modified dynamic formulation is used to speedup both serial and parallel computation of each iteration. The implementation of the parallel algorithms on two interconnected processor arrays is discussed and their computation and communication complexities are analyzed. The simulation results for a Puma Arm are presented to illustrate the effectiveness of the proposed preconditioners. With a faster convergence due to preconditioning and a faster computation of iterations due to parallelization, the developed parallel PCG algorithms represent the fastest alternative for parallel computation of the problem withO(n) processors.     

External watchman routes

We consider the problem of finding a shortest watchman route from which the exterior of a polygon is visible (external watchman route). We present an O (n ⁴ log logn) algorithm to find shortest external watchman routes for simple polygons by transforming the external watchman route problem to a set of internal watchman route problems. Also, we present faster external watchman route algorithms for special cases. These include optimal O (n) algorithms for convex, monotone, star and spiral polygons and an O (n log logn) algorithm for rectilinear polygons.This work was supported in part by a grant from Texas Instruments, Inc. to S. Ntafos     

层次式级联多网络模型及其性能

本文提出了一种层次式级联多网络结构，论述了其训练算法，并验证了该结构的收敛性。这种结构在处理高阶非线性分布数据的分类问题方面具有优良的性能，用北京谱仪事例过滤进行性能测试结果表明，其训练和泛化性能都优于单个ＢＰ网络。