基于密集神经网络的灰度图像着色算法

针对在灰度图像着色领域中，传统算法信息提取率不高、着色效果不理想的问题，提出了基于密集神经网络的灰度图像着色算法，以实现改善着色效果，让人眼更好地观察图片信息的目的。利用密集神经网络的信息提取高效性，构建并训练了一个端到端的深度学习模型，对图像中的各类信息及特征进行提取。训练网络时与原图像进行对比，以逐渐减小网络输出结果的信息、分类等各类型的损失。训练完成后，只需向网络输入一张灰度图片，即可生成一张颜色饱满、鲜明逼真的彩色图片。实验结果表明，引入密集网络后，可有效改善着色过程中的漏色、细节信息损失、对比度低等问题，所提算法着色效果较基于VGG网络及U-Net、双流网络结构、残差网络（ResNet）等性能优异的先进着色算法而言取得了显著的改进。     

Breaking the search space symmetry in partitioning problems: An application to the graph coloring problem

Many problems consist in splitting a set of objects into different groups so that each group verifies some properties. In practice, a partitioning is often encoded by an array mapping each object to its group numbering. In fact, the group number of an object does not really matter, and one can simply rename each group to obtain a new encoding. That is what we call the symmetry of the search space in a partitioning problem. This property may be prejudicial for optimization methods such as evolutionary algorithms (EA) which require some diversity during the search.     

Oriented colorings of 2-outerplanar graphs

A graph G is 2-outerplanar if it has a planar embedding such that the subgraph obtained by removing the vertices of the outer face is outerplanar. The oriented chromatic number of an oriented graph H is defined as the minimum order of an oriented graph H^′ such that H has a homomorphism to H^′. In this paper, we prove that 2-outerplanar graphs are 4-degenerate. We also show that oriented 2-outerplanar graphs have a homomorphism to the Paley tournament QR₆₇, which implies that their (strong) oriented chromatic number is at most 67.     

Towards sustainable industry 4.0: A green real-time IIoT multitask scheduling architecture for distributed 3D printing services

As the keystones of the personalized manufacturing, the Industrial Internet of Things (IIoT) consolidated with 3D printing pave the path for the era of Industry 4.0 and smart manufacturing. By resembling the age of craft manufacturing, Industry 4.0 expedites the alteration from mass production to mass customization. When distributed 3D printers (3DPs) are shared and collaborated in the IIoT, a promising dynamic, globalized, economical, and time-effective manufacturing environment for customized products will appear. However, the optimum allocation and scheduling of the personalized 3D printing tasks (3DPTs) in the IIoT in a manner that respects the customized attributes submitted for each model while satisfying not only the real-time requirements but also the workload balancing between the distributed 3DPs is an inevitable research challenge that needs further in-depth investigations. Therefore, to address this issue, this paper proposes a real-time green-aware multi-task scheduling architecture for personalized 3DPTs in the IIoT. The proposed architecture is divided into two interconnected folds, namely, allocation and scheduling. A robust online allocation algorithm is proposed to generate the optimal allocation for the 3DPTs. This allocation algorithm takes into consideration meeting precisely the customized user-defined attributes for each submitted 3DPT in the IIoT as well as balancing the workload between the distributed 3DPs simultaneously with improving their energy efficiency. Moreover, meeting the predefined deadline for each submitted 3DPT is among the main objectives of the proposed architecture. Consequently, an adaptive real-time multi-task priority-based scheduling (ARMPS) algorithm has been developed. The built ARMPS algorithm respects both the dynamicity and the real-time requirements of the submitted 3DPTs. A set of performance evaluation tests has been performed to thoroughly investigate the robustness of the proposed algorithm. Simulation results proved the robustness and scalability of the proposed architecture that surpasses its counterpart state-of-the-art architectures, especially in high-load environments.     

Register allocation for write activity minimization on non-volatile main memory for embedded systems

Non-volatile memories are good candidates for DRAM replacement as main memory in embedded systems and they have many desirable characteristics. Nevertheless, the disadvantages of non-volatile memory co-exist with its advantages. First, the lifetime of some of the non-volatile memories is limited by the number of erase operations. Second, read and write operations have asymmetric speed or power consumption in non-volatile memory. This paper focuses on the embedded systems using non-volatile memory as main memory. We propose register allocation technique with re-computation to reduce the number of store instructions. When non-volatile memory is applied as the main memory, reducing store instructions will reduce write activities on non-volatile memory. To re-compute the spills effectively during register allocation, a novel potential spill selection strategy is proposed. During this process, live range splitting is utilized to split certain long live ranges such that they are more likely to be assigned into registers. In addition, techniques for re-computation overhead reduction is proposed on systems with multiple functional units. With the proposed approach, the lifetime of non-volatile memory is extended accordingly. The experimental results demonstrate that the proposed technique can efficiently reduce the number of store instructions on systems with non-volatile memory by 33% on average.     

栀子色素的提取与精制

对栀子色素的提取和精制进行了研究，提出了栀了黄色素和栀子蓝色素的生产工艺条件和方法：采用50％甲醇水溶液作浸取剂，在常温下，浸取时间为24h,栀子黄色素收率较高，为11％－12％。     

图的点可区别边染色算法研究

针对一般图设计了一种新型的点可区别边染色算法。该算法把概率思想和图染色相结合, 根据点可区别边染色的约束规则确立目标函数, 利用交换规则逐步寻优, 当目标函数的值满足要求时染色成功。给出详细算法步骤并进行了测试和分析, 实验结果表明该算法可以求出满足猜想的点可区别边色数。     

氨纶用聚酯二醇的研究

本文研究了聚酯二醇的生产工艺,重点研究了反应温度对生产工艺的影响以及原料已二酸与二元醇的投料比对产品酸值和羟值的影响,催化剂对产品质量的影响,并对产品着色原因进行了探讨。     

基于STeC的高速列车运行模型与算法

为了使高速列车正点运行到达目的车站,提出了基于STeC(时空一致性)语言的高速列车运行模型与算法。该模型具有位置触发自动调整高速列车运行的特点,实现动态确定高速列车制动点并保证列车正点到达目的车站,从而满足了高速列车运行实时系统对时间和空间的一致性要求。通过Matlab/Simulink的仿真测试,证明了该模型的正确性和有效性。