the realization optimality theory is a recent development in the original optimality theory which is proposed to deal with morphological issues especially the inflectional ones. its main idea is to consider the morphological realization rules as ranked violable language-specific constraints that control the realization processes and provide phonological information of grammatical morphemes. thi...

this paper provides an optimality-theoretic account of dissimilation in standard persian as well as some other accents and dialects of persian. as such, this work starts by introducing optimality theory (henceforth ot) and its basic concepts and then it investigates dissimilation in this framework. it argues for the superiority of ot over derivational approaches regarding a case in which both d...

preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. in this paper, the same problem has been considered in which objective is to minimize the mean flow time. to prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. o...

A multi-objective heuristic particle swarm optimiser (MOHPSO) based on Pareto multi-objective theory is proposed to solve multi-objective optimality problems. The optimality objectives are the roof displacement and structure weight. Two types of structure are analysed in this paper, a truss structure and a framework structure. Performance-based seismic analysis, such as classical and modal push...

The coset pattern matrix (CPM) is formally defined as an elaborate characterization of the aliasing patterns of a fractional factorial design. The possibility of using CPM to check design isomorphism is investigated. Despite containing much information about effect aliasing, the CPM fails to determine a design uniquely. We report and discuss small nonisomorphic designs that have equivalent cose...

Abstract. A simple step-stress accelerated life testing plan is considered when the failure times in each level of stress are geometrically distributed under Type-I censoring. The problem of choosing the optimal plan is investigated using the asymptotic variance-optimality as well as determinant-optimality and probability-optimality criteria. To illustrate the results of the paper, an example i...

‎in this paper‎, ‎some kkt type sufficient global optimality conditions‎ ‎for general mixed integer nonlinear programming problems with‎ ‎equality and inequality constraints (minpp) are established‎. ‎we achieve‎ ‎this by employing a lagrange function for minpp‎. ‎in addition‎, ‎verifiable sufficient global optimality conditions for general mixed‎ ‎integer quadratic programming problems are der...

We discuss the classical efficiency criteria in density estimation and propose some variants. The context is a general density estimation scheme that contains the cases of i.i.d. or dependent random variables, in discrete or continuous time. Unbiased estimation, optimality and asymptotic optimality are considered. An example of a density estimator that satisfies some suggested criteria is given...

Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...

The problem of obtaining the optimum design, which is able to discriminate between several rival models has been considered in this paper. We give an optimality-criterion, using a Bayesian approach. This is an extension of the Bayesian KL-optimality to more than two models. A modification is made to deal with nested models. The proposed Bayesian optimality criterion is a weighted average, where...