Search

This study aims at understanding the role of the tools chosen throughout the processes of solving a non-routine mathematical problem and communicating its solution. In assuming that problem-solving is a synchronous activity of mathematization and expression of mathematical thinking we take our proposed Mathematical Problem Solving with Technology (MPST) model to analyze the processes of solving-and-expressing-problems. Resorting to qualitative methods for data collection and analysis, we report on the case of an 8th grader working on a covariation problem to examine the role that paper-and-pencil and digital tools play in the development of a conceptual model of the situation. We found that the resources used throughout the solving-and-expressing activity influenced the depth of the conceptual model developed, within a process of progressive mathematization. Whereas paper-and-pencil led to the emergence of a conceptual model based on exploring particular cases, the digital transformation of the solution was triggered by the process of communicating its mathematical justification and expanded the previous model. Moreover, the complexity of this activity is evidenced by its multiple sequences of processes. Finally, the integration process seems crucial as the concomitant use of technological and mathematical resources precedes major advancements in the expansion of the conceptual model.

We investigated the influence of mental imagery expertise in 15 pen and paper role-players as an expert group compared to the gender-matched control group of computer role-players in the difficult Vandenberg and Kuse mental rotation task. In this task, the participants have to decide which two of four rotated figures match the target figure. The dependent measures were performance speed and accuracy. In our exploratory investigation, we further examined midline frontal theta band activation, parietal alpha band activation, and parietal alpha band asymmetry in EEG as indicator for the chosen rotation strategy. Additionally, we explored the gender influence on performance and EEG activation, although a very small female sample section was given. The expected gender difference concerning performance accuracy was negated by expertise in pen and paper role-playing women, while the gender-specific difference in performance speed was preserved. Moreover, gender differences concerning electro-cortical measures revealed differences in rotation strategy, with women using top-down strategies compared to men, who were using top-down strategies and active inhibition of associative cortical areas. These strategy uses were further moderated by expertise, with higher expertise leading to more pronounced activation patters, especially during successful performance. However, due to the very limited sample size, the findings of this explorative study have to be interpreted cautiously.

Investigating the research trends within a scientific domain by analyzing semantic information extracted from scientific journals has been a topic of interest in the natural language processing (NLP) field. A research trend evaluation is generally based on the time evolution of the term occurrence or the term topic, but it neglects an important aspect—research publication latency. The average time lag between the research and its publication may vary from one month to more than one year, and it is a characteristic that may have significant impact when assessing research trends, mainly for rapidly evolving scientific areas. To cope with this problem, the present paper is the first work that explicitly considers research publication latency as a parameter in the trend evaluation process. Consequently, we provide a new trend detection methodology that mixes auto-ARIMA prediction with Mann–Kendall trend evaluations. The experimental results in an electronic design automation case study prove the viability of our approach.

Paper waste in the mockups design with regular, irregular, and amorphous patterns is a critical problem in digital printing presses. Paper waste reduction directly impacts production costs, generating business and environmental benefits. This problem can be mapped to the two-dimensional irregular bin-packing problem. In this paper, an iterated local search algorithm using a novel neighborhood structure to detect overlaps between amorphous shapes is introduced. This algorithm is used to solve the paper waste problem, modeled as one 2D irregular bin-packing problem. The experimental results show that this approach works efficiently and effectively to detect and correct the overlaps between regular, irregular, and amorphous figures.

The purpose of this short note is to present a correction of the proof of the main result given in the paper “Equivalence of the existence of best proximity points and best proximity pairs for cyclic and noncyclic nonexpansive mappings,” Demonstr. Math. 53 (2020), 38–43.

This short paper concerns the analysis of the M/M/k queueing system with customer abandonment. In this system, service managers provide a finite buffer space, which is a waiting area that prevents customers from abandoning the system. Abandonment of the system can occur from reneging (exiting from the queue while waiting), and/or balking (leaving the system without waiting). We derive an analytical expression to represent the impact of the buffer space capacity on the delay probability and the abandonment probability for a system with deferred abandonment. The result indicates the provision of the buffer space in a large system could only increase the delay probability while the abandonment probability remains unchanged. Despite the benevolent intentions of service managers, providing a buffer space may exacerbate the performance of larger systems.

This paper introduced the use of two new adsorbents, Akrosorb soda-lime and Bentonite clay, for refinery flare flue gas capture and storage. This study also developed a novel pilot plant model with 409.7149 kg/h capacity refinery flare emission capture with a novel adsorption column configuration using Akrosorb soda-lime and Bentonite clay adsorbents. The flare flue gas adsorption unit was designed, fabricated, test run, and commissioned. The adsorption column temperature is 28 ± 10 °C and has a pressure of 131.7 kPa. The novel plant RSM optimization result shows that 93.24% of CO2 and 62.18% of CO were absorbed, while 86.14% of NOx and 55.87% of HC were absorbed. The established optimum conditions of CO2, NOx, HC, and CO removal efficiency are 22 °C, 2 atm, and 60 min. The variation in flare gas emission could impact the removal efficiency of the plant. The results show the maximum adsorption ability or capacity of 314.30 mg/g, and 68.90 mg/g was reached at 60 min for Akrosorb soda-lime and molded Bentonite adsorbents. Therefore, the developed novel technology for CO2 and other GHG capture is technically feasible and friendly. The combined usage of both adsorbents will enhance the capture of GHG at a low cost compared to using Akrosorb alone as an adsorbent.

Pulp washing process has the features of multivariate, time delay, nonlinearity. Considering the difficulties of modeling and optimal control in pulp washing process, a data-driven operational-pattern optimization method is proposed to model and optimize the pulp washing process in this paper. The most important quality indexes of pulp washing performance are residual soda in the washed pulp and Baume degree of extracted black liquor. Considering the difficulties of modeling, online measurement of these indexes, two-step neural networks, and multivariate logistic regression are used to establish the prediction models of residual soda and Baume degree. The mathematical model of the washing process can be identified, and the indexes can meet the production requirements. In the target of better product quality, low cost, and low energy consumption, a multiobjective problems is solved by ant colony optimization algorithm based on the optimized operational-pattern database. It shows that the theoretical analyses are correct and the practical applications are feasible, optimization control system has been designed for the pulp washing process, and the practical results show that pulp production increased by 20% and water consumption decreased by nearly 30%. This method is effective in the pulp washing process.

In this paper, we consider parallel-machine scheduling with release times and submodular penalties (P|rj,reject|Cmax+π(R)), in which each job can be accepted and processed on one of m identical parallel machines or rejected, but a penalty must paid if a job is rejected. Each job has a release time and a processing time, and the job can not be processed before its release time. The objective of P|rj,reject|Cmax+π(R) is to minimize the makespan of the accepted jobs plus the penalty of the rejected jobs, where the penalty is determined by a submodular function. This problem generalizes a multiprocessor scheduling problem with rejection, the parallel-machine scheduling with submodular penalties, and the single machine scheduling problem with release dates and submodular rejection penalties. In this paper, inspired by the primal-dual method, we present a combinatorial 2-approximation algorithm to P|rj,reject|Cmax+π(R). This ratio coincides with the best known ratio for the parallel-machine scheduling with submodular penalties and the single machine scheduling problem with release dates and submodular rejection penalties.

Swirling has a significant effect on the main characteristics of flow and can lead to its fundamental restructuring. On the flow axis, a stagnation point with zero velocity is possible, behind which a return flow zone is formed. The apparent instability leads to the formation of secondary vortex motions and can also be the cause of vortex breakdown. In the paper, a swirling flow with a velocity profile of the Batchelor vortex type has been studied on the basis of the linear hydrodynamic stability theory. An effective numerical method for solving the spectral problem has been developed. This method includes the asymptotic solutions at artificial and irregular singular points. The stability of flows was considered for the values of the Reynolds number in the range 10≤Re≤5×106. The calculations were carried out for the value of the azimuthal wavenumber parameter n=−1. As a result of the analysis of the solutions, the existence of up to eight simultaneously occurring unstable modes has been shown. The paper presents a classification of the detected modes. The critical parameters are calculated for each mode. For fixed values of the Reynolds numbers 60≤Re≤5000, the curves of neutral stability are plotted. Branching points of unstable modes are found. The maximum growth rates for each mode are determined. A new viscous instability mode is found. The performed calculations reveal the instability of the Batchelor vortex at large values of the swirl parameter for long-wave disturbances.

This paper investigates global dynamics in fractional-order dual inertial neural networks with time lags. Firstly, according to some crucial features of Mittag-Leffler functions and Banach contracting mapping principle, the existence and uniqueness of $ S $-asymptotically $ \omega $-periodic oscillation of the model are gained. Secondly, by using the comparison principle and the stability criteria of delayed Caputo fractional-order differential equations, global asymptotical stability of the model is studied. In the end, the feasibility and effectiveness of the obtained conclusions are supported by two numerical examples. There are few papers focus on $ S $-asymptotically $ \omega $-periodic dynamics in fractional-order dual inertial neural networks with time-varying lags, apparently, the works in this paper fill some of the gaps.

Using the approach of so-called c-sequences introduced by the fifth author in his recent work, we give much simpler and shorter proofs of multivalued Perov's type results with respect to the ones presented in the recently published paper by M. Abbas et al. Our proofs improve, complement, unify and enrich the ones from the recent papers. Further, in the last section of this paper, we correct and generalize the well-known Perov's fixed point result. We show that this result is in fact equivalent to Banach's contraction principle.

There is a close analogy and similarity between topology and rough set theory. As, the leading idea of this theory is depended on two approximations, namely lower and upper approximations, which correspond to the interior and closure operators in topology, respectively. So, the joined study of this theory and topology becomes fundamental. This theory mainly propose to enlarge the lower approximations by adding new elements to it, which is an equivalent goal for canceling elements from the upper approximations. For this intention, one of the primary motivation of this paper is the desire of improving the accuracy measure and reducing the boundary region. This aim can be achieved easily by utilizing ideal in the construction of the approximations as it plays an important role in removing the vagueness of concept. The emergence of ideal in this theory leads to increase the lower approximations and decrease the upper approximations. Consequently, it minimizes the boundary and makes the accuracy higher than the previous. Therefore, this work expresses the set of approximations by using new topological notions relies on ideals namely $ \mathcal{I} $-$ {\delta_{\beta}}_{J} $-open sets and $ \mathcal{I} $-$ {\bigwedge_{\beta}}_{J} $-sets. Moreover, these notions are also utilized to extend the definitions of the rough membership relations and functions. The essential properties of the suggested approximations, relations and functions are studied. Comparisons between the current and previous studies are presented and turned out to be more precise and general. The brilliant idea of these results is increased in importance by applying it in the chemical field as it is shown in the end of this paper. Additionally, a practical example induced from an information system is introduced to elucidate that the current rough membership functions is better than the former ones in the other studies.

In a recent paper [4], Xu studied some alternating multiple zeta values. In particular, he gave two recurrence formulas of alternating multiple zeta values $ \zeta^\star({\bar 1}, \{1\}_{m-1}, {\bar 1}) $ and $ \zeta^\star(2, \{1\}_{m-1}, {\bar 1}) $. In this paper, we will give the closed forms representations of $ \zeta^\star({\bar 1}, \{1\}_{m-1}, {\bar 1}) $ and $ \zeta^\star(2, \{1\}_{m-1}, {\bar 1}) $ in terms of single zeta values and polylogarithms.

In this paper, we prove some new Simpson's type inequalities for partial $ (p, q) $-differentiable convex functions of two variables in the context of $ (p, q) $-calculus. We also show that the findings in this paper are generalizations of comparable findings in the literature.

In this paper, we derive the explicit analytical solution of incommensurate fractional differential equation systems with fractional order $ 1 < \alpha, \beta < 2 $. The derivation is extended from a recently published paper by Huseynov et al. in [1], which is limited for incommensurate fractional order $ 0 < \alpha, \beta < 1 $. The incommensurate fractional differential equation systems were first converted to Volterra integral equations. Then, the Mittag-Leffler function and Picard's successive approximations were used to obtain the analytical solution of incommensurate fractional order systems with $ 1 < \alpha, \beta < 2 $. The solution will be simplified via some combinatorial concepts and bivariate Mittag-Leffler function. Some special cases will be discussed, while some examples will be given at the end of this paper.

In this paper, we investigate the Hyers-Ulam stability of additive and Fréchet functional equations on restricted domains. We improve the bounds and thus the results obtained by S. M. Jung and J. M. Rassias. As a consequence, we obtain asymptotic behaviors of functional equations of different types. One of the objectives of this paper is to bring out the involvement of functional equations in various characterizations of inner product spaces.

The paper is devoted to the integration of the loaded modified Kortewegde Vries equation in the class of rapidly decreasing functions. It is well known that loaded differential equations in the literature are usually called equations containing in the coefficients or in the right-hand side any functionals of the solution, in particular, the values of the solution or its derivatives on manifolds of lower dimension. In this paper, we consider the Cauchy problem for the loaded modified Korteweg-de Vries equation. The problem is solved using the inverse scattering method, i.e. the evolution of the scattering data of a non-self-adjoint Dirac operator is derived, the potential of which is a solution to the loaded modified Korteweg-de Vries equation in the class of rapidly decreasing functions. A specific example is given to illustrate the application of the results obtained.

This paper has been designed to introduce the method for solving the Bi-level Multi-objective (BL-MO) Fully Quadratic Fractional Optimization Model through Fuzzy Goal Programming (FGP) approach by utilising non-linear programming. In Fully Quadratic Fractional Optimization Model, the objective functions are in fractional form, having quadratic functions in both numerator and denominator subject to quadratic constraints set. The motive behind this paper is to provide a solution to solve the BL-MO optimization model in which number of decision-makers (DM) exists at two levels in the hierarchy. First, the fractional functions with fuzzy demand, which are in the form of fuzzy numbers, are converted into crisp models by applying the concept of α-cuts. After that, membership functions are developed which are corresponding to each decision-maker’s objective and converted into simpler form to avoid complications due to calculations. Finally, the model is simplified by applying FGP approach, and a compromised solution to the initial model is obtained. An algorithm, flowchart and example are also given at the end to explain the study of the proposed model.

In this paper, it is derived a rich hierarchy for the Toda lattice with a selfconsistent source in the class of periodic functions. We discuss the complete integrability of the constructed systems that is based on the transformation to the spectral data of an associated discrete Hill‘s equation with periodic coefficients. In particular, Dubrovintype equations are derived for the time-evolution of the spectral data corresponding to the solutions of any system in the hierarchy. At the end of the paper, we illustrate our theory on concrete example with analytical and numerical results.

In this paper, we introduce a new type of a generalized split monotone variational inclusion (GSMVI) problem in the framework of real Hilbert spaces. By incorporating an inertial extrapolation method and an Halpern iterative technique, we establish a strong convergence result for approximating a solution of GSMVI and fixed point problems of certain nonlinear mappings in the framework of real Hilbert spaces. Many existing results are derived as corollaries to our main result. Furthermore, we present a numerical example to support our main result and propose an open problem for interested researchers in this area. The result obtained in this paper improves and generalizes many existing results in the literature.

so-metrizable spaces are a class of important generalized metric spaces between metric spaces and s n sn -metrizable spaces where a space is called an so-metrizable space if it has a σ \sigma -locally finite so-network. As the further work that attaches to the celebrated Alexandrov conjecture, it is interesting to characterize so-metrizable spaces by images of metric spaces. This paper gives such characterizations for so-metrizable spaces. More precisely, this paper introduces so-open mappings and uses the “Pomomarev’s method” to prove that a space X X is an so-metrizable space if and only if it is an so-open, compact-covering, σ \sigma -image of a metric space, if and only if it is an so-open, σ \sigma -image of a metric space. In addition, it is shown that so-open mapping is a simplified form of s n sn -open mapping (resp. 2-sequence-covering mapping if the domain is metrizable). Results of this paper give some new characterizations of so-metrizable spaces and establish some equivalent relations among so-open mapping, s n sn -open mapping and 2-sequence-covering mapping, which further enrich and deepen generalized metric space theory.

Fractal is a common feature of many deterministic complex networks. The complex networks with fractal features have interesting structure and good performance. The network based on hypergraph is named hypernetwork. In this paper, we construct a hypernetwork model with fractal properties, and obtain its topological properties. Moreover, according to the exact controllability theory, we obtain the node controllability and the hyperedge controllability of the fractal hypernetwork. The simulation results show that the measure of hyperedge controllability is smaller than that of node in the fractal hypernetwork. In addition, We compare the controllability of three types of hypernetwork, which are easier to control by their hyperedges. It is shown the fractal hypernetwork constructed in this paper has the best controllability. Because of the good controllability of our fractal hypernetwork model, it is suitable for the topology structure of many real systems.

The mean curvature-based image deblurring model is widely used to enhance the quality of the deblurred images. However, the discretization of the associated Euler-Lagrange equations produce a nonlinear ill-conditioned system which affect the convergence of the numerical algorithms like Krylov subspace methods. To overcome this difficulty, in this paper, we present two new symmetric positive definite (SPD) preconditioners. An efficient algorithm is presented for the mean curvature-based image deblurring problem which combines a fixed point iteration (FPI) with new preconditioned matrices to handle the nonlinearity and ill-conditioned nature of the large system. The eigenvalues analysis is also presented in the paper. Fast convergence has shown in the numerical results by using the proposed new preconditioners.

The main objective of this work is to explore and characterize the idea of $ s $-type preinvex function and related inequalities. Some interesting algebraic properties and logical examples are given to support the newly introduced idea. In addition, we attain the novel version of Hermite-Hadamard type inequality utilizing the introduced preinvexity. Furthermore, we establish two new identities, and employing these, we present some refinements of Hermite-Hadamard-type inequality. Some special cases of the presented results for different preinvex functions are deduced as well. Finally, as applications, some new inequalities for the arithmetic, geometric and harmonic means are established. Results obtained in this paper can be viewed as a significant improvement of previously known results. The awe-inspiring concepts and formidable tools of this paper may invigorate and revitalize for additional research in this worthy and absorbing field.

In this paper we consider an optimal control problem governed by a space-time fractional diffusion equation with non-homogeneous initial conditions. A spectral method is proposed to discretize the problem in both time and space directions. The contribution of the paper is threefold: (1) A discussion and better understanding of the initial conditions for fractional differential equations with Riemann-Liouville and Caputo derivatives are presented. (2) A posteriori error estimates are obtained for both the state and the control approximations. (3) Numerical experiments are performed to verify that the obtained a posteriori error estimates are reliable.

The inverse Frobenius-Perron problem (IFPP) is a collective term for a family of problems that requires the construction of an ergodic dynamical system model with prescribed statistical characteristics. Solutions to this problem draw upon concepts from ergodic theory and are scattered throughout the literature across domains such as physics, engineering, biology and economics. This paper presents a survey of the original formulation of the IFPP, wherein the invariant probability density function of the system state is prescribed. The paper also reviews different strategies for solving this problem and demonstrates several of the techniques using examples. The purpose of this survey is to provide a unified source of information on the original formulation of the IFPP and its solutions, thereby improving accessibility to the associated modeling techniques and promoting their practical application. The paper is concluded by discussing possible avenues for future work.

The quantum calculus has emerged as a connection between mathematics and physics. It has wide applications, particularly in quantum mechanics, analytic number theory, combinatorial analysis, operation theory etc. The $ q $-calculus, which serves as a powerful tool to model quantum computing, has drawn attention of many researchers in the field of special functions and as a result the $ q $-analogues of certain special functions, especially hypergeometric function, 1-variable Hermite polynomials, Appell polynomials etc., are introduced and studied. In this paper, we introduce the 2-variable $ q $-Hermite polynomials by means of generating function. Also, its certain properties like series definition, recurrence relations, $ q $-differential equation and summation formulas are established. The operational definition and some integral representations of these polynomials are obtained. Some examples are also considerd to show the efficacy of the proposed method. Some concluding remarks are given. At the end of this paper, the graphical representations of these polynomials of certain degrees with specified values of $ q $ are given.

The main goal of this paper is to develop the significance of generalized fractional integral inequalities via convex functions. We obtain the new version of fractional integral inequalities with the extended Wright generalized Bessel function acting as a kernel for the convex function, which deals with the Hermite-Hadamard type and trapezoid type inequalities. Moreover, we establish new mid-point type and trapezoid type integral inequalities for $ (\eta_{1}, \eta_{2}) $-convex function related to Hermite-Hadamard type inequality. We establish new version of integral inequality for $ (\eta_{1}, \eta_{2}) $-convex function related to Fejer type. The results discussed in this paper are a generalized version of many inequalities in literature.

Lot sizing models involve operational and tactical decisions. These decisions may entail multi-level production processes such as assembly operations with multiple plants and limited capacities. Lot sizing problems are widely recognized as NP-hard problems therefore difficult to solve, especially the ones with multiple plants and capacity constraints. The level of complexity rises to an even higher level when there is an interplant transfer between the plants. This paper presents a Genetic Algorithm (GA) based solution methodology applied to large scale multi-plant capacitated lot sizing problem with interplant transfer (MPCLSP-IT). Although the GA has been a very effective and widely accepted meta-heuristic approach used to solve large scale complex problems, it has not been employed for MPCLSP-IT problem. This paper solves the MPCLSP-IT problem in large scale instances by using a genetic algorithm, and in doing so successfully obtains a better solution in terms of computation time when compared to the results obtained by the other methods such as Lagrangian relaxation, greedy randomized adaptive search procedure (GRASP) heuristics, and GRASP-path relinking techniques used in extant literature.

The present paper aims to find some new midpoint-type inequalities for twice quantum differentiable convex functions. The consequences derived in this paper are unification and generalization of the comparable consequences in the literature on midpoint inequalities. © 2021 Muhammad Aamir Ali et al., published by De Gruyter. National Natural Science Foundation of China, NSFC: 11301127, 11601485, 11626101, 11701176, 11971241, 61673169 Funding information : The work was supported by the Natural Science Foundation of China (Grant Nos. 61673169, 11301127, 11701176, 11626101, 11601485, 11971241). 2-s2.0-85105011594

In this paper we give Hadamard inequalities for exponentially $ (\alpha, h-m) $-convex functions using Riemann-Liouville fractional integrals for strictly increasing function. Results for Riemann-Liouville fractional integrals of convex, $ m $-convex, $ s $-convex, $ (\alpha, m) $-convex, $ (s, m) $-convex, $ (h-m) $-convex, $ (\alpha, h-m) $-convex, exponentially convex, exponentially $ m $-convex, exponentially $ s $-convex, exponentially $ (s, m) $-convex, exponentially $ (h-m) $-convex, exponentially $ (\alpha, h-m) $-convex functions are particular cases of the results of this paper. The error estimations of these inequalities by using two fractional integral identities are also given.

This paper argues that any economic phenomena should be observed by two different scales, and any economic laws are scale-dependent. A one-scale law arising in either macroeconomics or microeconomics might be mathematically correct and economically relevant, however, sparking debates might arise for a different scale. This paper re-analyzes the basic assumptions of the Evans model for dynamic economics, and it concludes that they are quite reasonable on a large time-scale, but the assumptions become totally invalid on a smaller scale, and a fractal modification has to be adopted. A two-scale price dynamics is suggested and a fractal variational theory is established to maximize the profit at a given period. Furthermore Evans 1924 variational principle for the maximal profit is easy to be solved for a quadratic cost function using the Lagrange multiplier method. Here a quadratic-cubic cost function and a nonlinear demand function are used, and the stationary condition of the variational formulation is derived step by step, and a more complex dynamic system is obtained. The present derivation process can be extended to a more complex cost function and a more complex demand function, and the paper sheds a promising light on mathematics treatment of complex economic problems.

The aim of this paper is to study the solvability of solutions of non-local problems with integral conditions in spatial variables for high-order linear parabolic equations in the classes of regular solutions (which have all the squared derivatives generalized by S. L. Sobolev that are included in the corresponding equation) . Previously, similar problems were studied for high-order parabolic equations, either in the one-dimensional case, or when certain conditions of smallness on the coefficients are met equations. In this paper, we present new results on the solvability of non-local problems with integral spatial variables for high-order parabolic equations a) in the multidimensional case with respect to spatial variables; b) in the absence of smallness conditions. The research method is based on the transition from a problem with non-local integral conditions to a problem with classical homogeneous conditions of the first or second kind on the side boundary for a loaded integro-differential equation. At the end of the paper, some generalizations of the obtained results will be described.

The B-spline curves have been grasped tremendous achievements inside the widely identified field of Computer Aided Geometric Design (CAGD). In CAGD, spline functions have been used for the designing of various objects. In this paper, new Quadratic Trigonometric B-spline (QTBS) functions with two shape parameters are introduced. The proposed QTBS functions inherit the basic properties of classical B-spline and have been proved in this paper. The proposed scheme associated with two shape parameters where the classical B-spline functions do not have. The QTBS has been used for designing of different parts of airplane like winglet, airfoil, turbo-machinery blades and vertical stabilizer. The designed part can be controlled or changed using free parameters. The effect of shape parameters is also expressed.

This paper proposes a simple, accurate and effective empirical formula to determine the number of supporting nodes in a newly-developed method, the localized method of fundamental solutions (LMFS). The LMFS has the merits of meshless, high-accuracy and easy-to-simulation in large-scale problems, but the number of supporting nodes has a certain impact on the accuracy and stability of the scheme. By using the curve fitting technique, this study established a simple formula between the number of supporting nodes and the node spacing. Based on the developed formula, the reasonable number of supporting nodes can be determined according to the node spacing. Numerical experiments confirmed the validity of the proposed methodology. This paper perfected the theory of the LMFS, and provided a quantitative selection strategy of method parameters.

This paper focuses on the finite-time anti-synchronization for a class of delayed master-slave inertial neural networks. By means of using the property of quadratic inequality of one variable and designing the fractional and polynomial controllers of time variable, two sufficient conditions to assure the finite-time anti-synchronization for the master-slave delayed inertial neural networks are established. Our controllers designed related to time variable t and the study method on the finite-time anti-synchronization are different from these in the existing papers.

This paper studies uniform convergence rate of Hermite\,--\,Pad\'eapproximants (simultaneous Pad\'e approximants)$\{\pi^j_{n,\overrightarrow{m}}(z)\}_{j=1}^k$for a system of exponential functions $\{e^{\lambda_jz}\}_{j=1}^k$,where $\{\lambda_j\}_{j=1}^k$ are different nonzerocomplex numbers. In the general case a research of theasymptotic properties of Hermite\,--\,Pad\'e approximants is arather complicated problem. This is due to the fact that in theirstudy mainly asymptotic methods are used, in particular,the saddle-point method. An important phase in the applicationof this method is to find a special saddle contour (the Cauchyintegral theorem allows to choose an integration contour ratherarbitrarily), according to which integration should be carriedout. Moreover, as a rule, one has to repy only on intuition.In this paper, we propose a new method to studying the asymptotic properties of Hermite\,--\,Pad\'eapproximants, that is based on the Taylor theorem and heuristicconsiderations underlying the Laplace and saddle-point methods,as well as on the multidimensional analogue of the Van Rossumidentity that we obtained. The proved theorems complement andgeneralize the known results by other authors.

Venture capital exit strategy is a key condition of realizing venture capital appreciation and circular operation. Based on the equity sale method of venture capital exit, this paper explores strategic choices of venture capitalists and venture entrepreneurs for external investment, and constructs a venture capital exit strategy model with the paradigm of classical game theory and quantum game theory, respectively. A series of experiments demonstrated the proposed method can achieve the unification of Nash equilibrium and Pareto equilibrium. Therefore, this paper expands the basic theoretical support and provide practical support for the choice of venture capital exit strategies.

The motivation of this paper is to study the uniqueness problems of meromorphic functions concerning differential polynomials that share a small function. The results of the paper improve and generalize the recent results due to Fengrong Zhang and Linlin Wu [13]. We also solve an open problem as posed in the last section of [13].

In this paper, we present a new modelling method to create 3D models. First, characteristic cross section curves are generated and approximated by generalized elliptic curves. Then, a vector-valued sixth-order partial differential equation is proposed, and its closed form solution is derived to create PDE surface patches from cross section curves where two adjacent PDE-surface patches are automatically stitched together. With the approach presented in this paper, C2 continuity between adjacent surface patches is well-maintained. Since surface creation of the model is transformed into the generation of cross sectional curves and few undetermined constants are required to describe cross sectional curves accurately, the proposed approach can save manual operations, reduce information storage, and generate 3D models quickly. This research is supported by the PDE-GIR project, which has received funding from the European Union Horizon 2020 Research and Innovation Programme under the Marie SkodowskaCurie grant agreement No 778035. Andres Iglesias also thanks the project TIN2017-89275-R funded by MCIN/AEI/10.13039/501100011033/FEDER “Una manera de hacer Europa”.

This paper studies the solution procedure of a bus transit system with a rectangular service area that had been cited more than two hundred times. We will point out that they applied relations suitable for continuous variables, which are not held for a discrete variable and will result in invalid results. We provide our solution procedure to the same example proposed by the original paper to illustrate that their results are less accurate. Our findings will help researchers understand this kind of bus transit system.

In this paper, the Painlevé integrable property of the (1 + 1)-dimensional generalized Broer–Kaup (gBK) equations is first proven. Then, the Bäcklund transformations for the gBK equations are derived by using the Painlevé truncation. Based on a special case of the derived Bäcklund transformations, the gBK equations are linearized into the heat conduction equation. Inspired by the derived Bäcklund transformations, the gBK equations are reduced into the Burgers equation. Starting from the linear heat conduction equation, two forms of N-soliton solutions and rational solutions with a singularity condition of the gBK equations are constructed. In addition, the rational solutions with two singularity conditions of the gBK equation are obtained by considering the non-uniqueness and generality of a resonance function embedded into the Painlevé test. In order to understand the nonlinear dynamic evolution dominated by the gBK equations, some of the obtained exact solutions, including one-soliton solutions, two-soliton solutions, three-soliton solutions, and two pairs of rational solutions, are shown by three-dimensional images. This paper shows that when the Painlevé test deals with the coupled nonlinear equations, the highest negative power of the coupled variables should be comprehensively considered in the leading term analysis rather than the formal balance between the highest-order derivative term and the highest-order nonlinear term.

The video images captured at long range usually have low contrast floating objects of interest on a sea surface. A comparative experimental study of the statistical characteristics of reflections from floating objects and from the agitated sea surface showed the difference in the correlation and spectral characteristics of these reflections. The functioning of the recently proposed modified matched subspace detector (MMSD) is based on the separation of the observed data spectrum on two subspaces: relatively low and relatively high frequencies. In the literature the MMSD performance has been evaluated in generally and moreover using only a sea model (additive Gaussian background clutter). This paper extends the performance evaluating methodology for low contrast object detection and moreover using only the real sea dataset. This methodology assumes an object of low contrast if the mean and variance of the object and the surrounding background are the same. The paper assumes that the energy spectrum of the object and the sea are different. The paper investigates a scenario in which an artificially created model of a floating object with specified statistical parameters is placed on the surface of a real sea image. The paper compares the efficiency of the classical Matched Subspace Detector (MSD) and MMSD for detecting low-contrast objects on the sea surface. The article analyzes the dependence of the detection probability at a fixed false alarm probability on the difference between the statistical means and variances of a floating object and the surrounding sea.

The Coronavirus herd immunity optimizer (CHIO) is a new human-based optimization algorithm that imitates the herd immunity strategy to eliminate of the COVID-19 disease. In this paper, the coronavirus herd immunity optimizer (CHIO) is modified to tackle a discrete power scheduling problem in a smart home (PSPSH). PSPSH is a combinatorial optimization problem with NP-hard features. It is a highly constrained discrete scheduling problem concerned with assigning the operation time for smart home appliances based on a dynamic pricing scheme(s) and several other constraints. The primary objective when solving PSPSH is to maintain the stability of the power system by reducing the ratio between average and highest power demand (peak-to-average ratio (PAR)) and reducing electricity bill (EB) with considering the comfort level of users (UC). This paper modifies and adapts the CHIO algorithm to deal with such discrete optimization problems, particularly PSPSH. The adaptation and modification include embedding PSPSH problem-specific operators to CHIO operations to meet the discrete search space requirements. PSPSH is modeled as a multi-objective problem considering all objectives, including PAR, EB, and UC. The proposed method is examined using a dataset that contains 36 home appliances and seven consumption scenarios. The main CHIO parameters are tuned to find their best values. These best values are used to evaluate the proposed method by comparing its results with comparative five metaheuristic algorithms. The proposed method shows encouraging results and almost obtains the best results in all consumption scenarios.

This paper proposes a modification of the imperialist competitive algorithm to solve multi-objective optimization problems with hybrid methods (MOHMICA) based on a modification of the imperialist competitive algorithm with hybrid methods (HMICA). The rationale for this is that there is an obvious disadvantage of HMICA in that it can only solve single-objective optimization problems but cannot solve multi-objective optimization problems. In order to adapt to the characteristics of multi-objective optimization problems, this paper improves the establishment of the initial empires and colony allocation mechanism and empire competition in HMICA, and introduces an external archiving strategy. A total of 12 benchmark functions are calculated, including 10 bi-objective and 2 tri-objective benchmarks. Four metrics are used to verify the quality of MOHMICA. Then, a new comprehensive evaluation method is proposed, called “radar map method”, which could comprehensively evaluate the convergence and distribution performance of multi-objective optimization algorithm. It can be seen from the four coordinate axes of the radar maps that this is a symmetrical evaluation method. For this evaluation method, the larger the radar map area is, the better the calculation result of the algorithm. Using this new evaluation method, the algorithm proposed in this paper is compared with seven other high-quality algorithms. The radar map area of MOHMICA is at least 14.06% larger than that of other algorithms. Therefore, it is proven that MOHMICA has advantages as a whole.

In this paper we propose an approximation method for solving second kind Volterra integral equation systems by radial basis functions. It is based on the minimization of a suitable functional in a discrete space generated by compactly supported radial basis functions of Wendland type. We prove two convergence results, and we highlight this because most recent published papers in the literature do not include any. We present some numerical examples in order to show and justify the validity of the proposed method. Our proposed technique gives an acceptable accuracy with small use of the data, resulting also in a low computational cost.

Techniques and methods of linear optimization underwent a significant improvement in the 20th century which led to the development of reliable mixed integer linear programming (MILP) solvers. It would be useful if these solvers could handle mixed integer nonlinear programming (MINLP) problems. Piecewise linear approximation (PLA) is one of most popular methods used to transform nonlinear problems into linear ones. This paper will introduce PLA with brief a background and literature review, followed by describing our contribution before presenting the results of computational experiments and our findings. The goals of this paper are (a) improving PLA models by using nonuniform domain partitioning, and (b) proposing an idea of applying PLA partially on MINLP problems, making them easier to handle. The computational experiments were done using quadratically constrained quadratic programming (QCQP) and MIQCQP and they showed that problems under PLA with nonuniform partition resulted in more accurate solutions and required less time compared to PLA with uniform partition.

Botnet is an urgent problem that will reduce the security and availability of the network. When the bot master launches attacks to certain victims, the infected users are awakened, and attacks start according to the commands from the bot master. Via Botnet, DDoS is an attack whose purpose is to paralyze the victim’s service. In all kinds of DDoS, SYN flood is still a problem that reduces security and availability. To enhance the security of the Internet, IDS is proposed to detect attacks and protect the server. In this paper, the concept of centroid-based classification is used to enhance performance of the framework. An anomaly-based IDS framework which combines K-means and KNN is proposed to detect SYN flood. Dimension reduction is designed to achieve visualization, and weights can adjust the occupancy ratio of each sub-feature. Therefore, this framework is also suitable for use on the modern symmetry or asymmetry architecture of information systems. With the detection by the framework proposed in this paper, the detection rate is 96.8 percent, the accuracy rate is 97.3 percent, and the false alarm rate is 1.37 percent.

Social networking sites (SNSs) are used widely, raising new issues in terms of privacy and disclosure. Although users are often concerned about their privacy, they often publish information on social networking sites willingly. Due to the growing number of users of social networking sites, substantial research has been conducted in recent years. In this paper, we conducted a systematic review of papers that included structural equations models (SEM), or other statistical models with privacy and disclosure constructs. A total of 98 such papers were found and included in the analysis. In this paper, we evaluated the presentation of results of the models containing privacy and disclosure constructs. We carried out an analysis of which background theories are used in such studies and have also found that the studies have not been carried out worldwide. Extending the research to other countries could help with better user awareness of the privacy and self-disclosure of users on SNSs.