in a large scale cyclic storage system ,as the number of rule parameters and/or number of operating period increase, general purpose gradient-based nlp solvers and/or genetic algorithms may loose their merits in finding optimally feasible solution to the problem. in these cases hybrid ga which decomposes the main problem into two manageable sub-problems with an iterative scheme between ga and l...

in this paper, we investigate the delay-dependent robust stability of fuzzy cohen-grossberg neural networks with markovian jumping parameter and mixed time varying delays by delay decomposition method. a new lyapunov-krasovskii functional (lkf) is constructed by nonuniformly dividing discrete delay interval into multiple subinterval, and choosing proper functionals with different weighting matr...

The structural properties and activities of Cu-Co catalysts used in Fischer-Tropsch synthesis are explored according to their method of preparation. Impregnation, co-precipitation, and a novel method of thermal decomposition were applied to an inorganic precursor complex to generate the Cu-promoted alumina- and silica-supported cobalt catalysts. The precursors and the catalysts obtained by ...

The efficient query processing for complex spatial objects is one of most challenging requirements in many non-traditional applications such as geographic information systems, computer-aided design and multimedia databases. The performance of spatial query processing can be improved by decomposing a complex object into a small number of simple components. This paper investigates a natural trade...

We argue that formal modeling should be the starting point for any serious development of computer systems. This claim poses a challenge for modeling: at first it must cope with the constraints and scale of serious developments. Only then it is a suitable starting point. We present three techniques, refinement, decomposition, and instantiation, that we consider indispensable for modeling large ...

The aim of this work is to solve parametrized partial differential equations in computational domains represented by networks of repetitive geometries by combining reduced basis and domain decomposition techniques. The main idea behind this approach is to compute once, locally and for few reference shapes, some representative finite element solutions for different values of the parameters and w...

the burgers’ equation is a simplified form of the navier-stokes equations that very well represents their non-linear features. in this paper, numerical methods of the adomian decomposition and the modified crank – nicholson, used for solving the one-dimensional burgers’ equation, have been compared. these numerical methods have also been compared with the analytical method. in contrast to...

We consider structured prediction problems with a parametrized linear prediction function, and the associated parameter optimization problems in large margin type of discriminative training. We propose a dual optimization approach which uses the restricted simplicial decomposition method to optimize a reparametrized dual problem. Our reparametrization reduces the dimension of the space of the d...

This study evaluates whether tip of the tongue experiences (TOTs) are caused by a more accessible word which blocks retrieval of the target word, especially for older adults. In a "competitor priming" paradigm, young and older adults produced the name of a famous character (e.g., Eliza Doolittle) in response to a question and subsequently named a picture of a famous actor or actress depicting t...