An Optimized Deep Learning Based Optimization Algorithm for the Detection of Colon Cancer Using Deep Recurrent Neural Networks

Colon cancer is the second leading dreadful disease-causing death. The challenge in the colon cancer detection is the accurate identification of the lesion at the early stage such that mortality and morbidity can be reduced. In this work, a colon cancer classification method is identified out using Dragonfly-based water wave optimization (DWWO) based deep recurrent neural network. Initially, the input cancer images subjected to carry a pre-processing, in which outer artifacts are removed. The pre-processed image is forwarded for segmentation then the images are converted into segments using Generative adversarial networks (GAN). The obtained segments are forwarded for attribute selection module, where the statistical features like mean, variance, kurtosis, entropy, and textual features, like LOOP features are effectively extracted. Finally, the colon cancer classification is solved by using the deep RNN, which is trained by the proposed Dragonfly-based water wave optimization algorithm. The proposed DWWO algorithm is developed by integrating the Dragonfly algorithm and water wave optimization

Secure Multi-Path Selection with Optimal Controller Placement Using Hybrid Software-Defined Networks with Optimization Algorithm

The Internet's growth in popularity requires computer networks for both agility and resilience. Recently, unable to satisfy the computer needs for traditional networking systems. Software Defined Networking (SDN) is known as a paradigm shift in the networking industry. Many organizations are used SDN due to their efficiency of transmission. Striking the right balance between SDN and legacy switching capabilities will enable successful network scenarios in architecture networks. Therefore, this object grand scenario for a hybrid network where the external perimeter transport device is replaced with an SDN device in the service provider network. With the moving away from older networks to SDN, hybrid SDN includes both legacy and SDN switches. Existing models of SDN have limitations such as overfitting, local optimal trapping, and poor path selection efficiency. This paper proposed a Deep Kronecker Neural Network (DKNN) to improve its efficiency with a moderate optimization method for multipath selection in SDN. Dynamic resource scheduling is used for the reward function the learning performance is improved by the deep reinforcement learning (DRL) technique. The controller for centralised SDN acts as a network brain in the control plane. Among the most important duties network is selected for the best SDN controller. It is vulnerable to invasions and the controller becomes a network bottleneck. This study presents an intrusion detection system (IDS) based on the SDN model that runs as an application module within the controller. Therefore, this study suggested the feature extraction and classification of contractive auto-encoder with a triple attention-based classifier. Additionally, this study leveraged the best performing SDN controllers on which many other SDN controllers are based on OpenDayLight (ODL) provides an open northbound API and supports multiple southbound protocols. Therefore, one of the main issues in the multi-controller placement problem (CPP) that addresses needed in the setting of SDN specifically when different aspects in interruption, ability, authenticity and load distribution are being considered. Introducing the scenario concept, CPP is formulated as a robust optimization problem that considers changes in network status due to power outages, controller’s capacity, load fluctuations and changes in switches demand. Therefore, to improve network performance, it is planned to improve the optimal amount of controller placements by simulated annealing using different topologies the modified Dragonfly optimization algorithm (MDOA)

Improved feature selection using a hybrid side-blotched lizard algorithm and genetic algorithm approach

Feature selection entails choosing the significant features among a wide collection of original features that are essential for predicting test data using a classifier. Feature selection is commonly used in various applications, such as bioinformatics, data mining, and the analysis of written texts, where the dataset contains tens or hundreds of thousands of features, making it difficult to analyze such a large feature set. Removing irrelevant features improves the predictor performance, making it more accurate and cost-effective. In this research, a novel hybrid technique is presented for feature selection that aims to enhance classification accuracy. A hybrid binary version of side-blotched lizard algorithm (SBLA) with genetic algorithm (GA), namely SBLAGA, which combines the strengths of both algorithms is proposed. We use a sigmoid function to adapt the continuous variables values into a binary one, and evaluate our proposed algorithm on twenty-three standard benchmark datasets. Average classification accuracy, average number of selected features and average fitness value were the evaluation criteria. According to the experimental results, SBLAGA demonstrated superior performance compared to SBLA and GA with regards to these criteria. We further compare SBLAGA with four wrapper feature selection methods that are widely used in the literature, and find it to be more efficient

Optimal Networks from Error Correcting Codes

To address growth challenges facing large Data Centers and supercomputing clusters a new construction is presented for scalable, high throughput, low latency networks. The resulting networks require 1.5-5 times fewer switches, 2-6 times fewer cables, have 1.2-2 times lower latency and correspondingly lower congestion and packet losses than the best present or proposed networks providing the same number of ports at the same total bisection. These advantage ratios increase with network size. The key new ingredient is the exact equivalence discovered between the problem of maximizing network bisection for large classes of practically interesting Cayley graphs and the problem of maximizing codeword distance for linear error correcting codes. Resulting translation recipe converts existent optimal error correcting codes into optimal throughput networks.Comment: 14 pages, accepted at ANCS 2013 conferenc

Hybridization of multi-objective deterministic particle swarm with derivative-free local searches

The paper presents a multi-objective derivative-free and deterministic global/local hybrid algorithm for the efficient and effective solution of simulation-based design optimization (SBDO) problems. The objective is to show how the hybridization of two multi-objective derivative-free global and local algorithms achieves better performance than the separate use of the two algorithms in solving specific SBDO problems for hull-form design. The proposed method belongs to the class of memetic algorithms, where the global exploration capability of multi-objective deterministic particle swarm optimization is enriched by exploiting the local search accuracy of a derivative-free multi-objective line-search method. To the authors best knowledge, studies are still limited on memetic, multi-objective, deterministic, derivative-free, and evolutionary algorithms for an effective and efficient solution of SBDO for hull-form design. The proposed formulation manages global and local searches based on the hypervolume metric. The hybridization scheme uses two parameters to control the local search activation and the number of function calls used by the local algorithm. The most promising values of these parameters were identified using forty analytical tests representative of the SBDO problem of interest. The resulting hybrid algorithm was finally applied to two SBDO problems for hull-form design. For both analytical tests and SBDO problems, the hybrid method achieves better performance than its global and local counterparts

DA-SVM, MLR, PLS i OLS modeliranje kumulativnog otpuštanja Tramadola iz formulacija inkapsuliranih s PCL i PVP

This work aimed to model the kinetics of cumulative drug release from formulations based on encapsulation by biodegradable polycaprolactone and polyvinylpyrrolidone polymers. Different ratios of the polymerswere prepared by a solvent evaporation method using Span 20 and Span 80 as surfactants. The cumulative drug release was estimated depending on the formulation component and time. Four models: hybrid model of support vector machine and dragonfly algorithm (DA-SVM), partial least squares (PLS) model, multiple linear regression (MLR) model, and ordinary least squared (OLS) model, were developed and compared. The statistical analysis proved there were no issues in variable inputs. The results showed that the DA-SVM model gave a better result where a determination coefficient was close to one and RMSE error close to zero. A graphical interface was built to calculate the cumulative drug release. This work is licensed under a Creative Commons Attribution 4.0 International License.Cilj ovog rada bio je modeliranje kinetike kumulativnog otpuštanja lijeka iz formulacija inkapsuliranih biorazgradivim polikaprolaktonom i polivinilpirolidonom. Različiti omjeri polimera pripremljeni su isparavanjem otapala uz upotrebu Span 20 i Span 80 kao površinski aktivnih tvari. U modeliranju kinetike primijenjena su četiri pristupa: hibridni pristup kombiniranjem metode potpornih vektora i Dragonfly algoritma (DA-SVM), metoda parcijalnih najmanjih kvadrata (PLS), višestruka linearna regresija (MLR) te metoda najmanjih kvadrata (OLS). Provedena je usporedba kvalitete predviđanja kumulativnog otpuštanja lijeka, ovisno o primijenjenom polimeru i vremenu. Statistička analiza nije ukazala na probleme s odabranim ulaznim varijablama. Rezultati su pokazali superiornost predviđanja DA-SVM modelom uz koeficijent determinacije blizu jedinice te RMSE pogrešku blizu nule. Za izračun kumulativnog otpuštanja lijeka konstruirano je grafičko sučelje. Ovo djelo je dano na korištenje pod licencom Creative Commons Imenovanje 4.0 međunarodna