In this article, performing and deriving te probability density function for Rayleigh distribution is done by using ordinary least squares estimator method and Rank set estimator method. Then creating interval for scale parameter of Rayleigh distribution. Anew method using   is used for fuzzy scale parameter. After that creating the survival and hazard functions for two ranking functions are conducted to show which one is beast.

The objective of the work was to study the changes in height and stem diameter of sunflower plants during growth stages under hardening conditions to drought tolerance. Field experiments were carried out during the spring season of 2000 and2001. Agricultural practices were made according to recommendations.Asplit-split plots design was used with three replications.The main plots included irrigation treatments:irrigation to100%(full irrigation),75and50%of available water.The sub plots were the cultivars Euroflor and Flame.The sub-sub plots represented four seed soaking treatments:Control(unsoaking), soaking in water ,Paclobutrazol solution(250ppm),and Pix solution(500ppm). The soaking continued for 24 hours then seeds were dried at room

Researchers often equate database accounting models in general and the Resources-Events-Agents (REA) accounting model in particular with events accounting as proposed by Sorter (1969). In fact, REA accounting, database accounting, and events accounting are very different. Because REA accounting has become a popular topic in AIS research, it is important to agree on exactly what is meant by certain ideas, both in concept and in historical origin. This article clarifies the analyzing framework of REA accounting model and highlights the differences between the terms events accounting, database accounting, semantically-modeled accounting, and REA accounting. It als

We study the physics of flow due to the interaction between a viscous dipole and boundaries that permit slip. This includes partial and free slip, and interactions near corners. The problem is investigated by using a two relaxation time lattice Boltzmann equation with moment-based boundary conditions. Navier-slip conditions, which involve gradients of the velocity, are formulated and applied locally. The implementation of free-slip conditions with the moment-based approach is discussed. Collision angles of 0°, 30°, and 45° are investigated. Stable simulations are shown for Reynolds numbers between 625 and 10 000 and various slip lengths. Vorticity generation on the wall is shown to be affected by slip length, angle of incidence,

Cryptography algorithms play a critical role in information technology against various attacks witnessed in the digital era. Many studies and algorithms are done to achieve security issues for information systems. The high complexity of computational operations characterizes the traditional cryptography algorithms. On the other hand, lightweight algorithms are the way to solve most of the security issues that encounter applying traditional cryptography in constrained devices. However, a symmetric cipher is widely applied for ensuring the security of data communication in constraint devices. In this study, we proposed a hybrid algorithm based on two cryptography algorithms PRESENT and Salsa20. Also, a 2D logistic map of a chaotic system is a

Abstract—The upper limb amputation exerts a significant burden on the amputee, limiting their ability to perform everyday activities, and degrading their quality of life. Amputee patients’ quality of life can be improved if they have natural control over their prosthetic hands. Among the biological signals, most commonly used to predict upper limb motor intentions, surface electromyography (sEMG), and axial acceleration sensor signals are essential components of shoulder-level upper limb prosthetic hand control systems. In this work, a pattern recognition system is proposed to create a plan for categorizing high-level upper limb prostheses in seven various types of shoulder girdle motions. Thus, combining seven feature groups, w

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith