近期河北冶金工业结构调整形势与任务

分析了河北冶金近期行业发展特别关注的几个问题：钢铁生产发展过快；产业结构缺陷，资源供应和环境压力。同时，文章从分析国内外市场形势和国家宏观政策形势入手，提出了河北冶金工业对产品结构调整，工艺装备调整和组织结构调整的必要性，任务和需注意的问题。     

Cooperation between memory systems: Acetylcholine release in the amygdala correlates positively with performance on a hippocampus-dependent task.

The present experiment examined the relationship between release of acetylcholine (ACh) in the amygdala and performance on a hippocampus-dependent spatial working memory task. Using in vivo microdialysis, the authors measured ACh release in rats during testing on a spontaneous alternation task. Amygdala ACh release was positively correlated with performance on the hippocampus-dependent task. These findings suggest that activation of the amygdala promotes processing in other neural systems important for learning and memory. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Learning to Predict Non-Deterministically Generated Strings

In this article we present an algorithm that learns to predict non-deterministically generated strings. The problem of learning to predict non-deterministically generated strings was raised by Dietterich and Michalski (1986). While their objective was to give heuristic techniques that could be used to rapidly and effectively learn to predict a somewhat limited class of strings, our objective is to give an algorithm which, though impractical, is capable of learning to predict a very general class. Our algorithm is meant to provide a general framework within which heuristic techniques can be effectively employed.     

The effects of recent practice on task switching.

Four experiments investigated the effect of recent selective practice on the cost of switching between 2 tasks afforded by letter-digit pairs: alphabet arithmetic and shape comparison. Experiments 1 and 2 found a greater cost associated with switching to the more recently practiced task: evidence that task-set inertia contributes to switching costs. Experiment 3 found this effect to be limited to trials on which a recently trained stimulus followed another such stimulus: a result problematic for all current theories of task-set priming. Experiment 4 showed that the effect of recent practice was eliminated by active preparation for a task switch: It appears that endogenous task-set preparation reduces the effects of task-set inertia. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

What does the object decision task measure? Reflections on the basis of evidence from semantic dementia.

The authors investigated the impact of semantic knowledge on visual object analysis by assessing the performance of patients with semantic dementia on a different-views object matching test and on 2 object decision tests differing, for example, in whether the nonreal items were nonsense objects or chimeras of 2 real objects. On average, the patients scored normally on both the object matching and the object decision test including nonsense objects but were impaired on the object decision test including chimeras; this latter was also the only visual object test that correlated significantly with degree of semantic impairment. These findings demonstrate that object decision is not a single task or ability and that it is not necessarily independent of conceptual knowledge. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

热衷于国际标准活动--全球社会标准化机构肩负的任务

根据美国国家标准学会 (ANSI)理事会主席、ISO现任主席OliverR .Smoot在日本东京召开的国际标准化协议会上的讲演整理。     

Differential effects of cue changes and task changes on task-set selection costs.

A task-switching paradigm with a 2:1 mapping between cues and tasks was used to separate cue-switching processes (indexed through pure cue-switch costs) from actual task-switching processes (indexed through additional costs in case of cue and task changes). A large portion of total switch costs was due to cue changes (Experiments 1 and 2), and cue-switch costs but not task-switch costs were sensitive to effects of practice (Experiment 1) and preparation (Experiment 2). In contrast, task-switch costs were particularly sensitive to response-priming effects (Experiments 1 and 2) and task-set inhibition (Experiment 3). Results suggest two processing stages relevant during task-set selection: cue-driven retrieval of task rules from long-term memory and the automatic application of rules to a particular stimulus situation. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

On the hardness of approximating label-cover

The Label-Cover problem, defined by S. Arora, L. Babai, J. Stern, Z. Sweedyk [Proceedings of 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 724-733], serves as a starting point for numerous hardness of approximation reductions. It is one of six ‘canonical’ approximation problems in the survey of Arora and Lund [Hardness of Approximations, in: Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1996, Chapter 10]. In this paper we present a direct combinatorial reduction from low error-probability PCP [Proceedings of 31st ACM Symposium on Theory of Computing, 1999, pp. 29-40] to Label-Cover showing it NP-hard to approximate to within 2^{(logn)1−o(1)}. This improves upon the best previous hardness of approximation results known for this problem.We also consider the Minimum-Monotone-Satisfying-Assignment (MMSA) problem of finding a satisfying assignment to a monotone formula with the least number of 1's, introduced by M. Alekhnovich, S. Buss, S. Moran, T. Pitassi [Minimum propositional proof length is NP-hard to linearly approximate, 1998]. We define a hierarchy of approximation problems obtained by restricting the number of alternations of the monotone formula. This hierarchy turns out to be equivalent to an AND/OR scheduling hierarchy suggested by M.H. Goldwasser, R. Motwani [Lecture Notes in Comput. Sci., Vol. 1272, Springer-Verlag, 1997, pp. 307-320]. We show some hardness results for certain levels in this hierarchy, and place Label-Cover between levels 3 and 4. This partially answers an open problem from M.H. Goldwasser, R. Motwani regarding the precise complexity of each level in the hierarchy, and the place of Label-Cover in it.     

Complexity classification in qualitative temporal constraint reasoning

We study the computational complexity of the qualitative algebra which is a temporal constraint formalism that combines the point algebra, the point-interval algebra and Allen's interval algebra. We identify all tractable fragments and show that every other fragment is NP-complete.