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

design of a multi-hop dynamic consensus algorithm over wireless sensor networks

CONTROL ENGINEERING PRACTICE 2013年第4期21卷 381-394页

作者： Manfredi, Sabato Univ Naples Federico II Dept Elect Engn & Informat Technol I-80125 Naples Italy

In the last few years great attention has been concentrated on the consensus algorithm in a network of agents. A consensus problem in which the agreement value is a distributed estimation of some non-constant quantity of interest is referred to as a dynamic consensus. In practical applications an effective network architecture to support sensing and communication between agents is based on a Wireless Sensor Network (WSN). This paper deals with the design of a fast dynamic consensus algorithm when it is implemented over the WSN. A sufficient stability condition of the dynamic consensus algorithm in the presence of heterogeneous time delays affecting communication through the multi hops of the WSN is introduced and used for consensus algorithm gain design. Moreover, the algorithm implementation by the standard AODV routing protocol is discussed and the best parameter setting to reduce the effect of packet collision phenomena on the performance of the consensus algorithm is indicated. Several trade-offs between network parameter setting, sensor node technology selection and application performance have to be taken into account by the designer in the implementation of the dynamic consensus algorithm. A representative simulation based design procedure is presented to validate through realistic simulation experiments the proposed design approach. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Dynamic consensus Wireless sensor networks Stability algorithm design AODV protocol Zig-Bee protocol

来源：评论

学校读者我要写书评

暂无评论

design of coverage algorithm for mobile sensor networks based on virtual molecular force

引用

COMPUTER COMMUNICATIONS 2020年第0期150卷 269-277页

作者： Liu, Song Zhang, Runlan Shi, Yongheng Guizhou Normal Univ Key Lab Informat & Comp Sci Guiyang 550003 Peoples R China Guizhou Vocat Technol Inst Informat Technol Coll Guiyang 550023 Peoples R China

General virtual force algorithm, when the density of sensor nodes is large in the monitoring area, there are some shortcomings, such as uneven distribution of nodes, more overlap of coverage area and so on. In view of these shortcomings, based on the basic idea of air molecular theory, a virtual molecular force model of mobile sensor networks is established, and the virtual molecular force algorithm for node deployment and mobile coverage of mobile sensor networks is given. The virtual molecular force algorithm assumes that there is interaction between nodes in mobile sensor networks, and the resultant force of these forces constitutes the resultant force network of sensor nodes in the monitoring area, which drives the sensor nodes to move to the corresponding location to repair the monitoring blind area, so as to maximize the coverage of the network. In order to verify the feasibility and effectiveness of the virtual molecular force algorithm, the virtual molecular force algorithm for mobile sensor network node deployment and mobile coverage is simulated and analysed by using MATLAB simulation tool. The simulation results show that the virtual molecular force algorithm can make the sensor nodes repair the monitoring blind area efficiently and quickly, and maximize the monitoring coverage area of the sensor network. In terms of repairing monitoring blind areas and improving network coverage, the virtual molecular force algorithm is superior to other network coverage algorithms such as general virtual force algorithm.

关键词： Mobile sensor network Network coverage Monitoring blind area algorithm design Simulation

来源：评论

学校读者我要写书评

暂无评论

Logarithmic Weighted Random Selector algorithm: A Novel Approach for Biasing Selection Based on Positional Order Without Hyperparameters 17th

Logarithmic Weighted Random Selector Algorithm: A Novel Appr...

引用

17th Workshop of Hybrid Intelligent Systems, HIS 2024, 17th Workshop on Intelligent Learning Environments, WILE 2024 and 6th Workshop on New Trends in Computational Intelligence and Applications, CIAPP 2024, held in conjunction with Mexican International Conference on Artificial Intelligence, MICAI 2024

作者： Ramos Herrera, Iván Alejandro Autonomous University of Aguascalientes Aguascalientes Mexico

ISBN: (纸本)9783031838781

The "Logarithmic Weighted Random Selector" (LWRS) introduces a novel algorithm designed for selecting randomly one item from a list, with the bias that the further to the beginning of the list each one is, the more likely it is to be selected. Unlike traditional selection and sampling methods that rely on numerical fitness scores or require hyperparameter tuning, LWRS employs a logarithmic weighting mechanism to naturally favor items based on their position. It arose from the problem of requiring a method that allows weighting a selection based on the order of preference on a list of elements, for phenomena for which numerical weighting values are unknown but only their order, which unlike algorithms such as Rank-based Selection, does not require configuration of hyperparameters. Different mechanisms were explored, such as a Linear Selection method and Exponential Selection. Discovering that utilizing a logarithmic scale, LWRS achieves a non-numerical preference bias, distinguishing itself from classic methods of weighted random sampling as Fitness-proportionate selection and Tournament Selection, which do require defined numerical weights, contributing to the field with a straightforward, parameter-free approach to weighted random selection. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： algorithm design Computer Science Evolutionary Computing Random Sampling Randomized algorithm Selection Method

来源：评论

学校读者我要写书评

暂无评论

design of cloud computing task offloading algorithm based on dynamic multi-objective evolution

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2021年 122卷 144-148页

作者： Hu, Su Xiao, Yinhao Guangdong Univ Finance & Econ Sch Informat Sci Guangzhou 510320 Guangdong Peoples R China

The traditional cloud computing task offloading algorithm consumes abundant energy in task scheduling, which results in a longer average task waiting time. For this reason, a cloud computing task offloading algorithm based on dynamic multi-objective evolution is proposed in this research. In order to ensure the parallel completion of multiple tasks, the dynamic multi-objective evolution method is used to construct the cloud computing task scheduling model and complete the cloud computing task scheduling. Then, based on the calculated effectiveness and validity of energy consumption to complete the initial operation distribution and offloading priority, the time and cost of task offloading are calculated according to the raking results of task offloading priority. The cloud computing tasks are distributed with minimum time and minimum cost as the goal. At the same time, the trade-off coefficients of all utility parameters are effectively combined and dynamically adjusted according to the battery capacity of mobile terminal, in order to achieve the offloading of cloud computing tasks. The average task carrying time, average task waiting time and average task completion time are selected as the parameters to evaluate the algorithm performance. The experimental results show that compared with the existing algorithms, the proposed algorithm shows the best performance, which fully proves the feasibility of the proposed algorithm. (C) 2021 Elsevier B.V. All rights reserved.

关键词： Dynamic multi-objective evolution Cloud computing Computing task Offloading algorithm design

来源：评论

学校读者我要写书评

暂无评论

A design Method of Children Playground Based on Bionic algorithm

A Design Method of Children Playground Based on Bionic Algor...

引用

23rd International Conference on Human-Computer Interaction (HCII)

作者： Yue, Fei Tian, Wenda Shidujaman, Mohammad Tsinghua Univ Acad Arts & Design Beijing 100030 Peoples R China

ISBN: (纸本)9783030784683;9783030784676

A reasonable and healthy playground is an important guarantee for children to develop cognition through physical games. H However, due to the influence of early childhood psychology and the popularity of stereotypes, the existing industrialized production of children's play space has been defined and designed from the perspective of adults. With the help of interdisciplinary thinking and tools, based on the theory of child psychology and the circular game system, we propose a new method of children's playground design. At first, we reviewed the fallacies of the past children's playground design and their causes and summarized the elements of ideal children's playground construction. Secondly, we introduced the Physarum polycephalum algorithm and brought this algorithm to the path generation of different terrains and environments. Third, we analyze the path and introduce the amoeba bionic algorithm tool to determine the facilities, and then generate a series of play facilities. Finally, we brought this result into the case and discussed its potential applications in interactive design.

关键词： Space design Child-playground interaction algorithm design Children psychology Interactive design

来源：评论

学校读者我要写书评

暂无评论

Coupling the design of Benchmark with algorithm in Landscape-Aware Solver design 19

Coupling the Design of Benchmark with Algorithm in Landscape...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Dreo, Johann Doerr, Carola Semet, Yann Thales Res & Technol Palaiseau France Sorbonne Univ CNRS Paris France

ISBN: (纸本)9781450367486

Following a general trend in artificial intelligence, Evolutionary Computation has, in recent years, witnessed substantial performance gains from landscape-aware selection and parameter tuning of algorithmic modules. Such approaches, however, are critically relying on suitable benchmarks, or training sets, that provide the appropriate blend of performance and generality. With this position paper we argue that, on a landscape analysis basis, the benchmark design problem will form a substantial part of the next-generation of automated, on-demand algorithm design principles.

关键词： landscape-aware heuristics algorithm engineering algorithm design black-box optimization benchmarking benchmark design

来源：评论

学校读者我要写书评

暂无评论

design and implementation of shortest travel path searching based on improved Dijkstra algorithm

Design and implementation of shortest travel path searching ...

引用

International Conference on Mechatronics and Applied Mechanics (ICMAM 2011)

作者： Mo, Taiping Zhao, Huihuang Mo, Wei Xidian Univ Dept Mech & Elect Engn Xidian 710126 Shanxi Peoples R China Hengyang Normal Univ Dept Comp Sci Hunan 421008 Peoples R China Guilin Univ Elect Technol Dept Elect Engn & Automat Guangxi 541004 Peoples R China

ISBN: (纸本)9783037853801

The existing transportation service system in public travel route can not satisfy the people's actual travel need because of various technologies reasons. In our study, we set the tourist attractions as a vertex, and simplified the traditional algorithm for complex network computing. Aim to improve the disadvantage of tradition Dijkstra algorithm, an improve algorithm was proposed to improve the path search efficiency. Then the improved Dijkstra algorithm was applied to tourism path search. The experimental results have illustrated that the improved Dijkstra algorithm can accomplish a better result and improve path search efficiency.

关键词： Shortest path Dijkstra algorithm Tourism path search algorithm design

来源：评论

学校读者我要写书评

暂无评论

A Form design Method of Children's Slide Based on BESO algorithm 24th

A Form Design Method of Children's Slide Based on BESO Algor...

引用

24th International Conference on Human-Computer Interaction, HCI International 2022 (HCII)

作者： Tian, Wenda Qin, Qianhang Tan, Meilun Guangxi Normal Univ Guilin 541000 Peoples R China Tsinghua Univ Art & Design Acad Beijing 100030 Peoples R China

ISBN: (纸本)9783031217036;9783031217043

The BESO algorithm is a bionic algorithm often used in the design of architectural structures. With the help of the BESO algorithm, designers can design structures for buildings, bridges, etc. that are reasonably stressed and consume less material, thus reducing material losses. The forms generated by this algorithm often have a unique aesthetic and bionic character, and from the perspective of an industrial designer, this unique aesthetic is applicable to a wider range of product form designs. Therefore, we propose a new design method for children's slide morphology by combining the BESO algorithm. First, we summarize the fallacies and causes of previous children's slide designs, and summarize the elements of an ideal children's slide form design. Secondly, we review the cases of application of BESO algorithm in building structure design, summarize the shape characteristics of its generated forms, and bring the algorithm into the process of generating the forms of various types of children's slides to obtain different children's slide forms. Third, we optimize the design of different slide shapes generated by the algorithm, and then obtain a series of children's slide shape design solutions with unique aesthetics. Finally, we bring these structures into the case study and discuss the impact brought by human-computer interaction in the design process.

关键词： Children's slide Bionic morphology design algorithm design Interactive design

来源：评论

学校读者我要写书评

暂无评论

algorithm and Architecture Co-design for High-Performance Digital Signal Processing

Algorithm and Architecture Co-Design for High-Performance Di...

引用

作者： Kim, Jung Kuk University of Michigan

学位级别：Ph.D., Doctor of Philosophy

CMOS scaling has been the driving force behind the revolution of digital signal processing (DSP) systems, but scaling is slowing down and the CMOS device is approaching its fundamental scaling limit. At the same time, advanced DSP algorithms are continuing to evolve, so there is a growing gap between the increasing complexities of the algorithms and what is practically implementable. The growing gap can be bridged by exploring the synergy between algorithm design and hardware design, using the so-called co-design techniques. In this thesis, algorithm and architecture co-design techniques are applied to X-ray computed tomography (CT) image reconstruction. Analysis of fixed-point quantization and CT geometry identifies an optimal word length, intrinsic parallelism, and a mismatch between the object and projection grids. A water-filling buffer is designed to resolve the grid mismatch, and is combined with parallel fixed-point arithmetic units to improve the throughput. The effects of the fixed-point arithmetic on the image quality are analyzed, and an analytical upper bound on the quantization error variance of the reconstructed image is derived. This investigation eventually leads to an out-of-order sectored processing architecture that reduces the off-chip memory access by three orders of magnitude, allowing for a throughput of 925M voxel projections/s at 200MHz on a Xilinx Virtex-5 FPGA. The co-design techniques are further applied to the design of spiking neural networks for sparse coding. Analysis of the neuron spiking dynamics leads to the optimal tuning of network size, spiking rate, and neuron update step size to keep the neuron spiking sparse and random. The resulting sparsity enables a bus-ring architecture to address routing complexity. The bus and ring sizes are optimized to achieve both high throughput and scalability. The architecture is demonstrated in a 65nm CMOS chip. The test chip demonstrates sparse feature extraction at a high throughput of 1.24G pi

关键词： X-ray computed tomography Spiking neural networks High-performance VLSI systems algorithm design Digital signal processing Machine learning Architecture co-design

来源：评论

学校读者我要写书评

暂无评论

Sizing optimisation under irradiance uncertainty of irrigation systems powered by off-grid solar panels

引用

COMPUTERS AND ELECTRONICS IN AGRICULTURE 2025年 232卷

作者： Navarro-Gonzalez, F. J. Manzano, J. Pardo, M. A. Univ Alicante Dept Appl Math Alicante 03690 Spain Univ Politecn Valencia Dept Hydraul Engn & Environm Valencia 46022 Spain Univ Alicante Dept Civil Engn Alicante 03690 Spain

Sizing a photovoltaic installation is crucial for decision-makers, researchers and practitioners managing pressurised irrigation networks powered by solar panels. Photovoltaic off-grid installations offer energy efficiency, lower operation costs, environmental benefits and economic profitability. Network managers must strategically account for the energy limitations of solar installations when irrigating. Moreover, the manager has the challenge of synchronising energy production with the energy consumption of the pumping equipment that supplies water to crops. We propose a technique to optimise the sizing of photovoltaic installations to maximise energy consumption in pumps, thereby meeting the water demands of crops while considering the uncertainties associated with non-clear sky conditions. This approach enhances the management of installations and can schedule the opening and closing of hydrants and irrigation intakes to supply water to crops efficiently. Finally, areal case study in the University of Alicante irrigation network was conducted for two scenarios. The first is to calculate irradiance and the electrical production curve using a theoretical model (very close to reality in latitudes like Alicante, Spain). Real data obtained from a nearby meteorological station is used for the second scenario. In both cases, non-clear sky conditions are considered to establish a relationship between the probability of clear sky (alpha=1) and the minimum number of PV modules (537 or 509 for the theoretical model and real data, respectively). For days without direct normal irradiance (alpha=0), the minimum number of modules is 2145 and 991. Practitioners or decision-makers must find a compromise that meets water demands while minimising the size of the installation.

关键词： Pressurised irrigation networks Irrigation management strategy algorithm design Non-clear sky Solar photovoltaics energy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：