The modeling of dynamical systems from a time series implemented by our DSA program introduces binary trees of height D with all leaves on the same level, and the related subtrees of height L 〈 D. These are called e-...The modeling of dynamical systems from a time series implemented by our DSA program introduces binary trees of height D with all leaves on the same level, and the related subtrees of height L 〈 D. These are called e-trees and e-subtrees. The recursive and nonrecursive versions of the traversal algorithms for the trees with dynamically created nodes are discussed. The original nonrecursive algorithms that return the pointer to the next node in preorder, inorder and postorder traversals are presented. The space-time complexity analysis shows and the execution time measurements confirm that for these O（2D） algorithms, the recursive versions have approximately 10-25% better time constants. Still, the use of nonrecursive algorithms may be more appropriate in several occasions.展开更多
The introduction of the new budget law is one of the most important achievements of the construction of national legal system. It is a landmark event in building financial system. The new budget law has made a lot of ...The introduction of the new budget law is one of the most important achievements of the construction of national legal system. It is a landmark event in building financial system. The new budget law has made a lot of breakthroughs and innovations in the budget managemenL to lead direction for further deepen fiscal reform. However, the modification of the budget law can only adopt the principle of limited modification, there are still many problems. This paper discusses the innovation and deficiency of the new budget law under the background of budget law modification, and makes suggestions to further improve the budget law.展开更多
文摘The modeling of dynamical systems from a time series implemented by our DSA program introduces binary trees of height D with all leaves on the same level, and the related subtrees of height L 〈 D. These are called e-trees and e-subtrees. The recursive and nonrecursive versions of the traversal algorithms for the trees with dynamically created nodes are discussed. The original nonrecursive algorithms that return the pointer to the next node in preorder, inorder and postorder traversals are presented. The space-time complexity analysis shows and the execution time measurements confirm that for these O（2D） algorithms, the recursive versions have approximately 10-25% better time constants. Still, the use of nonrecursive algorithms may be more appropriate in several occasions.
文摘The introduction of the new budget law is one of the most important achievements of the construction of national legal system. It is a landmark event in building financial system. The new budget law has made a lot of breakthroughs and innovations in the budget managemenL to lead direction for further deepen fiscal reform. However, the modification of the budget law can only adopt the principle of limited modification, there are still many problems. This paper discusses the innovation and deficiency of the new budget law under the background of budget law modification, and makes suggestions to further improve the budget law.
