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

arXiv 2024年

作者： Ling, Zhaolong Peng, Honghui Zhang, Yiwen Zhou, Peng Wu, Xingyu Yu, Kui Wu, Xindong School of Computer Science and Technology Anhui University Anhui Hefei230601 China School of Hong Kong Polytechnic University Department of Computing 999077 Hong Kong Key Laboratory of Knowledge Engineering with Big Data the Ministry of Education of China China School of Computer Science and Information Technology Hefei University of Technology Hefei230009 China

Local causal discovery aims to learn and distinguish the direct causes and effects of a target variable from observed data. Existing constraint-based local causal discovery methods use AND or OR rules in constructing the local causal skeleton, but using either rule alone is prone to produce cascading errors in the learned local causal skeleton, and thus impacting the inference of local causal relationships. On the other hand, directly applying score-based global causal discovery methods to local causal discovery may randomly return incorrect results due to the existence of local equivalence classes. To address the above issues, we propose a Hybrid Local Causal Discovery algorithm, called HLCD. Specifically, HLCD initially utilizes a constraint-based approach combined with the OR rule to obtain a candidate skeleton and then employs a score-based method to eliminate redundant portions in the candidate skeleton. Furthermore, during the local causal orientation phase, HLCD distinguishes between V-structures and equivalence classes by comparing the local structure scores between the two, thereby avoiding orientation interference caused by local equivalence classes. We conducted extensive experiments with seven state-of-the-art competitors on 14 benchmark Bayesian network datasets, and the experimental results demonstrate that HLCD significantly outperforms existing local causal discovery algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep Feature Surgery: Towards Accurate and Efficient Multi-Exit Networks

arXiv

引用

arXiv 2024年

作者： Gong, Cheng Chen, Yao Luo, Qiuyang Lu, Ye Li, Tao Zhang, Yuzhi Sun, Yufei Zhang, Le College of Software Nankai University China College of Computer Science Nankai University China National University of Singapore Singapore School of Information and Communication Engineering University of Electronic Science and Technology of China China HAIHE Lab of ITAI China Tianjin Key Laboratory of Network and Data Security Technology China Key Laboratory of Data and Intelligent System Security Ministry of Education

Multi-exit network is a promising architecture for efficient model inference by sharing backbone networks and weights among multiple exits. However, the gradient conflict of the shared weights results in sub-optimal accuracy. This paper introduces Deep Feature Surgery (DFS), which consists of feature partitioning and feature referencing approaches to resolve gradient conflict issues during the training of multi-exit networks. The feature partitioning separates shared features along the depth axis among all exits to alleviate gradient conflict while simultaneously promoting joint optimization for each exit. Subsequently, feature referencing enhances multi-scale features for distinct exits across varying depths to improve the model accuracy. Furthermore, DFS reduces the training operations with the reduced complexity of backpropagation. Experimental results on Cifar100 and ImageNet datasets exhibit that DFS provides up to a 50.00% reduction in training time and attains up to a 6.94% enhancement in accuracy when contrasted with baseline methods across diverse models and tasks. Budgeted batch classification evaluation on MSDNet demonstrates that DFS uses about 2× fewer average FLOPs per image to achieve the same classification accuracy as baseline methods on Cifar100. The code is available at https: //***/GongCheng1919/dfs. Copyright © 2024, The Authors. All rights reserved.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Research on the Loading Method of Logistics Vehicle and Cargo Based on IPSO Algorithm 42

Research on the Loading Method of Logistics Vehicle and Carg...

引用

42nd Chinese Control Conference, CCC 2023

作者： Zhao, Zewei Wang, Huqing Sun, Zhe Xu, Lei Gong, Guangfu Xie, Xiangpeng Sun, Zhixin Post Industry Technology Research and Development Center of the State Posts Bureau Nanjing University of Posts and Telecommunications Nanjing210023 China Post Big Data Technology and Application Engineering Research Center of Jiangsu Province Nanjing University of Posts and Telecommunications Nanjing210023 China Nanjing University of Posts and Telecommunications Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing210023 China Anhui Yougu Express Intelligent Technology Co. LTD Anhui Nanling241300 China

ISBN: (纸本)9789887581543

Logistics vehicle and cargo matching problem is a typical combination optimization problem, which has important theoretical and application value in the field of logistics distribution. The proved particle swarm optimization (PSO) algorithm is one of the most extensive optimization methods studied in recent years, with excellent global search ability and convergence speed. Based on the IPSO algorithm, this paper proposes an effective IPSO algorithm model for the matching problem of logistics vehicles and goods, and conducts the corresponding comparative experiment. The final experimental results show that the algorithm has good results in practical application and can provide a feasible optimization method for solving the problem of logistics vehicles and goods. © 2023 Technical Committee on Control Theory, Chinese Association of Automation.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

A WOA Based Switching PID Control for Overhead Crane 42

A WOA Based Switching PID Control for Overhead Crane

引用

42nd Chinese Control Conference, CCC 2023

作者： Yu, Haoyong Sun, Zhe Xu, Yuhua Xu, Lei Gong, Guangfu Xie, Xiangpeng Sun, Zhixin Post Industry Technology Research and Development Center of the State Posts Bureau Nanjing University of Posts and Telecommunications Nanjing210023 China Nanjing University of Posts and Telecommunications Post Big Data Technology and Application Engineering Research Center of Jiangsu Province Nanjing210023 China Nanjing University of Posts and Telecommunications Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing210023 China Anhui Yougu Express Intelligent Technology Co. LTD Anhui Nanling241300 China

ISBN: (纸本)9789887581543

Aiming at the problem that the amplitude of load oscillation is not easy to control in the movement process of overhead crane, this paper designs a switching PID control method based on whale optimization algorithm(WOA) to improve the performance of position control and anti-swing control for overhead crane. WOA is used to better adjust the parameters of PID controllers. The switching control is realized by a switching module, which defaults to the output of the Position PID Controller to provide control force for the trolley. When the absolute value of the load swing angle fed back by the crane system exceeds the warning value, the switching module immediately blocks the output of the Position PID Controller, and uses the Angle PID Controller to determine the control force. In addition, through theoretical analysis and simulation experiments under different conditions, the results verify the effectiveness of the WOA based switching control in position control and anti-swing control for overhead crane. Improve the efficiency and safety of overhead crane in practical industrial applications. © 2023 Technical Committee on Control Theory, Chinese Association of Automation.

关键词： Three term control systems

来源：评论

学校读者我要写书评

暂无评论

A Review of the Evolutionary Algorithm Based VRP Problem 42

A Review of the Evolutionary Algorithm Based VRP Problem

引用

42nd Chinese Control Conference, CCC 2023

作者： Pan, Lili Hu, Bing Sun, Zhe Xu, Lei Gong, Guangfu Xie, Xiangpeng Sun, Zhixin Post Industry Technology Research and Development Center of the State Posts Bureau Nanjing University of Posts and Telecommunications Nanjing210023 China Nanjing University of Posts and Telecommunications Post Big Data Technology and Application Engineering Research Center of Jiangsu Province Nanjing210023 China Ministry of Education Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Nanjing210023 China Anhui Yougu Express Intelligent Technology Co. LTD Anhui Nanling241300 China

ISBN: (纸本)9789887581543

The problem of vehicle routing planning (VRP) has far-reaching influence, and is widely used in vehicle scheduling, industrial production, transportation, logistics and distribution. The study of VRP and its associated derivations has grown significantly in recent years. So, starting with the fundamental VRP, this paper categorizes the VRP based on its traits and real-world applications. It then in-depth analyses the capacity constrained VRP, time window VRP, batched delivery VRP, dynamic VRP, and stochastic demand VRP, and provides an update on each type of VRP's research. Additionally, a summary of the VRP problem-solving methods is provided. The study of evolutionary algorithms is the main topic of this paper, and the fundamental solution method is provided in accordance with the development of the algorithms. © 2023 Technical Committee on Control Theory, Chinese Association of Automation.

关键词： Vehicle routing

来源：评论

学校读者我要写书评

暂无评论

Learning Structured Twin-Incoherent Twin-Projective Latent Dictionary Pairs for Classification

Learning Structured Twin-Incoherent Twin-Projective Latent D...

引用

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Yulin Sun Zheng Zhang Yang Wang Guangcan Liu Meng Wang School of Computer Science and Technology Soochow University Suzhou China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei China Bio-Computing Research Center Harbin Institute of Technology (Shenzhen) Shenzhen China School of Information and Control Nanjing University of Information Science and Technology Nanjing China

In this paper, we extend the popular dictionary pair learning (DPL) into the scenario of twin-projective latent flexible DPL under a structured twin-incoherence. Technically, a novel framework called Twin-Projective Latent Flexible DPL (TP-DPL) is proposed, which minimizes the twin-incoherence constrained flexibly-relaxed reconstruction error to avoid the possible over-fitting issue and produce accurate reconstruction. In this setting, TP-DPL integrates the twin-incoherence based latent flexible DPL and the joint embedding of codes as well as salient features by twin-projection into a unified model in an adaptive neighborhood-preserving manner. Therefore, TP-DPL can unify the procedures of salient feature representation and classification. The twin-incoherence constraint on coefficients and features can explicitly ensure high intra-class compactness and inter-class separation over them. TP-DPL also integrates the adaptive weighting to preserve local neighborhood of both coefficients and salient features within each class explicitly. For efficiency, TP-DPL selects the Frobenius-norm and abandons the costly l0/l1-norm for group sparse representation. Another byproduct is that TP-DPL can directly apply the class-specific twin-projective reconstruction residual to compute the label of data. Extensive results on public databases show that TP-DPL can deliver the state-of-the-art performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatically labeling Aging Scenarios with a Machine Learning Approach 1

引用

24th International Conference on Human-Computer Interaction, HCII 2022

作者： An, Ning Xu, Yang Gao, Qinglin Zhu, Wenjie Wu, Aoran Chen, Honglin School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China Shanghai Tianyu Senior Living Service Co. Ltd. Shanghai China School of Basic Courses Bengbu Medical College Bengbu China Management and Business Department Skidmore College Saratoga SpringsNY United States Department of Social Sciences University of Eastern Finland Kuopio70150 Finland

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

Older adults have diversified needs often associated with particular aging scenarios. People started to use aging scenarios to provide better Smart Eldercare services and develop innovative solutions. The problem is how to manage these scenarios effectively. To our best knowledge, this study is the first to develop a model to provide a structured framework of aging scenarios for research and teaching of eldercare services. labeling aging scenarios can facilitate their collection, classification, and consolidation within this model. This study uses the automatic labeling approach to manage and utilize aging scenarios. Under each class, there are labels with different numbers and smaller granularity to reflect the requirements in each scenario case. Since a scenario case often involves more than one label, properly labeling it becomes a multi-label text classification problem. We extend the multi-label text classification model LSAN for labeling aging scenario cases. For evaluation purposes, we collected 938 scenario cases as the dataset. Experimental results show that our proposed method can achieve an average accuracy of 61.66%, better than other classical methods. © 2022, Springer Nature Switzerland AG.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Identification of misleading product description in e-commerce website

引用

Ruan Jian Xue Bao/Journal of Software 2014年 25卷 127-135页

作者： Long, Yin Liu, Hong-Yan He, Jun Hu, He Du, Xiao-Yong Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education Renmin University of China Beijing100872 China School of Information Renmin University of China Beijing100872 China School of Economics and Management Tsinghua University Beijing100084 China

Online shopping has been accepted by more and more consumers. C2C websites provide thousands of offers for consumers as a mainstream e-commerce platform. When customers search products in C2C website, some returned offers have misleading description. Misleading description means that the description does not convey the actual price of products, but usually claiming much lower price for the purpose of attracting more consumers. The misleading offers affect consumers' judgments and bring bad influences on the websites' reputation. This paper proposes an approach that combines statistical model HMM with statistical outlier detection method to detect misleading offers. HMM model is built to determine the product that an offer description really designates, providing an efficient solution to eliminate the ambiguity of the offer description caused by description irregularities. The statistical outlier detection method is effective to deal with limited product offer information. The paper further conducts experiments on real data set of electric business websites and the results demonstrate the effectiveness of the proposed approach. ©2014 ISCAS.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

ConsistencyDet: A Robust Object Detector with a Denoising Paradigm of Consistency Model

arXiv

引用

arXiv 2024年

作者： Jiang, Lifan Wang, Zhihui Wang, Changmiao Li, Ming Leng, Jiaxu Wu, Xindong the College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266510 China Shenzhen Research Institute of Big Data Shenzhen518172 China Key Laboratory of Intelligent Education Technology and Application Zhejiang Normal University Jinhua321004 China the Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Chongqing400065 China Jiangsu Key Laboratory of Image and Video Understanding for Social Safety Nanjing University of Science and Technology Nanjing210094 China the Key Laboratory of Knowledge Engineering with Big Data the Ministry of Education of China China School of Computer Science and Information Technology Hefei University of Technology Hefei230009 China

Object detection, a quintessential task in the realm of perceptual computing, can be tackled using a generative methodology. In the present study, we introduce a novel framework designed to articulate object detection as a denoising diffusion process, which operates on the perturbed bounding boxes of annotated entities. This framework, termed ConsistencyDet, leverages an innovative denoising concept known as the Consistency Model. The hallmark of this model is its self-consistency feature, which empowers the model to map distorted information from any temporal stage back to its pristine state, thereby realizing a "one-step denoising" mechanism. Such an attribute markedly elevates the operational efficiency of the model, setting it apart from the conventional Diffusion Model. Throughout the training phase, ConsistencyDet initiates the diffusion sequence with noise-infused boxes derived from the ground-truth annotations and conditions the model to perform the denoising task. Subsequently, in the inference stage, the model employs a denoising sampling strategy that commences with bounding boxes randomly sampled from a normal distribution. Through iterative refinement, the model transforms an assortment of arbitrarily generated boxes into definitive detections. Comprehensive evaluations employing standard benchmarks, such as MS-COCO and LVIS, corroborate that ConsistencyDet surpasses other leading-edge detectors in performance metrics. Our code is available at https://***/Tankowa/ConsistencyDet. Copyright © 2024, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Sub-graph matching-based building changes detection using high-resolution remote sensing images

引用

International Journal of Earth Sciences and engineering 2016年第5期9卷 2172-2181页

作者： Huang, Feng-Hua Mao, Zheng-Yuan Shi, Wen-Zao Fuzhou University Fuzhou350116 China Yango College Fuzhou350015 China Key Lab of Spatial Data Mining & Information Sharing of Ministry of Education Fuzhou University Fuzhou350002 China National Engineering Research Centre of Geospatial Information Technology Fuzhou University Fuzhou350002 China Spatial Information Engineering Research Centre of Fujian Province Fuzhou University Fuzhou350002 China

High-resolution remote sensing (HRRS) images of urban regions have large viewing angle variations, significant noise jamming, and obvious building shadows. Hence, deviation and distortion usually occur to the buildings in HRRS images collected at different phases (multi-temporal HRRS images). The traditional detection methodology is ineffective for accurate and efficient building changes detection in multi-temporal HRRS images. In order to address these problems, this paper proposes a sub-graph matching-based building changes detection (SGMBCD) scheme. First, this paper presents a Graphcut-based buildings extracting (GCBE) method from multi-temporal HRRS images. Next, a sub-graph matching-based registration (SGMR) method is devised to register the previously extracted buildings from multi-temporal HRRS images and to obtain matched ASIFT feature point pairs and singular points. Finally, singular points and overlay analysis-based method (SPOA) is developed to detect building changes in multi-temporal HRRS images. The types of building changes included in this paper are changes (e.g., erection, dismantling, repairing, and reconstruction) and non-changes. In order to demonstrate the effectiveness of the proposed SGMBCD scheme, it is compared with five typical algorithms (i.e., BCDBPM, SDBBCD, BCDBICO, NCUTBCD, and RSMBCD) on three sets of multi-temporal WorldView2 test images. Experimental results show that in comparison with the other methods, SGMBCD can effectively address the challenging problem of building changes detection in multi-temporal HRRS images. The average recall ratio, precision ratio and F value is 91.47%, 86.49% and 88.91% respectively, and the average time consumption is 60.3 s. This demonstrates SGMBCD can detect building changes in multi-temporal HRRS images accurately and efficiently. © 2016 CAFET-INNOVA TECHNICAL SOCIETY. All rights reserved.

关键词： Buildings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：