This  article  co;nsiders a shrunken  estimator  Â·Of  Al-Hermyari·   and

AI Gobuii (.1) to estimate  the mean (8) of a normal clistributicm N (8 cr4)  with  known variance  (cr+),  when  <:I    guess value (So) av11il ble about the mean (B) as· an initial estrmate. This estimator is shown to be

more efficient tl1an the class-ical estimators  especially when 8 is close to 8•. General expressions .for bias and MSE -of considered  estitnator are gi 'en, witeh  some examples.  Nut.nerical cresdlts, comparisons  and

conclusions ate reported.

Big data analysis is essential for modern applications in areas such as healthcare, assistive technology, intelligent transportation, environment and climate monitoring. Traditional algorithms in data mining and machine learning do not scale well with data size. Mining and learning from big data need time and memory efficient techniques, albeit the cost of possible loss in accuracy. We have developed a data aggregation structure to summarize data with large number of instances and data generated from multiple data sources. Data are aggregated at multiple resolutions and resolution provides a trade-off between efficiency and accuracy. The structure is built once, updated incrementally, and serves as a common data input for multiple mining an

Sansevieriatrifasciata was studied as a potential biosorbent for chromium, copper and nickel removal in batch process from electroplating and tannery effluents. Different parameters influencing the biosorption process such as pH, contact time, and amount of biosorbent were optimized while using the 80 mm sized particles of the biosorbent. As high as 91.3 % Ni and 92.7 % Cu were removed at pH of 6 and 4.5 respectively, while optimum Cr removal of 91.34 % from electroplating and 94.6 % from tannery effluents was found at pH 6.0 and 4.0 respectively. Pseudo second order model was found to best fit the kinetic data for all the metals as evidenced by their greater R2 values. FTIR characterization of biosorbent revealed the presence of carboxyl a

           This paper introduce two types of edge degrees (line degree and near line degree) and total edge degrees (total line degree and total near line degree) of an edge in a fuzzy semigraph, where a fuzzy semigraph is defined as (V, σ, μ, η) defined on a semigraph G^* in which σ : V → [0, 1], μ : VxV → [0, 1] and η : X → [0, 1] satisfy the conditions that for all the vertices u, v in the vertex set,  μ(u, v) ≤ σ(u) ᴧ σ(v) and  η(e) = μ(u₁, u₂) ᴧ μ(u₂, u₃) ᴧ … ᴧ μ(u_n-1, u_n) ≤ σ(u₁) ᴧ σ(u_n), if e = (u₁, u₂, …, u_n), n ≥ 2 is an edge in the semigraph G

In this work, we introduce an intuitionistic fuzzy ideal on a KU-semigroup as a generalization of the fuzzy ideal of a KU-semigroup. An intuitionistic fuzzy k-ideal and some related properties are studied. Also, a number of characteristics of the intuitionistic fuzzy k-ideals are discussed. Next, we introduce the concept of intuitionistic fuzzy k-ideals under homomorphism along with the Cartesian products.

Voice Activity Detection (VAD) is considered as an important pre-processing step in speech processing systems such as speech enhancement, speech recognition, gender and age identification. VAD helps in reducing the time required to process speech data and to improve final system accuracy by focusing the work on the voiced part of the speech. An automatic technique for VAD using Fuzzy-Neuro technique (FN-AVAD) is presented in this paper. The aim of this work is to alleviate the problem of choosing the best threshold value in traditional VAD methods and achieves automaticity by combining fuzzy clustering and machine learning techniques. Four features are extracted from each speech segment, which are short term energy, zero-crossing rate, auto

Metaheuristic is one of the most well-known fields of research used to find optimum solutions for non-deterministic polynomial hard (NP-hard) problems, for which it is difficult to find an optimal solution in a polynomial time. This paper introduces the metaheuristic-based algorithms and their classifications and non-deterministic polynomial hard problems. It also compares the performance of two metaheuristic-based algorithms (Elephant Herding Optimization algorithm and Tabu Search) to solve the Traveling Salesman Problem (TSP), which is one of the most known non-deterministic polynomial hard problems and widely used in the performance evaluations for different metaheuristics-based optimization algorithms. The experimental results of Ele

This paper is concerned with finding the approximation solution (APPS) of a certain type of nonlinear hyperbolic boundary value problem (NOLHYBVP).  The given BVP is written in its discrete (DI) weak form (WEF), and is proved that  it has a unique APPS, which is obtained via the mixed Galerkin finite element method (GFE) with implicit method (MGFEIM) that reduces the problem to solve the Galerkin nonlinear algebraic system  (GNAS).  In this part, the predictor and the corrector technique (PT and CT) are proved convergent and are used to transform the obtained GNAS to  linear (GLAS ), then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are studied. The results