Search

In this paper, the characteristics of absolute value memristors are verified through the circuit implementation and construction of a chaotic system with a conditional symmetric fractional-order memristor. The dynamic behavior of fractional-order memristor systems is explored using fractional-order calculus theory and the Adomian Decomposition Method (ADM). Concurrently, the investigation probes into the existence of coexisting symmetric attractors, multiple coexisting bifurcation diagrams, and Lyapunov exponent spectra (LEs) utilizing system parameters as variables. Additionally, the system demonstrates an intriguing phenomenon known as offset boosting, where the embedding of an offset can adjust the position and size of the system's attractors. To ensure the practical applicability of these findings, a fractional-order sliding mode synchronization control scheme, inspired by integer-order sliding mode theory, is designed. The rationality and feasibility of this scheme are validated through a theoretical analysis and numerical simulation. [ABSTRACT FROM AUTHOR]

In the research of heterogeneous wireless network access selection algorithm, the method used for setting network attribute parameter weights is usually simple: using one of the subjective or objective weighting methods: Simple Additive Weighting (SAW), Analytic Hierarchy Process (AHP), Entropy, etc. As a result, the network selection results are incomprehensive. In this paper, we propose a new selection algorithm based on the combination of Intuitionistic Normal Fuzzy Analytic Hierarchy Process (INFAHP) and Improved Grey Relation Analysis (IGRA), which has been proved to be a new Multiple Attribute Decision Making (MADM) method based on the combination of subjective and objective weights. This algorithm expresses the semantic importance of the intuitionistic normal fuzzy number and calculates the subjective weight of network attributes using INFAHP while obtaining the objective weight using Coefficient of Variation (CV) at the same time. The final weights are integrated by subjective and objective weights. After that, the candidate networks can be sorted using IGRA. The proposed algorithm can get the more comprehensive weights of the network attributes by integrating the subjective and objective weights. Simulation results show that our algorithm can reduce the ratio of network handovers by 25% in average in the four traffic classes and improve the ping-pong effect effectively, so as to better meet users' demands for QoS. [ABSTRACT FROM AUTHOR]

This paper analyzes the laminar, incompressible natural convective transport inside vertical channel in an electrically conducting fluid saturated porous medium. In addition, this model incorporates the combined effects of Hall current, Soret and Joule heating. The non-linear governing equations with their corresponding boundary conditions are initially cast into a dimensionless form by using suitable transformations and Adomian decomposition method has been used to solve the system of equations. To explore the influence of various parameters on fluid flow properties, quantitative analysis is exhibited graphically and shown in the tabular form. [ABSTRACT FROM AUTHOR]

This paper examines the combined effects of the buoyancy force and of the magnetic field on the entropy generation rate in the flow of a couple stress fluid through a porous vertical channel. The flow's dynamical equations were non-dimensionalised and solved via the application of the Adomian decomposition method (ADM). Variations of some thermo-physical parameters were conducted and discussed, with regard to the physics of the fluid. Our result shows that the entropy generation rate increases as the buoyancy increases in the fluid. In addition, the irreversibility in the flow system results mainly from the fluid's viscosity, ohmic heating, and the buoyancy. [ABSTRACT FROM AUTHOR]

The effect of laser, as a heat source, on a one-dimensional finite body was studied in this paper. The Cattaneo-Vernotte non-Fourier heat conduction model was used for thermal analysis. The thermal conductivity was assumed temperature-dependent which resulted in a non-linear equation. The obtained equations were solved using the approximate-analytical Adomian Decomposition Method (ADM). It was concluded that the non-linear analysis is important in non-Fourier heat conduction problems. Significant differences were observed between the Fourier and non-Fourier solutions which stresses the importance of non-Fourier solutions in the similar problems. [ABSTRACT FROM AUTHOR]

It is of interest to discuss how we are currently governed. A way that seems to operate through a given type of mentality every day helps to produce and disseminate means of conduct. ADM know-how, which circulates in the field of administration and extrapolates it, takes part in the production and dissemination of a business mentality which, in turn, is at the basis of current governability. This paper addresses the notion of government, one that does not only refer to political structures and to State management, but also to the means of action over the possibilities of action by others. It then addresses the notion of governability in different times, focusing on company or business governability, a sort of mentality that governs all. Based on that, it is possible for government to think of administration know-how as it is exercised nowadays. [ABSTRACT FROM AUTHOR]

In this paper we implement the Adomian decomposition method (ADM) for solving a time-fractional Burger-Huxley's equation where the fractional derivative is considered in the Caputo sense. The results reveal that the (ADM) is very effective and convenient in solving wide classes of equations in particular evolution fractional order equations. [ABSTRACT FROM AUTHOR]

Traffic grooming in a WDM network consists of assigning to each request (lightpath) a wavelength with the constraint that a given wavelength can carry at most C requests or equivalently a request uses 1/C of the bandwidth. C is known as the grooming ratio. A request (lightpath) needs two SONET add-drop multiplexers (ADMs) at each end node; using grooming, different requests can share the same ADM. The so called traffic grooming problem consists of minimizing the total number of ADMs to be used (in order to reduce the overall cost of the network). Here we consider the traffic grooming problem in WDM unidirectional rings which has been recently shown to be APX-hard and for which no constant approximations are known. We furthermore suppose an all to all uniform unitary traffic. This problem has been optimally solved for specific values of the grooming ratio, namely C = 2, 3, 4, 5, 6. In this paper we present various simple constructions for the grooming problem providing approximation of the total number of ADMs with a small constant ratio. For that we use the fact that the problem corresponds to a partition of the edges of the complete graph into subgraphs, where each subgraph has at most C edges and where the total number of vertices has to be minimized. [ABSTRACT FROM AUTHOR]