In view of the increasing cement concrete pavement in China,the proportion of road non-slip surface layer is large,the winter slippery performance is insufficient and the later non-slip treatment is difficult. Through...In view of the increasing cement concrete pavement in China,the proportion of road non-slip surface layer is large,the winter slippery performance is insufficient and the later non-slip treatment is difficult. Through the concrete construction and post-application and development of the anti-skid sand in the road and bridge,the feasible anti-skid optimization measures are put forward.展开更多
The left-linear transformation presented by Ullman, Naughton el al. is a rule-rewriting algorithm, which is similar to the magic sets transformation. Since left-linear recursions are among the most common recursions i...The left-linear transformation presented by Ullman, Naughton el al. is a rule-rewriting algorithm, which is similar to the magic sets transformation. Since left-linear recursions are among the most common recursions in practice and the transformed rules can be evaluated bottom-up efficiently, the left-linear transformation has been chosen as one of the best strategies for recursive query processing by the NALL! system at Stanford and the LDL system at MCC. However, there are two strick restraints for the left-linear展开更多
文摘In view of the increasing cement concrete pavement in China,the proportion of road non-slip surface layer is large,the winter slippery performance is insufficient and the later non-slip treatment is difficult. Through the concrete construction and post-application and development of the anti-skid sand in the road and bridge,the feasible anti-skid optimization measures are put forward.
基金Project supported in part by the Grant 91028 from the Natural Science Foundation of Henan Province, China.
文摘The left-linear transformation presented by Ullman, Naughton el al. is a rule-rewriting algorithm, which is similar to the magic sets transformation. Since left-linear recursions are among the most common recursions in practice and the transformed rules can be evaluated bottom-up efficiently, the left-linear transformation has been chosen as one of the best strategies for recursive query processing by the NALL! system at Stanford and the LDL system at MCC. However, there are two strick restraints for the left-linear
