工字梁的抗剪极限承载力

对工字梁腹板抗剪极限承载力的研究进行总结,对各种公式与文献中的试验结果进行对比,将拉力场理论和转向应力场理论的假定与ANSYS分析揭示的腹板应力发展变化规律进行对比,指出了假定和数值分析结果的不一致。提出了翼缘对腹板转动约束的合理参数,得到精度良好的考虑翼缘约束的腹板剪切屈曲系数。利用得到的屈曲系数,考虑翼缘抗弯承载力的贡献,提出新的工字梁抗剪极限承载力的计算公式。与现有试验数据和ANSYS非线性有限元分析结果的对比,证实建议方法离散性较小,适用范围广,尤其是对于通用高厚比较大的梁,较以往方法有了较大改进。     

高层建筑结构设计的分析判断与优化

对高层建筑设计而言,设计前期的初步结构方案需通过结构软件的计算分析,判断该方案是否正确与合理,从而对其进行有针对性的修改和优化。文章结合具体实例,介绍了分析判断计算结果的主要几项内容及可采取的相应优化措施,从而可以提高设计的准确性和工作效率。     

基于基尼系数的Web社区稳定性度量

Web社区是互联网中自组织程度较高的部分,它不是一个孤立系统,而是一个耗散系统,很多时候涨落无法耗散摔,导致社区运行不稳定.基尼系数可以用来衡量Web社区稳定性,通过基尼系数的简易计算公式计算社区内部成员积分或者其它参数,可以得出Web社区稳定性的度量.该度量对于研究和利用Web社区具有重要参考意义.     

Studies of substrate specificities of lipases from different sources

Although lipases are widely applied in a wide variety of reactions, available information on the factors that are responsible for the substrate specificities of lipases from different sources is scarce. In this paper, nine lipase‐producing microorganism strains were isolated from oil‐containing samples. The properties of these enzymes, including pH optima, temperature optima, thermal stability, and pH stability, vary significantly with the different sources from which these lipases were isolated. The substrate specificities of the nine lipases, including fatty acid and positional specificities, were also studied. The fatty acid specificities of the nine lipases were observably different toward 15 substrates with different carbon chain lengths, different saturation degrees and different side chains. The lipases from S₃ Penicillium citrinum (PCL), MJ₁ Aspergillus niger (ANL), MJ₂ Aspergillus oryzae (AOL), YM Bacillus coughing (BCL), S₉ Geotrichum candidum (GCL), and S₁₁ Candida lypolytica (CLL) showed the strongest specificities to short‐chain esters, and the other lipases showed strong selectivity for medium‐ or long‐chain and branched esters. The positional specificities were examined by analyzing the hydrolytic products of triolein catalyzed by the nine lipases, using TLC. The lipases can be mainly classified into two groups by their specificities for the ester bond at position 2 of triglycerides; one group can selectively hydrolyze the ester bond at position 2 of the triglycerides, the other group cannot. All these nine lipases were divided into four groups by hierarchical clustering analysis on the basis of the results of fatty acid and positional specificities.     

Plasticity of feature-based selection in triple-conjunction search.

Two experiments examined the disruption of feature-based selection in triple-conjunction search at multiple target transfers. In Experiment 1, after 10 training sessions, a new target possessing previous distractor features was introduced. This produced disruption in RT and fixation number, but no disruption in feature-based selection. Specifically, there was a tendency to fixate objects sharing the target's contrast polarity and shape and this did not change even upon transfer to the new target. In Experiment 2, 30 training sessions were provided with three target transfers. At the first transfer, the results replicated Experiment 1. Subsequent transfers did not produce disruption on any measure. These findings are discussed in terms of strength theory, Guided Search, rule-based approaches to perceptual learning, and the area activation model. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Characterizing navigation maps for web applications with the NMM approach

This paper presents the Navigation Maps Modeling approach (NMM), which provides platform independent models for characterizing navigation maps of web applications. The NMM approach is conceived to obtain a trade off between high and low-level design notations. As high-level design notations, NMM models permit architectural details that may hinder the overall understanding of the web application to be left out. As low-level design notations, NMM models can easily be transformed into detailed architectural designs, which are very valuable at coding and maintenance stages.     

Integration of batching and scheduling for hot rolling production in the steel industry

This paper investigates the hot rolling production scheduling problem in the steel industry and proposes a new mixed integer programming model for this problem based on the monolithic modeling strategy that integrates batching and scheduling. Using this strategy, the new model can simultaneously schedule multiple turns and simultaneously determine the production timetable of these turns in a global optimal view. A long-term tabu search heuristic using frequency-based memory is developed to obtain near-optimal solutions for this problem. Three kinds of speed-up strategies are developed to accelerate the search procedure of the proposed tabu search. A practical scheduling system combining the proposed mathematical model and the tabu search heuristic has been developed and tested on instances collected from practical production data. The experimental results show that the proposed mathematical model and the tabu search heuristic outperform both the current manual scheduling method and the traditional serial method.     

郑411块超稠油试油试采工艺技术应用

郑411块沙三段地层疏松出砂、原油粘度高，属中深层超稠油，常规试油试采方法难以突破出油关，采用APR全通径氮气垫测试、地层与井筒复合防砂、水平井配合直井蒸汽吞吐、氮气泡沫封堵调剖和井筒加热举升稠油等配套工艺技术，取得了较好的效果，为中深层超稠油油藏的开发提供了技术思路。     

基于神经网络的智能检索系统

文章首先概述了当前大多数的搜索引擎的主要的弊端；然后着重介绍了智能检索系统的运行基本思路和售用算法，以及该算法在检索领域中运用的优点；最后指出，神经网络运用在检索领域，可解决网络管理中的诸多难题。     

Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times

In this article we study thetabu search (TS) method in an application for solving an important class of scheduling problems. Tabu search is characterized by integrating artificial intelligence and optimization principles, with particular emphasis on exploiting flexible memory structures, to yield a highly effective solution procedure. We first discuss the problem of minimizing the sum of the setup costs and linear delay penalties when N jobs, arriving at time zero, are to be scheduled for sequential processing on a continuously available machine. A prototype TS method is developed for this problem using the common approach of exchanging the position of two jobs to transform one schedule into another. A more powerful method is then developed that employs insert moves in combination with swap moves to search the solution space. This method and the best parameters found for it during the preliminary experimentation with the prototype procedure are used to obtain solutions to a more complex problem that considers setup times in addition to setup costs. In this case, our procedure succeeded in finding optimal solutions to all problems for which these solutions are known and a better solution to a larger problem for which optimizing procedures exceeded a specified time limit (branch and bound) or reached a memory overflow (branch and bound/dynamic programming) before normal termination. These experiments confirm not only the effectiveness but also the robustness of the TS method, in terms of the solution quality obtained with a common set of parameter choices for two related but different problems.