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

Using Others' Tests to Identify Breaking Updates

学校读者我要写书评

暂无评论

Using Others' Tests to Identify Breaking Updates

International Mining software Repositories, MSR

作者： Suhaib Mujahid Rabe Abdalkareem Emad Shihab Shane McIntosh Dept. of Computer Science and Software Engineering Data-driven Analysis of Software (DAS) Lab Concordia University Montreal Quebec Canada Software Analysis and Intelligence Lab (SAIL) School of Computing Queen's University Kingston Ontario Canada Dept. of Electrical and Computer Engineering Software Repository Excavation and Build Eng. Labs McGill University Montreal Quebec Canada

The reuse of third-party packages has become a common practice in contemporary software development. software dependencies are constantly evolving with newly added features and patches that fix bugs in older versions. However, updating dependencies could introduce new bugs or break backward compatibility. In this work, we propose a technique to detect breakage-inducing versions of third-party dependencies. The key insight behind our approach is to leverage the automated test suites of other projects that depend upon the same dependency to test newly released versions. We conjecture that this crowd-based approach will help to detect breakage-inducing versions because it broadens the set of realistic usage scenarios to which a package version has been exposed. To evaluate our conjecture, we perform an empirical study of 391,553 npm packages. We use the dependency network from these packages to identify candidate tests of third-party packages. Moreover, to evaluate our proposed technique, we mine the history of this dependency network to identify ten breakage-inducing versions. We find that our proposed technique can detect six of the ten studied breakage-inducing versions. Our findings can help developers to make more informed decisions when they update their dependencies.

关键词：

TEGDNet: Texture Enhancement Guided Detection Network for spiral welded pipeline defect detection

学校读者我要写书评

暂无评论

Measurement 2025年

作者： Yu Zhang Kechen Song Wenqi Cui Yunhui Yan Guotong Lv Yanning Zhang School of Mechanical Engineering & Automation Northeastern University Shenyang 110819 China National Frontiers Science Center for Industrial Intelligence and Systems Optimization Northeastern University Shenyang 110819 China Key Laboratory of Data Analytics and Optimization for Smart Industry (Northeastern University) Ministry of Education China Lingang Beipiao Steel Pipe Company Ltd. Chaoyang China School of Software Shenyang University of Technology Shenyang China

Spiral welded pipelines play a crucial role in the transportation industry. However, defects in the pipeline welds pose significant safety hazards, and their detection is challenging. Current detection methods are highly subjective, labor-intensive, and prone to missed or overlooked defects without sufficient texture information. Therefore, we propose a solution to address these challenges. Firstly, we construct a dataset of spiral welded pipeline weld defects (NEU-WELD-2000). Furthermore, we propose a texture enhancement guided detection network (TEGDNet) to detect defects with insufficient texture information, such as weak textures, strong interference, scale variation, and tiny targets. TEGDNet includes an encoder structure for feature extraction and enhancement and a decoder structure based on super-resolution reconstruction. Experiments have demonstrated that our method achieves excellent detection results with fewer than 4M parameters, while mAP 50 improves by 3.2%, and mAP 75 , which is typically harder to improve, increases by 1.2% compared to the baseline. Additionally, we validate the effectiveness of each module through ablation experiments. Finally, the proposed detection method shows great potential in actual pipeline weld detection, significantly saving time and costs for operators through visualization software. The source code and the dataset are publicly available at https://***/acb-123-xxx/TEGDNet .

关键词：

C olumnSGD: A Column-oriented Framework for Distributed Stochastic Gradient Descent

学校读者我要写书评

暂无评论

C olumnSGD: A Column-oriented Framework for Distributed Stoc...

International Conference on data engineering

作者： Zhipeng Zhang Wentao Wu Jiawei Jiang Lele Yu Bin Cui Ce Zhang School of EECS & Key Laboratory of High Confidence Software Technologies (MOE) Peking University Microsoft Research Redmond USA ETH Zurich Switzerland Tencent Inc Center for Data Science Peking University & National Engineering Laboratory for Big Data Analysis and Applications

ISBN: (数字)9781728129037

ISBN: (纸本)9781728129044

Distributed machine learning (ML) has triggered tremendous research interest in recent years. Stochastic gradient descent (SGD) is one of the most popular algorithms for training ML models, and has been implemented in almost all distributed ML systems, such as Spark MLlib, Petuum, MXNet, and TensorFlow. However, current implementations often incur huge communication and memory overheads when it comes to large models. One important reason for this inefficiency is the row-oriented scheme (RowSGD) that existing systems use to partition the training data, which forces them to adopt a centralized model management strategy that leads to vast amount of data exchange over the network. We propose a novel, column-oriented scheme (ColumnSGD) that partitions training data by columns rather than by rows. As a result, ML model can be partitioned by columns as well, leading to a distributed configuration where individual data and model partitions can be collocated on the same machine. Following this locality property, we develop a simple yet powerful computation framework that significantly reduces communication overheads and memory footprints compared to RowSGD, for large-scale ML models such as generalized linear models (GLMs) and factorization machines (FMs). We implement ColumnSGD on top of Apache Spark, and study its performance both analytically and experimentally. Experimental results on both public and real-world datasets show that ColumnSGD is up to 930× faster than MLlib, 63× faster than Petuum, and 14× faster than MXNet.

关键词： Conferences data engineering Radio frequency

AI-based Fog and Edge Computing: A Systematic Review, Taxonomy and Future Directions

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Iftikhar, Sundas Gill, Sukhpal Singh Song, Chenghao Xu, Minxian Aslanpour, Mohammad Sadegh Toosi, Adel N. Du, Junhui Wu, Huaming Ghosh, Shreya Chowdhury, Deepraj Golec, Muhammed Kumar, Mohit Abdelmoniem, Ahmed M. Cuadrado, Felix Varghese, Blesson Rana, Omer Dustdar, Schahram Uhlig, Steve School of Electronic Engineering and Computer Science Queen Mary University of London London United Kingdom University of Kotli Azad Jammu & Kashmir Azad Kashmir Kotli Pakistan Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China Department of Software Systems and Cybersecurity Faculty of Information Technology Monash University Australia Csiro DATA61 Australia Center for Applied Mathematics Tianjin University Tianjin China The Pennsylvania State University PA United States Naya Raipur India Abdullah Gül University Kayseri Turkey Department of Information Technology National Institute of Technology Jalandhar India Spain School of Computer Science University of St Andrews United Kingdom School of Computer Science and Informatics Cardiff University Cardiff United Kingdom Distributed Systems Group Vienna University of Technology Vienna Austria

Resource management in computing is a very challenging problem that involves making sequential decisions. Resource limitations, resource heterogeneity, dynamic and diverse nature of workload, and the unpredictability of fog/edge computing environments have made resource management even more challenging to be considered in the fog landscape. Recently Artificial Intelligence (AI) and Machine Learning (ML) based solutions are adopted to solve this problem. AI/ML methods with the capability to make sequential decisions like reinforcement learning seem most promising for these type of problems. But these algorithms come with their own challenges such as high variance, explainability, and online training. The continuously changing fog/edge environment dynamics require solutions that learn online, adopting changing computing environment. In this paper, we used standard review methodology to conduct this Systematic Literature Review (SLR) to analyze the role of AI/ML algorithms and the challenges in the applicability of these algorithms for resource management in fog/edge computing environments. Further, various machine learning, deep learning and reinforcement learning techniques for edge AI management have been discussed. Furthermore, we have presented the background and current status of AI/ML-based Fog/Edge Computing. Moreover, a taxonomy of AI/ML-based resource management techniques for fog/edge computing has been proposed and compared the existing techniques based on the proposed taxonomy. Finally, open challenges and promising future research directions have been identified and discussed in the area of AI/ML-based fog/edge computing. Copyright © 2022, The Authors. All rights reserved.

关键词： Edge computing

Deep Domain Adaptation for Pavement Crack Detection

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Liu, Huijun Yang, Chunhua Li, Ao Huang, Sheng Feng, Xin Ruan, Zhimin Ge, Yongxin College of Computer Science Chongqing University Chongqing400044 China School of Big Data and Software Engineering Chongqing University Chongqing401331 China Chongqing City Management College Chongqing401331 China Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing University Chongqing400044 China College of Computer Science And Engineering Chongqing University of Technology Chongqing400054 China Co. Ltd Chongqing400060 China

Deep learning-based pavement cracks detection methods often require large-scale labels with detailed crack location information to learn accurate predictions. In practice, however, crack locations are very difficult to be manually annotated due to various visual patterns of pavement crack. In this paper, we propose a Deep Domain Adaptation-based Crack Detection Network (DDACDN), which learns domain invariant features by taking advantage of the source domain knowledge to predict the multi-category crack location information in the target domain, where only image-level labels are available. Specifically, DDACDN first extracts crack features from both the source and target domain by a two-branch weights-shared backbone network. And in an effort to achieve the cross-domain adaptation, an intermediate domain is constructed by aggregating the three-scale features from the feature space of each domain to adapt the crack features from the source domain to the target domain. Finally, the network involves the knowledge of both domains and is trained to recognize and localize pavement cracks. To facilitate accurate training and validation for domain adaptation, we use two challenging pavement crack datasets CQU-BPDD and RDD2020. Furthermore, we construct a new large-scale Bituminous Pavement Multi-label Disease dataset named CQU-BPMDD, which contains 38994 high-resolution pavement disease images to further evaluate the robustness of our model. Extensive experiments demonstrate that DDACDN outperforms state-of-the-art pavement crack detection methods in predicting the crack location on the target domain. Copyright © 2021, The Authors. All rights reserved.

关键词： Crack detection

Multivariate time series classification with hierarchical variational graph pooling

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Duan, Ziheng Xu, Haoyan Wang, Yueyang Huang, Yida Ren, Anni Xu, Zhongbin Sun, Yizhou Wang, Wei School of Big Data and Software Engineering Chongqing University Chongqing401331 China College of Energy Engineering Zhejiang University Zhejiang310027 China Department of Computer Science University of California Los AngelesCA90095 United States

With the advancement of sensing technology, multivariate time series classification (MTSC) has recently received considerable attention. Existing deep learning-based MTSC techniques, which mostly rely on convolutional or recurrent neural networks, are primarily concerned with the temporal dependency of single time series. As a result, they struggle to express pairwise dependencies among multivariate variables directly. Furthermore, current spatial-temporal modeling (e.g., graph classification) methodologies based on Graph Neural Networks (GNNs) are inherently flat and cannot aggregate hub data in a hierarchical manner. To address these limitations, we propose a novel graph pooling-based framework MTPool to obtain the expressive global representation of MTS. We first convert MTS slices to graphs by utilizing interactions of variables via graph structure learning module and attain the spatial-temporal graph node features via temporal convolutional module. To get global graph-level representation, we design an "encoder-decoder" based variational graph pooling module for creating adaptive centroids for cluster assignments. Then we combine GNNs and our proposed variational graph pooling layers for joint graph representation learning and graph coarsening, after which the graph is progressively coarsened to one node. At last, a differentiable classifier takes this coarsened representation to get the final predicted class. Experiments on ten benchmark datasets exhibit MTPool outperforms state-of-the-art strategies in the MTSC task. Copyright © 2020, The Authors. All rights reserved.

关键词： Graph neural networks

ABC: An Auction-Based Blockchain Consensus-Incentive Mechanism

学校读者我要写书评

暂无评论

ABC: An Auction-Based Blockchain Consensus-Incentive Mechani...

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Zhengpeng Ai Yuan Liu Xingwei Wang Software College Northeastern University Shenyang China Ministry of Education Key Laboratory of Data Analytics and Optimization for Smart Industry (NEU) Shenyang China School of Computer Science and Engineering Northeastern University Shenyang China

ISBN: (数字)9781728190747

ISBN: (纸本)9781728183824

The rapid development of blockchain technology and its various applications have attracted huge attention in the last five years. The consensus mechanism and incentive mechanism are the backbone of a blockchain network. The consensus mechanism plays a crucial role in sustaining the network security, integrity, and efficiency. The incentive mechanism motivates the distributed nodes to “mine” so as to participate the consensus mechanism. The existing mechanisms bear the fairness and justice issues. In this paper, from the perspective of mechanism design, we propose a consensus-incentive mechanism through applying continuous double auction theory, which is abbreviated as ABC mechanism. Our mechanism consists of four stages, including initiation stage, auction stage, completion stage, and confirmation stage. The auction model in use is the continuous double auction to ensure the transactions are stored in a real-time manner. Through extensive experimental evaluations, our mechanism is proven to improve the fairness and justice of the blockchain network.

关键词： Conferences Blockchain Real-time systems Security Communication networks

Cross-domain Object Detection through Coarse-to-Fine Feature Adaptation

学校读者我要写书评

暂无评论

Cross-domain Object Detection through Coarse-to-Fine Feature...

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Yangtao Zheng Di Huang Songtao Liu Yunhong Wang Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University State Key Laboratory of Software Development Environment Beihang University School of Computer Science and Engineering Beihang University Beijing China

ISBN: (数字)9781728171685

ISBN: (纸本)9781728171692

Recent years have witnessed great progress in deep learning based object detection. However, due to the domain shift problem, applying off-the-shelf detectors to an unseen domain leads to significant performance drop. To address such an issue, this paper proposes a novel coarse-to-fine feature adaptation approach to cross-domain object detection. At the coarse-grained stage, different from the rough image-level or instance-level feature alignment used in the literature, foreground regions are extracted by adopting the attention mechanism, and aligned according to their marginal distributions via multi-layer adversarial learning in the common feature space. At the fine-grained stage, we conduct conditional distribution alignment of foregrounds by minimizing the distance of global prototypes with the same category but from different domains. Thanks to this coarse-to-fine feature adaptation, domain knowledge in foreground regions can be effectively transferred. Extensive experiments are carried out in various cross-domain detection scenarios. The results are state-of-the-art, which demonstrate the broad applicability and effectiveness of the proposed approach.

关键词： Feature extraction Subspace constraints Object detection Detectors Task analysis Semantics Prototypes

Cross-modality brain tumor segmentation via bidirectional global-to-local unsupervised domain adaptation

学校读者我要写书评

暂无评论

arXiv 2021年

作者： He, Kelei Ji, Wen Zhou, Tao Li, Zhuoyuan Huo, Jing Zhang, Xin Gao, Yang Shen, Dinggang Zhang, Bing Zhang, Junfeng Medical School of Nanjing University Nanjing China The National Institute of Healthcare Data Science Nanjing University Nanjing China The State Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Computer Science and Technology Nanjing University of Science and Technology Nanjing China Department of Radiology Nanjing Drum Tower Hospital Nanjing University Medical School China School of Biomedical Engineering ShanghaiTech University Shanghai China Department of Research and Development Shanghai United Imaging Intelligence Co. Ltd. Shanghai China Department of Artificial Intelligence Korea University Seoul Korea Republic of

Accurate segmentation of brain tumors from multi-modal Magnetic Resonance (MR) images is essential in brain tumor diagnosis and treatment. However, due to the existence of domain shifts among different modalities, the performance of networks decreases dramatically when training on one modality and performing on another, e.g., train on T1 image while perform on T2 image, which is often required in clinical applications. This also prohibits a network from being trained on labeled data and then transferred to unlabeled data from a different domain. To overcome this, unsupervised domain adaptation (UDA) methods provide effective solutions to alleviate the domain shift between labeled source data and unlabeled target data. In this paper, we propose a novel Bidirectional Global-to-Local (BiGL) adaptation framework under an UDA scheme. Specifically, A bidirectional image synthesis and segmentation module is proposed to segment the brain tumor using the intermediate data distributions generated for the two domains, which includes an image-to-image translator and a shared-weighted segmentation network. Further, a global-to-local consistency learning module is proposed to build robust representation alignments in an integrated way. Extensive experiments on a multi-modal brain MR benchmark dataset demonstrate that the proposed method outperforms several state-of-the-art unsupervised domain adaptation methods by a large margin, while a comprehensive ablation study validates the effectiveness of each key component. The implementation code of our method will be released at https://***/KeleiHe/BiGL. © 2021, CC BY-NC-SA.

关键词： Generative adversarial networks