The increasing demand for continual learning in sequential data processing has led to progressively complex training methodologies and larger recurrent network architectures. Consequently, this has widened the knowledge gap between continual learning with recurrent neural networks (RNNs) and their ability to operate on devices with limited memory and compute. To address this challenge, we investigate the effectiveness of simplifying RNN architectures, particularly gated recurrent unit (GRU), and its impact on both single-task and multitask sequential learning. We propose a new variant of GRU, namely the minion recurrent unit (MiRU). MiRU replaces conventional gating mechanisms with scaling coefficients to regulate dynamic updates of hidden states and historical context, reducing computational costs and memory requirements. Despite its simplified architecture, MiRU maintains performance comparable to the standard GRU while achieving more than 1.92 speed-up and reducing parameter usage by 2.88, as demonstrated through evaluations on sequential image classification and natural language processing benchmarks. The impact of model simplification on its learning capacity is also investigated by performing continual learning tasks with a rehearsal-based strategy and global inhibition. We find that MiRU demonstrates stable performance in multitask learning even when using only rehearsal, unlike the standard GRU and its variants. These features position MiRU as a promising candidate for edge-device applications.
Degenerate parabolic partial differential equations (PDEs) with vanishing or unbounded leading coefficient make the PDE non-uniformly parabolic, and new theories need to be developed in the context of practical applications of such rather unstudied mathematical models arising in porous media, population dynamics, financial mathematics, etc. With this new challenge in mind, this paper considers investigating newly formulated direct and inverse problems associated with non-uniform parabolic PDEs where the leading space- and time-dependent coefficient is allowed to vanish on a non-empty, but zero measure, kernel set. In the context of inverse analysis, we consider the linear but ill-pose
A factor group is a mathematical group obtained by aggregating similar elements of a larger group using an equivalence relation that preserves some of the group structure. In this paper, the factor groups K(SL(2,121)) and K(SL(2,169)) computed for each group from the character table of rational representations.
In this paper, the botnet detection problem is defined as a feature selection problem and the genetic algorithm (GA) is used to search for the best significant combination of features from the entire search space of set of features. Furthermore, the Decision Tree (DT) classifier is used as an objective function to direct the ability of the proposed GA to locate the combination of features that can correctly classify the activities into normal traffics and botnet attacks. Two datasets namely the UNSW-NB15 and the Canadian Institute for Cybersecurity Intrusion Detection System 2017 (CICIDS2017), are used as evaluation datasets. The results reveal that the proposed DT-aware GA can effectively find the relevant features from
... Show MoreThe gas sensing properties of undoped Co3O4 and doped with Y2O3 nanostructures were investigated. The films were synthesized using the hydrothermal method on a seeded layer. The XRD, SEM analysis and gas sensing properties were investigated for the prepared thin films. XRD analysis showed that all films were polycrystalline, of a cubic structure with crystallite size of (12.6) nm for cobalt oxide and (12.3) nm for the Co3O4:6% Y2O3. The SEM analysis of thin films indicated that all films undoped Co3O4 and doped possessed a nanosphere-like structure.
The sensi
... Show MoreThe method of operational matrices is based on the Bernoulli and Shifted Legendre polynomials which is used to solve the Falkner-Skan equation. The nonlinear differential equation converting to a system of nonlinear equations is solved using Mathematica®12, and the approximate solutions are obtained. The efficiency of these methods was studied by calculating the maximum error remainder ( ), and it was found that their efficiency increases as increases. Moreover, the obtained approximate solutions are compared with the numerical solution obtained by the fourth-order Runge-Kutta method (RK4), which gives a good agreement.
Green buildings are considered more efficient than traditional buildings due to the incorporated techniques and the multidisciplinary specializations required to comply with their specifications, in addition to the advanced commissioning, which undergoes before handing over the buildings to the owners to ensure requirements conformance. As a result, the appropriate selection of a project delivery system acts as the essential factor that affects the performance of the project. This research aims at building a system that helps to select the best method to implement green buildings. Through studying the recent research approaches in project delivery systems, the factors that affect the selection of the optimal implementation method fo
... Show MoreIn this article, a new efficient approach is presented to solve a type of partial differential equations, such (2+1)-dimensional differential equations non-linear, and nonhomogeneous. The procedure of the new approach is suggested to solve important types of differential equations and get accurate analytic solutions i.e., exact solutions. The effectiveness of the suggested approach based on its properties compared with other approaches has been used to solve this type of differential equations such as the Adomain decomposition method, homotopy perturbation method, homotopy analysis method, and variation iteration method. The advantage of the present method has been illustrated by some examples.
Background The Transportation Problem (TP) is a detailed model in operations study with applications in logistics, supply chain management, and resource allocation. The classical IBFS methods including North-West Corner, Least Cost and Vogel’s Approximation have competitive computational efficiency, but they are very sensitive to the structure of the problem and usually lead to a solution that is far from the global optimum. Classic enhancement strategies like the Generalized Distribution (MODI) and Stepping-Stone (SS) approaches have low computational complexity but may fall into a local optimum quickly, which makes them ineffective in large-scale or unbalanced problems. Methods We propose the first generic hybrid algorithm, calle
... Show MoreTopological indices provide important insights into the structural characteristics of molecular graphs. The present investigation proposes and explores a creative graph on a finite group G, which is known as the RIG. This graph is designated as ΓRS G2(4) indicating a simple undirected graph containing elements of G. Two distinct ertices are regarded as nearly the same if and only if their sum yields a non-trivial involution element in G. RIGs have been discovered in various finite groups. We examine several facets of the RIG by altering the graph through the conjugacy classes of G. Furthermore, we investigate the topological indices as applications in graph theory applying the distance matrix of the G2(4) group.