A batch is a subset of jobs which must be processed jointly in either serial or parallel form. For the single machine, batching, total completion time scheduling problems, the algorithmic aspects have been extensively...A batch is a subset of jobs which must be processed jointly in either serial or parallel form. For the single machine, batching, total completion time scheduling problems, the algorithmic aspects have been extensively studied in the literature. This paper presents the optimal hatching structures of the problems on the batching ways： all jobs in exactly N（arbitrary fix batch number and 1 〈 N 〈 n） batches.展开更多
In parallel-batching machine scheduling, all jobs in a batch start and complete at the same time, and the processing time of the batch is the maximum processing time of any job in it. For the unbounded parallel-batchi...In parallel-batching machine scheduling, all jobs in a batch start and complete at the same time, and the processing time of the batch is the maximum processing time of any job in it. For the unbounded parallel-batching machine scheduling problem of minimizing the maximum lateness, denoted 1|p-batch|L_(max), a dynamic programming algorithm with time complexity O(n^2) is well known in the literature.Later, this algorithm is improved to be an O(n log n) algorithm. In this note, we present another O(n log n) algorithm with simplifications on data structure and implementation details.展开更多
For the goals of security and privacy preservation,we propose a blind batch encryption-and public ledger-based data sharing protocol that allows the integrity of sensitive data to be audited by a public ledger and all...For the goals of security and privacy preservation,we propose a blind batch encryption-and public ledger-based data sharing protocol that allows the integrity of sensitive data to be audited by a public ledger and allows privacy information to be preserved.Data owners can tightly manage their data with efficient revocation and only grant one-time adaptive access for the fulfillment of the requester.We prove that our protocol is semanticallly secure,blind,and secure against oblivious requesters and malicious file keepers.We also provide security analysis in the context of four typical attacks.展开更多
为快速发现海量遥测数据中的相关关系,提出一种基于改进最大信息系数(Maximal Information Coefficient,MIC)的遥测数据相关性知识发现方法。以Mini Batch K-Means聚类算法为前驱过程对数据进行网格划分;计算该网格划分下的互信息,并以...为快速发现海量遥测数据中的相关关系,提出一种基于改进最大信息系数(Maximal Information Coefficient,MIC)的遥测数据相关性知识发现方法。以Mini Batch K-Means聚类算法为前驱过程对数据进行网格划分;计算该网格划分下的互信息,并以信息熵代替原有最大熵对互信息进行归一化矫正得到信息系数;选择不同网格划分下MIC作为变量相关性的测度。采用量子卫星遥测数据进行试验,结果表明:与基于动态规划算法的MIC方法相比,所提方法可有效解决MIC测度偏向多值变量的问题,时间复杂度从O(n^2.4)下降为O(n^1.6),是一种适用于大规模遥测数据相关性分析的有效方法。展开更多
The single machine parallel batch problem with job compatibility is considered to minimize makespan, where the job compatibility constraints are represented by a graph G. This problem is proved to be NP-hard. And when...The single machine parallel batch problem with job compatibility is considered to minimize makespan, where the job compatibility constraints are represented by a graph G. This problem is proved to be NP-hard. And when the graph G is limited to be a general bipartite, a complete bipartite and a complete m-partite graph, these problems are solved in polynomial time respectively.展开更多
This paper addresses the scheduling and inventory management of a straight pipeline system connecting a single refinery to multiple distribution centers.By increasing the number of batches and time periods,maintaining...This paper addresses the scheduling and inventory management of a straight pipeline system connecting a single refinery to multiple distribution centers.By increasing the number of batches and time periods,maintaining the model resolution by using linear programming-based methods and commercial solvers would be very time-consuming.In this paper,we make an attempt to utilize the problem structure and develop a decomposition-based algorithm capable of finding near-optimal solutions for large instances in a reasonable time.The algorithm starts with a relaxed version of the model and adds a family of cuts on the fly,so that a near-optimal solution is obtained within a few iterations.The idea behind the cut generation is based on the knowledge of the underlying problem structure.Computational experiments on a real-world data case and some randomly generated instances confirm the efficiency of the proposed algorithm in terms of the solution quality and time.展开更多
A 24 L working volume reactor was used for the research on simultaneous phosphorus (P) and nitrogen (N) removal by denitrifying dephosphatation in an anaerobic-oxid-anoxic-oxid sequencing batch reactor ((AO)_2SBR) sys...A 24 L working volume reactor was used for the research on simultaneous phosphorus (P) and nitrogen (N) removal by denitrifying dephosphatation in an anaerobic-oxid-anoxic-oxid sequencing batch reactor ((AO)_2SBR) system. The durations of each phase are: anaerobic 1.5 h, aerobic 2.5 h, anoxic 1.5 h, post-aerobic 0.5 h, settling 1.0 h, fill 0.5 h. The successful removal of nitrogen and phosphorus is achieved in a stable (AO)_2SBR. The effluent P concentrations is below 1 mg/L, and the COD,TN and P average removal efficiency is 88.9%, 77.5% and 88.7%, respectively. The batch experiment results show that the durations of aerobic and anoxic phase influence the P removal efficiency. Some feature points are found on the DO, ORP and pH curves to demonstrate the complete of phosphate release and phosphate uptake. These feature points can be used for the control of (AO)_2 SBR.展开更多
In the rescheduling on a single machine, a set of the original jobs has already been scheduled, in order to make a given objective function is optimal. The decision maker needs to insert the new jobs into the existing...In the rescheduling on a single machine, a set of the original jobs has already been scheduled, in order to make a given objective function is optimal. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. A batching machine is a machine that can handle up to some jobs simultaneously. In this paper,we consider the total completion time under a limit on the sequence disruptions for parallel batching based on rescheduling. For the parallel batching problem based on rescheduling, we research the properties of feasible schedules and optimal schedules on the total completion time under a limit on the maximum time disruptions or total time disruptions, in which the jobs are sequenced in SPT order, and give out the pseudo-polynomial time algorithms on the number of jobs and the processing time of jobs by applying the dynamic programming method.展开更多
基金Supported by the NSF of Henan Province(082300410070)
文摘A batch is a subset of jobs which must be processed jointly in either serial or parallel form. For the single machine, batching, total completion time scheduling problems, the algorithmic aspects have been extensively studied in the literature. This paper presents the optimal hatching structures of the problems on the batching ways： all jobs in exactly N（arbitrary fix batch number and 1 〈 N 〈 n） batches.
基金Supported by NSFC(11571323 11201121)+1 种基金NSFSTDOHN(162300410221)NSFEDOHN(2013GGJS-079)
文摘In parallel-batching machine scheduling, all jobs in a batch start and complete at the same time, and the processing time of the batch is the maximum processing time of any job in it. For the unbounded parallel-batching machine scheduling problem of minimizing the maximum lateness, denoted 1|p-batch|L_(max), a dynamic programming algorithm with time complexity O(n^2) is well known in the literature.Later, this algorithm is improved to be an O(n log n) algorithm. In this note, we present another O(n log n) algorithm with simplifications on data structure and implementation details.
基金partially supported by the National Natural Science Foundation of China under grant no.62372245the Foundation of Yunnan Key Laboratory of Blockchain Application Technology under Grant 202105AG070005+1 种基金in part by the Foundation of State Key Laboratory of Public Big Datain part by the Foundation of Key Laboratory of Computational Science and Application of Hainan Province under Grant JSKX202202。
文摘For the goals of security and privacy preservation,we propose a blind batch encryption-and public ledger-based data sharing protocol that allows the integrity of sensitive data to be audited by a public ledger and allows privacy information to be preserved.Data owners can tightly manage their data with efficient revocation and only grant one-time adaptive access for the fulfillment of the requester.We prove that our protocol is semanticallly secure,blind,and secure against oblivious requesters and malicious file keepers.We also provide security analysis in the context of four typical attacks.
基金sponsored financially by the National Natural Science Foundation of China (No.91545103 and 21273071)the Science and Technology Commission of Shanghai Municipality (13JC1401902)
文摘为快速发现海量遥测数据中的相关关系,提出一种基于改进最大信息系数(Maximal Information Coefficient,MIC)的遥测数据相关性知识发现方法。以Mini Batch K-Means聚类算法为前驱过程对数据进行网格划分;计算该网格划分下的互信息,并以信息熵代替原有最大熵对互信息进行归一化矫正得到信息系数;选择不同网格划分下MIC作为变量相关性的测度。采用量子卫星遥测数据进行试验,结果表明:与基于动态规划算法的MIC方法相比,所提方法可有效解决MIC测度偏向多值变量的问题,时间复杂度从O(n^2.4)下降为O(n^1.6),是一种适用于大规模遥测数据相关性分析的有效方法。
文摘The single machine parallel batch problem with job compatibility is considered to minimize makespan, where the job compatibility constraints are represented by a graph G. This problem is proved to be NP-hard. And when the graph G is limited to be a general bipartite, a complete bipartite and a complete m-partite graph, these problems are solved in polynomial time respectively.
文摘This paper addresses the scheduling and inventory management of a straight pipeline system connecting a single refinery to multiple distribution centers.By increasing the number of batches and time periods,maintaining the model resolution by using linear programming-based methods and commercial solvers would be very time-consuming.In this paper,we make an attempt to utilize the problem structure and develop a decomposition-based algorithm capable of finding near-optimal solutions for large instances in a reasonable time.The algorithm starts with a relaxed version of the model and adds a family of cuts on the fly,so that a near-optimal solution is obtained within a few iterations.The idea behind the cut generation is based on the knowledge of the underlying problem structure.Computational experiments on a real-world data case and some randomly generated instances confirm the efficiency of the proposed algorithm in terms of the solution quality and time.
文摘A 24 L working volume reactor was used for the research on simultaneous phosphorus (P) and nitrogen (N) removal by denitrifying dephosphatation in an anaerobic-oxid-anoxic-oxid sequencing batch reactor ((AO)_2SBR) system. The durations of each phase are: anaerobic 1.5 h, aerobic 2.5 h, anoxic 1.5 h, post-aerobic 0.5 h, settling 1.0 h, fill 0.5 h. The successful removal of nitrogen and phosphorus is achieved in a stable (AO)_2SBR. The effluent P concentrations is below 1 mg/L, and the COD,TN and P average removal efficiency is 88.9%, 77.5% and 88.7%, respectively. The batch experiment results show that the durations of aerobic and anoxic phase influence the P removal efficiency. Some feature points are found on the DO, ORP and pH curves to demonstrate the complete of phosphate release and phosphate uptake. These feature points can be used for the control of (AO)_2 SBR.
基金Supported by the National Natural Science Foundation of China（11271338, 11201121, 71201049） Supported by the National Natural Science Foundation of Henan Province（112300410078） Supported by the Natural Science Foundation of the Education Department of Henan Province（2011B110008）
文摘In the rescheduling on a single machine, a set of the original jobs has already been scheduled, in order to make a given objective function is optimal. The decision maker needs to insert the new jobs into the existing schedule without excessively disrupting it. A batching machine is a machine that can handle up to some jobs simultaneously. In this paper,we consider the total completion time under a limit on the sequence disruptions for parallel batching based on rescheduling. For the parallel batching problem based on rescheduling, we research the properties of feasible schedules and optimal schedules on the total completion time under a limit on the maximum time disruptions or total time disruptions, in which the jobs are sequenced in SPT order, and give out the pseudo-polynomial time algorithms on the number of jobs and the processing time of jobs by applying the dynamic programming method.
