Many comprehension theories assert that increasing the distance between elements participating in a linguistic relation (e.g., a verb and an NP argument) increases the difficulty of establishing that relation during on-line comprehension. Such locality effects are expected to increase reading times, and are thought to reveal properties and limitations of the short-term memory system that suppor...

Line search method and trust region method are two important classes of techniques for solving optimization problems and have their advantages respectively. In this paper we use the Armijo line search rule in a more accurate way and propose a new line search method for unconstrained optimization problems. Global convergence and convergence rate of the new method are analyzed under mild conditio...

economic dispatch with valve point effect and prohibited operating zones (pozs) is a non-convex and discontinuous optimization problem. harmony search (hs) is one of the recently presented meta-heuristic algorithms for solving optimization problems, which has different variants. the performances of these variants are severely affected by selection of different parameters of the algorithm. intel...

Knowledge management (KM), as one of the means to obtain better knowledge acquisition, is not new to educational organization. The existing KM applications play a role in student learning, however they are not consistently targeting the mission of efficient and effective learning needs. The purpose of this paper is to present an integrated view of “smooth and pleasant” combination of the KM and...

where a = ∑i, j vi j (PiQ j)(S [qi j]×Piδ Q j) b = ∑i, j vi j (PiQ j)(S [qi j]×∆PiQ j) c = ∑i, j vi j (S [qi j]×Piδ Q j) >(S [qi j]×∆PiQ j)+(PiQ j) (∆Piδ Q j) d = ∑i, j vi j (S [qi j]×∆PiQ j) (∆Piδ Q j) e = ∑i, j vi j (S [qi j]×Piδ Q j) (∆Piδ Q j) f = ∑i, j vi j (∆Piδ Q j)(∆Piδ Q j) g = ∑i, j vi j (S [qi j]×Piδ Q j) >(S [qi j]×Piδ Q j) h = ∑i, j vi j (S [qi j]×∆PiQ) >(S [qi j]×∆PiQ j) Solving t...

Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction of its 3D geometry. Two recently proposed methods for face identification from line drawings are based on two steps: finding a set of circuits that may be faces and searching for real faces from the set according to so...

Recently, the Line Search A-Function (LSAF) was introduced as a technique that generalizes Extended Baum-Welch (EBW) algorithm for functions of continuous probability densities. It was shown that LSAF provides a unified scheme for a large class of optimization problems that involve discriminant objective functions of different probability densities or sparse representation objective functions s...

The aggregation of objectives in multiple criteria programming is one of the simplest and widely used approach. But it is well known that these techniques sometimes fail in different aspects for determining the Pareto frontier. This paper proposes a new line search based approach for multicriteria optimization. The objectives are aggregated and the problem is transformed into a single objective...