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

International Conference on Emerging Technologies and Factory Automation (ETFA)

作者： Kézia de Vasconcelos Oliveira Angelo Perkusich Kyller Costa Gorgônio Leandro Dias da Silva Aldenor Falcão Martins Center of Electrical Engineering and Informatics Federal University of Campina Grande Campina Grande Paraiba Brazil Computing Institute Federal University of Alagoas Maceio Alagoas Brazil Graduate Program in Electrical Engineering Federal University of Campina Grande Campina Grande Paraiba Brazil

The reliability on Safety Instrumented Systems (SIS) is critical for the safe operation of many industrial applications. In particular, SIS play an important role in oil and gas processing plants. SIS are responsible not only for the continuous operation of the plant, it also keeps the plant in a safe state, avoiding damages to the environment and minimizing risks to employees. Therefore, the correct behavior of such systems is an important goal to achieve when building industrial plants. Verification and testing of SIS programs is a very hard task to accomplish. This happens mainly for two reasons. First, testing the real system is very expensive and sometimes it may take a huge amount of time, weeks or even months. Second, those systems deal with a huge number of variables. It is not always possible for a human tester to check if all of them are correct when performing tests. Providing an automatic and formal testing approach for such systems is an important contribution for the development of such systems. In this work we introduce a new method for generating test cases for SIS programs running on programable Logic Controller (PLC). As we did on previous work, ISA 5.2 diagrams are used as specification of the systems, but now we are using a hardware-in-the-loop technique, and the target artifact is a software running on a PLC. To avoid the execution of redundant tests, we introduced a new test case generation algorithm that is based on equivalence classes. Finally, we discussed a study case in which our method is used to detect error, that were introduced on purpose, on a simple system.

关键词： Automata Testing Safety Valves Input variables Computational modeling Instruments

来源：评论

学校读者我要写书评

暂无评论

Analysis of variance of graph-clique mining for scalable proof of work 14th

Analysis of variance of graph-clique mining for scalable pro...

引用

14th International Conference on Information Security and Cryptology, Inscrypt 2018

作者： Anada, Hiroaki Matsushima, Tomohiro Su, Chunhua Meng, Weizhi Kawamoto, Junpei Bag, Samiran Sakurai, Kouichi Department of Information Security University of Nagasaki Nagasaki Japan Department of Informatics Graduate School and Faculty of Information Science and Electrical Engineering Kyushu University Fukuoka Japan Division of Computer Science University of Aizu Aizuwakamatsu Japan Department of Applied Mathematics and Computer Science Technical University of Denmark Kongens Lyngby Denmark School of Computing Science Newcastle University Newcastle upon Tyne United Kingdom

ISBN: (纸本)9783030142339

Recently, Bitcoin is becoming one of the most popular decentralized cryptographic currency technologies, and Bitcoin mining is a process of adding transaction records to Bitcoin’s public ledger of past transactions or blockchain. To obtain a bitcoin, the mining process involves compiling recent transactions into blocks and trying to solve a computationally difficult puzzle, e.g., proof of work puzzle. A proof of work allows miners the ability to quantify how much work a given proof contains. Basically, the required time for mining is decided in advance, but problems will occur if the value is large for dispersion. In this paper, we first accept that the required time between consecutive blocks follows the exponential distribution. That is, the variance is stable as long as the expected time is fixed. Then, we focus on the graph clique mining technique proposed by the literature, like Tromp (BITCOIN 2015) and Bag-Ruj-Sakurai (Inscrypt 2015), which is based on a computational difficulty problem of searching cliques of undirected graphs, where a clique is a subset of vertices. In particular, when the clique size is two, graph clique mining can be used to gain Bitcoins. The previous work also claimed that if the clique size is parameterized and increased, even if the expected time is fixed, the variance would not be stable. However, no qualitative or quantitative results were given to support their claim. Motivated by this issue, in this work, we propose a simple search algorithm for graph cliques mining, and perform a small scale evaluation on Bitcoin and Graph cliques’s solo mining to investigate the variance issue. © 2019, Springer Nature Switzerland AG.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Development of a virtual reality environment for rehabilitation of tetraplegics 13

Development of a virtual reality environment for rehabilitat...

引用

13th International Conference on Biomedical Electronics and Devices, BIODEVICES 2020 - Part of 13th International Joint Conference on Biomedical engineering Systems and Technologies, BIOSTEC 2020

作者： Ginja, Gabriel Augusto Varoto, Renato Cliquet, Alberto Bioengineering Post Graduate Program University of São Paulo Av. Trabalhador São Carlense 400 São CarlosCEP 13566-590 Brazil Electrical and Computing Engineering Department University of São Paulo São Carlos SP Brazil Orthopedics and Traumatology Department Faculty of Medical Sciences University of Campinas Campinas SP Brazil

ISBN: (纸本)9789897583988

Treatments based on Virtual Reality have been successfully used in motor rehabilitation of issues such as Spinal Cord Injury and Stroke. Highly immersive Virtual environments combined with biofeedback can be utilized to train functional activities on patients with these motor disabilities. This work details the development of a portable Virtual Reality environment to train upper limbs activities on Spinal Cord Injury subjects. The Virtual Reality environment depicts a personalized physiotherapy room where the user trains elbow and shoulder by reaching 5 spots on table. Also the user have a biofeedback of both hands’ position. Finally this system will be integrated a pilot biomechanical analysis using The Motion Monitor system to compare a group of patients before and after a 6 week intervention with Virtual Reality. Copyright © 2020 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Multi-task Learning Graph Neural Networks for Cancer Prognosis Prediction with Genomic Data

Multi-task Learning Graph Neural Networks for Cancer Prognos...

引用

Annual International Conference of the IEEE engineering in Medicine and Biology Society (EMBC)

作者： Tsung-Wei Lin Sofia Ormazabal Arriagada Che Lin Graduate Institute of Communication Engineering National Taiwan University (NTU) Taiwan International Graduate Program AIoT NTU Research Center for Information Technology Innovation Academia Sinica Department of Electrical Engineering NTU Center for Advanced Computing and Imaging in Biomedicine NTU Smart Medicine and Health Informatics Program NTU

ISBN: (数字)9798350371499

ISBN: (纸本)9798350371505

Providing robust prognosis predictions for cancers with limited data samples remains a challenge for precision oncology. In this study, we propose a novel approach that combines multi-task learning (MTL) and graph neural networks (GNNs) to address this issue. By representing gene-gene interactions as a graph network, our approach leverages multi-task learning to effectively capture the relationships of genes relevant to the oncogenesis and progression of breast, lung, and colon cancer. We demonstrate that our approach improves the cancer prognosis prediction for cancers with fewer samples, such as colon adenocarcinoma, by leveraging the shared gene-gene interactions across different cancer types, obtaining increases in the area under the precision-recall curve (AUPRC) of 24%. Our work contributes to the field of smart healthcare by demonstrating the potential of MTL and GNNs for enhancing cancer prognosis prediction, even with limited data samples.

关键词： Lungs Genomics Medical services Colorectal cancer Breast Multitasking Oncology Graph neural networks Prognostics and health management Cancer

来源：评论

学校读者我要写书评

暂无评论

Preliminary Design for Reference tracking feedback for Medical Cyber-Physical Pharmacokinetic Systems 26

Preliminary Design for Reference tracking feedback for Medic...

引用

2024 IEEE International Conference on Automation/26th Congress of the Chilean Association of Automatic Control, ICA-ACCA 2024

作者： Oliveira, Pedro M. Bustos, Daniel Lobo, Rodolfo Lacerda, Marcio J. Palma, Jonathan M. Federal University of Minas Gerais Graduate Program in Electrical Engineering Belo Horizonte Brazil Universidad Católica Del Maule Dept. of Translational Medicine Talca Chile Universidad Diego Portales Ingenieria en Telecomunicaciones e Informática Santiago Chile London Metropolitan University Centre for Communications Technology School of Computing and Digital Media London United Kingdom Universidad de Talca Faculty of Engineering Curicó Chile

ISBN: (纸本)9798350378115

This paper addresses the reference tracking control problem for Medical Cyber-Physical Systems (MCPS). The control theory is employed to guarantee the suitable concentration of drugs in the body of patients to guarantee a safe treatment. The MCPS is modeled as a switched system, and the modes consider the different scenarios for the problem. A discrete-time model is utilized for the pharmacokinetic process, and the zero input control strategy is employed to design state-feedback controllers with a guaranteed exponential convergence rate. A numerical experiment is presented to illustrate the validity and effectiveness of our method. © 2024 IEEE.

关键词： State feedback

来源：评论

学校读者我要写书评

暂无评论

Valley notch filter in a graphene strain superlattice: a Green’s function and machine learning approach

arXiv

引用

arXiv 2019年

作者： Torres, V. Silva, P. De, E.A.T. Souza Silva, L.A. Bahamon, D.A. Instituto de Física Universidade Federal Fluminense Niterói Av. Litorânea sn RJ24210-340 Brazil MackGraphe Mackenzie Presbyterian University Rua da Consolação 930 SP01302-907 Brazil School of Computing and Informatics Graduate Program in Electrical Engineering and Computing

The valley transport properties of a superlattice of out-of-plane Gaussians deformations are calculated using a Green’s function and a Machine Learning approach. Our results show that periodicity significantly improves the valley filter capabilities of a single Gaussian deformation, these manifest themselves in the conductance as a sequence by valley filter plateaus. We establish that the physical effect behind the observed valley notch filter is the coupling between counter-propagating transverse modes;the complex relationship between the design parameters of the superlattice and the valley filter effect make difficult to estimate in advance the valley filter potentialities of a given superlattice. With this in mind, we show that a Deep Neural Network can be trained to predict valley transmission with a precision similar to the Green’s function but with much less computational effort. Copyright © 2019, The Authors. All rights reserved.

关键词： Landforms

来源：评论

学校读者我要写书评

暂无评论

Dynamic programming Algorithm using Furniture Industry 0/1 Knapsack Problem 5

Dynamic Programming Algorithm using Furniture Industry 0/1 K...

引用

5th International Conference on Cybernetics and Intelligent Systems, ICORIS 2023

作者： Anditta, Mietha Amartya, Natashya Warnars, Laurens Spits Warnars, Harco Leslie Hendric Spits Ramadhan, Arief Siswanto, Teddy Mantoro, Teddy Noordin, Nurulhuda Bina Nusantara University School of Computer Science Computer Science Departement Jakarta11530 Indonesia Bina Nusantara University School of Information Systems Information Systems Departement Jakarta11530 Indonesia Bina Nusantara University Binus Graduate Program - Computer Science Computer Science Departement Jakarta11530 Indonesia Telkom University Pjj Informatika Bandung40257 Indonesia Trisakti University Information Systems Department Jakarta11440 Indonesia Sampoerna University Faculty of Engineering and Technology Jakarta12760 Indonesia Universiti Teknologi Mara School of Computing Sciences College of Computing Informatics and Mathematics Selangor Malaysia

ISBN: (纸本)9798350369489

Dynamic programming is a fundamental algorithm that can be found in our daily lives easily. One of the dynamic programming algorithm implementations consists of solving the 0/1 knapsack problem. A 0/1 knapsack problem can be seen from industrial production cost. It is prevalent that a production cost has to be as efficient as possible, but the expectation is to get the proceeds of the products higher. Thus, the dynamic programming algorithm can be implemented to solve the diverse knapsack problem, one of which is the 0/1 knapsack problem, which would be the main focus of this paper. The implementation was implemented using C language. This paper was created as an early implementation algorithm using a Dynamic program algorithm applied to an Automatic Identification System (AIS) dataset. © 2023 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

BHJO: A Novel Hybrid Metaheuristic Algorithm Combining the Beluga Whale, Honey Badger, and Jellyfish Search Optimizers for Solving engineering Design Problems

引用

Computer Modeling in engineering & Sciences 2024年第10期141卷 219-265页

作者： Farouq Zitouni Saad Harous Abdulaziz S.Almazyad Ali Wagdy Mohamed Guojiang Xiong Fatima Zohra Khechiba Khadidja Â Kherchouche Department of Computer Science and Information Technology Kasdi Merbah UniversityP.O.Box 30000OuarglaAlgeria Department of Computer Science College of Computing and InformaticsUniversity of SharjahP.O.Box 27272SharjahUnited Arab Emirates Department of Computer Engineering College of Computer and Information SciencesKing Saud UniversityP.O.Box 51178Riyadh11543Saudi Arabia Operations Research Department Faculty of Graduate Studies for Statistical ResearchCairo UniversityGiza12613Egypt Applied Science Research Center Applied Science Private UniversityAmman11937Jordan Guizhou Key Laboratory of Intelligent Technology in Power System College of Electrical EngineeringGuizhou UniversityGuiyang550025China

Hybridizing metaheuristic algorithms involves synergistically combining different optimization techniques to effectively address complex and challenging optimization *** approach aims to leverage the strengths of multiple algorithms,enhancing solution quality,convergence speed,and robustness,thereby offering a more versatile and efficient means of solving intricate real-world optimization *** this paper,we introduce a hybrid algorithm that amalgamates three distinct metaheuristics:the Beluga Whale Optimization(BWO),the Honey Badger Algorithm(HBA),and the Jellyfish Search(JS)*** proposed hybrid algorithm will be referred to as *** this fusion,the BHJO algorithm aims to leverage the strengths of each *** this hybridization,we thoroughly examined the exploration and exploitation capabilities of the BWO,HBA,and JS metaheuristics,as well as their ability to strike a balance between exploration and *** meticulous analysis allowed us to identify the pros and cons of each algorithm,enabling us to combine them in a novel hybrid approach that capitalizes on their respective strengths for enhanced optimization *** addition,the BHJO algorithm incorporates Opposition-Based Learning(OBL)to harness the advantages offered by this technique,leveraging its diverse exploration,accelerated convergence,and improved solution quality to enhance the overall performance and effectiveness of the hybrid ***,the performance of the BHJO algorithm was evaluated across a range of both unconstrained and constrained optimization problems,providing a comprehensive assessment of its efficacy and applicability in diverse problem ***,the BHJO algorithm was subjected to a comparative analysis with several renowned algorithms,where mean and standard deviation values were utilized as evaluation *** rigorous comparison aimed to assess the performance of the BHJOalgorithmabout its counterparts,shedd

关键词： Global optimization hybridization of metaheuristics beluga whale optimization honey badger algorithm jellyfish search optimizer chaotic maps opposition-based learning

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Rule Reduction Approach to Software Fault-proneness Prediction

A Heuristic Rule Reduction Approach to Software Fault-pronen...

引用

Asia-Pacific Conference on Software engineering

作者： Akito Monden Jacky Keung Shuji Morisaki Yasutaka Kamei Ken-Ichi Matsumoto Graduate School of Information Science Nara Institute of Science and Technology Ikoma Nara Japan Department of Computing Hong Kong Polytechnic University Hong Kong China Faculty of Informatics Shizuoka University Hamamatsu Shizuoka Japan Graduate School and Faculty of Information Science and Electrical Engineering Kyushu University Fukuoka Japan

Background: Association rules are more comprehensive and understandable than fault-prone module predictors (such as logistic regression model, random forest and support vector machine). One of the challenges is that there are usually too many similar rules to be extracted by the rule mining. Aim: This paper proposes a rule reduction technique that can eliminate complex (long) and/or similar rules without sacrificing the prediction performance as much as possible. Method: The notion of the method is to removing long and similar rules unless their confidence level as a heuristic is high enough than shorter rules. For example, it starts with selecting rules with shortest length (length=1), and then it continues through the 2nd shortest rules selection (length=2) based on the current confidence level, this process is repeated on the selection for longer rules until no rules are worth included. Result: An empirical experiment has been conducted with the Mylyn and Eclipse PDE datasets. The result of the Mylyn dataset showed the proposed method was able to reduce the number of rules from 1347 down to 13, while the delta of the prediction performance was only. 015 (from. 757 down to. 742) in terms of the F1 prediction criteria. In the experiment with Eclipsed PDE dataset, the proposed method reduced the number of rules from 398 to 12, while the prediction performance even improved (from. 426 to. 441.) Conclusion: The novel technique introduced resolves the rule explosion problem in association rule mining for software proneness prediction, which is significant and provides better understanding of the causes of faulty modules.

关键词： Measurement Association rules Explosions Software Predictive models Educational institutions

来源：评论

学校读者我要写书评

暂无评论

An Explainable Machine Learning-Based Phishing Website Detection using Gradient Boosting

An Explainable Machine Learning-Based Phishing Website Detec...

引用

Information Technology Research and Innovation (ICITRI), International Conference on

作者： Rizal Dwi Prayogo Alvin Rizqi Alfisyahrin Windy Gambetta Siti Amatullah Karimah Hidetaka Nambo Division of Electrical Engineering and Computer Science Graduate School of Natural Science and Technology Kanazawa University Kanazawa Japan School of Computing Telkom University Bandung Indonesia Faculty of Transdisciplinary Sciences Institute of Philosophy in Interdisciplinary Sciences Kanazawa University Kanazawa Japan School of Electrical Engineering and Informatics Institut Teknologi Bandung Bandung Indonesia

ISBN: (数字)9798350376210

ISBN: (纸本)9798350376227

As the need for achieving optimal performance in prediction models, several recent and complex models have been developed. However, many of these models operate as black boxes, providing little insight into their predictive results. In recent years, three gradient-boosting methods based on Decision Trees have been recommended, i.e., XGBoost, CatBoost, and LightGBM. These methods have proven to deliver competitive performance with fast training times. Nevertheless, in critical domains like security, there is a growing need for increased transparency among stakeholders. One pressing concern in the security field is the proliferation of phishing websites. To address this issue, we propose an explainable machine learning-based approach using gradient-boosting methods with hyperparameter optimization on three phishing website datasets. Our best methods surpass the state-of-the-art phishing website detection methods, achieving accuracy rates of 97.45%, 99.16%, and $\mathbf{9 7. 8 5 \%}$ for the UCI (2015), Mendeley (2018), and Mendeley (2020) datasets, respectively. Subsequently, we implement posthoc explainability using SHAP and LIME for the selected dataset. The experimental results indicate that three features, i.e., length_url, directory_length, and time_domain_activation, are consistently identified as the most influential features in the dataset. Moreover, our proposed approach demonstrates promising results for detecting phishing websites with both high accuracy and explainability.

关键词： Training Technological innovation Accuracy Machine learning algorithms Phishing Closed box Predictive models Classification algorithms Security Tuning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：