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

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

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

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

On the complexity of simulating space-bounded quantum computations

This paper studies the space-complexity of predicting the long-term behavior of a class of stochastic processes based on evolutions and measurements of quantum mechanical systems. These processes generalize a wide range of both quantum and classical space-bounded computations, including unbounded error computations given by machines having algebraic number transition amplitudes or probabilities. It is proved that any space s quantum stochastic process from this class can be simulated probabilistically with unbounded error in space O(s), and therefore deterministically in space O(s²).     

Integrating psychology and politics.

Comments on the article "A house divided? The psychology of red and blue America" by D. C. Seyle and M. L. Newman (see record 2006-11202-001). Seyle and Newman concluded that the red and blue metaphor is inaccurate and proposed a purple America strategy to better convey that the majority of people do not align themselves with political extremes. There is interdisciplinary agreement on this. Although not cited by Seyle and Newman, the findings by Professor Fiorina of Stanford University were reported by the APA Monitor on Psychology in its coverage of the 2005 APA State Leadership Conference (Murray Law, 2005). In contrast to their social psychological analysis, Seyle and Newman were incorrect in concluding that "[a]s psychologists, we are not in a position to change either the elements of the American political system that may spur this conflict or even the decisions made by pundits, politicians, and reporters about the terms they choose to use in political discussion" (p. 579). (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

The complexity of economic equilibria for house allocation markets

We prove NP-completeness of deciding the existence of an economic equilibrium in so-called house allocation markets. House allocation markets are markets with indivisible goods in which every agent holds exactly one copy of some good.     

Optimal Solutions for the Temporal Precedence Problem

Abstract. In this paper we refer to the Temporal Precedence Problem on Pure Pointer Machines . This problem asks for the design of a data structure, maintaining a set of stored elements and supporting the following two operations: insert and precedes . The operation insert (a) introduces a new element a in the structure, while the operation precedes (a,b) returns true iff element a was inserted before element b temporally. In [11] a solution was provided to the problem with worst-case time complexity O (log log n ) per operation and O(n log log n) space, where n is the number of elements inserted. It was also demonstrated that the precedes operation has a lower bound of Ω (log log n ) for the Pure Pointer Machine model of computation. In this paper we present two simple solutions with linear space and worst-case constant insertion time. In addition, we describe two algorithms that can handle the precedes (a,b) operation in O (log log d ) time, where d is the temporal distance between the elements a and b .     

最佳基数排序

基数排序由于其效率高而被广泛应用。通常,基数排序所用的基数是10,然而,如果求得一个基数r_(best),并且用r_(best)为基数进行基数排序使排序时间达到最小,则这将具有非常重要的意义。本文给出了求r_(best)的方法,分析了以r_(best)为基数进行基数排序的时间复杂度,提出了进一步提高效率的措施,并将以r_(best)为基数的基数排序速度与以10为基数的基数排序进行了比较。     

Computational complexity of queries based on itemsets

We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that despite the limitations our problems are also intractable, namely, we show that checking whether the maximal consistent frequency of a query is larger than a given threshold is NP-complete and that evaluating the Maximum Entropy estimate of a query is PP-hard. We also prove that checking consistency is NP-complete.     

Gorillas (Gorilla gorilla) and Orangutans (Pongo pygmaeus) Encode Relevant Problem Features in a Tool-Using Task.

Two important elements in problem solving are the abilities to encode relevant task features and to combine multiple actions to achieve the goal. The authors investigated these 2 elements in a task in which gorillas (Gorilla gorilla) and orangutans (Pongo pygmaeus) had to use a tool to retrieve an out-of-reach reward. Subjects were able to select tools of an appropriate length to reach the reward even when the position of the reward and tools were not simultaneously visible. When presented with tools that were too short to retrieve the reward, subjects were more likely to refuse to use them than when tools were the appropriate length. Subjects were proficient at using tools in sequence to retrieve the reward. (PsycINFO Database Record (c) 2010 APA, all rights reserved)