Subjects: Computer Science >> Computer Application Technology submitted time 2023-02-15 Cooperative journals: 《桂林电子科技大学学报》
Abstract： In order to solve the optimal test link problem when testing embedded instruments in reconfigurable scanning network,
a method based on ACO algorithm is proposed. Firstly, the overall elements in the scanning network are abstracted
into a node network structure that can be recognized by the computer. Secondly, aiming at the loop problem in the network,
an "active" tabu table is proposed to release the node data in the tabu table when the designated-test-point is searched, so
that the searched nodes can be searched again. Finally, in order to make the optimal test link better searched, the pheromone
coefficient change factor is introduced to combine the pheromone update with the network scale to reduce the pheromone
update range, so as to avoid falling into local optimization due to excessive enhancement of pheromone concentration in
the later stage of search. Meanwhile, the adaptive pheromone volatilization coefficient is adopted to ensure the convergence
rate of the algorithm and improve the global search ability. The simulation results show that the algorithm can effectively
solve the optimal test link of the designated-test-point s in the reconfigurable scanning network. And compared with the basic
ACO algorithm, it has higher search efficiency, practicability and applicability.
Subjects: Mathematics >> Computational Mathematics. submitted time 2023-02-15 Cooperative journals: 《桂林电子科技大学学报》
Abstract： In order to further improve the numerical accuracy of solving Volterra integro-differential, two kinds of Legendre
spectral Galerkin numerical integration methods are investigated for the Volterra-type integro-differential equation with variable
coefficients. Firstly, the Galerkin Legendre numerical integration is applied to deal with the integral term of the Volterra-
type integro-differential equations. Secondly, the Legendre tau scheme is developed for the Volterra-type integral-differential
equations with variable coefficient, and the Chebyshev-Gauss-Lobatto collocation point is used to the calculation of the
variable coefficient and integral term. Finally, by decomposing the definition interval of the function, the multi-interval Legendre
spectral Galerkin numerical integration method is also designed. Its scheme of the proposed method has symmetric
structure for odd-order model. In addition, by introducing the least squares function of the Volterra type integro-differential
equation, the Legendre spectral Galerkin least-squares numerical integration method of is constructed. The corresponding
coefficient matrix of the algebraic equation is symmetric positive. Some numerical examples are given to test the high-order
accuracy and the effectiveness of our methods.
Subjects: Information Science and Systems Science >> Systematic Application of Information Technology submitted time 2022-10-26 Cooperative journals: 《桂林电子科技大学学报》
Abstract： The rise of a new generation of information technology and the rapid development of the internet industry have led
to an explosive growth in the amount of data. In order to meet the needs of billions of users to obtain effective information
from massive data quickly, it is of great significance to improve the retrieval quality and query efficiency of search engines,
but it also faces challenges. On the one hand, the query words of users are becoming more and more complex, and the characteristics
of the morphological variation of language vocabulary lead to the diversification of search words, while existing
stemming algorithms generally suffer from under stemming and unsatisfactory stemming accuracy; On the other hand, it is
a very time-consuming task to retrieve document results that meet user query requirements from massive data, and existing
methods of dividing documents into multiple servers to handle query latency often suffer from tail latency problems. In view
of the above problems, in the text preprocessing stage, the word form normalization algorithm APS (advanced porter stemmer)
is designed, the rule function is recoded, and the feature word extraction is optimized; In the related ranking stage, the
anytime ranking algorithm SAR (SAAT anytime ranking) is designed based on the score-at-a-Time query processing strategy,
which can terminate the query process in advance after a given time budget or processing a specified number of inverted
segments and control the query delay effectively. Experiments are carried out on multiple real datasets to verify the effectiveness of the APS algorithm in improving the accuracy of stemming and the authenticity of the SAR algorithm in controlling
query latency.
Hits
Hits
Downloads
Comment