检索结果-内蒙古大学图书馆

What are the differences in yield formation among two cucumber (Cucumis sativus L.) cultivars and their F1 hybrid?

Journal of Integrative Agriculture 2020年第7期19卷 1789-1801页

作者： WANG Xiu-juan KANG Meng-zhen FAN Xing-rong YANG Li-li ZHANG Bao-gui HUANG San-wen Philippe DE REFFYE WANG Fei-yue The State Key Laboratory of Management and Control for Cormplex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190P.R.China Bejjing Engineering Research Center of Intelligent Systems and Technology Institute of AutomationChinese Academy of SciencesBejing 100190P.R.China Innovation Center for Parallel Agriculture Qingdao Academy of Intelligent IndustriesQingdao 266109P.R.China School of Computer Science and Information Engineering Chongqing Technology and Business UniversityChongqing 400067P.R.China College of Information and Electrical Engineering China Agricultural UniversityBeijing 100083P.R.China College of Land Science and Technology China Agricultural UniversityBeijing 100193P.R.China Agricultural Genomes Institute at Shenzhen Chinese Academy of Agricultural SciencesShenzhen 518124P.R.China AMAP University MontpellierCIRADCNRSINRAIRDMontpellier 34000France The School of Computer and Control Engineering University of Chinese Academy of SciencesBeijing 100049P.R.China

To elucidate the mechanisms underlying the differences in yield formation among two parents(P1 and P2) and their F1 hybrid of cucumber, biomass production and whole source–sink dynamics were analyzed using a functional–structural plant model(FSPM) that simulates both the number and size of individual organs. Observations of plant development and organ biomass were recorded throughout the growth periods of the plants. The GreenLab Model was used to analyze the differences in fruit setting, organ expansion, biomass production and biomass allocation. The source–sink parameters were estimated from the experimental measurements. Moreover, a particle swarm optimization algorithm(PSO) was applied to analyze whether the fruit setting is related to the source–sink ratio. The results showed that the internal source–sink ratio increased in the vegetative stage and reached a peak until the first fruit setting. The high yield of hybrid F1 is the compound result of both fruit setting and the internal source–sink ratio. The optimization results also revealed that the incremental changes in fruit weight result from the increases in sink strength and proportion of plant biomass allocation for fruits. The model-aided analysis revealed that heterosis is a result of a delicate compromise between fruit setting and fruit sink strength. The organlevel model may provide a computational approach to define the target of breeding by combination with a genetic model.

关键词： cucumber biomass production functional-structural plant model source-sink ratio fruit-setting PSO heterosis

来源：评论

学校读者我要写书评

暂无评论

A Learning Convolutional Neural Network Approach for Network Robustness Prediction

arXiv

引用

arXiv 2022年

作者： Lou, Yang Wu, Ruizi Li, Junli Wang, Lin Li, Xiang Chen, Guanrong The Department of Computing and Decision Sciences Lingnan University Hong Kong The Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China The College of Computer Science Sichuan Normal University Chengdu610066 China The Department of Automation Shanghai Jiao Tong University Shanghai200240 China The Institute of Complex Networks and Intelligent Systems Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai201210 China The Department of Control Science and Engineering Tongji University Shanghai200240 China The Department of Electrical Engineering City University of Hong Kong Hong Kong

Network robustness is critical for various societal and industrial networks again malicious attacks. In particular, connectivity robustness and controllability robustness reflect how well a networked system can maintain its connectedness and controllability against destructive attacks, which can be quantified by a sequence of values that record the remaining connectivity and controllability of the network after a sequence of node- or edge-removal attacks. Traditionally, robustness is determined by attack simulations, which are computationally very time-consuming or even practically infeasible. In this paper, an improved method for network robustness prediction is developed based on learning feature representation using convolutional neural network (LFR-CNN). In this scheme, higher-dimensional network data are compressed to lower-dimensional representations, and then passed to a CNN to perform robustness prediction. Extensive experimental studies on both synthetic and real-world networks, both directed and undirected, demonstrate that 1) the proposed LFR-CNN performs better than other two state-of-the-art prediction methods, with significantly lower prediction errors;2) LFR-CNN is insensitive to the variation of the network size, which significantly extends its applicability;3) although LFR-CNN needs more time to perform feature learning, it can achieve accurate prediction faster than attack simulations;4) LFR-CNN not only can accurately predict network robustness, but also provides a good indicator for connectivity robustness, better than the classical spectral measures. © 2022, CC BY.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Comparison of Centralized and Decentralized Approaches in Cooperative Coverage Problems with Energy-Constrained Agents

Comparison of Centralized and Decentralized Approaches in Co...

引用

IEEE Conference on Decision and Control

作者： Xiangyu Meng Xinmiao Sun Christos G. Cassandras Kaiyuan Xu Division of Electrical and Computer Engineering Louisiana State University Baton Rouge LA USA School of Automation and Electrical Engineering Shunde Graduate School and Key Laboratory of Knowledge Automation for Industrial Processes University of Science and Technology Beijing China Division of Systems Engineering and Center for Information and Systems Engineering Boston University Brookline MA USA

ISBN: (数字)9781728174471

ISBN: (纸本)9781728174488

A multi-agent coverage problem is considered with energy-constrained agents. The objective of this paper is to compare the coverage performance between centralized and decentralized approaches. To this end, a near-optimal centralized coverage control method is developed under energy depletion and repletion constraints. The optimal coverage formation corresponds to the locations of agents where the coverage performance is maximized. The optimal charging formation corresponds to the locations of agents with one agent fixed at the charging station and the remaining agents maximizing the coverage performance. We control the behavior of this cooperative multi-agent system by switching between the optimal coverage formation and the optimal charging formation. Finally, the optimal dwell times at coverage locations, charging time, and agent trajectories are determined so as to maximize coverage over a given time interval. In particular, our controller guarantees that at any time there is at most one agent leaving the team for energy repletion.

关键词： Charging stations Transient analysis Switches Space missions Task analysis Synchronization Sensors

来源：评论

学校读者我要写书评

暂无评论

A Multilevel Intelligent Assistant for Multilevel Social Network Analysis

A Multilevel Intelligent Assistant for Multilevel Social Net...

引用

International IEEE Conference on Intelligent systems, IS

作者： Man Tianxing Nataly Zhukova Georgi Tsochev ITMO University St. Petersburg Russia Laboratory of Computer-Information Systems and Software Engineering St. Petersburg Institute for Informatics and Automation of the Russian Academy of Sciences St. Petersburg Russia Laboratory of Telematics Bulgarian Academy of Sciences Sofia Bulgaria

ISBN: (数字)9781728154565

ISBN: (纸本)9781728154572

In recent years, social network data analysis is an emerging field. Multilevel social network analysis could help researchers to figure out comprehensive influencing factors. But the raw data extracted from life is complicated and inoperable so that the entire analysis process is multi-step and changeable. The characteristics of social network datasets at different levels are diverse. There is no general data analysis algorithms for each level. The characteristics of the data and the requirements of the task are important basis for choosing suitable analysis methods. But it is hard for non-expert researchers. This paper proposes an intelligent multilevel assistant for multilevel social network analysis and implements it based on ontology technology. Algorithms at different levels process the corresponding data forms until the appropriate output model is generated. The use of ontology technology makes this framework extensible and understandable. Such a framework is significant for non-experts.

关键词： Social network services Ontologies Machine learning algorithms Data mining Data analysis Task analysis

来源：评论

学校读者我要写书评

暂无评论

Embodied cognitive intelligence guided Moon sample collection

引用

The Innovation 2025年

作者： Chunjie Zhang Chuankai Liu Shaohua Duan Xiaolong Zheng Tianyi Yu Jitao Zhang Institute of Information Science School of Computer Science and Technology Beijing Jiaotong University Beijing 100044 China Visual Intellgence+X International Cooperation Joint Laboratory of MOE School of Computer Science and Technology Beijing Jiaotong University Beijing 100044 China Beijing Aerospace Control Center Beijing 100190 China State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing 100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing 100190 China

来源：评论

学校读者我要写书评

暂无评论

Hyperchaos on the dynamics of memristive Tabu learning neuron model under influence of electromagnetic radiation: Application in biomedical data privacy

Franklin Open

引用

Franklin Open 2025年 10卷

作者： Boya, Bertrand Frederick Boui A Kengne, Jacques Nanfak, Arnaud Muni, Sishu Shankar Nkapkop, Jean de Dieu Kenmoe, Germaine Djuidje Babenko, Lyudmila Klimentyevna Unité de Recherche d'Automatique et d'Informatique Appliquée (UR-AIA) IUT-FV Bandjoun University of Dschang Bandjoun P.O. Box 134 Cameroon Laboratory of Energy-Electric and Electronic Systems Department of Physics Faculty of Science University of Yaoundé I Yaoundé P.O. Box 812 Cameroon Department of Physics Faculty of Science University of Yaoundé 1 Yaoundé Cameroon Institute of Computer Technology and Information Security Southern Federal University P.O. Box 347922 Taganrog Russian Federation Laboratory for electronics electrical engineering automation and telecommunications National Higher Polytechnic School of Douala University of Douala Douala PO Box 2701 Cameroon School of Digital Sciences Digital University Kerala Technocity campus Kerala Mangalapuram India Indian Institute of Information Technology and Management Kerala Technopark road Kerala India Department of Electrical Engineering and Industrial Computing University Institute of Technology Douala P.O. Box 8698 Cameroon

This paper presents a novel biological neural networks based on memristive Tabu learning neuron (MTLN) model influenced by electromagnetic radiation. Despite the model having an unstable equilibrium plane, numerical investigation without the influence of electromagnetic radiation reveal that when increasing the memristor strength induces complex phenomena, including the coexistence of infinite bubbles of bifurcations, offset plane coexistence of various attractors. Furthermore, electromagnetic radiation can significantly impact the system's behavior, giving rise to hyperchaotic dynamics. A decent understanding is seen between the mathematical outcomes, approved through trial execution on an Arduino microcontroller-based. The insights gained from neural dynamics could pave the way for applications in neuromorphic computing, engineering, and brain-machine interfaces. Based on the complex dynamics of the model, a data privacy of biomedical data has been build and reveals good results, and enable to resist to robust attacks. © 2024 The Author(s)

关键词： Data privacy Electromagnetic radiation Hyperchaos Microcontroller design MTLN model Offset plane coexisting behaviors

来源：评论

学校读者我要写书评

暂无评论

Neural Dynamic Fault-Tolerant Scheme for Collaborative Motion Planning of Dual-Redundant Robot Manipulators

引用

IEEE Transactions on Neural Networks and Learning systems 2024年第6期PP卷 11189-11201页

作者： Zhang, Zhijun Cao, Zhongwen Li, Xingru School of Automation Science and Engineering South China University of Technology Guangzhou China Key Library of Autonomous Systems and Network Control Ministry of Education Guangzhou China Institute for Super Robotics (Huangpu) Guangzhou China Jiangxi Thousand Talents Plan Nanchang University Nanchang China College of Computer Science and Engineering Jishou University Jishou China Guangdong Artificial Intelligence and Digital Economy Laboratory (Pazhou Laboratory) Guangzhou China Shaanxi Provincial Key Laboratory of Industrial Automation School of Mechanical Engineering Shaanxi University of Technology Hanzhong China School of Information Science and Engineering Changsha Normal University Changsha China Institute of Artificial Intelligence and Automation Guangdong University of Petrochemical Technology Maoming China

To avoid the task failure caused by joint breakdown during the collaborative motion planning of dual-redundant robot manipulators, a neural dynamic fault-tolerant (NDFT) scheme is proposed and applied. To do so, a joint fault-tolerant strategy is first designed, and it is formulated as a time-varying equality constraint. Second, combining the robot position and orientation control, joint limit constraint, joint fault-tolerant equality constraint, and considering the repetitive motion optimization criterion, a fault-tolerant framework for the dual-redundant robot manipulators based on quadratic programming (QP) is constructed. Then, a varying-parameter recurrent neural network (VP-RNN) is designed to solve the QP issue. The fault-tolerant framework and the VP-RNN constitute NDFT scheme. With the NDFT scheme, the impact of faulty joints on the whole system can be remedied by healthy joints, thereby the end-effectors of the robot can complete the given end-effector task. Finally, computer simulations and physical experiments are implemented to verify the availability, physical realizability, and accuracy of the proposed NDFT scheme in the collaborative execution of end-effector tasks. Comparative experimental results with conventional repetitive motion planning schemes based on neural networks show higher accuracy and smaller joint angle *** avoid the task failure caused by joint breakdown during the collaborative motion planning of dual-redundant robot manipulators, a neural dynamic fault-tolerant (NDFT) scheme is proposed and applied. To do so, a joint fault-tolerant strategy is first designed, and it is formulated as a time-varying equality constraint. Second, combining the robot position and orientation control, joint limit constraint, joint fault-tolerant equality constraint, and considering the repetitive motion optimization criterion, a fault-tolerant framework for the dual-redundant robot manipulators based on quadratic programming (QP) is constructed. The

关键词： Manipulators Robots Fault tolerant systems Fault tolerance End effectors Planning Kinematics Manipulator dynamics Jacobian matrices Collaboration

来源：评论

学校读者我要写书评

暂无评论

Adjacency Constraint for Efficient Hierarchical Reinforcement Learning

arXiv

引用

arXiv 2021年

作者： Zhang, Tianren Guo, Shangqi Tan, Tian Hu, Xiaolin Chen, Feng The Department of Automation Tsinghua University Beijing100086 China The Beijing Innovation Center for Future Chip Beijing100086 China The LSBDPA Beijing Key Laboratory Beijing100084 China The Department of Civil and Environmental Engineering Stanford University Stanford CA94305 United States The Department of Computer Science and Technology Institute for Artificial Intelligence Beijing National Research Center for Information Science and Technology State Key Laboratory of Intelligent Technology and Systems Tsinghua University Beijing100084 China

Goal-conditioned Hierarchical Reinforcement Learning (HRL) is a promising approach for scaling up reinforcement learning (RL) techniques. However, it often suffers from training inefficiency as the action space of the high-level, i.e., the goal space, is large. Searching in a large goal space poses difficulty for both high-level subgoal generation and low-level policy learning. In this paper, we show that this problem can be effectively alleviated by restricting the high-level action space from the whole goal space to a k-step adjacent region of the current state using an adjacency constraint. We theoretically prove that in a deterministic Markov Decision Process (MDP), the proposed adjacency constraint preserves the optimal hierarchical policy, while in a stochastic MDP the adjacency constraint induces a bounded state-value suboptimality determined by the MDP’s transition structure. We further show that this constraint can be practically implemented by training an adjacency network that can discriminate between adjacent and non-adjacent subgoals. Experimental results on discrete and continuous control tasks including challenging simulated robot locomotion and manipulation tasks show that incorporating the adjacency constraint significantly boosts the performance of state-of-the-art goal-conditioned HRL approaches. Copyright © 2021, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Generating adjacency-constrained subgoals in hierarchical reinforcement learning 20

Generating adjacency-constrained subgoals in hierarchical re...

引用

Proceedings of the 34th International Conference on Neural information Processing systems

作者： Tianren Zhang Shangqi Guo Tian Tan Xiaolin Hu Feng Chen Department of Automation Tsinghua University Department of Civil and Environmental Engineering Stanford University Department of Computer Science and Technology Tsinghua University and Beijing National Research Center for Information Science and Technology and State Key Laboratory of Intelligent Technology and Systems Department of Automation Tsinghua University and Beijing Innovation Center for Future Chip and LSBDPA Beijing Key Laboratory

ISBN: (纸本)9781713829546

Goal-conditioned hierarchical reinforcement learning (HRL) is a promising approach for scaling up reinforcement learning (RL) techniques. However, it often suffers from training inefficiency as the action space of the high-level, i.e., the goal space, is often large. Searching in a large goal space poses difficulties for both high-level subgoal generation and low-level policy learning. In this paper, we show that this problem can be effectively alleviated by restricting the high-level action space from the whole goal space to a k-step adjacent region of the current state using an adjacency constraint. We theoretically prove that the proposed adjacency constraint preserves the optimal hierarchical policy in deterministic MDPs, and show that this constraint can be practically implemented by training an adjacency network that can discriminate between adjacent and non-adjacent subgoals. Experimental results on discrete and continuous control tasks show that incorporating the adjacency constraint improves the performance of state-of-the-art HRL approaches in both deterministic and stochastic environments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Selecting of global phenological field observations for validating coarse AVHRR-derived forest phenology products based on spatial heterogeneity and temporal consistency

引用

Ecological Informatics 2025年 90卷

作者： Qi Shao Chao Huang Yuanjun Xiao Li Liu Weiwei Liu Ran Huang Chang Zhou Wei Weng Jingfeng Huang Key Laboratory of Environmental Remediation and Ecological Health Ministry of Education Zhejiang University Hangzhou 310058 China State Key Laboratory of Soil Pollution Control and Safety Zhejiang University Hangzhou 310058 China Institute of Applied Remote Sensing and Information Technology Zhejiang University Hangzhou 310058 China Key Laboratory of Agricultural Remote Sensing and Information Systems Hangzhou 310058 China Key Laboratory of National Forestry and Grassland Administration on Forest Ecosystem Protection and Restoration of Poyang Lake Watershed College of Forestry Jiangxi Agricultural University Nanchang 330045 China Hubei Key Laboratory of Intelligent Vision Based Monitoring for Hydroelectric Engineering College of Computer and Information Technology China Three Gorges University Yichang 443002 China Department of Geography and Spatial Information Techniques Ningbo University Ningbo 315211 China School of Automation Hangzhou Dianzi University Xiasha Higher Education Zone Hangzhou 310058 China

Global phenological field observations play a crucial role in validating remote sensing products and algorithms. However, due to the spatial mismatch and scale effect between the field observations and the pixels of remote sensing phenology products, a direct comparison often leads to scale errors and increased uncertainty. Therefore, evaluating the spatial representativeness of field observations for remote sensing product validation is essential. This study developed a novel “bottom-up” evaluation framework named MSPT ( M ain land cover type, S patial heterogeneity, P oint-area consistency and T emporal consistency), which comprehensively assesses the spatial representativeness of forest phenological field observations within the coarse spatial scale. Based on MSPT method, the capability of global forest phenological field observations to support coarse-scale remote sensing validation was evaluated. Compared with the general method, MSPT significantly improved validation performance. For the start of the growing season (SOS), the root mean square error (RMSE) decreased from 49.70 to 33.75 days, and the percent bias (PBIAS) changed from −0.14 to 0.03. For the end of the growing season (EOS), the RMSE was reduced from 83.42 to 42.53 days, and the PBIAS decreased from 0.15 to 0.08. These findings demonstrate that MSPT enhances the reliability of validation datasets and effectively reducing uncertainty in the evaluation of coarse AVHRR-derived forest phenology products. The framework offers new insights into resolving the scale mismatch between field observations and the pixels of remote sensing products.

关键词： Forest phenology Field observations Spatial representativeness Spatial mismatch Satellite product AVHRR Advanced Very High Resolution Radiometer CERN Chinese Ecosystem Research Network CNW Canada nature watch DBF Deciduous Broadleaf Forests DOY Date of year EBF Evergreen Broadleaf Forests ENF Evergreen Needleleaf Forest EOS The end of the growing season GEE Google Earth Engine GPP Gross primary productivity HBEF Hubbard Brook Experimental Forest HF Harvard Forest IPS Instantaneous Phase Synchrony MAD Mean Absolute Deviation MCD12Q1 MODIS Collection 6.1 (C61) Land Cover Type Product MF Mixed Forests MIPS Mean Instantaneous phase synchrony MLCTP Main Land Cover Type Proportion MSPT Main land cover type - Spatial heterogeneity - Point-area consistency - Temporal consistency NC Nature's Calendar PBIAS Percent bias PEP725 Pan European Phenology Project RAE Relative absolute error RMSE Root mean square error sd standard deviation SOS The start of the growing season USA-NPN USA National Phenology Network VIPPHEN Vegetation Index and Phenology (VIP) Phenology Dataset WI Willmott's Index of Agreement

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：