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

arXiv 2024年

作者： Lu, Yao Zhu, Yutao Li, Yuqi Xu, Dongwei Lin, Yun Xuan, Qi Yang, Xiaoniu The Institute of Cyberspace Security College of Information Engineering Zhejiang University of Technology Hangzhou China The Binjiang Institute of Artificial Intelligence Zhejiang University of Technology Hangzhou310056 China The Institute of Computing Technology Chinese Academy of Sciences Beijing China The College of Information and Communication Engineering Harbin Engineering University Harbin China The PCL Research Center of Networks and Communications Peng Cheng Laboratory Shenzhen518000 China Utron Technology Company Ltd. Hangzhou310056 China The Science and Technology on Communication Information Security Control Laboratory Jiaxing China

—With the successful application of deep learning in communications systems, deep neural networks are becoming the preferred method for signal classification. Although these models yield impressive results, they often come with high computational complexity and large model sizes, which hinders their practical deployment in communication systems. To address this challenge, we propose a novel layer pruning method. Specifically, we decompose the model into several consecutive blocks, each containing consecutive layers with similar semantics. Then, we identify layers that need to be preserved within each block based on their contribution. Finally, we reassemble the pruned blocks and fine-tune the compact model. Extensive experiments on five datasets demonstrate the efficiency and effectiveness of our method over a variety of state-of-the-art baselines, including layer pruning and channel pruning methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Nonmonotonic propositional logic

引用

Frontiers of Computer Science 2021年第3期15卷 215-216页

作者： Wei LI Yuefei SUI Yuhui WANG State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China School of Computer and Control Engineering University of Chinese Academy of SciencesBeijing 100049China Information Technology Center China Reinsurance(Group)CorporationBeijing 100033China

Propositional logic[1]is basic,based on which other logics are *** deduction system for propositional logic is *** logics are a class of logics which deduction systems are *** ones are default logic[2,3],R-calculus[4]... 详细信息

关键词： default propositional Nonmonotonic

来源：评论

学校读者我要写书评

暂无评论

Path Planning of Mobile Robot Based on an Improved Genetic Algorithm 2

Path Planning of Mobile Robot Based on an Improved Genetic A...

引用

2nd IEEE International Conference on Digital Twins and Parallel Intelligence, DTPI 2022

作者： Chen, Zenghua Xiong, Gang Liu, Sheng Shen, Zhen Li, Yue Institute of Automation Chinese Academy of Sciences State Key Laboratory for Management and Control of Complex Systems Beijing China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China Guangdong Engineering Research Center of 3D Printing and Intelligent Manufacturing Cloud Computing Center Chinese Academy of Sciences Dongguan China Chang'an University School of Automobile Xi'an China

ISBN: (纸本)9781665492270

In order to solve the problem of premature convergence of the basic genetic algorithm when planning the robot running path, the basic genetic algorithm is improved and optimized. Different population initialization methods are used to initialize multiple populations randomly, so as to improve the diversity of populations;Improve the adaptive strategy and elite strategy of crossover and mutation operators to improve the convergence speed of the algorithm;Add the path tortuosity as the planning index in the fitness function to make the planned path smoother, and add constraints to the model to avoid obstacles;Finally, through the transformation of the coding paradigm of the above improved genetic algorithm, it can run on Flink distributed cluster to obtain faster solution speed, so as to meet the efficiency requirements of path planning in large-scale robot cluster system. The optimized algorithm is compared with the basic genetic algorithm. The simulation results show that the improved algorithm is efficient in robot path planning. © 2022 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Label Cluster Chains for Multi-Label Classification

arXiv

引用

arXiv 2024年

作者： Gatto, Elaine Cecília Nakano, Felipe Kenji Read, Jesse Ferrandin, Mauri Cerri, Ricardo Vens, Celine Department of Computer Science Federal University of São Carlos SP São Carlos13565-905 Brazil Faculty of Medicine Katholieke Universiteit Leuven West Flanders Kortrijk8500 Belgium École Polytechnique Polytechnic Institute of Paris Palaiseau Paris91120 France Department of Control Automation and Computing Engineering Federal University of Santa Catarina SC Blumenau89036-002 Brazil Institute of Mathematical and Computing Sciences University of São Paulo SP São Carlos13566-590 Brazil

Multi-label classification is a type of supervised machine learning that can simultaneously assign multiple labels to an instance. To solve this task, some methods divide the original problem into several sub-problems (local approach), others learn all labels at once (global approach), and others combine several classifiers (ensemble approach). Regardless of the approach used, exploring and learning label correlations is important to improve the classifier predictions. Ensemble of Classifier Chains (ECC) is a well-known multi-label method that considers label correlations and can achieve good overall performance on several multi-label datasets and evaluation measures. However, one of the challenges when working with ECC is the high dimensionality of the label space, which can impose limitations for fully-cascaded chains as the complexity increases regarding feature space expansion. To improve classifier chains, we propose a method to chain disjoint correlated label clusters obtained by applying a partition method in the label space. During the training phase, the ground truth labels of each cluster are used as new features for all of the following clusters. During the test phase, the predicted labels of clusters are used as new features for all the following clusters. Our proposal, called Label Cluster Chains for Multi-Label Classification (LCC-ML), uses multi-label Random Forests as base classifiers in each cluster, combining their predictions to obtain a final multi-label classification. Our proposal obtained better results compared to the original ECC. This shows that learning and chaining disjoint correlated label clusters can better explore and learn label correlations. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributed Malicious Maneuvering Target Tracking Algorithm With Finite-Time Fusion Analysis

Distributed Malicious Maneuvering Target Tracking Algorithm ...

引用

Chinese control Conference (CCC)

作者： Zheng Zhang Dong Guo Hongwei Zheng Hong Wang Qingdong Li Xiwang Dong Zhang Ren Science and Technology on Aircraft Control Laboratory School of Automation Science and Electrical Engineering Beihang University Beijing P.R. China China Academic of Launch Vehicle Technology Beijing P.R. china Beijing Academy of Blockchain and Edge Computing Beijing P.R. china Beijing Institute of Control Engineering Beijing P.R. China Institute of Artificial Intelligence Beihang University Beijing P.R. China

This paper proposes a distributed tracking framework for high-maneuvering and malicious maneuvering target based on the sensor network. Considering some of sensors in the network can only observe partial system output, the collective observability is guaranteed. Based on the collective observability, the distributed target tracking algorithm is designed by local filter phase and consensus fusion phase. In local filter phase, the local estimate results can be obtained by each sensor node. Based on the target kinematic and sensor observation equations, the Kalman-like estimation algorithm is proposed to obtain the local estimate results. In most of the exist distributed state estimation (DSE) algorithms, the excellent target tracking performance is based on the assumption that the fusion times is infinity in consensus fusion phase. In practical application, however, the consensus fusion phase should be completed during two sampling instants. Besides, based on the finite-time stability theory, the error covariance matrix is processed as the solution of discrete-time algebraic Riccati equation (DARE). Then the stability of the proposed algorithm with finite-time consensus fusion is analyzed. Finally, a numerical example for tracking maneuvering target is given to validate the effectiveness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Condition Monitoring of Machinery: A Case Study 6

Condition Monitoring of Machinery: A Case Study

引用

6th IEEE International Conference on Signal Processing, computing and control, ISPCC 2021

作者： Samant, Piyush Bhushan, Megha Kumar, Ashok Arya, Resham Tiwari, Sharad Bansal, Sakshi Chandigarh University AIT-CSE Apex Gharuan Punjab Mohali India DIT University School Of Computing Dehradun India Institute Of Engineering And Technology Chitkara University Punjab India Vignan Foundation Of Science And Technology Andra Pradesh India NIT Silchar Instrumentation And Control Engineering Department Assam India

ISBN: (纸本)9781665425520

Condition monitoring is a cutting-edge method in machine maintenance that analyzes the performance of machines on the basis of data gathered from sensors that have previously been placed on the machines themselves. The parameters of the machines are examined to see whether there is a significant change that indicates the presence of a defect in the manufacturing process. This constitutes a major portion of precognitive support. Plants and equipment have failed in the past, and this article seeks to determine why this has happened. Within a typical plant, monitoring frameworks and condition checking are coordinated in order to increase the plant and equipment observing frameworks. Observational apparatuses of the nature of the conditions used in the temperature, vibration, spillage, consumption, and splitting screens have been installed and are being used. © 2021 IEEE.

关键词： Condition monitoring

来源：评论

学校读者我要写书评

暂无评论

Full life-cycle cost model for practical application of solar energy system

引用

Energy Informatics 2025年第1期8卷

作者： Sha, Ang Xiong, Zhen Zang, Xiaolin Zhao, Wei Ge, Ruibang Yao, Wanxiang Aiello, Marco Innovation Institute for Sustainable Maritime Architecture Research and Technology Qingdao University of Technology Qingdao266033 China School of Architecture and Urban Planning Qingdao University of Technology Qingdao266033 China School of Information and Control Engineering Qingdao University of Technology Qingdao266520 China School of Continuing Education Qingdao University of Technology Qingdao266033 China Service Computing Department Institute of Architecture of Application Systems University of Stuttgart Universitätsstraße 38 Stuttgart70569 Germany

In pursuit of carbon neutrality, a swift transformation is underway in the global energy structure, marked by a consistent rise in the installed capacity of solar energy systems. Meanwhile, the substantial reduction of government subsidies in the solar industry intensifies focus on the economic viability of solar energy installations. In this study, we propose a full life-cycle cost model, named the F-LCC model, for calculating the cost of the solar energy system on the long term, e.g., 20–30 years. This model integrates replacement costs, residual value calculation, interest rate, and inflation impacts while supporting market price estimation for individual components, thereby aiding feasibility analysis in the early project phase. We design an investment cost recovery algorithm based on the F-LCC model to calculate the break-even electricity price for solar energy system. Moreover, we analyze component cost distributions, Net Present Value (NPV), and Discounted Payback Period (DPP) for grid-connected and off-grid solar energy systems with capacities of 10 kWp and 100 kWp in the Chinese market. The results show that the proposed model, compared to other models, captures the fact that payback times are longer. In a solar energy system without storage, solar panels have the highest component cost share at 28.8%. With battery storage, batteries dominate the total cost, reaching up to 74.6%. And the the grid-connected systems DPP ranging from a minimum of 5.5 to a maximum of 7.0 years by grid-connected electricity price, while off-grid systems require at least 19.9 years. The 10 kWp off-grid fixed mounting system’s break-even price being 137.1% higher than its grid-connected counterpart. In addition, tracking-mount systems offer greater cost-reduction potential than fixed installations, with the payback period reduced by 20% for 100 kWp grid-connected systems and 15% for off-grid systems. Finally, we develop a plugin based on the F-LCC model. These findings deepen unde

关键词： Commerce

来源：评论

学校读者我要写书评

暂无评论

A Novel Deep Learning Approach Featuring Graph-Based Algorithm for Cell Segmentation and Tracking

A Novel Deep Learning Approach Featuring Graph-Based Algorit...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Zhao, Keliang Niyogisubizo, Jovial Xiao, Linxia Pan, Yi Wei, Dongqing Rosiyadi, Didi Wei, Yanjie Chinese Academy of Sciences Shenzhen Key Laboratory of Intelligent Bioinformatics and Center for High Performance Computing Shenzhen Institute of Advanced Technology Shenzhen518055 China Chinese Academy of Sciences College of Computer Science and Control Engineering Shenzhen Institutes of Advanced Technology Shenzhen518055 China Shanghai Jiao Tong University State Key Laboratory of Microbial Metabolism School of Life Sciences and Biotechnology Shanghai200240 China National Research and Innovation Agency Research Center for Artificial Intelligence and Cybersecurity Bandung Indonesia

ISBN: (纸本)9798350337488

The precise segmentation and tracking of cells in microscopy image sequences play a pivotal role in biomedical research, facilitating the study of tissue, organ, and organism development. However, manual segmentation and tracking of cells is time-consuming and often require professional experiences. Besides, segmenting cells in the images with a low signal-to-noise ratio remains difficult. While deep learning (DL) has become a common method for cell segmentation, few DL- based methods address concurrent cell segmentation and tracking. In this paper, we propose a novel DL approach featuring graph-based tracking for cell segmentation and tracking in microscopy images. We combine Deeplabv3+ for semantic segmentation and ResNet50 for enhanced feature extraction, enabling comprehensive cell detection and instance segmentation. Post-processing, involving non-maxima suppression and outlier detection, refines predictions and produces final segmentation. The tracking method is based on the relative position of graph nodes to track segmented cells, encompassing cell division and apoptosis. We conduct our experiments on the induced pluripotent stem (iPS) cell datasets, and the results show that the segmentation and tracking performance of our method yields superior performance compared to the benchmark models. More specifically, our approach achieved DET values of 0.955 and 0.913, TRA values of 0.951 and 0.906, and SEG values of 0.690 and 0.665 on two iPS dataset videos, respectively. Additionally, the performance assessment encompasses four real microscopy datasets from the Cell Tracking Challenge (CTC). Our method greatly reduces the cost of manual labeling and labor-intensive costs. © 2023 IEEE.

关键词： cell segmentation cell tracking deep learning Deeplabv3+ instance segmentation iPS cell reprogramming

来源：评论

学校读者我要写书评

暂无评论

Optimal Minimum Energy Path Planning of Mobile Robot Based on Improved WOA-GA with Hybrid Strategy for Community-Centric Application

Optimal Minimum Energy Path Planning of Mobile Robot Based o...

引用

2023 International Conference on Machine Learning and Cybernetics, ICMLC 2023

作者： Du, Jiang Da-Lin, Zhou Gong-Fa, Li Bao-Li, Lu Jun-Tong, Yun Ying, Liu Wuhan University of Science and Technology Key Laboratory of Metallurgical Equipment and Control Technology Ministry of Education Wuhan430081 China School of Computing University of Portsmouth PortsmouthPO1 3HE United Kingdom China Three Gorges University Hubei Key Laboratory of Hydroelectric Machinery Design & Maintenance Yichang443002 China Wuhan University of Science and Technology Key Laboratory of Mechanical Transmission and Manufacturing Engineering of Hubei Province Wuhan430081 China Precision Manufacturing Research Institute Wuhan University of Science and Technology Wuhan430081 China Institute of Semiconductors Chinese Academy of Sciences Beijing100083 China Research Center for Biomimetic Robot and Intelligent Measurement and Control Wuhan University of Science and Technology Wuhan430081 China

ISBN: (纸本)9798350303780

The path planning of mobile robots is investigated to minimize energy loss in intelligent manufacturing. To achieve optimal energy consumption planning, this paper proposes a hybrid strategy that enhances the whale optimization algorithm (WOA) and the genetic algorithm (GA). The WOA-GA algorithm combines their respective advantages and effectively mitigates premature convergence exhibited by the standard traditional algorithm. To enhance the global and local search capabilities of the standard WOA, we employ adaptive weighting and a Cauchy mutation strategy. Additionally, we introduce an adaptive crossover mutation probability and an elite strategy to mitigate the detrimental effects of the genetic algorithm's evolutionary operation in the late iterations, thereby improving its performance. This paper compares the performance of the standard GA, the standard WOA-GA algorithm, and the enhanced WOA-GA algorithm. The experimental results demonstrate that the enhanced WOA-GA algorithm can achieve optimal energy-efficient path planning using the hybrid strategy. The average energy consumption of the enhanced WOA-GA algorithm can be reduced by 30%, while the maximum energy consumption can be reduced by 47%. The results confirm the effectiveness and feasibility of the proposed method in enhancing the level of green manufacturing. © 2023 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Distributed Charging Coordination for Electric Trucks under Limited Facilities and Travel Uncertainties

arXiv

引用

arXiv 2024年

作者： Bai, Ting Li, Yuchao Malikopoulos, Andreas A. Johansson, Karl Henrik Mårtensson, Jonas Integrated Transport Research Lab The Division of Decision and Control Systems The Digital Futures KTH Royal Institute of Technology StockholmSE-10044 Sweden School of Computing and Augmented Intelligence Arizona State University TempeAZ-85281 United States School of Civil and Environmental Engineering Cornell University IthacaNY-14853 United States

In this work, we address the problem of charging coordination between electric trucks and charging stations. The problem arises from the tension between the trucks’ nontrivial charging times and the stations’ limited charging facilities. Our goal is to reduce the trucks’ waiting times at the stations while minimizing individual trucks’ operational costs. We propose a distributed coordination framework that relies on computation and communication between the stations and the trucks, and handles uncertainties in travel times and energy consumption. Within the framework, the stations assign a limited number of charging ports to trucks according to the first-come, first-served rule. In addition, each station constructs a waiting time forecast model based on its historical data and provides its estimated waiting times to trucks upon request. When approaching a station, a truck sends its arrival time and estimated arrival-time windows to the nearby station and the distant stations, respectively. The truck then receives the estimated waiting times from these stations in response, and updates its charging plan accordingly while accounting for travel uncertainties. We performed simulation studies for 1, 000 trucks traversing the Swedish road network for 40 days, using realistic traffic data with travel uncertainties. The results show that our method reduces the average waiting time of the trucks by 46.1% compared to offline charging plans computed by the trucks without coordination and update, and by 33.8% compared to the coordination scheme assuming zero waiting times at distant stations. Copyright © 2024, The Authors. All rights reserved.

关键词： Trucks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：