The concepts of nonlinear mixed summable families and maps for the spaces that only non-void sets are developed. Several characterizations of the corresponding concepts are achieved and the proof for a general Pietsch Domination-type theorem is established. Furthermore, this work has presented plenty of composition and inclusion results between different classes of mappings in the abstract settings. Finally, a generalized notation of mixing maps and their characteristics are extended to a more general setting.

Regarding the security of computer systems, the intrusion detection systems (IDSs) are essential components for the detection of attacks at the early stage. They monitor and analyze network traffics, looking for abnormal behaviors or attack signatures to detect intrusions in real time. A major drawback of the IDS is their inability to provide adequate sensitivity and accuracy, coupled with their failure in processing enormous data. The issue of classification time is greatly reduced with the IDS through feature selection. In this paper, a new feature selection algorithm based on Firefly Algorithm (FA) is proposed. In addition, the naïve bayesian classifier is used to discriminate attack behaviour from normal behaviour in the network tra

Hiding technique for dynamic encryption text using encoding table and symmetric encryption method (AES algorithm) is presented in this paper. The encoding table is generated dynamically from MSB of the cover image points that used as the first phase of encryption. The Harris corner point algorithm is applied on cover image to generate the corner points which are used to generate dynamic AES key to second phase of text encryption. The embedded process in the LSB for the image pixels except the Harris corner points for more robust. Experimental results have demonstrated that the proposed scheme have embedding quality, error-free text recovery, and high value in PSNR.

Nowad ays, with the development of internet communication that provides many facilities to the user leads in turn to growing unauthorized access. As a result, intrusion detection system (IDS) becomes necessary to provide a high level of security for huge amount of information transferred in the network to protect them from threats. One of the main challenges for IDS is the high dimensionality of the feature space and how the relevant features to distinguish the normal network traffic from attack network are selected. In this paper, multi-objective evolutionary algorithm with decomposition (MOEA/D) and MOEA/D with the injection of a proposed local search operator are adopted to solve the Multi-objective optimization (MOO) followed by Naï

     The research deals with an evolutionary-based mutation with functional annotation to identify protein complexes within PPI networks. An important field of research in computational biology is the difficult and fundamental challenge of revealing complexes in protein interaction networks. The complex detection models that have been developed to tackle challenges are mostly dependent on topological properties and rarely use the biological  properties of PPI networks. This research aims to push the evolutionary algorithm to its maximum by employing gene ontology (GO) to communicate across proteins based on biological information similarity for direct genes. The outcomes show that the suggested method can be utilized to improve the

Abstract

 This research deals will the declared production planning operation in the general company of planting oils, which have  great role in production operations management who had built mathematical model for correct non-linear programming according to discounting operation during raw materials or half-made materials purchasing operation which concentration of six main products by company but discount included just three products of raw materials, and there were six months taken from the 1^st half of 2014 as a planning period has been chosen . Simulated annealing algorithm  application on non-linear model which been more difficulty than possible solution when imposed restric

There is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task. In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that

      This paper examines the finding of spacewise dependent heat source function in pseudoparabolic equation with initial and homogeneous Dirichlet boundary conditions, as well as the final time value / integral specification as additional conditions that ensure the uniqueness solvability of the inverse problem. However, the problem remains ill-posed because tiny perturbations in input data cause huge errors in outputs. Thus, we employ Tikhonov’s regularization method to restore this instability. In order to choose the best regularization parameter, we employ L-curve method. On the other hand, the direct (forward) problem is solved by a finite difference scheme while the inverse one is reformulated as an optimization problem. The

     In this paper, a general expression formula for the Boubaker scaling (BS) operational matrix of the derivative is constructed. Then it is used to study a new parameterization direct technique for treating calculus of the variation problems approximately. The calculus of variation problems describe several important phenomena in mathematical science. The first step in our suggested method is to express the unknown variables in terms of Boubaker scaling basis functions with unknown coefficients. Secondly, the operational matrix of the derivative together with some important properties of the BS are utilized to achieve a non-linear programming problem in terms of the unknown coefficients. Finally, the unknown parameters are obtaine

In this paper, we define the concept of soft -connected sets and soft -connected spaces by using the notion of soft -open sets in soft topological spaces. Several properties of these concepts are investigated.