It is necessary to compute the execution time upper bound of embedded hard real-time program under the worst condition in embedded system design, which decides how hardware and software to partition and how to schedule process. Modern microprocessors which use cache memory system and instruction pre-fetching increase the difficulty to compute the upper bound accurately. A new estimation method ...

We consider the problem of determining the size of a maximum clique in a graph, also known as the clique number. Given any method that computes an upper bound on the clique number of a graph, we present a sequential elimination algorithm which is guaranteed to improve upon that upper bound. Computational experiments on DIMACS instances show that, on average, this algorithm can reduce the gap be...

We give a short proof of the Hass–Lagarias theorem on an upper bound on the minimal number of elementary moves to unknot in a triangulated 3-manifold. Our method uses a normal form for surfaces whose boundary is contained in the 1-skeleton of a triangulated 3-manifold. We also obtain a significantly better upper bound of 2, where t is the number of tetrahedra, and improve the Hass–Lagarias uppe...

in this paper, we solve a linear system of second-order boundary value problems by using the quadratic b-spline nite el- ement method (fem). the performance of the method is tested on one model problem. comparisons are made with both the analyti- cal solution and some recent results.the obtained numerical results show that the method is ecient.

air defense is a crucial area for all naval combat systems. in this study, we consider a warship equipped with an air-defense weapon that targets incoming threats using surface-to-air missiles. we define the weapon scheduling problem as the optimal scheduling of a set of surface-to-air missiles of a warship to a set of attacking air threats. the optimal scheduling of the weapon results in an in...

We describe a sequential universal data compression procedure for binary tree sources that performs the " double mixture. " Using a context tree, this method weights in an efficient recursive way the coding distributions corresponding to all bounded memory tree sources, and achieves a desirable coding distribution for tree sources with an unknown model and unknown parameters. Computational and ...

We describe a sequential universal data compression procedure for binary tree sources that performs the \double mixture". Using a context tree, this method weights in an eecient recursive way the coding distributions corresponding to all bounded memory tree sources, and achieves a desirable coding distribution for tree sources with an unknown model and unknown parameters. Computational and stor...

This paper is concerned with the integer quadratic multidimensional knapsack problem (QMKP) where the objective function is separable. Our objective is to determine which expansion technique of the integer variables is the most appropriate to solve (QMKP) to optimality using the upper bound method proposed by Quadri et al. (2007). To the best of our knowledge the upper bound method previously m...