Search

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.

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.

Very recently, I. Altun, M. Aslantas and H. Sahin [1] introduced the notion of $$p$$ -proximal contractions and surveyed the existence of best proximity points for such class of non-self mappings in metric spaces. In this note we show that this existence result is a straightforward consequence of the same conclusion in fixed point theory.

Sendov’s conjecture states that if all the zeroes of a complex polynomial P(z) of degree at least two lie in the unit disk, then within a unit distance of each zero lies a critical point of P(z). In a paper that appeared in 2014, Degot proved that, for each a ∈ (0, 1), there exists an integer N such that for any polynomial P(z) with degree greater than N, if P(a) = 0 and all zeroes lie inside the unit disk, the disk |z − a| ≤ 1 contains a critical point of P(z). Based on this result, we derive an explicit formula N(a) for each a ∈ (0, 1) and, consequently obtain a uniform bound N for all a ∈ [α, β] where 0 < α < β < 1. This (partially) addresses the questions posed in Degot’s paper.

We introduce a graph Ramsey game called Ramsey, Paper, Scissors. This game has two players, Proposer and Decider. Starting from an empty graph on $n$ vertices, on each turn Proposer proposes a potential edge and Decider simultaneously decides (without knowing Proposer's choice) whether to add it to the graph. Proposer cannot propose an edge which would create a triangle in the graph. The game ends when Proposer has no legal moves remaining, and Proposer wins if the final graph has independence number at least $s$. We prove a threshold phenomenon exists for this game by exhibiting randomized strategies for both players that are optimal up to constants. Namely, there exist constants $0B\sqrt{n}\log{n}$. This is a factor of $\Theta(\sqrt{\log{n}})$ larger than the lower bound coming from the off-diagonal Ramsey number $r(3,s)$.

Let l be a Banach sequence space with a monotone norm in which the canonical system (e_{n}) is an unconditional basis. We show that if there exists a continuous linear unbounded operator between l-K\"{o}the spaces, then there exists a continuous unbounded quasi-diagonal operator between them. Using this result, we study in terms of corresponding K\"{o}the matrices when every continuous linear operator between l-K\"{o}the spaces is bounded. As an application, we observe that the existence of an unbounded operator between l-K\"{o}the spaces, under a splitting condition, causes the existence of a common basic subspace.

P values linked to null hypothesis significance testing (NHST) is the most widely (mis)used method of statistical inference. Empirical data suggest that across the biomedical literature (1990–2015)...

Propositions 1.1–1.3 stated below contribute to results and certain problems considered in [E-S], on the behavior of products $$\Pi^n_1(1-z^{a_j}),1\leq{a_1}...\leq{a_n}$$ integers. In the discussion below, {a1,..., an} will be either a proportional subset of {1,..., n} or a set of large arithmetic diameter.

In 1903, Epstein published his proof of meromorphic continuation and a functional equation for Dirichlet series associated with quadratic forms, now called Epstein zeta-functions. However, already in 1889 (or even earlier) Hurwitz was aware of these results as his mathematical diaries and some unpublished notes (in an almost final form) found in his estate at the ETH Zurich show. In this article we present and analyze Hurwitz's notes and compare his reasoning with Epstein's paper in detail.

The translation into English of Aleksandr Yakovlevich Khinchin's (1894–1959) 1926 paper entitled ‘Ideas of intuitionism and the struggle for a subject matter in contemporary mathematics’ is made available for the first time. Here, Khinchin presented the famous foundational debate between L.E.J. Brouwer and David Hilbert of the 1920s in terms of a search for a mathematics with content. His main aim seems to have been to make intuitionism ideologically acceptable to his audience at the Communist Academy by means of the claim that insofar as Brouwer's intuitionism had a clear ‘subject matter’ and Hilbert's new program was a concession to intuitionism, the alleged victory of intuitionism not only implied the defeat of ‘empty’ formalism, but also showed the compatibility and affinity of Marxism with the newest developments in modern mathematics. This introduction provides a tentative exploration of the issue of what was tactical (or due to ideological pressure) and what was real scientific interest (or due to ignorance) (or what was both) in Khinchin's 1926 paper in the form of a detailed commentary, especially, on the tactical side of his presentation of the positions of Brouwer and Hilbert.

A class of games for finding a leader among a group of candidates is studied in detail. This class covers games based on coin tossing and rock-paper-scissors as special cases and its complexity exhibits similar stochastic behaviors: either of logarithmic mean and bounded variance or of exponential mean and exponential variance. Many applications are also discussed.

In a recent paper, (Math Notes 91(3–4): 508–516, 2012) Zarhin proved that each member of a naturally defined family of linear maps \({\mathbb {C}}^n \rightarrow {\mathbb {C}}^n\) has co-rank one. We present a direct proof of Zarhin’s result about complex polynomials with distinct roots; it is rather similar to that of Appendix by Vik.S. Kulikov to Zarhin’s paper but we give explicit constants. We also discuss the case of a polynomial with multiple roots.

We complete a gap in the proof that exceptional polynomials are complete orthogonal systems in the associated Hilbert spaces.

We indicate how recent results of Grafakos and Teschl (J Fourier Anal Appl 19:167–179, 2013), and Estrada (J Fourier Anal Appl 20:301–320, 2014), relating the Fourier transform of a radial function in $$\mathbb R^n$$ and the Fourier transform of the same function in $$\mathbb R^{n+2}$$ and $$\mathbb R^{n+1}$$ , respectively, are located within known results on transplantation for Hankel transforms.

Congruences mod p for a prime p and partial products of the numbers 1,…, p − 1 are obtained. Bibliography: 2 titles.

The Award Committee – Peter Kritzer, Johannes Kepler University Linz, Austria and Jan Vybiral, Charles University, Czech Republic – determined that the following paper exhibits exceptional merit and therefore awarded the prize to: Bernd Carl, Aicke Hinrichs, and Philipp Rudolph for their paper ‘‘Entropy numbers of convex hulls in Banach spaces and applications’’, which appeared in October, 2014. Vol. 30, pp. 555–587. The $3000 prize will be divided between the winners. Each author will also receive a plaque.

The Award Committee – Michael Gnewuch, University of Kaiserslautern, Germany and Friedrich Pillichshammer, Johannes Kepler University, Austria – determined that the following two papers exhibited exceptional merit and therefore awarded the prize to: ShuTezuka for his paper ‘‘On the discrepancy of generalizedNiederreiter sequences’’, which appeared in June–August, 2013. Vol. 29, pp. 240–247. Joos Heintz, Bart Kuijpers, and Andres Rojas Paredes for their paper ‘‘Software engineering and complexity in effective Algebraic Geometry’’, which appeared in February, 2013. Vol. 29, pp. 92–138. The $3000 prize will be divided between the winners. Each author will also receive a plaque.

Cooperative games form an important class of problems in game theory, where a key goal is to distribute a value among a set of players who are allowed to cooperate by forming coalitions. An outcome of the game is given by an allocation vector that assigns a value share to each player. A crucial aspect of such games is submodularity (or convexity). Indeed, convex instances of cooperative games exhibit several nice properties, e.g. regarding the existence and computation of allocations realizing some of the most important solution concepts proposed in the literature. For this reason, a relevant question is whether one can give a polynomial-time characterization of submodular instances, for prominent cooperative games that are in general non-convex. In this paper, we focus on a fundamental and widely studied cooperative game, namely the spanning tree game. An efficient recognition of submodular instances of this game was not known so far, and explicitly mentioned as an open question in the literature. We here settle this open problem by giving a polynomial-time characterization of submodular spanning tree games.

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.

The main goal of this short paper is to prove the existence of rank 2 simple and special Ulrich bundles on a wide class of elliptic surfaces: namely, on regular Weierstrass fibrations \(\pi : S\rightarrow \mathbb {P}^1\). Alongside we also show the existence of rank 2 weakly Ulrich sheaves on arbitrary Weierstrass fibrations \(S\rightarrow C_0\) and we deal with the (non-)existence of rank one Ulrich bundles on them.

© 2019, Pleiades Publishing, Ltd. It is well known that the classical and Sobolev wave fronts were extended to nonequivalent global versions by the use of the short-time Fourier transform. In this very short paper, we give complete characterizations of the former wave front sets in terms of the short-time Fourier transform.

In this paper we study bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a bipartite correlation. This hierarchy converges to a new parameter: the minimal average entanglement dimension, which measures the amount of entanglement needed to reproduce a quantum correlation when access to shared randomness is free. For synchronous correlations, we show a correspondence between the minimal entanglement dimension and the completely positive semidefinite rank of an associated matrix. We then study optimization over the set of synchronous correlations by investigating quantum graph parameters. We unify existing bounds on the quantum chromatic number and the quantum stability number by placing them in the framework of tracial optimization. In particular, we show that the projective packing number, the projective rank, and the tracial rank arise naturally when considering tracial analogues of the Lasserre hierarchy for the stability and chromatic number of a graph. We also introduce semidefinite programming hierarchies converging to the commuting quantum chromatic number and commuting quantum stability number., Comment: 26 pages

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 short paper we prove a parametric version of the Harnack inequality for \(\phi\)-Laplacian equations. In this sense, the estimates are optimal and represent an improvement of previous bounds for this kind of operators.

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.

In order to solve the Sylvester equations more efficiently, a new four parameters positive and skew-Hermitian splitting (FPPSS) iterative method is proposed in this paper based on the previous research of the positive and skew-Hermitian splitting (PSS) iterative method. We prove that when coefficient matrix A and B satisfy certain conditions, the FPPSS iterative method is convergent in the parameter&rsquo, s value region. The numerical experiment results show that compared with previous iterative method, the FPPSS iterative method is more effective in terms of iteration number IT and runtime.

We present three types of polyhedral surfaces, which are continuously flexible and have not only an initial pose, where all faces are coplanar, but pass during their self-motion through another pose with coplanar faces (“flat pose”). These surfaces are examples of so-called rigid origami, since we only admit exact flexions, i.e., each face remains rigid during the motion, only the dihedral angles vary. We analyze the geometry behind Miura-ori and address Kokotsakis’ example of a flexible tessellation with the particular case of a cyclic quadrangle. Finally, we recall Bricard’s octahedra of Type 3 and their relation to strophoids.

We give an introduction to functional data analysis, with examples, and provide a brief review of the literature. We explain how principal component analysis (PCA) can be used to transform curves into finite dimensional data. An application of PCA is developed to test for the equality of the means of several populations (functional analysis of variance). Asymptotics are derived under the null hypothesis that the populations have the same mean curves. The selection of the basis for the projections and the power of the test is discussed for simple random samples and stationary time series samples of curves. We review the part of the literature which is needed to establish the validity of the PCA method. Two data sets, magnetogram records and stock returns, are used to illustrate the applicability of our limit results.

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 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 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.

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 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.

Big data has been developed for nearly a decade, and the information data on the network is exploding. Facing the complex and massive data, it is difficult for people to get the demanded information quickly, and the recommendation algorithm with its characteristics becomes one of the important methods to solve the massive data overload problem at this stage. In particular, the rise of the e-commerce industry has promoted the development of recommendation algorithms. Traditional, single recommendation algorithms often have problems such as cold start, data sparsity, and long-tail items. The hybrid recommendation algorithms at this stage can effectively avoid some of the drawbacks caused by a single algorithm. To address the current problems, this paper makes up for the shortcomings of a single collaborative model by proposing a hybrid recommendation algorithm based on deep learning IA-CN. The algorithm first uses an integrated strategy to fuse user-based and item-based collaborative filtering algorithms to generalize and classify the output results. Then deeper and more abstract nonlinear interactions between users and items are captured by improved deep learning techniques. Finally, we designed experiments to validate the algorithm. The experiments are compared with the benchmark algorithm on (Amazon item rating dataset), and the results show that the IA-CN algorithm proposed in this paper has better performance in rating prediction on the test dataset.

This paper uses big data technology to predict the employment rate of colleges and universities. In this paper, combined with the current rental price, daily life consumption, and college students’ personal interests and hobbies consumption and other indicators, the individual is simulated by big data, and the individual is associated by using the AI-driven edge fog computing service optimization algorithm to form a cluster, so as to realize the prediction from element to neural network cluster by using edge computing. In addition, this paper takes the employment data of colleges and universities in Hunan province from June 2020 to May 2021 as the research sample to test the prediction model and makes a comparative analysis with the CNN model and LSTM model. The edge fog computing model in this paper has more analytical indexes as tuples compared to the CNN model, so the results show that the prediction accuracy can reach 83.25%. In this case, there is little difference between the two models of data processing and predictive efficiency. Compared with the LSTM based classification prediction model, this model is edge computing, which greatly improves the data quality of model and data parameters, and the calculation efficiency can be increased by 45%–65%. Therefore, the use of big data technology can provide a reference for the research direction of higher education.