检索结果-南通市图书馆

维普期刊数据库

A Weakly-Supervised Crowd Density Estimation Method Based on Two-Stage Linear Feature Calibration

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2024年第4期11卷 965-981页

作者： Yong-Chao Li Rui-Sheng Jia Ying-Xiang Hu Hong-Mei Sun the College of computer science and engineering Shandong University of Science and TechnologyQingdao 266590 the faculty of Information science and engineering Ocean University of ChinaQingdao 266000China the College of computer science and engineering Shandong University of Science and TechnologyQingdao 266590China the College of computer science and engineering Nanjing University of Science and TechnologyNanjing 210000China

In a crowd density estimation dataset,the annotation of crowd locations is an extremely laborious task,and they are not taken into the evaluation *** this paper,we aim to reduce the annotation cost of crowd datasets,and propose a crowd density estimation method based on weakly-supervised learning,in the absence of crowd position supervision information,which directly reduces the number of crowds by using the number of pedestrians in the image as the supervised *** this purpose,we design a new training method,which exploits the correlation between global and local image features by incremental learning to train the ***,we design a parent-child network(PC-Net)focusing on the global and local image respectively,and propose a linear feature calibration structure to train the PC-Net simultaneously,and the child network learns feature transfer factors and feature bias weights,and uses the transfer factors and bias weights to linearly feature calibrate the features extracted from the Parent network,to improve the convergence of the network by using local features hidden in the crowd *** addition,we use the pyramid vision transformer as the backbone of the PC-Net to extract crowd features at different levels,and design a global-local feature loss function(L2).We combine it with a crowd counting loss(LC)to enhance the sensitivity of the network to crowd features during the training process,which effectively improves the accuracy of crowd density *** experimental results show that the PC-Net significantly reduces the gap between fullysupervised and weakly-supervised crowd density estimation,and outperforms the comparison methods on five datasets of Shanghai Tech Part A,ShanghaiTech Part B,UCF_CC_50,UCF_QNRF and JHU-CROWD++.

关键词： Crowd density estimation linear feature calibration vision transformer weakly-supervision learning

维普期刊数据库

An Encoding-Decoding Framework Based on CNN for circ RNA-RBP Binding Sites Prediction

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2024年第1期33卷 256-263页

作者： Yajing GUO Xiujuan LEI Yi PAN School of computer science Shaanxi Normal University faculty of computer science and Control engineering Shenzhen Institute of Advanced TechnologyChinese Academy of Sciences Department of computer science Georgia State University

Predicting RNA binding protein(RBP) binding sites on circular RNAs(circ RNAs) is a fundamental step to understand their interaction mechanism. Numerous computational methods are developed to solve this problem, but they cannot fully learn the features. Therefore, we propose circ-CNNED, a convolutional neural network(CNN)-based encoding and decoding framework. We first adopt two encoding methods to obtain two original matrices. We preprocess them using CNN before fusion. To capture the feature dependencies, we utilize temporal convolutional network(TCN) and CNN to construct encoding and decoding blocks, respectively. Then we introduce global expectation pooling to learn latent information and enhance the robustness of circ-CNNED. We perform circ-CNNED across 37 datasets to evaluate its effect. The comparison and ablation experiments demonstrate that our method is superior. In addition, motif enrichment analysis on four datasets helps us to explore the reason for performance improvement of circ-CNNED.

关键词： Proteins RNA Neural networks Encoding Robustness Decoding Convolutional neural networks

同方期刊数据库

Drug-Target Interactions Prediction Based on Signed Heterogeneous Graph Neural Networks

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2024年第1期33卷 231-244页

作者： Ming CHEN Yajian JIANG Xiujuan LEI Yi PAN Chunyan JI Wei JIANG College of Information science and engineering Hunan Normal University School of computer science Shaanxi Normal University faculty of computer science and Control engineering Shenzhen Institute of Advanced TechnologyChinese Academy of Sciences computer science Department BNU-HKBU United International College

Drug-target interactions(DTIs) prediction plays an important role in the process of drug *** computational methods treat it as a binary prediction problem, determining whether there are connections between drugs and targets while ignoring relational types information. Considering the positive or negative effects of DTIs will facilitate the study on comprehensive mechanisms of multiple drugs on a common target, in this work, we model DTIs on signed heterogeneous networks, through categorizing interaction patterns of DTIs and additionally extracting interactions within drug pairs and target protein pairs. We propose signed heterogeneous graph neural networks(SHGNNs), further put forward an end-to-end framework for signed DTIs prediction, called SHGNN-DTI,which not only adapts to signed bipartite networks, but also could naturally incorporate auxiliary information from drug-drug interactions(DDIs) and protein-protein interactions(PPIs). For the framework, we solve the message passing and aggregation problem on signed DTI networks, and consider different training modes on the whole networks consisting of DTIs, DDIs and PPIs. Experiments are conducted on two datasets extracted from Drug Bank and related databases, under different settings of initial inputs, embedding dimensions and training modes. The prediction results show excellent performance in terms of metric indicators, and the feasibility is further verified by the case study with two drugs on breast cancer.

关键词： Drugs Training Proteins Measurement Message passing Prediction methods Graph neural networks

Practical cloud storage auditing using serverless computing

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science China(Information sciences) 2024年第3期67卷 33-47页

作者： Fei CHEN Jianquan CAI Tao XIANG Xiaofeng LIAO College of computer science and Software engineering Shenzhen University College of computer science Chongqing University

Cloud storage auditing research is dedicated to solving the data integrity problem of outsourced storage on the cloud. In recent years, researchers have proposed various cloud storage auditing schemes using different techniques. While these studies are elegant in theory, they assume an ideal cloud storage model;that is, they assume that the cloud provides the storage and compute interfaces as required by the proposed schemes. However, this does not hold for mainstream cloud storage systems because these systems only provide read and write interfaces but not the compute interface. To bridge this gap, this work proposes a serverless computing-based cloud storage auditing system for existing mainstream cloud object storage. The proposed system leverages existing cloud storage auditing schemes as a basic building block and makes two adaptations. One is that we use the read interface of cloud object storage to support block data requests in a traditional cloud storage auditing scheme. Another is that we employ the serverless computing paradigm to support block data computation as traditionally required. Leveraging the characteristics of serverless computing, the proposed system realizes economical, pay-as-you-go cloud storage auditing. The proposed system also supports mainstream cloud storage upper layer applications(e.g., file preview) by not modifying the data formats when embedding authentication tags for later auditing. We prototyped and open-sourced the proposed system to a mainstream cloud service, i.e., Tencent Cloud. Experimental results show that the proposed system is efficient and promising for practical use. For 40 GB of data, auditing takes approximately 98 s using serverless computation. The economic cost is 120.48 CNY per year, of which serverless computing only accounts for 46%. In contrast, no existing studies reported cloud storage auditing results for real-world cloud services.

关键词： cloud storage auditing serverless computing object storage usability

A Task Scheduling Algorithm Based on Clustering Pre-processing in Space-Based Information Network

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2024年第1期33卷 217-230页

作者： Yufei WANG Jun LIU Shengnan ZHANG Sai XU Jingyi WANG School of computer science and engineering Northeastern University

With the diversification of space-based information network task requirements and the dramatic increase in demand, the efficient scheduling of various tasks in space-based information network becomes a new challenge. To address the problems of a limited number of resources and resource heterogeneity in the space-based information network, we propose a bilateral pre-processing model for tasks and resources in the scheduling pre-processing stage. We use an improved fuzzy clustering method to cluster tasks and resources and design coding rules and matching methods to match similar categories to improve the clustering effect. We propose a space-based information network task scheduling strategy based on an ant colony simulated annealing algorithm for the problems of high latency of space-based information network communication and high resource dynamics. The strategy can efficiently complete the task and resource matching and improve the task scheduling performance. The experimental results show that our proposed task scheduling strategy has less task execution time and higher resource utilization than other algorithms under the same experimental conditions. It has significantly improved scheduling performance.

关键词： Scheduling algorithms Heuristic algorithms Clustering methods Clustering algorithms Simulated annealing Dynamic scheduling Search problems

Troy: Efficient Service Deployment for Windows Systems

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2024年第1期33卷 313-322页

作者： Deyu ZHANG Yu XIE Mucong XU En CHENG Xiaoyan KUI Bangwen HE Yunhao LI School of computer science and engineering Central South University

The modern university computer lab and kindergarden through 12th grade classrooms require a centralized solution to efficiently manage a large number of desktops. The existing solutions either bring virtualization overhead in runtime or requires loading a large image over 30 GB leading to an unacceptable network latency. In this work, we propose Troy which takes advantage of the differencing virtual hard disk techniques in Windows *** such, Troy only loads the modifications made on one machine to all other machines. Troy consists of two modules that are responsible to generate an initial image and merge a differencing image with its parent image, respectively. Specifically, we identify the key fields in the virtual hard disk image that links the differencing image and the parent image and find the modified blocks in the differencing images that should be used to replace the blocks in the parent image. We further design a lazy copy solution to reduce the I/O burden in image merging. We have implemented Troy on bare metal machines. The evaluation results show that the performance of Troy is comparable to the native implementation in Windows, without requiring the Windows environment.

关键词： Runtime Image synthesis Merging Loading Metals Hard disks Virtualization

同方期刊数据库

APF-GAN:Exploring asymmetric pre-training and fine-tuning strategy for conditional generative adversarial network

在线全文

学校读者我要写书评

暂无评论

Computational Visual Media 2024年第1期10卷 187-192页

作者： Yuxuan Li Lingfeng Yang Xiang Li College of computer science Nankai UniversityTianjinChina School of computer science and engineering Nanjing University of Science and TechnologyNanjingChina

The use of generative adversarial network(GAN)-based models for the conditional generation of image semantic segmentation has shown promising results in recent ***,there are still some limitations,including limited diversity of image style,distortion of detailed texture,unbalanced color tone,and lengthy training *** address these issues,we propose an asymmetric pre-training and fine-tuning(APF)-GAN model.

关键词： tuning network asymmetric

Microwave Through Wall Imaging via An Induced Current Learning Method

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Beijing Institute of Technology 2024年第3期33卷 248-254页

作者： Pengjin Lan Jianguo Huang Tianyi Zhou faculty of Electrical engineering and computer science Ningbo UniversityNingbo 315211China

In this paper,an induced current learning method(ICLM)for microwave through wall imaging(TWI),named as TWI-ICLM,is *** the inversion of induced current,the unknown object along with the enclosed walls are treated as a combination of ***,a non-iterative method called distorted-Born backpropagation(DB-BP)is utilized to generate the initial *** the training stage,several convolutional neural networks(CNNs)are cascaded to improve the estimated induced *** addition,a hybrid loss function consisting of the induced current error and the permittivity error is used to optimize the network ***,the relative permittivity images are conducted analytically using the predicted current based on *** the numerical and experimental TWI tests prove that,the proposed method can achieve better imaging accuracy compared to traditional distorted-Born iterative method(DBIM).

关键词： through wall imaging inverse scattering problem convolutional neural network(CNN)

维普期刊数据库

Advances in Manta Ray Foraging Optimization:A Comprehensive Survey

在线全文

学校读者我要写书评

暂无评论

Journal of Bionic engineering 2024年第2期21卷 953-990页

作者： Farhad Soleimanian Gharehchopogh Shafi Ghafouri Mohammad Namazi Bahman Arasteh Department of computer engineering Urmia BranchIslamic Azad UniversityUrmiaIran Department of computer engineering Tabriz BranchIslamic Azad UniversityTabrizIran Department of computer engineering Maybod BranchIslamic Azad UniversityMaybodIran Department of Software engineering Faculty of Engineering and Natural ScienceIstinye UniversityIstanbulTurkey

This paper comprehensively analyzes the Manta Ray Foraging Optimization(MRFO)algorithm and its integration into diverse academic *** in 2020,the MRFO stands as a novel metaheuristic algorithm,drawing inspiration from manta rays’unique foraging behaviors—specifically cyclone,chain,and somersault *** biologically inspired strategies allow for effective solutions to intricate physical *** its potent exploitation and exploration capabilities,MRFO has emerged as a promising solution for complex optimization *** utility and benefits have found traction in numerous academic *** its inception in 2020,a plethora of MRFO-based research has been featured in esteemed international journals such as IEEE,Wiley,Elsevier,Springer,MDPI,Hindawi,and Taylor&Francis,as well as at international conference *** paper consolidates the available literature on MRFO applications,covering various adaptations like hybridized,improved,and other MRFO variants,alongside optimization *** trends indicate that 12%,31%,8%,and 49%of MRFO studies are distributed across these four categories respectively.

关键词： Manta ray foraging optimization Metaheuristic algorithms Hybridization Improved Optimization