The dependency pair technique [1, 11, 12] is a powerful method for automated termination and innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates ...
The set of frames exchanged in automotive applications must meet two constraints: it has to be feasible from a schedulability point of view and it should minimize the network bandw...
In this paper we present a new characterization of switch-regular upward embeddings, a concept introduced by Di Battista and Liotta in 1998. This characterization allows us to def...
Abstract--This paper introduces an approach to generate generalized pairwise complementary (GPC) codes, which offer a uniform interference free windows (IFWs) across the entire cod...
Hsiao-Hwa Chen, Yu-Ching Yeh, Xi Zhang, Aiping Hua...
In this paper, a moving mesh discontinuous Galerkin (DG) method is developed to solve the nonlinear conservation laws. In the mesh adaptation part, two issues have received much a...