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

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yajun Liu Yulian Ding Aimin Li Rong Fei Xie Guo Fangxiang Wu Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an University of Technology Xi'an China Division of Biomedical Engineering University of Saskatchewan Saskatoon Canada Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an University of Technology Xi'an China Department of Computer Science Department of Mechanical Engineering Division of Biomedical Engineering University of Saskatchewan Saskatoon Canada

ISBN: (数字)9781665468190

ISBN: (纸本)9781665468206

PIWI-interacting RNAs (piRNAs) are a type of small non-coding RNAs which bind with the PIWI proteins to exert biological effects in various regulatory mechanisms. A growing amount of evidence reveals that exosomal piRNAs are potential biomarkers for diagnosis and treatment of complex diseases. Effective methods for the prediction of exosomal piRNAs are the foundation of piRNA functional research. In this study, we propose an end-to-end deep network for identifying exosomal piRNAs based on features learned from natural language processing (NLP) models for sequence embedding with attention mechanism. First, a benchmark dataset is constructed by processing piRNA subcellular localization annotated data and sequence data. Moreover, bagging positive unlabeled learning is applied to get the reliable negative set. Finally, we treat a piRNA sequence as a sentence and its k-mer subsequence as a token. Sequence embedding models with self-attention mechanism is designed to extract features from exosome piRNA sequences, which are used for the prediction task. Compared with three competing methods, our model achieves the best performance and reveals the key factors of exosomal piRNA sequences by the attention mechanism. Our model characterizes exosomal piRNAs and could be beneficial for researchers to investigate exosomal piRNAs’ functions.

关键词： Proteins Location awareness RNA Biological system modeling Predictive models Feature extraction Natural language processing

来源：评论

学校读者我要写书评

暂无评论

Social Recommendation Combining Implicit Information and Rating Bias

Social Recommendation Combining Implicit Information and Rat...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Weizhi Ying Qing Yu Zuohua Wang Tianjin Key Laboratory of Intelligence Computing and Network Security Tianjin University of Technology Tianjin China China Everbright Bank CO.LTD Beijing China

ISBN: (纸本)9781728165974;9781728165981

In recent years, more and more recommendation algorithm considers social information. However, in the existing social recommendation algorithm focused on the rating prediction task, the user's rating bias and the item's rating bias are often not considered. Besides, the existing social recommendation algorithms usually fail to deal with the sparse problem of social information. Concerning the problem of ignores rating bias and social information sparsity in the social recommendation, this paper proposes a novel recommendation model that combines implicit information and rating bias based on the traditional matrix factorization model. The social information used includes explicit social information and implicit social information generated by collaborative user network embedding methods. Experimental results on two real public datasets show that compared with other recommendation models, the proposed model reduces 1.13% to 10.09% and 3.14% to 8.38% respectively in the Root Mean Square Error (RMSE) and the Mean Absolute Error (MAE). It shows that our proposed recommendation algorithm has a better recommendation effect.

关键词： Computational modeling Conferences Collaboration Transforms Prediction algorithms Collaborative work Sparse matrices

来源：评论

学校读者我要写书评

暂无评论

Dynamic Detection of Malicious Code on Android Based on Improved Multi-feature Gaussian Kernel 15th

Dynamic Detection of Malicious Code on Android Based on Impr...

引用

15th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2019, co-located with the 5th International Conference on Harmony Search, Soft computing and Applications, ICHSA 2019

作者： Yu, Qing Luo, Xixi Wang, Zuohua Tianjin Key Laboratory of Intelligence Computing and Network Security Tianjin University of Technology Tianjin300384 China China Everbright Bank Co. Ltd. Tianjin300384 China

ISBN: (纸本)9783030325909

In recent years, with the increasing demand for mobile Internet, smartphones represented by the Android system begin to play an increasingly important role in people’s daily life. Due to the payment and social functions of smartphones, users’ property safety and personal privacy are increasingly threatened by malicious mobile apps. Lured by great interests, malicious applications began to spread in the mobile platform, malicious code is escalating, Android-side security is facing great threats. Therefore, it is very important to study the detection of malicious code in Android. This paper studies and analyzes the status of Android malicious code detection. On the basis of dynamic detection, this paper presents a dynamic detection algorithm of multi-feature IGK. The algorithm optimizes feature selection and Gaussian kernel function and applies the improved algorithm to multi-feature training to improve the detection accuracy of malicious code. We track application system calls and system service calls while the system is running, extract features from system call sequences and system service calls. Then we use the improved weighted information gain method to select the features. Finally, in view of the deficiencies of the traditional Gaussian kernel function in recognition rate and processing time, an improved Gaussian kernel function is proposed for machine learning. We evaluated our approach with 800 benign applications and 1200 malicious applications. The experimental results show that by the above two improvements, the highest detection rate is 97.5%, better than the existing methods. © 2020, Springer Nature Switzerland AG.

关键词： Smartphones

来源：评论

学校读者我要写书评

暂无评论

AsyncSC: An Asynchronous Sidechain for Multi-Domain Data Exchange in Internet of Things

arXiv

引用

arXiv 2024年

作者： Yang, Lingxiao Dong, Xuewen Wan, Zhiguo Gao, Sheng Tong, Wei Lu, Di Shen, Yulong Du, Xiaojiang The School of Computer Science and Technology Xidian University The Engineering Research Center of Blockchain Technology Application and Evaluation Ministry of Education China The Shaanxi Key Laboratory of Blockchain and Secure Computing Xi'An710071 China The Zhejiang Lab Hangzhou311121 China The School of Information Central University of Finance and Economics Beijing100081 China The School of Information Science and Engineering Zhejiang Sci-Tech University Hangzhou310018 China The School of Computer Science and Technology Xidian University China The Shaanxi Key Laboratory of Network and System Security Xi'An710071 China The School of Engineering and Science Stevens Institute of Technology Hoboken07030 United States

Sidechain techniques improve blockchain scalability and interoperability, providing decentralized exchange and cross-chain collaboration solutions for Internet of Things (IoT) data across various domains. However, current state-of-the-art (SOTA) schemes for IoT multi-domain data exchange are constrained by the need for synchronous networks, hindering efficient cross-chain interactions in discontinuous networks and leading to suboptimal data exchange. In this paper, we propose AsyncSC, a novel asynchronous sidechain construction. It employs a committee to provide Cross-Blockchain as a Service (C-BaaS) for data exchange in multi-domain IoT. To fulfill the need for asynchronous and efficient data exchange, we combine the ideas of aggregate signatures and verifiable delay functions to devise a novel cryptographic primitive called delayed aggregate signature (DAS), which constructs asynchronous cross-chain proofs (ACPs) that ensure the security of cross-chain interactions. To ensure the consistency of asynchronous transactions, we propose a multilevel buffered transaction pool that guarantees the transaction sequencing. We analyze and prove the security of AsyncSC, simulate an asynchronous communication environment, and conduct a comprehensive evaluation. The results show that AsyncSC outperforms SOTA schemes, improving throughput by an average of 1.21 to 3.96 times, reducing transaction latency by 59.76% to 83.61%, and maintaining comparable resource overhead. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Survey on Edge Data Integrity Verification: Fundamentals and Future Trends

arXiv

引用

arXiv 2022年

作者： Zhao, Yao Qu, Youyang Xiang, Yong Uddin, Md Palash Peng, Dezhong Gao, Longxiang School of Information Technology Deakin University Australia Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science China College of Computer Science Sichuan University China

Recent advances in edge computing (EC) have pushed cloud-based data caching services to edge, however, such emerging edge storage comes with numerous challenging and unique security issues. One of them is the problem of edge data integrity verification (EDIV) which coordinates multiple participants (e.g., data owners and edge nodes) to inspect whether data cached on edge is authentic. To date, various solutions have been proposed to address the EDIV problem, while there is no systematic review. Thus, we offer a comprehensive survey for the first time, aiming to show current research status, open problems, and potentially promising insights for readers to further investigate this under-explored field. Specifically, we begin by stating the significance of the EDIV problem, the integrity verification difference between data cached on cloud and edge, and three typical system models with corresponding inspection processes. To thoroughly assess prior research efforts, we synthesize a universal criteria framework that an effective verification approach should satisfy. On top of it, a schematic development timeline is developed to reveal the research advance on EDIV in a sequential manner, followed by a detailed review of the existing EDIV solutions. Finally, we highlight intriguing research challenges and possible directions for future work, along with a discussion on how forthcoming technology, e.g., machine learning and context-aware security, can augment security in EC. Given our findings, some major observations are: there is a noticeable trend to equip EDIV solutions with various functions and diversify study scenarios;completing EDIV within two types of participants (i.e., data owner and edge nodes) is garnering escalating interest among researchers;although the majority of existing methods rely on cryptography, emerging technology is being explored to handle the EDIV problem. Copyright © 2022, The Authors. All rights reserved.

关键词： Data integrity

来源：评论

学校读者我要写书评

暂无评论

Graph Learning-Based Multi-User Multi-Task Offloading in Wireless computing Power networks

引用

IEEE Internet of Things Journal 2025年

作者： Dai, Yueyue Rao, Xiaoyang Gu, Bruce Qu, Youyang Yang, Huiran Lu, Yunlong Huazhong University of Science and Technology Research Center of6G Mobile Communications School of Cyber Science and Engineering Wuhan430074 China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education China Australia University of Chinese Academy of Sciences Institute of Information Engineering Chinese Academy of Sciences Beijing China and the School of Cyber Security Beijing China Beijing Jiaotong University School of Electronic and Information Engineering Beijing100044 China

To enhance service quality, wireless computing power networks (WCPNs) need to realize flexible scheduling and allocation of computation resources across heterogeneous computing servers. Due to large user scales and diverse computation tasks, it is difficult for the current WCPN to serve multiple users and handle multiple tasks concurrently. Graph learning is a promising approach that can learn the representations of nodes through graph structures, enabling the exploration of dependencies among multiple users and tasks, and thereby facilitating computation task offloading. In this paper, we propose a graph learning-based multi-user multi-task offloading scheme for WCPN. First, we propose a wireless computing power network with multi-user and multi-task in which users need to make full use of distributed computing resources through task offloading to ensure efficient task execution. We formulate a system energy consumption minimization problem to jointly optimize computation resources, transmission power, and task offloading. To address the problem, we utilize graph learning to transform the joint optimization problem into a graph regression problem and leverage line graph to explore the solution. Numerical results demonstrate that our proposed scheme can improve computation efficiency, enhance optimization performance, and maintain transferability compared with the benchmarks. © 2014 IEEE.

关键词： computing power

来源：评论

学校读者我要写书评

暂无评论

Research on the Distribution Characteristics of Standardized Big Data Resources Based on Data Visualization——Taking Standardization Practice in Shandong Province as an Example

Research on the Distribution Characteristics of Standardized...

引用

IEEE International Conference on Data Science in Cyberspace (DSC)

作者： Jinyang Sun Dongdong Peng Zhe Lu Mengran Zhai Ning Qi Yuanhua Qi SHANDONG SCICOM Information and Economy Research Institute Co. Ltd Jinan China Jinan Municipal Bureau of Big Data Jinan China Shandong Institute of Economy and Informatization Development Jinan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology Shandong Academy of Sciences Jinan China

ISBN: (数字)9798350391367

ISBN: (纸本)9798350391374

Standardized big data, as a product of the combination of big data and standardization work, objectively reflects the status quo and trends of standardization work. An in-depth study of the distribution characteristics of standardized big data resources has important value for improving the efficiency of standardization. Therefore, this paper explores the characteristics of the distribution of standardization resources from the dimensions of spatial and temporal distribution, industry distribution, standard type distribution, and distribution of think tank experts through visual analysis methods. The study shows that: (1) the distribution of standardization resources in Shandong Province presents significant hierarchical and geographical characteristics; (2) from the viewpoint of the distribution of industry types and standard types, the distribution of standardization resources in Shandong Province presents a typical "long-tailed distribution"; (3) the distribution of think-tank experts presents obvious "agglomeration effect".

关键词： Industries Technological innovation Heavily-tailed distribution Animals Urban areas Data visualization Forestry Big Data Fisheries Standards

来源：评论

学校读者我要写书评

暂无评论

A Resilient Decentralized Learning Approach against Byzantine Attack via Reputation Evaluation

A Resilient Decentralized Learning Approach against Byzantin...

引用

Youth Academic Annual Conference of Chinese Association of Automation (YAC)

作者： Heng Zhang Wenting Wang Xuguo Jiao Ming Yang Xiaoming Wu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan P. R. China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan P. R. China College of Control Science and Engineering Zhejiang University Hangzhou China State Grid Shandong Electric Power Research Institute Jinan China School of Information and Control Engineering Qingdao University of Technology Qingdao China

ISBN: (数字)9798350379228

ISBN: (纸本)9798350390780

Machine learning is a key component of many applications, among which decentralized learning has attracted wide attention because of its cost-effectiveness and high efficiency. However, decentralized learning is vulnerable to various Byzantine attacks. Existing defense models face challenges in defending against complex attacks and are often constrained by strict network topologies. To address this issue, a parameter aggregation rule based on reputation evaluation (RPV) is proposed in this paper. This rule establishes a reputation model for neighboring nodes and continuously updates it based on their distance performance during each iteration. By applying the reputation model of neighboring nodes to the Beta distribution, their reliability is obtained. Based on the reliability of neighboring nodes, the set of reliable nodes for this iteration and select parameter values from them for aggregation are determined. Finally, we gradually eliminate the influence of Byzantine nodes. Our experimental results on the MNIST dataset demonstrate that the proposed algorithm is resilient to attacks from any number of Byzantine nodes and outperforms previous defense models in terms of network topology constraints, training accuracy, and computational costs.

关键词： Training Learning systems Accuracy network topology Computational modeling Machine learning Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

Channel Drop Out:A Simple Way to Prevent CNN from Overfitting in Motor Imagery Based BCI

Channel Drop Out:A Simple Way to Prevent CNN from Overfittin...

引用

2021国际计算机前沿大会

作者： Jing Luo Yaojie Wang Rong Xu Guangming Liu Xiaofan Wang Yijing Gong Shaanxi Key Laboratory for Network Computing and Security Technology School of Computer Science and EngineeringXi'an University of Technology Shaanxi Province Institute of Water Resources and Electric Power Investigation and Design

With the development of deep learning,many motor imagery brain-computer interfaces based on convolutional neural networks(CNNs) show outstanding ***,the trial number of EEG in the training set is usually limited,and redundancy extensively exists in multiple channel ***,overfitting often appears in CNN based motor imagery recognition model and greatly affects the performances of *** this paper,channel drop out is proposed to address this problem by data augmentation and ensemble ***,one of all EEG channels will be dropped and replaced by the mean signal of all EEG *** this way,the trial number in the training set was enlarged by channel drop *** at the testing stage,all the EEG trials processed by channel drop out were fed to the CNN model and the average output probabilities of them were applied to determine the *** experiments were conducted on two popular CNN models applied in motor imagery BCI and BCI Competition IV datasets 2 a to verify the performances of the proposed channel drop out *** results show that average improvements provided by channel drop out in two-category or four-category motor imagery classification are 2.83%and 2.65% compared with the original CNN *** the channel drop out approach significantly improves the performances of motor imagery based BCI.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Auto-Parallel Method for Deep Learning Models Based on Genetic Algorithm

An Auto-Parallel Method for Deep Learning Models Based on Ge...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yan Zeng ChengChuang Huang YiJie Ni ChunBao Zhou JiLin Zhang Jue Wang MingYao Zhou MeiTing Xue YunQuan Zhang School of Computer Science and Technology Hangzhou Dianzi University Hangzhou China Key Laboratory for Modeling and Simulation of Complex Systems Ministry of Education Hangzhou China Data Security Governance Zhejiang Engineering Research Center Hangzhou China School of ITMO Joint Institute Hangzhou Dianzi University Hangzhou China Institute of Computer Network Information Center of the Chinese Academy of Sciences Beijing China HuaWei State Key Laboratory of Computer Architecture Institute of Computing Technology of the Chinese Academy of Sciences Beijing China

As the size of datasets and neural network models increases, automatic parallelization methods for models have become a research hotspot in recent years. The existing auto-parallel methods based on machine learning or graph algorithms still have issues with search efficiency and applicability. This paper proposes an automatic parallel method based on a dual-population genetic algorithm, TGA, which transforms model partitioning and placement into an integer linear programming problem and constructs a cost model to evaluate the solution. The solution space is built using the neural network’s dataflow graph and device cluster’s topology, and the dual-population genetic algorithm is used to search for the optimal model parallel strategy. Experiments with various models show that the proposed method can improve single-step execution time by up to 42% compared to the Baechi method and up to 37.7% compared to the Hierarchical method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：