泛在电力物联网在北京经济技术开发区的应用探索

泛在电力物联网是物联网在电力领域的具体体现，建设泛在电力物联网是推进"三型两网"建设的关键环节，也是实现能源转型的必要手段。阐述了泛在电力物联网的定义，从供电公司角度出发，根据北京经济技术开发区实际情况，讨论了依托地区特点的泛在电力物联网实施策略和实际应用场景，分析了可能遇到的问题。得出结论：随着泛在电力物联网的深入建设，供电公司能够为电力客户提供多元化服务，提高客户满意度；地市供电公司能够依托泛在电力物联网开展更多电力相关业务；泛在电力物联网的安全性、实用性、有效性是发展面临的首要问题。     

Lagrangian relaxation hybrid with evolutionary algorithm for short-term generation scheduling

Short-term generation scheduling is an important function in daily operational planning of power systems. It is defined as optimal scheduling of power generators over a scheduling period while respecting various generator constraints and system constraints. Objective of the problem includes costs associated with energy production, start-up cost and shut-down cost along with profits. The resulting problem is a large scale nonlinear mixed-integer optimization problem for which there is no exact solution technique available. The solution to the problem can be obtained only by complete enumeration, often at the cost of a prohibitively computation time requirement for realistic power systems. This paper presents a hybrid algorithm which combines Lagrangian Relaxation (LR) together with Evolutionary Algorithm (EA) to solve the problem in cooperative and competitive energy environments. Simulation studies were carried out on different systems containing various numbers of units. The outcomes from different algorithms are compared with that from the proposed hybrid algorithm and the advantages of the proposed algorithm are briefly discussed.     

Global optimization for power dispatch problems based on theory of moments

Non-convex of an optimal power dispatch problem makes it difficult to guarantee the global optimum. This paper presents a convex relaxation approach, called the Moment Semidefinite Programming (MSDP) method, to facilitate the search for deterministic global optimal solutions. The method employs a sequence of moments, which can linearize polynomial functions and construct positive semidefinite moment matrices, to form an SDP convex relaxation for power dispatch problems. In particular, the rank of the moment matrix is used as a sufficient condition to ensure the global optimality. The same condition can also be leveraged to estimate the number of global optimal solution(s). This method is effectively applied to {0,1}-economic dispatch (ED) problems and optimal power flow (OPF) problems. Simulation results showed that the MSDP method is capable of solving {0,1}-ED problems with integer values directly, and is able to identify if more than one global optimal solutions exist. In additional, the method can obtain rank-1 moment matrices for OPF’s counterexamples of existing SDP method, this ensures the global solution and overcomes the problem that existing SDP method cannot meet the rank-1 condition sometimes.     

中子平衡节块离散纵标法及CMFD加速技术研究

本文基于横向积分离散纵标方程,解析得到横向积分通量中出射通量与入射通量的关系,并根据类似于扩散方程节块展开法的输运节块中子平衡方程形式,得到了一种高效的节块离散纵标法数值迭代策略。数值结果表明,本文提出的方法可行且数值结果正确。此外,粗网有限差分(CMFD)加速技术在节块离散纵标法中也取得了非常好的应用效果。     

Maximum Data Generation Rate Routing Protocol Based on Data Flow Controlling Technology for Rechargeable Wireless Sensor Networks

For rechargeable wireless sensor networks, limited energy storage capacity, dynamic energy supply, low and dynamic duty cycles cause that it is unpractical to maintain a fixed routing path for packets delivery permanently from a source to destination in a distributed scenario. Therefore, before data delivery, a sensor has to update its waking schedule continuously and share them to its neighbors, which lead to high energy expenditure for reestablishing path links frequently and low efficiency of energy utilization for collecting packets. In this work, we propose the maximum data generation rate routing protocol based on data flow controlling technology. For a sensor, it does not share its waking schedule to its neighbors and cache any waking schedules of other sensors. Hence, the energy consumption for time synchronization, location information and waking schedule shared will be reduced significantly. The saving energy can be used for improving data collection rate. Simulation shows our scheme is efficient to improve packets generation rate in rechargeable wireless sensor networks.     

计及Spark和属性权重的售电套餐推荐方法

针对电力市场用户群庞大，交易过程中售电套餐选择困难的问题，在Spark环境下设计了一种售电套餐推荐方法，同时也解决了售电套餐推荐过程中在大数据环境下的可扩展性及实时性问题。首先，计算出每个套餐属性的权重值，从而计算得到售电套餐综合相似度。然后，计及用户和套餐两方面提出一种售电套餐推荐方法，实现售电套餐的精准推荐。实验表明，提出的推荐方法能够明显提高推荐的准确度，并且在分布式环境下具有良好的推荐效率和可扩展性。     

应用膨胀算法提取目标的直接定位算法

为了解决被动雷达系统中的多发射源定位问题，提出了一种基于多重信号分类(MUSIC)算法和图像膨胀(IE)算法的直接定位方法。该方法结合了谱分析中的MUSIC思想，通过对接收量测协方差矩阵进行特征分析求解目标的位置。首先，在目标个数未知的前提下，利用Akaike信息准则(AIC)来确定模型阶数；然后，推导了基于MUSIC的定位代价函数；之后，利用图像膨胀算法处理得到的代价函数平面；最后，膨胀处理后的输出为目标个数及目标位置的估计值。提出的算法有效地解决了目标检测及提取的问题，能够确定多个目标的位置坐标，为后续的定位性能分析提供可能性，也保证了算法的完整性。进一步地分析了多个临近目标情况下影响目标提取性能的主要因素。     

Activity-Directed Synthesis: A Flexible Approach for Lead Generation

Activity-directed synthesis (ADS) is a structure-blind, functional-driven molecular discovery approach. In this Concept, four case studies highlight the general applicability of ADS and showcase its flexibility to support different medicinal chemistry strategies. ADS deliberately harnesses reactions with multiple possible outcomes, and allows many chemotypes to be evaluated in parallel. Resources are focused on bioactive molecules, which emerge in tandem with associated synthetic routes. Some of the future challenges for ADS are highlighted, including the realisation of an autonomous molecular discovery platform. The prospects for ADS to become a mainstream lead generation approach are discussed.     

基于关键路径延时检测的自适应电压缩减技术

为了减小传统的最差情况设计方法引入的电压裕量,提出了一种变化可知的自适应电压缩减(AVS)技术,通过调整电源电压来降低电路功耗.自适应电压缩减技术基于检测关键路径的延时变化,基于此设计了一款预错误原位延时检测电路,可以检测关键路径延时并输出预错误信号,进而控制单元可根据反馈回的预错误信号的个数调整系统电压.本芯片采用SMIC180 nm工艺设计验证,仿真分析表明,采用自适应电压缩减技术后,4个目标验证电路分别节省功耗12.4％,11.3％,10.4％和11.6％.