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

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

来源：评论

学校读者我要写书评

暂无评论

Incentive-Scheduling Algorithms to Provide Green Computational Data Center

引用

SN computer science 2021年第4期2卷 252页

作者： Haruna, Ahmed Abba Jung, Low Tan Arputharaj, Vijay Muhammad, L.J. College of Computer Science and Engineering University of Hafr Al Batin Al Jamiah Hafar Al Batin 39524d Saudi Arabia High Performance Computing Cloud Centre Universiti Teknologi PETRONAS Seri Iskandar Perak 32610 Malaysia Faculty of Science and Information Technology Skyline University Nigeria No. 2 Zaria Road Kano Nigeria Mathematics and Computer Science Department Federal University Kashere Gombe State Kashere Nigeria

The increased computational loads in grid servers are dissipating more heat to eventually amplifies the cooling demand in the data center (DC). This can lead to more submitted jobs missing their job completion deadlines. Unfortunately, the conventional DC job scheduling approaches do not provide compensation to the resource users on their submitted jobs that missed the deadlines. The absence of compensation may dissuade users from submitting jobs to the DCs. While the free air-cooling strategy is used elsewhere, it is not generally applicable in tropical countries such as Malaysia. A constant artificial cooling (air conditioning) is needed to sustain the DC long-hour operation. To solve this issue in the tropical region, green incentive-scheduling algorithms were devised to significantly save the cooling electricity consumption cost in DC and to be able to compensate users (as an incentive) for their submitted jobs that missed the job completion deadline(s). However, there is a need to further analyse the performance of the proposed green incentive-scheduling algorithms using a different benchmark traces file and to conduct a cost-saving comparison analysis between the green incentive-scheduling and the non-green incentive-scheduling algorithms. Therefore, this paper's authors observed and analysed the performance comparison of the proposed green incentive-based job scheduling algorithms using a benchmark traces file and conducted a cost-saving comparison analysis between the green incentive and the non-green incentive-based scheduling algorithms. Ultimately, the green incentive-scheduling algorithms are to show their impact on reducing the DC operation costs (e.g. electricity bills for cooling) and to provide fair compensation to grid users for a win–win situation. © 2021, The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd.

关键词： Data center Green computing Incentive-based job scheduling algorithm Server Temperature

来源：评论

学校读者我要写书评

暂无评论

HSI-MFormer: Integrating Mamba and Transformer Experts for Hyperspectral Image Classification

引用

IEEE Transactions on Geoscience and Remote Sensing 2025年 63卷

作者： He, Yan Tu, Bing Liu, Bo Li, Jun Plaza, Antonio Institute of Optics and Electronics State Key Laboratory Cultivation Base of Atmospheric Optoelectronic Detection and Information Fusion Jiangsu International Joint Laboratory on Meteorological Photonics and Optoelectronic Detection Jiangsu Engineering Research Center for Intelligent Optoelectronic Sensing Technology of Atmosphere Nanjing University of Information Science and Technology Nanjing210044 China China University of Geosciences Faculty of Computer Science Wuhan430074 China University of Extremadura Hyperspectral Computing Laboratory Department of Technology of Computers and Communications Escuela Politecnica 10003 Spain

Hyperspectral image (HSI) classification is fundamental to numerous remote sensing applications, enabling detailed analysis of material properties and environmental conditions. Recent Mamba built upon selective state space models (SSMs) (S6) have demonstrated exceptional advantages in long-range sequence modeling with linear computational efficiency, while Transformer based on self-attention mechanisms is particularly adept at capturing short-range dependencies. To leverage the complementary strengths of these models, this article introduces a novel hybrid Mamba-Transformer framework (HSI-MFormer), effectively exploring the multiscale properties of hyperspectral data for HSI classification. Initially, a multiscale token generation (MTG) module is developed, which converts the HSI cube into multiple spatial-spectral token groups across different scales. To adequately capture fine-grained multiscale spatial-spectral patterns, an inner-scale transformer expert (ITE) is designed, which incorporates grouped self-attention operations to perform short-range sequence modeling within token groups at each scale. Meanwhile, a cross-scale Mamba expert (CME) is introduced, which integrates a cross-scale serialization mechanism and bidirectional Mamba block for long-range sequence modeling, further exploring the interactions and complementarity between token groups across different scales. Several hybrid strategies for integrating the ITE and CME are investigated to maximize their complementarity, including parallel, interval, and serial structures. Extensive experiments demonstrate that the proposed HSI-MFormer significantly outperforms the state-of-the-art Transformer-based and Mamba-based HSI classification methods. © 1980-2012 IEEE.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

DrugProtKGE: Weakly Supervised Knowledge Graph Embedding for highly-Effective Drug-Protein Interaction Representation

DrugProtKGE: Weakly Supervised Knowledge Graph Embedding for...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yanlong Qiu Siqi Wang Xi Yang Xinyuan Qiu Chengkun Wu Yingbo Cui Canqun Yang Institute for Quantum Information & State Key Laboratory of High-Performance Computing College of Computer Science National University of Defense Technology Changsha P. R. China National Supercomputer Center in Tianjin Tianjin P. R. China National Key Laboratory of Parallel and Distributed Computing College of Computer Science National University of Defense Technology Changsha P. R. China Department of Biology and Chemistry College of Science National University of Defense Technology Changsha P. R. China

With the exponential growth of biomedical knowledge in unstructured text repositories such as PubMed, it is imminent to establish a knowledge graph-style, efficient searchable and targeted database that can support the need of information retrieval from researchers and clinicians. To mine knowledge from graph databases, most previous methods view a triple in a graph (see Fig. 1) as the basic processing unit and embed the triplet element (i.e. drugs/chemicals, proteins/genes and their interaction) as separated embedding matrices, which cannot capture the semantic correlation among triple elements. To remedy the loss of semantic correlation caused by disjoint embeddings, we propose a novel approach to learn triple embeddings by combining entities and interactions into a unified representation. Furthermore, traditional methods usually learn triple embeddings from scratch, which cannot take advantage of the rich domain knowledge embedded in pre-trained models, and is also another significant reason for the fact that they cannot distinguish the differences implied by the same entity in the multi-interaction triples. In this paper, we propose a novel fine-tuning based approach to learn better triple embeddings by creating weakly supervised signals from pre-trained knowledge graph embeddings. The method automatically samples triples from knowledge graphs and estimates their pairwise similarity from pre-trained embedding models. The triples are then fed pairwise into a Siamese-like neural architecture, where the triple representation is fine-tuned in the manner bootstrapped by triple similarity scores. Finally, we demonstrate that triple embeddings learned with our method can be readily applied to several downstream applications (e.g. triple classification and triple clustering). We evaluated the proposed method on two open-source drug-protein knowledge graphs constructed from PubMed abstracts, as provided by BioCreative. Our method achieves consistent improvement in both t

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Chan–Vese Model Based on the Markov Chain for Unsupervised Medical Image Segmentation

引用

Tsinghua science and Technology 2021年第6期26卷 833-844页

作者： Quanwei Huang Yuezhi Zhou Linmi Tao Weikang Yu Yaoxue Zhang Li Huo Zuoxiang He Key Laboratory of Pervasive Computing(Ministry of Education)and the Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China School of Electronic and Information Engineering Beihang UniversityBeijing 100191China Department of Nuclear Medicine Peking Union Medical College HospitalBeijing 100730China School of Clinical Medicine Tsinghua Universityand also with Beijing Tsinghua Changgung HospitalBeijing 100084China

The accurate segmentation of medical images is crucial to medical care and research;however, many efficient supervised image segmentation methods require sufficient pixel level labels. Such requirement is difficult to meet in practice and even impossible in some cases, e.g., rare Pathoma images. Inspired by traditional unsupervised methods, we propose a novel Chan–Vese model based on the Markov chain for unsupervised medical image segmentation. It combines local information brought by superpixels with the global difference between the target tissue and the background. Based on the Chan–Vese model, we utilize weight maps generated by the Markov chain to model and solve the segmentation problem iteratively using the min-cut algorithm at the superpixel *** method exploits abundant boundary and local region information in segmentation and thus can handle images with intensity inhomogeneity and object sparsity. In our method, users gain the power of fine-tuning parameters to achieve satisfactory results for each segmentation. By contrast, the result from deep learning based methods is *** performance of our method is assessed by using four computerized Tomography(CT) datasets. Experimental results show that the proposed method outperforms traditional unsupervised segmentation techniques.

关键词： medical image unsupervised segmentation Markov chain

来源：评论

学校读者我要写书评

暂无评论

Lightweight Task-Oriented Semantic Communication Empowered by Large-Scale AI Models

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Liu, Chuanhong Guo, Caili Yang, Yang Chen, Mingzhe Quek, Tony Q. S. Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing100876 China Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing100876 China University of Miami Department of Electrical and Computer Engineering Institute for Data Science and Computing Coral GablesFL United States Singapore University of Technology and Design Dept. of Information Systems Technology and Design 487372 Singapore

Recent studies have focused on leveraging large-scale artificial intelligence (LAI) models to improve semantic representation and compression capabilities. However, the substantial computational demands of LAI models pose significant challenges for real-time communication scenarios. To address this, this paper proposes utilizing knowledge distillation (KD) techniques to extract and condense knowledge from LAI models, effectively reducing model complexity and computation latency. Nevertheless, the inherent complexity of LAI models leads to prolonged inference times during distillation, while their lack of channel awareness compromises the distillation performance. These limitations make standard KD methods unsuitable for task-oriented semantic communication scenarios. To address these issues, we propose a fast distillation method featuring a pre-stored compression mechanism that eliminates the need for repetitive inference, significantly improving efficiency. Furthermore, a channel adaptive module is incorporated to dynamically adjust the transmitted semantic information based on varying channel conditions, enhancing communication reliability and adaptability. In addition, an information bottleneck-based loss function is derived to guide the fast distillation process. Simulation results verify that the proposed scheme outperform baselines in term of task accuracy, model size, computation latency, and training data requirements. © 1967-2012 IEEE.

关键词： NP-hard

来源：评论

学校读者我要写书评

暂无评论

Scalable Multi-view Regression Clustering for Large-scale Data

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Zhao, Xiaowei Fan, Jie Chang, Xiaojun Nie, Feiping Zhang, Qiang Guo, Jun Xidian University State Key Laboratory of Electromechanical Integrated Manufacturing of High-Performance Electronic Equipment Shaanxi Xi’an710071 China Xidian University Center for Complex Systems School of Mechano-Electronic Engineering Shaanxi Xi’an710071 China Northwest University School of Information Science and Technology Shaanxi Xi’an710127 China University of Science and Technology of China School of Information Science and Technology Hefei230026 China Mohamed bin Zayed University of Artificial Intelligence Department of Computer Vision MBZUAI Abu Dhabi United Arab Emirates Xi’an710072 China

In recent years, unsupervised linear regression has attracted attention for its ability to directly capture the mapping relationship between samples and targets. However, existing algorithms can only utilize limited information from a single view, which often leads to unsatisfactory results. To address this problem, we propose a regression clustering model based on multi-view information fusion, called Scalable Multi-view Regression Clustering. This model consists of two parts: intra-view information fusion and inter-view information fusion. In the first part, to capture the local correlations among samples, we propose constructing view-specific bipartite graphs. Unlike traditional single-view and multi-view clustering algorithms, we treat the weights of the bipartite graph as additional features of the samples, thereby directly incorporating the local manifold structure of the samples at the feature level. Furthermore, since the original features of the samples also contain valuable information, we perform unsupervised linear regression separately on the samples represented by the original features and those represented by the bipartite graph weights in each view. The results are then integrated in a weighted manner. In the second part, we propose adaptively weighting the clustering results from each view to capture complementary information across views, thereby enhancing clustering performance. This strategy not only avoids the bipartite graph alignment issue in multi-view clustering but also enables clustering with linear time complexity, making it effective for handling large-scale data. An iterative optimization algorithm is developed to update all variables alternately. Experiments conducted on benchmark datasets demonstrate the superiority of our proposed model. © 2025 IEEE. All rights reserved.

关键词： Multiple linear regression

来源：评论

学校读者我要写书评

暂无评论

Fisheye Multiple Object Tracking by Learning Distortions Without Dewarping

Fisheye Multiple Object Tracking by Learning Distortions Wit...

引用

IEEE International Conference on Image Processing

作者： Ping-Yang Chen Jun-Wei Hsieh Ming-Ching Chang Munkhjargal Gochoo Fang-Pang Lin Yong-Sheng Chen Department of Computer Science National Yang Ming Chiao Tung University Taiwan College of AI and Green Energy National Yang Ming Chiao Tung University Taiwan Department of Computer Science and Engineering National Taiwan Ocean University Taiwan Department of Computer Science University at Albany State University of New York USA College of Information Technology United Arab Emirates University UAE Emirates Center for Mobility Research United Arab Emirates University UAE National Center for High-Performance Computing Taiwan

We develop a new Multiple Object Tracking (MOT) scheme for fisheye cameras that can directly perform vehicle detection, re-identification, and tracking under fisheye distortions without explicit dewarping. Fisheye cameras provide omnidirectional coverage that is wider than traditional cameras, reducing fewer need of cameras to monitor road intersections. However, the problem of distorted views introduces new challenges for fisheye MOT. In this paper, we propose a Fish-Eye Multiple Object Tracking (FEMOT) approach with two novelties. We develop the Distorted Fisheye Image Augmentation (DFIA) method to improve object detection and re-identification on fisheye cameras, where fisheye model training can be performed on existing datasets of traditional cameras via fisheye data synthesis and augmentation. We also develop the Hybrid Data Association (HDA) method to perform tracking directly on fisheye views, without the need of de-warping. The developed FEMOT framework provides practical design and advancement that enables large-scale use of fisheye cameras in smart city and surveillance applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-modal Data based Semi-Supervised Learning for Vehicle Positioning

arXiv

引用

arXiv 2024年

作者： Huan, Ouwen Yang, Yang Luo, Tao Chen, Mingzhe Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing100876 China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China

In this paper, a multi-modal data based semisupervised learning (SSL) framework that jointly use channel state information (CSI) data and RGB images for vehicle positioning is designed. In particular, an outdoor positioning system where the vehicle locations are determined by a base station (BS) is considered. The BS equipped with several cameras can collect a large amount of unlabeled CSI data and a small number of labeled CSI data of vehicles, and the images taken by cameras. Although the collected images contain partial information of vehicles (i.e. azimuth angles of vehicles), the relationship between the unlabeled CSI data and its azimuth angle, and the distances between the BS and the vehicles captured by images are both unknown. Therefore, the images cannot be directly used as the labels of unlabeled CSI data to train a positioning model. To exploit unlabeled CSI data and images, a SSL framework that consists of a pretraining stage and a downstream training stage is proposed. In the pretraining stage, the azimuth angles obtained from the images are considered as the labels of unlabeled CSI data to pretrain the positioning model. In the downstream training stage, a small sized labeled dataset in which the accurate vehicle positions are considered as labels is used to retrain the model. Simulation results show that the proposed method can reduce the positioning error by up to 30% compared to a baseline where the model is not pretrained. Copyright © 2024, The Authors. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Temporal Correlation Network for Video Polyp Segmentation

Temporal Correlation Network for Video Polyp Segmentation

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Xu, Ziheng Qiu, Dehui Lin, Senlin Zhang, Xinyue Shi, Sheng Zhu, Shengtao Zhang, Fa Wan, Xiaohua Capital Normal University Information Engineering College Beijing China High Performance Computer Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Beijing Institute of Technology Beijing100081 China Department of Gastroenterology Beijing Friendship Hospital Capital Medical University China National Clinical Research Center for Digestive Disease

ISBN: (纸本)9781665468190

Accurate polyp segmentation from colonoscopy images is essential for identifying colorectal cancer. Recently, segmentation methods based on convolutional neural networks and transformers have represented excellent performance for image polyp segmentation. However, these methods are mostly designed for individual images rather than the entire video datasets, which results in the absence of sequential relationships among lesion images and neglects the significant intrinsic property of continuous video. In this work, we propose a temporal correlation network (TC-Net) for video polyp segmentation. In TC-Net, the temporal correlation is unprecedentedly modeled based on the relationship between the original video and the captured frames to be adaptable for video polyp segmentation, and the network is also calibrated for the corresponding time correlation output. Furthermore, we design a dual-track learning strategy for the optimization method in TC-Net to ensure the independence of TC-Net during the learning process to adequately exploit the optimization effect of temporal correlation. The network's effectiveness is demonstrated by extensive experiments on five publicly available biomedical datasets, and TC-Net achieves state-of-the-art (SOTA) performance. © 2022 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：