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

IEEE International Conference on Cluster Computing

作者： Jingwen Du Fang Wang Dan Feng Dexin Zeng Sheng Yi Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China China School of Computer Science and Technology Huazhong University of Science and Technology China Shenzhen Huazhong University of Science and Technology Research Institute China

ISBN: (数字)9798350358711

ISBN: (纸本)9798350358728

In modern datacenters, memory disaggregation un-packs monolithic servers to build independent network-connected compute and memory pools, greatly improving resource uti-lization. Existing memory-disaggregated key-value stores adopt ownership sharing or ownership partitioning for request scheduling and they all show poor performance and scalability. The former generates multiple cache misses and multiple network round trips due to poor cache locality, while the latter fails to fully use resources on all Compute Nodes (CNs) due to load imbalance. In this paper, we propose Seastar, a fast and scalable key-value store that achieves high cache locality as well as load balancing. To enable high concurrency and ensure linearizability, Seastar exploits a self-verification version chain to provide out-of-place atomic updates and ensure consistent reads. To improve cache locality, Seastar leverages a pair-based ownership assigning scheme to assign the processing permission of requests corre-sponding to each key to a CN pair through two independent hash functions. To ensure load balancing among CNs, Seastar proposes a decentralized power-of-two-choices routing scheme to route the requests to the less-loaded CNs in CN pairs for handling. Experimental results demonstrate that Seastar improves the throughput by up to 6.7x and significantly reduces the latency compared with state-of-the-art memory-disaggregated key-value stores.

关键词： Concurrent computing Hash functions Protocols Processor scheduling Scalability Cluster computing Load management Throughput Routing Servers

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic Control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Label Correlation Guided Feature Selection for Multi-label Learning 9th

Label Correlation Guided Feature Selection for Multi-label ...

引用

19th International Conference on Advanced Data Mining and Applications, ADMA 2023

作者： Zhang, Kai Liang, Wei Cao, Peng Yang, Jinzhu Li, Weiping Zaiane, Osmar R. Computer Science and Engineering Northeastern University Shenyang China Key Laboratory of Intelligent Computing in Medical Image of Ministry of Education Northeastern University Shenyang China National Frontiers Science Center for Industrial Intelligence and Systems Optimization Shenyang110819 China School of Software and Microelectronics Peking University Beijing China Alberta Machine Intelligence Institute University of Alberta EdmontonAB Canada

ISBN: (纸本)9783031466731

Multi-label learning has received much attention due to its wide range of application domains. Multi-label data often has high-dimensional features, which brings more challenges to classification algorithms. Feature selection based on sparse learning is one of the most important approaches, which can select discriminative features to alleviate the curse of dimensionality. However, most of these methods do not consider feature redundancy and label correlation simultaneously. In this work, we propose a multi-label feature selection method that takes feature redundancy and label correlation into account. Specifically, the proposed method first divides features into groups according to feature correlation and then encourages competition within each group but relaxes competition between groups to eliminate redundant and irrelevant features. Moreover, we propose an approach to capture label correlation and exploit it to improve the feature selection. Finally, an iterative optimization algorithm is designed to obtain the feature weights for multi-label feature selection. Extensive experiments on various multi-label datasets demonstrate the superiority of the proposed method compared with some state-of-the-art multi-label feature selection methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

FedECCR: Federated Learning Method with Encoding Comparison and Classification Rectification 19th

FedECCR: Federated Learning Method with Encoding Comparison...

引用

19th EAI International Conference on Collaborative Computing: Networking, Applications and Worksharing, CollaborateCom 2023

作者： Zeng, Yan Zheng, Hui Wang, Xin Zhang, Beibei Zhou, Mingyao Zhang, Jilin Ren, YongJian School of Computer Science and Technology Hangzhou Dianzi University Hangzhou310018 China Key Laboratory for Modeling and Simulation of Complex Systems Ministry of Education Hangzhou310018 China Data Security Governance Zhejiang Engineering Research Center Hangzhou310018 China Zhejiang Lab Hangzhou311100 China Hangzhou Huawei Communication Technology Co. Ltd. Hangzhou310052 China

ISBN: (纸本)9783031545306

Federated learning is a distributed training method that integrates multi-party data information using privacy-preserving technologies through dispersed client data sets to jointly construct a global model under the coordination of a central server. However, in practical applications, there is a high degree of data distribution skewness among clients, which causes the optimization direction of the client models to diverge, resulting in model bias and reducing the accuracy of the global model. Existing methods require the calculation and transmission of much information to correct the optimization direction of the client models, or only roughly limit the deviation of the client models end-to-end, ignoring targeted processing of the internal structure of the model, resulting in unclear improvement effects. To address these problems, we propose a federated optimization algorithm FedECCR based on encoding contrast and classification correction. This algorithm divides the model into an encoder and a classifier. It utilizes prototype contrastive training of the model encoder and unbiased classification correction of the classifier. This approach notably improves the accuracy of the global model while maintaining low communication costs. We conducted experiments on multiple data sets to evaluate the validity of our method, and the quantified results showed that FedECCR can improve the global model classification accuracy by approximately 1% to 6% compared to FedAvg, FedProx, and MOON. © ICST Institute for computer sciences, Social Informatics and Telecommunications engineering 2024.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Study on Landslide Susceptibility Evaluation Based on Improved Multivariable Weighted Model: A Case Study of Lushan County, China

Study on Landslide Susceptibility Evaluation Based on Improv...

引用

Software engineering and Artificial Intelligence (SEAI), IEEE International Conference on

作者： Li Zhao Gonghao Duan School of Computer Science and Engineering Wuhan Institute of Technology Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan China

The evaluation of regional geological hazard susceptibility is of great significance to the prevention and control of geological hazard. In this paper, the "4-20" Lushan earthquake disaster area as the research area, combined with GIS and characteristics of the research area, through correlation analysis, selected 9 influencing factors as the evaluation factors. The study was conducted using a weighted information volume-logistic regression model (WI-LR). The results were classified into five sensitivity levels: very low, low, medium, high and very high. The results show that the landslide prone areas in Lushan County are concentrated in the area below the middle of the county seat, mostly near rivers, faults and areas with peak acceleration greater than 0.4. Among them, WI-LR model (AUC=0.918) > deterministic factor model (CF =0.908) > weighted information quantity model (WI) (AUC=0.896) > information quantity model I (AUC=0.853) > information quantity logistic regression model I-LR (AUC=0.799). It indicates that WI-LR model has high evaluation accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributed Event-Triggered Bandit Convex Optimization With Time-Varying Constraints

引用

IEEE Transactions on Control of Network systems 2025年

作者： Zhang, Kunpeng Yi, Xinlei Wen, Guanghui Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Ministry of Education Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Shanghai201210 China Southeast University School of Automation Nanjing210096 China University of Groningen Engineering and Technology Institute Groningen Faculty of Science and Engineering GroningenAG 9747 Netherlands KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm10044 Sweden KTH Royal Institute of Technology Digital Futures Stockholm10044 Sweden

This paper considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms solving this problem require that each agent broadcasts its decision to its neighbors at each iteration. However, communication resources are often limited. To better utilize communication resources, we propose a distributed event-triggered online primal-dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and non-increasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results. © 2014 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Vehicular Road Crack Detection with Deep Learning: A New Online Benchmark for Comprehensive Evaluation of Existing Algorithms

arXiv

引用

arXiv 2025年

作者： Ma, Nachuan Song, Zhengfei Hu, Qiang Liu, Chuang-Wei Han, Yu Zhang, Yanting Fan, Rui Xie, Lihua College of Electronics & Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems the State Key Laboratory of Intelligent Autonomous Systems Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai201804 China School of Computer Science and Technology Donghua University Shanghai201620 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore

In the emerging field of urban digital twins (UDTs), advancing intelligent road inspection (IRI) vehicles with automatic road crack detection systems is essential for maintaining civil infrastructure. Over the past decade, deep learning-based road crack detection methods have been developed to detect cracks more efficiently, accurately, and objectively, with the goal of replacing manual visual inspection. Nonetheless, there is a lack of systematic reviews on state-of-the-art (SoTA) deep learning techniques, especially data-fusion and label-efficient algorithms for this task. This paper thoroughly reviews the SoTA deep learning-based algorithms, including (1) supervised, (2) unsupervised, (3) semi-supervised, and (4) weakly-supervised methods developed for road crack detection. Also, we create a dataset called UDTIRI-Crack, comprising 2, 500 high-quality images from seven public annotated sources, as the first extensive online benchmark in this field. Comprehensive experiments are conducted to compare the detection performance, computational efficiency, and generalizability of public SoTA deep learning-based algorithms for road crack detection. In addition, the feasibility of foundation models and large language models (LLMs) for road crack detection is explored. Afterwards, the existing challenges and future development trends of deep learning-based road crack detection algorithms are discussed. We believe this review can serve as practical guidance for developing intelligent road detection vehicles with the next-generation road condition assessment systems. The released benchmark UDTIRI-Crack is available at https://***/submission/. © 2025, CC BY.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Multi-view Semantic Information Guidance for Light Field Image Segmentation

Multi-view Semantic Information Guidance for Light Field Ima...

引用

2023 IEEE/CVF Conference on computer Vision and Pattern Recognition Workshops, CVPRW 2023

作者： Li, Yiming Cong, Ruixuan Wang, Sizhe Zhao, Mingyuan Zhang, Yang Li, Fangping Sheng, Hao Beihang University State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beijing100191 China Beihang Hangzhou Innovation Institute Yuhang Xixi Octagon City Hangzhou310023 China Beijing University of Chemical Technology College of Information Science and Technology Beijing100029 China Macao Polytechnic University Faculty of Applied Sciences 999078 China

ISBN: (纸本)9798350302493

One of the great important fields of computer vision is semantic segmentation. As for single image semantic segmentation, due to limited available information, it appears poor performance when the occlusion and similar color interference occur, and has difficulty exploiting the rich scene information. In comparison, the special micro-len array structure of light field camera can record multi-view information of the scene, which provides us with a new solution to solve this issue. In this paper, we propose a multi-view semantic information guidance network (MSIGNet) for light field semantic segmentation. It can effectively utilize semantic information from multi-view images to guide pixel feature of center view image. First, we extract feature of each view image and further obtain semantic probability. Then all probabilities are aggregated through a self-adaptive multi-view probability fusion module. Last, the resulting coarse fusion representation interacts with center view feature to obtain the refined segmentation result. The proposed method shows excellent performance on both real-world and synthetic light field datasets. © 2023 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Low Noise Wireless Sensing in Termite Detection

Low Noise Wireless Sensing in Termite Detection

引用

2024 IEEE International Symposium on Electromagnetic Compatibility, Signal and Power Integrity, EMC+SIPI 2024

作者： Zhang, Wei Qi, Xiangshu Luo, Yunlong Qi, Alex Qi, Yihong Feng, Gang Changsha University College of Computer Science and Engineering Changsha410022 China Southwest Jiaotong University School of Information Science and Technology Chengdu611756 China Pontosense Inc. KitchenerONN2H 5G5 Canada Southwest Jiaotong University School of Information and Technology Chengdu611756 China Missouri University of Science and Technology Electromagnetic Compatibility Laboratory RollaMO65409 United States Christie Digital Systems Canada Inc. Kitchener Canada

ISBN: (纸本)9798350360394

Termites cause enormous financial damages all around the world every year. The majority of research on wireless sensing is always concerned with the various human-centric applications, however, the vast potential of wireless sensing for termite detection is often disregarded. In this article, a Wireless Intelligent Sensing (WISe) millimeter-wave (mmWave) radar system for termite detection is proposed. Here, we design a three-layer architecture with some intelligent resources to monitor the movement signs of the termites. In addition, we present a low noise sensing architecture that minimizes the noise in hardware and digital signal processing, which can reduce the impact of environment factors on termite detection. Experimental results demonstrate that, the proposed system is capable of detecting termites and differentiating them from other insects. © 2024 IEEE.

关键词： Digital signal processing

来源：评论

学校读者我要写书评

暂无评论

On the Design of the MITLL Trimodal Dataset for Identity Verification

On the Design of the MITLL Trimodal Dataset for Identity Ver...

引用

International Workshop on Biometrics and Forensics (IWBF)

作者： Elliot Singer Bengt J. Borgström Kenneth Alperin Trang Nguyen Cagri Dagli Melissa Dale Arun Ross MIT Lincoln Laboratory Artificial Intelligence Technology and Systems Group Lexington MA Computer Science and Engineering Department Michigan State University East Lansing MI

The recent advances in deep learning have led to an increased interest in the development of techniques for multimodal identity verification applications, particularly in the area of biometric fusion. Associated with these efforts is a corresponding need for large scale multimodal datasets to provide the bases for establishing performance baselines for proposed approaches. After examining the characteristics of existing multimodal datasets, this paper will describe the development of the MITLL Trimodal dataset, a new triple-modality collection of data comprising parallel samples of audio, image, and text for 553 subjects. The dataset is formed from YouTube videos and Twitter tweets. Baseline single modality results using a common processing pipeline are presented, along with the results of applying a conventional fusion algorithm to the individual stream scores.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：