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

A NEUROMORPHIC ANALYSIS OF CLIMATE PATTERNS FOR COMPLEX ENVIRONMENTAL FRACTAL MODELING

FRACTALS-COMPLEX GEOMETRY PATTERNS AND SCALING IN NATURE AND SOCIETY 2025年第2期33卷

作者： Alzu'bi, Shadi Kanan, Tarek Elbes, Mohammed Almiani, Muder Alzaytoonah Univ Jordan Amman Jordan Gulf Univ Sci & Technol Kuwait Kuwait

This study investigates the use of neuromorphic computing, particularly spiking neural networks (SNNs) and advanced neuromorphic hardware, to model and forecast climate patterns. Our neuromorphic system achieves high prediction accuracy, maintaining a Mean Squared Error (MSE) as low as 0.08, even with increasing data volumes. The system operates with notable energy efficiency, consuming just 0.15 J per inference at higher data loads. This efficiency, coupled with a throughput of 800 inferences per second, underscores the system's capability to handle large-scale data effectively. The neuromorphic approach addresses key challenges in scalability and energy consumption, presenting a robust solution for real-time climate data analysis. By continuously adapting to new data inputs, the system ensures accurate and timely predictions, essential for applications in environmental monitoring and decision-making. The integration of artificial intelligence algorithms with neuromorphic architectures not only reduces computational costs but also enhances the interpretability of complex climate dynamics. These findings highlight the transformative potential of brain-like computing in environmental modeling, offering a scalable, efficient, and adaptable tool for climate prediction and analysis.

关键词： Neuromorphic Computing Fractal Climate Pattern Analysis Environmental Modeling Spiking Neural Networks Brain-Like Computing Predictive Modeling energy-efficient algorithms Fractal Geometry Scaling Behavior

来源：评论

学校读者我要写书评

暂无评论

energy-efficient Neural Network for Epileptic Seizure Prediction

引用

IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING 2022年第1期69卷 401-411页

作者： Zhao, Shiqi Yang, Jie Sawan, Mohamad Zhejiang Univ Hangzhou Peoples R China Westlake Univ Sch Engn Cutting Edge Net Biomed Res & Innovat Hangzhou 310024 Peoples R China

Seizure prediction for drug-refractory epilepsy patients can improve their quality of life, reduce their anxiety, and help them take the necessary precautions. Nowadays, numerous deep learning algorithms have been proposed to predict seizure onset and obtain better performance than traditional machine learning methods. However, these methods require a large set of parameters and large hardware resources;they also have high energy consumption. Therefore, these methods cannot be implemented on compact, low-power wearable, or implantable medical devices. The devices should operate on a real-time basis to continually inform the epileptic patients. In this paper, we describe energy-efficient and hardware-friendly methods to predict the epileptic seizures. A model of only 45 kB was obtained by the neural architecture search and was evaluated across three datasets. The overall sensitivity, false prediction rate, and area under receiver operating characteristic curve were 99.81%, 0.005/h, 1 and 93.48%, 0.063/h, 0.977 and 85.19%, 0.116/h, 0.933, respectively, for three public datasets. This model was further reduced with several methods for model compression. The performances for the model sizes less than 50 kB for scalp EEG data and less than 10 kB for intracranial EEG data outperformed all the other models of similar model sizes. In particular, the energy consumption estimation was less than 10 mJ per inference for scalp EEG signal and less than 0.5 mJ per inference for intracranial EEG signal, which meet the requirements for low-power wearable and implantable devices, respectively.

关键词： Brain modeling Electroencephalography Predictive models Feature extraction Neural networks Sensitivity Manuals Epileptic seizure prediction energy-efficient algorithms EEG neural architecture search pruning quantization

来源：评论

学校读者我要写书评

暂无评论

Distributed algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2009年第1期20卷 124-139页

作者： Khan, Maleq Pandurangan, Gopal Kumar, V. S. Anil Virginia Tech Virginia Bioinformat Inst Network Dynam & Simulat Sci Lab Blacksburg VA 24061 USA Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

While there are distributed algorithms for the minimum spanning tree (MST) problem, these algorithms require relatively large number of messages and time, and are fairly involved, making them impractical for resource-constrained networks such as wireless sensor networks. In such networks, a sensor has very limited power, and any algorithm needs to be simple, local, and energy efficient. Motivated by these considerations, we design and analyze a class of simple and local distributed algorithms called Nearest Neighbor Tree (NNT) algorithms for energy-efficient construction of an approximate MST in wireless networks. Assuming that the nodes are uniformly distributed, we show provable bounds on both the quality of the spanning tree produced and the energy needed to construct them. We show that while NNT produces a close approximation to the MST, it consumes asymptotically less energy than the classical message-optimal distributed MST algorithm due to Gallagery, Humblet, and Spira. Further, the NNTs can be maintained dynamically with polylogarithmic rearrangements under node insertions/deletions. We also perform extensive simulations, which show that the bounds are much better in practice. Our results, to the best of our knowledge, demonstrate the first tradeoff between the quality of approximation and the energy required for building spanning trees on wireless networks, and motivate similar considerations for other important problems.

关键词： Distributed algorithms randomized approximation algorithms energy-efficient algorithms minimum spanning tree wireless networks sensor networks

来源：评论

学校读者我要写书评

暂无评论

Event-Based Distributed Filtering With Stochastic Measurement Fading

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2015年第6期11卷 1643-1652页

作者： Liu, Qinyuan Wang, Zidong He, Xiao Zhou, D. H. Tsinghua Univ Dept Automat Beijing 100084 Peoples R China Shandong Univ Sci & Technol Coll Elect Engn & Automat Qingdao 266590 Peoples R China Brunel Univ London Dept Comp Sci Uxbridge UB8 3PH Middx England

In this paper, we investigate the distributed filtering problem over wireless sensor networks (WSNs) with bandwidth and energy constraints. To utilize the limited resources efficiently, a novel event-based mechanism is proposed for the sensor node, such that only selected valuable data are broadcasted to its neighboring sensors via the wireless channel according to whether specific events happen. By resorting to graph theory and utilizing stochastic analysis methods, the filter parameters and the event triggering rules are designed, such that the filtering error converges at an exponential rate in the mean square sense. An adaptive algorithm for determining the triggering threshold is developed, which allows the intelligent sensors to tune the boundary of a local event domain in an online manner, so as to keep the average transmission rate level off a desired value. An illustrative example is given to demonstrate the effectiveness of the proposed strategy.

关键词： Adaptive threshold distributed filtering energy-efficient algorithms event-based mechanism wireless sensor networks (WSNs)

来源：评论

学校读者我要写书评

暂无评论

MULTICORE-OPTIMIZED WAVEFRONT DIAMOND BLOCKING FOR OPTIMIZING STENCIL UPDATES

引用

SIAM JOURNAL ON SCIENTIFIC COMPUTING 2015年第4期37卷 C439-C464页

作者： Malas, T. Hager, G. Ltaief, H. Stengel, H. Wellein, G. Keyes, D. KAUST ECRC Thuwal 23955 Saudi Arabia Univ Erlangen Nurnberg Erlangen Reg Comp Ctr RRZE D-91058 Erlangen Germany

The importance of stencil-based algorithms in computational science has focused attention on optimized parallel implementations for multilevel cache-based processors. Temporal blocking schemes leverage the large bandwidth and low latency of caches to accelerate stencil updates and approach theoretical peak performance. A key ingredient is the reduction of data traffic across slow data paths, especially the main memory interface. In this work we combine the ideas of multicore wavefront temporal blocking and diamond tiling to arrive at stencil update schemes that show large reductions in memory pressure compared to existing approaches. The resulting schemes show performance advantages in bandwidth-starved situations, which are exacerbated by the high bytes per lattice update case of variable coefficients. Our thread groups concept provides a controllable trade-off between concurrency and memory usage, shifting the pressure between the memory interface and the CPU. We present performance results on a contemporary Intel processor.

关键词： temporal blocking wavefront parallelization diamond tiling stencil computations multicore energy-efficient algorithms

来源：评论

学校读者我要写书评

暂无评论

A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems

引用

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2015年第3期62卷 787-814页

作者： David Teran-Villanueva, J. Fraire Huacuja, Hector Joaquin Carpio Valadez, Juan Martin Pazos Rangel, Rodolfo Puga Soberanes, Hector Jose Martinez Flores, Jose A. ITCM Ciudad Madero 89440 Tam Mexico ITL Leon 37290 Gto Spain

In this paper, the NP-hard problem of minimizing power consumption in wireless communications systems is approached. In the literature, several metaheuristic approaches have been proposed to solve it. Currently a homogeneous cellular processing algorithm and a GRASP algorithm hybridized with path-relinking are considered the state of the art algorithms. The main contribution of this paper is the analysis of five main characteristics for a heterogeneous cellular processing algorithm, based on scatter search and GRASP. A series of computational experiments with standard instances were carried out to assess the impact of each one of these characteristics. Among the main analyses we found particularly interesting a time reduction by 74.24 %, produced by the stagnation detection characteristic. Also the communication characteristic improves the quality of the solutions by 24.73 %. The computational results show that our heterogeneous cellular processing algorithm is a good alternative for solving the problem. The proposed algorithm finds 34 new best known solutions, which is 27 % of the instances with unknown optimal values. A Friedman hypothesis test was carried out to validate that two state-of-the-art algorithms and the proposed algorithm are statistically equivalent.

关键词： Cellular processing algorithms Wireless communications systems energy-efficient algorithms

来源：评论

学校读者我要写书评

暂无评论

Maximizing energy Conservation in a Centralized Cognitive Radio Network Architecture

Maximizing Energy Conservation in a Centralized Cognitive Ra...

引用

18th IEEE International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)

作者： Mastorakis, George Mavromoustakis, Constandinos X. Bourdena, Athina Kormentzas, Georgios Pallis, Evangelos Technol Educ Inst Crete Dept Appl Informat & Multimedia Iraklion Crete Greece Univ Nicosia Dept Comp Sci Nicosia Cyprus Univ Aegean Dept Informat & Commun Syst Engn Samos Greece

ISBN: (纸本)9781467349192

This paper proposes two energy-aware algorithms exploited for optimal resources administration and maximum energy conservation of secondary communication nodes in a centralized cognitive radio network architecture. The proposed algorithms optimally enable efficient TV White Spaces exploitation, through a radio spectrum broker that administrates the resources trading process, based on real-time secondary spectrum market policy. In addition, both algorithms adopt a joint path lifetime and utility maximization scheme, which encompasses a capacity-aware policy for achieving minimum energy consumption and reliability during the resource sharing process. Validity of both algorithms is verified through several sets of extended experimental/simulation tests, carried out under controlled conditions.

关键词： energy-efficient algorithms Radio Resource Management Cognitive Radio Networks TV White Spaces

来源：评论

学校读者我要写书评

暂无评论

An evaluation study of a fair energy-efficient technique for mobile ad hoc networks

An evaluation study of a fair energy-efficient technique for...

引用

2nd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2006)

作者： Gadallah, Yasser Kunz, Thomas Carleton Univ Ottawa ON K1S 5B6 Canada

ISBN: (纸本)1424404940

In this study, we present a performance evaluation of an energy conservation technique designed for mobile ad hoc networks. This technique was designed with energy fairness central to its operation. This algorithm is not a routing algorithm. It works with existing routing protocols to complement their functionality from an energy-efficiency perspective. We show that this technique scales well with increased network traffic and population. We also compare it to the on-demand power management algorithm, a technique specifically designed to reduce idle energy consumption. Our comparison shows that our technique performs better in terms of energy savings and fairness as well as network lifetime extension.

关键词： energy-efficient algorithms mobile ad hoc networks routing and forwarding wireless networks

来源：评论

学校读者我要写书评

暂无评论

A Communication-Aware energy-efficient Graph-Coloring Algorithm for VM Placement in Clouds 4

A Communication-Aware Energy-Efficient Graph-Coloring Algori...

引用

IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI)

作者： Tziritas, Nikos Loukopoulos, Thanasis Khan, Samee U. Xu, Cheng-Zhong Zomaya, Albert Y. Shenzhen Inst Adv Technol Cloud Comp Dept Shenzhen Peoples R China Univ Thessaly Dept Comp Sci & Biomed Informat Lamia Greece North Dakota State Univ Elect & Comp Engn Fargo ND 58105 USA North Dakota State Univ Div Comp & Network Syst Fargo ND 58105 USA Natl Sci Fdn Alexandria VA USA Univ Sydney Sch Informat Technol Sydney NSW Australia

ISBN: (纸本)9781538693803

The problem of virtual machine (VM) consolidation has received a lot of attention over the past years. Most of the proposed techniques tackling the VM consolidation problem focus on energy consumption ignoring the network traffic incurred within the system. Redundant network traffic may be crucial for the sustainability of cloud computing systems. To tackle the aforementioned problem, we propose a communication-aware graph-coloring algorithm placing the VMs in the underlying system in an energy efficient manner. Specifically, the proposed algorithm considers migrating VMs in batches resulting in energy efficient placements against approaches tackling single VM migrations. We have conducted an experimental evaluation to show the superiority of the proposed algorithm against state-of-the-art algorithms in terms of network overhead reduction, while keeping the energy consumption at low levels.

关键词： component VM consolidation communication-aware algorithms energy-efficient algorithms

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Clustering Construction for Wireless Sensor Networks

A Dynamic Clustering Construction for Wireless Sensor Networ...

引用

International Symposium on Collaborative Technologies and Systems

作者： Capo-Chichi, Eugene Pamba Martins, David Guyennet, Herve Felea, Violeta Univ Franche Comte Dept Comp Sci F-25030 Besancon France

ISBN: (纸本)9781424445851

Research in sensor networks has focused on development of energy efficient infrastructures. In this article, we introduce a new approach to organize sensor networks in clusters in order to reduce energy dissipation. Our contribution is an heuristic to define the number of clusters and also an efficient manner to choose cluster heads by minimizing the distance between cluster heads and its cluster nodes. Inspired from LEACH, a well-known TDMA cluster-based sensor network architecture, we introduce a new method for building and maintaining clusters using the paradigm of a soccer team. In this work, a new algorithm called OH-Kmeans, based on the K-means algorithm, is used to find dynamically the number of clusters and form them, guaranteeing direct transmission between cluster heads and cluster nodes.

关键词： Wireless sensor networks clustering security energy-efficient algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：