Search

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.

A classical result of K. L. Chung and W. Feller deals with the partial sums S k S_k arising in a fair coin-tossing game. If N n N_n is the number of “positive” terms among S 1 S_1 , S 2 S_2 , …, S n S_n then the quantity P ( N 2 n = 2 r ) P(N_{2n} = 2r) takes an elegant form. We lift the restriction on an even number of tosses and give a simple expression for P ( N 2 n + 1 = r ) P(N_{2n+1} = r) , r = 0 r = 0 , 1 1 , 2 2 , …, 2 n + 1 2n+1 . We get to this ansatz by adaptating the Feynman–Kac methodology.

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.

In this paper, we first generalize to any hyper-Kahler manifold X with $$b_3(X)\not =0$$ results proved by O’Grady for hyper-Kahler manifolds of generalized Kummer type. In the second part, we restrict to hyper-Kahler manifolds of generalized Kummer type and prove, using results of Markman, that their Kuga–Satake correspondence is algebraic.

Rewinding machines are used in the paper converting industrial sector to unroll paper veils from large source reels and wind them around smaller rolls, for the production of paper logs to be used in household activities. Many different types of rewinding machine exist, and they are mostly based on stapling devices which automatically unroll a large coil of paper, roll it up around a new log, stop the veil allowing it to be torn off, unload the completed paper log, and reload a new paper core to be rolled up. Winding units generally include a primary and a secondary roller, supplying the desired rotational speed for winding, and a pressure unit consisting of a pressure roller in contact with the paper log being rolled up, which assures adequate containment and avoids the paper log to escape. All known systems have some mechanical limitations, mainly due to the contact of the pressure roller with the paper log, causing instabilities and vibrations, particularly when working with soft paper veils. This limits the maximum possible winding speed. The aim of this paper is it to present a detailed kinematic analysis of a novel pressure unit which overcomes the aforementioned limitation.

Erratum to the paper [Konovalov, Alexander; Smoktunowicz, Agata; Vendramin, Leandro. On skew braces and their ideals. Exp. Math. 30 (2021), no. 1, 95–104. DOI: 10.1080/10586458.2018.1492476.].

The deadly coronavirus disease 2019 (COVID-19) has recently affected each corner of the world. Many governments of different countries have imposed strict measures in order to reduce the severity of the infection. In this present paper, we will study a mathematical model describing COVID-19 dynamics taking into account the government action and the individuals reaction. To this end, we will suggest a system of seven fractional deferential equations (FDEs) that describe the interaction between the classical susceptible, exposed, infectious, and removed (SEIR) individuals along with the government action and individual reaction involvement. Both human-to-human and zoonotic transmissions are considered in the model. The well-posedness of the FDEs model is established in terms of existence, positivity, and boundedness. The basic reproduction number (BRN) is found via the new generation matrix method. Different numerical simulations were carried out by taking into account real reported data from Wuhan, China. It was shown that the governmental action and the individuals' risk awareness reduce effectively the infection spread. Moreover, it was established that with the fractional derivative, the infection converges more quickly to its steady state.

We consider the problem of optimal partisan gerrymandering: a legislator in charge of redrawing the boundaries of equal-sized congressional districts wants to ensure the best electoral outcome for his own party. The so-called gerrymanderer faces two issues: the number of districts is finite and there is uncertainty at the level of each district. Solutions to this problem consists in cracking favorable voters in as many districts as possible to get tight majorities, and in packing unfavorable voters in the remaining districts. The optimal payoff of the gerrymanderer tends to increase as the uncertainty decreases and the number of districts is large. With an infinite number of districts, this problem boils down to concavifying a function, similarly to the optimal Bayesian persuasion problem. We introduce a measure of fairness and show that optimal gerrymandering is accordingly closer to uniform districting (full cracking), which is most unfair, than to community districting (full packing), which is very fair.

We formulate a simple susceptible‐infectious‐recovery (SIR) model to describe the spread of the coronavirus under strict social restrictions. The transmission rate in this model is exponentially decreasing with time. We find a formula for basic reproduction function and estimate the maximum number of daily infected individuals. We fit the model to induced death data in Italy, United States, Germany, France, India, Spain, and China over the period from the first reported death to August 7, 2020. We notice that the model has excellent fit to the disease death data in these countries. We estimate the model's parameters in each of these countries with 95% confidence intervals. We order the strength of social restrictions in these countries using the exponential rate. We estimate the time needed to reduce the basic reproduction function to one unit and use it to order the quality of social restrictions in these countries. The social restriction in China was the strictest and the most effective and in India was the weakest and the least effective. Policy‐makers may apply the Chinese successful social restriction experiment and avoid the Indian unsuccessful one. [ FROM AUTHOR] Copyright of Mathematical Methods in the Applied Sciences is the property of John Wiley & Sons, Inc. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full . (Copyright applies to all s.)

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.

In the current article, we aim to study in detail a novel coronavirus (2019-nCoV or COVID-19) mathematical model for different aspects under Caputo fractional derivative. First, from analysis point of view, existence is necessary to be investigated for any applied problem. Therefore, we used fixed point theorem's due to Banach's and Schaefer's to establish some sufficient results regarding existence and uniqueness of the solution to the proposed model. On the other hand, stability is important in respect of approximate solution, so we have developed condition sufficient for the stability of Ulam-Hyers and their different types for the considered system. In addition, the model has also been considered for semianalytical solution via Laplace Adomian decomposition method (LADM). On Matlab, by taking some real data about Pakistan, we graph the obtained results. In the last of the manuscript, a detail discussion and brief conclusion are provided.

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.

COVID-19 pandemic has affected all aspects of people's lives and disrupted the economy. Forecasting the number of cases infected with this virus can help authorities make accurate decisions on the interventions that must be implemented to control the pandemic. Investigation of the studies on COVID-19 forecasting indicates that various techniques such as statistical, mathematical, and machine and deep learning have been utilized. Although deep learning models have shown promising results in this context, their performance can be improved using auxiliary features. Therefore, in this study, we propose two hybrid deep learning methods that utilize the statistical features as auxiliary inputs and associate them with their main input. Specifically, we design a hybrid method of the multihead attention mechanism and the statistical features (ATT_FE) and a combined method of convolutional neural network and the statistical features (CNN_FE) and apply them to COVID-19 data of 10 countries with the highest number of confirmed cases. The results of experiments indicate that the hybrid models outperform their conventional counterparts in terms of performance measures. The experiments also demonstrate the superiority of the hybrid ATT_FE method over the long short-term memory model.

In this work, the effect of wheat flour and water replacement by pequi pulp and flour on the bread development and preparation enriched with this fruit was studied. Two experimental designs were used for two independent variables, the first evaluating the wheat flour partial replacement by pequi husk flour (x1) and pequi pulp flour (x2). The second design evaluated the wheat flour and water partial replacement by pequi husk flour (x1) and pequi pulp (x2), respectively. At the same time, a control test was conducted (without the addition of pequi flour and pulp) for comparison. The evaluated dependent variables of the bread quality characteristics were: dough volume; expansion rate; specific volume and density; texture profile and gluten content. It was possible to verify that only the gluten content was influenced by the replacement of wheat flour by pequi husk flour, whereas, only the specific volume was influenced by the replacement of water by pequi pulp. In general, the best replacement range was obtained with the formulation using between 0.75 to 2.5% pequi husk flour; up to 20% pequi pulp flour and between 5 and 35% of pequi pulp. In this work, the effect of wheat flour and water replacement by pequi pulp and flour on the bread development and preparation enriched with this fruit was studied. Two experimental designs were used for two independent variables, the first evaluating the wheat flour partial replacement by pequi husk flour (x1) and pequi pulp flour (x2). The second design evaluated the wheat flour and water partial replacement by pequi husk flour (x1) and pequi pulp (x2), respectively. At the same time, a control test was conducted (without the addition of pequi flour and pulp) for comparison. The evaluated dependent variables of the bread quality characteristics were: dough volume; expansion rate; specific volume and density; texture profile and gluten content. It was possible to verify that only the gluten content was influenced by the replacement of wheat flour by pequi husk flour, whereas, only the specific volume was influenced by the replacement of water by pequi pulp. In general, the best replacement range was obtained with the formulation using between 0.75 to 2.5% pequi husk flour; up to 20% pequi pulp flour and between 5 and 35% of pequi pulp.

Resident combustion of solid fuel has been widely acknowledged as a high potential for pollutant reduction. However, there is a marked asymmetry between more pollutant emission and less burned volatiles of biomass and coal in the combustion process. To study the solid fuel optimum combustion form in a household stove, both the pollution reduction and energy efficient utilization of crop straws and coals were investigated. Taking the molding pressure and clay addition ratio as variable process conditions, the research of bio-coal briquette (made from the mixture of anthracite and biomass) was implemented in the range of 15~35 MP and 5~15%, respectively. Biomass and coal work complementarily for each other’s combustion property development. In particular, the pyrolysis gas produced by biomass low-temperature devolatilization is featured with low ignition point and is distributed in the bio-coal briquette. Its own combustion provides energy for anthracite particle combustion. Consequently, a positive effect was identified when bio-coal briquettes were used as residential fuel, and further improvement manifested in reducing more than 90% of particle matter (PM) and achieving about twice the thermal efficiencies (TEs) compared with the mass-weighted average values of coal briquettes and biomass briquettes. 88.8 ± 11.8%, 136.7 ± 13.7% and 81.4 ± 17.7% more TEs were provided by wheat straw–coal briquettes, rice straw–coal briquettes and maize straw–coal briquettes. 93.3 ± 3.1% (wheat straw–coal), 97.6 ± 0.2% (rice straw–coal) and 90.4 ± 2.2% (maize straw–coal) in terms of PM2.5 emission factors (EFs) was reduced. For bio-coal briquette, a 25 MPa and 10% addition were determined as the optimum molding pressure and clay addition ratio. Bio-coal briquettes with higher TEs and lower PM EFs will bring about substantial benefits for air quality promotion, human health and energy saving.

This study provides a systematic literature review of research in the field of teaching and learning mathematics through Content and Language Integrated Learning (CLIL), Content-Based Instruction (CBI), and English Medium Instruction (EMI). The review aims to examine the most relevant literature with a focus on mathematics and CLIL, CBI, or EMI in Scopus and Web of Science per the Preferred Reporting Items for Systematic Reviews (PRISMA) guidelines. Based on 151 sources, 52 papers were selected according to predefined selection criteria. The papers were analysed and coded according to the following categories: (1) geographical productivity, (2) diachronic productivity growth, (3) main objectives, (4) methodology, and research design, (5) variables and measurement instruments, (6) context and sample details, and (7) main findings. The results reveal that most of the research analysed has been carried out in the Asian continent, followed by Europe. The analysis of diachronic productivity shows that the study of the application of CLIL, CBI, and EMI programs in the teaching-learning process of mathematics has notably increased in recent years, especially in the last triennium (2020–2022). Regarding the objectives of the selected corpus, the majority aimed at teaching practices and learning processes, and outcomes in mathematics and language proficiency in CLIL, CBI, and/or EMI classrooms. The corpus analysed fits within one or more of the following categories: empirical, qualitative, descriptive, correlational, and cross-sectional. The samples utilized in different studies differ significantly, both in terms of quantity –ranging from one person to 700– and in the educational level being studied, which would be primary, secondary, or tertiary education. The main variables studied in the corpus focus on mathematical competence, language proficiency, teaching practices, teacher training, science competence, and teachers’ perceptions. The most widely used instruments have been objective tests, such as questionnaires, together with standardized tests to measure some aspects related to mathematical competence and language proficiency. They are followed by an analysis of documents (academic records, teaching materials, official documents...), participant or non-participant observation, interviews, and video and audio recordings. In summary, in the scientific literature analysed, a positive or neutral view predominates on the effects of the CLIL, CBI, and EMI approaches on the learning of mathematics and the L2. This can be due to methodological issues fundamentally related to the methodology, research design, sample, and measurement instruments. Thus, we must highlight that some of the results from the selected papers must be interpreted with caution. Taking this factor into consideration, further comparative studies on a wider scale are required to examine thoroughly the effects of CLIL, CBI, and EMI on the teaching and learning of mathematics in an L2. Besides, it is important to study in greater depth the different levels of language acquisition since the research analysed shows that these have not been sufficiently addressed in the mathematical field of knowledge.

This paper is devoted to the study of the qualitative properties of solutions to boundary-value problems for strongly elliptic differential-difference equations. Some results for these equations such as existence and smoothness of generalized solutions in certain subdomains of Q were obtained earlier. Nevertheless, the smoothness of generalized solutions of such problems can be violated near the boundary of these subdomains even for infinitely differentiable right-hand side. The subdomains are defined as connected components of the set that is obtained from the domain Q by throwing out all possible shifts of the boundary Q by vectors of a certain group generated by shifts occurring in the difference operators. For the one dimensional Neumann problem for differential-difference equations there were obtained conditions on the coefficients of difference operators, under which for any continuous right-hand side there is a classical solution of the problem that coincides with the generalized solution. 2 Also there was obtained the smoothness (in Sobolev spaces W k ) of generalized solutions of the second and the third boundary-value problems for strongly elliptic differential-difference equations in subdomains excluding -neighborhoods of certain points. However, the smoothness (in Ho lder spaces) of generalized solutions of the second boundary-value problem for strongly elliptic differential-difference equations on the boundary of adjacent subdomains was not considered. In this paper, we study this question in Ho lder spaces. We establish necessary and sufficient conditions for the coefficients of difference operators that guarantee smoothness of the generalized solution on the boundary of adjacent subdomains for any right-hand side from the Ho lder space.

The converse of the Borel–Cantelli Lemma states that if { A i } i = 1 ∞ is a sequence of independent events such that ∑ P ( A i ) = ∞ , then almost surely infinitely many of these events will occur. Erdős and Renyi proved that it is sufficient to weaken the condition of independence to pairwise independence. Later, several other weakenings of the condition appeared in the literature. The aim of this paper is to provide a collection of conditions, all of which imply that almost surely infinitely many of the events occur, and determine the complete implicational relationship between them. Many of these results are known, or follow from known results, however, they are not widely known among non-specialists. Yet, the results can be extremely useful for areas outside of probability theory, as evidenced by the original motivation of this paper emerging from infinite combinatorics. Our proofs are aimed to be accessible to a general mathematical audience.

Part of the work was done while the authors were visiting the South China University of Science and Technology (SUSTech), Shenzhen, in 2018, and we are grateful (in particular to Professor Cai Heng Li) for the hospitality that we received.The authors would like to thank the Isaac Newton Institute for Mathematical Sciences, Cambridge, for support and hospitality during the programme Groups, representations and applications: new perspectives (supported by EPSRC grant no.EP/R014604/1), where further work on this paper was undertaken. In particular we acknowledge a Simons Fellowship (Cameron) and a Kirk Distinguished Visiting Fellowship (Praeger) during this programme. Schneider thanks the Centre for the Mathematics of Symmetry and Computation of The University of Western Australia and Australian Research Council Discovery Grant DP160102323 for hosting his visit in 2017 and acknowledges the support of the CNPq projects Produtividade em Pesquisa (project no.: 308212/2019-3) and Universal (project no.:421624/2018-3). Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial structures such as affine spaces or Cartesian decompositions, but such structures for diagonal groups have not been studied in general. The main purpose of this paper is to describe and characterise such structures, which we call diagonal semilattices. Unlike the diagonal groups in the O'Nan-Scott theorem, which are defined over finite characteristically simple groups, our construction works over arbitrary groups, finite or infinite. A diagonal semilattice depends on a dimension m and a group T. For m=2, it is a Latin square, the Cayley table of T, though in fact any Latin square satisfies our combinatorial axioms. However, for m≥3, the group T emerges naturally and uniquely from the axioms. (The situation somewhat resembles projective geometry, where projective planes exist in great profusion but higher-dimensional structures are coordinatised by an algebraic object, a division ring.) A diagonal semilattice is contained in the partition lattice on a set Ω, and we provide an introduction to the calculus of partitions. Many of the concepts and constructions come from experimental design in statistics. We also determine when a diagonal group can be primitive, or quasiprimitive (these conditions turn out to be equivalent for diagonal groups). Associated with the diagonal semilattice is a graph, the diagonal graph, which has the same automorphism group as the diagonal semilattice except in four small cases with m

Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates. We go outside Boolean realm and consider circuits built of any fixed set of gates on an arbitrary large finite domain. From the complexity point of view this is strictly connected with the problems of solving equations (or systems of equations) over finite algebras. The research reported in this work was motivated by a desire to know for which finite algebras $\mathbf A$ there is a polynomial time algorithm that decides if an equation over $\mathbf A$ has a solution. We are also looking for polynomial time algorithms that decide if two circuits over a finite algebra compute the same function. Although we have not managed to solve these problems in the most general setting we have obtained such a characterization for a very broad class of algebras from congruence modular varieties. This class includes most known and well-studied algebras such as groups, rings, modules (and their generalizations like quasigroups, loops, near-rings, nonassociative rings, Lie algebras), lattices (and their extensions like Boolean algebras, Heyting algebras or other algebras connected with multi-valued logics including MV-algebras). This paper seems to be the first systematic study of the computational complexity of satisfiability of non-Boolean circuits and solving equations over finite algebras. The characterization results provided by the paper is given in terms of nice structural properties of algebras for which the problems are solvable in polynomial time., 50 pages

In the paper (Hill, 1973) from 1973 R.D. Hill studied linear matrix maps L : ℂ q × q → ℂ n × n which map Hermitian matrices to Hermitian matrices, or equivalently, preserve adjoints, i.e., L ( V ∗ ) = L ( V ) ∗ , via representations of the form L ( V ) = ∑ k , l = 1 m H k l A l V A k ∗ , V ∈ ℂ q × q , for matrices A 1 , … , A m ∈ ℂ n × q and continued his study of such representations in later work, sometimes with co-authors, to completely positive matrix maps and associated matrix reorderings. In this paper we expand the study of such representations, referred to as Hill representations here, in various directions. In particular, we describe which matrices A 1 , … , A m can appear in Hill representations (provided the number m is minimal) and determine the associated Hill matrix H = H k l explicitly. Also, we describe how different Hill representations of L (again with m minimal) are related and investigate further the implication of ∗ -linearity on the linear map L .

In a previous paper, we obtained several "compact versions" of Rubio de Francia's weighted extrapolation theorem, which allowed us to extrapolate the compactness of linear operators from just one space to the full range of weighted Lebesgue spaces, where these operators are bounded. In this paper, we study the extrapolation of compactness for bilinear operators in terms of bilinear Muckenhoupt weights. As applications, we easily recover and improve earlier results on the weighted compactness of commutators of bilinear Calder\'{o}n-Zygmund operators, bilinear fractional integrals and bilinear Fourier multipliers. More general versions of these results are recently due to Cao, Olivo and Yabuta (arXiv:2011.13191), whose approach depends on developing weighted versions of the Fr\'echet--Kolmogorov criterion of compactness, whereas we avoid this by relying on "softer" tools, which might have an independent interest in view of further extensions of the method., Comment: v3: final version, incorporated referee comments, to appear in Indagationes Mathematicae, 27 pages

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.

In this paper, we consider the propagation of waves in an open waveguide in ℝ$^{2}$ where the index of refraction is a local perturbation of a function which is periodic along the axis of the waveguide (which we choose to be the x$_{1}$ axis) and equal to one for |x$_{2}$| > h$_{0}$ for some h$_{0}$ > 0. Motivated by the limiting absorption principle (proven in an earlier paper by the author), we formulate a radiation condition which allows the existence of propagating modes and prove uniqueness, existence, and stability of a solution under the assumption that no bound states exist. In the second part, we determine the order of decay of the radiating part of the solution in the direction of the layer and in the direction orthogonal to it. Finally, we show that it satisfies the classical Sommerfeld radiation condition and allows the definition of a far field pattern.

The paper is devoted to the study of Gromov-Hausdorff convergence and stability of irreversible metric-measure spaces, both in the compact and noncompact cases. While the compact setting is mostly similar to the reversible case developed by J. Lott, K.-T. Sturm and C. Villani, the noncompact case provides various surprising phenomena. Since the reversibility of noncompact irreversible spaces might be infinite, it is motivated to introduce a suitable nondecreasing function that bounds the reversibility of larger and larger balls. By this approach, we are able to prove satisfactory convergence/stability results in a suitable – reversibility depending – Gromov-Hausdorff topology. A wide class of irreversible spaces is provided by Finsler manifolds, which serve to construct various model examples by pointing out genuine differences between the reversible and irreversible settings. We conclude the paper by proving various geometric and functional inequalities (as Brunn-Minkowski, Bishop-Gromov, log-Sobolev and Lichnerowicz inequalities) on irreversible structures.

The designed load of most quasi-zero stiffness (QZS) isolators is constant. The isolation performance will drop sharply once the load changes. A novel QZS isolator that can adapt to variable loads is proposed in this paper to improve the range of application of the isolator. The isolator is designed by paralleling the electromagnetic spring (ES), which provides negative stiffness, and the pneumatic spring (PS), which provides positive stiffness. The positive and negative stiffness can be adjusted by changing the pressure and coil current, which provides the possibility for the isolator to adapt to variable loads. This paper derived the conditions for the isolation system to obtain QZS characteristics, proposed the dynamic model of the isolation system, derived and verified the analytical expressions of the amplitude-frequency response and force transmissibility (FT), and discussed the change of FT and displacement transmissibility(DT) under different loads. Theoretical analysis shows that changing the pressure and coil current in the same proportion can maintain the superior low-frequency isolation performance when the load changes, thanks to the preservation of the QZS characteristics of the system after adjusting the pressure and coil current. Finally, the simulation results fg and isolation frequency band over the linear isolation system and PS isolation system. Furthermore, the proposed isolator can be adjusted online.

With the development of computer operation technology and algorithms, the lumped dynamic model is more practical, and the development and application are more comprehensive. Among them, the direct coal liquefaction residual oil pyrolysis and coking technology, as a coal-to-liquid process, can increase the oil yield of the coal liquefaction process and reduce environmental pollution. The purpose of this paper is to study the experiment and algorithm of coal direct liquefaction residual oil pyrolysis and coking technology based on lumped kinetic engineering. Starting from the lumped kinetic engineering, this paper takes the direct coal liquefaction residual oil pyrolysis and coking technology as the research object. Based on the experiment of small- and medium-sized equipment, the residual oil pyrolysis and coking experiment is carried out. This paper further analyzes the components of the experimental products and explores the factors that affect the yield of residual pyrolysis oil based on the five lumped kinetic model of coking. Experimental data shows that when the pyrolysis temperature is 450°C, the content of liquefied heavy oil HS in the pyrolysis oil is 47.87%, the content of asphaltene A is 44.28%, and the content of preasphaltene PA is 7.85%; the pyrolysis temperature is 500 °C. At this time, the content of liquefied heavy oil HS in the pyrolysis oil is 54.97%, the content of asphaltene A is 40.23%, and the content of preasphaltene PA is 4.8%. It can be seen that, with the increase of pyrolysis temperature, the content of liquefied heavy oil HS increases, and the content of asphaltene A and preasphaltene PA decreases.

In this paper, we consider a natural convection flow of an incompressible viscous fluid subject to Newtonian heating and constant mass diffusion. The proposed model has been described by the Caputo fractional operator. The used derivative is compatible with physical initial and boundaries conditions. The exact analytical solutions of the proposed model have been provided using the Laplace transform method. The obtained solutions are expressed using some special functions as the Gaussian error function, Mittag–Leffler function, Wright function, and G -function. The influences of the order of the fractional operator, parameters used in modeling the considered fluid, Nusselt number, and Sherwood number have been analyzed and discussed. The physical interpretations of the influences of the parameters of our fluid model have been presented and analyzed as well. We use the graphical representations of the exact solutions of the model to support the findings of the paper.

Game theory has become an important tool to study the competition between oligopolistic enterprises. After combing the existing literature, it is found that there is no research combining two-stage game and nonlinear dynamics to analyze the competition between enterprises for advertising. Therefore, this paper establishes a two-stage game model to discuss the effect of the degree of firms’ advertising input on their profits. And the complexity of the system is analyzed using nonlinear dynamics. This paper analyzes and studies the dynamic game for two types of application network models: data transmission model and transportation network model. Under the time-gap ALOHA protocol, the noncooperative behavior of the insiders in the dynamic data transmission stochastic game is examined as well as the cooperative behavior. In this paper, the existence of Nash equilibrium and its solution algorithm are proved in the noncooperative case, and the “subgame consistency” of the cooperative solution (Shapley value) is discussed in the cooperative case, and the cooperative solution satisfying the subgame consistency is obtained by constructing the “allocation compensation procedure.” The cooperative solution is obtained by constructing the “allocation compensation procedure” to satisfy the subgame consistency. In this paper, we propose to classify the packets transmitted by the source nodes, and by changing the strategy of the source nodes at the states with different kinds of packets, we find that the equilibrium payment of the insider increases in the noncooperative game with the addition of the “wait” strategy. In the transportation dynamic network model, the problem of passenger flow distribution and the selection of service parameters of transportation companies are also studied, and a two-stage game theoretical model is proposed to solve the equilibrium price and optimal parameters under Wardrop’s criterion.

In economic growth, the gradual increase in the effect of information technology makes the enterprise economic information management increasingly important for the survival and development of the enterprises. This paper designs an enterprise economic information management system for the complex internal economic information management business and process of enterprises. It provides daily office, information access, document preview, and transmission. The proposed design (i) copes with the inconsistency and irregularity of enterprise economic information data, (ii) quickly obtains valuable information from these massive high-frequency data, and (iii) improves the economic benefits of data assets and data management efficiency. The printing function systematizes the information management for departments such as enterprise economic information, personnel, and production. The main focus of this research includes the mode, framework, and function of the whole system software. Moreover, it also comprises of the use of Internet platform big data technology to realize the practicality, stability, and security of the system database algorithm, which has been practically used by enterprises to improve office efficiency and meet the needs of daily management of enterprises. Based on the analysis of the current status of enterprise big data application, this paper constructs an enterprise economic informational management system based on big data and also describes in detail the key technologies of enterprise economic informational data management from three aspects: NoSQL-based big data storage management, Hadoop-based economic informational big data informational and economic informational big data analysis, and mining algorithm. Provide theoretical basis and basic technical support for online decision analysis.

It is well known that the appearance of the delay in the fractional delay differential equation (FDDE) makes the convergence analysis very difficult. Dealing with the problem with the traditional reproducing kernel method (RKM) is very tricky. The feature of this paper is to gain a more credible approximate solution via fractional Taylor’s series (FTS). We use the FTS to deal with the delay for improving the accuracy of the approximate solutions. Compared with other methods, the five numerical examples demonstrate the accuracy and efficiency of the proposed method in this paper.

In this paper, we investigate a nonlinear generalized fractional differential equation with two-point and integral boundary conditions in the frame of $ \kappa $-Hilfer fractional derivative. The existence and uniqueness results are obtained using Krasnoselskii and Banach's fixed point theorems. We analyze different types of stability results of the proposed problem by using some mathematical methodologies. At the end of the paper, we present a numerical example to demonstrate and validate our findings.

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.

This paper discusses the study of asymptotic behavior of non-oscillatory solutions for high order differential equations of Poincaré type. We present two new and weaker hypotheses on the coefficients, which implies a well posedness result and a characterization of asymptotic behavior for the solution of the Poincaré equation. In our discussion, we use the scalar method: we define a change of variable to reduce the order of the Poincaré equation and thus demonstrate that a new variable can satisfies a nonlinear differential equation; we apply the method of variation of parameters and the Banach fixed-point theorem to obtain the well posedness and asymptotic behavior of the non-linear equation; and we establish the existence of a fundamental system of solutions and formulas for the asymptotic behavior of the Poincaré type equation by rewriting the results in terms of the original variable. Moreover we present an example to show that the results introduced in this paper can be used in class of functions where classical theorems fail to be applied.

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.

The inconsistent or consistent general fuzzy matrix equation are studied in this paper. The aim of this paper is threefold. Firstly, general strong fuzzy matrix solutions of consistent general fuzzy matrix equation are derived, and an algorithm for obtaining general strong fuzzy solutions of general fuzzy matrix equation by Core-EP inverse is also established. Secondly, if inconsistent or consistent general fuzzy matrix equation satisfies $ X\in R(S^{k}) $, the unique solution or unique least squares solution of consistent or inconsistent general fuzzy matrix equation are given by Core-EP inverse. Thirdly, we present an algorithm for obtaining Core-EP inverse. Finally, we present some examples to illustrate the main results.

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.

The Mackey–Zimmer theorem classifies ergodic group extensions X of a measure-preserving system Y by a compact group K, by showing that such extensions are isomorphic to a group skew-product X?Y??H for some closed subgroup H of K. An analogous theorem is also available for ergodic homogeneous extensions X of Y, namely that they are isomorphic to a homogeneous skew-product Y??H/M. These theorems have many uses in ergodic theory, for instance playing a key role in the Host–Kra structural theory of characteristic factors of measure-preserving systems.The existing proofs of the Mackey–Zimmer theorem require various “countability”, “separability”, or “metrizability” hypotheses on the group ? that acts on the system, the base space Y, and the group K used to perform the extension. In this paper we generalize the Mackey–Zimmer theorem to “uncountable” settings in which these hypotheses are omitted, at the cost of making the notion of a measure-preserving system and a group extension more abstract. However, this abstraction is partially counteracted by the use of a “canonical model” for abstract measure-preserving systems developed in a companion paper. In subsequent work we will apply this theorem to also obtain uncountable versions of the Host–Kra structural theory., AJ was supported by DFG-research fellowship JA 2512/3-1. TT was supported by a Simons Investigator grant, the James and Carol Collins Chair, the Mathematical Analysis & Application Research Fund Endowment, and by NSF grant DMS-1764034.

© 2022, University of Nis. All rights reserved.In this paper the authors gave an iteration identity for the generalized Laplace transform L2n and the generalized Glasser transform G2n. Using this identity a Parseval-Goldstein type theorem for the L2n-transform and the G2n-transform is given. By making use of these results a number of new Parseval-Goldstein type identities are obtained for these and many other well-known integral transforms.The identities proven in this paper are shown to give rise to useful corollaries for evaluating infinite integrals of special functions. Some examples are also given.

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.

Partial balanced incomplete block designs have a wide range of applications in many areas. Such designs provide advantages over fully balanced incomplete block designs as they allow for designs with a low number of blocks and different associations. This paper introduces a class of partially balanced incomplete designs. We call it partially balanced network designs (PBNDs). The fundamentals and properties of PBNDs are studied. We are concerned with modeling PBNDs as graph designs. Some direct constructions of small PBNDs and generalized PBNDs are introduced. Besides that, we show that our modeling yields an effective utilization of PNBDs in constructing graph codes. Here, we are interested in constructing graph codes from bipartite graphs. We have proved that these codes have good characteristics for error detection and correction. In the end, the paper introduces a novel technique for generating new codes from already constructed codes. This technique results in increasing the ability to correct errors.

In recent years, deep learning has already been applied to English lip-reading. However, Chinese lip-reading starts late and lacks relevant dataset, and the recognition accuracy is not ideal. Therefore, this paper proposes a new hybrid neural network model to establish a Chinese lip-reading system. In this paper, we integrate the attention mechanism into both CNN and RNN. Specifically, we add the convolutional block attention module (CBAM) to the ResNet50 neural network, which enhances its ability to capture the small differences among the mouth patterns of similarly pronounced words in Chinese, improving the performance of feature extraction in the convolution process. We also add the time attention mechanism to the GRU neural network, which helps to extract the features among consecutive lip motion images. Considering the effects of the moments before and after on the current moment in the lip-reading process, we assign more weights to the key frames, which makes the features more representative. We further validate our model through experiments on our self-built dataset. Our experiments show that using convolutional block attention module (CBAM) in the Chinese lip-reading model can accurately recognize Chinese numbers 0–9 and some frequently used Chinese words. Compared with other lip-reading systems, our system has better performance and higher recognition accuracy.