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

11th International Conference on Advanced Cloud and Big Data, CBD 2023

作者： Chen, Yufeng Jiang, Ping Qu, Yida Wu, Mengqi Luo, Lu Yang, Ming Lu, Wenqian Southeast University School of Computer Science and Engineering School of Software Nanjing China China Telecom Nanjing Branch Nanjing China China Telecom Beijing China

ISBN: (纸本)9798350345346

The industrial Internet represents a significant innovation merging Internet technologies, big data, artificial intelligence, and advanced manufacturing, which is characterized by high technological and commercial value. Industrial communication systems need to satisfy precision manufacturing, including the expansive connections and tight requirements such as real time, determinism, and reliability. Hence, an efficient communication scheduling mechanism is essential. In contrast to conventional separate point-to-point (P2P) scheduling, point-to-multipoint multicasting and multipoint-to-point data aggregation are proven to be more effective in alleviating network congestion, enhancing throughput, and improving efficiency in the context of the ubiquitous point-to-multipoint communication in the industrial Internet. This paper focuses on communication in intra-datacenter and inter-datacenter subject to industrial quality of service (QoS) demands. Initially, we introduce a mathematic model for network and point-to-multipoint communication requests. Subsequently, we provide a comprehensive analysis of multicast route selection and traffic rate allocation algorithms that are deadline-aware and delay-aware. Additionally, we discuss the benefits of in-network data aggregation, including insights into aggregation pathways and aggregator placement algorithms, which are valuable for reference in data transfer scheduling in the industrial Internet. © 2023 IEEE.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

Research on performance optimization of virtual data space across WAN

引用

Frontiers of computer science 2024年第6期18卷 167-187页

作者： Jiantong HUO Zhisheng HUO Limin XIAO Zhenxue HE State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China High Performance Computing Center Beihang UniversityBeijing 100191China Hebei Key Laboratory of Agricultural Big Data Hebei Agricultural UniversityBaoding 071001China

For the high-performance computing in a WAN environment,the geographical locations of national supercomputing centers are scattered and the network topology is complex,so it is difficult to form a unified view of *** aggregate the widely dispersed storage resources of national supercomputing centers in China,we have previously proposed a global virtual data space named GVDS in the project of“High Performance Computing Virtual Data Space”,a part of the National Key Research and Development Program of *** GVDS enables large-scale applications of the high-performance computing to run efficiently across ***,the applications running on the GVDS are often data-intensive,requiring large amounts of data from multiple supercomputing centers across *** this regard,the GVDS suffers from performance bottlenecks in data migration and access across *** solve the above-mentioned problem,this paper proposes a performance optimization framework of GVDS including the multitask-oriented data migration method and the request access-aware IO proxy resource allocation *** a WAN environment,the framework proposed in this paper can make an efficient migration decision based on the amount of migrated data and the number of multiple data sources,guaranteeing lower average migration latency when multiple data migration tasks are running in *** addition,it can ensure that the thread resource of the IO proxy node is fairly allocated among different types of requests(the IO proxy is a module of GVDS),so as to improve the application’s performance across *** experimental results show that the framework can effectively reduce the average data access delay of GVDS while improving the performance of the application greatly.

关键词： storage aggregation across WANs large-scale applications GVDS data migration allocation of IO proxy resource

来源：评论

学校读者我要写书评

暂无评论

Investigating the Impact of Bug Dependencies on Bug-Fixing Time Prediction 17

Investigating the Impact of Bug Dependencies on Bug-Fixing T...

引用

17th ACM/IEEE International Symposium on Empirical software engineering and Measurement, ESEM 2023

作者： Li, Chenglin Zhao, Yangyang Yang, Yibiao Zhou, Yuming Nie, Liming Ding, Zuohua School of Computer Science and Technology Zhejiang Sci-Tech University Hangzhou China Nanjing University State Key Lab for Novel Software Technology Nanjing China School of Computer Science and Engineering Nanyang Technological University Singapore

ISBN: (纸本)9781665452236

Background: Bug dependencies refer to the link relationships between bugs and related issues, which are commonly observed in software evolution. It has been found that bugs with bug dependencies often take longer time to be resolved than other bugs without any dependencies. Despite the potential impact of bug dependencies on bug-fixing time, previous studies use traditional metrics without considering bug dependencies to build bug-fixing time prediction models. As a result, there is currently little empirical evidence to support the use of bug dependencies in improving prediction accuracy. Aims: We aim to conduct a comprehensive empirical study to investigate the value of considering bug dependencies for bug-fixing time prediction. Method: We define a set of bug dependency metrics based on bug dependencies. We first investigate the correlation between bug dependency metrics and bug-fixing time to investigate whether bugs with more complex dependencies are more time-consuming to be fixed. Next, we employ principal component analysis to study whether bug dependency metrics capture additional dimensions of a bug compared to traditional metrics. Finally, we build multivariate prediction models to explore whether considering bug dependencies can improve the effectiveness of bug-fixing time prediction. Results: The experimental results suggest that: (1) bugs with more complex dependencies require more time to be fixed;(2) bug dependency metrics are complementary to traditional metrics;(3) considering bug dependencies can improve the effectiveness of bug-fixing time prediction. Conclusions: These findings highlight the importance of considering bug dependencies in bug-fixing time prediction, and provide valuable insights into the potential impact of bug dependencies on software development processes. © 2023 IEEE.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

VITS-Based Singing Voice Conversion System with DSPGAN Post-Processing for SVCC2023

VITS-Based Singing Voice Conversion System with DSPGAN Post-...

引用

2023 IEEE Automatic Speech Recognition and Understanding Workshop, ASRU 2023

作者： Zhou, Yiquan Chen, Meng Lei, Yi Zhu, Jihua Zhao, Weifeng Xi'an Jiaotong University School of Software Engineering Xi'an China School of Computer Science Xi'an China Tencent Music Entertainment Lyra Lab Shenzhen China

ISBN: (纸本)9798350306897

This paper presents the T02 team's system for the Singing Voice Conversion Challenge 2023 (SVCC2023). Our system entails a VITS-based SVC model, incorporating three modules: a feature extractor, a voice converter, and a postprocessor. Specifically, the feature extractor provides F0 contours and extracts speaker-independent linguistic content from the input singing voice by leveraging a HuBERT model. The voice converter is employed to recompose the speaker timbre, F0, and linguistic content to generate the waveform of the target speaker. Besides, to further improve the audio quality, a fine-tuned DSPGAN vocoder is introduced to resynthesise the waveform. Given the limited target speaker data, we utilize a two-stage training strategy to adapt the base model to the target speaker. During model adaptation, several tricks, such as data augmentation and joint training with auxiliary singer data, are involved. Official challenge results show that our system achieves superior performance, especially in the cross-domain task, ranking 1st and 2nd in naturalness and similarity, respectively. Further ablation justifies the effectiveness of our system design. © 2023 IEEE.

关键词： Linguistics

来源：评论

学校读者我要写书评

暂无评论

General Optimal Trajectory Planning:Enabling Autonomous Vehicles with the Principle of Least Action

引用

engineering 2024年第2期33卷 63-76页

作者： Heye Huang Yicong Liu Jinxin Liu Qisong Yang Jianqiang Wang David Abbink Arkady Zgonnikov School of Vehicle and Mobility Tsinghua UniversityBeijing 100084China Department of Cognitive Robotics Faculty of MechanicalMaritime and Materials Engineering(3mE)Delft University of TechnologyDelft 2628Netherlands Department of Software Technology Faculty of Electrical EngineeringMathematics and Computer ScienceDelft University of TechnologyDelft 2628Netherlands Xi’an Institute of High-Technology Xi’an 710051China

This study presents a general optimal trajectory planning(GOTP)framework for autonomous vehicles(AVs)that can effectively avoid obstacles and guide AVs to complete driving tasks safely and ***,we employ the fifth-order Bezier curve to generate and smooth the reference path along the road *** coordinates are then transformed to achieve the curvature continuity of the generated *** the road constraints and vehicle dynamics,limited polynomial candidate trajectories are generated and smoothed in a curvilinear coordinate ***,in selecting the optimal trajectory,we develop a unified and auto-tune objective function based on the principle of least action by employing AVs to simulate drivers’behavior and summarizing their manipulation characteristics of“seeking benefits and avoiding losses.”Finally,by integrating the idea of receding-horizon optimization,the proposed framework is achieved by considering dynamic multi-performance objectives and selecting trajectories that satisfy feasibility,optimality,and *** simulations and experiments are performed,and the results demonstrate the framework’s feasibility and effectiveness,which avoids both dynamic and static obstacles and applies to various scenarios with multi-source interactive traffic ***,we prove that the proposed method can guarantee real-time planning and safety requirements compared to drivers’manipulation.

关键词： Autonomous vehicle Trajectory planning Multi-performance objectives Principle of least action

来源：评论

学校读者我要写书评

暂无评论

A Neural Architecture Search Method with Multi-Dimensional Correlation Representation for Fault Diagnosis 9

A Neural Architecture Search Method with Multi-Dimensional C...

引用

9th IEEE Smart World Congress, SWC 2023

作者： Liu, Yumeng Wang, Tingqi Zheng, Xu Tian, Ling Wang, Hongan Institute of Software Chinese Academy of Sciences Beijing Key Laboratory of Human-Computer Interaction Beijing China University of Chinese Academy of Sciences School of Computer Science and Technology Beijing China University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu China

ISBN: (纸本)9798350319804

As deep learning has become more widely used for fault diagnosis, the shortcomings of model transferability and human model design costs are growing increasingly evident. The current work has tackled each of these two issues. Domain adaptation methods can provide transportability by mapping data to a common domain. For the consumption of manually constructed networks, Neural Architecture Search (NAS) is an intelligent solution that automatically select the ideal network structure. Unfortunately, there is little work to connect these two methodologies in fault diagnosis. Furthermore, these approaches are incapable in extracting internal correlations from instrumental signal data. In this paper, we propose a transferrable NAS fault diagnosis method, which maximizes savings in manual costs. We also integrate graph neural networks (GNN) in a stepwise manner into the NAS and domain adaptation to provide a multi-dimension correlation representation. Firstly, we structure the signal data into graph based on temporal relationships. Then, NAS designs automatically for selecting the optimal network structure and useful features. In NAS, graph encoder of GNN is used to establish internal relationships. Finally, domain adaptation provides transferability. At the same time, GNN's weights in domain adaptation help to further mine data internal associations. We tested our method on two publicly available datasets and performed comparisons. The experimental results show the proposed method has superior performance. © 2023 IEEE.

关键词： Domain Adaptation Fault Diagnosis Graph Neural Network Neural Architecture Search

来源：评论

学校读者我要写书评

暂无评论

An Online Integrated Development Environment for Automated Programming Assessment Systems 17

An Online Integrated Development Environment for Automated P...

引用

17th International Conference on computer Supported Education, CSEDU 2025

作者： Frankford, Eduard Crazzolara, Daniel Vierhauser, Michael Meißner, Niklas Krusche, Stephan Breu, Ruth University of Innsbruck Department of Computer Science Austria University of Stuttgart Institute of Software Engineering Germany Technical University of Munich School of Computation Information and Technology Germany

ISBN: (纸本)9789897587467

The increasing demand for programmers has led to a surge in participants in programming courses, making it increasingly challenging for instructors to assess student code manually. As a result, automated programming assessment systems (APASs) have been developed to streamline this process. These APASs support lecturers by managing and evaluating student programming exercises at scale. However, these tools often do not provide feature-rich online editors compared to their traditional integrated development environments (IDEs) counterparts. This absence of key features, such as syntax highlighting and autocompletion, can negatively impact the learning experience, as these tools are crucial for effective coding practice. To address this gap, this research contributes to the field of programming education by extracting and defining requirements for an online IDE in an educational context and presenting a prototypical implementation of an open-source solution for a scalable and secure online IDE. The usability of the new online IDE was assessed using the Technology Acceptance Model (TAM), gathering feedback from 27 first-year students through a structured survey. In addition to these qualitative insights, quantitative measures such as memory (RAM) usage were evaluated to determine the efficiency and scalability of the tool under varying usage conditions. Copyright © 2025 by SCITEPRESS - science and Technology Publications, Lda.

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

MPNAS: Multimodal Sentiment Analysis Pruning via Neural Architecture Search

MPNAS: Multimodal Sentiment Analysis Pruning via Neural Arch...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Zhang, Binyan Ren, Ao Zhang, Zihao Duan, Moming Liu, Duo Tan, Yujuan Zhong, Kan College of Computer Science Chongqing University Chongqing China School of Big Data Software & Engineering Chongqing University Chongqing China Institute of Data Science National University of Singapore Singapore

ISBN: (纸本)9798350368741

With the rapid development of social media, sentiment analysis from multimodal posts has garnered significant attention in recent years. However, the substantial size of these models impedes their deployment on resource-constrained embedded devices. Although pruning has been extensively studied to reduce the size of unimodal models, specific challenges remain for Multimodal Sentiment Analysis (MSA) models. First, existing techniques prune fixed original models into sparse models, while our findings indicate that different model architectures of identical size yield varying performance outcomes. Second, prior studies fail to explore the unique characteristics of MSA models, resulting in suboptimal pruning performance. To address these challenges, we propose MPNAS, a unified pruning framework via Neural Architecture Search (NAS) for MSA models. Specifically, we formulate pruning as a NAS problem and analyze MSA model characteristics to guide the subnet search. We conduct an initial coarse-grained NAS on the original model, expanding the search space slightly to identify suitable subnets that enhance pruning rates and accuracy. Subsequently, we refine coarse-grained subnets in a fine-grained NAS stage, where MSA model characteristics guide the search process. Extensive experiments on three representative datasets demonstrate the superiority of our approach over existing methods. © 2025 IEEE.

关键词： Multimodal Compression NAS

来源：评论

学校读者我要写书评

暂无评论

QUEST: quadruple multimodal contrastive learning with constraints and self-penalization 24

QUEST: quadruple multimodal contrastive learning with constr...

引用

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

作者： Qi Song Tianxiang Gong Shiqi Gao Haoyi Zhou Jianxin Li School of Software Beihang University School of Computer Science and Engineering Beihang University School of Software Beihang University and Zhongguancun Laboratory Beijing School of Computer Science and Engineering Beihang University and Zhongguancun Laboratory Beijing

ISBN: (纸本)9798331314385

Multimodal contrastive learning (MCL) has recently demonstrated significant success across various tasks. However, the existing MCL treats all negative samples equally and ignores the potential semantic association with positive samples, which limits the model's ability to achieve fine-grained alignment. In multi-view scenarios, MCL tends to prioritize shared information while neglecting modality-specific unique information across different views, leading to feature suppression and suboptimal performance in downstream tasks. To address these limitations, we propose a novel contrastive framework named QUEST: Quadruple Multimodal Contrastive Learning with Constraints and Self-Penalization. In the QUEST framework, we propose quaternion contrastive objectives and orthogonal constraints to extract sufficient unique information. Meanwhile, a shared information-guided penalization is introduced to ensure that shared information does not excessively influence the optimization of unique information. Our method leverages quaternion vector spaces to simultaneously optimize shared and unique information. Experiments on multiple datasets show that our method achieves superior performance in multimodal contrastive learning benchmarks. On public benchmark, our approach achieves state-of-the-art performance, and on synthetic shortcut datasets, we outperform existing baseline methods by an average of 97.95% on the CLIP model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MOFC: Network Embedding Based on Multi-Orders Friends Contribution for User Identification 6

MOFC: Network Embedding Based on Multi-Orders Friends Contri...

引用

6th International Conference on Algorithms, Computing and Artificial Intelligence, ACAI 2023

作者： Zhang, Jiajing Xu, Neng Chen, Jinlan Ma, Tinghuai School of Electronics and Information Engineering Anhui Jianzhu University China School of Mechanical and Electrical Engineering Anhui Jianzhu University China School of Computer and Software Nanjing University of Information Science & Technology China

ISBN: (纸本)9798400709203

Different social networks are independent of each other, and identifying the same person in different social networks is of great significance for cross-network information dissemination and the construction of a complete portrait of users. Existing methods for user identification via network embedding ignore the different contributions of neighbors and only consider low-order friend relationships. Aiming at these shortcomings, an algorithm of Network Embedding based on Multi-Orders Friends Contribution for User Identification (MOFC) is proposed. Firstly, the difference contribution degree of nodes to their friends is used to assign different weights to the edges between the nodes and their friends. Secondly, the embedding representation vectors of multi-orders friend contribution are used to describe the different orders friend relations of the nodes, and then the representation vectors of different orders are merged to more comprehensively represent network features. Finally, the fusion representation vectors are used as input sample of a neural network to train and build a user identification model. Experiments show that the evaluation indicators of the model have been significantly improved compared with several advanced methods. Compared with the newer and better the CSN_LINE, the accuracy rate of MOFC can be increased by 4.83%, the precision rate can be increased by 6.77%, the recall rate can be increased by 5.49%, the F1-score can be increased by 5.43%. © 2023 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Network embeddings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：