Subjects: Information Science and Systems Science >> Basic Disciplines of Information Science and Systems Science Subjects: Computer Science >> Other Disciplines of Computer Science Subjects: Engineering and technical science >> Engineering Mathematics submitted time 2024-03-30
Abstract： What is intelligence? is one of the core key questions of artificial intelligence, but there is no universally accepted definition. Based on the relationship between intelligence and life, this paper proposes that intelligence is the basic ability and characteristic attribute of living organisms, and it is the ability to achieve the maximum amount of information with the minimum energy as much as possible, and adapt to the environment and maintain existence through information processing. On this basis, this paper puts forward a new view that intelligence is the ability to convert material energy and information, further puts forward new concepts such as the measurement calculation method of intelligence, average intelligence, and comprehensive intelligence, and finally discusses the quantitative conversion relationship between matter, energy and information, points out the upper bound of intelligence and the lower bound of energy conversion into information, and further gives a dimensionless calculation formula for intelligence measurement in order to facilitate practical application. A feasible calculation method is given for the quantitative analysis of the intelligence of the intelligent system..
Peer Review Status:
Awaiting Review
Subjects: Library Science，Information Science >> Literature Work submitted time 2022-07-14
Abstract： <p>The features of sci-tech journals cover design, including layout and design style, are analyzed. The practice of China Laser Press on journal cover design process management and other related issues is presented, and the topics planning, production process and copyright protection of journal covers are discussed. The thoughts on cover style, culture, copyright and cooperation with vendors are presented. Through reasonable design, the covers of sci-tech journals can integrate science and technology with art, spread frontier achievements and promote Chinese traditional culture.</p>
Peer Review Status:Awaiting Review
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2022-05-18 Cooperative journals: 《计算机应用研究》
Abstract： The warning propagation algorithm, as a basic information propagation algorithm, is very effective in solving the satisfiability problem when it converges. However, when the structure of factor graph is more complex, the algorithm often does not converge, resulting in solving failure. In order to give a theoretical explanation for this phenomenon, and to effectively analyze the convergence of warning propagation algorithm, which using tree decomposition method to constructed the tree width measurement model of factor graph corresponding to propositional formula, and calculated the tree width satisfying the random instance. The relationship between tree width and convergence of warning propagation algorithm is established, and the convergence judgment condition of warning propagation algorithm based on tree width is given. The experimental results show that this method is effective, and it is very important to analyze the convergence of other information transmission algorithms.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2022-04-07 Cooperative journals: 《计算机应用研究》
Abstract： The Max-SAT problem is an optimized version of the SAT problem. The goal is to find a set of variable assignments in a given set of clauses so that the maximum number of clauses is satisfied. This problem is a typical NP-hard problem. With the in-depth development of big data and artificial intelligence, the original algorithms in the past are no longer applicable. Designing a new solution algorithm or optimizing the existing solution algorithm is the current research hotspot. Aiming at the limitations of the information dissemination algorithm for solving the random Max-3-SAT problem, this paper proposes a warning dissemination algorithm based on the calculation of variable weights. Combined with the random walk algorithm, a new algorithm WWP+WalkSAT is formed, which is solved by improvement The limitation of, it is better to get a set of effective initial solutions, thereby improving the local search ability of the algorithm. Using some benchmark examples of the Max-SAT International Competition in 2016, the WWP+WalkSAT algorithm and 8 local search algorithms are used for accuracy comparison experiments. The experimental results show that the WWP + walksat algorithm has good performance.
Subjects: Geosciences >> Geography submitted time 2022-03-28 Cooperative journals: 《干旱区研究》
Abstract：本研究基于CASA模型获得黄土高原20002018年植被NPP数据集，通过相关性、残差分析等方法，定量分析了气候变化和人类活动对植被NPP变化的影响。结果表明：（1）黄土高原20002018年植被NPP呈东南高、西北低分布格局，研究区约86.86%区域植被NPP呈增加趋势，主要为退耕还林还草的核心区；呈下降趋势的面积占13.14%，主要分布在西北部的干旱区。（2）气候变化和人类活动对植被NPP变化的贡献率分别为48.78%和51.22%，在空间上有明显的差异性，人口稀少、发展相对落后地区的植被变化主要受气候变化的影响；人口众多、经济发展较好地区植被变化以人类活动为主。（3）黄土高原作为干旱半干旱区植被对气候变化的响应较为敏感，随着人类活动的日益频繁，气候和人类活动共同作用于黄土高原的植被变化。本研究有助于理解气候变化和人类活动对植被动态变化的影响，并为黄土高原的植被恢复和高质量发展提供科学依据。
Subjects: Geosciences >> Geography submitted time 2021-06-13 Cooperative journals: 《干旱区研究》
Abstract：基于1990—2019年Landsat TM/OLI遥感影像，采用面向对象分类方法提取银川市湿地景观信息，通过景观指数、冗余分析方法定量分析研究区湿地景观演变特征及其驱动因素。结果表明：（1）银川市湿地面积由1990年的264.86 km2减少到2019年的241.32 km2，减少了23.54 km2。与1990年相比，2019年的自然湿地面积减少了33.57 km2，人工湿地面积增加了10.03 km2。（2）1990—2019年间，银川市湿地景观的破碎化程度下降、聚集程度降低、形状逐渐不规则化、多样性与异质性增加。（3）选取12个驱动因素指标进行冗余分析，社会经济因素是湿地景观演变的主导因素，非农业人口数、水产品产量、第二产业产值与建成区面积对湿地景观变化的影响最为显著，降水量、气温等自然因素作用相对较弱。研究结果可为银川市的湿地资源的合理利用与保护提供重要参考。
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2020-09-28 Cooperative journals: 《计算机应用研究》
Abstract： Convergence is an important index for evaluating the performance of information propagation algorithms. When the information propagation algorithm solves the satisfiability problem, the structural characteristics of the proposition formula affect the convergence of the algorithm, propositional formulas with complex structures do not always converge on information propagation algorithms. For this phenomenon, there are few systematic theoretical explanations. As the basic model of the information propagation algorithm, the warning propagation algorithm (WP) , analyzing the convergence of the WP algorithm is of great significance to study the convergence of other information propagation algorithms. With the help of structural entropy methods and techniques, people proposed a structural entropy model of propositional formula and its measurement method. This paper calculated the structural entropy of a random satisfiability instance, analyze the relationship between the convergence of the WP algorithm and the structural entropy, and give the judgment condition of convergence of WP algorithm. Through experimental analysis, this method is effective and feasible.
Subjects: Computer Science >> Integration Theory of Computer Science submitted time 2019-04-01 Cooperative journals: 《计算机应用研究》
Abstract： It is very effective when the message passing algorithm solves the satisfiability problem, while the most basic message passing algorithm is the warning propagation (WP) algorithm. Through the analysis of the mathematical principle of WP algorithm, it could be found that the partial variables determined by high probability are closely related to the backbone set and backdoor set of the formula. For the study of the convergence of WP-solvable formula and WP algorithm, WP-solvable formula was defined based on backbone set and backdoor set, and by using the G(n, 3, m) model and the planted distribution model to prove the convergence of the WP algorithm, the necessary and sufficient conditions for the convergence of the algorithm are given. Finally, by carrying out the numerical experiments on the model of the planted distribution formula, The results show that if a satisfiability formula WP-solvable formula, if and only if the WP algorithm has a high probability of convergence.
Hits
Hits
Downloads
Comment