drought is one of the most important factors limiting crop yields around the world. drought stress in plants, the change (increase or decrease) in the production of plant proteins. this research was carried out using bread wheat genotypes. for evaluation of leaf protein pattern in wheat, 10 genotypes were assayed with 3 replications under irrigated (non-stress) and rain-fed (stress) conditions....

one of the great events in the history of iran is the emergence and spread of islam within the early hegira centuries.  the result of the interaction between islam and iran was transformations in many cultural dimensions and indices. this research states the problem of the islamization of iranian lifestyle andthe culture of purity and impurity, in particular.in this article,interpretive-analyti...

Anti-patterns, one of the reasons for software design problems, can be solved by applying proper design patterns. If anti-patterns are discovered in the design phase, this should lead an early pattern recommendation by using relationships between antiand design patterns. This paper presents an idea called Antipattern based Design Pattern Recommender (ADPR), that uses design diagrams i.e. class ...

Cím: Performance comparison of query-based techniques for anti-pattern detection

Please note that the full text version provided on GALA is the final published version awarded by the university. “I certify that this work has not been accepted in substance for any degree, and is not concurrently being submitted for any degree other than that of (name of research degree) being studied at the University of Greenwich. I also declare that this work is the result of my own invest...

In this paper, the correlation measure of neutrosophic refined(multi-) sets is proposed. The concept of this correlation measure of neutrosophic refined sets is the extension of correlation measure of neutrosophic sets and intuitionistic fuzzy multi-sets. Finally, using the correlation of neutrosophic refined set measure, the application of medical diagnosis and pattern recognition are presented.

A sequence avoids a pattern π ∈ R if there is no subsequence that shares the same relative ordering as π. We develop techniques to understand how many queries it takes to test whether a sequence is π-avoiding or -far from π-avoiding. We initiate the study of searching in π-avoiding or nearly π-avoiding sequences, and show that it is possible to efficiently find most elements in a nearly (2, 1)-...

In this paper we study pattern avoidance for affine permutations. In particular, we show that for a given pattern p, there are only finitely many affine permutations in S̃n that avoid p if and only if p avoids the pattern 321. We then count the number of affine permutations that avoid a given pattern p for each p in S3, as well as give some conjectures for the patterns in S4.

We show that every avoidable pattern can be avoided by an infinite sequence of palindromes over a fixed finite alphabet. © 2009 Elsevier B.V. All rights reserved.