箍筋末端135度弯钩二次就位法讨论

随着人们对建筑安全的日益重视 ,对建筑抗震要求的提高 ,国内外有关规范都对箍筋末端的设置作了明确规定 ,要求做成 135度弯钩。而在工程实践中 ,由于施工上的技术困难 ,很多工程都只设置成 90度弯钩。笔者提出的箍筋末端 135度弯钩二次就位法在基本不增加 90度弯钩施工难度与费用的基础上实现了 135度弯钩的施工 ,其法是可行的     

半连续式棒材轧机在线捆扎机及其工艺设置

由北京冶金设备制造厂设计的YSK6型钢丝捆扎机，共设有并列6台棒材捆扎车，每台捆扎车由中间收送机、成形捆扎机、液压装置、捆扎辊道和台车组合而成。按生产工艺参数要求，整个成型捆扎周期为30秒。捆扎后的棒材在成品称重时用电子秤，每称量一次均可打印出单次净值、累加值和累加次数值。     

On-line H NMR spectroscopic investigation of hydrogen bonding in supercritical and near critical CO2–methanol up to 35 MPa and 403 K

On-line NMR spectroscopy can beneficially be applied to studies of supercritical and near-critical fluids as an alternative to optical spectroscopy. Up to now high pressure NMR experiments are predominantly accomplished using custom made NMR batch reactors. The authors present a novel high pressure cell with displacement plunger for on-line NMR experiments on compressible fluids which can be used in conjunction with commercially available SCF NMR flow probes. The on-line technique offers advantages compared to stopped flow techniques such as enhanced control of mixture composition and reaction parameters as well as the facility of engagement into the reaction. The new apparatus is used for NMR studies on hydrogen bonding of methanol in near critical and supercritical carbon dioxide up to 403 K and 35 MPa for which data on the chemical shift of the hydroxyl group and methyl group are reported and interpreted.     

A time aggregation approach to Markov decision processes

We propose a time aggregation approach for the solution of infinite horizon average cost Markov decision processes via policy iteration. In this approach, policy update is only carried out when the process visits a subset of the state space. As in state aggregation, this approach leads to a reduced state space, which may lead to a substantial reduction in computational and storage requirements, especially for problems with certain structural properties. However, in contrast to state aggregation, which generally results in an approximate model due to the loss of Markov property, time aggregation suffers no loss of accuracy, because the Markov property is preserved. Single sample path-based estimation algorithms are developed that allow the time aggregation approach to be implemented on-line for practical systems. Some numerical and simulation examples are presented to illustrate the ideas and potential computational savings.     

单光子时间分辨在线谱仪系统中的接口电路

本文介绍单光子时间分辨在线谱仪系统中的多道分析器与IBM PC/XT微型计算机接口的工作原理及控制程序。     

油田热采注汽管道在线检测技术现状

稠油热采注汽管道由于长期在高温、高压下运行,极易发生各种损伤,如腐蚀、裂纹、材料退化等,极易造成管道承压能力降低,发生失效事故。如何检测出潜在危险性缺陷,判断注汽管道能否继续使用,是保证注汽管道安全运行的关键问题。探讨了高温压力管道在线检测技术发展现状及其应用范围。     

Fast, large-scale model predictive control by partial enumeration

Partial enumeration (PE) is presented as a method for treating large, linear model predictive control applications that are out of reach with available MPC methods. PE uses both a table storage method and online optimization to achieve this goal. Versions of PE are shown to be closed-loop stable. PE is applied to an industrial example with more than 250 states, 32 inputs, and a 25-sample control horizon. The performance is less than 0.01% suboptimal, with average speedup factors in the range of 80-220, and worst-case speedups in the range of 4.9-39.2, compared to an existing MPC method. Small tables with only 25-200 entries were used to obtain this performance, while full enumeration is intractable for this example.     

On-Line File Caching

Abstract. Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost , maintain a cache of files of total size at most some specified k so as to minimize the total retrieval cost. Specifically, when a requested file is not in the cache, bring it into the cache and pay the retrieval cost, and remove other files from the cache so that the total size of files remaining in the cache is at most k . This problem generalizes previous paging and caching problems by allowing objects of arbitrary size and cost, both important attributes when caching files for world-wide-web browsers, servers, and proxies. We give a simple deterministic on-line algorithm that generalizes many well-known paging and weighted-caching strategies, including least-recently-used, first-in-first-out, flush-when-full, and the balance algorithm. On any request sequence, the total cost incurred by the algorithm is at most k/(k-h+1) times the minimum possible using a cache of size h ≤ k . For any algorithm satisfying the latter bound, we show it is also the case that for most choices of k , the retrieval cost is either insignificant or at most a constant (independent of k ) times the optimum. This helps explain why competitive ratios of many on-line paging algorithms have been typically observed to be constant in practice.     

钢管在线测厚和应用

钢管在线测厚是近年发展较快的一项高科技技术，该设备对生产高质量的无缝钢管具有较大帮助。叙述了钢管在线测厚的基本原理和在宝钢钢管分公司张减机上使用的实绩。     

Average-case analysis of the Modified Harmonic algorithm

In this paper we analyze the average-case performance of the Modified Harmonic algorithm for on-line bin packing. We first analyze the average-case performance for arbitrary distribution of item sizes over (0,1]. This analysis is based on the following result. Letf ₁ andf ₂ be two linear combinations of random variables {N _i } _i=1 ^k where theN _i 's have a joint multinomial distribution for eachn= _i=1 ^k ,N _i . LetE(f ₁) O andE(f ₂) 0. Then lim_n E(max(_{f 1},f ₂ ))/n = lim _n max(E(f ₁),E(f ₂))/n. We then consider the special case when the item sizes are uniformly distributed over (0,1]. For specific values of the parameters, the Modified Harmonic algorithm turns out to be better than the other two linear-time on-line algorithms—Next Fit and Harmonic—in both the worst case as well as the average case. We also obtain optimal values for the parameters of the algorithm from the average-case standpoint. For these values of the parameters, the average-case performance ratio is less than 1.19. This compares well with the performance ratios 1.333. and 1.2865. of the Next Fit algorithm and the Harmonic algorithm, respectively.