Noncentrosymmetric Tetrel Pnictides RuSi4P4 and IrSi3P3: Nonlinear Optical Materials with Outstanding Laser Damage Threshold

Noncentrosymmetric (NCS) tetrel pnictides have recently generated interest as nonlinear optical (NLO) materials due to their second harmonic generation (SHG) activity and large laser damage threshold (LDT). Herein nonmetal-rich silicon phosphides RuSi₄P₄ and IrSi₃P₃ are synthesized and characterized. Their crystal structures are reinvestigated using single crystal X-ray diffraction and ²⁹Si and ³¹P magic angle spinning NMR. In agreement with previous report RuSi₄P₄ crystallizes in NCS space group P1, while IrSi₃P₃ is found to crystallize in NCS space group Cm, in contrast with the previously reported space group C2. A combination of DFT calculations and diffuse reflectance measurements reveals RuSi₄P₄ and IrSi₃P₃ to be wide bandgap (E_g) semiconductors, E_g = 1.9 and 1.8 eV, respectively. RuSi₄P₄ and IrSi₃P₃ outperform the current state-of-the-art infrared SHG material, AgGaS₂, both in SHG activity and laser inducer damage threshold. Due to the combination of high thermal stabilities (up to 1373 K), wide bandgaps (≈2 eV), NCS crystal structures, strong SHG responses, and large LDT values, RuSi₄P₄ and IrSi₃P₃ are promising candidates for longer wavelength NLO materials.     

Automatic design for shop scheduling strategies based on hyper-heuristics: A systematic review

Against the background of smart manufacturing and Industry 4.0, how to achieve real-time scheduling has become a problem to be solved. In this regard, automatic design for shop scheduling based on hyper-heuristics has been widely studied, and a number of reviews and scheduling algorithms have been presented. Few studies, however, have specifically discussed the technical points involved in algorithm development. This study, therefore, constructs a general framework for automatic design for shop scheduling strategies based on hyper-heuristics, and various state-of-the-art technical points in the development process are summarized. First, we summarize the existing types of shop scheduling strategies and classify them using a new classification method. Second, we summarize an automatic design algorithm for shop scheduling. Then, we investigate surrogate-assisted methods that are popular in the current algorithm field. Finally, current problems and challenges are discussed, and potential directions for future research are proposed.     

THE effect of Srandom DOPANT fluctuation on threshold voltage and drain current variation in junctionless nanotransistors

We investigate the effect of dopant random fluctuation on threshold voltage and drain current variation in a two-gate nanoscale transistor. We used a quantum-corrected technology computer aided design simulation to run the simulation (10000 randomizations). With this simulation, we could study the effects of varying the dimensions (length and width), and thicknesses of oxide and dopant factors of a transistor on the threshold voltage and drain current in subthreshold region (off) and overthreshold (on). It was found that in the subthreshold region the variability of the drain current and threshold voltage is relatively fixed while in the overthreshold region the variability of the threshold voltage and drain current decreases remarkably, despite the slight reduction of gate voltage diffusion (compared with that of the subthreshold). These results have been interpreted by using previously reported models for threshold current variability, load displacement, and simple analytical calculations. Scaling analysis shows that the variability of the characteristics of this semiconductor increases as the effects of the short channel increases. Therefore, with a slight increase of length and a reduction of width, oxide thickness, and dopant factor, we could correct the effect of the short channel.     

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.     

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

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

面向电信承载网的监控系统设计与实现

面对电信承载网连接的日益增长的海量终端设备，运营商需要结合网络拓扑对终端设备产生的数据进行高效的汇聚统计、异常分析、故障定位处理等操作。针对已有系统存在的操作困难、分析效率低等问题，设计与实现了一个面向电信承载网的高效监控系统，提供实时与离线数据分析和多维可视化分析的能力。对网管、认证、终端等系统及设备采集的数据进行结构化存储，对采集的数据进行拓扑相关性和时间序列方法分析，根据分析结果实现基于动态阈值控制的异常实时告警、定位等操作，并提供多维度可视化分析对网络状态进行实时监控。实际应用结果表明，该系统性能优异，具有良好交互性，能较好地满足承载网运维人员业务分析需求。     

基于组合双向拍卖的云资源调度方法

针对跨数据中心的资源调度问题，提出了一种基于组合双向拍卖（PCDA）的资源调度方案。首先，将云资源拍卖分为三个部分：云用户代理报价、云资源提供商要价、拍卖代理组织拍卖；其次，在定义用户的优先级及任务紧迫度的基础上，在拍卖过程中估算每一个工作发生的服务等级协议（SLA）违规并以此计算云提供商的收益，同时每轮竞拍允许成交多项交易；最终达到根据用户等级合理分配云资源调度的效果。仿真实验结果表明该算法保证了竞拍成功率，与传统一次拍卖成交一项的组合双向拍卖方案相比，PCDA在竞拍时间段产生的能耗降低了35.00%，拍卖云提供商的利润提高了约38.84%。     

Supply chain planning and scheduling integration using Lagrangian decomposition in a knowledge management environment

The integration of planning and scheduling decisions in rigorous mathematical models usually results in large scale problems. In order to tackle the problem complexity, decomposition techniques based on duality and information flows between a master and a set of subproblems are widely applied. In this sense, ontologies improve information sharing and communication in enterprises and can even represent holistic mathematical models facilitating the use of analytic tools and providing higher flexibility for model building. In this work, we exploit this ontologies’ capability to address the optimal integration of planning and scheduling using a Lagrangian decomposition approach. Scheduling/planning sub-problems are created for each facility/supply chain entity and their dual solution information is shared by means of the ontological framework. Two case studies based on a STN representation of supply chain planning and scheduling models are presented to emphasize the advantages and limitations of the proposed approach.     

Multi-resource scheduling for FPGA systems

In modern cloud data centers, reconfigurable devices (FPGAs) are used as an alternative to Graphics Processing Units to accelerate data-intensive computations (e.g., machine learning, image and signal processing). Currently, FPGAs are configured to execute fixed workloads, repeatedly over long periods of time. This conflicts with the needs, proper to cloud computing, to flexibly allocate different workloads and to offer the use of physical devices to multiple users. This raises the need for novel, efficient FPGA scheduling algorithms that can decide execution orders close to the optimum in a short time. In this context, we propose a novel scheduling heuristic where groups of tasks that execute together are interposed by hardware reconfigurations. Our contribution is based on gathering tasks around a high-latency task that hides the latency of tasks, within the same group, that run in parallel and have shorter latencies. We evaluated our solution on a benchmark of 37500 random workloads, synthesized from realistic designs (i.e., topology, resource occupancy). For this testbench, on average, our heuristic produces optimum makespan solutions in 47.4% of the cases. It produces acceptable solutions for moderately constrained systems (i.e., the deadline falls within 10% of the optimum makespan) in 90.1% of the cases.     

Demand response for home energy management system

The optimization of energy consumption, with consequent cost reduction, is one of the main challenges for the present and future smart grid. Demand response (DR) program is expected to be vital in home energy management system (HEMS) which aims to schedule the operation of appliances to save energy costs by considering customer convenience as well as characteristics of electric appliances. The DR program is a challenging optimization problem especially when the formulations are non-convex or NP-hard problems. In order to solve this challenging optimization problem efficiently, an effective heuristic approach is proposed to achieve a near optimal solution with low computational costs. Different from previously proposed methods in literatures which are not suitable to be run in embedded devices such as a smart meter. The proposed algorithm can be implemented in an embedded device which has severe limitations on memory size and computational power, and can get an optimal value in real-time. Numerical studies were carried out with the data simulating practical scenarios are provided to demonstrate the effectiveness of the proposed method.