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

Approximation by Egyptian fractions and the weak greedy algorithm

INDAGATIONES MATHEMATICAE-NEW SERIES 2023年第6期34卷 1303-1317页

作者： Chu, Hung Viet Univ Illinois Dept Math Urbana IL 61820 USA

Let 0 = 1;(c) there exists t >= 1 such that b(n)/a(n) = 2 and a(n) -> infinity, there exist theta and (b(n)) such that (a) and (b) are satisfied;whether (c) is also satisfied depends on the sequence (a(n)). Fina... 详细信息

Let 0 < theta <= 1. A sequence of positive integers (b(n))(n=1)(infinity) is called a weak greedy approximation of theta if Sigma(infinity)(n=1) 1/b(n) = theta. We introduce the weak greedy approximation algorithm (WGAA), which, for each theta, produces two sequences of positive integers (a(n)) and (b(n)) such that (a) Sigma(infinity)(n=1) 1/b(n) = theta;(b) 1/a(n+1) < theta - Sigma(n)(i=1) 1/b(i) < 1/(a(n+1) - 1) for all n >= 1;(c) there exists t >= 1 such that b(n)/a(n) <= t infinitely often. We then investigate when a given weak greedy approximation (b(n)) can be produced by the WGAA. Furthermore, we show that for any non-decreasing (a(n)) with a(1) >= 2 and a(n) -> infinity, there exist theta and (b(n)) such that (a) and (b) are satisfied;whether (c) is also satisfied depends on the sequence (a(n)). Finally, we address the uniqueness of theta and (b(n)) and apply our framework to specific sequences. (c) 2023 Royal Dutch Mathematical Society (KWG). Published by Elsevier B.V. All rights reserved.

关键词： Egyptian fraction greedy algorithm Sequences

来源：评论

学校读者我要写书评

暂无评论

Automatic piano performance interaction system based on greedy algorithm for dexterous manipulator

引用

虚拟现实与智能硬件（中英文） 2024年第6期6卷 473-485页

作者： Yufei WANG Junfeng YAO Yalan ZHOU Zefeng WANG Center for Digital Media Computing School of FilmXiamen UniversityXiamen 361005China Institute of Artificial Intelligence Xiamen UniversityXiamen 361005China School of Informatics Xiamen UniversityXiamen 361005China Key Laboratory of Digital Protection and Intelligent Processing of Intangible Cultural Heritage of Fujian and Taiwan Ministry of Culture and Tourism Xiamen 361005China

With continuous advancements in artificial intelligence(AI), automatic piano-playing robots have become subjects of cross-disciplinary interest. However, in most studies, these robots served merely as objects of observation with limited user engagement or interaction. To address this issue, we propose a user-friendly and innovative interaction system based on the principles of greedy algorithms. This system features three modules: score management, performance control, and keyboard interactions. Upon importing a custom score or playing a note via an external device, the system performs on a virtual piano in line with user inputs. This system has been successfully integrated into our dexterous manipulator-based piano-playing device, which significantly enhances user interactions.

关键词： Human-robot interaction Piano-playing robot greedy algorithm Score parsing

来源：评论

学校读者我要写书评

暂无评论

SAGAS: Simulated annealing and greedy algorithm scheduler for laboratory automation

引用

SLAS TECHNOLOGY 2023年第4期28卷 264-277页

作者： Arai, Yuya Takahashi, Ko Horinouchi, Takaaki Takahashi, Koichi Ozaki, Haruka Univ Tsukuba Sch Life & Environm Sci Coll Biol Sci 1-1-1 Tennodai Tsukuba Ibaraki 3058572 Japan Univ Tsukuba Fac Med Bioinformat Lab 1-1-1 Tennodai Tsukuba Ibaraki 3058575 Japan Natl Inst Adv Ind Sci & Technol Artificial Intelligence Res Ctr 2-4-7 AomiKoto Ku Tokyo 1350064 Japan RIKEN Ctr Biosyst Dynam Res Lab Biol Inspired Comp 6-2-3 Furuedai Suita Osaka 5650874 Japan Keio Univ Grad Sch Media & Governance 5322 Endo Fujisawa Kanagawa 2520816 Japan Univ Tsukuba Ctr Artificial Intelligence Res 1-1-1 Tennodai Tsukuba Ibaraki 3058577 Japan

During laboratory automation of life science experiments, coordinating specialized instruments and human experimenters for various experimental procedures is important to minimize the execution time. In particular, the scheduling of life science experiments requires the consideration of time constraints by mutual boundaries (TCMB) and can be formulated as the "scheduling for laboratory automation in biology " (S-LAB) problem. However, existing scheduling methods for the S-LAB problems have difficulties in obtaining a feasible solution for large-size scheduling problems at a time sufficient for real-time use. In this study, we proposed a fast schedule-finding method for S-LAB problems, SAGAS (Simulated annealing and greedy algorithm scheduler). SAGAS combines simulated annealing and the greedy algorithm to find a scheduling solution with the shortest possible execution time. We have performed scheduling on real experimental protocols and shown that SAGAS can search for feasible or optimal solutions in practicable computation time for various S-LAB problems. Furthermore, the reduced computation time by SAGAS enables us to systematically search for laboratory automation with minimum execution time by simulating scheduling for various laboratory configurations. This study provides a convenient scheduling method for life science automation laboratories and presents a new possibility for designing laboratory configurations.

关键词： Scheduling Laboratory automation Time constraint by mutual boundaries (TCMB) Scheduling for laboratory automation in biology (S-LAB) problem Simulated annealing (SA) greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal arrangement of fixed heliostat field based on genetic algorithm and greedy algorithm 4

Optimal arrangement of fixed heliostat field based on geneti...

引用

4th International Conference on Computer Communication and Information Systems (CCCIS)

作者： Peng, Shaozhuo Chen, Guanye Zhou, Jiaqi Tan, Dingying Chen, Pingping Guangzhou Univ Chinese Med Sch Med Informat Engn Guangzhou Peoples R China

ISBN: (纸本)9798350389555;9798350389548

The optimal configuration of heliostat field is one of the key technologies in the design of tower solar collector system, and its layout and configuration directly affect the solar collector efficiency. This work presents a novel optimisation strategy that combines genetic algorithm and greedy algorithm. The proposed strategy is developed by examining the constraints of conventional methods for optimising heliostat fields. The strategy uses the global search capability of genetic algorithm combined with the local optimal decision of greedy algorithm to improve the efficiency and performance of the fixed heliostat field configuration. Initially, the relevant mathematical model of the fixed heliostat field is established, and then on the basis of the genetic algorithm, the greedy algorithm is introduced to locally optimise the individuals in the population of each generation, so as to accelerate the speed of convergence and improve the quality of the solution. This research validates the feasibility and accuracy of the model and algorithm. Use python to conduct simulation experiment, showing the potential of the optimisation algorithm to be applied in the design of solar thermal collector systems.

关键词： tower solar thermal power generation fixed heliostat field genetic algorithm greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

A greedy algorithm FOR HABIT FORMATION UNDER MULTIPLICATIVE UTILITY

引用

INTERNATIONAL JOURNAL OF THEORETICAL AND APPLIED FINANCE 2024年第3N04期27卷

作者： Kirusheva, Snezhana Salisbury, Thomas S. Univ Toronto Mississauga Dept Math & Computat Sci 3359 Mississauga Rd Mississauga ON L5L 1C6 Canada York Univ Dept Math & Stat 4700 Keele St Toronto ON M3J 1P3 Canada

In this paper, we consider the problem of optimizing lifetime consumption under a habit formation model, both with and without an exogenous pension. Unlike much of the existing literature, we apply a power utility to the ratio of consumption to habit, rather than to their difference. The martingale/duality method becomes intractable in this setting, so we develop a greedy version of this method that is solvable using Monte Carlo simulation. We investigate the behavior of the greedy solution, and explore what parameter values make the greedy solution a good approximation to the optimal one.

关键词： Optimal consumption multiplicative habit formation greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

greedyAgent: Crafting Efficient Agents for Meta-learning from Learning Curves via greedy algorithm Selection 20th

GreedyAgent: Crafting Efficient Agents for Meta-learning fro...

引用

20th International Conference on Intelligent Computing (ICIC)

作者： He, Jinyu Song, Xiaowei Yan, Xiaohan Wang, Nan Miao, Yuqi Jiang, Zijian Chao, Fei Zhang, Yan Zhang, Shengchuan Ji, Rongrong Xiamen Univ Sch Informat Xiamen 361005 Peoples R China Tongji Univ Coll Elect & Informat Engn Shanghai 201804 Peoples R China

ISBN: (纸本)9789819756629;9789819756636

With the rapid development of artificial intelligence and machine learning technologies, Automated Machine Learning (AutoML) has become a hot research area in recent years. Meta-learning plays an increasingly important role in AutoML. Akey sub-problem-meta-learning from learning curves is an immature but gradually gaining attention are awithin the field ofmeta-learning. For instance, in MetaLC, the organizers designed a competition on meta-learning from learning curves, whose goal is to achieve the highest all-time performance, based on the algorithm's selection strategy learned by past learning curves. This competition aims to simulate the meta-learning process in an environment like reinforcement learning, where the strategies provided by the participants act as agents interacting with the environment. We innovatively propose a training strategy for agents called greedyAgent, based on an approximate greedy algorithm. After reducing the problem of meta-learning from learning curves to a 0-1 knapsack problem, we proved that our greedy method could replace the dynamic programming method to find an approximate optimal solution. In both the development phase and the final evaluation phase, our method achieved state-of-the-art in test results. We compared five baseline methods and selected representative cases for detailed analysis. The competition's second round has been accepted by the first AutoML Conference. Besides, our solution ranked 1st among the 14 methods participating in the competition. The code of our method has been released: https://***/dragonbra/MetaLC-2nd-Round.

关键词： AutoML Meta-learning Learning curves greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimization of Color Dominance Factor by greedy algorithm for Leaves and Fruit Segmentation of Tomato Plants 16th

Optimization of Color Dominance Factor by Greedy Algorithm f...

引用

16th Mexican Conference on Pattern Recognition (MCPR)

作者： Pablo Guerra Ibarra, Juan Cuevas de la Rosa, Francisco Ctr Invest Opt AC Guanajuato 37150 Leon Mexico

ISBN: (纸本)9783031628351;9783031628368

The cultivation of agricultural products destined for human consumption has played a crucial role in the advancement of societies. Consequently, the cultivation of land is facilitated by the integration of various technological advancements into tillage processes. The implementation of different areas of research and technologies have created what is called precision agriculture. In general, precision agriculture systems take information from different sources, which in most cases requires a process of filtering the information. When the source of the information is images, the filtering process in many cases requires a segmentation process to label the pixels of interest. In this work, we present a proposed greedy algorithm that seeks to highlight the color dominance present in the leaves and fruits of tomato plants to perform a segmentation process using two a parameters to optimize. Applying the alpha(1) = 3.2 and alpha(2) = 2.6 factors that emphasize color dominance obtained by the metaheuristic algorithm, the performance metrics Accuracy, Precision, Recall, F1-Score and IoU were used, achieving an average of 86% in fruit segmentation and 91% in leave segmentation.

关键词： Segmentation greedy algorithm Precision Agriculture Computer Vision Color Dominance

来源：评论

学校读者我要写书评

暂无评论

greedy algorithm for maximization of semi-monotone non-submodular functions with applications

引用

THEORETICAL COMPUTER SCIENCE 2024年 1013卷

作者： Shi, Yishuo Zhao, Hui Wenzhou Univ Coll Math & Phys Wenzhou 325035 Peoples R China

The problem of maximizing submodular set functions has received increasing attention in recent years, and significant improvements have been made, particularly in relation to objective functions that satisfy monotonic submodularity. However, in practice, the objective function may not be monotonically submodular. While greedy algorithms have strong theoretical guarantees for maximizing submodular functions, their performance is barely guaranteed for non-submodular functions. Therefore, in this paper, we investigate the problem of maximizing non-monotone nonsubmodular functions under knapsack constraints based on the problem of infectious diseases and provides a more sophisticated analysis through the idea of segmentation. Since our definition characterizes the function more elaborately, a better bound, i.e., a tighter approximation guarantee, is achieved. Finally, we generalize the relevant results for the more general problems.

关键词： greedy algorithm Semi-monotone Non-submodular Segmentation

来源：评论

学校读者我要写书评

暂无评论

Optimization of indoor temperature sensor layout using proper orthogonal decomposition and greedy algorithm 43

Optimization of indoor temperature sensor layout using prope...

引用

43rd Chinese Control Conference (CCC)

作者： Wang, Zifeng Chen, Zixiang Zheng, Wen Li, Kangji Jiangsu Univ Sch Elect & Informat Engn Zhenjiang 212013 Jiangsu Peoples R China

ISBN: (纸本)9798350366907;9789887581581

Accurately estimating the distributed indoor thermal environmental parameters with limited sensors is crucial for indoor environmental quality and building energy efficiency. This study combines proper orthogonal decomposition and greedy algorithm for sensors layout's optimization in a large-space thermal environment. Firstly, choose the initial quantity and positions of sensors, and collect steady temperature field information based on the feasible range of environmental variables;Secondly, extract features from the collected dataset using proper orthogonal decomposition, and determine the optimal number of sensors based on the energy proportion of the ***;Thirdly, select the sensor positions iteratively based on the correlations of eigenvectors and sensors using greedy algorithm. A field experiment for performance validation is conducted using a matrix of 72 temperature sensors in a large cafeteria. By using the collected 27 snapshot datasets, the temperature field can be reconstructed by Linear Stochastic Estimation using only six optimal sensors (steady-state error: 0.2433, RMSE). The proposed POD-greedy optimization strategy is also compared with another heuristic inference method. The better performance shows great potential for engineering practice and applications.

关键词： Large-space building Proper orthogonal decomposition greedy algorithm Sensor layout optimization

来源：评论

学校读者我要写书评

暂无评论

Planning and Verification of a Cloud-Based Monitoring DC Microgrid System Using the greedy algorithm 9

Planning and Verification of a Cloud-Based Monitoring DC Mic...

引用

9th Southern Power Electronics Conference

作者： Shieh, Jenn-Jong Lu, Chia-Wei Lin, Chang-Hua Liu, Hwa-Dong Feng Chia Univ Dept Elect Engn Taichung Taiwan Natl Taiwan Univ Sci & Technol Dept Elect Engn Taipei Taiwan Natl Taiwan Normal Univ Undergrad Program Vehicle & Energy Engn Taipei Taiwan

ISBN: (纸本)9798350351163;9798350351156

This paper aims to implement a cloud-based monitoring DC microgrid system suitable for communities by integrating a simulated utility grid system (SUGS), battery energy storage system (BESS), solar power generation system (SPGS), and cloud-based front-end monitoring interface and technology. Additionally, the paper utilizes Long Short-Term Memory (LSTM) model to predict the next day's load curve and employs a solar simulator to simulate the daily variations in solar irradiance. Furthermore, to enhance economic benefits during peak and off-peak time-of-use (TOU) pricing periods, this paper adopts the concept of local selection using a greedy algorithm to optimize energy allocation between SUGS, BESS, and SPGS through cloud computing. Finally, a derating case study is conducted through simulations and experiments to verify the economic value and feasibility of the proposed greedy algorithm in a community-based DC microgrid.

关键词： Cloud System microgrid battery energy storage system solar power generation system Long Short-Term Memory greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：