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

arXiv 2025年

作者： Li, Zhenglai Wang, Jun Tang, Chang Zhu, Xinzhong Zhang, Wei Liu, Xinwang Faculty of data science City University of Macau 999078 China School of computer National University of Defense Technology Changsha410073 China School of computer China University of Geosciences Wuhan430074 China College of Mathematics Physics and Information Engineering Zhejiang Normal University Jinhua China Research Institute of Ningbo Cixing Co. Ltd Ningbo China Qilu University of Technology Shandong Academy of Sciences China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan250000 China

Multi-view clustering (MvC) aims to integrate information from different views to enhance the capability of the model in capturing the underlying data structures. The widely used joint training paradigm in MvC is potentially not fully leverage the multi-view information, since the imbalanced and under-optimized view-specific features caused by the uniform learning objective for all views. For instance, particular views with more discriminative information could dominate the learning process in the joint training paradigm, leading to other views being under-optimized. To alleviate this issue, we first analyze the imbalanced phenomenon in the joint-training paradigm of multi-view clustering from the perspective of gradient descent for each view-specific feature extractor. Then, we propose a novel balanced multi-view clustering (BMvC) method, which introduces a view-specific contrastive regularization (VCR) to modulate the optimization of each view. Concretely, VCR preserves the sample similarities captured from the joint features and view-specific ones into the clustering distributions corresponding to view-specific features to enhance the learning process of view-specific feature extractors. Additionally, a theoretical analysis is provided to illustrate that VCR adaptively modulates the magnitudes of gradients for updating the parameters of view-specific feature extractors to achieve a balanced multi-view learning procedure. In such a manner, BMvC achieves a better trade-off between the exploitation of view-specific patterns and the exploration of view-invariance patterns to fully learn the multi-view information for the clustering task. Finally, a set of experiments are conducted to verify the superiority of the proposed method compared with state-of-the-art approaches on eight benchmark MvC datasets. The demo code of this work is publicly available at https://***/guanyuezhen/BMvC. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient VM consolidation algorithm for cloud data centers 5

An energy-efficient VM consolidation algorithm for cloud dat...

引用

5th International Conference on Information Science and Cloud computing, ISCC 2017

作者： Wu, Xiaodong Faculty of Mathematics and Computer Science Quanzhou Normal University Fujian Provincial Key Laboratory of Data Intensive Computing Quanzhou362000 China

Cloud data centers consume vast amounts of electrical energy all over the world. Energy conservation in data centers has become a severe problem. This paper presents an energy-efficient virtual machine (VM) consolidation algorithm for cloud data centers. The proposed policy exploits the average utilization of each VM to estimate the expected utilization of physical hosts. Then, the expected utilization, the actual utilization and the static threshold are combined together to determine whether a host is at the status of overloading or not. Some VM(s) on the overloading hosts are then selected for migration to avoid Service Level Agreements (SLA) violations. The results of the experiment show that the proposed algorithm can effectively reduce energy consumption while guarantee SLAs. © Copyright owned by the author(s).

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Design and practice of virtual simulation of industrial Internet 4

Design and practice of virtual simulation of industrial Inte...

引用

4th International Conference on Advances in Computer Technology, Information Science and Communications, CTISC 2022

作者： Wu, Qingjin Zeng, Taisheng Zhu, Daxin Cai, Danlin Quanzhou Normal University Laboratory and Equipment Management Office Quanzhou China Quanzhou Normal University School of Mathematics and Computer Science Fujian Provincial Key Laboratory of Data Intensive Computing Quanzhou China Quanzhou Normal University Fujian Provincial Key Laboratory of Data Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Quanzhou China Quanzhou Normal University School of Mathematics and Computer Science Key Laboratory of Intelligent Computing and Information Quanzhou China

ISBN: (数字)9781665458726

ISBN: (纸本)9781665458726

In the cultivating new engineering talents of information discipline, people tend to adopt virtual simulation to simulate production line scenes of enterprises' intelligent manufacturing so as to solve the problem that students fail to go deep into the production lines of industrial fields for scene practice and that they can not collect, analyze and optimize data in the real intelligent manufacturing production lines. The innovative talent training methods which combine regional industries can be used to improve students' ability to analyze, design, debug, operate, maintain and optimize the intelligent manufacturing big data and to master methods and ideas for solving complex engineering problems with big data technology. They can also provide beneficial experience references for the training of new engineering talents of information discipline. © 2022 IEEE.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

A 3D Memristive Cubic Map with Dual Discrete Memristors: Design, Implementation, and Application in Image Encryption

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Gao, Suo Iu, Herbert Ho-Ching Erkan, Ugur Simsek, Cemaleddin Toktas, Abdurrahim Cao, Yinghong Wu, Rui Mou, Jun Li, Qi Wang, Chunpeng Dalian Polytechnic University School of Information Science and Engineering Dalian116034 China The University of Western Australia School of Electrical Electronic and Computer Engineering Perth6009 Australia Faculty of Engineering Electrical and Electronics Engineering Respectively Karamanoglu Mehmetbey University Karaman70200 Turkey Ankara University Engineering Faculty Department of Artificial Intelligence and Data Engineering Ankara06830 Turkey Harbin Institute of Technology School of Computer Science and Technology Harbin150001 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan250000 China

Discrete chaotic systems based on memristors exhibit excellent dynamical properties and are more straightforward to implement in hardware, making them highly suitable for generating cryptographic keystreams. However, most existing memristor-based chaotic systems rely on a single memristor. This paper introduces a novel discrete chaotic system employing dual memristors, named the 3D memristive cubic map with dual discrete memristors (3D-MCM). The 3D-MCM system demonstrates richer and more intricate dynamical behaviors compared to its single-memristor counterparts, as verified through bifurcation diagrams, Lyapunov exponent spectra, and complexity analyses. Notably, the system exhibits coexisting attractors, substantially enhancing its dynamical complexity. Hardware implementation of the 3D-MCM attractors confirms its feasibility for industrial applications. To illustrate the system's potential in encryption tasks, this study integrates the quaternary-based permutation and dynamic emanating diffusion (QPDED-IE) scheme for image encryption with the *** results demonstrate that the QPDED-IE scheme based on the 3D-MCM exhibits strong diffusion and confusion properties, effectively resisting cryptanalytic attacks. © 1991-2012 IEEE.

关键词： Bifurcation (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Improved lattice-based CCA2-secure PKE in the standard model

引用

Science China(Information Sciences) 2020年第8期63卷 147-168页

作者： Jiang ZHANG Yu YU Shuqin FAN Zhenfeng ZHANG State Key Laboratory of Cryptology Guangdong Provincial Key Laboratory of Data Security and Privacy Protection Jinan University Department of Computer Science and Engineering Shanghai Jiao Tong University Trusted Computing and Information Assurance Laboratory Institute of SoftwareChinese Academy of Sciences

Based on the identity-based encryption(IBE) from lattices by Agrawal et al.(Eurocrypt’10),Micciancio and Peikert(Eurocrypt’12) presented a CCA1-secure public-key encryption(PKE), which has the best known efficiency in the standard model and can be used to obtain a CCA2-secure PKE from lattices by using the generic BCHK transform(SIAM J Comput, 2006) with a cost of introducing extra overheads to both computation and storage for the use of other primitives such as signatures and commitments. In this paper, we propose a more efficient standard model CCA2-secure PKE from lattices by carefully combining a different message encoding(which encodes the message into the most significant bits of the LWE’s "secret term") with several nice algebraic properties of the tag-based lattice trapdoor and the LWE problem(such as unique witness and additive homomorphism). Compared to the best known lattice-based CCA1-secure PKE in the standard model due to Micciancio and Peikert(Eurocrypt’12), we not only directly achieve the CCA2-security without using any generic transform(and thus do not use signatures or commitments), but also reduce the noise parameter roughly by a factor of 3. This improvement makes our CCA2-secure PKE more efficient in terms of both computation and storage. In particular, when encrypting a 256-bit(respectively,512-bit) message at 128-bit(respectively, 256-bit) security, the ciphertext size of our CCA2-secure PKE is even 33%–44%(respectively, 36%–46%) smaller than that of their CCA1-secure PKE.

关键词： lattice public-key encryption chosen ciphertext security standard model

来源：评论

学校读者我要写书评

暂无评论

Regression-based execution time prediction in hadoop environment

Regression-based execution time prediction in hadoop environ...

引用

International Conference on Information Technology and Computer Application Engineering, ITCAE 2014

作者： Wu, Xiao Dong Zeng, Yu Zhu Zhao, C.T. Faculty of Mathematics and Computer Science Quanzhou Normal University China Fujian Provincial Key Laboratory of Data Intensive Computing China Key Laboratory of Intelligent Computing and Information Processing Fujian Province University China

ISBN: (纸本)9781138027176

Hadoop MapReduce has been proven an effective computing model to deal with big data for the last few years. However, one technical challenge facing this framework is how to predict the execution time of an individual job. In this paper, we propose a regression-based method to predict the execution times of Hadoop jobs. The proposed prediction method consists of three phases: learning data sampling, regression analysis and making prediction. Experimental results show that the predicted execution time obtained by our method is close to the actual execution time. © 2015 Taylor & Francis Group, London.

关键词： Regression analysis

来源：评论

学校读者我要写书评

暂无评论

A Local Regression-Based SLA-Aware Energy-Efficient Virtual Machine Consolidation Algorithm in data Centers 9

A Local Regression-Based SLA-Aware Energy-Efficient Virtual ...

引用

9th International Conference on Big data computing and Communications, BigCom 2023

作者： Wu, Xiaodong Wang, Ronghai Lin, Guoxin Quanzhou Normal University School of Mathmatics and Computer Science China Fujian Province University Fujian Provincial Key Laboratory of Data-Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian China Provincial Big Data Research Institute of Intelligent Manufacturing Quanzhou China

ISBN: (纸本)9798350331240

Virtual Machine Consolidation (VMC) is an effective means to improve the resource utilization and reduce energy consumption of data centers. However, the VMC optimization that only considers energy consumption may lead to SLA (Service-Level Agreements) violations and thus fail to guarantee the QoS (Quality of Service) provided. Therefore, it is necessary to consider both energy saving and SLA violations in the process of VMC. In this paper, we propose an energy and SLA-aware VMC algorithm that considers both energy saving and SLA violation optimization in data centers. The proposed algorithm uses the local regression method to predict the utilization of virtual machines, based on which it determines whether the host will be overloaded, so as to make the decision of virtual machine migrations. The proposed VMC algorithm is evaluated with CloudSim toolkit. Simulation results demonstrate that our algorithm has good energy saving performance and can effectively reduce SLA violation in cloud data center. Considering energy consumption and SLA violation, the ESV can be reduced by 7.57% on average and 16.36% at most compared with other algorithms. © 2023 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Auction Theory and Game Theory Based Pricing of Edge computing Resources: A Survey

引用

IEEE Internet of Things Journal 2025年

作者： Yu, Jiguo Liu, Shun Zou, Yifei Wang, Guijuan Hu, Chunqiang University of Electronic Science and Technology of China School of Information and Software Engineering Chengdu610054 China Qilu University of Technology Big Data Institute Jinan250353 China Qufu Normal University School of Computer Science Shandong Rizhao China Shandong University School of Computer Science and Technology Shandong Qingdao266237 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250353 China Chongqing University School of Big Data and Software Engineering Chongqing400044 China

The proliferation of Internet of Things (IoT) devices and edge computing applications has heightened the demand for efficient resource allocation and pricing mechanisms. Effective pricing strategies play a crucial role in optimizing resource utilization, reducing latency, and ensuring fair resource distribution among users. Both auction theory and game theory have emerged as fundamental economic frameworks for designing pricing mechanisms in edge computing. This paper presents a comprehensive survey of pricing strategies that leverage both auction and game theory, systematically categorizing existing research based on auction mechanisms and game-theoretic models. Unlike previous surveys that focus solely on auction-based pricing, this work integrates game-theoretic perspectives, providing a holistic analysis of strategic interactions in edge computing resource allocation. Furthermore, we discuss key challenges, emerging trends, and future research directions aimed at enhancing efficiency, fairness, and privacy protection in cloud-edge collaborative computing environments. © 2014 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

The analysis of big data application mode and security risk

The analysis of big Data application mode and security risk

引用

International Conference on Information Sciences,Machinery,Materials and Energy（ICISMME 2015）

作者： ZENG Tai-sheng Faculty of Mathematics and Computer Science Quanzhou Normal University Fujian Provincial Key Laboratory of Data Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian Province University

ISBN: (纸本)9789462520677

In the current social background,Existing facilities and tools already can not meet the needs of big data in expanding and analysis ***'s data storage and analysis work is achieved under cloud conditions and Hadoop were set *** the conditions for cloud computing,cloud computing applications who have remote data files were not authorized to read its contents,which results in unauthorized manipulation,and it will produce a lot of security risks for large *** this paper,according to the cloud of different modes,Hadoop different stages of the operation,subject to the threat of non- confidence and security to steal big data generated to analyze a variety of privacy,with threat model as an example,it explores ways to address security threats.

关键词： big data security analysis Hadoop

来源：评论

学校读者我要写书评

暂无评论

DRLO: Optimizing edge server placement in dynamic MEC scenarios using deep reinforcement learning

引用

Computer Networks 2025年 268卷

作者： Yingya Guo Cen Chen College of Computer and Data Science Fuzhou University PR China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University PR China Engineering Research Center of Big Data Intelligence Ministry of Education Fujian PR China

As an emerging computing paradigm, Mobile Edge computing (MEC) significantly enhances user experience and alleviates network congestion by strategically deploying edge servers in close proximity to mobile users. However, the effectiveness of MEC hinges on the precise placement of these edge servers, a critical factor in determining the Quality of Experience (QoE) for mobile users. While existing studies predominantly focus on optimizing edge server placement in static scenarios, they often fall short when faced with user mobility, resulting in a degradation of QoE. To address this challenge, we propose an adaptive edge server placement approach that leverages Deep Reinforcement Learning (DRL) to select the base stations for placing edge servers in a dynamic MEC environment. Our objective is to minimize access delay by optimizing edge server placement for adapting to dynamic environment. To tackle the vast action space associated with edge server placement, we introduce a novel activation function in the actor neural network for efficient exploration. Furthermore, to enhance the adaptability of the derived edge server placement strategy, we meticulously design a new reward function, which takes into account the minimization of total access delay within dynamic MEC scenarios. Finally, to validate the effectiveness of our proposed method, extensive experiments were conducted using the Shanghai Telecom dataset. The results demonstrate that our approach outperforms baseline methods in minimizing access delay for users in dynamic MEC scenarios.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：