Statistical analysis of non-normal data is usually more complicated than that for normaldistribution. In this paper, a simple root/power transformation technique developed by Niaki, et al [1]is extended to transform right and left skewed distributions to nearly normal. The value of theroot/power is explored such that the skewness of the transformed data becomes almost zero with anacceptable err...

abstract area-reduction method is one of the most common experimental methods that determines the sediment distribution in reservoirs. in this method, reservoirs are geometrically divided into four types. for all reservoir types, parameters are achieved based on a limited number of reservoirs which leads to large scale errors for prediction of this method. so suitable parameters can be achieved...

introduction patellar dislocation is an emergency. vertical patellar dislocation is rare, often seen in adolescents and mostly due to sports injuries or high-velocity trauma. few cases have been reported in the literature. closed or open reduction under general anesthesia is often needed. we report a case of vertical locked patellar dislocation in a 26-year-old male, which was reduced by a simp...

When the times between renewals in a renewal process are not exponentially distributed, simulation can become a viable method of analysis. The renewal function is estimated through simulation for a renewal process simulation for a renewal process with gamma distributed renewal times and the shape parameter a > 1. Gamma random deviates will be generated by means of the so called Acceptance Rejec...

This paper is the first in a series of three, which analyze an adaptive approximate approach for solving (n + 1 (-dimensional boundary value problems by replacing them with systems of equations in n-dimensional space. In this approach the unknown functions of (n + 1) variables are projected onto finite linear combinations of functions of just n variables. This paper shows how the coefficients o...

We put forth a lookup-table-based modular reduction method which partitions the binary string of an integer to be reduced into blocks according to its runs. Its complexity depends on the amount of runs in the binary string. We show that the new reduction is almost twice as fast as the popular Barrett’s reduction, and provide a thorough complexity analysis of the method.