一种基于完全独立集的排课算法

班级、教师、课程、教室、时间是课表的基本要素,通过把排课转化为求图的完全独立集,解决了时间冲突问题和合班课问题;根据教室资源限制,对独立集的个数和大小进行控制,解决了教室完全匹配问题和一门课程的不同教室安排问题.为实现排课软件提供了一个面向实际的算法.     

Modalities in linear logic weaker than the exponential “of course”: Algebraic and relational semantics

We present a semantic study of a family of modal intuitionistic linear systems, providing various logics with both an algebraic semantics and a relational semantics, to obtain completeness results. We call modality a unary operator on formulas which satisfies only one rale (regularity), and we consider any subsetW of a list of axioms which defines the exponential of course of linear logic. We define an algebraic semantics by interpreting the modality as a unary operation on an IL-algebra. Then we introduce a relational semantics based on pretopologies with an additional binary relationr between information states. The interpretation of is defined in a suitable way, which differs from the traditional one in classical modal logic. We prove that such models provide a complete semantics for our minimal modal system, as well as, by requiring the suitable conditions onr (in the spirit of correspondence theory), for any of its extensions axiomatized by any subsetW as above. We also prove an embedding theorem for modal IL-algebras into complete ones and, after introducing the notion of general frame, we apply it to obtain a duality between general frames and modal IL-algebras.     

考虑EV充放电意愿的园区综合能源系统双层优化调度

随着电动汽车的普及度越来越高,工业园区的电动汽车用户日益增多,其充放电行为对园区综合能源系统规划和运行带来极大挑战。本文提出了考虑电动汽车充放电意愿的园区综合能源系统双层优化调度。首先基于动态实时电价、电池荷电量、电池损耗补偿、额外参与激励等因素建立充放电意愿模型,在此基础上得到改进的电动汽车充放电模型;然后,以园区综合能源系统总成本最小和电动汽车充电费用最小为目标建立双层优化调度模型,通过KKT条件将内层模型转化为外层模型的约束条件,从而快速稳定的实现单层模型的求解;最后,进行仿真求解,设置3种不同场景,对比了所提模型与一般充放电意愿模型,验证了文中所提引入EV充放电意愿模型的园区综合能源系统双层优化调度的有效性和可行性,具有一定的经济效益。     

A modified teaching–learning-based optimisation algorithm for bi-objective re-entrant hybrid flowshop scheduling

In this paper, a modified teaching–learning-based optimisation (mTLBO) algorithm is proposed to solve the re-entrant hybrid flowshop scheduling problem (RHFSP) with the makespan and the total tardiness criteria. Based on the simple job-based representation, a novel decoding method named equivalent due date-based permutation schedule is proposed to transfer an individual to a feasible schedule. At each generation, a number of superior individuals are selected as the teachers by the Pareto-based ranking phase. To enhance the exploitation ability in the promising area, the insertion-based local search is embedded in the search framework as the training phase for the TLBO. Due to the characteristics of the permutation-based discrete optimisation, the linear order crossover operator and the swap operator are adopted to imitate the interactions among the individuals in both the teaching phase and the learning phase. To store the non-dominated solutions explored during the search process, an external archive is used and updated when necessary. The influence of the parameter setting on the mTLBO in solving the RHFSP is investigated, and numerical tests with some benchmarking instances are carried out. The comparative results show that the proposed mTLBO outperforms the existing algorithms significantly.     

通用中小型机械企业网站的需求分析

为了克服中小型机械企业建立网站的经费不足、功能不全和缺乏安全性等问题,提出了建立通用企业网站的方案。首先通过广泛调研企业的需求,总结和分析了企业信息、客户管理、产品管理、销售与市场管理、物资供应管理、人事管理和安全管理等模块的功能;其次,分析了主要的业务流程和业务重组。     

Optimization of quality and operational costs through improved scheduling of harvest operations

The agriculture sector still lacks the tools and models to enhance the utilization of different resources. This paper addresses the vineyard harvesting problem in developing countries, with the objective of optimizing the wine quality and minimizing the operational costs. Heuristics were introduced to better assign the harvesting days to the different grape blocks that exist in the vineyard's field. The quality of the grapes was a key target as it can transform production from a pinnacle wine to a bulk one. We solved several numerical examples for verification and demonstrative purposes and found that our proposed approach finds solutions that significantly reduce the harvesting costs in the vineyard and considerably outperform Branch and Bound algorithm especially for large problems.     

A compensation cost analysis of service-aggregate transaction for DTNs clients

Clients from Delay Tolerant Networks (DTNs) might encounter overtime exceptions when they aggregate autonomic commercial web service references to form an all-or-nothing transaction. Such exceptions may cause extra overhead—“compensation cost” when aborting transactions. Regarding the delay-related characteristics of DTNs, this paper models the expected compensation cost (ECC) for the schedulings of commit-requests, presents a calculability analysis for quantitative ECC prediction, and explores the limitation of ECC’s probabilistic prediction accordingly. The analysis is based on the timed-2PC plus compensation (t2PC+) protocol and the multi-step price tag pattern, which is verified conditionally by simulation tests through randomly-chosen severely-fluctuant samplings of compensation cost and delays. The ultimate target of this work is to demonstrate the high complexity, and in particular, the uncertainty of ECC predictions due to the randomicity of DTNs’ delays.     

基于缓存偏移量的P2P流媒体调度策略

现有P2P流媒体调度策略在确定数据块调度优先级时,未能综合考虑数据块稀缺度和紧迫度因素,导致了较差的播放连续度和启动延迟性能。提出的基于缓存偏移量的数据调度策略通过统计数据块在供求节点上的播放偏移量并对其加以处理,可有效懈决该问题,使播放连续度、启动延迟性能得到明显提高。     

Job-shop排序问题的遗传强化学习算法

针对Job-shop排序问题的复杂性,提出一种遗传强化学习算法对其求解。通过引入多个随机变量,把Job-shop排序问题转换成多阶段决策问题,通过仿真手段构建作业排序问题模型环境,求取系统性能指标并保证解的可行性。设计一个多智能体Q-Learning算法和遗传算法相结合的算法用于解决Job-shop排序问题。仿真优化实验结果验证了该算法的有效性。     

多跳无线 Ad hoc网络的分布式公平调度算法

为兼顾无线Ad hoc网络信道资源的公平利用及网络吞吐量,提出针对多跳无线Ad hoc网络的分布式公平调度算法。该算法采用链路竞争图说明网络中各子流的竞争关系,通过着色算法得到最大无竞争流的集合,通过邻居节点之间的信息交换得到局部(本地)流的信息,而无需全局流的信息交换。实验模拟结果表明,该算法可以在保证Ad hoc网络中各流公平性的同时,有效提高网络资源的利用率。