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

arXiv 2024年

作者： Chen, Tianyang Xu, Peng Picek, Stjepan Luo, Bo Susilo, Willy Jin, Hai Liang, Kaitai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering China Cluster and Grid Computing Lab School of Computer Science and Technology China Huazhong University of Science and Technology Wuhan430074 China Digital Security Group Radboud University Nijmegen Netherlands Department of EECS Institute of Information Sciences The University of Kansas LawrenceKS United States Institute of Cybersecurity and Cryptology School of Computing and Information Technology University of Wollongong WollongongNSW2522 Australia Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft2628 CD Netherlands

Dynamic searchable symmetric encryption (DSSE) enables users to delegate the keyword search over dynamically updated encrypted databases to an honest-but-curious server without losing keyword privacy. This paper studies a new and practical security risk to DSSE, namely, secret key compromise (e.g., a user’s secret key is leaked or stolen), which threatens all the security guarantees offered by existing DSSE schemes. To address this open problem, we introduce the notion of searchable encryption with key-update (SEKU) that provides users with the option of non-interactive key updates. We further define the notion of post-compromise secure with respect to leakage functions to study whether DSSE schemes can still provide data security after the client’s secret key is compromised. We demonstrate that post-compromise security is achievable with a proposed protocol called "Bamboo". Interestingly, the leakage functions of Bamboo satisfy the requirements for both forward and backward security. We conduct a performance evaluation of Bamboo using a real-world dataset and compare its runtime efficiency with the existing forward-and-backward secure DSSE schemes. The result shows that Bamboo provides strong security with better or comparable performance. © 2024, CC BY.

关键词： Bamboo

来源：评论

学校读者我要写书评

暂无评论

Delayed Memory Unit: Modelling Temporal Dependency Through Delay Gate

arXiv

引用

arXiv 2023年

作者： Sun, Pengfei Wu, Jibin Zhang, Malu Devos, Paul Botteldooren, Dick Department of Information Technology WAVES Research Group Ghent University Technologiepark Zwijnaarde 126 Ghent9052 Belgium Department of Data Science and Artificial Intelligence The Department of Computing The Hong Kong Polytechnic University Hong Kong School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu610054 China

Recurrent Neural Networks (RNNs) are widely recognized for their proficiency in modeling temporal dependencies, making them highly prevalent in sequential data processing applications. Nevertheless, vanilla RNNs are confronted with the well-known issue of gradient vanishing and exploding, posing a significant challenge for learning and establishing long-range dependencies. Additionally, gated RNNs tend to be over-parameterized, resulting in poor computational efficiency and network generalization. To address these challenges, this paper proposes a novel Delayed Memory Unit (DMU). The DMU incorporates a delay line structure along with delay gates into vanilla RNN, thereby enhancing temporal interaction and facilitating temporal credit assignment. Specifically, the DMU is designed to directly distribute the input information to the optimal time instant in the future, rather than aggregating and redistributing it over time through intricate network dynamics. Our proposed DMU demonstrates superior temporal modeling capabilities across a broad range of sequential modeling tasks, utilizing considerably fewer parameters than other state-of-the-art gated RNN models in applications such as speech recognition, radar gesture recognition, ECG waveform segmentation, and permuted sequential image classification. Copyright © 2023, The Authors. All rights reserved.

关键词： Gesture recognition

来源：评论

学校读者我要写书评

暂无评论

Sequential Modeling for Automatic Interpretation of Pressure Transient Test 9

Sequential Modeling for Automatic Interpretation of Pressure...

引用

9th IEEE International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions), ICRITO 2021

作者： Pandey, Rakesh Kumar Kumar, Anil Ganju, Rahul DIT University Department of Petroleum and Energy Studies Dehradun248009 India School of Computing DIT University Data Science Research Group Dehradun248009 India DIT University Department of Petroleum and Energy Studies Dehradun248009 India

ISBN: (纸本)9781665417037

Reservoir characterization is a crucial step in developing the oil and gas fields. In this research, a new technique has been demonstrated for analyzing pressure transient tests conducted in oil wells using deep learning. The pressure data recorded at varying time periods from well sites are provided in the prediction model for characterizing the reservoir. The proposed model allows automatic interpretation of homogeneous reservoirs with circular drainage area supported by active aquifers. The constant rate pressure drawdown tests have been simulated using the available analytical model for wells with well-bore storage and formation damage. The noise was added to simulated data to replicate the real-time environment during training of the model. The model showcases significantly high-performance accuracy in automatically characterizing the reservoir. © 2021 IEEE.

关键词： Analytical models

来源：评论

学校读者我要写书评

暂无评论

Optimizing Ethanol Production in Escherichia Coli Using a Hybrid of Particle Swarm Optimization and Artificial Bee Colony 22

Optimizing Ethanol Production in Escherichia Coli Using a Hy...

引用

Proceedings of the 6th International Conference on Advances in Artificial Intelligence

作者： Mohamad Faiz Dzulkalnine Mohd Saberi Mohamad Yee Wen Choon Muhammad Akmal Remli Hany Alashwal Artificial Intelligence and Bioinformatics Research Group Faculty of Computing Universiti Teknologi Malaysia Malaysia Health Data Science Lab Department of Genetics and Genomics College of Medical and Health Sciences United Arab Emirates University UAE and Big Data Analytics Center United Arab Emirates University UAE Institute for Artificial Intelligence and Big Data Universiti Malaysia Kelantan Malaysia and Department of Data Science Universiti Malaysia Kelantan Malaysia Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University UAE and Big Data Analytics Center United Arab Emirates University UAE

ISBN: (纸本)9781450396943

Metabolic engineering for biomass production using microorganisms’ cell has received considerable attention in recent years. This is due to the biomass products being extensively used in the field of food additives, supplements, pharmaceuticals, and polymer materials. In this paper, ethanol production in Escherichia coli (E. coli) is the desired product. Sugarcane and corn are often used to produce ethanol. However, one of the problems to produce adequate amounts of ethanol is that large areas are needed to plant sugarcane and corn. Furthermore, the amount of time for the process of dry milling and wet milling is high, which are 40 to 50 hours and 24 to 48 hours, respectively. The wet laboratory is also having limitation on the production of ethanol in microorganisms because the amount of the ethanol produced is not satisfying. Hence, a lot of metabolic engineering techniques is introduced to enhance the production of ethanol in E. coli, such as gene knockout strategy, but the production is yet to meet the demand. Therefore, this paper proposes a hybrid algorithm of Particle Swarm Optimization with the Artificial Bee Colony algorithm (PSOABC) to identify the optimal set of gene knockout strategy to improve the ethanol production in E. coli. A list of genes to knockout, production of the desired product, and growth rate are presented in this paper. PSOABC has shown better performance in terms of production, growth rate and accuracy.

关键词： Gene Knockouts Particle Swarm Optimization Artificial Bee Colony Ethanol Flux Balance Analysis

来源：评论

学校读者我要写书评

暂无评论

Fast Heterogeneous Federated Learning with Hybrid Client Selection

arXiv

引用

arXiv 2022年

作者： Shen, Guangyuan Gao, Dehong Song, Duanxiao Yang, Libin Zhou, Xukai Pan, Shirui Lou, Wei Zhou, Fang Department of Cyber Science and Technology Northwestern Polytechnical University China Alibaba Group China Department of Data Science and AI Faculty of IT Monash University Australia Department of Computing The Hong Kong Polytechnic University Hong Kong

Client selection schemes are widely adopted to handle the communication-efficient problems in recent studies of Federated Learning (FL). However, the large variance of the model updates aggregated from the randomly-selected unrepresentative subsets directly slows the FL convergence. We present a novel clustering-based client selection scheme to accelerate the FL convergence by variance reduction. Simple yet effective schemes are designed to improve the clustering effect and control the effect fluctuation, therefore, generating the client subset with certain representativeness of sampling. Theoretically, we demonstrate the improvement of the proposed scheme in variance reduction. We also present the tighter convergence guarantee of the proposed method thanks to the variance reduction. Experimental results confirm the exceed efficiency of our scheme compared to alternatives. Copyright © 2022, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Variance-Reduced Heterogeneous Federated Learning via Stratified Client Selection

arXiv

引用

arXiv 2022年

作者： Shen, Guangyuan Gao, Dehong Yang, Libin Zhou, Fang Song, Duanxiao Lou, Wei Pan, Shirui Department of Cyber Science and Technology Northwestern Polytechnical University China Alibaba Group China Department of Computing The Hong Kong Polytechnic University Hong Kong Department of Data Science and AI Faculty of IT Monash University Australia

Client selection strategies are widely adopted to handle the communication-efficient problem in recent studies of Federated Learning (FL). However, due to the large variance of the selected subset's update, prior selection approaches with a limited sampling ratio cannot perform well on convergence and accuracy in heterogeneous FL. To address this problem, in this paper, we propose a novel stratified client selection scheme to reduce the variance for the pursuit of better convergence and higher accuracy. Specifically, to mitigate the impact of heterogeneity, we develop stratification based on clients' local data distribution to derive approximate homogeneous strata for better selection in each stratum. Concentrating on a limited sampling ratio scenario, we next present an optimized sample size allocation scheme by considering the diversity of stratum's variability, with the promise of further variance reduction. Theoretically, we elaborate the explicit relation among different selection schemes with regard to variance, under heterogeneous settings, we demonstrate the effectiveness of our selection scheme. Experimental results confirm that our approach not only allows for better performance relative to state-of-the-art methods but also is compatible with prevalent FL algorithms. © 2022, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ChatKBQA: A Generate-then-Retrieve Framework for Knowledge Base Question Answering with Fine-tuned Large Language Models

arXiv

引用

arXiv 2023年

作者： Luo, Haoran Haihong, E. Tang, Zichen Peng, Shiyao Guo, Yikai Zhang, Wentai Ma, Chenghao Dong, Guanting Song, Meina Lin, Wei Zhu, Yifan Tuan, Luu Anh School of Computer Science Beijing University of Posts and Telecommunications China School of Artificial Intelligence Beijing University of Posts and Telecommunications China Beijing Institute of Computer Technology and Application China Inspur Group Co. Ltd. China College of Computing and Data Science Nanyang Technological University Singapore

Knowledge Base Question Answering (KBQA) aims to answer natural language questions over large-scale knowledge bases (KBs), which can be summarized into two crucial steps: knowledge retrieval and semantic parsing. However, three core challenges remain: inefficient knowledge retrieval, mistakes of retrieval adversely impacting semantic parsing, and the complexity of previous KBQA methods. To tackle these challenges, we introduce ChatKBQA, a novel and simple generate-then-retrieve KBQA framework, which proposes first generating the logical form with fine-tuned LLMs, then retrieving and replacing entities and relations with an unsupervised retrieval method, to improve both generation and retrieval more directly. Experimental results show that ChatKBQA achieves new state-of-the-art performance on standard KBQA datasets, WebQSP, and CWQ. This work can also be regarded as a new paradigm for combining LLMs with knowledge graphs (KGs) for interpretable and knowledge-required question answering. Our code is publicly available. © 2023, CC BY-NC-SA.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

Embarrassingly Simple Scribble Supervision for 3D Medical Segmentation

arXiv

引用

arXiv 2024年

作者： Gotkowski, Karol Lüth, Carsten Jäger, Paul F. Ziegler, Sebastian Krämer, Lars Denner, Stefan Xiao, Shuhan Disch, Nico Maier-Hein, Klaus H. Isensee, Fabian Division of Medical Image Computing DKFZ Heidelberg Germany Helmholtz Imaging DKFZ Heidelberg Germany Interactive Machine Learning Group DKFZ Heidelberg Germany Medical Faculty Heidelberg University of Heidelberg Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Germany HIDSS4Health - Helmholtz Information and Data Science School for Health Germany

Traditionally, segmentation algorithms require dense annotations for training, demanding significant annotation efforts, particularly within the 3D medical imaging field. Scribble-supervised learning emerges as a possible solution to this challenge, promising a reduction in annotation efforts when creating large-scale datasets. Recently, a plethora of methods for optimized learning from scribbles have been proposed, but have so far failed to position scribble annotation as a beneficial alternative. We relate this shortcoming to two major issues: 1) the complex nature of many methods which deeply ties them to the underlying segmentation model, thus preventing a migration to more powerful state-of-the-art models as the field progresses and 2) the lack of a systematic evaluation to validate consistent performance across the broader medical domain, resulting in a lack of trust when applying these methods to new segmentation problems. To address these issues, we propose a comprehensive scribble supervision benchmark consisting of seven datasets covering a diverse set of anatomies and pathologies imaged with varying modalities. We furthermore propose the systematic use of partial losses, i.e. losses that are only computed on annotated voxels. Contrary to most existing methods, these losses can be seamlessly integrated into state-of-the-art segmentation methods, enabling them to learn from scribble annotations while preserving their original loss formulations. Our evaluation using nnU-Net reveals that while most existing methods suffer from a lack of generalization, the proposed approach consistently delivers state-of-the-art performance. Thanks to its simplicity, our approach presents an embarrassingly simple yet effective solution to the challenges of scribble supervision. Source code as well as our extensive scribble benchmarking suite will be made publicly available upon publication. © 2024, CC BY.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

Parallel Image Encryption Algorithm Using Partitioned Cellular Automata on Graphic Processor Unit

Parallel Image Encryption Algorithm Using Partitioned Cellul...

引用

Omni-layer Intelligent Systems (COINS), International Conference on

作者： Mahmood Fazlali Amirhossein Alihoseini Ebrahim Zarei Myasar Tabani Seyedali Pourmoafi Cybersecurity and Computing Systems Research Group University of Hertfordshire Hatfiled UK Dept. of data and Computer Sciensce Faculty of Mathematical sciences Shahid Beheshti University Tehran Iran Dep. of Computer Science Khansar Campus University Of Isfahan Isfahan Iran

Image encryption is a reliable method for securely transmitting images over a network. The time required to encrypt and decrypt an image in online applications is also very important. Although cellular automata cryptography is an appropriate technique for parallelizing and accelerating cryptographic methods, its capacity cannot be demonstrated only in multi-core platforms. Thus, it is needed to parallelize cellular automata cryptography on Graphic Processor Units (GPUs) in order to significantly decrease the encryption/decryption time. In this paper, we propose a new parallel algorithm for two-dimensional cellular automata cryptography that is implemented on GPU. The proposed algorithm uses multiple threads at once to accelerate the bit-level permutation and substitution operations by taking into account the capacity of cellular automata in parallel processing. According to the study experimental findings, the proposed algorithm performs faster on GPU compared to a multicore platform while maintaining the same level of security in comparison to the serial algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Collecting the Public Perception of AI and Robot Rights

Collecting the Public Perception of AI and Robot Rights

引用

Proceedings of the ACM on Human-Computer Interaction

作者： Lima, Gabriel Kim, Changyeon Ryu, Seungho Jeon, Chihyung Cha, Meeyoung School of Computing Kaist Data Science Group Ibs Daejeon Korea Republic of School of Computing Kaist Daejeon Korea Republic of Dept. of Computer Science Dept. of Mathematics Hkust Hong Kong SAR Hong Kong Graduate School of Science and Technology Policy Kaist Daejeon Korea Republic of Data Science Group Ibs School of Computing Kaist Daejeon Korea Republic of

Whether to give rights to artificial intelligence (AI) and robots has been a sensitive topic since the European Parliament proposed advanced robots could be granted "electronic personalities."Numerous scholars who favor or disfavor its feasibility have participated in the debate. This paper presents an experiment (N=1270) that 1) collects online users' first impressions of 11 possible rights that could be granted to autonomous electronic agents of the future and 2) examines whether debunking common misconceptions on the proposal modifies one's stance toward the issue. The results indicate that even though online users mainly disfavor AI and robot rights, they are supportive of protecting electronic agents from cruelty (i.e., favor the right against cruel treatment). Furthermore, people's perceptions became more positive when given information about rights-bearing non-human entities or myth-refuting statements. The style used to introduce AI and robot rights significantly affected how the participants perceived the proposal, similar to the way metaphors function in creating laws. For robustness, we repeated the experiment over a more representative sample of U.S. residents (N=164) and found that perceptions gathered from online users and those by the general population are similar. © 2020 ACM.

关键词： Artificial intelligence Autonomous agents Intelligent agents Robots Autonomous electronics Electronic agents European Parliament First impressions General population Online users Public perception Representative sample

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：