نتایج جستجو برای: by applying k
تعداد نتایج: 7245956 فیلتر نتایج به سال:
In this paper, for any non-empty subset C of a pseudo BCI-algebra X, the concept of p-closure of C, denoted by C(pc), is introduced and some related properties are investigated. Applying this concept, a characterization of the minimal elements of X is given. It is proved that C(pc) is the least closed pseudo BCI-ideal of X containing C and K(X) for any ideal C of X...
this research was conducted in two protect and destroy region in the middle zagros, in illam province. in order to identification of ecological species group and evaluate density of regeneration, effect of many factors such as protection, vegetation, physiographic factors, physical and chemical properties of soil in study locations were studied. to achieve these purpose number of 54 plots using...
This paper compares clusters of aligned Persian and English texts obtained from k-means method. Text clustering has many applications in various fields of natural language processing. So far, much English documents clustering research has been accomplished. Now this question arises, are the results of them extendable to other languages? Since the goal of document clustering is grouping of docum...
In order to study the effects of nitrogen (N), phosphorus (P) and potassium (K) on the yield, the appearance eligibility ratio and the contents of total glucosinolates and glucoraphanin of cauliflower, the 311-A optimization regression design was used to conduct field experiments of N, P, K fertilizer treatments using winter cauliflower variety ‘‘HB16’’. The models of the balanced application f...
population growth as well as global fresh water shortage problem have necessitated the use of unconventional water resources in agricultural sector, as the largest consumer of fresh water, especially in arid and semi-arid regions. in this study, the effect of four irrigation methods on yield, uptake of water and important nutrients, and the salt accumulation in soil was investigated using a com...
For a graph G let μ(G) denote the cyclomatic number and let ν(G) denote the maximum number of edge-disjoint cycles of G. We prove that for every k ≥ 0 there is a finite set P(k) such that every 2-connected graph G for which μ(G)− ν(G) = k arises by applying a simple extension rule to a graph in P(k). Furthermore, we determine P(k) for k ≤ 2 exactly.
Designing bulbous bows for ships remains a challenging task. Their impact on different design attributes as well their change in performance when operating off intended condition renders this multidimensional problem. This paper explores the application of machine learning techniques to sample in-service vessel data develop preliminary tool. The ships' was analysed together with bow generate mo...
424 Abstract—Image denoising is one of the fundamental problems in image processing. In this paper, a novel approach to suppress noise from the image is conducted by applying the interquartile range (IQR) which is one of the statistical methods used to detect outlier effect from a dataset. A window of size kk was implemented to support IQR filter. Each pixel outside the IQR range of the kk ...
Since applying design patterns provides a foresight of the exibility and future extensibility of software, their application is expected to constructing evolutionable software. However, there have been few research on quantitative evaluation of the e ectiveness of applying design patterns to software development. In this paper, we aim to evaluate the e ectiveness of applying design patterns. Th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید