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

An optimal sensor placement algorithm (O-SPA) for improving tracking precision of human activity in real-world healthcare systems

引用

COMPUTER COMMUNICATIONS 2019年 148卷 9-16页

作者： Alarifi, Abdulaziz AlZubi, Ahmad Ali Al-Maitah, Mohammed Al-Kasasbeh, Basil King Saud Univ Community Coll Comp Sci Dept Riyadh Saudi Arabia Arab Open Univ Fac Comp Studies Jeddah Saudi Arabia

In this article, an Optimal Sensor placement algorithm (O-SPA) is designed for improving the precision of human activity. This placement algorithm is designed based on the fact of improving the Rate of Observation (RO) and sensing in the day-to-day activities of human. SPA for RO and sensing improves the analysis precision by accumulating and classifying useful sensor information. Useful sensor information is achieved by approximating the sensor data mitigating positioning errors. The analysis process differentiates useful and less preference information from the placed sensors to reduce complications in classification. This device positioning algorithm is more specific for the precision of data accumulation and manipulation by reducing sensing errors to improve the efficiency of healthcare systems The efficiency of healthcare systems with optimal sensor deployment is measured in terms of accuracy (98.9%), classification time (0.079s), replications (4.12), recall (96.29%), and error factor (0.000021). The efficiency results are the best compared to Hybrid sensing aided human activity recognition (HHAR), Multi-sensor fusion with ensemble pruning system (MSF-EP) and Activities of daily living Compressive sensing (ADL).

关键词： Feature extraction Information sensing Naive Bayes classifier Sensor positioning Wearable sensor placement algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimized Charge Scheduling of Plug-In Electric Vehicles using Modified placement algorithm 9

Optimized Charge Scheduling of Plug-In Electric Vehicles usi...

引用

International Conference on Computer Communication and Informatics (ICCCI)

作者： Mohammed, Sheik S. Ahamed, Imthias T. P. Devaraj, D. TKM Coll Engn Dept Elect & Elect Engn Kollam India Kalasalingam Acad Res & Educ Sch Elect Technol Srivilliputhur India

ISBN: (纸本)9781538682593

Electric Vehicles (EV) are found to be promising alternatives for IC engine vehicles as it significantly reduces the fossil fuel usage and in turn, the environmental issues such as CO2 emission, global warming caused by burning the fuel. Energy Storage System (ESS) is the heart of the EV and the batteries need to be charged in a regular interval or upon requirement for the operation of vehicle. EVs are connected to the charging station for charging and the charging is generally scheduled based on the given conditions for optimized charging. The scheduling algorithm creates a charging profile for the EVs to charge the batteries in such a way to meet the objectives of scheduling. This paper presents the electric vehicle charge scheduling using Modified placement algorithm. The objective of the proposed algorithm is to minimize the cost of charging. The algorithm is developed in MATLAB. Electric Vehicles with different power rating and rate of charging are selected to study the performance and accuracy of scheduling algorithm. The charge scheduling of selected vehicles are analyzed based on Time of Use Pricing (ToUP) tariff scheme.

关键词： Electric Vehicle (EV) placement algorithm charge scheduling Time of Use Pricing (ToUP) MATLAB

来源：评论

学校读者我要写书评

暂无评论

Research on relay node placement algorithm based on its capacity limitation in WSN

Research on relay node placement algorithm based on its capa...

引用

International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)

作者： Shouqiang Wang Zengxiao Chi Shen Zhang School of Information Science and Electrical Engineering Shandong Jiaotong University Jinan China

ISBN: (纸本)9781728105529

Energy consumption problem is one of the key issues in Wireless Sensor Network (WSN). Usually sensor nodes are far from one or more sink nodes. In such a case, it calls for deploying some relay nodes as the interval nodes to transmit data from sensor nodes to sink nodes. A relay node placement algorithm in two-tiered WSN model is proposed in this thesis. This algorithm first constructs an optimum spanning tree for unlimited number of relay nodes. Then, a greedy strategy was put forward to remove some relay nodes from the tree. Under the restriction that each relay node must satisfy its communication capacity limitation, the greedy strategy aims to minimize the total energy consumption to prolong the lifetime of whole network.

关键词： Wireless sensor network Sensor node Relay node Energy consumption Trunk Node Wireless sensor networks energy consumption WSN gene Ganglia placement algorithm

来源：评论

学校读者我要写书评

暂无评论

Online placement and scheduling algorithm for reconfigurable cells in self-repairable field-programmable gate array systems

引用

COMPUTERS & ELECTRICAL ENGINEERING 2018年 67卷 836-850页

作者： Pradeep, C. Eapen, Madhuri Elsa Joby, P. P. Kizhakkethottam, Jubilant J. Mar Baselios Christian Coll Engn & Technol Peermade Kerala India MBC Coll Engn & Technol Ctr Res Initiat Sci & Engn Peermade Kerala India Saintgits Coll Engn Kottayam Kerala India

Most of the high-end very-large-scale integration- (VLSI-) based systems use a field programmable gate array (FPGA) as their core component. As the complexity of systems increases, the chances of fault occurrence also increase. For systems that are part of safety critical and mission-critical applications, even a single fault can result in entire mission failure. Fault tolerance techniques need to be installed in such systems to ensure reliable, prolonged operation in spite of fault occurrence. The level of fault tolerance exhibited in nature is very remarkable. Scientists are trying to reach that level of fault tolerance in the electronics world as well, which is not always completely acquirable. Basically, fault tolerance in an FPGA is achieved by the use of spare modules, which leads to high area overheads and routing complexity. The higher the number of faults to be handled, the greater the number of spares that will be required. Partial reconfiguration has always been a proven technique to improve the efficiency and flexibility of FPGAs. This paper discusses a multiple-fault repair algorithm for FPGA-based reconfigurable systems, using dynamic runtime partial reconfiguration, in order to relocate faulty modules. Three variants or cases of repair using the algorithm are discussed and demonstrated, namely, placement with the best resource utilization, placement with the least routing overhead, and a case to generate continuous free space for the relocation of a faulty module. The main advantage of the algorithm is its flexibility, which means that it can be used according to user demands and system lifetime requirements. Maximum care is taken to eliminate chances of an un-repaired fault or a repair that degrades the performance of the system. The algorithm can handle multiple permanent faults with the best resource utilization and the least overheads. The performance of the algorithm is analyzed quantitatively, while a comparison is made with some previous studie

关键词： Relocation Reconfigurable modules Self-repair placement algorithm FPGA Dynamic runtime partial reconfiguration

来源：评论

学校读者我要写书评

暂无评论

MAP-MIND: An Offline algorithm for Optimizing Game Engine Module placement in Cloud Gaming

引用

IEEE ACCESS 2024年 12卷 44905-44921页

作者： Lotfimahyari, Iman De Giovanni, Luigi Gadia, Davide Giaccone, Paolo Maggiorini, Dario Palazzi, Claudio E. Politecn Torino Dept Elect & Telecommun I-10129 Turin Italy Univ Padua Dept Math I-35131 Padua Italy Univ Milan Dept Comp Sci I-20133 Milan Italy

Online gaming has seen a significant surge in popularity, becoming a dominant form of entertainment worldwide. This growth has necessitated the evolution of game servers from centralized to distributed models, leading to the emergence of distributed game engines. These engines allow for the distribution of game engine modules (GEMs) across multiple servers, improving scalability and performance. However, this distribution presents a new challenge: the game engine module placement problem. This problem involves strategically placing GEMs to maximize the number of accepted placement requests while minimizing the delay experienced by players, a critical factor in enhancing the gaming experience. The problem can be formulated as an Integer Linear Programming (ILP) model, which provides an optimal solution but suffers from high computational complexity, making it impractical for real-world applications. To address this challenge, this paper introduces two novel heuristic algorithms, MAP-MIND and MAP-MIND*. The MAP-MIND algorithm demonstrates superior performance, achieving near-optimal delay and more than 92% GEM request acceptance in the worst heterogeneous scenarios. The MAP-MIND* algorithm, while slightly under-performing MAP-MIND in terms of delay, proves to be significantly faster, making it a viable alternative for real-world applications with equal GEM request acceptance. The trade-off between the two algorithms offers a flexible approach to GEM placement, balancing performance and computational efficiency.

关键词： Cloud gaming distributed game engines placement algorithm

来源：评论

学校读者我要写书评

暂无评论

An FPGA fast combination placement optimization algorithm research

An FPGA fast combination placement optimization algorithm re...

引用

2017 IEEE 第2届先进信息技术,电子与自动化控制国际会议(IAEAC 2017)

作者： Kang Wang Ning Xu Kai Hu School of Information Engineering Wuhan University of Technology The 58th Research Institute CETC

With the scale of FPGA increasingly becoming larger than before, how to spend less time to reduce the total length of the interconnections to ensure the quality of the placement algorithm needs to be

ISBN: (纸本)9781467389808

With the scale of FPGA increasingly becoming larger than before, how to spend less time to reduce the total length of the interconnections to ensure the quality of the placement algorithm needs to be

关键词： placement Quadratic analytic algorithm Low temperature simulated annealing Local optimization local optimization placement placement algorithm fast speed Field programmable gate arrays Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

A Parallel GPU Implementation of the TimberWolf placement algorithm 12

A Parallel GPU Implementation of the <i>TimberWolf</i> Place...

引用

12th International Conference on Information Technology: New Generations ITNG

作者： Al-Kawam, Ahmad Harmanani, Haidar M. Lebanese Amer Univ Dept Math & Comp Sci Byblos 14012010 Lebanon

ISBN: (纸本)9781479988280

GPUs have been gaining acceptance in the electronic design automation field as attractive platforms for implementing and accelerating computationally extensive applications. Researchers agree that it is critical that EDA algorithms exploit future platforms and explore the use of parallel algorithms as we move to the manycore era. This paper describes the implementation of the TimberWolf placement algorithm using CUDA and demonstrates the applicability of GPUs in accelerating electronic design automation tools. The algorithm has been implemented on a Xeon Workstation using C, and achieved a substantial acceleration on an Nvidia Tesla C2070 card.

关键词： CUDA VLSI Design Automation VLSI placement electronic design automation placement algorithm wolf acceleration Computer-Aided Design Parallel algorithms Lumber and lumbering GRAPPER PICK UP Graphics Processing Unit Platform ACCEPTANCE

来源：评论

学校读者我要写书评

暂无评论

Research on the Multi-tenant placement Genetic algorithm Based on Eucalyptus Platform 12

Research on the Multi-tenant Placement Genetic Algorithm Bas...

引用

12th International Conference on Computational Intelligence and Security (CIS)

作者： Wang, Feng Li, Jun Huai Zhang, Jing Huang, Qiang Xian Univ Technol Fac Comp Sci & Engn Xian Peoples R China Xian Univ Technol Inst Water Resources & Hydroelect Engn Xian Peoples R China

ISBN: (纸本)9781509048403

This paper describes a database system with tenant technology on Eucalyptus platform for a rural drinking water supply system. This database use a sharing model to store data and a tenant placement algorithm to properly put tenants in virtual machine therefore it can ensure the service quality for the tenants with the minimum use of hardware resources. The experiment results show that the tenant placement algorithm is feasible and effective.

关键词： Eucalyptus Multi-tenant placement algorithm

来源：评论

学校读者我要写书评

暂无评论

Signaling Storm Mitigation by Geographically Distributed C-plane NF placement and Routing 10

Signaling Storm Mitigation by Geographically Distributed C-p...

引用

10th International Conference on Network Softwarization (NetSoft)

作者： Kurata, Masayuki Ikami, Akio Itahara, Sohei Suzuki, Masaki KDDI Res Inc Fujimino Japan

ISBN: (纸本)9798350369588;9798350369595

In mobile networks, network performance can be severely degraded by a signaling storm, a phenomenon characterized by control plane (C-plane) congestion due to excessive signaling messages. This paper identifies congestion of inter-site links and overload of a specific NF instance as factors leading to a signaling storm. To address these problems, we propose a combined placement and routing algorithm approach. Firstly, our joint placement and routing algorithms perform geographically distributed deployment of C-plane NF instances according to the fluctuating mobility patterns of each user equipment (UE). Secondly, our routing algorithm identifies an appropriate C-plane NF instance to manage each UE, considering both the utilization rate and the number of contexts possessed by each NF instance. Extensive simulation evaluations demonstrate that our proposed methods significantly reduce inter-site signaling messages compared to existing placement scenarios. Furthermore, the dispersion of C-plane NF instances' utilization rate is reduced, enhancing network performance and efficiency.

关键词： Signaling storm Mobile computing Distributed computing placement algorithm Routing algorithm

来源：评论

学校读者我要写书评

暂无评论

The Road Less Traveled: Congestion-Aware NoC placement and Packet Routing for FPGAs 34

The Road Less Traveled: Congestion-Aware NoC Placement and P...

引用

34th International Conference on Field-Programmable Logic and Applications (FPL)

作者： Shahrouz, Soheil Gholami Betz, Vaughn Univ Toronto Dept Elect & Comp Engn Toronto ON Canada

ISBN: (纸本)9798331530082;9798331530075

To help scale to ever-larger and more complex designs, recent FPGA architectures now integrate network-on-chips (NoCs). NoCs help transfer high-bandwidth data over long distances within the chip without using scarce low-delay long routing wire segments. While NoC-enhanced FPGAs aid system integration and design reuse, they also complicate FPGA computer-aided design (CAD) flows by introducing new constraints and metrics. placement and routing needs to optimize NoC metrics like latency and bandwidth utilization and avoid link oversubscription (congestion), while simultaneously optimizing the programmable routing resource usage of the design modules attached to NoC routers. In this work we develop several new approaches to reduce NoC congestion while minimizing the impact on other design metrics. First, we incorporate a NoC link congestion cost into the placement engine of the open-source CAD flow, versatile place & route (VPR). Second, we integrate turn model NoC routing algorithms into the placement engine to leverage path diversity to further reduce congestion. On average over a suite of 29 benchmarks combining placement congestion modeling with turn model packet routing reduces NoC congestion by 90.7% at the cost of increasing aggregate bandwidth demand by 4%. In cases where the enhanced placement engine and NoC routing fail to fully resolve congestion, we formulate NoC routing as a boolean satisfiability (SAT) problem. This approach yields significant additional improvements;the combined algorithm reduces congestion by 95.1% compared to the baseline placement. Finally, we enhance the reinforcement learning (RL) agent in VPR's placement engine by introducing a NoC-aware move type, resulting in an 8.8% reduction in wirelength on designs that make extensive use of the NoC.

关键词： FPGA network-on-chip computer-aided design placement algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：