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

Energy-Efficient Scheduling Based on Task Migration Policy Using DPM for Homogeneous MPSoCs

computers, Materials & Continua 2023年第1期74卷 965-981页

作者： Hamayun Khan Irfan Ud din Arshad Ali Sami Alshmrany Department of Electrical Engineering Faculty of Engineering&Technology Superior University Lahore54000Pakistan Department of Computer Science Faculty of Computer Science&IT Superior University Lahore54000Pakistan Faculty of Computer and Information Systems Islamic University of MadinahAl Madinah Al Munawarah42351Saudi Arabia

Increasing the life span and efficiency of Multiprocessor System on Chip(MPSoC)by reducing power and energy utilization has become a critical chip design challenge for multiprocessor *** the advancement of technology,the performance management of central processing unit(CPU)is *** densities and thermal effects are quickly increasing in multi-core embedded technologies due to shrinking of chip *** energy consumption reaches a threshold that creates a delay in complementary metal oxide semiconductor(CMOS)circuits and reduces the speed by 10%–15%because excessive on-chip temperature shortens the chip’s life *** this paper,we address the scheduling&energy utilization problem by introducing and evaluating an optimal energy-aware earliest deadline first scheduling(EA-EDF)based technique formultiprocessor environments with task migration that enhances the performance and efficiency in multiprocessor systemon-chip while lowering energy and power *** selection of core andmigration of tasks prevents the system from reaching itsmaximumenergy utilization while effectively using the dynamic power management(DPM)*** in the execution of tasks the temperature and utilization factor(u_(i))on-chip increases that dissipate more *** proposed approach migrates such tasks to the core that produces less heat and consumes less power by distributing the load on other cores to lower the temperature and optimizes the duration of idle and sleep times across multiple *** performance of the EA-EDF algorithm was evaluated by an extensive set of experiments,where excellent results were reported when compared to other current techniques,the efficacy of the proposed methodology reduces the power and energy consumption by 4.3%–4.7%on a utilization of 6%,36%&46%at 520&624 MHz operating frequency when particularly in comparison to other energy-aware methods for *** are running and accurately scheduled to make an energy-efficient

关键词： Dynamic power management dynamic voltage&frequency scaling dynamic thermal management multiprocessor system on chip complementary metal oxide semiconductor reliability

来源：评论

学校读者我要写书评

暂无评论

Brain inspired iontronic fluidic memristive and memcapacitive device for self-powered electronics

引用

Microsystems & Nanoengineering 2025年第1期11卷 465-476页

作者： Muhammad Umair Khan Bilal Hassan Anas Alazzam Shimaa Eissa Baker Mohammad Center for Cyber-Physical Systems-System on Chip Lab Khalifa UniversityAbu Dhabi 127788UAE Department of Computer and Information Engineering Khalifa UniversityAbu Dhabi 127788UAE Department of Electrical Engineering Khalifa UniversityAbu Dhabi 127788UAE Division of Engineering New York UniversityAbu Dhabi 129188UAE Department of Mechanical and Nuclear Engineering Khalifa UniversityAbu Dhabi 127788UAE Department of Chemistry Khalifa UniversityAbu Dhabi 127788UAE

Ionic fluidic devices are gaining interest due to their role in enabling self-powered neuromorphic computing *** this study,we present an approach that integrates an iontronic fluidic memristive(IFM)device with low input impedance and a triboelectric nanogenerator(TENG)based on ferrofluid(FF),which has high input *** incorporating contact separation electromagnetic(EMG)signals with low input impedance into our FF TENG device,we enhance the FF TENG’s performance by increasing energy harvesting,thereby enabling the autonomous powering of IFM devices for self-powered ***,replicating neuronal activities using artificial iontronic fluidic systems is key to advancing neuromorphic *** fluidic devices,composed of soft-matter materials,dynamically adjust their conductance by altering the solution *** developed voltage-controlled memristor and memcapacitor memory in polydimethylsiloxane(PDMS)structures,utilising a fluidic interface of FF and polyacrylic acid partial sodium salt(PAA Na^(+)).The confined ion interactions in this system induce hysteresis in ion transport across various frequencies,resulting in significant ion memory *** IFM successfully replicates diverse electric pulse patterns,making it highly suitable for neuromorphic ***,our system demonstrates synapse-like learning functions,storing and retrieving short-term(STM)and long-term memory(LTM).The fluidic memristor exhibits dynamic synapse-like features,making it a promising candidate for the hardware implementation of neural *** TENG/EMG device adaptability and seamless integration with biological systems enable the development of advanced neuromorphic devices using iontronic fluidic materials,further enhanced by intricate chemical designs for self-powered electronics.

关键词： iontronic memristive ionic fluidic devices memcapacitive ff teng s ff teng fluidic triboelectric nanogenerator teng based

来源：评论

学校读者我要写书评

暂无评论

Near-Optimal Scheduling for IC Packaging Operations Considering Processing-Time Variations and Factory Practices

引用

IEEE Robotics and Automation Letters 2024年第4期9卷 3878-3885页

作者： Tsai, Tsung-Han Yan, Bing Luh, Peter B. Yang, Haw-Ching Bragin, Mikhail A. Cheng, Fan-Tien National Cheng Kung University Institute of Manufacturing Information and Systems Tainan701401 Taiwan Rochester Institute of Technology Department of Electrical and Microelectronic Engineering RochesterNY14623 United States University of Connecticut Department of Electrical and Computer Engineering StorrsCT06269 United States National Taiwan University Department of Electrical Engineering Taipei106329 Taiwan National Kaohsiung University of Science and Technology Department of Electrical Engineering Kaohsiung824005 Taiwan University of California Department of Electrical and Computer Engineering RiversideCA92507 United States

Due to the short life cycles of electronic products, trial run lots of new products are crucial in IC packaging for production verification and engineering adjustments. The processing time of trial run lots may differ significantly from production lots due to engineering adjustments and is difficult to predict without sufficient historical data. The purpose of this letter is to develop a framework for near-optimal scheduling of IC packaging considering processing time variations and factory practices. Using an orthogonal greedy algorithm and recurrent neural network, this framework extracts key features and predicts the processing times of trial run lots and production lots for each operation using these algorithms. After formulating the scheduling problem in an integer linear programming form, an ordinal optimization method is embedded within the decomposition and coordination framework to obtain dynamic and near-optimal schedules in a computationally efficient manner. This approach can improve the efficiency of IC packaging and potentially other operations by optimizing lot scheduling, reducing production tardiness, and increasing productivity in the factory, paving the way for self-optimizing factories in the future. © 2016 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

FedStar Caching: Decision Center Assisted Federated Cooperative Edge Caching 4

FedStar Caching: Decision Center Assisted Federated Cooperat...

引用

4th IEEE International Conference on Human-Machine systems, ICHMS 2024

作者： Gharib, Sirvan Kesargheh, Mohammad Mansour Seyedmohammadi, S. Jamal Hajiakhondi, Zohreh Abouei, Jamshid Plataniotis, Konstantinos N. Yazd University Dept. Of Electrical Engineering Yazd Iran Concordia University Inst. Of Information Systems Engineering Montreal Canada Concordia University Dept. Of Electrical Engineering Montreal Canada University Of Toronto Dept. Of Electrical And Computer Engineering Toronto Canada

ISBN: (纸本)9798350315790

With the explosion of data, Wireless Edge Caching (WEC) has become a promising approach for locally accessing cached contents. Due to the limited storage capacity of local caching devices and the varying preferences of humans for content, it is necessary to predict popular contents. In this article, we will address two distinct objectives: 1) Popularity prediction of the content that should be cached at the edge to effectively utilize edge device memory. 2) Edge devices collaboration for efficient content delivery. Accordingly, we propose an FL-based Star Cooperative Caching (FedStar Caching), utilizing a Star network topology for realizing an efficient cooperation among Femto-cell Access Points (FAPs) using a Decision Center (DC) to enhance power efficiency and delay performance. Considering human sensitivity to privacy, collecting users' data on a central server is not desirable, therefore, we leverage Federated Learning (FL) to alleviate this challenge. Simulation results demonstrate that the proposed method outperforms alternatives in terms of cache efficiency, as well as delay and power consumption. © 2024 IEEE.

关键词： Stars

来源：评论

学校读者我要写书评

暂无评论

Accelerated gradient methods for nonconvex optimization: Escape trajectories from strict saddle points and convergence to local minima

arXiv

引用

arXiv 2023年

作者： Dixit, Rishabh Gürbüzbalaban, Mert Bajwa, Waheed U. Department of Electrical and Computer Engineering Departments of Electrical & Computer Engineering Management Science and Information Systems and Statistics United States Departments of Electrical & Computer Engineering and Statistics

This paper considers the problem of understanding the behavior of a general class of accelerated gradient methods on smooth nonconvex functions. Motivated by some recent works that have proposed effective algorithms, based on Polyak’s heavy ball method and the Nesterov accelerated gradient method, to achieve convergence to a local minimum of nonconvex functions, this work proposes a broad class of Nesterov-type accelerated methods and puts forth a rigorous study of these methods encompassing the escape from saddle-points and convergence to local minima through a both asymptotic and a nonasymptotic analysis. In the asymptotic regime, this paper answers an open question of whether Nesterov’s accelerated gradient method (NAG) with variable momentum parameter avoids strict saddle points almost surely. This work also develops two metrics of asymptotic rate of convergence and divergence, and evaluates these two metrics for several popular standard accelerated methods such as the NAG, and Nesterov’s accelerated gradient with constant momentum (NCM) near strict saddle points. In the local regime, this work provides an analysis that leads to the "linear" exit time estimates from strict saddle neighborhoods for trajectories of these accelerated methods as well the necessary conditions for the existence of such trajectories. Finally, this work studies a sub-class of accelerated methods that can converge in convex neighborhoods of nonconvex functions with a near optimal rate to a local minima and at the same time this sub-class offers superior saddle-escape behavior compared to that of NAG. Copyright © 2023, The Authors. All rights reserved.

关键词： Gradient methods

来源：评论

学校读者我要写书评

暂无评论

Invertibility of Discrete-Time Linear systems with Sparse Inputs 63

Invertibility of Discrete-Time Linear Systems with Sparse In...

引用

63rd IEEE Conference on Decision and Control, CDC 2024

作者： Poe, Kyle Mallada, Enrique Vidal, Rene University of Pennsylvania Applied Mathematics and Computational Science Group PA19104 United States Johns Hopkins University Mallada Is with the Department of Electrical and Computer Engineering MD21218 United States University of Pennsylvania Radiology Computer and Information Science Statistics and Data Science Departments of Electrical and Systems Engineering PA19104 United States

ISBN: (纸本)9798350316339

One of the fundamental problems of interest for discrete-time linear systems is whether its input sequence may be recovered given its output sequence, a.k.a. the left inversion problem. Many conditions on the state space geometry, dynamics, and spectral structure of a system have been used to characterize the well-posedness of this problem, without assumptions on the inputs. However, certain structural assumptions, such as input sparsity, have been shown to translate to practical gains in the performance of inversion algorithms, surpassing classical guarantees. Establishing necessary and sufficient conditions for left invertibility of systems with sparse inputs is therefore a crucial step toward understanding the performance limits of system inversion under structured input assumptions. In this work, we provide the first necessary and sufficient characterizations of left invertibility for linear systems with sparse inputs, echoing classic characterizations for standard linear systems. The key insight in deriving these results is in establishing the existence of two novel geometric invariants unique to the sparseinput setting, the weakly unobservable and strongly reachable subspace arrangements. By means of a concrete example, we demonstrate the utility of these characterizations. We conclude by discussing extensions and applications of this framework to several related problems in sparse control. © 2024 IEEE.

关键词： State space methods

来源：评论

学校读者我要写书评

暂无评论

A deep decentralized privacy-preservation framework for online social networks

引用

Blockchain(Research and Applications) 2024年第4期5卷 163-174页

作者： Samuel Akwasi Frimpong Mu Han Emmanuel Kwame Effah Joseph Kwame Adjei Isaac Hanson Percy Brown School of Computer Science and Communication Engineering Jiangsu UniversityZhenjiang212013China Department of Computer Engineering Ghana Communication Technology UniversityAccraPMB 100Ghana Department of Electrical&Electronic Engineering Ghana Communication Technology UniversityAccraPMB 100Ghana Department of Computer Science and Information Systems Ashesi UniversityAccra3042Ghana Department of Telecommunication Engineering Ghana Communication Technology UniversityAccraPMB 100Ghana

This paper addresses the critical challenge of privacy in Online Social Networks(OSNs),where centralized designs compromise user *** propose a novel privacy-preservation framework that integrates blockchain technology with deep learning to overcome these *** methodology employs a two-tier architecture:the first tier uses an elitism-enhanced Particle Swarm Optimization and Gravitational Search Algorithm(ePSOGSA)for optimizing feature selection,while the second tier employs an enhanced Non-symmetric Deep Autoencoder(e-NDAE)for anomaly ***,a blockchain network secures users’data via smart contracts,ensuring robust data *** tested on the NSL-KDD dataset,our framework achieves 98.79%accuracy,a 10%false alarm rate,and a 98.99%detection rate,surpassing existing *** integration of blockchain and deep learning not only enhances privacy protection in OSNs but also offers a scalable model for other applications requiring robust security measures.

关键词： Preprocessing Privacy-preservation Blockchain Deep learning Online social network

来源：评论

学校读者我要写书评

暂无评论

Evolutionary-based Coordination of Multi-Robot systems with Dynamic Constraints

Evolutionary-based Coordination of Multi-Robot Systems with ...

引用

2024 systems and information engineering Design Symposium, SIEDS 2024

作者： Shah, Vihar Heeter, Matthew Vallarino, Jose Sherman, Patrick Bramblett, Lauren Bezzo, Nicola University of Virginia Department of Systems and Information Engineering CharlottesvilleVA22903 United States University of Virginia Department of Electrical and Computer Engineering CharlottesvilleVA22903 United States

ISBN: (纸本)9798350385144

Large-scale manufacturing facilities and power plants comprise numerous subsystems that require consistent monitoring and inspection to ensure reliable and secure operations. The use of multiple robotic systems is an expanding, robust, and cost-effective solution for such operations. To enable automated infrastructure monitoring, there are many challenges, such as path planning and task allocation for multiple robots and dynamic constraints. We formulate such challenges as a multiple Traveling Salesman Problem (mTSP) and propose an efficient task assignment solution that uses an evolutionary algorithm considering priority, energy, and time constraints. Our solution incorporates: A digital twin of a monitored environment, A? and artificial potential field methods for path planning and navigation, and human-in-The-loop prioritization. We validate the proposed method with state-of-The-Art simulations in Gazebo/ROS for unmanned ground vehicles (UGVs) in cluttered environments. © 2024 IEEE.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Explainability and Interpretability in Decision Trees and Agent Based Modelling When Approximating Financial Time Series. A Matter of Balance with Performance 8

Explainability and Interpretability in Decision Trees and Ag...

引用

8th International Conference on Computational Intelligence and Applications, ICCIA 2023

作者： Layfield, Colin Neri, Filippo University of Malta Department of Computer Information Systems Msida Malta University of Naples Department of Electrical and Computer Engineering Naples Italy

ISBN: (纸本)9798350339741

The paper discusses the notions of explainability and interpretability when using decision tree learning and agent based modeling to approximate financial time series. And how they related to the selected learning algorithm. As experimental context, the LFABS system for agent based modeling is used together with C4.5 for decision tree learning. The paper proposes the following definitions for interpretability: being able to make sense of a learning system output. And explainability: understanding how that output was generated. The study's goal is achieved by comparing the different knowledge representations used by the two systems. © 2023 IEEE.

关键词： Autonomous agents

来源：评论

学校读者我要写书评

暂无评论

A Method of Predicting Worker's Skill Level in SMEs for Estimating Changeover Time 13

A Method of Predicting Worker's Skill Level in SMEs for Esti...

引用

13th International Conference on the Internet of Things, IoT 2023

作者： Shibuya, Yuto Yamauchi, Taiga Ogihara, Shogo Kawasaki, Takafumi Okura, Yuki Iwamoto, Takeshi Electrical and Computer Engineering Graduate School of Engineering Toyama Prefectural University Toyama Japan Department of Information Systems Engineering Toyama Prefectural University Toyama Japan

ISBN: (纸本)9798400708541

IoT has been introduced to improve production efficiency in small and medium-sized manufacturing companies, and it is mainly aimed at measuring machinery statuses. The improvement of changeover time is significant for production efficiency and the changeover time is depends on the skill level of each worker. Thus, measuring the statuses of human-mediated processes is needed. Moreover, if the skill levels of each worker were quantified, it would be possible to predict setup changeover time based on the quantitative evaluation. Therefore, we define the components of worker proficiency in small and medium-sized manufacturing companies, measure and quantify them, and estimate the proficiency level of each worker. This study enables accurate prediction of setup time by realizing the above. It was 60% to predict the setup changeover time more accurately than the scheduled time, and some components showed a proportional relationship with skill level. © 2023 Owner/Author.

关键词： Production efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：