A complexity measure approach based on forbidden patterns and correlation degree

2010 ◽  
Vol 19 (6) ◽  
pp. 060515 ◽  
Author(s):  
Wang Fu-Lai
2010 ◽  
Author(s):  
Carol Stoel-Gammon
Keyword(s):  

2020 ◽  
pp. 1-12
Author(s):  
Changxin Sun ◽  
Di Ma

In the research of intelligent sports vision systems, the stability and accuracy of vision system target recognition, the reasonable effectiveness of task assignment, and the advantages and disadvantages of path planning are the key factors for the vision system to successfully perform tasks. Aiming at the problem of target recognition errors caused by uneven brightness and mutations in sports competition, a dynamic template mechanism is proposed. In the target recognition algorithm, the correlation degree of data feature changes is fully considered, and the time control factor is introduced when using SVM for classification,At the same time, this study uses an unsupervised clustering method to design a classification strategy to achieve rapid target discrimination when the environmental brightness changes, which improves the accuracy of recognition. In addition, the Adaboost algorithm is selected as the machine learning method, and the algorithm is optimized from the aspects of fast feature selection and double threshold decision, which effectively improves the training time of the classifier. Finally, for complex human poses and partially occluded human targets, this paper proposes to express the entire human body through multiple parts. The experimental results show that this method can be used to detect sports players with multiple poses and partial occlusions in complex backgrounds and provides an effective technical means for detecting sports competition action characteristics in complex backgrounds.


2021 ◽  
Vol 13 (3) ◽  
pp. 1-21
Author(s):  
Suryajith Chillara

In this article, we are interested in understanding the complexity of computing multilinear polynomials using depth four circuits in which the polynomial computed at every node has a bound on the individual degree of r ≥ 1 with respect to all its variables (referred to as multi- r -ic circuits). The goal of this study is to make progress towards proving superpolynomial lower bounds for general depth four circuits computing multilinear polynomials, by proving better bounds as the value of r increases. Recently, Kayal, Saha and Tavenas (Theory of Computing, 2018) showed that any depth four arithmetic circuit of bounded individual degree r computing an explicit multilinear polynomial on n O (1) variables and degree d must have size at least ( n / r 1.1 ) Ω(√ d / r ) . This bound, however, deteriorates as the value of r increases. It is a natural question to ask if we can prove a bound that does not deteriorate as the value of r increases, or a bound that holds for a larger regime of r . In this article, we prove a lower bound that does not deteriorate with increasing values of r , albeit for a specific instance of d = d ( n ) but for a wider range of r . Formally, for all large enough integers n and a small constant η, we show that there exists an explicit polynomial on n O (1) variables and degree Θ (log 2 n ) such that any depth four circuit of bounded individual degree r ≤ n η must have size at least exp(Ω(log 2 n )). This improvement is obtained by suitably adapting the complexity measure of Kayal et al. (Theory of Computing, 2018). This adaptation of the measure is inspired by the complexity measure used by Kayal et al. (SIAM J. Computing, 2017).


1993 ◽  
Vol 18 (2-4) ◽  
pp. 163-182
Author(s):  
Alexander Leitsch

It is investigated, how semantic clash resolution can be used to decide some classes of clause sets. Because semantic clash resolution is complete, the termination of the resolution procedure on a class Γ gives a decision procedure for Γ. Besides generalizing earlier results we investigate the relation between termination and clause complexity. For this purpose we define the general concept of atom complexity measure and show some general results about termination in terms of such measures. Moreover, rather than using fixed resolution refinements we define an algorithmic generator for decision procedures, which constructs appropriate semantic refinements out of the syntactical structure of the clause sets. This method is applied to the Bernays – Schönfinkel class, where it gives an efficient (resolution) decision procedure.


2014 ◽  
Vol 16 (28) ◽  
pp. 14928-14946 ◽  
Author(s):  
Meressa A. Welearegay ◽  
Robert Balawender ◽  
Andrzej Holas

The usefulness of the information and complexity measure in molecular reactivity studies.


2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Hao Zhang ◽  
Liyu Zhu ◽  
Shensi Xu

Under the increasingly uncertain economic environment, the research on the reliability of urban distribution system has great practical significance for the integration of logistics and supply chain resources. This paper summarizes the factors that affect the city logistics distribution system. Starting from the research of factors that influence the reliability of city distribution system, further construction of city distribution system reliability influence model is built based on Bayesian networks. The complex problem is simplified by using the sub-Bayesian network, and an example is analyzed. In the calculation process, we combined the traditional Bayesian algorithm and the Expectation Maximization (EM) algorithm, which made the Bayesian model able to lay a more accurate foundation. The results show that the Bayesian network can accurately reflect the dynamic relationship among the factors affecting the reliability of urban distribution system. Moreover, by changing the prior probability of the node of the cause, the correlation degree between the variables that affect the successful distribution can be calculated. The results have significant practical significance on improving the quality of distribution, the level of distribution, and the efficiency of enterprises.


Amino Acids ◽  
2004 ◽  
Vol 28 (1) ◽  
pp. 57-61 ◽  
Author(s):  
X. Xiao ◽  
S. Shao ◽  
Y. Ding ◽  
Z. Huang ◽  
Y. Huang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document