Solving single-product economic lot-sizing problem with non-increasing setup cost,constant capacity and convex inventory cost in O(N log N) time

This paper considers an economic lot sizing model with constant capacity, non-increasing setup cost, and convex inventory cost function. Algorithms with computational time of O(N×TD_N)have been developed for solving the model, where N is the number of planning periods and TD_N is the total demand. This study partially characterizes the optimal planning structure of the model. A new efficient algorithm with computational time of O(N log N) has also been developed based on the partial optimal structure. Moreover, computational study demonstrates that the new algorithm is efficient.     

CCA-secure unidirectional proxy re-encryption in the adaptive corruption model without random oracles

Up to now, it is still an open question of how to construct a chosen-ciphertext secure unidirectional proxy re-encryption scheme in the adaptive corruption model. To address this problem, we propose a new unidirectional proxy re-encryption scheme, and prove its chosen-ciphertext security in the adaptive corruption model without random oracles. Compared with the best known unidirectional proxy re-encryption scheme proposed by Libert and Vergnaud in PKC’08, our scheme enjoys the advantages of both higher effi...     

Parameterized computational complexity of control problems in voting systems

Voting systems are common tools in a variety of areas. This paper studies parameterized computational complexity of control of Plurality, Condorcet and Approval voting systems, respectively. The types of controls considered include adding or deleting candidates or voters, under constructive or destructive setting. We obtain the following results: (1) constructive control by adding candidates in Plurality voting is W[2]-hard with respect to the parameter “number of added candidates”, (2) destructive control by adding candidates in Plurality voting is W[2]-hard with respect to the parameter “number of added candidates”, (3) constructive control by adding voters in Condorcet voting is W[1]-hard with respect to the parameter “number of added voters”, (4) constructive control by deleting voters in Condorcet voting is W[1]-hard with respect to the parameter “number of deleted voters”, (5) constructive control by adding voters in Approval voting is W[1]-hard with respect to the parameter “number of added voters”, and (6) constructive control by deleting voters in Approval voting is W[2]-hard with respect to the parameter “number of deleted voters”.     

基于PIC16F877A的变频恒压供水控制器设计

分析了高层建筑供水控制系统的技术要求,介绍了基于PIC16F877A单片机的变频恒压供水控制器的工作原理,提出了该装置的软硬件设计方法.相比目前的变频恒压控制系统,该装置的精简硬件设计有效地克服了系统可靠性差的问题;同时,基于PSO-PID智能算法的软件设计解决了系统动态响应慢和压力调节不稳定的缺点.该装置成本低、智能化程度高,生产实际中能够确保设备的使用寿命、能源的有效利用和供水质量.因此,具有很高的推广、应用价值.     

基于iSCSI的级联远程复制系统实现与优化

提出基于iSCSI的级联远程复制系统结构及其实现方法.对传统实现进行优化,一方面引入带双阈值的传输控制队列和引用计数模块,提高本地子系统的性能;另一方面通过添加元数据记录传输和数据一致性恢复功能,解决了两级子系统在网络环境差异较大时协同性差的问题.调节iSCSI参数,进一步优化系统性能.性能测试表明,优化的级联远程复制系统具有高可用性和良好的性能.     

Picture or it didn’t happen: catch the truth for events

Multimedia Tools and Applications - Pictures spreading on the Internet are essential for the authenticity of events. Each day, huge amounts of data are published on social media, and many of them...     

桌面虚拟交付系统在高校机房中的应用

操作系统的重构更新、软件的安装升级、数据同传以及日常计算机系统的维护管理等问题常见于各大高校机房实验室的管理当中,解决这类问题不仅费时费力,而且缺乏创新.作者以桌面虚拟交付系统为切入点,通过实际案例与数据说明桌面虚拟交付系统在实验室建设当中的应用,实际使用该技术的优劣以及需要注意的问题.     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.