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

Predicting Genotype Information Related to COVID-19 for Molecular Mechanism Based on Computational Methods

Computer Modeling in Engineering & Sciences 2021年第10期129卷 31-45页

作者： Lejun Gong Xingxing Zhang Li Zhang Zhihong Gao Jiangsu Key Laboratory of Big Data Security&Intelligent Processing School of Computer Science Nanjing University of Posts and TelecommunicationsNanjing210046China Smart Health Big Data Analysis and Location Services Engineering Laboratory of Jiangsu Province Nanjing210046China College of Computer Science and Technology Nanjing Forestry UniversityNanjing210037China Zhejiang Engineering Research Center of Intelligent Medicine Wenzhou325035China

Novel coronavirus disease 2019(COVID-19)is an ongoing health *** studies are related to ***,its molecular mechanism remains *** rapid publication of COVID-19 provides a new way to elucidate its mechanism through computational *** paper proposes a prediction method for mining genotype information related to COVID-19 from the perspective of molecular mechanisms based on machine *** method obtains seed genes based on prior *** genes are mined from biomedical *** candidate genes are scored by machine learning based on the similarities measured between the seed and candidate ***,the results of the scores are used to perform functional enrichment analyses,including KEGG,interaction network,and Gene Ontology,for exploring the molecular mechanism of *** results show that the method is promising for mining genotype information to explore the molecular mechanism related to COVID-19.

关键词： COVID-19 SARS-CoV-2 computational method bioinformatics genotype machine learning

来源：评论

学校读者我要写书评

暂无评论

Topic-aware Incentive Mechanism for Task Diffusion in Mobile Crowdsourcing through Social Network

引用

ACM Transactions on Internet Technology 2021年第1期22卷 1-23页

作者： Xu, Jia Zhou, Yuanhang Chen, Gongyu Ding, Yuqing Yang, Dejun Liu, Linfeng Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications 9 Wenyuan Rd Jiangsu Nanjing210023 China Colorado School of Mines 1500 Illinois St. GoldenCO80401 United States

Crowdsourcing has become an efficient paradigm to utilize human intelligence to perform tasks that are challenging for machines. Many incentive mechanisms for crowdsourcing systems have been proposed. However, most of existing incentive mechanisms assume that there are sufficient participants to perform crowdsourcing tasks. In large-scale crowdsourcing scenarios, this assumption may be not applicable. To address this issue, we diffuse the crowdsourcing tasks in social network to increase the number of participants. To make the task diffusion more applicable to crowdsourcing system, we enhance the classic Independent Cascade model so the influence is strongly connected with both the types and topics of tasks. Based on the tailored task diffusion model, we formulate the Budget Feasible Task Diffusion (BFTD) problem for maximizing the value function of platform with constrained budget. We design a parameter estimation algorithm based on Expectation Maximization algorithm to estimate the parameters in proposed task diffusion model. Benefitting from the submodular property of the objective function, we apply the budget-feasible incentive mechanism, which satisfies desirable properties of computational efficiency, individual rationality, budget-feasible, truthfulness, and guaranteed approximation, to stimulate the task diffusers. The simulation results based on two real-world datasets show that our incentive mechanism can improve the number of active users and the task completion rate by 9.8% and 11%, on average. © 2021 Association for Computing Machinery.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Anomaly detection for drinking water quality via deep bilSTM ensemble 18

Anomaly detection for drinking water quality via deep bilSTM...

引用

2018 Genetic and Evolutionary Computation Conference, GECCO 2018

作者： Chen, Xingguo Feng, Fan Wu, Jikai Liu, Wenyu Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications State Key Laboratory for Novel Software Technology Nanjing University Nanjing Jiangsu Province China

ISBN: (纸本)9781450357647

In this paper, a deep BiLSTM ensemble method was proposed to detect anomaly of drinking water quality. First, a convolutional neural network (CNN) is utilized as a feature extractor in order to process the raw data of water quality. Second, bidirectional Long Short Term Memory (BiLSTM) is employed to handle the time series prediction problem. Then, a linear combination of t-time-step predictions weighted by a discount factor was utilized to ensemble the final output of event. Finally, cost-sensitive learning combined with Adam optimization was applied to learn the model according to the imbalance property of the event label. © 2018 Copyright held by the owner/author(s).

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Distributed Image Retrieval Base on LSH Indexing on Spark 1st

Distributed Image Retrieval Base on LSH Indexing on Spark

引用

1st International Conference on big data and security, ICBDS 2019

作者： Hou, Zelei Huang, Chao Wu, Jiagao Liu, Linfeng School of Computer Nanjing University of Posts and Telecommunications NanjingJiangsu210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing NanjingJiangsu210023 China

ISBN: (纸本)9789811575297

With the advent of the era of big data, how to process massive image, video and other multimedia data timely and accurately has become a new challenge in related fields. Aiming at the computational bottleneck and inefficiency of traditional image content retrieval system, in this paper, a distributed image retrieval framework base on Location Sensitive Hash (LSH) indexing is proposed on Spark, which combines with the distributed storage and computing characteristics of Spark big data platform. Then, distributed K-means based Bag of Visual Word (BoVW) algorithm and LSH algorithm are proposed to build LSH index vectors on Spark in parallel. The experiment shows that the retrieval time of our framework can be reduced significantly, and both retrieval recall and precision are high compared with the traditional retrieval method. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Indexing (of information)

来源：评论

学校读者我要写书评

暂无评论

Guwen-UNILM: Machine Translation Between Ancient and Modern Chinese Based on Pre-Trained Models 10th

Guwen-UNILM: Machine Translation Between Ancient and Modern ...

引用

10th CCF Conference on Natural Language processing and Chinese Computing, NLPCC 2021

作者： Yang, Zinong Chen, Ke-jia Chen, Jingqiang Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Lab of Big Data Security and Intelligent Processing Nanjing China

ISBN: (纸本)9783030884796

Ancient Chinese literatures are not only the unique cultural heritage of China but also the treasures of world civilization. Nevertheless, it has become quite difficult for modern people to comprehend or even create ancient works with the evolution of language in the long history. Translation is therefore playing a key role in bridging the two eras. This paper is to develop an automatic translation method between ancient and modern Chinese literature. To start with, an open sourced sentence level parallel corpus of ancient-modern Chinese is established since there is no available parallel corpus open for use. As the seq2seq-based machine translation models do not work well on this task, the pre-trained model UNILM is then applied in our method considering the monolingual characteristics of this task. Furthermore, the ancient Chinese pre-trained model - Guwen-BERT is utilized to further improve the performance of the method. The quality of translation is evaluated by both Human Evaluation and two automatic metrics: a) case-sensitive BLEU scores and b) Imagery Conservation (I.C), which is first developed in this paper. The experimental results under all metrics show that our method can generate higher quality of translation. © 2021, Springer Nature Switzerland AG.

关键词： Machine translation

来源：评论

学校读者我要写书评

暂无评论

Maximum likelihood estimation based on random subspace EDA: Application to extrasolar planet detection 11th

Maximum likelihood estimation based on random subspace EDA: ...

引用

11th International Conference on Simulated Evolution and Learning, SEAL 2017

作者： Liu, Bin Chen, Ke-Jia School of Computer Science Nanjing University of Posts and Telecommunications NanjingJiangsu210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing NanjingJiangsu210023 China

ISBN: (纸本)9783319687582

This paper addresses maximum likelihood (ML) estimation based model fitting in the context of extrasolar planet detection. This problem is featured by the following properties: (1) the candidate models under consideration are highly nonlinear;(2) the likelihood surface has a huge number of peaks;(3) the parameter space ranges in size from a few to dozens of dimensions. These properties make the ML search a very challenging problem, as it lacks any analytical or gradient based searching solution to explore the parameter space. A population based searching method, called estimation of distribution algorithm (EDA), is adopted to explore the model parameter space starting from a batch of random locations. EDA is featured by its ability to reveal and utilize problem structures. This property is desirable for characterizing the detections. However, it is well recognized that EDAs can not scale well to large scale problems, as it consists of iterative random sampling and model fitting procedures, which results in the well-known dilemma curse of dimensionality. A novel mechanism to perform EDAs in interactive random subspaces spanned by correlated variables is proposed and the hope is to alleviate the curse of dimensionality for EDAs by performing the operations of sampling and model fitting in lower dimensional subspaces. The effectiveness of the proposed algorithm is verified via both benchmark numerical studies and real data analysis. © Springer International Publishing AG 2017.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

SR-AFU: super-resolution network using adaptive frequency component upsampling and multi-resolution features

引用

Frontiers of Computer Science 2023年第1期17卷 123-132页

作者： Ke-Jia CHEN Mingyu WU Yibo ZHANG Zhiwei CHEN School of Computer Science Nanjing University of Posts and TelecommunicationsNanjing 210023China Jiangsu Key Laboratory of Big Data Security&Intelligent Processing Nanjing University of Posts and TelecommunicationsNanjing 210023China College of Telecommunications and Information Engineering Nanjing University of Posts and TelecommunicationsNanjing 210003China

Image super-resolution (SR) is one of the classic computer vision tasks. This paper proposes a super-resolution network based on adaptive frequency component upsampling, named SR-AFU. The network is composed of multiple cascaded dilated convolution residual blocks (CDCRB) to extract multi-resolution features representing image semantics, and multiple multi-size convolutional upsampling blocks (MCUB) to adaptively upsample different frequency components using CDCRB features. The paper also defines a new loss function based on the discrete wavelet transform, making the reconstructed SR images closer to human perception. Experiments on the benchmark datasets show that SR-AFU has higher peak signal to noise ratio (PSNR), significantly faster training speed and more realistic visual effects compared with the existing methods.

关键词： super-resolution multi-resolution features adaptive frequency upsampling wavelet transformation

来源：评论

学校读者我要写书评

暂无评论

Community-based message forwarding in mobile social networks

Community-based message forwarding in mobile social networks

引用

2019 International Conference on Advances in Computer Technology, Information Science and Communications, CTISC 2019

作者： Chen, Zhiming Xiang, Yang School of Computer Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China

ISBN: (纸本)9789897583575

With the popularity of various smart devices and the application of sensor network technology, message transmission using mobile devices is becoming widespread. This paper focuses on the forwarding in mobile social network (MSN). The MSN is a special Delay Tolerant Network (DTN) consisting of mobile nodes. In MSN, nodes move and share information with each other through carried short-range wireless communication devices. Mobile nodes in the MSN typically access some building areas more frequently, such as schools, companies, or apartments, while visiting other areas, such as the roads between buildings, less frequently. The building areas that nodes frequently visit are called communities. To increase delivery ratio and reduce transmission time in MSN, this paper proposes a novel zero-knowledge multi-copy routing algorithm, Mixed Message Forwarding (MMF) which exploits and improves the metric, namely centrality. Centrality reflects the importance of a node in the network. MMF improves copy diffusion by using different directions of node movement as well. Special facilities called boundary boxes are added to the network scenario. Boundary boxes are special throw boxes. Throw boxes are relays with large storage space and fixed position. MMF is designed and evaluated, which utilizes the aforementioned boundary boxes to reduce transmission delay. The simulation results show that the MMF can improve the delivery ratio and reduce the transmission delay, compared with other algorithms. © 2019 by SCITEPRESS - Science and Technology Publications, Lda.

关键词： Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

Point Cloud Compression Method Based on Curvature Grading and Inter-point Compression for Industrial Products 15

Point Cloud Compression Method Based on Curvature Grading an...

引用

15th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2023

作者： Wang, Lei Huang, Wei Chen, Yiping Chen, Ran Nanjing University of Posts and Telecommunications School of Computer Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China

ISBN: (纸本)9798350308693

The traditional point cloud compression methods fail to meet the compression requirements of complex surface point cloud files in the industrial field. This paper proposes a point cloud compression method suitable for industrial products with defective and complex surfaces, which compresses the defect and non-defect parts separately using different compression approaches. A curvature-based compression method is designed for the defect points, and an inter-point compression method is developed for the non-defect part, achieving compression of both components of the point cloud. The experimental results show the advantages of the proposed compression method through a comparative analysis of time efficiency, compression ratio, and reconstruction accuracy for industrial point cloud compression. © 2023 IEEE.

关键词： Grading

来源：评论

学校读者我要写书评

暂无评论

Congestion Relief in Downlink OFDMA Cellular System Using Inter-Cell Relay

引用

China Communications 2019年第4期16卷 35-46页

作者： Weifeng Lu Mingqi Zhu Jia Xu Siguang Chen Lijun Yang Jian Xu School of Computer Science Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications College of Internet of Things Nanjing University of Posts and Telecommunications School of Computer Science and Engineering Nanjing University of Science and Technology

This paper proposes the concept of inter-cell relay for downlink orthogonal frequency division multiple access(OFDMA) cellular systems, which uses multi-hop to relay calls from overloaded cells to light-load neighboring cells. It is shown that when using inter-cell relay, the number of calls in the congestion cell can be significantly increased. The congestion cell is divided into two parts. One is called non-relay area(NRA), in which a call directly communicates with the base station(BS) of a congested cell. The other is called relay area(RA), in which a call communicates with the BS of a neighboring cell through a relay station(RS). The two parts have different user-call densities. By adjusting the densities of two parts, we will maximize the number of supported calls inside a congested cell. The results show the benefits gained from inter-cell relay in congestion relief, which can reduce cell congestion by fully utilizing the available resources in the neighboring cells.

关键词： OFDMA cellular system congestion relief optimization problem inter-cell relay

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：