3 1 The term optimization 4 1.1 Global Optimization . . . . . . . . . . . . . . . . . . . . . . . 5 1.2 Why global optimization? . . . . . . . . . . . . . . . . . . . . 10 1.3 The structure of Global Optimization Algorithms . . . . . . . 12 1.4 Local Optimization of NLPs . . . . . . . . . . . . . . . . . . . 12 1.4.1 Notions of convex analysis . . . . . . . . . . . . . . . . 12 1.4.2 Necessary ...

Abstract Analyzing the behavior of stochastic procedures is generally recognized to be relevant. A possible way for doing so consists in observing the exploration performed. A formalization in this sense is proposed in the paper On the explorative behavior of MAX–MIN Ant System : A method for studying this aspect regardless the type of approach used is defined and tested. The consequent measure...

A vast variety of branched structures differing in size, shape, and function are found in Nature and engineering. Needed are robust and sufficiently general methods for extracting geometric information about structure-function arrangements and relationships from images of branched structures. This paper describes a novel mathematical algorithm called Adaptive Local Principal Component Analysis ...

introduction: diabetic retinopathy (dr) is one of the most serious and most frequent eye diseases in the world and the most common cause of blindness in adults between 20 and 60 years of age. following 15 years of diabetes, about 2% of the diabetic patients are blind and 10% suffer from vision impairment due to dr complications. this paper addresses the automatic detection of microaneurysms (ma...

In many CNS pathways, target innervation occurs by axon branching rather than extension of the primary growth cone into targets. To investigate mechanisms of branch formation, we studied the effects of attractive and inhibitory guidance cues on cortical axon branching. We found that netrin-1, which attracts cortical axons, and FGF-2 increased branching by >50%, whereas semaphorin 3A (Sema3A), w...

This paper considers large shift scheduling problems with different shift start times and lengths, fractionable breaks and work stretch duration restrictions. Two solution approaches are proposed to solve the problems over a multiple-day planning horizon. The first approach is based on a local branching strategy and the second one is based on a temporal decomposition of the problem. Local branc...

Problem statement: The objective of this study is to develop efficient exact algorithms for a single source capacitated multi-facility location problem with rectilinear distance. This problem is concerned with locating m capacitated facilities in the two dimensional plane to satisfy the demand of n customers with minimum total transportation cost which is proportional to the rectilinear distanc...

in this paper, an optimal algorithm is presented for de-noising of medical images. the presented algorithm is based on improved version of local pixels grouping and principal component analysis. in local pixels grouping algorithm, blocks matching based on l2 norm method is utilized, which leads to matching performance improvement. to evaluate the performance of our proposed algorithm, peak sign...

The generation of counterexamples is frequently touted as one of the primary advantages of model checking as a verification technique. However, the generation of trace-like counterexamples is limited to a small fragment of branching-time temporal logic. When model checking does succeed in verifying a property, there is typically no independently checkable witness that can be used as evidence fo...