四百吨人造板冷压机下工作台的有限元法计算

本文采用有限元法设计的400吨人造板冷压机下工作台、结构简单,制造工艺性好,成本低,安全可靠。     

云南老厂银铅锌矿区火山岩特征

根据云南老厂火山岩的岩石学、岩石化学成分特征,可将下石炭统火山岩划分为5层、4旋回、4相、3个相组。其中:C_1～C_1~3为岛弧型玄武岩系列,C_1~4和次火山岩为大陆板块边沿裂谷碱性玄武岩系列,C_1~3为C_1~2钠质粗面质岩浆与C_1~4碱性玄武岩浆混合作用的产物。     

A tight lower bound for job scheduling with cancellation

The Job Scheduling with Cancellation problem is a variation of classical scheduling problems in which jobs can be cancelled while waiting for execution. In this paper we prove a tight lower bound of 5 for the competitive ratio of any deterministic online algorithm for this problem, for the case where all jobs have the same processing time.     

关于背包问题下界的估计

文献［１］讨论了线性背包问题的解的关系及小容量背包问题的下界。本文分析了与之相关的一些问题，并给出了较文献［１］中更为精确的下界估计式。     

电力系统低频振荡的在线辨识

本文介绍了首次应用辨识方法于电力系统实时在线测试低频振荡。利用这种方法可以随时研究运行系统的低频振荡情况，１９９１年１０月试验证实了网络中的ＳＸＫ电厂是该系统的低频振荡源。     

塔里木盆地西部古生代牙形刺与有机质成熟度

对塔里枯木要盆地西部巴楚断隆,阿瓦提凹陷古生代产出的牙形刺化石进行了研究。建立了５个牙形刺化石组合带,讨论了其地史分布及其地质时代,牙形刺化石颜色指标研究表明,巴楚断隆区古生代地层中的烃源岩正处在热演化的成熟期,寻找古生代油气藏应成为该构造带今后勘探的重点;阿瓦提凹陷古生代石炭系的烃源岩已经处于热演化的高成熟期,寻找古生代凝析油气藏应成为本区今后勘探的重点。     

赤峰红花沟清河镇动物群的特征及层位对比

总结了赤峰红花沟石头道村清河镇动物群化石特征，根据其中发现的梅树村动物群分子Microcornus（？），Coleoloides和Rugatotheca，结合国内外资料认为该区发现的清河镇动物群相当于梅树村阶第1～第3小壳化石组合，得出该区含化石的硅质大理岩层时代应归属早寒武世早期的结论．进而提出该区太古宇建平群小塔子沟组中包含有早寒武世地层．     

A strong lower bound for approximate nearest neighbor searching

We prove a lower bound of d^1−o(1) on the query time for any deterministic algorithms that solve approximate nearest neighbor searching in Yao's cell probe model. Our result greatly improves the best previous lower bound for this problem, which is [A. Chakrabarti et al., in: Proc. 31st Ann. ACM Symp. Theory of Computing, 1999, pp. 305-311]. Our proof is also much simpler than the proof of A. Chakrabarti et al.     

The most nonelementary theory

We give a direct proof by generic reduction that testing validity of formulas in a decidable rudimentary theory Ω of finite typed sets (Henkin, Fundamenta Mathematicæ 52 (1963) 323–344) requires space and time exceeding infinitely often(1)where n denotes the length of input. This gives the highest currently known lower bound for a decidable logical theory and affirmatively settles Problem 10.13 from (Compton and Henson, Ann. Pure Applied Logic 48 (1990) 1–79):

Is there a “natural” decidable theory with a lower bound of the form exp_∞(f(n)), where f is not linearly bounded?

The highest previously known lower (and upper) bounds for “natural” decidable theories, like WS1S, S2S, are of the form exp_∞(dn), with just linearly growing stacks of twos.Originally, the lower bound (1) for Ω was settled in (12th Annual IEEE Symposium on Logic in Computer Science (LICS’97), 1997, 294–305) using the powerful uniform lower bounds method due to Compton and Henson, and probably would never be discovered otherwise. Although very concise, the original proof has certain gaps, because the method was pushed out of the limits it was originally designed and intended for, and some hidden assumptions were violated. This results in slightly weaker bounds—the stack of twos in (1) grows subexponentially, but superpolynomially, namely, as for formulas with fixed quantifier prefix, or as 2^cn/log(n) for formulas with varying prefix. The independent direct proof presented in this paper closes the gaps and settles the originally claimed lower bound (1) for the minimally typed, succinct version of Ω.     

Some history of the hierarchical Bayesian methodology

Summary A standard technique in subjective “Bayesian” methodology is for a subject (“you”) to make judgements of the probabilities that a physical probability lies in various intervals. In the hierarchical Bayesian technique you make probability judgements (of a higher type, order, level, or stage) concerning the judgements of lower type. The paper will outlinesome of the history of this hierarchical technique with emphasis on the contributions by I. J. Good because I have read every word written by him.