There are settings where encryption must be performed by a sender under a time constraint. This paper de-scribes an encryption/decryption algorithm based on modular arithmetic of complex integers called Gaus-sians. It...There are settings where encryption must be performed by a sender under a time constraint. This paper de-scribes an encryption/decryption algorithm based on modular arithmetic of complex integers called Gaus-sians. It is shown how cubic extractors operate and how to find all cubic roots of the Gaussian. All validations (proofs) are provided in the Appendix. Detailed numeric illustrations explain how to use the method of digital isotopes to avoid ambiguity in recovery of the original plaintext by the receiver.展开更多
In order to transfer large les and provide high-quality services in the IoV(Internet of Vehicles),intelligent routing and scheduling are indispensable for fast transfers and effcient network utilization,particularly w...In order to transfer large les and provide high-quality services in the IoV(Internet of Vehicles),intelligent routing and scheduling are indispensable for fast transfers and effcient network utilization,particularly when multi-path routing is allowed in the wired-transfer.Thus,a network administrator must select a set of feasible paths over which the transfer can be conducted.We consider a TBTS(Time-constrained Big-le Transfer Scheduling)problem in this paper.We prove that TBTS problem is NP-hard and that the TBTS problem can be solved by addressing a corresponding maximum ow over time problem with multi-path routing technique.We then propose both a heuristic algorithm(TBTS-H)and an exact algorithm(TBTS-A)to solve the TBTS problem.Although both of the proposed approaches can solve the TBTS problem,the heuristic runs more effciently by trading accuracy for delay,while the exact algorithm can achieve high accuracy for delay,at the cost of increased running-time.The corresponding simulation results illustrate this trade-o.Additionally,we conduct some comparisons between our proposed approaches and a traditional single-path routing scheme.展开更多
针对Julia程序运行的时限约束,提出一种基于有色Petri网的程序运行性能自适应模拟方法。面向特定领域构建适应底层计算资源特点的工具库,抽取针对Julia语言的计算原语;程序员通过Julia语言实现原语,动态选取领域工具,适应运行时限约束...针对Julia程序运行的时限约束,提出一种基于有色Petri网的程序运行性能自适应模拟方法。面向特定领域构建适应底层计算资源特点的工具库,抽取针对Julia语言的计算原语;程序员通过Julia语言实现原语,动态选取领域工具,适应运行时限约束。结合图像对象识别案例,构建Colored Petri Net模型,借助CPN Tools工具模拟运行,自动优化备选方案。模拟实验表明,基于工具库的性能标定,CPN模拟得到的工具库映射方案接近最优。展开更多
文摘There are settings where encryption must be performed by a sender under a time constraint. This paper de-scribes an encryption/decryption algorithm based on modular arithmetic of complex integers called Gaus-sians. It is shown how cubic extractors operate and how to find all cubic roots of the Gaussian. All validations (proofs) are provided in the Appendix. Detailed numeric illustrations explain how to use the method of digital isotopes to avoid ambiguity in recovery of the original plaintext by the receiver.
基金This work is supported by the National Natural Science Foundation of China(Nos.61671142,61101121,61373159).
文摘In order to transfer large les and provide high-quality services in the IoV(Internet of Vehicles),intelligent routing and scheduling are indispensable for fast transfers and effcient network utilization,particularly when multi-path routing is allowed in the wired-transfer.Thus,a network administrator must select a set of feasible paths over which the transfer can be conducted.We consider a TBTS(Time-constrained Big-le Transfer Scheduling)problem in this paper.We prove that TBTS problem is NP-hard and that the TBTS problem can be solved by addressing a corresponding maximum ow over time problem with multi-path routing technique.We then propose both a heuristic algorithm(TBTS-H)and an exact algorithm(TBTS-A)to solve the TBTS problem.Although both of the proposed approaches can solve the TBTS problem,the heuristic runs more effciently by trading accuracy for delay,while the exact algorithm can achieve high accuracy for delay,at the cost of increased running-time.The corresponding simulation results illustrate this trade-o.Additionally,we conduct some comparisons between our proposed approaches and a traditional single-path routing scheme.
文摘针对Julia程序运行的时限约束,提出一种基于有色Petri网的程序运行性能自适应模拟方法。面向特定领域构建适应底层计算资源特点的工具库,抽取针对Julia语言的计算原语;程序员通过Julia语言实现原语,动态选取领域工具,适应运行时限约束。结合图像对象识别案例,构建Colored Petri Net模型,借助CPN Tools工具模拟运行,自动优化备选方案。模拟实验表明,基于工具库的性能标定,CPN模拟得到的工具库映射方案接近最优。
