In this paper an improved weighted 0-1 knapsack method (WKM) is proposed to optimize the resource allocation process when the sum of items' weight exceeds the knapsack total capacity .The improved method depends on a modified weight for each item to ensure the allocation of the required resources for all the involved items. The results of the improved WKM are compared to the traditional 0-1 Knapsack Problem (KP). The proposed method dominates on the other one in term of the total optimal solution value of the knapsack .
The numerical resolve nonlinear system of Volterra integral equation of the second kind (NLSVIEK2) has been considered. The exponential function is used as the base function of the collocation method to approximate the resolve of the problem. Arithmetic epitome are performed which have already been solved by weighted residual manner, Taylor manner and block- by- block(2, 3, 5).
This paper considers and proposes new estimators that depend on the sample and on prior information in the case that they either are equally or are not equally important in the model. The prior information is described as linear stochastic restrictions. We study the properties and the performances of these estimators compared to other common estimators using the mean squared error as a criterion for the goodness of fit. A numerical example and a simulation study are proposed to explain the performance of the estimators.
In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonical de
... Show MoreDiscrete logarithms are applied in many cryptographic problems . For instance , in public key . and for construction of sets with disti nct sums of k-clcments. The purpose o r this paper
is to modify the method ol' informationl1·iding using discrete logarithms , introduce new properties of St - sets , uscdthe direct product of groups to construct cyclic group and finally, present modified method for knapsack &
... Show MoreBackground: Sprite coding is a very effective technique for clarifying the background video object. The sprite generation is an open issue because of the foreground objects which prevent the precision of camera motion estimation and blurs the created sprite. Objective: In this paper, a quick and basic static method for sprite area detection in video data is presented. Two statistical methods are applied; the mean and standard deviation of every pixel (over all group of video frame) to determine whether the pixel is a piece of the selected static sprite range or not. A binary map array is built for demonstrating the allocated sprite (as 1) while the non-sprite (as 0) pixels valued. Likewise, holes and gaps filling strategy was utilized to re
... Show MoreAn adaptive fuzzy weighted linear regression model in which the output is based
on the position and entropy of quadruple fuzzy numbers had dealt with. The solution
of the adaptive models is established in terms of the iterative fuzzy least squares by
introducing a new suitable metric which takes into account the types of the influence
of different imprecisions. Furthermore, the applicability of the model is made by
attempting to estimate the fuzzy infant mortality rate in Iraq using a selective set of
inputs.
In this work, a weighted H lder function that approximates a Jacobi polynomial which solves the second order singular Sturm-Liouville equation is discussed. This is generally equivalent to the Jacobean translations and the moduli of smoothness. This paper aims to focus on improving methods of approximation and finding the upper and lower estimates for the degree of approximation in weighted H lder spaces by modifying the modulus of continuity and smoothness. Moreover, some properties for the moduli of smoothness with direct and inverse results are considered.
The topic of modulus of smoothness still gets the interest of many researchers due to its applicable usage in different fields, especially for function approximation. In this paper, we define a new modulus of smoothness of weighted type. The properties of our modulus are studied. These properties can be easily used in different fields, in particular, the functions in the Besov spaces when
In this paper, we proposed a new class of weighted Rayleigh distribution based on two parameters, scale and shape parameters which are introduced in Rayleigh distribution. The main properties of this class are investigated and derived.