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

arXiv 2024年

作者： Tan, Rong-Xi Xue, Ke Lyu, Shen-Huan Shang, Haopu Wang, Yao Wang, Yaoyuan Fu, Sheng Qian, Chao National Key Laboratory for Novel Software Technology Nanjing University China School of Artificial Intelligence Nanjing University China Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University China College of Computer Science and Software Engineering Hohai University China Huawei Technologies Ltd. China

Offline model-based optimization (MBO) aims to identify a design that maximizes a black-box function using only a fixed, pre-collected dataset of designs and their corresponding scores. This problem has garnered significant attention from both scientific and industrial domains. A common approach in offline MBO is to train a regression-based surrogate model by minimizing mean squared error (MSE) and then find the best design within this surrogate model by different optimizers (e.g., gradient ascent). However, a critical challenge is the risk of out-of-distribution errors, i.e., the surrogate model may typically overestimate the scores and mislead the optimizers into suboptimal regions. Prior works have attempted to address this issue in various ways, such as using regularization techniques and ensemble learning to enhance the robustness of the model, but it still remains. In this paper, we argue that regression models trained with MSE are not well-aligned with the primary goal of offline MBO, which is to select promising designs rather than to predict their scores precisely. Notably, if a surrogate model can maintain the order of candidate designs based on their relative score relationships, it can produce the best designs even without precise predictions. To validate it, we conduct experiments to compare the relationship between the quality of the final designs and MSE, finding that the correlation is really very weak. In contrast, a metric that measures order-maintaining quality shows a significantly stronger correlation. Based on this observation, we propose learning a ranking-based model that leverages learning to rank techniques to prioritize promising designs based on their relative scores. We show that the generalization error on ranking loss can be well bounded. Empirical results across diverse tasks demonstrate the superior performance of our proposed ranking-based models than twenty existing methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Optimized Security Mechanism for publicly Secret Key Sharing over Cloud using Blockchain

Optimized Security Mechanism for publicly Secret Key Sharing...

引用

2024 International Symposium on Securing Next Generation Systems Using Future Artificial Intelligence Technologies, SNSFAIT 2024

作者： Byeon, Haewon Quraishi, Aadam Thuniki, Praveen Keshta, Ismail Soni, Mukesh Shabaz, Mohammad Department of AI and Software Inje University Gimhae50834 Korea Republic of Inje University Medical Big Data Research Center Gimhae50834 Korea Republic of Intervention Treatment Institute HoustonTX United States Sr Program Analyst Georgia CummingGA30040 United States Computer Science and Information Systems Department College of Applied Sciences Al Maarefa University Riyadh Saudi Arabia Dr. D. Y. Patii Vidyapeeth Pune Dr. D. Y. Patii School of Science & Technology Tathawade Pune India Model Institute of Engineering and Technology J&K Jammu India

A publicly verifiable key sharing mechanism based on threshold key sharing is provided to explore the security of users' private keys on the blockchain. Participating nodes check the key fragment after receiving it, effectively preventing it from being abused. The crucial sections of the nodes that participated in the critical splicing are made public during the critical recovery stage to prevent them from performing harmful things during the critical recovery stage. Add IDs to the nodes that participated in the crucial splicing during the key distribution stage;a dynamic threshold system is intended to track and update the status of malicious nodes in real time. When the node that possesses the crucial component fails, the owner of the critical component and the main node relocate a key element to the new participating nodes. To safeguard sensitive information. The experimental results show that this system has a key recovery rate of 80% and threshold qualities such as traceability, enforceability, and recoverability. © 2024 Copyright for this paper by its authors.

关键词： Blockchain Encryption Key sharing mechanism Privacy Secret key Security

来源：评论

学校读者我要写书评

暂无评论

An advanced algorithm for discrimination prevention in data mining

An advanced algorithm for discrimination prevention in data ...

引用

2022 IEEE Conference on Telecommunications, Optics and computer science, TOCS 2022

作者： Wang, Shuoyu Ren, Jie Fang, Hao Pan, Jun Hu, Xin Zhao, Tingyun Tibet University College of Information Science and Technology Lhasa China Lyuliang University Department of Computer Science and Technology Lvliang China Liaoning University of Traditional Chinese Medicine College of Foreign Languages Shenyang China Beihang University School of Electronic and Information Engineering Beijing China Yangtze Normal University School of Mathematics and Statistics Chongqing China Changzhou College of Information Technology School of Software and Big Data Changzhou China

ISBN: (纸本)9781665470537

data mining has been effectively utilized in huge expanded application areas. Associations overall go with significant business choices in light of mining of data. Discrimination in navigation and preservation of protection of data are a couple of significant difficulties in data mining. Discrimination is of two sorts, Direct Discrimination and Indirect Discrimination. Discrimination prevention includes two significant angles disclosure of direct and additionally roundabout discrimination and data transformation as alteration of separating rules without influencing data quality. Existing strategies for discrimination prevention utilize one of the three methodologies, in particular, the pre-process, in-process or post-process approach. Tests for the exhibition assessment of all calculations by fluctuating these info boundaries, each in turn to review and break down impact of these boundaries. © 2022 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

A Uniform Representation Model for Oct-Based Fingerprint Presentation Attack Detection and Reconstruction

SSRN

引用

SSRN 2023年

作者： Zhang, Wentian Liu, Haozhe Liu, Feng Ramachandra, Raghavendra The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society China Gjøvik2818 Norway

The technology of optical coherence tomography (OCT) to fingerprint imaging opens up a new research potential for fingerprint recognition owing to its ability to capture depth information of the skin layers. Developing robust and high security Automated Fingerprint Recognition Systems (AFRSs) are possible if the depth information can be fully utilized. However, in existing studies, Presentation Attack Detection (PAD) and subsurface fingerprint reconstruction based on depth information are treated as two independent branches, resulting in high computation and complexity of AFRS building. Thus, this paper proposes a uniform representation model for OCT-based fingerprint PAD and subsurface fingerprint reconstruction. Firstly, we design a novel semantic segmentation network which only trained by real finger slices of OCT-based fingerprints to extract multiple subsurface structures from those slices (also known as B-scans). The latent codes derived from the network are directly used to effectively detect the PA since they contain abundant subsurface biological information, which is independent with PA materials and has strong robustness for unknown PAs. Meanwhile, the segmented subsurface structures are adopted to reconstruct multiple subsurface 2D fingerprints. Recognition can be easily achieved by using existing mature technologies based on traditional 2D fingerprints. Extensive experiments are carried on our own established database, which is the largest public OCT-based fingerprint database with 2449 volumes. In PAD task, our method can improve 0.33% Acc from the state-of-the-art method. For reconstruction performance, our method achieves the best performance with 0.834 mean Intersection of Union (mIOU) and 0.937 Pixel Accuracy (PA). By comparing with the recognition performance on surface 2D fingerprints (e.g. commercial and high resolution), the effectiveness of our proposed method on high quality subsurface fingerprint reconstruction is further proved. © 2023, The

关键词： Optical tomography

来源：评论

学校读者我要写书评

暂无评论

FELSDiff: Image Super-Resolution Based on Diffusion Model Fusing Feature Extraction with Latent Space

FELSDiff: Image Super-Resolution Based on Diffusion Model Fu...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Cancan Wu Zhi Zhang College of Computer Science and Technology Wuhan University of Science and Technology Wuhan Hubei China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China Big Data Science and Engineering Research Institute Wuhan University of Science and Technology Wuhan Hubei China

ISBN: (数字)9798350356328

ISBN: (纸本)9798350356335

In addressing issues like an excessive number of network parameters and the loss of fine texture details in image super-resolution reconstruction approaches based on diffusion models, this passage introduces a novel image super-resolution model (FELSDiff). This model relies on the fusion of diffusion models, feature extraction, and latent space. FELSDiff utilizes a Pre-trained CNN for initial super-resolution to extract the primary low-band features and part high-band features of the image. The preliminary super-resolved image is then concatenated as a condition to this model. We introduce a cross-attention mechanism guided by the high-band features of the preliminary super-resolved image to enhance the network's feature extraction capability and obtain more effective features. In the U-Net structure, we incorporate a latent space strategy, enabling the model's training and inference processes to be conducted in the latent space, thereby reducing the number of network parameters. Experimental results on multiple standard datasets indicate that this method outperforms other advanced methods overall.

关键词： Training Runtime Computational modeling Superresolution Memory management Feature extraction Diffusion models Convolutional neural networks Image reconstruction Standards

来源：评论

学校读者我要写书评

暂无评论

Shape-aware contrastive deep supervision for esophageal tumor segmentation from CT scans

Shape-aware contrastive deep supervision for esophageal tumo...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Jin, Qiangguo Cui, Hui Sun, Changming Huang, Jiapeng Xuan, Ping Xu, Yiyue Wang, Linlin Cao, Leilei Wei, Leyi Su, Ran Northwestern Polytechnical University School of Software Shaanxi China Yangtze River Delta Research Institute of Northwestern Polytechnical University Taicang China La Trobe University Department of Computer Science and Information Technology Melbourne Australia Csiro Data61 Sydney Australia Shantou University School of Engineering Department of Computer Science Guangdong China Shandong First Medical University Shandong Academy of Medical Sciences Shandong Cancer Hospital and Institute Department of Radiation Oncology Shandong China Zhejiang University Innovation Center of Yangtze River Delta Zhejiang China Shandong University School of Software Shandong China Tianjin University School of Computer Software College of Intelligence and Computing Tianjin China

ISBN: (纸本)9798350337488

Accurate tumor segmentation is crucial for esophageal cancer radiotherapy treatment planning. The low contrast among the esophagus, tumors, and surrounding tissues, and irregular tumor shapes limit the performance of automatic segmentation methods. In this paper, we aim to exploit the irregular shapes of tumors to facilitate accurate segmentation. We propose a simple and pluggable shape-aware contrastive deep supervision network (SCDSNet) with shape-aware regularization and voxel-to-voxel contrastive deep supervision. Specifically, the shape-aware regularization with an uncertainty minimization strategy encourages the precise predictions of an additional shape-aware head. The voxel-to-voxel contrastive deep supervision enhances the multi-scale shape-tumor contrast for better voxel-to-voxel prediction of shapes. The proposed method is simple and highly pluggable, which can easily be extended to other frameworks. Further, we establish a large in-house dataset on esophageal cancer to validate the effectiveness of our proposed method. The quantitative and qualitative experimental results demonstrate the effectiveness of SCDSNet on the esophageal cancer dataset. © 2023 IEEE.

关键词： Deep supervision Esophagus tumor segmentation Shape-aware regularization Voxel-to-voxel contrastive learning

来源：评论

学校读者我要写书评

暂无评论

Joint Beamforming Design and Stream Allocation for Non-Coherent Joint Transmission in Cell-Free MIMO Networks

arXiv

引用

arXiv 2024年

作者： Wang, Xi Zhao, Xiaotong Wang, Juncheng Li, You Shi, Qingjiang The School of Software Engineering Tongji University Shanghai201804 China The Department of Computer Science Hong Kong Baptist University Hong Kong Huawei Technologies Co. Ltd. Chengdu611730 China The Shenzhen Research Institute of Big Data Shenzhen518172 China

We consider joint beamforming and stream allocation to maximize the weighted sum rate (WSR) for non-coherent joint transmission (NCJT) in user-centric cell-free MIMO networks, where distributed access points (APs) are organized in clusters to transmit different signals to serve each user equipment (UE). We for the first time consider the common limits of maximum number of receive streams at UEs in practical networks, and formulate a joint beamforming and transmit stream allocation problem for WSR maximization under per-AP transmit power constraints. Since the integer number of transmit streams determines the dimension of the beamformer, the joint optimization problem is mixed-integer and nonconvex with coupled decision variables that is inherently NP-hard. In this paper, we first propose a distributed low-interaction reduced weighted minimum mean square error (RWMMSE) beamforming algorithm for WSR maximization with fixed streams. Our proposed RWMMSE algorithm requires significantly less interaction across the network and has the current lowest computational complexity that scales linearly with the number of transmit antennas, without any compromise on WSR. We draw insights on the joint beamforming and stream allocation problem to decouple the decision variables and relax the mixed-integer constraints. We then propose a joint beamforming and linear stream allocation algorithm, termed as RWMMSE-LSA, which yields closed-form updates with linear stream allocation complexity and is guaranteed to converge to the stationary points of the original joint optimization problem. Simulation results demonstrate substantial performance gain of our proposed algorithms over the current best alternatives in both WSR performance and convergence time. Copyright © 2024, The Authors. All rights reserved.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

3DS: An Efficient DPDK-based data Distribution Service for Distributed Real-time Applications

3DS: An Efficient DPDK-based Data Distribution Service for D...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Tianyu Xu Xianzhang Chen Changze Wu Jiapin Wang Rongwei Zheng Duo Liu Yujuan Tan Ao Ren Jian Li College of Computer Science Chongqing University Chongqing China School of Big Data and Software Engineering Chongqing University Chongqing China School of Electrical Engineering Chongqing University Chongqing China

data Distribution Service (DDS) is a widely-used middleware for data transmission in distributed real-time applications, such as autonomous vehicles and robotics. However, the communication of existing DDS middlewares generally relies on the network stacks of the operating system, which brings long latency to the real-time applications. In this paper, we propose a DPDK-based DDS, dubbed 3DS, to improve the performance of communication of DDS middlewares. First, 3DS reduces the latency of communication between distributed real-time applications by avoiding the latency of kernel. Second, 3DS reduces the overhead of dynamic memory allocation and deallocation by a reserved memory pool. Finally, 3DS adopts a thread-exclusive CPU model to reduce the resource contention between threads. We implement and evaluate 3DS on real systems running Linux. The experimental results show that 3DS reduces 44% of the communication latency over FastDDS, which is the state-of-the-art DDS middleware used by ROS2. Moreover, the throughput of data transfer in 3DS can be 1.51 times that of FastDDS.

关键词： Three-dimensional displays Smart cities Instruction sets Distributed databases Throughput Real-time systems Virtual machining

来源：评论

学校读者我要写书评

暂无评论

Reversible data Hiding With Secret Encrypted Image Sharing and Adaptive Coding

引用

IEEE Internet of Things Journal 2025年

作者： Fang, Guangtian Wang, Feng Zhao, Chenbin Qin, Chuan Chang, Ching-Chun Chang, Chin-Chen Fujian University of Technology College of Computer Science and Mathematics Fuzhou350118 China Fujian University of Technology College of Computer Science and Mathematics Key Laboratory of Big Data Mining and Applications Fuzhou350118 China Monash University Faculty of IT Department of Software Systems and Cybersecurity VIC3800 Australia Ministry of Education School of Cyber Science and Engineering Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan430072 China University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China Feng Chia University Information and Communication Security Research Center Taichuang 40724 Taiwan Feng Chia University Department of Information Engineering and Computer Science Taichung40724 Taiwan

To ensure the security of image information and facilitate efficient management in the cloud, the utilization of reversible data hiding in encrypted images (RDHEI) has emerged as pivotal. However, most existing RDHEI schemes suffer from lower security and limited embedding capacity. To tackle these challenges, we propose a reversible data hiding with secret encrypted image sharing and adaptive coding scheme. Specifically, in the encryption phase, we introduce an improved secret sharing (SS) encryption method based on the chinese remainder theorem for polynomials (CRTP). This method not only improves the security of encrypted images but also vacates a larger room for embedding. In the embedding phase, we introduce an adaptive coding embedding approach using XOR preservation (XORP) and huffman coding, which provides high embedding capacity. Experimental results and security analysis demonstrate that our proposed encryption method achieves optimal values in security indicators for encrypted images, such as information entropy, histograms, NPCR and UACI. The proposed embedding method is superior to some state-of-the-art schemes in terms of embedding capacity. Furthermore, in datasets BOSSBase and BOWS2, the average embedding rates of the proposed embedding approach can reach 2.1745 bpp and 2.0656 bpp, respectively. © 2025 IEEE.

关键词： adaptive coding chinese remainder theorem for polynomials encrypted images Reversible data hiding secret sharing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：