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

Correntropy-Based Data Selective Adaptive Filtering

IEEE Transactions on Circuits and systems I: Regular Papers 2024年第2期71卷 754-766页

作者： Chien, Ying-Ren Wu, Sheng-Teng Tsao, Hen-Wai Diniz, Paulo S.R. Adaptive and Autonomous Communication Laboratory Department of Electrical Engineering National Ilan University Yilan City260007 Taiwan College of Electrical Engineering and Computer Science Graduate Institute of Communication Engineering National Taiwan University Taipei10617 Taiwan Program of Electrical Engineering Department of Electronics and Computer Engineering COPPE/Poli Universidade Federal do Rio de Janeiro Rio de Janeiro68504 Brazil

Data selection can be used in conjunction with adaptive filtering algorithms to avoid unnecessary weight updating and thereby reduce computational overhead. This paper presents a novel correntropy-based data selection method as an alternative to conventional data selection mechanisms based on squared error values. We developed a variable correntropy sensing algorithm to maximize the instantaneous correntropy function for the Gaussian kernel function to mitigate the impact of impulse noise and other forms of noise that can be disregarded in data selection. The proposed data selection mechanism can be implemented with any adaptive filtering algorithm. In simulations, the proposed method (implemented with the least mean squared algorithm) outperformed comparable error-based data selection schemes in terms of hit rate and miss rate, and the resulting weight updating ratio was close to the expected weight updating ratio. © 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.

关键词： Adaptive filters

来源：评论

学校读者我要写书评

暂无评论

Random Number Generator for Securing Data Exchange in Smart Factory: Recent Trends and Best Practices 3

Random Number Generator for Securing Data Exchange in Smart ...

引用

3rd International Conference on computer Technologies, ICCTech 2024

作者： Sama, Andi Meyliana Heryadi, Yaya Sahroni, Taufik Roni Bina Nusantara University Binus Graduate Program - Computer Science Computer Science Department Jakarta11480 Indonesia Bina Nusantara University School of Information System Information System Department Jakarta11480 Indonesia BINUS Graduate Program-Doctor of Computer Science Jakarta Computer Science Department Jakarta11530 Indonesia Bina Nusantara University BINUS Graduate Program - Master of Industrial Engineering Industrial Engineering Department Jakarta11480 Indonesia

ISBN: (纸本)9798350395419

IT/OT convergence in the form of a Cyber-Physical system (CPS) presents an opportunity to apply recent Information Technology (IT) advancements to Operational Technology (OT). The IT/OT convergence introduces cyber security threats for OT. The OT communication protocols, for example, have limited or no security capabilities for securing data exchange beyond basic authentication. The RNG (Random Number Generator) function is crucial in PLC for producing the encryption keys or the initial seed for security algorithms. The software-based PRNG (Pseudo RNG) is the most common approach for RNG in OT, instead of hardware-based RNG. This study provides a systematic literature review of the most recent evidence in digital transformation to secure data exchange in smart factories, within OT, or across OT and IT settings. It does this by looking at the PRNG on PLC and identifying the most recent trends and best practices. The findings include up-to-date data on author countries' distribution, published journals, research trends, industries, and industry types. The findings also address whether data flow is encrypted or shared in plaintext to ensure secure data transfer between IT and legacy OT environments. This paper concludes that while there is known RNG implementation in the actual embedded system in ICS, there is no evidence in the literature for using RNG in ICS networks for PLC implementation to secure data transfer with encryption. © 2024 IEEE.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

A Q-Learning Hybrid BRKGA Applied to the Knapsack Problem with Forfeits 13

A Q-Learning Hybrid BRKGA Applied to the Knapsack Problem wi...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Souto, Gabriel Aritsugi, Masayoshi Mendonca, Israel Simonetti, Luidi González, Pedro Henrique Federal University of Rio de Janeiro System Engineering and Computer Science Program Rio de Janeiro Brazil Kumamoto University Faculty of Advanced Science and Technology Kumamoto Japan

ISBN: (纸本)9798350308365

This paper presents a hybrid BRKGA (Q-HBRKGA) that combines BRKGA with Q-learning and a Local Branching technique to solve the Knapsack Problem with Forfeits(KPF). The aim is to tackle this problem, a vari-ant of the 0-1 Knapsack Problem, where a penalty cost is imposed when both items of a forfeit pair are included in the solution. Notably, Q-HBRKGA achieves superior results compared to existing approaches, establishing a valid strategy for KPF problem-solving. Computational experiments, utilizing benchmark instances, demonstrate the efficacy of Q-HBRKGA by outperforming state-of-the-art methods documented in the literature. © 2024 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Approach with BRKGA and Data Mining for the Early/Tardy Scheduling Problem 13

A Hybrid Approach with BRKGA and Data Mining for the Early/T...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Mendonça, Israel Fatyanosa, Tirana Noor Aritsugi, Masayoshi Silva, Pedro Henrique González Kumamoto University Faculty of Advanced Science and Technology Kumamoto Japan Brawijaya University Faculty of Computer Science Malang Indonesia Federal University of Rio de Janeiro System Engineering and Computer Science Program Rio de Janeiro Brazil

ISBN: (纸本)9798350308365

This paper introduces a novel hybrid genetic algorithm combined with data mining to solve a version of the early/tardy scheduling problem in which no unforced idle time may be inserted in a sequence. The chromosome representation of the problem is based on random keys and we use the Biased Random-Key Genetic Algorithm (BRKGA) to establish an order in which jobs are scheduled. A data mining component gathers data from the evolutionary steps of BRKGA and suggests chromosomes based on past observations. In this way, we address a key challenge in BRKGA - the exploration of solutions near an individual gene - by leveraging data-driven insights to refine and enhance the search space. Comparative analysis reveals that our hybrid algorithm significantly benefits from the pattern recognition capabilities of data mining, leading to improved scheduled efficiency. The results of a series of computational experiments underscore the potential of this hybrid approach that, although requiring slightly longer computational times, is better than the previous baseline BRKGA algorithm in terms of solution quality. © 2024 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Sentiment Analysis in Indonesian Trading using Lexicon-based and Support Vector Machine

Sentiment Analysis in Indonesian Trading using Lexicon-based...

引用

2023 International Conference on computer science, Information Technology and engineering, ICCoSITE 2023

作者： Oetama, Raymond Sunardi Yanfi, Yanfi Ikhsan Assiddiq Up, Masagus M. Muhamad Isa, Sani Universitas Multimedia Nusantara Information System DepartmentFaculty of Engineering and Informatics Jakarta Indonesia Bina Nusantara University BINUS Graduate Program Computer Science School of Computer Science Computer Science Department Jakarta Indonesia Bina Nusantara University BINUS Graduate Program Computer Science Computer Science Department Jakarta Indonesia

ISBN: (纸本)9798350320954

Many individuals now trade online utilizing trading software in the digital world. Binomo is one of Indonesia's most popular trading platforms. This is because some influencers made several promises to Binomo customers. Since many customers were deceived, this case became quite popular. This study was executed to see how Indonesians felt about the Binomo application after the case went viral. The solution taken was in the form of sentiment analysis because there had been no previous research on sentiment analysis that discussed the Binomo case. The data was scanned using Netlytic tools, a cloud-based text and social network analyzer capable of identifying any talks on social media sites such as Twitter. The sentiment analysis of Binomo trading tweets by using the Multi-Perspective Question Answering lexicon utilized the KNIME tool. But unfortunately, the accuracy of sentiment analysis results is low. Furthermore, the Support Vector Machine technique is also being conducted. The Term Frequency-Inverse Document Frequency method is applied to perform feature extraction whilst the chi-square approach is utilized to identify features that are thought to be useful for inclusion in the classification process and to exclude features that are irrelevant to the target class. The obtained accuracy is 86%. The study proposes that words from the algorithm's outputs can be utilized to improve the quality of sentiment analysis using the lexicon. As an outcome of the algorithm, positive and negative terms are added to the lexicon, increasing the accuracy of sentiment analysis using the new vocabulary from 58.984% to 71.146%. © 2023 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

TESTING FACILITY LOCATION WITH CONSTRAINED QUEUE TIME PROBLEM: A CASE STUDY IN FLORIDA, USA

TESTING FACILITY LOCATION WITH CONSTRAINED QUEUE TIME PROBLE...

引用

2024 Winter Simulation Conference, WSC 2024

作者： Monteiro, Almir Antonio Schneider, Rafael de Almeida Guimarães, Vanessa González, Pedro Henrique System Engineering and Computer Science Program Federal University of Rio de Janeiro Brazil COPPEAD Graduate School of Business Federal University of Rio de Janeiro Brazil

ISBN: (纸本)9798331534202

This study addresses the Testing Facility Location with Constrained Queue Time Problem. This optimization problem focuses on determining the best places to deploy testing sites and their available testers for infectious diseases, while constraining the maximum time in the queue with a given probability. An integer programming model is introduced and applied to the three biggest counties, in terms of population, of Florida, United States. Moreover, the Monte Carlo method is used to evaluate the model’s output, aiming to check if the queueing time constraint is being satisfied. Through the experiments, a testing facility deployment plan can be determined for each county and further validated by the simulation. The results show that the solutions returned by the model behaved successfully when submitted to the Monte Carlo method, not exceeding the time in the queue in more than the predefined probability. © 2024 IEEE.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Software Product Line for Metaverse: Preliminary Results 19

Software Product Line for Metaverse: Preliminary Results

引用

2022 IEEE SmartWorld, 19th IEEE International Conference on Ubiquitous Intelligence and Computing, 2022 IEEE International Conference on Autonomous and Trusted Vehicles Conference, 22nd IEEE International Conference on Scalable Computing and Communications, 2022 IEEE International Conference on Digital Twin, 8th IEEE International Conference on Privacy Computing and 2022 IEEE International Conference on Metaverse, SmartWorld/UIC/ATC/ScalCom/DigitalTwin/PriComp/Metaverse 2022

作者： Fernandes, Filipe Werner, Cláudia Universidade Federal Do Rio de Janeiro - COPPE/UFRJ System Engineering and Computer Science Department Rio de Janeiro Brazil

ISBN: (纸本)9798350346558

The Metaverse is very challenging to implement solutions for eXtended Reality applications (XR apps), due to the combination of complex concerns that should be addressed: multiple users with non-traditional input and output devices, different hardware platforms that should be addressed, forceful interactive rates, and experimental interaction techniques, among other issues. Therefore, this work aims to present a Software Product Line (SPL)-based approach to support the development of Web XR apps. More specifically, we define a features model that represents similarities and variables (domain analysis);we defined a core composed of generic and reusable software artifacts (domain design);and we developed an interface to support the instantiation of a Web XR app family, named MetaSee Features Model Editor (domain implementation). This approach integrates with a component of the MetaSEE architecture (Metaverse for Software engineering Education). A preliminary assessment found that Features Model has conceptual consistency from the point of view of the complexity of Web XR Apps multimodal interaction. As future work, features model and artifacts will be increased with improvements and an evaluation with a significant number of participants will be performed. © 2022 IEEE.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Hotel Information system Management Audit Using COBIT 2019 - APO12 2

Hotel Information System Management Audit Using COBIT 2019 -...

引用

2nd International Conference for Innovation in Technology, INOCON 2023

作者： Utamajaya, Joy Nashar Supangat, Suhono Harso Gaol, Ford Lumban Ranti, Benny BINUS University BINUS Graduate Program School of Information System Jakarta Indonesia Bandung Institute of Technology School of Electrical Engineering and Informatic Bandung Indonesia Bina Nusantara University Computer Science Department BINUS Graduate Program Computer Science Jakarta Indonesia University of Indonesia Computer Science Department Faculty of Computer Science Depok Indonesia

ISBN: (纸本)9798350320923

In general, public or private organizations or companies have used information-based technology as a support to improve business performance to be more effective and efficient in order to achieve a company's business goals. Given the large contribution of information technology in the application of hotel applications as a supporting information system, it is a vital system that must avoid risks that can hinder and cause harm to the hotel management business processes. Therefore, it is necessary to carry out risk management using the COBIT 5 framework to manage possible risks that may occur based on the APO12 (Manage Risk) domain. From the evaluation results of the data obtained through observation and interviews as well as the calculation of the results of the questionnaire based on 6 APO12 subdomains, the results of the risk management level capability assessment in hotel applications are still at level 3 or have reached the level of established process with the target to be achieved at level 4 resulting in a gap of 1 level. Based on the results obtained, it is necessary to propose recommendations that can be used by hotels in improving the application of information technology risk management so that in the future it can achieve the expected target level so that the APO12 level of capability can increase and become more optimal. © 2023 IEEE.

关键词： Risk management

来源：评论

学校读者我要写书评

暂无评论

Optimization of Node Reduction Using BRKGA for GNN-Based Traffic Speed Forecasting 13

Optimization of Node Reduction Using BRKGA for GNN-Based Tra...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Inokuchi, Yuto González, Pedro Henrique Mendonça, Israel Aritsugi, Masayoshi Graduate School of Science and Technology Kumamoto University Kumamoto Japan Federal University of Rio de Janeiro System Engineering and Computer Science Program Rio de Janeiro Brazil Kumamoto University Faculty of Advanced Science and Technology Kumamoto Japan

ISBN: (纸本)9798350308365

While Spatio-Temporal Graph Convolutional Networks (STGCNs) are an effective method for traffic speed fore-casting, their training and inference tend to be time-consuming. In this paper, we aim to refine these networks by strategically reducing their number of nodes, thereby boosting computational efficiency. The nodes in these graphs represent data observed for road segments, and by analyzing the interconnections and layout of the graph, we can identify nodes with minimal contribution to overall performance. Removing these nodes can potentially decrease computation time while maintaining the prediction accuracy. We employ the Biased Random-Key Genetic Algorithm (BRKGA) to identify a good set of nodes for removal, based on a predefined percentage reduction of the original graph size (e.g., retaining 95 % of the original graph). We evaluate different graph size configurations, ranging from 95 % to 70 % node retention, to determine the least impactful node set performance. Our experiments on three real-world datasets reveal that reducing nodes can decrease computation time by up to 29%, and as a byproduct of removing noise, even improve the prediction accuracy. © 2024 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient Hyperparameter Optimization Using Deep Q-Network and BRKGA 13

Efficient Hyperparameter Optimization Using Deep Q-Network a...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Kobayashi, Kosei Aritsugi, Masayoshi González, Pedro Henrique Mendonça, Israel Graduate School of Science and Technology Kumamoto University Kumamoto Japan Faculty of Advanced Science and Technology Kumamoto University Kumamoto Japan System Engineering and Computer Science Program Federal University of Rio de Janeiro Rio de Janeiro Brazil

ISBN: (纸本)9798350308365

Hyperparameter optimization (HPO) is paragon to maximize performance when designing machine learning models. Among different HPO methods, Genetic Algorithm (GA) based optimization is considered effective because it allows a wide and diverse range of solutions to be explored. However, GA's exploratory nature makes this type of algorithm to evaluate many solutions that do not improve the overall performance. This is specially costly when the objective function to be evaluated is time-consuming, like in the HPO field. In this paper, we propose an efficient hybrid algorithm that is able to reduce computational cost by combining deep reinforcement learning with the Biased Random Key Genetic Algorithm (BRKGA), a variant of genetic algorithms. Our reinforcement learning agent has a decision-making role during the population's fitness calculation, in which it filters out chromosomes that would not improve the overall fitness of the population. The agent uses small amounts of pre-trained data to identify trends in potentially good solutions, and carry out its decision process. We conduct experiments on eight different datasets to assess the effectiveness of the proposed method, and the results show that the proposed method can significantly reduce the computation time of hyperparameter search using BRKGA (up to 44% reduction in computational time) without compromising the quality of the solution (no statistically difference in results). © 2024 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：