您的检索：
学者姓名：杨震
精炼检索结果：
年份
成果类型
收录类型
来源
综合
合作者
语言
清除所有精炼条件
摘要 ：
针对新冠疫情期间"停课不停学"的教学需求,分析计算机类专业课线上教学的平台及工具,结合北京工业大学的课程特点,阐述以学生为中心的创新教学实践过程,通过课程教学数据的分析,说明教学效果.
关键词 ：
自主学习 自主学习 移动互联网应用安全 移动互联网应用安全 线上实验 线上实验 线上教学 线上教学
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | 庄俊玺 , 赖英旭 , 刘静 et al. 移动互联网应用安全课程线上教学创新实践 [J]. | 计算机教育 , 2021 , (3) : 6-9,14 . |
| MLA | 庄俊玺 et al. "移动互联网应用安全课程线上教学创新实践" . | 计算机教育 3 (2021) : 6-9,14 . |
| APA | 庄俊玺 , 赖英旭 , 刘静 , 杨震 . 移动互联网应用安全课程线上教学创新实践 . | 计算机教育 , 2021 , (3) , 6-9,14 . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
移动互联网应用安全课程线上教学创新实践
关键词 ：
移动互联网应用安全 移动互联网应用安全 线上实验 线上实验 线上教学 线上教学 自主学习 自主学习
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | 庄俊玺 , 赖英旭 , 刘静 et al. 移动互联网应用安全课程线上教学创新实践 [J]. | 庄俊玺 , 2021 , (3) : 6-9,14 . |
| MLA | 庄俊玺 et al. "移动互联网应用安全课程线上教学创新实践" . | 庄俊玺 3 (2021) : 6-9,14 . |
| APA | 庄俊玺 , 赖英旭 , 刘静 , 杨震 , 计算机教育 . 移动互联网应用安全课程线上教学创新实践 . | 庄俊玺 , 2021 , (3) , 6-9,14 . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
With the rapid development of intelligent transportation, massive data are generated by autonomous vehicle systems and shared among vehicles through cloud servers to improve the driving experience and service quality. However, cloud servers cannot be fully trusted and may lead to serious data security challenges.
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | Yu, Haiyang , Ma, Shuai , Hu, Qi et al. Blockchain-Based Continuous Auditing for Dynamic Data Sharing in Autonomous Vehicular Networks [J]. | COMPUTER , 2021 , 54 (8) : 33-45 . |
| MLA | Yu, Haiyang et al. "Blockchain-Based Continuous Auditing for Dynamic Data Sharing in Autonomous Vehicular Networks" . | COMPUTER 54 . 8 (2021) : 33-45 . |
| APA | Yu, Haiyang , Ma, Shuai , Hu, Qi , Yang, Zhen . Blockchain-Based Continuous Auditing for Dynamic Data Sharing in Autonomous Vehicular Networks . | COMPUTER , 2021 , 54 (8) , 33-45 . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
To address privacy concerns, data in the blockchain should be encrypted in advance to avoid data access from all users in the blockchain. However, encrypted data cannot be directly retrieved, which hinders data sharing in the blockchain. Several works have been proposed to deal with this problem. However, the data retrieval in these schemes requires the participation of data owners and lacks finer-grained access control. In this paper, we propose an attribute-based keyword search scheme over the encrypted blockchain, which allows users to search encrypted files over the blockchain based on their attributes. In addition, we build a file chain structure to improve the efficiency of searching files with the same keyword. Security analysis proves the security of the proposed scheme. Theoretical analysis and experimental results in performance evaluation show that our scheme is feasible and efficient.
关键词 ：
attribute-based encryption attribute-based encryption Blockchain Blockchain searchable encryption searchable encryption smart contract smart contract
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | Yang, Zhen , Zhang, Hongao , Yu, Haiyang et al. Attribute-BasedKeyword Search over the Encrypted Blockchain [J]. | CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES , 2021 , 128 (1) : 269-282 . |
| MLA | Yang, Zhen et al. "Attribute-BasedKeyword Search over the Encrypted Blockchain" . | CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES 128 . 1 (2021) : 269-282 . |
| APA | Yang, Zhen , Zhang, Hongao , Yu, Haiyang , Li, Zheng , Zhu, Bocheng , Sinnott, Richard O. . Attribute-BasedKeyword Search over the Encrypted Blockchain . | CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES , 2021 , 128 (1) , 269-282 . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
Data backup is a pervasive strategy adopted by cloud service providers (CSPs) to avoid potential risks of data loss. As a result, a CSP normally maintains multiple replicas for each piece of data on geographically distributed servers to improve reliability. A key problem of this replication technique is that users will be charged more when more replicas are stored. Therefore, an auditing service is desired to help users verify whether an untrusted CSP stores all their replicas in different geographic locations or not. In this paper, we propose a dynamic multi-replica auditing scheme that has the following features: (1) it can verify both the integrity and geographic locations of a cloud user's data replicas; (2) the proposed scheme can identify different copies with geographic locations, which reduces the complexity in data preprocessing, dynamic operations and backup recovery; (3) by introducing an Indexed Merkle Hash Tree (IMHT), we can reduce overall costs of existing Merkle Hash Trees. We prove the security of the proposed scheme under the random oracle model, and further provide a comprehensive comparison between the proposed scheme and existing schemes. The theoretical analysis and experiment evaluation show that our scheme reduces both the communication and computation costs compared with existing schemes. The analysis also shows that the proposed scheme can achieve 99% verification probability by challenging only 90 data blocks. (C) 2021 Elsevier B.V. All rights reserved.
关键词 ：
Cloud storage auditing Cloud storage auditing Geographic location Geographic location Merkle hash tree Merkle hash tree Multiple replicas Multiple replicas
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | Yu, Haiyang , Yang, Zhen , Waqas, Muhammad et al. Efficient dynamic multi-replica auditing for the cloud with geographic location [J]. | FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE , 2021 , 125 : 285-298 . |
| MLA | Yu, Haiyang et al. "Efficient dynamic multi-replica auditing for the cloud with geographic location" . | FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 125 (2021) : 285-298 . |
| APA | Yu, Haiyang , Yang, Zhen , Waqas, Muhammad , Tu, Shanshan , Han, Zhu , Halim, Zahid et al. Efficient dynamic multi-replica auditing for the cloud with geographic location . | FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE , 2021 , 125 , 285-298 . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
Decentralized storage powered by blockchain is becoming a new trend that allows data owners to outsource their data to remote storage resources offered by various storage providers. Unfortunately, unqualified storage providers easily encounter unpredictable downtime due to security threats, such as malicious attacks or system failures, which is unacceptable in many real-time or data-driven applications. As a result, continuous data integrity should be guaranteed in decentralized storage, which ensures that data is intact and available for the entire storage period. However, this requires frequent checking for long time periods and incurs heavy burdens of both communication and computation, especially in a big data scenario. In this paper, we propose an efficient continuous big data integrity checking approach for decentralized storage. We design a data-time sampling strategy that randomly checks the integrity of multiple files at each time slot with high checking probability. Furthermore, to tackle the fairness problem derived from the sampling strategy, we propose a fair approach by designing an arbitration algorithm with the verifiable random function. Security analysis shows the security of our approach under the random oracle model. Evaluation and experiments demonstrate that our approach is more efficient in the big data scenario compared with the state-of-the-arts.
关键词 ：
Big data Big data Big Data Big Data Blockchain Blockchain Cloud computing Cloud computing Data integrity Data integrity data integrity checking data integrity checking decentralized storage decentralized storage Metadata Metadata sampling sampling Security Security Servers Servers verifiable random function verifiable random function
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | Yu, Haiyang , Hu, Qi , Yang, Zhen et al. Efficient Continuous Big Data Integrity Checking for Decentralized Storage [J]. | IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING , 2021 , 8 (2) : 1658-1673 . |
| MLA | Yu, Haiyang et al. "Efficient Continuous Big Data Integrity Checking for Decentralized Storage" . | IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 8 . 2 (2021) : 1658-1673 . |
| APA | Yu, Haiyang , Hu, Qi , Yang, Zhen , Liu, Huan . Efficient Continuous Big Data Integrity Checking for Decentralized Storage . | IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING , 2021 , 8 (2) , 1658-1673 . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
Protein-RNA interactions play essential roles in a wide variety of biological processes. Recognition of RNA-binding residues on proteins has been a challenging problem. Most of methods utilize the position-specific scoring matrix (PSSM). It has been found that considering the evolutionary information of sequence neighboring residues can improve the prediction. In this work, we introduce a novel method SNB-PSSM (spatial neighbor-based PSSM) combined with the structure window scheme where the evolutionary information of spatially neighboring residues is considered. The results show our method consistently outperforms the standard and smoothed PSSM methods. Tested on multiple datasets, this approach shows an encouraging performance compared with RNABindRPlus, BindN+, PPRInt, xypan, Predict_RBP, SpaPF, PRNA, and KYG, although is inferior to RNAProSite, RBscore, and aaRNA. In addition, since our method is not sensitive to protein structure changes, it can be applied well on binding site predictions of modeled structures. Thus, the result also suggests the evolution of binding sites is spatially cooperative. The proposed method as an effective tool of considering evolutionary information can be widely used for the nucleic acid-/protein-binding site prediction and functional motif finding.
关键词 ：
binding site prediction binding site prediction position-specific scoring matrix position-specific scoring matrix protein-RNA interfaces protein-RNA interfaces spatial neighbor spatial neighbor
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | Liu Yang , Gong Weikang , Yang Zhen et al. SNB-PSSM: A spatial neighbor-based PSSM used for protein-RNA binding site prediction. [J]. | Journal of molecular recognition : JMR , 2021 , 34 (6) : e2887 . |
| MLA | Liu Yang et al. "SNB-PSSM: A spatial neighbor-based PSSM used for protein-RNA binding site prediction." . | Journal of molecular recognition : JMR 34 . 6 (2021) : e2887 . |
| APA | Liu Yang , Gong Weikang , Yang Zhen , Li Chunhua . SNB-PSSM: A spatial neighbor-based PSSM used for protein-RNA binding site prediction. . | Journal of molecular recognition : JMR , 2021 , 34 (6) , e2887 . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
Sarcasm is common in social media, and people use it to express their opinions with stronger emotions indirectly. Although it belongs to a branch of sentiment analysis, traditional sentiment analysis methods cannot identify the rhetoric of irony as it requires a significant amount of background knowledge. Existing sarcasm detection approaches mainly focus on analyzing the text content of sarcasm using various natural language processing techniques. It is argued herein that the essential issue for detecting sarcasm is examining its context, including sentiments of texts that reply to the target text and user's expression habit. A dual-channel convolutional neural network is proposed that analyzes not only the semantics of the target text, but also its sentimental context. In addition, SenticNet is used to add common sense to the long short-term memory (LSTM) model. The attention mechanism is then applied to take the user's expression habits into account. A series of experiments were carried out on several public datasets, the results of which show that the proposed approach can significantly improve the performance of sarcasm detection tasks.
关键词 ：
Attention mechanism Attention mechanism Convolutional neural network Convolutional neural network Expression habit Expression habit Sarcasm detection Sarcasm detection Sentimental context Sentimental context
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | Du, Yu , Li, Tong , Pathan, Muhammad Salman et al. An Effective Sarcasm Detection Approach Based on Sentimental Context and Individual Expression Habits [J]. | COGNITIVE COMPUTATION , 2021 . |
| MLA | Du, Yu et al. "An Effective Sarcasm Detection Approach Based on Sentimental Context and Individual Expression Habits" . | COGNITIVE COMPUTATION (2021) . |
| APA | Du, Yu , Li, Tong , Pathan, Muhammad Salman , Teklehaimanot, Hailay Kidu , Yang, Zhen . An Effective Sarcasm Detection Approach Based on Sentimental Context and Individual Expression Habits . | COGNITIVE COMPUTATION , 2021 . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
We have prepared GexSe10Te90-x glasses with a composition of x from 17.5 to 26.25 and measured their properties using various diagnosis tools. It was found that, all the glasses have a transmittance more than 40% at a wavelength range from 2 to 15 mu m, and linear refractive index n0 decreases but optical bandgap energy Eg increases with decreasing Te contents in the glasses. We also analysed the evolution of n2 and beta as a function of Ge content, both the evolution of n2 and beta are close to the prediction by Sheik-Bahae et al. for optical nonlinearity of semiconductors. In all cases, the nonlinear optical refractive index n2 measured at 3.0 mu m is larger than that at 2.5 mu m due to the two-photon resonance effect, and a maximum nonlinear index is 2.46 x 10-13 cm2/W at composition of Ge17.5Se10Te72.5. Such larger nonlinearity around 10-13 cm2/W observed in the present paper is one order of the magnitude larger than that in S- and Se-based chalcogenide glasses, demonstrating potentials of Te-based glasses for the applications as mid- and far-infrared nonlinear optical devices.
关键词 ：
Chalcogenide glass Chalcogenide glass Nonlinear refractive index Nonlinear refractive index Optical bandgap Optical bandgap Third-order optical nonlinearity Third-order optical nonlinearity
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | Yang, Zhen , Hu, Haonan , Li, Qiuli et al. Third-order optical nonlinearity in Ge-Se-Te chalcogenide glasses [J]. | OPTICAL MATERIALS , 2021 , 117 . |
| MLA | Yang, Zhen et al. "Third-order optical nonlinearity in Ge-Se-Te chalcogenide glasses" . | OPTICAL MATERIALS 117 (2021) . |
| APA | Yang, Zhen , Hu, Haonan , Li, Qiuli , Zhang, Zheng , Niu, Lei , Wu, Jian et al. Third-order optical nonlinearity in Ge-Se-Te chalcogenide glasses . | OPTICAL MATERIALS , 2021 , 117 . |
| 导入链接 | NoteExpress RIS BibTex |
摘要 ：
Music recommendation systems based on deep learning have been actively explored using hybrid approaches. However, most of the models proposed by previous studies adopt coarse-grained embedding approaches (e.g., CNNs) to characterize audio features. Users’ fine-grained preferences for music content have not been effectively explored yet. In this work, we propose a hybrid music recommendation model based on attention mechanism, which integrates user’s historical behaviour records and audio content and can capture the user’s fine-grained preferences for music content due to the introduction of attention mechanism. We experimented with a subset of the last.fm-1b dataset (30,753 users, 10,000 songs, 1533,245 interactions). The experimental results show that our method outperforms baselines approaches. © 2021, Springer Nature Switzerland AG.
关键词 ：
Audio acoustics Audio acoustics Deep learning Deep learning Recommender systems Recommender systems
引用：
复制并粘贴一种已设定好的引用格式，或利用其中一个链接导入到文献管理软件中。
| GB/T 7714 | Feng, Weite , Li, Tong , Yu, Haiyang et al. A Hybrid Music Recommendation Algorithm Based on Attention Mechanism [C] . 2021 : 328-339 . |
| MLA | Feng, Weite et al. "A Hybrid Music Recommendation Algorithm Based on Attention Mechanism" . (2021) : 328-339 . |
| APA | Feng, Weite , Li, Tong , Yu, Haiyang , Yang, Zhen . A Hybrid Music Recommendation Algorithm Based on Attention Mechanism . (2021) : 328-339 . |
| 导入链接 | NoteExpress RIS BibTex |
导出
| 数据： |
选中 到 |
| 格式： |
