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

arXiv 2022年

作者： Liu, Decheng Dang, Zhan Peng, Chunlei Zheng, Yu Li, Shuang Wang, Nannan Gao, Xinbo The State Key Laboratory of Integrated Services Networks School of Cyber Engineering Xidian University Shaanxi Xi’an710071 China The School of Cyber Engineering Xidian University Shaanxi Xi’an710071 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai201112 China The State Key Laboratory of Integrated Services Networks School of Telecommunications Engineering Xidian University Shaanxi Xi’an710071 China The Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Chongqing400065 China

With the continuous development of deep learning in the field of image generation models, a large number of vivid forged faces have been generated and spread on the Internet. These high-authenticity artifacts could grow into a threat to society security. Existing face forgery detection methods directly utilize the obtained public shared or centralized data for training but ignore the personal privacy and security issues when personal data couldn’t be centralizedly shared in real-world scenarios. Additionally, different distributions caused by diverse artifact types would further bring adverse influences on the forgery detection task. To solve the mentioned problems, the paper proposes a novel generalized residual Federated learning for face Forgery detection (FedForgery). The designed variational autoencoder aims to learn robust discriminative residual feature maps to detect forgery faces (with diverse or even unknown artifact types). Furthermore, the general federated learning strategy is introduced to construct distributed detection model trained collaboratively with multiple local decentralized devices, which could further boost the representation generalization. Experiments conducted on publicly available face forgery detection datasets prove the superior performance of the proposed FedForgery. The designed novel generalized face forgery detection protocols and source code would be publicly available at https://***/GANG370/FedForgery. Copyright © 2022, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

An Influence Maximization Algorithm Based on Real-Time and De-superimposed Diffusibility 15th

An Influence Maximization Algorithm Based on Real-Time and D...

引用

15th EAI International Conference on Collaborative Computing: Networking, Applications and Worksharing, CollaborateCom 2019

作者： Ren, Yue Zhang, Xinyuan Xia, Liting Lin, Yongze Zhao, Yue Li, Weimin School of Computer Engineering and Technology Shanghai University Shanghai China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China

ISBN: (纸本)9783030301453

Influence maximization is to find a small number of seed nodes in the network that maximize their influence on the network. Existing algorithms select a seed node with the greatest influence. This will inevitably have an influence on mutual coverage, which will have a more or less negative impact on the final results and reduce the performance of the algorithm. In this paper, Node Diffusibility is proposed, and it is updated in real time and eliminated the deviation caused by its overlay. On the basis of traditional calculation of node influence, more attention was paid to the influence of a node’s neighboring nodes rather than to the characteristics of the nodes themselves. The proposed algorithm was evaluated by experiments conducted on selected real data sets. Compared with the classical ranking-based algorithms, MaxDegree and PageRank, the proposed algorithm achieved better results in terms of efficiency and time complexity. © 2019, ICST Institute for computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Research Review on Web Service Composition testing 8th

Research Review on Web Service Composition Testing

引用

8th International Workshop on Structured Object-Oriented Formal Language and Method, SOFL+MSVL 2018

作者： Du, Zhoujie Miao, Huaikou School of Computer Engineering and Science Shanghai University Shanghai China Shanghai Key Laboratory of Computer Software Testing and Evaluating Shanghai China

ISBN: (纸本)9783030136505

Web services composition is designed to achieve a more powerful and large-grained services with organic synthesis of different Web services. In order to guarantee the quality of the Web services composition, comprehensive and adequate testing of the Web services composition is required. However, the dynamic and distributed characteristics of Web services combination make its testing technology and method have big difference with the traditional software testing and bring a large of challenges. In this paper, we summarize and analyze the definition, architecture, testing methods and testing techniques of Web service composition. In addition, we also analyze and prospect the progress of Web services combination testing. © 2019, Springer Nature Switzerland AG.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Combining Product Line Approach and Formal Specification for Product Family Modeling 5

Combining Product Line Approach and Formal Specification for...

引用

5th IEEE International Conference on computer and Communications, ICCC 2019

作者： Wang, Xi Shanghai University School of Computer Engineering and Science Shanghai China Shanghai Key Laboratory of Computer Software Testing and Evaluating Shanghai201114 China

ISBN: (纸本)9781728147437

The lack of systematic approach for product family modeling leads to difficulties in developing a series of high-quality software products simultaneously. This paper tackles this challenge by combining product line approach and formal specification technique. After constructing the feature model of the target family, our approach will start the formalization of the bottom-level features. For each feature, a formal model will be built according to its inner structure and function details. Any problem occurred during this process will cause the evolvement of the feature model under the guidance of a set of pre-defined evolution rules. The final product family model will be established when no problem can be found in both feature model and feature specification. This interleaving of feature model evolvement and feature formalization facilitates consistent and complete product family modeling from both abstract and concrete levels. A case study is given to illustrate the validity of the approach. © 2019 IEEE.

关键词： Formal specification

来源：评论

学校读者我要写书评

暂无评论

An Optimization Method Based on Be-ACO Algorithm in Service Composition Context

引用

Computational intelligence and neuroscience 2022年第1期2022卷 5231262页

作者： Zhoujie Du Huaikou Miao School of Computer Engineering and Science Shanghai University Shanghai 200444 China. Shanghai Key Laboratory of Computer Software Testing and Evaluating Shanghai 201112 China.

With the increasing complexity of users' needs and increasing uncertainty of a single web service in big data environment, service composition becomes more and more difficult. In order to improve the solution accuracy and computing speed of the constrained optimization model, several improvements are raised on ant colony optimization (ACO) and its calculation strategy. We introduce beetle antenna search (BAS) strategy to avoid the danger of falling into local optimization, and a service composition method based on fusing beetle-ant colony optimization algorithm (Be-ACO) is proposed. The model first generates search subspace for ant colony through beetle antenna search strategy and optimization service set by traversing subspace based on ant colony algorithm. Continuously rely on beetle antenna search strategy to generate the next search subspace in global scope for ant colony to traverse and converge to the global optimal solution finally. The experimental results show that compared with the traditional optimization method, the proposed method improves combination optimization convergence performance and solution accuracy greatly.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Resource Scheduling with Fault-Tolerance in Edge Computing 16th

Energy-Aware Resource Scheduling with Fault-Tolerance in Edg...

引用

16th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2019

作者： Xue, Yanfen Fan, Guisheng Yu, Huiqun Sun, Huaiying Department of Computer Science and Engineering East China University of Science and Technology Shanghai China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China

ISBN: (纸本)9783030307080

Edge computing extends computation and storage resources to the edge of the network, which largely improve the performance problem of cloud computing incurred by the bandwidth limitation. And it still needs to address the challenges of energy and reliability. In this paper, we propose an energy-aware fault-tolerant resource scheduling algorithm to improve system reliability while minimizing the energy consumption. We allocate resources by reliability and energy-aware resource scheduling method for tasks firstly. Then, CPU temperature prediction and time between failures (TBF) prediction are used to trigger proactive fault tolerance mechanism (VM migration). The experimental results show that the reliability is greatly improved and energy consumption generated by VM migration is not very large compared to other methods. © 2019, IFIP International Federation for Information Processing.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Message from the InSTA 2022 chairs

Proceedings - 2022 IEEE 14th International Conference on Sof...

引用

Proceedings - 2022 IEEE 14th International Conference on software testing, Verification and Validation Workshops, ICSTW 2022 2022年 xvii页

作者： Masuda, Satoshi Nishi, Yasuharu Hagar, Jon Katayama, Tetsuro Liu, Qin Liu, Zhenyu Tsuda, Kazuhiko Yumoto, Tsuyoshi Takeda, T. Zhang, W. Hiruta, Y. Suhara, H. Masuda, S. Suzuki, K. Hagar, J. Tokyo City University Japan The University of Electro-Communications Japan Grand Software Testing United States University of Miyazaki Japan Tongji University China Shanghai Key Laboratory of Computer Software Testing and Evaluation China China University of Tsukuba Japan Japan Npo ASTER Japan Japan Software Bug Prediction Model Based on Mathematical Graph Features Metrics Japan Obtaining Fuzzing Results with Different Timeouts

来源：评论

学校读者我要写书评

暂无评论

An empirical study on optimal solutions selection strategies for effort-aware just-in-time software defect prediction 31

An empirical study on optimal solutions selection strategies...

引用

31st International Conference on software Engineering and Knowledge Engineering, SEKE 2019

作者： Yang, Xingguang Yu, Huiqun Fan, Guisheng Yang, Kang Department of Computer Science and Engineering East China University of Science and Technology Shanghai200237 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai201112 China Shanghai Engineering Research Center of Smart Energy Shanghai China

ISBN: (纸本)1891706489

Just-in-time software defect prediction (JIT-SDP) is an active topic in the filed of software engineering, and many methods have been proposed to solve this problem. State-of-the-art method MULTI applies multi-objective optimization algorithm to the effort-aware JIT-SDP problem, and obtains good average performance. Although the average performance of the MULTI method is high, there are many optimal solutions with poor performance. If an optimal solution is randomly selected, a poor prediction model may be obtained. In order to further improve the performance of the MULTI method, we propose three optimal solutions selection strategies: benefit priority (BP), cost priority (CP), and a compromise between cost and benefit (CCB). In order to compare and validate the effectiveness of the strategies, we conduct a large-scale empirical study on data sets of six open source projects. The experimental results show that, compared with the average performance of MULTI, the optimal solutions selection strategy based on BP has a significant improvement in ACC and Popt indicators. Therefore, we recommend using the BP-based optimal solutions selection strategy to improve the performance of MULTI when using the MULTI method to solve the effort-aware JIT-SDP problem. © 2019 Knowledge Systems Institute Graduate School. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Neighborhood-based uncertain QoS prediction of web services via matrix factorization 14th

Neighborhood-based uncertain QoS prediction of web services ...

引用

14th EAI International Conference on Collaborative Computing: Networking, Applications and Worksharing, CollaborateCom 2018

作者： Zou, Guobing Pang, Shengye Wang, Pengwei Miao, Huaikou Niu, Sen Gan, Yanglan Zhang, Bofeng School of Computer Engineering and Science Shanghai University Shanghai China School of Computer Science and Technology Donghua University Shanghai China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China School of Computer and Information Engineering Shanghai Polytechnic University Shanghai China

ISBN: (纸本)9783030129804

With the rapidly overwhelming number of services on the internet, QoS-based web service recommendation has become an urgent demand on service-oriented applications. Since there are a large number of missing QoS values in the user historical invocation records, accurately predicting these missing QoS values becomes a hot research issue. However, most existing service QoS prediction research assumes that the transactional process of the service was stable, and its QoS doesn’t change as time goes. In fact, service invocation process is usually affected by many factors (e.g., geographical location, network environment), leading to service invocations with QoS uncertainty. Therefore, QoS prediction based on traditional methods can not exactly adapt to the scenarios in real-world applications. To solve the issue, combined with the collaborative filtering and matrix factorization theory, we propose a novel approach for prediction of uncertain service QoS under the dynamic Internet environment. Extensive experiments have been conducted on a real-world data set and the results demonstrate the effectiveness and applicability of our approach for QoS prediction. © 2019, ICST Institute for computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

imBBO: An Improved Biogeography-Based Optimization Algorithm 13th

imBBO: An Improved Biogeography-Based Optimization Algorithm

引用

13th International Conference on Green, Pervasive, and Cloud Computing, GPC 2018

作者： Shi, Kai Yu, Huiqun Fan, Guisheng Yang, Xingguang Song, Zheng Department of Computer Science and Engineering East China University of Science and Technology Shanghai200237 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai201112 China The Third Research Institute of the Ministry of Public Security Shanghai China

ISBN: (纸本)9783030150921

Biogeography based Optimization (BBO) is a new evolutionary optimization algorithm based on the science of biogeography for global optimization. However, its direct-copying-based migration and random mutation operators make it easily possess local exploitation ability. To enhance the performance of BBO, we propose an improved BBO algorithm called imBBO. A hybrid migration operation is designed to further improve the population diversity and enhance the algorithm exploration ability. Empirical results demonstrate that our imBBO effectively gains the high optimization performance by comparing with the original BBO and three BBO variants for 23 out of 30 CEC’2017 benchmarks. Moreover, our imBBO presents a faster convergence speed. © 2019, Springer Nature Switzerland AG.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：