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

IEEE Conference on Nanotechnology

作者： F.-S. Dumitru M. Enachescu A. M. Antonescu N. Cucu-Laurenciu S. D Cotofana Faculty of Electronics Telecommunications and Information Technology National University of Science and Technology Politehnica Bucharest Romania High Energy Physics Department IMAPP Radboud University The Netherlands Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft AA The Netherlans

ISBN: (数字)9798350386240

ISBN: (纸本)9798350386257

In the context of an artificial intelligence and machine learning landscape that is evolving at an unprecedented pace, we propose a low power, high-speed, mixed-signal graphene nanoribbon-based (GNR) McCulloch-Pitts neuron (MCPN) implementation featuring programmable synaptic weights and inhibitory inputs. By definition, a generic MCPN is comprised of two parts, a weighted summation element and a decision element, called a soma. Our summation element implementation uses three distinct non-rectangular GNR devices, biased under specific conditions, to fulfill the roles of current source, low-side and high-side switches. The programmable excitatory and inhibitory synapses were obtained leveraging GNR SRAM cells and logic gates, hence providing the flexibility needed by real-world applications. The decision element's threshold activation function was implemented using a chain of GNR inverter structures which manifest the function's characteristic in the analog domain. Modulation of the decision element's threshold is achieved indirectly by means of a configurable resistive load which is varied depending on the configuration stored in SRAM. Our benchmark results, obtained using a generic 5 by 5 pixel pattern recognition application, reveal that the GNR-based implementation achieves 3.5× less power consumption, 20 × higher speed, while occupying 3 × less active area when compared to its FinFET analog circuit counterpart.

关键词： Power demand Graphene Neurons Symbols Logic gates FinFETs SRAM cells

来源：评论

学校读者我要写书评

暂无评论

Non-equilibrium dynamics of dipole-charged fields in the Proca theory

arXiv

引用

arXiv 2023年

作者： Damski, Bogdan Jagiellonian University Faculty of Physics Astronomy and Applied Computer Science Lojasiewicza 11 Kraków30-348 Poland

We discuss the dynamics of field configurations encoded in the certain class of electric (magnetic) dipole-charged states in the Proca theory of the real massive vector field. We construct such states so as to ensure that the long distance structure of the mean electromagnetic field in them is initially set by the formula describing the electromagnetic field of the electric (magnetic) dipole. We analyze then how such a mean electromagnetic field evolves in time. We find that far away from the center of the initial field configuration, the long range component of the mean electromagnetic field harmonically oscillates, which leads to the phenomenon of the periodic oscillations of the electric (magnetic) dipole moment. We also find that near the center of the initial field configuration, the mean electromagnetic field escapes from its initial arrangement and a spherical shock wave propagating with the speed of light appears in the studied system. A curious configuration of the axisymmetric mean electric field is found to accompany the mean magnetic field in magnetic dipole-charged states. Copyright © 2023, The Authors. All rights reserved.

关键词： Electromagnetic fields

来源：评论

学校读者我要写书评

暂无评论

Odyssey of the elusive Θ+

arXiv

引用

arXiv 2024年

作者： Praszalowicz, Michal Institute of Theoretical Physics Faculty of Physics Astronomy and Applied Computer Science Jagiellonian University ul. S. Lojasiewicza 11 Kraków30-348 Poland

Θ+ is a putative light pentaquark state of positive parity with minimal quark content (uudds¯). It naturally emerges in chiral models for baryons, but experimental evidence is uncertain. We review the theoretical foundations of chiral models and their phenomenological applications to exotic states. In particular, we discuss in detail the pentaquark widths with special emphasis on the cancellations occurring in the decay operator. We also discuss some experiments, mainly those whose positive evidence of Θ+ persists to this day. This review is dedicated to Dmitry Diakonov, Victor Petrov, and Maxim Polyakov and their contribution to the Θ+ story. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Semantic Data Representation for Explainable Windows Malware Detection Models

arXiv

引用

arXiv 2024年

作者： Švec, Peter Balogh, Štefan Homola, Martin Kľuka, Ján Bisták, Tomáš Institute of Computer Science and Mathematics Faculty of Electrical Engineering and Information Technology Slovak University of Technology Ilkovičova 3 Bratislava Slovakia Department of Applied Informatics Faculty of Mathematics Physics and Informatics Comenius University in Bratislava Mlynská dolina Bratislava Slovakia

Ontologies are a standard tool for creating semantic schemata in many knowledge intensive domains of human interest. They are becoming increasingly important also in the areas that have been until very recently dominated by subsymbolic knowledge representation and machine-learning (ML) based data processing. One such area is information security, and specifically, malware detection. We thus propose PE Malware Ontology that offers a reusable semantic schema for Portable Executable (PE – the Windows binary format) malware files. This ontology is inspired by the structure of the EMBER dataset, which focuses on the static malware analysis of PE files. With this proposal, we hope to provide a unified semantic representation for the existing and future PE-malware datasets and facilitate the application of symbolic, neuro-symbolic, or otherwise explainable approaches in the PE-malware-detection domain, which may produce interpretable results described by the terms defined in our ontology. In addition, we also publish semantically treated EMBER data, including fractional datasets, to support the reproducibility of experiments on EMBER. We supplement our work with a preliminary case study, conducted using concept learning, to show the general feasibility of our approach. While we were not able to match the precision of the state-of-the-art ML tools, the learned malware discriminators were interesting and highly interpretable. Copyright © 2024, The Authors. All rights reserved.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Eliminating Crossings in Ordered Graphs 19

Eliminating Crossings in Ordered Graphs

引用

19th Scandinavian Symposium on Algorithm Theory, SWAT 2024

作者： Agrawal, Akanksha Cabello, Sergio Kaufmann, Michael Saurabh, Saket Sharma, Roohani Uno, Yushi Wolff, Alexander Indian Institute of Technology Madras Chennai India Faculty of Mathematics and Physics University of Ljubljana Slovenia Institute of Mathematics Physics and Mechanics Ljubljana Slovenia Department of Computer Science Tübingen University Germany Institute of Mathematical Sciences Chennai India University of Bergen Norway Graduate School of Informatics Osaka Metropolitan University Sakai Japan Universität Würzburg Germany

ISBN: (纸本)9783959773188

Drawing a graph in the plane with as few crossings as possible is one of the central problems in graph drawing and computational geometry. Another option is to remove the smallest number of vertices or edges such that the remaining graph can be drawn without crossings. We study both problems in a book-embedding setting for ordered graphs, that is, graphs with a fixed vertex order. In this setting, the vertices lie on a straight line, called the spine, in the given order, and each edge must be drawn on one of several pages of a book such that every edge has at most a fixed number of crossings. In book embeddings, there is another way to reduce or avoid crossings;namely by using more pages. The minimum number of pages needed to draw an ordered graph without any crossings is its (fixed-vertex-order) page number. We show that the page number of an ordered graph with n vertices and m edges can be computed in 2m · nO(1) time. An O(log n)-approximation of this number can be computed efficiently. We can decide in 2O(d√k log(d+k)) · nO(1) time whether it suffices to delete k edges of an ordered graph to obtain a d-planar layout (where every edge crosses at most d other edges) on one page. As an additional parameter, we consider the size h of a hitting set, that is, a set of points on the spine such that every edge, seen as an open interval, contains at least one of the points. For h = 1, we can efficiently compute the minimum number of edges whose deletion yields fixed-vertex-order page number p. For h > 1, we give an XP algorithm with respect to h + p. Finally, we consider spine+t-track drawings, where some but not all vertices lie on the spine. The vertex order on the spine is given;we must map every vertex that does not lie on the spine to one of t tracks, each of which is a straight line on a separate page, parallel to the spine. In this setting, we can minimize in 2n · nO(1) time either the number of crossings or, if we disallow crossings, the number of tracks. © Akanks

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Patch Antenna Design and Optimization Using Machine Learning Techniques

Patch Antenna Design and Optimization Using Machine Learning...

引用

Sustainable Technologies for Industry 4.0 (STI), International Conference on

作者： Ruhit Shah Md Jamiul Haque Md Samsuzzaman Md Abdul Masud Rezaul Azim Ismail Hossain Faculty of Computer Science and Engineering Patuakhali Science and Technology University Patuakhali Bangladesh Department of Physics University of Chittagong Chittagong Bangladesh Space Science Center (ANGKASA) Universiti Kebangsaan Malaysia Bangi Selangor Malaysia

ISBN: (数字)9798331531973

ISBN: (纸本)9798331531980

This research aims to optimize the design process of rectangular microstrip patch antenna using machine learning techniques. In antenna design, the initial step is calculating the dimensions based on desired performance criteria, such as gain and directivity. Usually, the simulation result does not produce the intended results, even when the antenna dimensions match the calculated result. As a result, optimization is required. In general, optimization involves a lot of trial and error. To streamline this, four machine learning models-Random Forest Regression (RFR), Decision Tree Regression (DTR), XGB Regression (XGBR), and AdaBoost Regression (ABR)-are applied to predict the antenna's key parameters (gain, directivity). Among these, DTR and XGBR exhibited superior performance, achieving prediction accuracies of 99.63% and 99.97%, respectively. These models enable designers to estimate the optimal dimensions more efficiently, reducing the need for extensive simulations. Predictions are validated through full-wave simulations, demonstrating high accuracy.

关键词： Accuracy Design methodology Patch antennas Simulation Machine learning Predictive models Regression tree analysis Antennas Optimization Random forests

来源：评论

学校读者我要写书评

暂无评论

Long-time Resistance and Impurities Influence on Hydrogen Sensors Based on Palladium Expansion and Bragg Gratings 28

Long-time Resistance and Impurities Influence on Hydrogen Se...

引用

28th International Conference on Optical Fiber Sensors, OFS 2023

作者： Almeida, Miguel A.S. de Almeida, J.M.M.M. Coelho, Luís C.C. INESC TEC Institute of Systems and Computer Engineering Technology and Science Department of Physics Faculty of Sciences University of Porto Rua do Campo Alegre Porto4169-007 Portugal Department of Physics School of Sciences and Technology University of Trás-os-Montes e Alto Douro Vila Real5001-801 Portugal

An optical fiber sensor for hydrogen detection is presented. It is based on processed fiber Bragg gratings coated with palladium thin films where its expansion due to the hydrogen adsorption is monitored as strain mea... 详细信息

ISBN: (纸本)9781957171302

关键词： Palladium

来源：评论

学校读者我要写书评

暂无评论

A Square Patch Partially Reflective Surface for Improving the Antenna Gain Characteristic of Low-Cost Dual Polarized Microstrip Antenna

A Square Patch Partially Reflective Surface for Improving th...

引用

2022 Research, Invention, and Innovation Congress: Innovative Electricals and Electronics, RI2C 2022

作者： Chudpooti, Sukanya Sangpet, Patchadaporn Chudpooti, Nonchanutt Sathitanon, Nontakorn Somjit, Nutapong Akkaraekthalin, Prayoot King Mongkut's University of Technology North Bangkok Facutly of Appied Science Department of Industrial Physics and Medical Instrumentation Bangkok Thailand Faculty of Engineering King Mongkut's University of Technology North Bangkok Department of Electrical and Computer Engineering Bangkok Thailand King Mongkut's University of Technology North Bangkok Faculty of Applied Science Department of Computer and Information Sciences Bangkok Thailand University of Leeds School of Electronic and Electrical Engineering Leeds United Kingdom

ISBN: (数字)9781665473248

ISBN: (纸本)9781665473248

This paper presents an improvement gain of a dual-polarized microstrip patch antenna by using the partially reflective surface (PRS). The PRS is designed from a 10 × 10 array patches structure, which is patterned on a 0.8-mm FR-4 substrate. A-dual-port fed by two SMA connectors, which is selected to use as the source of an experiment. The square metallic patch is used to design the PRS layer. The dimension of the square patch is 5 mm × 5 mm. The length of the square patch is varied from 3.0mm to 4.5 mm by step of 0.5 mm to investigate the reflection coefficients, e.g., magnitude response and phase response. Based on the simulated results, a 4.5-mm square patch provides the highest reflection coefficient of 0.53. To prove the design concept, the size of a square patch of 4.5 mm is selected to fabricate and measure the radiation pattern. At an operating frequency of 3.5 GHz, the maximum gain at the zero degrees is increased from 1.2 dBi to 4.96 dBi when compared without and with PRS. © 2022 IEEE.

关键词： Reflection

来源：评论

学校读者我要写书评

暂无评论

Efficient Time-Delay System Optimization with Auto-Configured Metaheuristics

Efficient Time-Delay System Optimization with Auto-Configure...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Roman Senkerik Aleksander Byrski Hubert Guzowski Peter Janku Tomas Kadavy Zuzana Kominkova Oplatkova Radek Matusu Michal Pluhacek Libor Pekar Maciej Smolka Adam Viktorin Department of Informatics and Artificial Intelligence A.I. Lab Faculty of Applied Informatics Tomas Bata University in Zlin Czech Republic Department of Automation and Control Engineering Faculty of Applied Informatics Tomas Bata University in Zlin Czech Republic Institute of Computer Science AGH University of Science and Technology Krakow Poland

This paper presents an experimental study that compares the performance of four selected metaheuristic algorithms for optimizing a time delay system model. Time delay system models are complex and challenging to optimize due to their inherent characteristics, such as non-linearity, multi-modality, and constraints. The study includes an explanation of the choice and core functionality of the selected algorithms, which are both baseline and state-of-the-art variants of self-organizing migrating algorithm (SOMA), state-of-the-art variant from the Success-History-based Adaptive Differential Evolution family of algorithms, with emphasis on diverse search (DISH algorithm), and Covariance Matrix Adaptation Evolution Strategy (CMA-ES) algorithm. The hyperparameters of the metaheuristic algorithms were set using the iRace automatic algorithm configuration framework. The paper emphasizes the importance of metaheuristic algorithms in control engineering for time-delay systems to develop more effective and efficient control strategies and precise model identifications. The experimental results highlight the effectiveness of the state-of-the-art algorithms with specific adaptive mechanisms like population organization process, diverse search and adaptation mechanisms ensuring a gradual transition from exploration to exploitation. Overall, this study contributes to understanding the challenges and advantages of using metaheuristic algorithms in control engineering for time delay systems. The results provide valuable insights into the performance of modern metaheuristic algorithms and can help guide the selection of appropriate adaptive mechanisms of metaheuristics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Comparison Analysis of Data Sending Performance Using The Cayenne and ThingSpeak IoT Platform 4

Comparison Analysis of Data Sending Performance Using The Ca...

引用

4th International Conference on Informatics, Multimedia, Cyber and Information System, ICIMCIS 2022

作者： Pranoto, Kirana Astari Ramadhan, Yogi Reza Caesarendra, Wahyu Triwiyanto Glowacz, Adam Dash, Santanu Kumar Wahyono, Bambang T Faculty of Integrated Technologies Universiti Brunei Darussalam Gadong BE1410 Brunei CV. Rekayasa Desain Manufaktur Semarang Indonesia Department of Electromedical Engineering Politeknik Kesehatan Surabaya Surabaya Indonesia Faculty of Electrical Engineering Automatics Computer Science and Biomedical Engineering Agh University of Science and Technology Poland Vellore Institute of Technology Vellore Tamil Nadu India Faculty of Computer Science Universitas Pembangunan Nasional Veteran Jakarta Jakarta Indonesia

ISBN: (纸本)9781665473279

The speed and accuracy of an IoT platform are crucial in a data transfer process. On a simple data transfer, the speed differential may not have much of an impact on the validity or accuracy. However, significant variations in data reading speed will adversely affect the accuracy of the processed data in data transfer activities that include a large volume of data and are carried out continually. This research was conducted to discover a comparison between the Cayenne IoT platform and the ThingSpeak IoT platform based on the speed of data transmission and the accuracy of data reading, which is then expected to be used to develop further projects. In this study, a simple temperature reading device was made using the DS18B20 temperature sensor as a temperature reading component controlled by the ESP8266 microcontroller. The ESP8266 also operates to process data which will then be sent to the IoT platform using the uPyCraft IDE to program the ESP8266 microcontroller. This research was accomplished by measuring the temperature of three different conditions of water as a reference value. The previous research shows that the Cayenne IoT platform displays data faster than the ThingSpeak IoT platform (about 2 to 5 seconds). However, the accuracy level refers to the result of the difference in the average temperature reading of the IoT ThingSpeak platform digital thermometer, which is more accurate than Cayenne. The difference generated by the Cayenne IoT platform in room temperature water is 2.9%, in hot water is 1.52%, and in cold water is 3.47%. On the other hand, ThingSpeak obtained the difference in room temperature water by 3.04%, hot water by 1.5%, and cold water by 3.06%. Inaccessible mode, the Cayenne IoT platform can display sensor readings according to the program created at intervals of two seconds. © 2022 IEEE.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：