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

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Wang, Yang Xiang, Jiayan Cheng, Hangyu Chen, Wanjun Xiao, Yong Kang, Guosheng Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology Hnust Xiangtan China

ISBN: (纸本)9798350331684

With the wide adoption of Web APIs released on Internet, users tend to reuse them for business requirements or software development. Mashup is a useful technology for composing Web APIs into a new and value-added application. With the increasing number of Web APIs and Mashups, the API-Mashup ecosystem has emerged based on the invocation relationship between Mashups and Web APIs. In this paper, we take ProgrammableWeb, a typical API-Mashup ecosystem, as an example to investigate its dynamic evolutionary analysis. Although there have been some works on the API-Mashup ecosystem, they mainly focus on static analysis, i.e., the static characteristics of the API- Mashup ecosystem on a fixed time point. This paper conducts a comprehensive study on the dynamic evolutionary analysis of the API-Mashup ecosystem with a long time range from 2005 to 2021. First, we conduct a dynamic statistical analysis based on the API-Mashup ecosystem dataset. Next, we construct two cooperation networks, one between Web APIs, and the other between their categories. And the general characteristics of the two cooperation networks are presented. Finally, we investigate the derived cooperation networks from four perspectives: dynamic characteristics, degree distribution, betweenness centrality, and assortative mixing. Meanwhile, the corresponding insights are uncovered. Our work provides a foundation for visualization and understanding of the API-Mashup ecosystem from the timeline. © 2023 IEEE.

关键词： Ecosystems

来源：评论

学校读者我要写书评

暂无评论

Achieving Efficient and Accurate Segmentation for Autonomous Driving 9

Achieving Efficient and Accurate Segmentation for Autonomous...

引用

9th International Conference on Intelligent Informatics and BioMedical sciences, ICIIBMS 2024

作者： Ouyang, Ningkang Dong, Jie Han, Yi Zhao, ChenYu North China University of Water Resources and Electric Power School of Information Engineering Zhengzhou China Anyang Institute of Technology Engineering Department of Computer Science and Information Anyang China Zhengzhou Software Vocational and Technical College School of Artificial Intelligence Zhengzhou China

ISBN: (纸本)9798350363043

Autonomous driving technology, as a mainstream trend in today's technological development, holds significant commercial value. Semantic segmentation, a core technology in this field, faces challenges with current mainstream models due to their complex structures, large numbers of parameters, and the need for high-performance hardware. These issues hinder their application in mobile devices. Therefore, this paper proposes a road scene semantic segmentation algorithm based on dynamic asymmetric convolution and capsule networks, named Asymmetric Capsule Convolutional Networks (ACCN). Specifically, the algorithm uses dynamic asymmetric convolution to construct a baseline network that combines dynamic convolution and capsule dynamic routing algorithms to enhance the model's representational capabilities. Additionally, a dispersed attention module is built to strengthen the dependency between features to achieve more adaptable network weights. Experiments demonstrate that ACCN achieves a good balance between segmentation accuracy and detection speed. On the CamVid and Cityscapes test datasets, the proposed method in this paper achieved an average Intersection over Union (mIoU) of 80.8% at 55.2 fps, showcasing better trade-offs in segmentation accuracy and efficiency. The experimental results indicate the effectiveness of our method. © 2024 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Towards agile collaborative multi-view modeling with inconsistency tolerance

Towards agile collaborative multi-view modeling with inconsi...

引用

2024 Symposium on software Technologies: Applications and Foundations, STAF 2024 Workshops: 2nd International Workshop on Agile Model-Driven engineering, AgileMDE 2024, 1st Large Language Models for Model-Driven engineering Workshop, AgileMDE 2024 and 4th International Workshop on Model-Driven engineering for Smart Internet-of-Things Systems, MeSS 2024

作者： Shahvari, Yaser Sharbaf, Mohammadreza Rahimi, Shekoufeh Kolahdouz Tehrani, Sobhan Yassipour MDSE Research Group Department of Software Engineering University of Isfahan Isfahan Iran School of Arts University of Roehampton London United Kingdom Computer Science Department Faculty of Engineering University College London London United Kingdom

Model-driven engineering (MDE) copes with the complexity of software development by using the principles of separation of concerns and automatic transformation. In MDE, stakeholders from diverse domains collaborate concurrently on different models to quickly analyze, design, and generate complex software-intensive systems. To adopt an agile development approach in MDE, an inconsistency tolerance framework is needed. This framework postpones the resolution phase for incompatibilities caused by online cooperation, allowing temporary incompatibilities to be automatically fixed while requiring resolution only for the remaining conflicts at the appropriate time. In this paper, we propose a general framework for identifying and diagnosing inconsistencies, making decisions regarding inconsistency tolerance or intervention for resolution, and outlining tolerance strategies in agile systems modeled as multi-views. Our framework comprises three primary phases: detection, analysis, and tolerance. It is designed to identify inconsistencies in multi-view models, which are inherently more complex than single-view models. The tolerance phase employs strategies to tolerate inconsistencies, enhancing the flexibility of the agile development approach for collaborative multi-view modeling. © 2024 Copyright for this paper by its authors.

关键词： software design

来源：评论

学校读者我要写书评

暂无评论

A Framework Design of ML Classifier Algorithm for Retrieve the Information about the Drugs and its Quality 4

A Framework Design of ML Classifier Algorithm for Retrieve t...

引用

4th IEEE International Conference on Advance Computing and Innovative Technologies in engineering, ICACITE 2024

作者： Meenakshi, M. Ruban, S. Nandhini, T.J. Loganayagi, S. Sayed, Raad Muhammed Hassan, Enas Al-Saidi, Imad Al-Din Hussein Saveetha University Saveetha School of Engineering Chennai Thandalam602117 India St Aloysius Deemed to Be University Department of Software Technology India Saveetha University Saveetha School of Engineering-SIMATS Department of Computer Science and Engineering chennai India Department of Computer Science and Engineering chennai tamil nadu thandalam602105 India Collage of Nursing National University of Science and Tqechnology dhi qar64001 Iraq Al-Farahidi University Baghdad Iraq Al-kunooze University College Computer Engineer Department basra Iraq

ISBN: (纸本)9798350360165

Every day, pharmaceutical firms have to do extensive product analyses. The same product is frequently registered more than once in several systems, each using unique properties. For these businesses, precise and high-quality information is crucial, especially considering the nature of the pharmaceuticals these goods contain. The hypothesis of this research project is that machine learning provides a workable way to effectively combine different data sources and match records pertaining to the same product. It is no longer feasible to match records by hand because of the extraordinarily large volume that has to be processed. In a large data context, this paper presents a framework for matching pharmacological records using machine learning approaches. The framework trains machine learning by utilising specified criteria for record matching. These models are then tested by forecasting matches between records that deviate from these preset guidelines. Lastly, by creating a huge variety of record combinations and forecasting matches based on them, the system mimics the production environment. The findings show that although the training datasets produce good results - the top model has an average accuracy of about 85% - the production environment has its own set of difficulties. In spite of this, matches that depart from established norms are effectively predicted by the framework. These results highlight how machine learning can be used to perform record matching tasks, as manual processing at this size is impossible. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Not All Frequencies Are Created Equal: Towards a Dynamic Fusion of Frequencies in Time-Series Forecasting 24

Not All Frequencies Are Created Equal: Towards a Dynamic Fus...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Zhang, Xingyu Zhao, Siyu Song, Zeen Guo, Huijie Zhang, Jianqi Zheng, Changwen Qiang, Wenwen Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences BeiJing China School of Mathematical Sciences University of Chinese Academy of Sciences BeiJing China School of Computer Science and Engineering Beihang University BeiJing China

ISBN: (纸本)9798400706868

Long-term time series forecasting is a long-standing challenge in various applications. A central issue in time series forecasting is that methods should expressively capture long-term dependency. Furthermore, time series forecasting methods should be flexible when applied to different scenarios. Although Fourier analysis offers an alternative to effectively capture reusable and periodic patterns to achieve long-term forecasting in different scenarios, existing methods often assume high-frequency components represent noise and should be discarded in time series forecasting. However, we conduct a series of motivation experiments and discover that the role of certain frequencies varies depending on the scenarios. In some scenarios, removing high-frequency components from the original time series can improve the forecasting performance, while in others scenarios, removing them is harmful to forecasting performance. Therefore, it is necessary to treat the frequencies differently according to specific scenarios. To achieve this, we first reformulate the time series forecasting problem as learning a transfer function of each frequency in the Fourier domain. Further, we design Frequency Dynamic Fusion (FreDF), which individually predicts each Fourier component, and dynamically fuses the output of different frequencies. Moreover, we provide a novel insight into the generalization ability of time series forecasting and propose the generalization bound of time series forecasting. Then we prove FreDF has a lower bound, indicating that FreDF has better generalization ability. Extensive experiments conducted on multiple benchmark datasets and ablation studies demonstrate the effectiveness of FreDF. © 2024 Owner/Author.

关键词： Fourier analysis

来源：评论

学校读者我要写书评

暂无评论

A new online field feature selection algorithm based on streaming data

引用

Journal of Ambient Intelligence and Humanized Computing 2024年第2期15卷 1365-1377页

作者： Zhang, Zhenjiang Song, Fuxing Zhang, Peng Chao, Han-Chieh Zhao, Yingsi School of Software Engineering Beijing Jiaotong University Beijing100044 China Department of Electronic and Information Engineering Key Laboratory of Communication and Information Systems Beijing Municipal Commission of Education Beijing Jiaotong University Beijing100044 China School of Information Science and Engineering Fujian University of Technology Fuzhou350118 China School of Mathematics and Computer Science Wuhan Polytechnic University Wuhan430023 China Department of Electrical Engineering National Dong Hwa University Hualien97401 Taiwan School of Economics and Management Beijing Jiaotong University Beijing100044 China

The rapid development of Internet technology derived out a massive network text data. Therefore, how to classify the massive text data efficiently has important theoretical significance and application value. In order to acquire accurate classification results, the process has been divided into two parts. In terms of text representation, this paper proposes an online field feature selection algorithm (OFFS algorithm) based on streaming data, which solves the problems of low efficiency and memory consumption of traditional feature selection algorithms. With improvements in the vector space model, the new algorithm can select the real-time feature of the data and quickly generate text vector. In the aspect of classifier design, an OFFS-BP neural network text classifier based on BP neutral network and OFFS algorithm is designed. It adapts to the distributed parallel computing, reduces the training time and balances the computation efficiency and classification accuracy. Finally based on the Spark platform, the OFFS-BP neural network classifier is implemented. The experimental results show that the OFFS-BP neural network classifier is more suitable for big data environment with less computation time and higher classification efficiency. © Springer-Verlag GmbH Germany, part of Springer Nature 2018.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Neural Operator-Based Framework for Time Efficient Denoising of Displacement Fields in Ultrasound Elastography

Neural Operator-Based Framework for Time Efficient Denoising...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Yihong Zhu Bo Peng School of Computer Science and Software Engineering Southwest Petroleum University Chengdu China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

In ultrasound elastography, the noise present in the measured displacement fields has been a critical factor affecting the quality of the strain or elastic distribution reconstruction. Existing partial differential equation (PDE) based denoising algorithms can effectively remove noise to some extent but are limited by slow solving speeds. To address this challenge, we introduce a neural operator-based framework for denoising measured displacement fields in ultrasound elastography. By utilizing neural operators to learn a general solution operator for the denoising equation, the framework aims to achieve fast and accurate denoising of displacement fields. Experiments conducted on simulated data and tissue-mimicking phantom data demonstrate that this method performs comparably to traditional methods across various metrics. In particular, the proposed approach achieves processing speeds approximately 30 to 577 times faster than the finite difference method (FDM) in various data dimensions, making it a highly effective solution for rapid and scalable data processing in ultrasound elastography.

关键词： Ultrasonic imaging Ultrasonic variables measurement Partial differential equations Noise reduction Noise Phantoms Displacement measurement Strain measurement Elastography Strain

来源：评论

学校读者我要写书评

暂无评论

Reconstruct and match: out-of-distribution robustness via topological homogeneity 24

Reconstruct and match: out-of-distribution robustness via to...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Chaoqi Chen Luyao Tang Hui Huang College of Computer Science and Software Engineering Shenzhen University School of Informatics Xiamen University

ISBN: (纸本)9798331314385

Since deep learning models are usually deployed in non-stationary environments, it is imperative to improve their robustness to out-of-distribution (OOD) data. A common approach to mitigate distribution shift is to regularize internal representations or predictors learned from in-distribution (ID) data to be domain invariant. Past studies have primarily learned pairwise invariances, ignoring the intrinsic structure and high-order dependencies of the data. Unlike machines, humans recognize objects by first dividing them into major components and then identifying the topological relation of these components. Motivated by this, we propose Reconstruct and Match (REMA), a general learning framework for object recognition tasks to endow deep models with the capability of capturing the topological homogeneity of objects without human prior knowledge or fine-grained annotations. To identify major components from objects, REMA introduces a selective slot-based reconstruction module to dynamically map dense pixels into a sparse and discrete set of slot vectors in an unsupervised manner. Then, to model high-order dependencies among these components, we propose a hypergraph-based relational reasoning module that models the intricate relations of nodes (slots) with structural constraints. Experiments on standard benchmarks show that REMA outperforms state-of-the-art methods in OOD generalization and test-time adaptation settings.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Data Aggregation with Error-Checking for Smart Grids

Fault-Tolerant Data Aggregation with Error-Checking for Smar...

引用

2023 IEEE International Conference on Dependable, Autonomic and Secure Computing, 2023 International Conference on Pervasive Intelligence and Computing, 2023 International Conference on Cloud and Big Data Computing, 2023 International Conference on Cyber science and Technology Congress, DASC/PiCom/CBDCom/CyberSciTech 2023

作者： Wang, Congcong Wang, Chen Shen, Jian Vijayakumar, Pandi Bhuiyan, Zakirul Alam School of Software Nanjing University of Information Science & Technology Nanjing210044 China School of Information Science and Engineering Zhejiang Sci-Tech University Hangzhou310018 China University College of Engineering Tindivanam Department of Computer Science and Engineering Tamilnadu 604001 India Fordham University Department of Computer and Information Sciences NY10458 United States

ISBN: (纸本)9798350304602

With the rapid development of smart grid technology, a new challenge has been brought about by the massive data generated from distributed devices. Data aggregation technology plays a crucial role in smart grid schemes, in terms of energy data statistics and resource allocation. However, achieving fast error-checking and improving device fault-tolerance are still open issues in the smart grid data aggregation. To address these issues, this paper proposes an error-tolerant data aggregation scheme integrated with error-checking mechanisms. The scheme proposes a tree-based aggregation structure, facilitating swift error-checking of data. We combine masking values with user anonymity in the ElGamal cryptographic scheme to ensure the security of sensitive data and resist collusion attacks. Both theoretical and experimental analyses demonstrate that this scheme enables a lightweight, secure data aggregation, ensuring enhanced reliability and error-checking. © 2023 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Task Consistent Prototype Learning for Incremental Few-Shot Semantic Segmentation 27th

Task Consistent Prototype Learning for Incremental Few-Shot...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Xu, Wenbo Wu, Yanan Jiang, Haoran Wang, Yang Wu, Qiang Zhang, Jian Faculty of Engineering and Information Technology University of Technology Sydney Sydney2007 Australia School of Computer and Information Technology Beijing Jiaotong University Beijing100044 China Department of Computer Science and Software Engineering Concordia University MontrealH3G2J1 Canada

ISBN: (纸本)9783031783463

Incremental Few-Shot Semantic Segmentation (iFSS) tackles a task that requires a model to continually expand its segmentation capability on novel classes using only a few annotated examples. Typical incremental approaches encounter a challenge that the objective of the base training phase (fitting base classes with sufficient instances) does not align with the incremental learning phase (rapidly adapting to new classes with less forgetting). This disconnect can result in suboptimal performance in the incremental setting. This study introduces a meta-learning-based prototype approach that encourages the model to learn how to adapt quickly while preserving previous knowledge. Concretely, we mimic the incremental evaluation protocol during the base training session by sampling a sequence of pseudo-incremental tasks. Each task in the simulated sequence is trained using a meta-objective to enable rapid adaptation without forgetting. To enhance discrimination among class prototypes, we introduce prototype space redistribution learning, which dynamically updates class prototypes to establish optimal inter-prototype boundaries within the prototype space. Extensive experiments on iFSS datasets built upon PASCAL and COCO benchmarks show the advanced performance of the proposed approach, offering valuable insights for addressing iFSS challenges. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：