What do we learn from binding features? Evidence for multilevel feature integration.

Four experiments were conducted to investigate the relationship between the binding of visual features (as measured by their aftereffects on subsequent binding) and the learning of feature-conjunction probabilities. Both binding and learning effects were obtained, but they did not interact. Interestingly, (shape-color) binding effects disappeared with increasing practice, presumably because of the fact that only 1 of the features involved was relevant to the task. However, this instability was only observed for arbitrary, not highly overlearned combinations of simple geometric features and not for real objects (colored pictures of a banana and strawberry), where binding effects were strong and resistant to practice. These findings suggest that learning has no direct impact on the strength or resistance of bindings or on speed with which features are bound; however, learning does affect the amount of attention particular feature dimensions attract, which again can influence which features are considered in binding. (PsycINFO Database Record (c) 2011 APA, all rights reserved)     

40kg试验焦炉的研制

文章介绍了40kg试验焦炉，分析和比较了试验焦炉与生产焦炉的差异，指出它们之间的模拟条件是炭化室宽度、煤料堆密度、炼焦速度和单向传热。     

Maximally efficient dialogue mode algorithm

Collaboration is more efficient when the most capable participant for each goal has initiative in directing the problem-solving for that goal. The paper describes a method for using a probabilistic analysis to create a mode-switching mechanism that selects which participant should control the collaborative problem solving so that efficiency is maximized.     

小型水电站联网改造应注意的几个问题

针对铜鼓县小水电站联网时存在的问题及其不利影响进行了分析，井提出了改进途径，指出小水电站的联网改造应立足安全，争取效益。     

The pickup and delivery problem: Faces and branch-and-cut algorithm

This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented.     

中原油田深井大井眼段钻井液工艺

濮深8井是中原油田在西部洼陷南部寻找接替储量的一口重点深探井,也是中原油田第一口井深达6000m的超深井。分析了濮深8井钻井液的配备及维护和处理技术,得出深井大井眼段钻井液工艺技术存在以下问题:井眼大,钻井液量及钻屑量多,处理时间长,处理剂用量多,处理频繁;返速低使钻井液清洗井眼的能力减弱;井下温度高使处理剂的作用明显降低,二氧化碳的侵入使钻井液性能变差。钻井液维护处理的较好方法是定时、定量补充处理剂胶液。固相控制是深井大井眼段钻井液工艺中的关键问题,必须配套并且有效地使用固控设备,以维护好钻井液性能。     

采金船采选工艺流程病症诊治专家系统

应用专家系统理论，建立了采金船采选工艺流程病症诊治专家系统，此系统对于采金船采选工艺流程中存在的技术病症，具有诊断、治理及致因分析等功能．     

Compile-time copy elimination

Single-assignment and functional languages have value semantics that do not permit side-effects. This lack of side-effects makes automatic detection of parallelism and optimization for data locality in programs much easier. However, the same property poses a challenge in implementing these languages efficiently. This paper describes an optimizing compiler system that solves the key problem of aggregate copy elimination. The methods developed rely exclusively on compile-time algorithms, including interprocedural analysis, that are applied to an intermediate data flow representation. By dividing the problem into update-in-place and build-in-place analysis, a small set of relatively simple techniques—edge substitution, graph pattern matching, substructure sharing and substructure targeting—was found to be very powerful. If combined properly and implemented carefully, the algorithms eliminate unnecessary copy operations to a very high degree. No run-time overhead is imposed on the compiled programs.     

填料萃取塔液泛速度的计算

介绍了三种有代表性的填料萃取塔的液泛速度计算公式，并通过它们用于三种典型的液-液实验体系和两种不同填料的计算结果的比较，对这些公式的适用范围进行了讨论。     

泥浆制备中工艺改造的研究

根据室条件下粉磨试验结果，发现球磨过程中筛上料变化存在的突变范围，提出两次加料一次加水可改变泥浆颗粒分布，并找出适宜的加料种类与时间。另外给予测粒度分布提供了宝贵的试验基础数据。