Analysis of Human Resource Allocation Model for Tourism Industry Based on Improved BP Neural Network

This paper analyzes the deficiencies of human resource allocation in the tourism industry by investigating the human resource allocation in the tourism industry, puts forward corresponding improvement measures and suggestions, and strives to provide certain guidance and helpful effects for the construction of tourism resource informatization. In this paper, a modified BP neural network model is proposed by introducing random perturbation terms on the hidden layer in the BP neural network algorithm, and the weight matrix connecting the input values is added with the random perturbation matrix to obtain a new weight matrix so that the convergence effect of the improved BP neural network algorithm is improved. Then, to address the problem that the initial weights of the long and short-term memory neural network and gated BP unit neural network have a large impact on the convergence speed and prediction accuracy of the algorithm after the initial weight selection is determined, this paper introduces the random perturbation term into the gate structure of the long and short-term memory neural network and gated BP unit neural network and proposes and connects an improved long and short-term memory neural network and gated BP unit neural network. The weight matrix of the input values is added with the random perturbation matrix to obtain the new weight matrix so that the convergence effect of the improved long and short-term memory neural network algorithm and the gated BP unit neural network algorithm is improved. Constructing the human resource allocation model of the tourism industry and proposing coping strategies and countermeasures and taking the human resource allocation system of the tourism industry as the core, the human resource allocation model of the tourism industry is established by combining the network image crisis life cycle system of tourism scenic spots and the network public opinion dissemination model. From the perspective of managers, the human resource allocation management policy and management procedures of the tourism industry are proposed. Using the quantifiable and disenable characteristics of online text information, the response strategy of online monitoring and propaganda and offline management and enhancement is proposed, and innovative countermeasures to the human resource allocation of the tourism industry are proposed in three categories: network originated, reality coexisting, and reality originated. Through this paper, we propose a new approach to human resource allocation management and development in the tourism industry and improve the efficiency of human resource allocation in the tourism industry.

Parametric Random Vibration Analysis of an Axially Moving Laminated Shape Memory Alloy Beam Based on Monte Carlo Simulation

The study of the bifurcation, random vibration, chaotic dynamics, and control of laminated composite beams are research hotspots. In this paper, the parametric random vibration of an axially moving laminated shape memory alloy (SMA) beam was investigated. In light of the Timoshenko beam theory and taking into consideration axial motion effects and axial forces, a random dynamic equation of laminated SMA beams was deduced. The Falk’s polynomial constitutive model of SMA was used to simulate the nonlinear random dynamic behavior of the laminated beam. Additionally, the numerical of the probability density function and power spectral density curves was obtained through the Monte Carlo simulation. The results indicated that the large amplitude vibration character of the beam can be caused by random perturbation on axial velocity.

Key Generation Method Based on Multi-Satellite Cooperation and Random Perturbation

In low-earth-orbit (LEO) satellite-to-ground communication, the size of satellite antennae is limited and the satellite motion trajectory is predictable, which makes the channel state information (CSI) of the satellite-to-ground channel easy to leak and impossible to use to generate a physical layer key. To solve these problems, we propose a key generation method based on multi-satellite cooperation and random perturbation. On the one hand, we use multi-satellite cooperation to form a constellation that services users, in order to increase the equivalent aperture of satellite antennae and reduce the correlation between the legal channel and the wiretap channel. On the other hand, according to the endogenous characteristics of satellite motion, a random perturbation factor is proposed, which reflects the randomness of the actual channel and ensures that the CSI of the legal channel is not leaked due to the predictability of satellite motion trajectory. Simulation results show that the proposed method can effectively reduce the leakage of the legal channel’s CSI, which makes the method of physical layer key generation safe and feasible in the LEO satellite-to-ground communication scene.

Anonymous Stochastic Routing

We propose and analyze a recipient-anonymous stochastic routing model to study a fundamental trade-off between anonymity and routing delay. An agent wants to quickly reach a goal vertex in a network through a sequence of routing actions, whereas an overseeing adversary observes the agent’s entire trajectory and tries to identify the agent’s goal among those vertices traversed. We are interested in understanding the probability that the adversary can correctly identify the agent’s goal (anonymity) as a function of the time it takes the agent to reach it (delay). A key feature of our model is the presence of intrinsic uncertainty in the environment, so that each of the agent’s intended steps is subject to random perturbation and thus may not materialize as planned. Using large-network asymptotics, our main results provide near-optimal characterization of the anonymity–delay trade-off under a number of network topologies. Our main technical contributions are centered on a new class of “noise-harnessing” routing strategies that adaptively combine intrinsic uncertainty from the environment with additional artificial randomization to achieve provably efficient obfuscation.

Sensitivity to error during visuomotor adaptation is similarly modulated by abrupt, gradual and random perturbation schedules

It has been suggested that sensorimotor adaptation involves at least two processes (i.e., fast and slow) that differ in retention and error sensitivity. Previous work has shown that repeated exposure to an abrupt force field perturbation results in greater error sensitivity for both the fast and slow processes. While this implies that the faster relearning is associated with increased error sensitivity, it remains unclear what aspects of prior experience modulate error sensitivity. In the present study, we manipulated the initial training using different perturbation schedules, thought to differentially affect fast and slow learning processes based on error magnitude, and then observed what effect prior learning had on subsequent adaptation. During initial training of a visuomotor rotation task, we exposed three groups of participants to either an abrupt, a gradual, or a random perturbation schedule. During a testing session, all three groups were subsequently exposed to an abrupt perturbation schedule. Comparing the two sessions of the control group who experienced repetition of the same perturbation, we found an increased error sensitivity for both processes. We found that the error sensitivity was increased for both the fast and slow processes, with no reliable changes in the retention, for both the gradual and structural learning groups when compared to the first session of the control group. We discuss the findings in the context of how fast and slow learning processes respond to a history of errors.

Deterministic Local Interpretable Model-Agnostic Explanations for Stable Explainability

Local Interpretable Model-Agnostic Explanations (LIME) is a popular technique used to increase the interpretability and explainability of black box Machine Learning (ML) algorithms. LIME typically creates an explanation for a single prediction by any ML model by learning a simpler interpretable model (e.g., linear classifier) around the prediction through generating simulated data around the instance by random perturbation, and obtaining feature importance through applying some form of feature selection. While LIME and similar local algorithms have gained popularity due to their simplicity, the random perturbation methods result in shifts in data and instability in the generated explanations, where for the same prediction, different explanations can be generated. These are critical issues that can prevent deployment of LIME in sensitive domains. We propose a deterministic version of LIME. Instead of random perturbation, we utilize Agglomerative Hierarchical Clustering (AHC) to group the training data together and K-Nearest Neighbour (KNN) to select the relevant cluster of the new instance that is being explained. After finding the relevant cluster, a simple model (i.e., linear model or decision tree) is trained over the selected cluster to generate the explanations. Experimental results on six public (three binary and three multi-class) and six synthetic datasets show the superiority for Deterministic Local Interpretable Model-Agnostic Explanations (DLIME), where we quantitatively determine the stability and faithfulness of DLIME compared to LIME.

Sensitivity to Error During Visuomotor Adaptation is Similarly Modulated by Abrupt, Gradual and Random Perturbation Schedules

It has been suggested that sensorimotor adaptation involves at least two processes (i.e., fast and slow) that differ in retention and error sensitivity. Previous work has shown that repeated exposure to an abrupt force field perturbation results in greater error sensitivity for both the fast and slow processes. While this implies that the faster relearning is associated with increased error sensitivity, it remains unclear what aspects of prior experience modulate error sensitivity. In the present study, we manipulated the initial training using different perturbation schedules, thought to differentially affect fast and slow learning processes based on error magnitude, and then observed what effect prior learning had on subsequent adaptation. During initial training of a visuomotor rotation task, we exposed three groups of participants to either an abrupt, a gradual, or a random perturbation schedule. During a testing session, all three groups were subsequently exposed to an abrupt perturbation schedule. Comparing the two sessions of the control group who experienced repetition of the same perturbation, we found an increased error sensitivity for both processes. We found that the error sensitivity was increased for both the fast and slow processes, with no reliable changes in the retention, for both the gradual and structural learning groups when compared to the first session of the control group. We discuss the findings in the context of how fast and slow learning processes respond to a history of errors.

Random Perturbation of Sparse Graphs

In the model of randomly perturbed graphs we consider the union of a deterministic graph $\mathcal{G}_\alpha$ with minimum degree $\alpha n$ and the binomial random graph $\mathbb{G}(n,p)$. This model was introduced by Bohman, Frieze, and Martin and for Hamilton cycles their result bridges the gap between Dirac's theorem and the results by Pósa and Korshunov on the threshold in $\mathbb{G}(n,p)$. In this note we extend this result in $\mathcal{G}_\alpha\cup\mathbb{G}(n,p)$ to sparser graphs with $\alpha=o(1)$. More precisely, for any $\varepsilon>0$ and $\alpha \colon \mathbb{N} \mapsto (0,1)$ we show that a.a.s. $\mathcal{G}_\alpha\cup \mathbb{G}(n,\beta /n)$ is Hamiltonian, where $\beta = -(6 + \varepsilon) \log(\alpha)$. If $\alpha>0$ is a fixed constant this gives the aforementioned result by Bohman, Frieze, and Martin and if $\alpha=O(1/n)$ the random part $\mathbb{G}(n,p)$ is sufficient for a Hamilton cycle. We also discuss embeddings of bounded degree trees and other spanning structures in this model, which lead to interesting questions on almost spanning embeddings into $\mathbb{G}(n,p)$.

A New Design of Metaheuristic Search Called Improved Monkey Algorithm Based on Random Perturbation for Optimization Problems

The aim of this paper is to present a design of a metaheuristic search called improved monkey algorithm (MA+) that provides a suitable solution for the optimization problems. The proposed algorithm has been renewed by a new method using random perturbation (RP) into two control parameters (p1 and p2) to solve a wide variety of optimization problems. A novel RP is defined to improve the control parameters and is constructed off the proposed algorithm. The main advantage of the control parameters is that they more generally prevented the proposed algorithm from getting stuck in optimal solutions. Many optimization problems at the maximum allowable number of iterations can sometimes lead to an inferior local optimum. However, the search strategy in the proposed algorithm has proven to have a successful global optimal solution, convergence optimal solution, and much better performance on many optimization problems for the lowest number of iterations against the original monkey algorithm. All details in the improved monkey algorithm have been represented in this study. The performance of the proposed algorithm was first evaluated using 12 benchmark functions on different dimensions. These different dimensions can be classified into three different types: low-dimensional (30), medium-dimensional (60), and high-dimensional (90). In addition, the performance of the proposed algorithm was compared with the performance of several metaheuristic algorithms using these benchmark functions on many different types of dimensions. Experimental results show that the improved monkey algorithm is clearly superior to the original monkey algorithm, as well as to other well-known metaheuristic algorithms, in terms of obtaining the best optimal value and accelerating convergence solution.