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

arXiv 2022年

作者： Liu, Qiqi Yan, Yuping Ligeti, Péter Jin, Yaochu Trustworthy and General AI Lab School of Engineering Westlake University China Faculty of Technology Bielefeld University Bielefeld33619 Germany Faculty of Informatics Department of Computeralgebra Eötvös Loránd University Hungary Smart Data Group E-Group ICT Software Zrt Hungary Department of Computer Science University of Surrey Surrey GuildfordGU2 7XH United Kingdom

Data-driven evolutionary algorithms usually aim to exploit the information behind a limited amount of data to perform optimization, which have proved to be successful in solving many complex real-world optimization problems. However, most data-driven evolutionary algorithms are centralized, causing privacy and security concerns. Existing federated Bayesian optimization algorithms and data-driven evolutionary algorithms mainly protect the raw data on each client. To address this issue, this paper proposes a secure federated data-driven evolutionary multiobjective optimization algorithm to protect both the raw data and the newly infilled solutions obtained by optimizing the acquisition function conducted on the server. We select the query points on a randomly selected client at each round of surrogate update by calculating the acquisition function values of the unobserved points on this client, thereby reducing the risk of leaking the information about the solution to be sampled. In addition, since the predicted objective values of each client may contain sensitive information, we mask the objective values with Diffie-Hellman-based noise, and then send only the masked objective values of other clients to the selected client via the server. Since the calculation of the acquisition function also requires both the predicted objective value and the uncertainty of the prediction, the predicted mean objective and uncertainty are normalized to reduce the influence of noise. Experimental results on a set of widely used multi-objective optimization benchmarks show that the proposed algorithm can protect privacy and enhance security with only negligible sacrifice in the performance of federated data-driven evolutionary optimization. Copyright © 2022, The Authors. All rights reserved.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Deep Learning in Smart Healthcare: A GAN-based Approach for Imbalanced Alzheimer's Disease Classification

引用

Procedia computer science 2024年 241卷 146-153页

作者： Hina Tufail Abdul Ahad Ira Puspitasari Ibraheem Shayea Paulo Jorge Coelho Ivan Miguel Pires Department of Computer Science University of Management and Technology Sialkot Pakistan Information System Study Program Faculty of Science and Technology Universitas Airlangga School of Software Northwestern Polytechnical University Xian Shaanxi P.R. China Department of Electronics and Communication Engineering Istanbul Technical University(ITU) Turkey Polytechnic University of Leiria Leiria Portugal Institute for Systems Engineering and Computers at Coimbra (INESC Coimbra) Coimbra Portugal Instituto de Telecomunicações Escola Superior de Tecnologia e Gestão de Águeda Universidade de Aveiro Águeda Portugal

Alzheimer's disease (AD) is a type of dementia that leads to memory loss and impairment, which afects patients’ lives badly. It is not curable yet, but its progression can be slowed down if detected at earlier stages. In this research study, we propose a transfer learning-based convolutional neural network (CNN) model to classify magnetic resonance imaging (MRI) into one of four stages of Alzheimer's disease. One of the major limitations of the deep learning-based classification model is the non-availability of healthcare datasets related to AD. The widely used Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset has a major class imbalance issue. We propose a generative adversarial network (GAN) based data augmentation technique to overcome the data imbalance. This promotes the investigation of applying GANs to generate synthetic samples for minority classes in Alzheimer's disease datasets to enhance classification performance. The results show the progression in the overall classification process of AD.

关键词： Alzheimer disease (AD) Deep learning Convolutional Neural Network (CNN) computer-aided diagnosis (CAD)

来源：评论

学校读者我要写书评

暂无评论

Influence of Network Speed on Structured Query Language (SQL) Database Data Transmission Performance in an Internet of Things (IoT) Sensing Device on Single Board computers (SBC)

引用

IOP Conference Series: Materials science and engineering 2019年第1期551卷

作者： A Nor Azhar S Nur Ayuni Hasna AH Roslina Z Fauziah M Rahmah Department of Computer Science Department of Computer Systems & Networking Department of Software Engineering Department of Graphic & Multimedia Technology Faculty of Computer Systems & Software Engineering Universiti Malaysia Pahang Lebuhraya Tun Razak Gambang 26300 Kuantan Pahang Malaysia

One of the crucial elements in an Internet of Things (IoT) environment is a database. IoT performance will be at stake if the wrong database is adopted. In this research, three Structured Query Language (SQL) databases were tested against multiple network speeds in an IoT device. Single board computers (SBC) were used as a media of testing instead of an ordinary computer. A controlled wireless sensor network (WSN) was developed with several uniform constants and variable network speeds. A new data transmission rate equation also was proposed and tested. From the result, it was found that not all SQL databases can cater IoT devices. Some of them showed that performance decreased along with network speed. The correlation, between 0.90 and 0.96, proved the strong influence between the research subjects. In addition, file-type database is the best option available for SQL-wise IoT storage.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Unbiased feature selection in learning random forests for high-dimensional data

Scientific World Journal

引用

Scientific World Journal 2015年第1期2015卷 471371页

作者： Nguyen, Thanh-Tung Huang, Joshua Zhexue Nguyen, Thuy Thi Shenzhen Key Laboratory of High Performance Data Mining Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen 518055 China University of Chinese Academy of Sciences Beijing 100049 China School of Computer Science and Engineering Water Resources University Hanoi 10000 Viet Nam College of Computer Science and Software Engineering Shenzhen University Shenzhen 518060 China Faculty of Information Technology Vietnam National University of Agriculture Hanoi 10000 Viet Nam

Random forests (RFs) have been widely used as a powerful classification method. However, with the randomization in both bagging samples and feature selection, the trees in the forest tend to select uninformative features for node splitting. This makes RFs have poor accuracy when working with high-dimensional data. Besides that, RFs have bias in the feature selection process where multivalued features are favored. Aiming at debiasing feature selection in RFs, we propose a new RF algorithm, called xRF, to select good features in learning RFs for high-dimensional data. We first remove the uninformative features using p-value assessment, and the subset of unbiased features is then selected based on some statistical measures. This feature subset is then partitioned into two subsets. A feature weighting sampling technique is used to sample features from these two subsets for building trees. This approach enables one to generate more accurate trees, while allowing one to reduce dimensionality and the amount of data needed for learning RFs. An extensive set of experiments has been conducted on 47 high-dimensional real-world datasets including image datasets. The experimental results have shown that RFs with the proposed approach outperformed the existing random forests in increasing the accuracy and the AUC measures. © 2015 Thanh-Tung Nguyen et al.

关键词：

来源：评论

学校读者我要写书评

暂无评论

QoE-oriented Soft Caching with Content Recommendation for Edge Computing Networks

QoE-oriented Soft Caching with Content Recommendation for Ed...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Chenyang Wang Yan Chen Chuan Sun Bosen Jia Xiaofei Wang Tarik Taleb Victor C. M. Leung College of Computer Science & Software Engineering Shenzhen University Shenzhen China Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ) Shenzhen China Faculty of Electrical Engineering and Information Technology Ruhr University Bochum Bochum Germany College of Computing and Data Science Nanyang Technological University Singapore China Unicom Digital Technology Co. Ltd Beijing China College of Intelligence and Computing Tianjin University Tianjin China University of British Columbia Vancouver Canada

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

Mobile Edge Caching (MEC) can potentially alleviate Internet transmission congestion by delivering content at the network edge. However, current MEC solutions suffer from low resource utilization efficiency and often fail to meet user Quality of Experience (QoE), primarily due to dynamic user requests and obsessive pursuit of direct caching hits. Given the prevalence of recommendation systems, users often lack precise requests when using recommendation-based applications like TikTok and Taobao, insted passively enjoying recommended content. In this paper, we introduce a recommendation-enabled MEC architecture to enhance resource utilization and QoE. We develop a recommendation-enabled soft caching model and formulate the optimization problem as maximizing joint system revenue. To address this, we propose an attention-assisted federated learning deep Q-network algorithm. We conduct the simulations by using the real-world MIND dataset. The results demonstrate that our proposed algorithm outperforms existing baselines, demonstrating its effectiveness in improving resource utilization and QoE.

关键词： Video on demand Heuristic algorithms Computational modeling Internet Quality of experience Resource management Web sites Global communication Optimization Recommender systems

来源：评论

学校读者我要写书评

暂无评论

SOFSEM 2012: Theory and Practice of computer science 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Mária Bieliková Gerhard Friedrich Georg Gottlob Stefan Katzenbeisser György Turán

ISBN: (数字)9783642276606

ISBN: (纸本)9783642276590

This book constitutes the refereed proceedings of the 38th Conference on Current Trends in Theory and Practice of computer science, SOFSEM 2012, held in Špindlerův Mlýn, Czech Republic, in January 2012. The 43 revised papers presented in this volume were carefully reviewed and selected from 121 submissions. The book also contains 11 invited talks, 10 of which are in full-paper length. The contributions are organized in topical sections named: foundations of computer science; software and Web engineering; cryptography, security, and verification; and artificial intelligence.

关键词： Algorithm Analysis and Problem Complexity software engineering Data Storage Representation Discrete Mathematics in computer science computer Communication Networks Database Management

来源：评论

学校读者我要写书评

暂无评论

Heuristic Search for Nonlinear Substitutions for Cryptographic Applications

Lecture Notes on Data Engineering and Communications Technol...

引用

Lecture Notes on Data engineering and Communications Technologies 2023年 180卷 288-298页

作者： Kuznetsov, Oleksandr Frontoni, Emanuele Kandiy, Sergey Smirnov, Oleksii Ulianovska, Yuliia Kobylianska, Olena Department of Political Sciences Communication and International Relations University of Macerata Via Crescimbeni 30/32 Macerata62100 Italy Department of Information and Communication Systems Security Faculty of Comupter Science V. N. Karazin Kharkiv National University 4 Svobody Sq Kharkiv61022 Ukraine Department of Information Engineering Marche Polytechnic University Via Brecce Bianche 12 Ancona60131 Italy Cybersecurity & Software Academic Department Central Ukrainian National Technical University 8 University Avenue Kropyvnytskyi25006 Ukraine Department of Computer Science and Software Engineering University of Customs and Finance Vernadskogo Street 2/4 Dnipro49000 Ukraine

Heuristic algorithms are used to solve complex computational problems quickly in various computer applications. Such algorithms use heuristic functions that rank the search alternatives instead of a full enumeration of possible variants. The algorithm selects, at each iteration, an alternative with the best value for the heuristics. In this paper, we investigate the complex computational problem of finding highly nonlinear substitutions (S-boxes) in the space of 8-bit permutations. The generation of S-boxes is an important field of research, since nonlinear substitutions are widely used in various cryptographic applications. For instance, S-boxes in symmetric ciphers are responsible for cryptographic strength to linear, differential, algebraic, and other types of cryptanalysis. We propose new heuristics in the form of a cost function, calculated with the Walsh-Hadamard transform. We use the Hill Climbing Algorithm to find highly nonlinear substitutions. Our experiments demonstrate that the new heuristics give good results – it takes about 80,000 iterations of the algorithm to generate 8-bit S-boxes with a nonlinearity of 104. For the optimized parameters, the number of iterations of the algorithm is comparable to the best known results, which confirms the significance and value of the research. © The Author(s).

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Image-based Freeform Handwriting Authentication with Energy-oriented Self-Supervised Learning

arXiv

引用

arXiv 2024年

作者： Wang, Jingyao Mou, Luntian Zheng, Changwen Gao, Wen The University of Chinese Academy of Sciences Beijing100049 China The National Key Laboratory of Space Integrated Information System Institute of Software Chinese Academy of Sciences Beijing100086 China Beijing Institute of Artiicial Intelligence Faculty of Information Beijing University of Technology Beijing100124 China Beijing Key Laboratory of Multimedia and Intelligent Software Technology Beijing100124 China The School of Electronics Engineering and Computer Science Peking University Beijing100871 China

Freeform handwriting authentication verifies a person’s identity from their writing style and habits in messy handwriting data. This technique has gained widespread attention in recent years as a valuable tool for various fields, e.g., fraud prevention and cultural heritage protection. However, it still remains a challenging task in reality due to three reasons: (i) severe damage, (ii) complex high-dimensional features, and (iii) lack of supervision. To address these issues, we propose SherlockNet, an energy-oriented two-branch contrastive self-supervised learning framework for robust and fast freeform handwriting authentication. It consists of four stages: (i) pre-processing: converting manuscripts into energy distributions using a novel plug-and-play energy-oriented operator to eliminate the influence of noise;(ii) generalized pre-training: learning general representation through two-branch momentum-based adaptive contrastive learning with the energy distributions, which handles the high-dimensional features and spatial dependencies of handwriting;(iii) personalized fine-tuning: calibrating the learned knowledge using a small amount of labeled data from downstream tasks;and (iv) practical application: identifying individual handwriting from scrambled, missing, or forged data efficiently and conveniently. Considering the practicality, we construct EN-HA, a novel dataset that simulates data forgery and severe damage in real applications. Finally, we conduct extensive experiments on six benchmark datasets including our EN-HA, and the results prove the robustness and efficiency of SherlockNet. We will release our code and dataset at https://***/WangJingyao07/SherlockNet. Copyright © 2024, The Authors. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence-based Service Chains Scheduling for Medical Emergency in Healthcare

Artificial Intelligence-based Service Chains Scheduling for ...

引用

International Conference on Contemporary Computing and Informatics (IC3I)

作者： Mukesh Soni Maher Ali Rusho Haewon Byeon Azzah AlGhamdi Shaikh Abdul Hannan Parth Rameshchandra Dave Dr. D. Y. Patil Vidyapeeth Dr. D. Y. Patil School of Science & Technology Tathawade Pune Marashtra Department of Lockheed Martin Engineering Management University of Colorado Boulder Colorado Department of AI and Software & Medical Big Data Research Centre Inje University Gimhae Republic of Korea Computer Information Systems Department College of Computer Science and Information Technology Imam Abdalrhman Bin Faisal University Khobar Saudi Arabia Faculty of Computing and Information AlBaha University AlBaha Kingdom of Saudi Arabia Department of Computer Engineering L. D. College of Engineering Ahmedabad Gujarat India

ISBN: (数字)9798350350067

ISBN: (纸本)9798350350074

This study analyses the weekly scheduling challenge of health and medical information network service function chains to meet medical emergency categorization and grading needs. Emergency services are divided into four sorts by urgency and service area, with priorities and weights. The health and medical information network architecture, service model, and operation method are built accordingly. To reduce weighted completion time, a service function chain scheduling model is created. The function chain scheduling scheme is solved by matching game and Q -learning reinforcement learning algorithms for different issue scales. Finally, simulation studies demonstrate that this approach can accomplish graded medical emergency service, build health and medical information networks, and progress smart healthcare.

关键词： Schedules Job shop scheduling Service function chaining Hospitals Processor scheduling Reinforcement learning Games Emergency services Network function virtualization Standards

来源：评论

学校读者我要写书评

暂无评论

Analysis of oxygen saturation detection method on intelligent mobile devices

引用

Ruan Jian Xue Bao/Journal of software 2015年 26卷 165-176页

作者： Chen, Yi-Neng Deng, Xiao-Ming He, Yue Lu, Lu Tian, Feng Wang, Feng Dai, Guo-Zhong Wang, Hong-An Beijing Key Laboratory of Human-Computer Interaction nstitute of Software The Chinese Academy of Sciences Beijing100190 China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing100049 China Faculty of Information Engineering and Automation Kunming University of Science and Technology Kunming650093 China

With the fast development of mobile devices and great concern on health surveillance, it is becoming increasingly popular to collect, analyze, and interpret people's health-related data by using intelligent mobile devices in their daily life. Oxygen saturation is an important physiological parameter referring to the concentration of oxygen in the blood, and prolonged low oxygen levels may lead to respiratory or cardiac arrest. Previous oxygen saturation detection methods require infrared light, however most of the off-the-shelf mobile devices lack such infrared light transmitter and receiver modules. This paper presents a novel oxygen saturation estimation method emplying a RGB camera and visible light in most of mobile devices. By applying of traditional optical oxygen saturation estimation model to mobile devices, and analyzing its problem for those devices, this study proposes a new oxygen saturation estimation model on intelligent mobile devices and offers an approach to solve the baseline drift problem in mobile cameras. Experiments demonstrate the effectiveness of the proposed method and its potentials in many oxygen saturation based researches such as daily-activity based healthcare with mobile devices. © Copyright 2015, Institute of software, the Chinese Academy of sciences. All rights reserved.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：