A Necessary Condition of the Cardinal

In this paper the auther begins with some known results about η_λ(=the least cardinal K such that K→(λ)~<∞), proving this theorem: If λ is not Ramsey cardinal and η_λ exists, then for every a<η_λ there is a weakly compact cardinal γ, such that λ<γ_α<η_λandγ_α<γ_βwhenever a<β<η_λ, therefore η_λ is the limit of the sequence(γ_α:a<η_λ), i.e. η_λ=limγ_α. The theorem is mainly based on the theory of models with indiscernibles.

An Algebra of Ontologies Approximation under Uncertainty

Ontologies are widely used in modeling the real world for the purpose of information sharing and reasoning. Traditional ontologies contain only concepts and relations that describe asserted facts about the world. Modeling in a dynamic world requires taking into consideration the uncertainty that may arise in the domain. In this paper, the concept of soft sets initiated by Molodtsov and the concept of rough sets introduced by Pawlack are used to define a way of instantiating ontologies of vague domains. We define ontological algebraic operations and their properties while taking into consideration the uncertain nature of domains. We show that, by doing so, intra ontological operations and their properties are preserved and formalized as operations in a vague set of objects and can be proved algebraically.

Modified Cuckoo Search Algorithm to Solve Economic Power Dispatch Optimization Problems

A modified cuckoo search(CS) algorithm is proposed to solve economic dispatch(ED) problems that have nonconvex, non-continuous or non-linear solution spaces considering valve-point effects, prohibited operating zones, transmission losses and ramp rate limits. Comparing with the traditional cuckoo search algorithm, we propose a self-adaptive step size and some neighbor-study strategies to enhance search performance.Moreover, an improved lambda iteration strategy is used to generate new solutions. To show the superiority of the proposed algorithm over several classic algorithms, four systems with different benchmarks are tested. The results show its efficiency to solve economic dispatch problems, especially for large-scale systems.

Local-Tetra-Patterns for Face Recognition Encoded on Spatial Pyramid Matching

Face recognition is a big challenge in the research field with a lot of problems like misalignment,illumination changes,pose variations,occlusion,and expressions.Providing a single solution to solve all these problems at a time is a challenging task.We have put some effort to provide a solution to solving all these issues by introducing a face recognition model based on local tetra patterns and spatial pyramid matching.The technique is based on a procedure where the input image is passed through an algorithm that extracts local features by using spatial pyramid matching andmax-pooling.Finally,the input image is recognized using a robust kernel representation method using extracted features.The qualitative and quantitative analysis of the proposed method is carried on benchmark image datasets.Experimental results showed that the proposed method performs better in terms of standard performance evaluation parameters as compared to state-of-the-art methods on AR,ORL,LFW,and FERET face recognition datasets.