This paper presents a framework to infer spatial knowledge from verbal semantic role representations. First, we generate potential spatial knowledge deterministically. Second, we determine whether it can be inferred and a degree of certainty. Inferences capture that something is located or is not located somewhere, and temporally anchor this information. An annotation effort shows that inferenc...

This paper introduces a way of constructing biplanes that uses “filters” in a step prior to an exhaustive computer search, with the objective to make the biplane construction more efficient. The achieved deterministic algorithm classifies biplanes of order 7 and smaller. When performing the search using some additional presumptive conditions, two biplanes of order 9 (k = 11) were constructed an...

The application of chaos theory in hydrology has been gaining considerable interest in recent years.Based on the chaos theory, the random seemingly series can be attributed to deterministic rules. Thedynamic structures of the seemingly complex processes, such as river flow variations, might be betterunderstood using nonlinear deterministic chaotic models than the stochastic ones. In this paper,...

The present work is concerned with the development of a new algorithm for determination of the equilibrium composition of gaseous detonations. The elements balance equations, and the second law of thermodynamics (i.e., the minimization of the Gibbs free energy of products), are used to determine the equilibrium composition of the detonation products. To minimize the Gibbs free energy with tradi...

Evolution Strategies (ES) are a class of Evolutionary Algorithms based on Gaussian mutation and deterministic selection. Gaussian mutation captures pair-wise dependencies between the variables through a covariance matrix. Covariance Matrix Adaptation (CMA) is a method to update this covariance matrix. In this paper, the CMA-ES, which has found many applications in solving continuous optimizatio...

the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...

in this paper, the problem of layout optimization for x-bracing of steel frames is studied using the ant system (as). a new design method is employed to share the gravity and the lateral loads between the main frame and the bracings according to the requirements of the ibc2006 code. an algorithm is developed which is called optimum steel designer (osd). an optimization method based on an approx...

multiple traveling salesman problem (mtsp) is one of the most popular operation research problem and is known as combinatorial optimization problems. mtsp is an extension version of the famous and widely used problem named traveling salesman problem (tsp). because of its benefices in various domains, many researchers have tried to solve that, and many methods have proposed so far. mtsp is a np-...

Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional n n meshes. The deterministic algorithm is based on “column-sort” and exploits only part of the features of the mesh. For small n and moderate k, the lower-order terms of this algorithm make it considerably more expensive than the randomized algorithm. In this paper, we present a novel determinist...