Search

Наиболее распространенным видом информационных систем на современном этапе развития информационно-коммуникационных технологий являются автоматизированные информационные системы. Актуальность нашего исследования обусловлена более доступным получением знаний по дисциплине «Математическая логика и теория алгоритмов», при возможности подключения к сети интернету. Данная система позволит отправлять выполненные задания напрямую к получателю в любом удобном для него формате. Нами рассматривается проектирование информационной системы по дисциплине «Математическая логика и теория алгоритмов» при помощи языка гипертекстовой разметки HTML. The most common type of information systems at the current stage of development of information and communication technologies are automated information systems. The relevance of our study is due to the more accessible acquisition of knowledge in the discipline "Mathematical logic and theory of algorithms," when it is possible to connect to the Internet. This system will allow you to send completed tasks directly to the recipient in any format convenient for him. We are considering the design of an information system in the discipline "Mathematical logic and theory of algorithms" using the HTML hypertext markup language. The analysis of requirements of the existing normative documents regarding concerning a relative positioning of buildings in territories of garden and country associations or on the land plots intended for individual housing construction is also presented in article.

Frequent itemset mining serves as the main method of association rule mining. With the limitations in computing space and performance, the association of frequent items in large data mining requires both extensive time and effort, particularly when the datasets become increasingly larger. In the process of associated data mining in a big data environment, the MapReduce programming model is typically used to perform task partitioning and parallel processing, which could improve the execution efficiency of the algorithm. However, to ensure that the associated rule is not destroyed during task partitioning and parallel processing, the inner-relationship data must be stored in the computer space. Because inner-relationship data are redundant, storage of these data will significantly increase the space usage in comparison with the original dataset. In this study, we find that the formation of the frequent pattern (FP) mining algorithm depends mainly on the conditional pattern bases. Based on the parallel frequent pattern (PFP) algorithm theory, the grouping model divides frequent items into several groups according to their frequencies. We propose a non-group PFP (NG-PFP) mining algorithm that cancels the grouping model and reduces the data redundancy between sub-tasks. Moreover, we present the NG-PFP algorithm for task partition and parallel processing, and its performance in the Hadoop cluster environment is analyzed and discussed. Experimental results indicate that the non-group model shows obvious improvement in terms of computational efficiency and the space utilization rate.

The combinatorial optimization, algorithmic graph theory, and approximate algorithm theory were not developed by one person, but through the joint efforts of several generations. By the early 1970s or so, the view had taken shape that the algorithms that would work in practice were usually those implemented in polynomial time. Searching for efficient algorithms for all kinds of problems inspired computer experts and some mathematicians of the time. We design a 3/2-approximation algorithm to solve the sorting problem of parallel machine parts with time Windows.

In this paper will be shown one method for proving the polynomial inequalities with real coefficients. Algorithm shown here can work with all real values for coefficients of polynomial. This is of great importance for programming algorithms for computers which by their nature use the limited number of digits for number representation.

According to the specific situation of the teaching work of ordinary colleges and universities, combined with the specific requirements of teaching quality, for the purpose of cultivating high-quality talents, swarm intelligence algorithm theory is introduced into the teaching quality evaluation system, and the mathematical structure of the quantum behavior particle swarm optimization algorithm is used to establish the mathematical model. Among them, the application of intelligent algorithm in the practice of evaluation method has broadened the new ideas and measures for the reform and development of normal university education, promoted the teachers to further clarify their responsibilities, and created a good atmosphere for everyone to care about teaching quality.

In the fierce market competition, China’s power grid companies have gradually realized that through the supply chain management, such an effective mode of cooperation between enterprises, especially through the use of supply chain performance management methods can effectively enhance the core competitiveness of enterprises. From the perspective of grid companies, this study first summarizes and reviews the gray cluster analysis algorithm theory, and then calculates and analyzes the supplier index data. Based on this, the supplier judgment and evaluation level under the clustering method is determined., The index number field extension value, and finally classified the suppliers using the gray clustering evaluation method, and tested the information-based supplier management mechanism under the cluster analysis algorithm with a case. The test shows that the method is interpretable with applicability.

The article provides examples of the use of digital technologies in the study of the theory of algorithms. The use of emulators in the study of algorithmic models is justified. В статье приведены примеры использования цифровых технологий при изучении теории алгоритмов. Обосновано применение эмуляторов при изучении алгоритмических моделей.

In large-scale game activities, the computer big data system is collected, and then large-scale real-time data collection, processing and control systems are used to bring mathematical algorithm models, and state information reliability algorithms are used to illustrate the system control machine design and its Implementation based on VMS. This article calculates the most by calculation. The main design ideas in the game mathematical model, the research found that the system controller proposed by the system is a method to solve the multi-state process synchronization problem in the Client/Server computing system, and can effectively deal with the algorithm application research in the model.

The performance of the selective catalytic reduction (SCR) system has been confirmed to be distinctly affected by hydrothermal aging fault. In this paper, an observer based on the Unscented-Kalman-Filter (UKF) algorithm theory is designed to identify the states of hydrothermal aging so that the aging SCR can be more accurately and efficiently diagnosed and fault-tolerant controlled. Furthermore, a model reference adaptive controller (MRAC) based on the theory of Lyapunov is constructed to enhance the fault-tolerant control performance of SCR Simulation, on the basis of the diagnosis information of UKF observer. The simulations and comparisons are performed to verify the performance of aging diagnosis and fault-tolerant control. The corresponding results show that the UKF observer has better estimation accuracy and respond speed for SCR aging, simultaneously, the fault-tolerant control performance of SCR aging is also better.

The betweenness is a well-known measure of centrality of a node in a network. We consider the problem of determining how much a node can increase its betweenness centrality by creating a limited amount of new edges incident to it. If the graph is directed, this problem does not admit a polynomial-time approximation scheme (unless P=NP) and a simple greedy approximation algorithm guarantees an almost tight approximation ratio [E. D. Demaine and M. Zadimoghaddam. Minimizing the diameter of a network using shortcut edges. In Proc. of the 12th Scandinavian Symp. and Work. on Algorithm Theory (SWAT), volume 6139 of LNCS, pages 420–431. Springer, 2010].In this paper we focus on the undirected graph case: we show that also in this case the problem does not admit a polynomial-time approximation scheme (unless P=NP). Moreover, we show that, differently from the directed case, the greedy algorithm can have an unbounded approximation ratio. In order to test the practical performance of the greedy algorithm, we experimentally measured its efficiency in term of ranking improvement, comparing it with another algorithm that simply adds edges to the nodes that have highest betweenness. Our experiments show that the greedy algorithm adds only few edges in order to increase the betweenness of a node and to reach the top positions in the ranking. Moreover, the greedy algorithm outperforms the second approach.

The localization of partial discharge (PD) sources using the acoustic emission(AE) technique has attracted increasing research attention. Previous studies have focused on applying different optimization algorithms to solve the time difference of arrival equations. Some simple iteration algorithms and some intelligent optimization algorithms are used to solve the time difference of arrival equations. Moreover, a new localization method using transformer model is proposed. In this paper, experiments are performed in a 35kV transformer to compare quantitatively those different localization methods. Five different localization methods are introduced in detail about their algorithm theory, advantages and disadvantages. After that, those algorithms are tested using data from a three-phase 35kV transformer. To generate predictable PD signals, an artificial protrusion defect model was used. This defect was placed at different positions in the transformer and the localization results of various algorithms can be gathered. Both the Newton-Raphson algorithm and the Chan algorithm suffer non-convergence or localization outside the transformer. The GA and ICA have better performance but large errors are induced because those two methods treat direct paths as the fastest routes. Moreover, the algorithm based on the transformer model shows the best accuracy but its calculation time is the longest while other methods can response quickly.

With the rapid development of intelligent algorithm theory, the application of intelligent algorithms to optimize the structure of network has become a trend. Combining with the advantages of Antlion optimization (ALO), this paper proposes to use ALO algorithm to optimize the initial weights and thresholds of LSTM network, which improves the convergence speed and accuracy, and prevents the algorithm from falling into the local optimal value, perfecting the performance of LSTM networks. Experimental results of trajectory prediction show that compared with BP neural network and LSTM neural network, ALO-LSTM trajectory prediction model has better prediction ability and can predict the trajectory quickly and accurately, ensuring the accuracy timeliness of trajectory prediction.

MCEM algorithm produces based on the evolution of the EM algorithm. According to the MCEM algorithm theory, the iterative formula of parameter estimation of Rayleigh was derived based on MCEM algorithm, meanwhile the computer simulation algorithm was designed. Computer simulation shows that , in the case of the small sample, parameter estimation of MCEM algorithm is more stable and precise than MLE algorithm.

Extreme learning machine (ELM) is a new learning algorithm for the single hidden layer feedforward neural networks. Compared with the conventional neural network learning algorithm it overcomes the slow training speed and over-fitting problems. ELM is based on empirical risk minimization theory and its learning process needs only a single iteration. The algorithm avoids multiple iterations and local minimization. It has been used in various fields and applications because of better generalization ability, robustness, and controllability and fast learning rate. In this paper, we make a review of ELM latest research progress about the algorithms, theory and applications. It first analyzes the theory and the algorithm ideas of ELM, then tracking describes the latest progress of ELM in recent years, including the model and specific applications of ELM, finally points out the research and development prospects of ELM in the future.

This paper provides a streamlined and modular presentation of the $\mbox{MR}^{3}$ algorithm for computing selected eigenpairs of symmetric tridiagonal matrices, thus disentangling the principles driving $\mbox{MR}^{3}$ and the (recursive) “core” algorithm from the specific (e.g., twisted) decompositions used to represent the matrices at different recursion depths and from the (dqds) transformations converting between them. Our approach allows a modular full proof for the correctness of the $\mbox{MR}^{3}$ algorithm. This proof is based on five requirements concerning the interplay between the core algorithm and its subcomponents. These requirements can also guide in implementing the algorithm, because they expose quantities that can and should be monitored at runtime. Our new implementation XMR, which is based on the above analysis, is described and compared to STEMR from Lapack 3.2.2. Numerical experiments comparing the robustness and performance of both implementations are given.

In order to reduce the influence of illumination changes on the appearance of smart meter and improve the accuracy of smart meter appearance detection, based on the local two value algorithm theory, the algorithm is improved as the local two value algorithm of the rotation invariance. But rotation invariant local value operator with the sampling number of blocks increases the operator types will be a substantial increase, this limitation is bound to increase computing influence quantity calculation speed. Therefore, it will be done in a unified process, and the unified local two value algorithm is obtained. In the light of the smart meter in strong lighting and weak lighting condition, separately use the local two value algorithm theory and the unified local two value algorithm are separately used to detect the appearance of the smart meter. The analysis results show that the unified local two value algorithm can recognize the information of the smart meter, which has a certain application value for the smart meter.

This article describes an analytical framework for reasoning about the issue of tie breaking in algorithm theory. The core of this framework is the concept of robust algorithms. Such kind of algorithms have the convenient property that an arbitrary set of degenerate cases can be ignored without loss of generality during proofs of many important properties, e.g., runtime, space requirements, feasibility, competitive and approximation ratios. Here degeneracy is defined as a set of problem instances satisfying a certain property, and this property is independent from both the algorithm under consideration and the specific combinatorial problem structure. It turns out that robustness is related to the tie breaking policy of algorithms in two different ways. On the one hand, the set of inputs where a tie actually occurs is typically (but not always) a degenerate case. On the other hand, we show that for any algorithm there is a way to break ties such that it becomes robust. In particular, robustness is guaranteed by any tie breaking strategy that can be interpreted as symbolic perturbation. For many typical algorithms the implicit usage of symbolic perturbation can be easily verified and so the consideration of degenerate cases can be avoided during their analysis. The concept of robustness also gives a theoretical explanation of why tie breaking does often not matter at all.

Developing efficient computational algorithms for studying complex phenomena has been a long-standing problem in physics and engineering. One such algorithm, invasion percolation, has found wide applications.

This issue marks the return of the Computing Prescriptions department; here, the authors describe an algorithm for finding minimum cutsets in connected graphs.

Over the course of a three-part series, the authors will walk through the implementation of a simple but computationally intensive algorithm and show how a series of incremental refinements to the code yields significant performance gains. In this first installment, they concentrate on instruction selection and scheduling.

International audience; This paper presents the design and implementation of a Passive Fault-Tolerant Control (PFTC) strategy for a coaxial counter-rotating octorotor based on the Super-Twisting algorithm. This second-order sliding mode technique ensures robustness with respect to uncertainties and disturbances and is also able to deal directly with faults and failures by compensating the actuators loss in the system without prior knowledge on the fault, its location and its severity. The effectiveness of this PFTC is illustrated through real experimental application to a coaxial octorotor,where two motors failures are considered.

It should not be surprising that in solving cubic equations, sooner or later you are going to have to take the cube root of something. But it's not immediately obvious what cubic equations have to do with arc cosines. Well, in the general case of complex coefficients and roots we would need to take the cube root of a complex number

We present timing-driven partitioning and simulated-annealing (SA)-based placement algorithms together with a detailed routing tool for three-dimensional (3-D) field-programmable gate array (FPGA) integration. The circuit is first divided into layers with a limited number of interlayer vias, and then placed on individual layers, while minimizing the delay of critical paths. We use our tool as a platform to explore the potential benefits, in terms of delay and wire length (WL), that 3-D technologies can offer for FPGA fabrics. Experimental results show, on average, a total decrease of 25% in WL and 35% in delay can be achieved over traditional two-dimensional chips, when ten layers are used in 3-D integration

In this paper, we first attempt to introduce the biological concepts of genetic factor and genetic variation into the study of a Kaleidoscope–Queer (in brief, K–Q) cryptosystem. The novel K–Q cryptosystem including the genetic factor, ( GM , X , λ ( x )), can be applied to ensure the security of an information system. The main contributions include the K–Q cryptosystem concept with genetic factor, the existence theorem of α -era K–Q cryptosystem with genetic factor, the limited embedded theorem of K–Q cryptosystem with genetic factor, and the genetic variability theorem of K–Q cryptosystem.

A graphic sequence @p=(d"1,d"2,...,d"n) is said to be potentially K"r"+"1-graphic, if @p has a realization G containing K"r"+"1, a clique of r+1 vertices, as a subgraph. In this paper, we give two simple sufficient conditions for a graphic sequence @p=(d"1,d"2,...,d"n) to be potentially K"r"+"1-graphic. We also show that the two sufficient conditions imply a theorem due to Rao [An Erdos-Gallai type result on the clique number of a realization of a degree sequence unpublished.], a theorem due to Li et al [The Erdos-Jacobson-Lehel conjecture on potentially P"k-graphic sequences is true, Sci. China Ser. A 41 (1998) 510-520.], the Erdos-Jacobson-Lehel conjecture on @s(K"r"+"1,n) which was confirmed (see [Potentially G-graphical degree sequences, in: Y. Alavi et al. (Eds.), Combinatorics, Graph Theory, and Algorithms, vol. 1, New Issues Press, Kalamazoo Michigan, 1999, pp. 451-460; The smallest degree sum that yields potentially P"k-graphic sequences, J. Graph Theory 29 (1998) 63-72; An extremal problem on the potentially P"k-graphic sequence, Discrete Math. 212 (2000) 223-231; The Erdos-Jacobson-Lehel conjecture on potentially P"k-graphic sequences is true, Sci. China Ser. A 41 (1998) 510-520.]) and the Yin-Li-Mao conjecture on @s(K"r"+"1-e,n) [An extremal problem on the potentially K"r"+"1-e-graphic sequences, Ars Combin. 74 (2005) 151-159.], where K"r"+"1-e is a graph obtained by deleting one edge from K"r"+"1.

Bursty continuous media streams with periodic playout deadlines (e.g., VBR-encoded video) are expected to account for a large portion of the traffic in the future Internet. By prefetching parts of ongoing streams into client buffers these bursty streams can be more efficiently accommodated in packet-switched networks. In this paper we develop a modular algorithm-theoretic framework for the fair and efficient transmission of continuous media over a bottleneck link. We divide the problem into the two subproblems of (i) assuring fairness, and (ii) efficiently utilizing the available link capacity. We develop and analyze algorithm modules for these two subproblems. Specifically, we devise a bin packing algorithm for subproblem (i), and a "layered prefetching" algorithm for subproblem (ii). Our simulation results indicate that the combination of these two algorithm modules compares favorably with existing monolithic solutions. This demonstrates the competitiveness of the decoupled modular algorithm framework, which provides a foundation for the development of refined algorithms for fair and efficient prefetching.