Representation of context dependent knowledge in the Semantic Web is a recently emergent issue. A number of logical formalisms with this aim have been proposed [3, 11, 14]. Among them is the DL based Contextualized Knowledge Repository (CKR) [13]. One of the mostly advocated advantages of context based knowledge representation is that reasoning procedures can be constructed by composing local r...

It is known that A* is optimal with respect to the expanded nodes (Dechter and Pearl 1985) (D&P). The exact meaning of this optimality varies depending on the class of algorithms and instances over which A* is claimed to be optimal. A* does not provide any optimality guarantees with respect to the generated nodes. However, such guarantees may be critical for optimally solving instances of domai...

Duprat and Muller [1] introduced the ingenious “Branching CORDIC” algorithm. It enables a fast implementation of CORDIC algorithm using signed digits and requires a constant normalization factor. The speedup is achieved by performing two basic CORDIC rotations in parallel in two separate modules. In their method, both modules perform identical computation except when the algorithm is in a “bran...

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...

The effects of non-local operators in rare B decays, B → X s l + l − , are investigated through the model independent analysis. It deals with complete twelve four-Fermi interactions, including two non-local ones which are constrained by the experimental result of the B → X s γ decay. The branching ratio and the forward-backward asymmetry are studied as functions of the twelve Wilson coefficient...

We present a simple algorithm for the maximum independent set problem in an n-vertex graph with degree bounded by 4, which runs in O∗(1.1446n) time and improves all previous algorithms for this problem. The algorithm is analyzed by using the “Measure and Conquer” method. We use some good reduction and branching rules with a new idea on setting weights to obtain the improved time bound without i...

this paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. first, the problem is formulated as a mixed integer linear programming model. then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. two experiments are carried out to evaluate th...

The effects of non-local interactions in rare B decays, B → X s l + l − , are investigated through the model independent analysis. It deals with complete twelve four-Fermi interactions, including two non-local ones which are constrained by the experimental result of the B → X s γ decay. The branching ratio and the forward-backward asymmetry are studied as functions of the twelve Wilson coeffici...

Modern models that derive allometric relationships between metabolic rate and body mass are based on the architectural design of the cardiovascular system and presume sibling vessels are symmetric in terms of radius, length, flow rate, and pressure. Here, we study the cardiovascular structure of the human head and torso and of a mouse lung based on three-dimensional images processed via our sof...