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

Raft Consensus Algorithm Based on Credit Model in Consortium Blockchain

Wuhan University Journal of Natural sciences 2020年第2期25卷 146-154页

作者： CHEN Yunfang LIU Ping ZHANG Wei School of Computer Science Nanjing University of Posts and TelecommunicationsNanjing 210023JiangsuChina Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and TelecommunicationsNanjing 210023JiangsuChina

As one of the underlying technologies of the blockchain,the consensus algorithm plays a vital role in ensuring security and *** a consensus algorithm for the private blockchain,Raft has better performance than the rest of the consensus algorithms,and it does not cause problems such as the concentrated hashing power,resource waste and ***,Raft can only be used in a non-byzantine environment with a small network *** order to enable Raft to be used in a large-scale network with a certain number of byzantine nodes,this paper combines Raft and credit model to propose a Raft blockchain consensus algorithm based on credit model *** the node credit evaluation phase,RBF-based support vector machine is used as the anomaly detection method,and the node credit evaluation model is *** the Trust Nodes List(TNL)mechanism is introduced to make the consensus phase in a creditable network ***,the common node is synchronized to the consensus node to update the blockchain of the entire *** show that CRaft has better throughput and lower latency than the commonly used consortium blockchain consensus algorithm PBFT(Practical Byzantine Fault Tolerance).

关键词： credit model consensus algorithm consortium blockchain P2P network

来源：评论

学校读者我要写书评

暂无评论

Topic modeling for noisy short texts with multiple relations 30

Topic modeling for noisy short texts with multiple relations

引用

30th International Conference on Software Engineering and Knowledge Engineering, SEKE 2018

作者： Liu, Chiyu Liu, Zheng Li, Tao Xia, Bin Jiangsu Key Laboratory of Big Data Security and Intelligent Processing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China

ISBN: (纸本)1891706446

Understanding contents in social networks by inferring high-quality latent topics from short texts is a significant task in social analysis, which is challenging because social network contents are usually extremely short, noisy and full of informal vocabularies. Due to the lack of sufficient word co-occurrence instances, well-known topic modeling methods such as LDA and LSA cannot uncover high-quality topic structures. Existing research works seek to pool short texts from social networks into pseudo documents or utilize the explicit relations among these short texts such as hashtags in tweets to make classic topic modeling methods work. In this paper, we explore this problem by proposing a topic model for noisy short texts with multiple relations called MRTM (Multiple Relational Topic Modeling). MRTM exploits both explicit and implicit relations by introducing a document-Attribute distribution and a two-step random sampling strategy. Extensive experiments, compared with stateof-the-Art topic modeling approaches, demonstrate that MRTM can alleviate the word co-occurrence sparsity and uncover highquality latent topics from noisy short texts. © 2018 Universitat zu Koln. All rights reserved.

关键词： Quality control

来源：评论

学校读者我要写书评

暂无评论

Temporal data fusion at the edge

Temporal data fusion at the edge

引用

2019 IEEE International Conferences on Ubiquitous Computing and Communications and data science and Computational Intelligence and Smart Computing, Networking and Services, IUCC/DSCI/SmartCNS 2019

作者： Yang, Linfu Liu, Bin School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Jiangsu Key Lab of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728152097

As an enabler technique, data fusion has gained great attention in the context of Internet of things (IoT). In traditional settings, data fusion is done at the cloud server. So the data to be fused should be transferred from the sensor nodes to the cloud server before data fusion. Such an application mode of data fusion inherits disturbing concerns from the cloud computing framework, e.g., privacy-leaking, large latency between data capture and computation, excessive ingress bandwidth consumption. We take into account how to do temporal data fusion at the edge to bypass the above issues. We present a Gaussian process based temporal data fusion (GPTDF) method targeted for the problem of sequential online prediction at the edge. The GPTDF method fits the edge computing framework and thus inherits desirable properties from edge computing, such as privacy-preserving, low latency between data capture and computation, and tiny bandwidth consumption. Through a real-data experiment using archived traffic datasets from the Caltrans Performance Measurement System (PeMS), we demonstrate that the application of GPTDF can provide more timely and accurate real-time predictions at the network edge. © 2019 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Personalized Review Recommendation based on Implicit dimension mining

Personalized Review Recommendation based on Implicit dimensi...

引用

2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL 2024

作者： Xu, Bei Xu, Yifan School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing210023 China

Users usually browse product reviews before buying products from e-commerce websites. Lots of e-commerce websites can recommend reviews. However, existing research on review recommendation mainly focuses on the general usefulness of reviews and ignores personalized and implicit requirements. To address the issue, we propose a Large language model driven Personalized Review Recommendation model based on Implicit dimension mining (PRR-LI). The model mines implicit dimensions from reviews and requirements, and encodes them in the form of "text + dimension". The experiments show that our model significantly outperforms other state-of-the-art textual models on the Amazon-MRHP dataset, with some of the metrics outperforming the state-of-the-art multimodal models. And we prove that encoding "text + dimension" is better than encoding "text" and "dimension" separately in review recommendation. © 2024 Association for Computational Linguistics.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

Multi-source Infection Pattern Mining Algorithms over Moving Objects 25

Multi-source Infection Pattern Mining Algorithms over Moving...

引用

25th IEEE International Conference on computer Supported Cooperative Work in Design, CSCWD 2022

作者： Chen, Yu Dai, Hua Yang, Geng Chen, Yanli Nanjing University of Posts and Telecommunications School of Computer Science Nanjing210003 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210003 China

ISBN: (纸本)9781665405270

Using the trajectory data of moving objects to analyze and study the infection mode of viruses or germs has practical application value. The definition of infection pattern in existing works only considers one-to-one infection mode rather than many-to-one mode, and thus some infection events could be ignored. This paper presents multi-source infection pattern mining algorithms oriented to moving objects for the first time. The multi-source infection event (MSIE) is defined. On the basis of MSIE, the multi-source infection pattern mining algorithm (MIPM) is proposed, which uses sliding window mechanism. The sliding window is used to record the set of candidate infection source that may infect each normal object at each time point, and then the determined infection events are mined. To improve performance, an optimized mining algorithm (MIPM+) based on the R-tree index is proposed, which can reduce the number of objects to be detected at each time point. The experimental results show that our proposed multi-source infection pattern mining algorithms can mine more potential infection events. © 2022 IEEE.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Customized scheduling for shared bus with deadlines

Customized scheduling for shared bus with deadlines

引用

作者： Jin, Yong Xu, Jia Xu, Lijie Liu, Linfeng Xiao, Fu Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Jiangsu Nanjing China School of Computer Science & Engineering Changshu Institute of Technology Jiangsu Changshu China

Public transportation system is one of the most effective ways to conserve energy and reduce carbon emissions. However, the traditional public transportation system does not provide customized service and cannot guarantee the arrival time to destination. To address these issues, we formulate the minimum shared bus scheduling problem to minimize the number of shared buses such that all orders can be completed under constraints of deadlines and capacity of shared bus. We propose the approximation algorithms, S-MBSA for the shared bus with strong endurance and E-MBSA for the large-scale order scenario, to solve the minimum shared bus scheduling problem. We further formulate the constrained maximum revenue shared bus scheduling problem to maximize the revenue under the limited number of shared buses, and propose an approximation algorithm, CMRBSA, to find the shared bus route schedules. Through the extensive simulations, we demonstrate the significant superiority of S-MBSA and E-MBSA in terms of number of shared buses. Furthermore, CMRBSA outperforms the benchmark algorithms significantly in terms of revenue. © 2022 John Wiley & Sons Ltd.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Risk evaluation of financial websites based on structure mining

Risk evaluation of financial websites based on structure min...

引用

International Conference on Applications and Techniques in Cyber security and Intelligence, ATCSI 2017

作者： Li, Huakang Dai, Yuhao Jin, Xu Sun, Guozi Li, Tao Xu, Zheng Jiangsu Key Lab of Big Data and Security and Intelligent Processing School of Computer Science and Technology School of Software Nanjing University of Posts and Telecommunications Nanjing China The Third Research Institute of the Ministry of Public Security Shanghai China

ISBN: (纸本)9783319670706

With the development of network communication and security authentication technologies, Internet finance, a new financial business model which allows customers to achieve online financing, payment, investment and lending, becomes more and more popular. Risk of internet finance is much higher than that of traditional financial system because of the rapid fund flowing, lack of personal credit audit, deficiency of standard network operation and imperfect of information security. Current risk control of Internet finance mainly contains network security, financial self-discipline, investor education and governmental regulatory. In this paper, we propose a risk evaluation method based on structure mining for financial website after analyzing a large number of Internet financial sites. The kernel functions algorithm of natural language syntax tree is introduced to classify the security level of website. While the URL is considered as a long sentence and the path segments are defined as keywords. The experimental results demonstrate that the structure mining method can simply evaluate the risk of Internet financial website to achieve acceptable accuracy. © 2018, Springer International Publishing AG.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

CBLNER: A Multi-models Biomedical Named Entity Recognition System Based on Machine Learning 1

引用

15th International Conference on intelligent Computing, ICIC 2019

作者： Lejun, Gong Xiaolin, Liu Xuemin, Yang Lipeng, Zhang Yao, Jia Ronggen, Yang Jiangsu Key Lab of Big Data Security and Intelligent Processing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Faculty Intelligent Science and Control Engineering Jinling Institute of Technology Nanjing211169 China

ISBN: (数字)9783030269692

ISBN: (纸本)9783030269685

Biomedical named entities is fundamental recognition task in biomedical text mining. This paper developed a system for identifying biomedical entities with four models including CRF, LSTM, Bi-LSTM and BiLSTM-CRF. The system achieved the following performance in test data Genia V3.02: CRF with an F score of 75.91%, LSTM with an F score of 71.69%, BiLSTM with a F score of 74.37%, BiLSTM-CRF with a F score of 76.81%. Experimental results show the performance of BiLSTM-CRF model is better than other three models. Compared with CRF model, Bi-LSTM-CRF model has better recognition effect for biological entities in long text and entities that modified by modifiers. Therefore, CBLNER system lays a foundation for further relationship and event extraction, and could also provide reference for entity recognition research in other fields. © 2019, Springer Nature Switzerland AG.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

Learning Disentangled Latent Factors for Individual Treatment Effect Estimation Using Variational Generative Adversarial Nets 25

Learning Disentangled Latent Factors for Individual Treatmen...

引用

25th IEEE International Conference on computer Supported Cooperative Work in Design, CSCWD 2022

作者： Bao, Qingsen Mao, Zeyong Chen, Lei Nanjing University of Posts and Telecommunications School of Computer Science Nanjing China Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China

ISBN: (纸本)9781665405270

Estimating individual treatment effect (ITE) is a challenging task due to the need for individual potential outcomes to be learned from biased data and counterfactuals are inherently unobservable. Some researchers propose to use generative adversarial approaches to infer the counterfactual outcomes based on the distribution of factual outcomes. However, these methods assume that complete confounding factors are observed, and simply treat all observed variables as confounding factors, ignoring identification of possible instrumental factors and adjustment factors, which will bring large deviation to ITE estimation when facing biased data. To address these issues, we propose a novel Variational Generative Adversarial Nets for ITE estimation by designing the collaborative learning strategy with Variational AutoEncoder (VAE) and Generative Adversarial Nets (GAN). Specifically, we employ VAE to infer the latent representations of observed variables to access complete latent factors while using GAN to infer unseen counterfactual outcomes and guide VAE for disentangling these latent factors into three sets corresponding to the instrumental, confounding, and adjustment factors. Then the disentangled latent confounding factors can be used to further control data bias using an adaptive weighting scheme. Extensive experiments on real and synthetic data demonstrate learning disentangled latent factors for ITE estimation is effective, and our method has excellent performance even with high data bias. © 2022 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：