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

Design, Automation and Test in Europe Conference and Exhibition

作者： Lanlan Cui Yichuan Wang Renzhi Xiao Miao Li Xiaoxue Liu Xinhong Hei School of Computer Science and Engineering XI'AN University of Technology Xi'an China Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an China School of Software Engineering Jiangxi University of Science and Technology Nanchang China School of Information Engineering Zhongnan University of Economics and Law Wuhan China

ISBN: (数字)9783982674100

ISBN: (纸本)9798331534646

With the advancement of NAND flash technology, the increased storage density leads to intensified interference, which in turn raises the error rate during data retrieval. To ensure data reliability, low-density parity-check (LDPC) codes are extensively employed for error correction in NAND flash memory. Although LDPC soft decision decoding offers high error correction capability, it comes with a significant latency. Conversely, hard-decision decoding, although faster, lacks sufficient error correction strength. Consequently, flash memory typically initiates with hard-decision decoding and resorts to multiple soft decision decoding upon failure. To minimize decoding latency, this paper proposes a decoding mechanism based on the double hard decision, called DHD. This DHD scheme improves the Log-Likelihood Ratio (LLR) in the hard decision process. After the first hard decision fails, the read reference voltage (RRV) is adjusted to perform the second hard decision decoding. If the second hard decision also fails, soft decision decoding is then employed. Experimental results demonstrate that when the Raw Bit Error Rate (RBER) is $8.5 \times 10^{-3}$ , DHD reduces the Frame Error Rate (FER) by 86.4% compared to the traditional method.

关键词： Lead acid batteries Europe Voltage Interference Decoding Error correction Error correction codes Reliability Flash memories Iterative decoding

来源：评论

学校读者我要写书评

暂无评论

KA$^{2}$2SE: key-Aggregation Authorized Searchable Encryption Scheme for Data Sharing in Wireless Sensor networks

引用

IEEE Transactions on Services computing 2024年第1期18卷 226-238页

作者： Haijiang Wang Jianting Ning Wei Wu Chao Lin Kai Zhang School of Information and Electronic Engineering Zhejiang University of Science and Technology Zhejiang China School of Cyber Science and Engineering Wuhan University Wuhan China Faculty of Data Science City University of Macau Macau China College of Education Sciences Hong Kong University of Science and Technology Guangzhou China Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fujian Normal University Fuzhou China Guangdong Key Laboratory of Blockchain Security Guangzhou University Guangzhou China College of Computer Science and Technology Shanghai University of Electric Power Shanghai China

As a promising technology, key-aggregation searchable encryption with constant computation overhead is especially suitable for sensor nodes with limited computation resources in wireless sensor networks. However, in most of the existing key-aggregation searchable encryption schemes, the authorized aggregation key is generated in a deterministic way. As a result, these schemes suffer from “ key Forge Attack ” and “ Trapdoor Forge Attack ” that we proposed and hence fail to support the security property as they claimed (which is an important goal to be achieved in key-aggregation searchable encryption schemes). To fix these flaws, in this paper, we identify the security challenges related to key-aggregation searchable encryption and propose a lightweight key-aggregation authorized searchable encryption scheme based on attribute-based encryption, called KA $^security$ SE. It enables a data owner to share encrypted data with an authorized query user by issuing only a single authorized aggregation key, and the authorized query user only needs to submit a single trapdoor to the cloud server to perform keyword search. We formulate the security definitions for KA $^security$ SE and prove its security. Finally, empirical evaluations demonstrate that KA $^security$ SE is computationally efficient in comparison with existing schemes.

关键词： Encryption Cryptography keyword search Wireless sensor networks Servers Privacy Cloud computing security Probabilistic logic Authorization

来源：评论

学校读者我要写书评

暂无评论

An Abnormal Login Detection Method Based on Local Outlier Factor and Gaussian Mixture Model

引用

International Journal of network security 2023年第2期25卷 297-305页

作者： Guo, Wei He, Yue Chen, He-Xiong Hang, Fei-Lu Li, Yun-Jie Information Center of Yunnan Power Grid Company Limited Yunnan Kunming650034 China Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology of China Sichuan Chengdu610054 China

Nowadays, various enterprises have gradually begun to provide Internet services for customers. And the security of customer accounts is constantly threatened by various factors, which may result in account password disclosure and theft. Therefore, it is an important task to identify and screen users’ abnormal login behavior to protect the customers’ interests and the servers’ security. At the same time, it becomes a key security problem to extract important features from the server’s user login data and detect abnormal login behaviors. This paper proposes a method that extracts features from the login log. It reduces the dimensions of data, then calculates the outlier score of time data and IP address data after dimension reduction by adopting the local outlier factor algorithm and Gaussian mixture model, and comprehensively analyzes outlier scores. The experimental results show that this method performs high accuracy, precision ratios, and so on, around 95%, which means it can correctly calculate the corresponding outlier score according to the abnormal degree of login behavior © 2023, International Journal of network *** Rights Reserved.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Construction and Application of the SMART Model for Adaptive Industrial Data Collection Based on Knowledge Graphs

Construction and Application of the SMART Model for Adaptive...

引用

IEEE International Conference on Big Data

作者： Wendan Cheng Zhen Zhang Heng Qian Qiuyue Wang Guanqun Su Lingge Meng 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 Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Shu Ju (Shandong) Intelligent Technology Co. Ltd. Jinan China Shandong Standard Institute of Emerging Technologies and Innovations Co. Ltd. Jinan China Shandong Qingniao IIoT Co. Ltd. Jinan China

ISBN: (数字)9798350362480

ISBN: (纸本)9798350362497

Industrial data collection is the foundation for implementing enterprise digitization, which is of great significance to the development of intelligent manufacturing. However, Industrial Data Collection Standards (IDCS) are primarily published in paper or PDF formats, which makes it challenging to associate and reuse knowledge. This brings difficulties to data collection and management of heterogeneous devices, thus affecting the adaptive collection of industrial data. For this reason, this paper introduces SMART into industrial data collection and proposes the construction and application of a knowledge graph-based SMART Model. First, ontology semantic reasoning and natural language processing techniques are utilized to develop an ontology model for industrial data collection and extract fine-grained IDCS knowledge. Then, the knowledge is integrated according to the standard primitive structure and conceptual reasoning rules by constructing a standard association model to form the Industrial Data Collection Standards Knowledge Graph (IDCS-KG). Finally, the SMART competence level is quantitatively assessed based on the completion degree of each operation within the SMART Model. An experimental case study demonstrates that the SMART Model can collect intelligent adaptive industrial data through the reasoning and analysis of equipment adaptation protocols and data quality management strategies.

关键词： Adaptation models Analytical models Protocols Knowledge graphs Data collection Ontologies Data models Cognition Natural language processing Standards

来源：评论

学校读者我要写书评

暂无评论

Significance-aware Medication Recommendation with Medication Representation Learning

Significance-aware Medication Recommendation with Medication...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Yishuo Li Zhufeng Shao Weimin Chen Shoujin Wang Yuehan Du Wenpeng Lu 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 Shandong Mental Health Center Jinan China Data Science Institute University of Technology Sydney Sydney Australia Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

The goal of medication recommendation system is to recommend appropriate pharmaceutical interventions based on a patient’s diagnosis. Most of existing approaches often formulate these recommendations use data on diagnoses, procedures, and prescriptions accumulated in the electronic health records (EHR), and despite the great successes, they seem to have limitations on modelling the significance of medication to a patient’s current visit and mining fine-grained medication representation information. To address these issues, we propose a novel Significanceaware Medication Recommendation (SMRec) framework built on significance of medication to patients and fine-grained medication representation learning. Specifically, we first design a encoding mechanism to compute significance information of medications for each patient’s visit. Then, we utilize the set-level medication co-occurrence graph based on patients’ medical history which integrates temporal dependency to learn fine-grained medication representations. Experimental results on the publicly available MIMIC-III dataset demonstrate the superior effectiveness of our model compared to other approaches 1 .

关键词： Representation learning Drugs Federated learning Computational modeling MIMICs Encoding History

来源：评论

学校读者我要写书评

暂无评论

Fusion of Dynamic Hypergraph and Clinical Event for Sequential Diagnosis Prediction

Fusion of Dynamic Hypergraph and Clinical Event for Sequenti...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Xin Zhang Xueping Peng Hongjiao Guan Long Zhao Xinxiao Qiao Wenpeng Lu 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 China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Australian Artificial Intelligence Institute University of Technology Sydney Sydney Australia

Sequential diagnosis prediction (SDP) is a challenging task, aiming to predict patients’ future diagnoses based on their historical medical records. While methods based on graph neural networks (GNNs) have proven successful for this task, they typically focus on modeling pairwise diseases using a global disease combination graph. However, these approaches neglect the fine-grained higher-order relations among persistent and emerging diseases within a single visit, which may contain crucial clues to predict the next diagnosis. Additionally, they fail to fully leverage patient-related clinical information present in electronic health records (EHRs). To address these challenges, this paper proposes a novel approach called the fusion of Dynamic Hypergraph and Clinical Event (DHCE) for sequential diagnosis prediction. The proposed method aims to exploit the fine-grained higher-order relations among diagnoses within a visit and leverage clinical event information from EHRs to improve the accuracy of predicting the next diagnosis. Specifically, DHCE categorizes diagnoses within a single visit in a fine-grained granularity into persistent and emerging categories based on a patient’s historical diagnoses. It then constructs dynamic hypergraphs to capture higher-order disease relations within each visit. Next, we design a transition function to extract the transitional context from previous visits in order to generate the visit representation. Furthermore, to fully leverage patient-related clinical events in a visit, we utilize Bio-Clinical BERT to encode them and generate the clinical event representation for each visit. Finally, we combine the visit representation and event representation to generate a comprehensive patient representation, which is then used to predict the patient’s next diagnosis. Experimental results on two benchmark datasets consistently demonstrate that DHCE outperforms state-of-the-art methods 1 .

关键词：

来源：评论

学校读者我要写书评

暂无评论

Wireless powered Backscatter Communications with Spatially Random Tags

Wireless Powered Backscatter Communications with Spatially R...

引用

2023 IEEE/CIC International Conference on Communications in China, ICCC 2023

作者： Liu, Yingting Ye, Yinghui Li, Xingwang Ma, Zhongyu Zhou, Zhiyang Lanzhou Jiaotong University School of Electronic and Information Engineering Lanzhou730070 China State Grid Gansu Electric Power Research Institute Lanzhou730070 China Beijing University of Posts and Telecommunications School of Electronic Engineering Beijing100876 China Xi'an University of Posts & Telecommunications Shaanxi Key Laboratory of Information Communication Network and Security Xi'an710121 China Henan Polytechnic University School of Physics and Electronic Information Engineering Jiaozuo454000 China College of Computer Science and Engineering Northwest Normal University Lanzhou730070 China

ISBN: (纸本)9798350345384

In this paper, a wireless powered backscatter communication (BackCom) system is considered, which consists of one dedicated radio-frequency source node (S), one destination node and multiple tags randomly located in the coverage region of S. The consumed power by tags is considered and an optimal dynamic reflection coefficient (RC) is used to maximize the power of the backscattered signals while just satisfying the tag's power requirement. The random tag selection (RTS) and nearest tag selection (NTS) schemes are proposed and the corresponding outage probabilities and diversity orders are derived. Numerical results verify the theoretical analysis and show that the NTS scheme has the best performance compared to the RTS and farthest tag selection schemes. Moreover, numerical results also show that the performance of the adopted optimal dynamic RC is superior to that of the fixed RC. © 2023 IEEE.

关键词： Backscattering

来源：评论

学校读者我要写书评

暂无评论

A Shortest Path Query Approach for Encrypted Graphs Based on Padding Dictionary Structure

A Shortest Path Query Approach for Encrypted Graphs Based on...

引用

Chinese Automation Congress (CAC)

作者： Ming Yang Kaiyang Zhang Chao Mu Xin Wang Yuanlong Liu Heng Zhang Key Laboratory of Computing Power Network and Information Security Shandong Computer Science Center Ministry of Education Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China State Grid Shandong Electric Power Company Jinan China School of Computer Engineering Jiangsu Ocean University Lianyungang China

Hybrid intelligence has emerged as an innovative approach that synergistically combines the strengths of human intelligence and artificial intelligence (AI) to address complex problems. In this paradigm, knowledge graphs play a pivotal role by supplying vital background information and contextual understanding to hybrid intelligence systems. However, due to limitations in local storage capacity, managing large-scale graph data often requires outsourcing to cloud servers. Nevertheless, the use of untrusted cloud servers poses a risk of potential user data leaks. To address these concerns, this paper presents an encryption scheme specifically designed to protect graph data, enabling queries involving intermediate nodes in the shortest path between two nodes within the graph. The proposed scheme ensures the privacy and security of outsourced data by employing a novel method that utilizes padding dictionary structure encryption. This method ensures strict limitations on the cloud server's capabilities, restricting it solely to query operations, it effectively prevents any compromise of user data or unauthorized access to sensitive information, users can securely store and process their graph data on servers, significantly reducing the potential risk of data leakage and unauthorized breaches. To validate the feasibility and effectiveness of the proposed solution, practical experiments were conducted using real-world data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Traffic Engineering in Dynamic Hybrid Segment Routing networks

引用

Computers, Materials & Continua 2021年第7期68卷 655-670页

作者： Yingya Guo Kai Huang Cheng Hu Jiangyuan Yao Siyu Zhou College of Mathematics and Computer Science Fuzhou UniversityFuzhou350000China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhou350000China Key Laboratory of Spatial Data Mining&Information Sharing Ministry of EducationFuzhou350003China School of Information Science and Technology Guangdong University of Foreign StudiesGuangzhou510006China School of Computer Science and Cyberspace Security Hainan UniversityHaiKou570228China Tandon School of Engineering New York UniversityNew York10012USA Department of Computing Hong Kong Polytechnic UniversityHong Hom999077Hong Kong

The emergence of Segment Routing(SR)provides a novel routing paradigm that uses a routing technique called source packet *** SR architecture,the paths that the packets choose to route on are indicated at the ingress *** with shortest-path-based routing in traditional distributed routing protocols,SR can realize a flexible routing by implementing an arbitrary flow splitting at the ingress *** the advantages of SR,it may be difficult to update the existing IP network to a full SR deployed network,for economical and technical *** partial of the traditional IP network to the SR network,thus forming a hybrid SR network,is a preferable *** the traffic is dynamically changing in a daily time,in this paper,we propose a Weight Adjustment algorithm WASAR to optimize routing in a dynamic hybrid SR *** algorithm can be divided into three steps:firstly,representative Traffic Matrices(TMs)and the expected TM are obtained from the historical TMs through ultrascalable spectral clustering ***,given the network topology,the initial network weight setting and the expected TM,we can realize the link weight optimization and SR node deployment optimization through a Deep Reinforcement Learning(DRL)***,we optimize the flow splitting ratios of SR nodes in a centralized online manner under dynamic traffic demands,in order to improve the network *** the evaluation,we exploit historical TMs to test the performance of the obtained routing configuration in *** extensive experimental results validate that our proposed WASAR algorithm has superior performance in reducing Maximum Link Utilization(MLU)under the dynamic traffic.

关键词： Traffic engineering routing optimization segment routing deep reinforcement learning ultra-scalable spectral clustering

来源：评论

学校读者我要写书评

暂无评论

Visible Light Positioning Method for Indoor Line-of-Sight Scene Based on Time Series Coding

Visible Light Positioning Method for Indoor Line-of-Sight Sc...

引用

IEEE International Conference on Data Science in Cyberspace (DSC)

作者： Yonghao Yu Yongde Guo Dawei Zhao Kexue Fu Yongwei Tang Qinyuan Wang Faculty of Data Science City University of Macau 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 Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China School of Mechanical Engineering Key Laboratory of High Efficiency and Clean Mechanical Manufacture Ministry of Education Shandong University Jinan China

ISBN: (数字)9798350391367

ISBN: (纸本)9798350391374

Existing indoor visible light positioning methods, such as those based on fingerprint database algorithms, are complex to construct and consume significant resources. In response to this issue, the text proposes an end-to-end indoor visible light positioning method that samples continuous signals at a small number of random coordinate positions in indoor environments. Through a deep learning method based on attention mechanism, a nonlinear mapping between the received signal and spatial position coordinates is constructed, and the time series properties in the received signal are encoded as a feature in the data. The method is further improved by combining residual networks to improve accuracy. Through simulation experiments, it has been verified that the deep learning based localization method described in this article can achieve sub meter level accuracy on small sample datasets, and it has been proven that time series features have a significant impact on localization accuracy in indoor visible light positioning algorithms based on deep learning.

关键词： Location awareness Deep learning Meters Training Accuracy Attention mechanisms Time series analysis Training data Encoding Data models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：