论携号转网行为的私法规制

以电信用户入网协议为切入点,电信用户的携号转网行为应受到《合同法》《消费者权益保护法》等私法规范的保护与限制。该行为引起的格式条款解释、合同终止、违约责任、损失赔偿等问题,不能仅靠《电信条例》等公法规范来调整。应当积极引导广大消费者用户以私法领域相关规定为依据,转变争议解决思维,拓宽纠纷处理途径,合理选择维权手段,以保护自身合法民事权益,与行业监管部门共同推动电信行业有序发展。     

柠檬酸铋合成新工艺研究

针对现有柠檬酸铋制备工艺合成时间长、能耗高、产品纯度不高等不足,介绍了一种常温下制备柠檬酸铋的新工艺。新工艺制备时间短,制备的柠檬酸铋产品质量好,合成过程产生的废水可循环利用,废气经碱液循环吸收可生产硝酸钠副产品。     

黑龙江省节水增粮行动(2012—2015年)实施方案

文章通过对黑龙江省高效节水现状,存在问题的分析,结合黑龙江省高效节水发展的支撑能力,阐述黑龙江省节水增粮目标、任务及总体布局,为黑龙江省2012—2015年节水增粮实施提供依据。     

A new wavelet based fault detection,classification and location in transmission lines

This paper deals with the application of wavelet transforms for the detection, classification and location of faults on transmission lines. A Global Positioning System clock is used to synchronize sampling of voltage and current signals at both the ends of the transmission line. The detail coefficients of current signals of both the ends are utilized to calculate fault indices. These fault indices are compared with threshold values to detect and classify the faults. Artificial Neural Networks are employed to locate the fault, which make use of approximate decompositions of the voltages and currents of local end. The proposed algorithm is tested successfully for different locations and types of faults.     

施工中电焊机的安全使用简述

从电焊机自身电气特点及建筑工地工作环境入手,探讨电焊机安全技术的实施方法。分析电焊机安全隐患及事故的分类以及电焊机在使用过程中产生危险的原因。介绍电焊机在安装以及作业过程中的安全措施。     

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.