基于熵权TOPSIS的工程咨询机构BIM技术应用能力评价

构建工程咨询机构BIM技术应用能力评价的指标体系,提出改进的熵权TOPSIS评价模型,以4个典型的工程咨询单位为例,进行BIM技术运用能力评价。研究表明,BIM行业的整体水平已经有了明显的提升,但是区域间的发展还存在一定差距。     

Friction compensation controller for load varying machine tool feed drive

The load applied to a machine tool feed drive changes during the machining process as material is removed. This load change alters the Coulomb friction of the feed drive. Because Coulomb friction accounts for a large part of the total friction the friction compensation control accuracy of the feed drives is limited if this nonlinear change in the applied load is not considered. This paper presents a new friction compensation method that estimates the machine tool load in real time and considers its effect on friction characteristics. A friction observer based on a Kalman filter with load estimation is proposed for friction compensation control considering the applied load change. A specially designed feed drive testbed that enables the applied load to be modified easily was constructed for experimental verification. Control performance and friction estimation accuracy are demonstrated experimentally using the testbed.     

GOS+MU:一种查询对象选择新方法

在分析单一MU(Most Uncertainty)采样缺陷的基础上,提出一种"全局最优搜寻"方法 GOS(Global Optimal Search),并结合MU共同完成查询选择。GOS+MU方法中,GOS着眼全局寻找目标,在应用环境能提供的训练样本数量有限、分类器受训不充分时,该方法选择的对象学习价值高,能快速推进分类器学习进程;MU则能够在GOS采样失效情形下,利用分类器当前训练成果,选择查询不确定性最强的样本补充训练集。通过对网络商品的用户评论进行分类仿真,并比较其他采样学习方法的效果,证明了GOS+MU方法在压缩学习成本、提高训练效率方面的有效性。     

Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers

The knowledge of turbo code's minimum Hamming distance (d_min) and its corresponding codeword multiplicity (A_min) is of a great importance because the error correction capability of a code is strongly tied to the values of d_min and A_min. Unfortunately, the computational complexity associated with the search for d_min and A_min can be very high, especially for a turbo code that has high d_min value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of d_min and A_min values. © 2014 The Authors. International Journal of Communication Systems published by John Wiley & Sons, Ltd.     

Influence of Bridgman solidification on microstructures and magnetic behaviors of a non-equiatomic FeCoNiAlSi high-entropy alloy

The non-equiatomic FeCoNiAlSi alloy is prepared by the Bridgman solidification (BS) technique at different withdrawal velocities (V = 30, 100, and 200 μm/s). Various characterization techniques have been used to study the microstructure and crystal orientation. The morphological evolutions accompanying the crystal growth of the alloy prepared at different withdrawal velocities are nearly the same, from equiaxed grains to columnar crystals. The transition of coercivity is closely related to the local microstructure, while the saturation magnetization changes little at different sites. The coercivity can be significantly reduced from the equiaxed grain area to the columnar crystal area when the applied magnetic field direction is parallel to the crystal growth direction, no matter what is the withdrawal velocity. In addition, the alloy possesses magnetic anisotropy when the applied magnetic field is in different directions.     

Automated network management and configuration using Probabilistic Trans-Algorithmic Search

Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search.     

灵芝菌丝体多糖的分离纯化及其单糖组成分析与分子量测定

前期杂交优化后赤芝菌种经液体深层发酵后,提取灵芝菌丝体多糖,并过DEAE-Sepharose Fast Flow柱分离纯化,利用高效体积排阻色谱(HPSEC)检测多糖级分的纯度,采用完全酸水解PMP柱前衍生化RP—HPLC测定多糖级分的单糖组成,多角度光散射仪联用装置(SEC—MALLS)测定其绝对重均分子量(Mw),并且根据分子旋转半径与分子摩尔数的关系曲线斜率初步推断其空间构象。结果显示:分离纯化得到3个多糖级分GLMP1、GLMP2和GLMP3,HPSEC检测其峰面积百分比分别为93.58%,97.64%,99.19%,单糖组成分析结果表明GLMP1、GLMP2和GLMP3均含有甘露糖、鼠李糖、半乳糖醛酸、葡萄糖、半乳糖、木糖、阿拉伯糖和岩藻糖,但单糖摩尔比各异。SEC—MALLS测试GLMP1、GLMP2和GLMP3的Mw分别为4.526×105,4.603×104,3.760×103 g/mol,3个多糖级分构象可能均为高度紧缩且具有分支结构的聚合物。     

LTE系统多小区上行联合功控算法

针对传统的小区内开环功率控制算法通常以提升本小区的吞吐量性能为目标，忽略了当前小区用户对邻小区用户同频干扰的问题，为提升边缘用户性能的同时兼顾系统整体性能，提出了一种LTE系统小区间上行联合功率控制（UJPC）算法。该算法采用单基站三扇区为系统模型，以最优化系统吞吐量比例公平函数为目标，首先根据最小信干噪比（SINR）约束值和用户最大发射功率这两个约束条件得到相应的数学优化模型，然后采用连续凸近似的方法求解优化问题得出各个基站所管辖的小区内所有用户的最优发射功率。仿真结果表明，与基准的开环功控方案相比，联合功控方案在保证系统平均频谱利用率的情况下能够较大幅度地提高小区边缘频谱利用率，其最佳性能增益能达到50%。