This paper constructs a general class of two-point optimal fourthorder methods without memory for locating multiple roots of a nonlinear equation. On the basis of Kung-Traub’s conjecture, we investigate the optimal convergence as well as computational properties for the class. Explicit forms of asymptotic error constants are presented to strongly verify the convergence order. A variety of numer...

For independent global constraints Web services composition problem, it is difficult to analyze the optimal composition plan. The study presents an optimization method of Web service composition with constraint using Fuzzy Petri Net (FPN) and Differential Evolution (DE), which can transforms solving the optimal service composition problem into locating the largest trust value of legal firing se...

Water quality monitoring network design has historically tended to use experience, intuition and subjective judgement in locating monitoring stations. Better design procedures to optimize monitoring systems need to simultaneously identify significant planning objectives and consider a number of social, economic and environmental constraints. The consideration of multiple objectives may require ...

Abstract Simultaneously optimizing the estimation of centroid and separation two incoherent optical point sources is constrained by a tradeoff relation determined an incompatibility coefficient. At Rayleigh distance, coefficient vanishes thus no longer restricts simultaneous optimization measurement for joint estimation. We construct such optimal elaborated analysis on operator algebra symmetri...

The optimal locating of facilities has large effects on economic benefits, providing satisfactory service and levels of customer satisfaction. One of the new topics discussed in location problems is hub location and hub facilities are subject to unpredictable disruptions. This paper proposes a nonlinear integer model for reliable single allocation hub location problem that considers backup hub,...

The problem of locating centers for radial basis functions in neural networks is discussed. The proposed approach allows us to apply the results from the theory of optimum experimental designs. In typical cases we are able to compose optimal centers’ locations from the known univariate experiment designs.

A new automatic speech segmentation procedure, called the \Blind" speech segmentation, is presented. This procedure allows a speech sample to be segmented into sub-word units without the knowledge of any linguistic information (such as, orthographic or phonetic transcription). Hence, this procedure involves nding the optimal number of sub-word segments in the given speech sample, before locatin...

We consider the problem of locating two unknown elements x; y using group testing devices. Assuming that up to a given number E of tests out of Q can give erroneous feedback, we provide optimal algorithms to search for x and y.

In this paper we provide a finite set of candidates to be one of the endpoints of an optimal rapid transit line for the problem of locating simultaneously a service facility and a rapid transit line. & 2012 Elsevier Ltd. All rights reserved.