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

2021 International Conference on Networking and Network Applications, NaNA 2021

作者： Wang, Yichuan Wang, He Hei, Xinhong Ji, Wenjiang Zhu, Lei Xi'an University of technology School of computer science and engineering Xi'an China Shaanxi Key Laboratory for Network Computing and Security Technology China

ISBN: (纸本)9781665441582

In recent years, a variety of network attacks emerge in an endless stream, and network attacks gradually show the characteristics of higher secrecy and greater harm. At present, the analysis of system vulnerabilities is generally focused on the characteristics analysis and impact hazard level, and lack of formal modeling and vulnerability analysis methods. In this paper, we model the OpenSSL service's Heartbleed vulnerability based on Petri net. We build a formal model combined with the source code and system state, analyze the vulnerability of the system running state, and propose an automatic vulnerability repair scheme. Experiments show that this model can carry out fine-grained formal analysis and simulation of the Heartbleed, which is of great significance to explore the system vulnerability modeling method. © 2021 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Generative Positive-Unlabeled Classification for Hunting Small Open Reading Frames

Generative Positive-Unlabeled Classification for Hunting Sma...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Jie Chen Wenbin Liao Du Wen Jianqiang Li Fangzhong Wang College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Laboratory of Synthetic Microbiology School of Chemical Engineering & Technology Tianjin University China

The annotation of Open Reading Frames (ORFs) is a crucial step in gene annotation, as it precisely delineates the specific regions of expressed genes. However, small Open Reading Frames (smORFs), in comparison to ORFs, are shorter in length, exhibit lower expression abundance, and are more challenging to predict. Particularly in the presence of noise in prokaryotic data and limited availability of positive sample data, the difficulty of prediction is amplified. Therefore, it is necessary to study smORF prediction methods. However, current machine learning models use limited data for modeling and overlook the existence of undiscovered positive samples within the negative samples. Additionally, they do not incorporate prior knowledge that can be calibrated to enhance the 3-nt periodicity. This work utilizes a multimodal VAE for data dimensionality reduction and employs a GAN to generate latent vectors for data augmentation. It incorporates PU learning to leverage unknown samples and combines Riboseq data from experiments with and without antibiotic treatment. Additionally, an adversarial training mechanism is employed to enhance the model’s robustness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

$k$k-TEVS: A $ k$k-Times E-Voting Scheme on Blockchain With Supervision

引用

IEEE Transactions on Dependable and Secure computing 2024年第3期22卷 2326-2337页

作者： Yang Liu Debiao He Min Luo Lianhai Wang Cong Peng School of Cyber Science and Engineering Wuhan University Wuhan China Institute of Information Technology Shenzhen Institute of Information Technology Shenzhen China 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 Shanghai Technology Innovation Centre of Distributed Privacy-Preserving Artificial Intelligence Matrix Elements Technologies Shanghai China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

The e-vote is regarded as a way to express the opinion that the voters ask for. Actually, the e-vote could be applied wildly like questionnaire, survey and feedback. Moreover, the coexistences of efficiency and security as well as transparency and privacy could be considered as building blocks in the e-vote system. The blockchain could provide a public access board to reduce the storage costs for the field consisted of the vote group manager (GM) with its vote assistants (VA). Particularly the $k$ -times anonymous authentication ( $k$ -TAA) could also be a practical approach to preserve voters’ privacy and reduce the computation costs during the vote process. However, the e-vote scheme with pure $k$ -TAA strategy could damage either the supervision of voting or the efficiency and consistency of authentication process. What’s more, the impacts of dishonest voters couldn’t be stopped until the vote end. To tackle these problems, we apply the accumulator technology to add or revoke the voters at any time and extend the framework of $k$ -TAA with the update process for the e-vote on blockchain for supervision ( $ k$ -TEVS). In our scheme, the voter updates his membership witness and proves the fact that he is still a valid member with respective VA under the latest accumulator value. What’s more, this witness update operation is not contained in the authentication process, which means that the authentication process is still constant and efficient. Moreover, our add or delete update process with signature of knowledge needs only one pairing operation. For the security, we prove that the relaxed anonymity still holds in the $ k$ -TEVS framework. Finally, We implement $ k$ -TEVS scheme, the Emura’s work [1] and the Huang’s work [2] for comparison. Then we make time cost and communication cost experiments, which present the feasibility and practicality of this scheme.

关键词： Blockchains Authentication Costs Protocols Security Privacy Surveys Electronic voting computer science Information security

来源：评论

学校读者我要写书评

暂无评论

Scalar optical hopfions

引用

eLight 2022年第1期2卷 284-290页

作者： Chenhao Wan Yijie Shen Andy Chong Qiwen Zhan School of Optical‑Electrical and Computer Engineering University of Shanghai for Science and TechnologyShanghai 200093China School of Optical and Electronic Information and Wuhan National Laboratory for Optoelectronics Huazhong University of Science and TechnologyWuhan 430074HubeiChina Optoelectronics Research Centre University of SouthamptonSouthampton SO171BJUK Department of Physics Pusan National UniversityGeumjeong‑GuBusan 46241South Korea Zhangjiang Laboratory 100 Haike RoadShanghai 201204China Shanghai Key Lab of Modern Optical System University of Shanghai for Science and TechnologyShanghai 200093China

Hopfions are three-dimensional(3D)topological states discovered in field theory,magnetics,and hydrodynamics that resemble particle-like objects in physical *** inherit the topological features of the Hopf fibration,a homotopic mapping from unit sphere in 4D space to unit sphere in 3D *** we design and demonstrate dynamic scalar optical hopfions in the shape of a toroidal vortex and expressed as an approximate solution to Maxwell’s *** lines correspond to disjoint and interlinked loops forming complete ring tori in 3D *** Hopf invariant,product of two winding numbers,is determined by the topological charge of the poloidal spatiotemporal vortices and toroidal spatial vortices in toroidal *** hopfions provide a photonic testbed for studying topological states and may be utilized as high-dimensional information carriers.

关键词： Hopfion Toroidal vortex Spatiotemporal vortex Wave packet Topology Topological charge

来源：评论

学校读者我要写书评

暂无评论

BA-Audit: Blockchain-Based Public Auditing for Aggregated Data Sharing in Edge-Assisted IoT 1

引用

4th EAI International Conference on Security and Privacy in New computing Environments, SPNCE 2021

作者： Liu, Mingxi Lu, Ning Yin, Jingli Cheng, Qingfeng Shi, Wenbo School of Computer Science and Engineering Northeastern University Shenyang China School of Computer Science and Technology Xidian University Xi’an China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Strategic Support Force Information Engineering University Zhengzhou China

ISBN: (数字)9783030967918

ISBN: (纸本)9783030967901

With the massive placement of sensors leading to a surge in IoT data, it is wise for system administrators to use data aggregation strategies to collect and share data in edge-assisted IoT scenarios because traditional methods will exhaust bandwidth resources. Users need to verify the integrity of aggregated data to ensure security sharing. However, existing data auditing technologies are disabled because aggregate data has no metadata. This paper proposes a blockchain-based auditing scheme for aggregated data to achieve efficient and secure data sharing. First, we design a hash index balanced tree (HIBT) to reduce the computational expense of signature retrieval. Then, we propose an audit protocol to protect aggregated data immutability. Also, we provide security and performance analysis at the end of the paper. © 2022, ICST Institute for computer sciences, Social Informatics and Telecommunications Engineering.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Coordination of networking and computing: toward new information infrastructure and new services mode

引用

Frontiers of Information technology & Electronic Engineering 2024年第5期25卷 629-632页

作者： Xiaoyun WANG Tao SUN Yong CUI Rajkumar BUYYA Deke GUO Qun HUANG Hassnaa MOUSTAFA Chen TIAN Shangguang WANG China Mobile Communications Corporation Beijing 100032China China Mobile Research Institute Beijing 100053China Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China CLOUDS Lab School of Computing and Information SystemsUniversity of MelbourneMelbourneVIC 3010Australia National Key Laboratory of Information Systems Engineering National University of Defense TechnologyChangsha 410073China School of Computer Science Peking UniversityBeijing 100871China Intel Corporation Santa ClaraCA 95054USA State Key Laboratory for Novel Sofiware Technology Nanjing UniversityNanjing 210023China State Key Laboratory of Networking and Switching Technology Bejing University of Posts and TelecommunicationsBeijing 100876China

computing,serving as the cornerstone of information processing,plays a pivotal role in the digital service ***"network"and"computing,"responsible for information transmission and processing respectively,traditionally belong to different stakeholders and have evolved ***,the recent trend toward the coordination and integration of computing and networks has garnered significant attention from both industry and *** such as"computility network"and"computing force network"have emerged,and the International Telecommunication Union-Telecommunication Standardization(ITU-T)has initiated efforts to develop standards for the coordination of networking and computing(CNC),focusing on the architecture and framework.

关键词： computing services network

来源：评论

学校读者我要写书评

暂无评论

Scavenger: Better Space-Time Trade-Offs for Key-Value Separated LSM-trees

Scavenger: Better Space-Time Trade-Offs for Key-Value Separa...

引用

International Conference on Data Engineering

作者： Jianshun Zhang Fang Wang Sheng Qiu Yi Wang Jiaxin Ou Junxun Huang Baoquan Li Peng Fang Dan Feng Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of data storage systems and Technology Ministry of Education of China School of Computer Science and Technology Huazhong University of Science and Technology China Shenzhen Huazhong University of Science and Technology Research Institute Bytefrance Inc.

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Key- Value Stores (KVS) implemented with log- structured merge-tree (LSM-tree) have gained widespread ac-ceptance in storage systems. Nonetheless, a significant challenge arises in the form of high write amplification due to the compaction process. While KV-separated LSM-trees successfully tackle this issue, they also bring about substantial space am-plification problems, a concern that cannot be overlooked in cost-sensitive scenarios. Garbage collection (GC) holds significant promise for space amplification reduction, yet existing GC strategies often fall short in optimization performance, lacking thorough consideration of workload characteristics. Additionally, current KV-separated LSM-trees also ignore the adverse effect of the space amplification in the index LSM-tree. In this paper, we systematically analyze the sources of space amplification of KV- separated LSM-trees and introduce Scavenger, which achieves a better trade-off between performance and space amplification. Scavenger initially proposes an I/O-efficient garbage collection scheme to reduce I/O overhead and incorporates a space-aware compaction strategy based on compensated size to minimize the space amplification of index LSM-trees. Extensive experiments show that Scavenger significantly improves write performance and achieves lower space amplification than other KV-separated LSM-trees (including BlobDB, Titan, and TerarkDB).

关键词： Data engineering Compaction Indexes Optimization

来源：评论

学校读者我要写书评

暂无评论

EPL: Empirical Prototype Learning for Deep Face Recognition

arXiv

引用

arXiv 2024年

作者： Fan, Weijia Wen, Jiajun Jia, Xi Shen, Linlin Zhou, Jiancan Li, Qiufu National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Computer Vision Institute Shenzhen University Shenzhen518060 China School of Computer Science University of Birmingham Birmingham United Kingdom Aqara Lumi United Technology Coopration Shenzhen China

Prototype learning is widely used in face recognition, which takes the row vectors of coefficient matrix in the last linear layer of the feature extraction model as the prototypes for each class. When the prototypes are updated using the facial sample feature gradients in the model training, they are prone to being pulled away from the class center by the hard samples, resulting in decreased overall model performance. In this paper, we explicitly define prototypes as the expectations of sample features in each class and design the empirical prototypes using the existing samples in the dataset. We then devise a strategy to adaptively update these empirical prototypes during the model training based on the similarity between the sample features and the empirical prototypes. Furthermore, we propose an empirical prototype learning (EPL) method, which utilizes an adaptive margin parameter with respect to sample features. EPL assigns larger margins to the normal samples and smaller margins to the hard samples, allowing the learned empirical prototypes to better reflect the class center dominated by the normal samples and finally pull the hard samples towards the empirical prototypes through the learning. The extensive experiments on MFR, IJB-C, LFW, CFP-FP, AgeDB, and MegaFace demonstrate the effectiveness of EPL. Our code is available at https://***/WakingHours-GitHub/EPL. © 2024, CC BY.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-Efficient Two-Server ORAMs with O(1) Client Storage

arXiv

引用

arXiv 2025年

作者： Wang, Wei Zhang, Xianglong Xu, Peng Chen, Rongmao Yang, Laurence Tianruo School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Hubei Key Laboratory of Distributed System Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Jinyinhu Laboratory Wuhan430040 China School of Computer National University of Defense Technology Changsha410073 China School of Computer and Artificial Intelligence Zhengzhou University Zhengzhou450001 China Department of Computer Science St. Francis Xavier University AntigonishNSB2G 2W5 Canada

Oblivious RAM (ORAM) allows a client to securely retrieve elements from outsourced servers without leakage about the accessed elements or their virtual addresses. Two-server ORAM, designed for secure two-party RAM computation, stores data across two non-colluding servers. However, many two-server ORAM schemes suffer from excessive local storage or high bandwidth costs. To serve lightweight clients, it is crucial for ORAM to achieve concretely efficient bandwidth while maintaining O(1) local storage. Hence, this paper presents two new client-friendly two-server ORAM schemes that achieve practical logarithmic bandwidth under O(1) local storage, while incurring linear symmetric key computations. The core design features a hierarchical structure and a pairwise-area setting for the elements and their tags. Accordingly, we specify efficient read-only and write-only private information retrieval (PIR) algorithms in our schemes to ensure obliviousness in accessing two areas respectively, so as to avoid the necessity of costly shuffle techniques in previous works. We empirically evaluate our schemes against LO13 (TCC’13), AFN17 (PKC’17), and KM19 (PKC’19) in terms of both bandwidth and time cost. The results demonstrate that our schemes reduce bandwidth by approximately 2 ∼ 4× compared to LO13, and by 16 ∼ 64× compared to AFN17 and KM19. For a database of size 214 blocks, our schemes are over 64× faster than KM19, while achieving similar performance to LO13 and AFN17 in the WAN setting, with a latency of around 1 second. Copyright © 2025, The Authors. All rights reserved.

关键词： Virtual addresses

来源：评论

学校读者我要写书评

暂无评论

On the Outage of Far-Reach Communications via RIS-Empowered Satellites

On the Outage of Far-Reach Communications via RIS-Empowered ...

引用

IEEE Pacific Rim Conference on Communications, computers and Signal Processing

作者： Fan Wang Ruihong Jiang Yuan Liu Tingnan Bao Mugen Peng State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Zhejiang Laboratory Research Center for Space Computing System Hangzhou China School of Electrical Engineering and Computer Science University of Ottawa Ottawa ON Canada

ISBN: (数字)9798350362312

ISBN: (纸本)9798350362329

The rising demand for reliable, high-bandwidth satellite communications in far-reach areas drives the integration of low earth orbit (LEO) satellites into future 6G networks. In this paper, we investigate the deployment of reconfigurable intelligent surface (RIS) technology and rate splitting multiple access (RSMA) within LEO satellite systems to improve communication quality and system capacity. We derive closed-form expressions for outage probability (OP) and reliable throughput that validate the theoretical advantages of these technologies under various signal-to-noise ratio conditions. Numerical results demonstrate that, compared with traditional space division multiple access (SDMA) and non-orthogonal multiple access (NOMA) approaches, our RSMA and RIS-integrated framework significantly can reduce OP and enhance reliable throughput with an appropriate power-splitting factor, showcasing its superiority in RIS-enabled satellite communication scenarios.

关键词： NOMA Satellites Closed-form solutions computer network reliability Low earth orbit satellites Reconfigurable intelligent surfaces Reliability theory Throughput Multiaccess communication Satellite communications

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：