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

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

来源：评论

学校读者我要写书评

暂无评论

Exact Differentiator with Lipschitz Continuous Output and Optimal Worst-Case Accuracy Under Bounded Noise

Exact Differentiator with Lipschitz Continuous Output and Op...

引用

IEEE Conference on Decision and control

作者： Rodrigo Aldana-López Richard Seeber Hernan Haimovich David Gómez-Gutiérrez Department of Computer Science and Systems Engineering University of Zaragoza Zaragoza Spain Christian Doppler Laboratory for Model Based Control of Complex Test Bed Systems Institute of Automation and Control Graz University of Technology Graz Austria Centro Internacional Franco-Argentino de Ciencias de la Información y de Sistemas (CIFASIS) CONICET-UNR Rosario Argentina Intel Tecnología de México Intel Labs Intelligent Systems Research Lab Jalisco Mexico Tecnológico Nacional de México Instituto Tecnológico José Mario Molina Pasquel y Henríquez Unidad Académica Zapopan Jalisco Mexico

The online differentiation of a signal contaminated with bounded noise is addressed. A differentiator is developed that generates a Lipschitz continuous output, is exact in the absence of noise, and provides the optimal worst-case accuracy among all possible exact differentiators when noise is present. This combination of features is not shared by any previously existing differentiator. Tuning of the developed differentiator is very simple, requiring only the knowledge of a bound for the second-order derivative of the signal. The approach consists in regularizing the possibly highly noisy output of a recently introduced linear adaptive robust exact differentiator and feeding it to a first-order sliding-mode filter designed to maintain optimal accuracy. The proposed regularization and filtering of this output allows trading the speed with which exactness is obtained for the feature of a Lipschitz continuous, hence less noisy, output. An illustrative example is provided to highlight the features of the developed differentiator.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TLogic: A Tangible Programming Tool to Help Children Solve Problems 12th

TLogic: A Tangible Programming Tool to Help Children Solve P...

引用

12th International Conference on e-Learning and Games, Edutainment 2018

作者： Deng, Xiaozhou Wang, Danli Jin, Qiao The State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783030237110

In this paper, we present TLogic, a tangible programming tool for children aged 6–8. The tool contains two parts: tangible programming blocks and visual tasks with different difficulty levels. Children could use tangible programming blocks to complete visual tasks shown on computer screen. To evaluate our tool, a user study was conducted with 10 children. Results of user study show that the tool could reduce children’s cognitive load while solving the tasks and children are more interested in challenging tasks than easy tasks in our tool. © 2019, Springer Nature Switzerland AG.

关键词： computer programming

来源：评论

学校读者我要写书评

暂无评论

Actuation attacks on constrained linear systems: a set-theoretic analysis

引用

IFAC-PapersOnLine 2020年第2期53卷 6963-6968页

作者： P.A. Trodden J.M. Maestre H. Ishii Department of Automatic Control & Systems Engineering University of Sheffield Sheffield UK Department of Systems and Automation Engineering University of Seville Seville Spain Department of Computer Science Tokyo Institute of TechnologyYokohama Japan

This paper considers a constrained discrete-time linear system subject to actuation attacks. The attacks are modelled as false data injections to the system, such that the total input (control input plus injection) satisfies hard input constraints. We establish a sufficient condition under which it is not possible to maintain the states of the system within a compact state constraint set for all possible realizations of the actuation attack. The developed condition is a simple function of the spectral radius of the system, the relative sizes of the input and state constraint sets, and the proportion of the input constraint set allowed to the attacker.

关键词： control problems under conflict or uncertainties Constrained control Robustness

来源：评论

学校读者我要写书评

暂无评论

JDSR-GAN: Constructing An Efficient Joint Learning Network for Masked Face Super-Resolution

arXiv

引用

arXiv 2021年

作者： Gao, Guangwei Tang, Lei Wu, Fei Lu, Huimin Yang, Jian The Institute of Advanced Technology Nanjing University of Posts and Telecommunications Nanjing China The Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou China The College of Automation Nanjing University of Posts and Telecommunications Nanjing China The Department of Mechanical and Control Engineering Kyushu Institute of Technology Kitakyushu804-8550 Japan The School of Computer Science and Technology Nanjing University of Science and Technology Nanjing China

With the growing importance of preventing the COVID-19 virus in cyber-manufacturing security, face images obtained in most video surveillance scenarios are usually low resolution together with mask occlusion. However, most of the previous face super-resolution solutions can not efficiently handle both tasks in one model. In this work, we consider both tasks simultaneously and construct an efficient joint learning network, called JDSR-GAN, for masked face super-resolution tasks. Given a low-quality face image with mask as input, the role of the generator composed of a denoising module and super-resolution module is to acquire a high-quality high-resolution face image. The discriminator utilizes some carefully designed loss functions to ensure the quality of the recovered face images. Moreover, we incorporate the identity information and attention mechanism into our network for feasible correlated feature expression and informative feature learning. By jointly performing denoising and face super-resolution, the two tasks can complement each other and attain promising performance. Extensive qualitative and quantitative results show the superiority of our proposed JDSR-GAN over some competitive methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Optimal CPU scheduling in data centers via a finite-time distributed quantized coordination mechanism

arXiv

引用

arXiv 2021年

作者： Rikos, Apostolos I. Grammenos, Andreas Kalyvianaki, Evangelia Hadjicostis, Christoforos N. Charalambous, Themistoklis Johansson, Karl H. Division of Decision and Control Systems KTH Royal Institute of Technology StockholmSE-100 44 Sweden Department of Computer Science and Technology University of Cambridge Cambridge United Kingdom Alan Turing Institute London United Kingdom Department of Electrical and Computer Engineering University of Cyprus Nicosia1678 Cyprus Department of Electrical Engineering and Automation School of Electrical Engineering Aalto University Espoo02150 Finland

In this paper we analyze the problem of optimal task scheduling for data centers. Given the available resources and tasks, we propose a fast distributed iterative algorithm which operates over a large scale network of nodes and allows each of the interconnected nodes to reach agreement to an optimal solution in a finite number of time steps. More specifically, the algorithm (i) is guaranteed to converge to the exact optimal scheduling plan in a finite number of time steps and, (ii) once the goal of task scheduling is achieved, it exhibits distributed stopping capabilities (i.e., it allows the nodes to distributely determine whether they can terminate the operation of the algorithm). Furthermore, the proposed algorithm operates exclusively with quantized values (i.e., the information stored, processed and exchanged between neighboring agents is subject to deterministic uniform quantization) and relies on event-driven updates (e.g., to reduce energy consumption, communication bandwidth, network congestion, and/or processor usage). We also provide examples to illustrate the operation, performance, and potential advantages of the proposed algorithm. Finally, by using extensive empirical evaluations through simulations we show that the proposed algorithm exhibits state-of-the-art performance. Copyright © 2021, The Authors. All rights reserved.

关键词： Multitasking

来源：评论

学校读者我要写书评

暂无评论

Category-oriented self-learning graph embedding for efficient image compact representation

TechRxiv

引用

TechRxiv 2021年

作者： Hu, Liangchen Dai, Zhenlei Tian, Lei Zhang, Wensheng The School of Computer and Information Anhui Normal University Wuhu241003 China The School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China The Research Center of Precision Sensing and Control Institute of Automation Chinese Academy of Sciences Beijing100190 China The School of Artificial Intelligence University of Chinese Academy of Sciences Beijing101408 China

As one of the ways to acquire efficient image compact representation, graph embedding (GE) based manifold learning has been widely developed over the last two decades. Good graph embedding depends on the construction of graphs concerning intra-class compactness and inter-class separability, which are crucial indicators of the effectiveness of a model in generating discriminative features. Unsupervised approaches are intended to reveal the data structure information from a local or global perspective, but the resulting compact representation often has poorly inter-class margins due to the lack of label information. Moreover, supervised techniques only consider enhancing the adjacency affinity within the class but excluding the affinity of different classes, which results in the inability to fully capture the marginal structure between distributions of different classes. To overcome these issues, we propose a learning framework that implements Category-Oriented Self-Learning Graph Embedding (COSLGE), in which we achieve a flexible low-dimensional compact representation by imposing an adaptive graph learning process across the entire data while examining the inter-class separability of low-dimensional embedding by jointly learning a linear classifier. Besides, our framework can easily be extended to the semi-supervised situation. Extensive experiments on several widely-used benchmark databases demonstrate the effectiveness of the proposed method comparing with some state-of-the-art approaches. © 2021, CC BY.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

CoProStory: A tangible programming tool for children’s collaboration 13

CoProStory: A tangible programming tool for children’s coll...

引用

13th International Conference on computer Supported Collaborative Learning - A Wide Lens: Combining Embodied, Enactive, Extended, and Embedded Learning in Collaborative Settings, CSCL 2019

ISBN: (纸本)9781732467231

In this paper, we present Co Pro Story, a collaborative tangible programming tool to support children learning programming. In recent years, many collaborative tangible programming tools were developed for children. Compared to the other tools, Sync Blocks which were designed to coordinate children’s programming were used in our tool. The tool consists of two parts: Tangible programming blocks and game tasks. Game tasks are provided with 3D cartoon story scenes on computer screen and need to be finished by collaborative programming with our programming blocks. To evaluate our tool, a contrast user study was conducted with 28 children aged 6 to 10. The results demonstrated that CoProStory could support children to program collaboratively and children had a more positive attitude toward programming with Sync Blocks. © ISLS.

关键词： computer games

来源：评论

学校读者我要写书评

暂无评论

End-to-end 2D-3D Registration between Image and LiDAR Point Cloud for Vehicle Localization

arXiv

引用

arXiv 2023年

作者： Wang, Guangming Zheng, Yu Guo, Yanfeng Liu, Zhe Zhu, Yixiang Burgard, Wolfram Wang, Hesheng Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China China Department of Artificial Intelligence Shanghai Jiao Tong University Shanghai200240 China Electrical and Computer Engineering University of California Los Angeles United States Institute of Artificial Intelligence Shanghai Jiao Tong University Shanghai200240 China Department of Electrical Engineering Shanghai Jiao Tong University Shanghai200240 China Department of Engineering University of Technology Nuremberg Germany

Robot localization using a previously built map is essential for a variety of tasks including highly accurate navigation and mobile manipulation. A popular approach to robot localization is based on image-to-point cloud registration, which combines illumination-invariant LiDAR-based mapping with economical image-based localization. However, the recent works for image-to-point cloud registration either divide the registration into separate modules or project the point cloud to the depth image to register the RGB and depth images. In this paper, we present I2PNet, a novel end-to-end 2D-3D registration network. I2PNet directly registers the raw 3D point cloud with the 2D RGB image using differential modules with a unique target. The 2D-3D cost volume module for differential 2D-3D association is proposed to bridge feature extraction and pose regression. 2D-3D cost volume module implicitly constructs the soft point-to-pixel correspondence on the intrinsic-independent normalized plane of the pinhole camera model. Moreover, we introduce an outlier mask prediction module to filter the outliers in the 2D-3D association before pose regression. Furthermore, we propose the coarse-to-fine 2D-3D registration architecture to increase localization accuracy. We conduct extensive localization experiments on the KITTI Odometry and nuScenes datasets. The results demonstrate that I2PNet outperforms the state-of-the-art by a large margin. In addition, I2PNet has a higher efficiency than the previous works and can perform the localization in real-time. Moreover, we extend the application of I2PNet to the camera-LiDAR online calibration and demonstrate that I2PNet outperforms recent approaches on the online calibration task. Copyright © 2023, The Authors. All rights reserved.

关键词： Calibration

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：