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

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

柠檬酸铋合成新工艺研究

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

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

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

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

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

High-resolution ISAR imaging of fast rotating targets based on pattern-coupled Bayesian strategy for multiple measurement vectors

Very high resolution inverse synthetic aperture radar (ISAR) imaging of fast rotating targets is a complicated task. There may be insufficient pulses or may introduce migration through range cells (MTRC) during the coherent processing interval (CPI) when we use the conventional range Doppler (RD) ISAR technique. With compressed sensing (CS) technique, we can achieve the high-resolution ISAR imaging of a target with limited number of pulses. Sparse representation based method can achieve the super resolution ISAR imaging of a target with a short CPI, during which the target rotates only a small angle and the range migration of the scatterers is small. However, traditional CS-based ISAR imaging method generally faced with the problem of basis mismatch, which may degrade the ISAR image. To achieve the high resolution ISAR imaging of fast rotating targets, this paper proposed a pattern-coupled sparse Bayesian learning method for multiple measurement vectors, i.e. the PC-MSBL algorithm. A multi-channel pattern-coupled hierarchical Gaussian prior is proposed to model the pattern dependencies among neighboring range cells and correct the MTRC problem. The expectation-maximization (EM) algorithm is used to infer the maximum a posterior (MAP) estimate of the hyperparameters. Simulation results validate the effectiveness and superiority of the proposed algorithm.