there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

we have devided the thesis in to five chapters. the first recollects facts from purely algebraic theory of jordan algebras and also basic properties of jb and jb* - algebras which are needed in the sequel. in the second chapter we extend to jb* - algebras, a classical result due to cleveland [8]. this result shows shows the weakness of jb* - norm topology on a jb* - algebera. in chapter three, ...

abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...

there are two major theories of measurement in psychometrics: classical test theory (ctt) and item-response theory (irt). despite its widespread and long use, ctt has a number of shortcomings, which make it problematic to be used for practical and theoretical purposes. irt tries to solve these shortcomings, and provide better and more dependable answers. one of the applications of irt is the as...

a problem of computer vision applications is to detect regions of interest under dif- ferent imaging conditions. the state-of-the-art maximally stable extremal regions (mser) detects affine covariant regions by applying all possible thresholds on the input image, and through three main steps including: 1) making a component tree of extremal regions’ evolution (enumeration), 2) obtaining region ...

the poor orientation of the restaurants toward the information technology has yet many unsolved issues in regards to the customers. one of these problems which lead the appeal list of later, and have a negative impact on the prestige of the restaurant is the case when the later does not respond on time to the customers’ needs, and which causes their dissatisfaction. this issue is really sensiti...

abstract:assume that y is a banach space such that r(y ) ? 2, where r(.) is garc?a-falset’s coefficient. and x is a banach space which can be continuously embedded in y . we prove that x can be renormed to satisfy the weak fixed point property (w-fpp). on the other hand, assume that k is a scattered compact topological space such that k(!) = ? ; and c(k) is the space of all real continuous ...

heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...

some researches made in the field of agency problem issue, deal with the role of control systems regarding owners and managers. in this research the relationship between the two control mechanisms, namely the voluntary disclosure (external control mechanism) and outside directors (internal control mechanism), which are reductive of agency problems, has been studied. for this reason, a sample ...

in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...