Three new worldwide calendars are proposed and compared in this paper. None of them requires any departure from an existing tradition to divide years on lean and leap. Although all three are pretty accurate, it is dem...Three new worldwide calendars are proposed and compared in this paper. None of them requires any departure from an existing tradition to divide years on lean and leap. Although all three are pretty accurate, it is demonstrated that the Julian calendar with one additional amendment is the simplest and the most suitable for implementation.展开更多
基于有限生灭过程建立了日历队列的数学模型,提出了一种基于马尔可夫链的动态预测算法(predictresize algorithm based on Markov,PRAM),弥补了上述方法的不足。给出了算法的相关数学分析,并将其实现在J2EE应用服务器OnceAS中。系统实...基于有限生灭过程建立了日历队列的数学模型,提出了一种基于马尔可夫链的动态预测算法(predictresize algorithm based on Markov,PRAM),弥补了上述方法的不足。给出了算法的相关数学分析,并将其实现在J2EE应用服务器OnceAS中。系统实验表明,当事件到达高度密集或到达分布变化剧烈时,该算法可以解决日历队列的性能不稳定问题,使其仍保持出入队时间复杂度O(1)的特性,并且性能更优。展开更多
文摘Three new worldwide calendars are proposed and compared in this paper. None of them requires any departure from an existing tradition to divide years on lean and leap. Although all three are pretty accurate, it is demonstrated that the Julian calendar with one additional amendment is the simplest and the most suitable for implementation.
文摘基于有限生灭过程建立了日历队列的数学模型,提出了一种基于马尔可夫链的动态预测算法(predictresize algorithm based on Markov,PRAM),弥补了上述方法的不足。给出了算法的相关数学分析,并将其实现在J2EE应用服务器OnceAS中。系统实验表明,当事件到达高度密集或到达分布变化剧烈时,该算法可以解决日历队列的性能不稳定问题,使其仍保持出入队时间复杂度O(1)的特性,并且性能更优。
