Eco-friendly concrete is produced using the waste of many industries. It reduces the fears concerning energy utilization, raw materials, and mass-produced cost of common concrete. Several stress-strain models documented in the literature can be utilized to estimate the ultimate strength of concrete components reinforced with fibers. Unfortunately, there is a lack of data on how non-metallic fibers, such as polypropylene (PP), affect the properties of concrete, especially eco-friendly concrete. This study presents a novel approach to modeling the stress-strain behavior of eco-friendly polypropylene fiber-reinforced concrete (PFRC) using meta-heuristic particle swarm optimization (PSO) employing 26 PFRC various mixtures. The cement was partia

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

This paper develops a fuzzy multi-objective model for solving aggregate production planning problems that contain multiple products and multiple periods in uncertain environments. We seek to minimize total production cost and total labor cost. We adopted a new method that utilizes a Zimmermans approach to determine the tolerance and aspiration levels. The actual performance of an industrial company was used to prove the feasibility of the proposed model. The proposed model shows that the method is useful, generalizable, and can be applied to APP problems with other parameters.

In this paper we find the exact solution of Burger's equation after reducing it to Bernoulli equation. We compare this solution with that given by Kaya where he used Adomian decomposition method, the solution given by chakrone where he used the Variation iteration method (VIM)and the solution given by Eq(5)in the paper of M. Javidi. We notice that our solution is better than their solutions.

This study presents a practical method for solving fractional order delay variational problems. The fractional derivative is given in the Caputo sense. The suggested approach is based on the Laplace transform and the shifted Legendre polynomials by approximating the candidate function by the shifted Legendre series with unknown coefficients yet to be determined. The proposed method converts the fractional order delay variational problem into a set of (n ＋ 1) algebraic equations, where the solution to the resultant equation provides us the unknown coefficients of the terminated series that have been utilized to approximate the solution to the considered variational problem. Illustrative examples are given to show that the recommended appro

Feature selection (FS) constitutes a series of processes used to decide which relevant features/attributes to include and which irrelevant features to exclude for predictive modeling. It is a crucial task that aids machine learning classifiers in reducing error rates, computation time, overfitting, and improving classification accuracy. It has demonstrated its efficacy in myriads of domains, ranging from its use for text classification (TC), text mining, and image recognition. While there are many traditional FS methods, recent research efforts have been devoted to applying metaheuristic algorithms as FS techniques for the TC task. However, there are few literature reviews concerning TC. Therefore, a comprehensive overview was systematicall

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

Intrusion detection system is an imperative role in increasing security and decreasing the harm of the computer security system and information system when using of network. It observes different events in a network or system to decide occurring an intrusion or not and it is used to make strategic decision, security purposes and analyzing directions. This paper describes host based intrusion detection system architecture for DDoS attack, which intelligently detects the intrusion periodically and dynamically by evaluating the intruder group respective to the present node with its neighbors. We analyze a dependable dataset named CICIDS 2017 that contains benign and DDoS attack network flows, which meets certifiable criteria and is ope

The emphasis of Master Production Scheduling (MPS) or tactic planning is on time and spatial disintegration of the cumulative planning targets and forecasts, along with the provision and forecast of the required resources. This procedure eventually becomes considerably difficult and slow as the number of resources, products and periods considered increases. A number of studies have been carried out to understand these impediments and formulate algorithms to optimise the production planning problem, or more specifically the master production scheduling (MPS) problem. These algorithms include an Evolutionary Algorithm called Genetic Algorithm, a Swarm Intelligence methodology called Gravitational Search Algorithm (GSA), Bat Algorithm (BAT), T