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

作者： Wenjun Ge Yu Li Fuqiang Shao Hangwei Zhong Shuzhen Zhang School of economics Guangdong Ocean University School of mathematics and computer Guangdong Ocean University

For the base station siting and planning problem in the communication industry,we first establish a 0-1 backpack dynamic planning model,and then use the simulated annealing algorithm and greedy algorithm to continuously optimize the base station sitting under different ***,the coverage area of the considered base stations is closer to the actual one(i.e.,three sectoral areas).In this regard,we first establish the polar coordinate system to study the relationship between the change of the main direction angle of a single base station and the coverage area and then use the hierarchical clustering algorithm to classify the main direction angles of the three areas into three categories based on the distribution of weak coverage points around the stations and find the three best main direction angles of a single base *** the greedy algorithm is used to solve the problem from local to overall so that each base station can cover the weakest coverage points as much as possible,and finally get a more ideal result that the total weak coverage rate of all base stations reaches 79.8%.

关键词： 0-1 backpack problem greedy algorithm Simulated annealing algorithm

来源：评论

学校读者我要写书评

暂无评论

A greedy-based algorithm in Optimizing Student's Recommended Timetable Generator with Semester Planner

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2022年第1期13卷 369-375页

作者： Abu Samah, Khyrina Airin Fariza Thusree, Siti Qamalia Fadzil, Ahmad Firdaus Ahmad Riza, Lala Septem Ibrahim, Shafaf Hasan, Noraini Univ Teknol MARA Fac Comp & Math Sci Cawangan Melaka Kampus Jasin Melaka Malaysia Univ Teknol MARA Fac Comp & Math Sci Shah Alam Selangor Malaysia Univ Pendidikan Indonesia Dept Comp Sci Educ Bandung Indonesia

Semester planner plays an essential role in students' society that might help students have self-discipline and determination to complete their studies. However, during the COVID-19 pandemic, they faced difficulty organizing time management and doing a manual schedule. It resulted in substantial disruptions in learning, internal assessment disturbances, and the cancellation of public evaluations. Hence, this research aims to optimize the recommended semester planner, Timetable Generator using a greedy algorithm to increase student productivity. We identified three-set control functions for each entered information: 1) validation for the inserted information to ensure valid data and no redundancy, 2) focus scale, and 3) the number of hours to finish the activity. We calculate the priority task sequence to achieve the best optimal solution. The greedy algorithm can solve the optimization problem with the best optimal solution for each situation. Then, we executed it to make a recommended semester planner. From the test conducted, the functionality shows all the features successfully passed. We validate using test accuracy for the system's reliability by evaluating it compared to the Brute Force algorithm, and the trends increase from 60% to 100%.

关键词： greedy algorithm optimization recommendation system semester planner

来源：评论

学校读者我要写书评

暂无评论

Efficient mesh deformation using radial basis functions with a grouping-circular-based greedy algorithm

引用

JOURNAL OF COMPUTATIONAL PHYSICS 2021年 433卷 110200-110200页

作者： Fang, Hong Zhang, He Shan, Fanli Tie, Ming Zhang, Xing Sun, Jinghua Sci & Technol Space Phys Lab Beijing 100076 Peoples R China

A grouping-circular-based (GCB) greedy algorithm is proposed to improve the efficiency of mesh deformation. By incorporating the multigrid concept that the computational errors on the fine mesh can be approximated with those on the coarse mesh, this algorithm stochastically divides all boundary nodes into m groups and uses the locally maximum radial basis functions (RBF) interpolation error of the active group as an approximation to the globally maximum one of all boundary nodes for reducing the RBF support nodes. For this reason, it avoids the interpolation conducted at all boundary nodes in each iterative procedure. After m iterations, the interpolation errors of all boundary nodes are computed once, thus allowing all boundary nodes can contribute to error control. A theoretical analysis reveals that this algorithm can make the computational complexity for computing the interpolation errors reduced from O (N-c(2) N-b) to O (N-c(3)), where N-b and N-c denote the numbers of boundary nodes and support nodes, respectively. Two deformation problems of the ONERA M6 wing and the DLR-F6 Wing-Body-Nacelle-Pylon configuration are computed to validate the GCB greedy algorithm. It is shown that this algorithm is able to remarkably promote the efficiency of computing the interpolation errors by dozens of times. It is also shown that the convergence indicated by the variation of the globally interpolation error of this algorithm is consistent with that of the traditional greedy algorithm. It is indicated by the Kullback-Leibler (KL) divergence that it can generate a reasonable set of support nodes. Besides, it ensures similar statistical property to the traditional greedy algorithm. The theoretical analysis also reveals that if m > 2.25N(b)/N-c, the amount of computation for computing the interpolation errors will be lower than that for solving the linear algebraic system. However, it is found that an increase of m results in an increase of N-c, indicating that m cannot be too

关键词： Mesh deformation Grouping-circular greedy algorithm Radial basis function

来源：评论

学校读者我要写书评

暂无评论

An enhanced greedy algorithm for failure resistant material design with application to composite delamination

引用

COMPOSITE STRUCTURES 2021年 278卷 114681-114681页

作者： Weng, Huanbo Xu, Yangjian Chen, Junjun Ruan, Hongshi Nan, Chenyu Liang, Lihua Ju, Xiaozhe Zhejiang Univ Technol Coll Mech Engn Hangzhou 310023 Peoples R China

In this work, an enhanced greedy algorithm is developed for failure resistant design of two-phase composites against delamination. Possessing the merits of a greedy algorithm, i.e. easy-to-implement and gradient-free, the computational efficiency is significantly improved. An objective functional based on interface elements is used to represent the failure resistance and evaluated by finite element computations. The search domain for each iteration is reduced by a heuristic strategy, thus leading to a reduced number of required finite element computations. Additionally, a criterion is introduced to adaptively determine the number of switching subvolumes for each correction step, leading to a reduced number of iterations. A numerical study shows that the computational complexity of the proposed algorithm is significantly reduced on the basis of an existing algorithm. Furthermore, we develop three different generation schemes for initial solutions and conduct a comparative study on them. A maximal speed-up factor of 12.5 compared to the existing algorithm is achieved.

关键词： Structural optimization Failure resistance Composite delamination greedy algorithm Interface elements

来源：评论

学校读者我要写书评

暂无评论

Optimization of Containership Stowage in Circular Route Based on greedy algorithm 4

Optimization of Containership Stowage in Circular Route Base...

引用

4th IEEE Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)

作者： Wang, Ning Yu, Lili Yu, Linxiao Ke, Shanhui Shanghai Univ Sch Management Dept Informat Management Shanghai Peoples R China

ISBN: (纸本)9781728143903

This paper studies the Containership Stowage Stack Minimization Problem(CSSMP) under a circular route so as to obtain the containership stowage plan for each port. This paper analyzes the process of multi-port containership stowage problem under the circular route, taking into consideration the sequence of port of call and container information of each port. A greedy algorithm is designed to solve the problem. The efficiency of the algorithm is verified by analyzing the results of the instances and therefore some rules can be obtained to provide reference for subsequent research.

关键词： circular route container transportation stack minimization load optimization greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

A New Base Station Deployment Method for WRSN Based on greedy algorithm

A New Base Station Deployment Method for WRSN Based on Greed...

引用

IEEE Wireless Power Transfer Conference (WPTC)

作者： Fang, Xiangyuan Cheng, Yuhua Wang, Gaofeng Hangzhou Dianzi Univ Wenzhou Inst Wenzhou Peoples R China

ISBN: (纸本)9781728142388

Wireless rechargeable sensor networks (WRSNs) is developed to resolve the problem of power supplies in wireless sensor networks by using wireless power transmission technologies Minimizing the number of the charging base stations is important to reduce the cost of deploying the WRSNs. An algorithm without the restriction in existing algorithms (like requiring to fix the base stations to some grid points and without the specific location information of the base stations) is proposed in this paper. The proposed double-circle greedy algorithm uses the minimum greedy circle coverage idea to search an optimized deployment of the base stations. The simulated results show the advantages of lower number of base stations under the comparison with the existing algorithms.

关键词： greedy algorithm Wireless rechargeable sensor network Positioning Circle coverage

来源：评论

学校读者我要写书评

暂无评论

Research on the maximization of the equilibrium influence of multi-information competition based on greedy algorithm 3

Research on the maximization of the equilibrium influence of...

引用

3rd International Conference on Information Technologies and Electrical Engineering, ICITEE 2020

作者： Zhang, Yunfei He, Jun Wen, Jin Wang, Yujian School of Information Engineering Kunming University Kunming China

ISBN: (纸本)9781450388665

In the information age, with the continuous improvement of Internet technology, online information has gradually changed people's way of life and work. Therefore, after understanding the background of the spread of multi-information competition, this paper refers to the influence algorithm based on the cost control mechanism, and studies the maximization of the game equilibrium influence of multi-information competition spread based on the greedy algorithm. © 2020 ACM.

关键词： Competitive transmission Game equilibrium greedy algorithm Maximize More information

来源：评论

学校读者我要写书评

暂无评论

Identification of subtype specific biomarkers of clear cell renal cell carcinoma using random forest and greedy algorithm

引用

BIOSYSTEMS 2021年 204卷 104372-104372页

作者： Wu, Yanyan Han, Weishan Xu, Deling Wang, Xiaxia Yang, Jing Lu, Zhengshu Chen, Xu Ding, Yanrui Jiangnan Univ Sch Sci Wuxi 214122 Jiangsu Peoples R China Jiangnan Univ Lab Media Design & Software Technol Wuxi 214122 Jiangsu Peoples R China Jiangnan Univ Key Lab Ind Biotechnol Wuxi 214122 Jiangsu Peoples R China

Suitable biomarkers can be good indicator for cancer subtype. To find biomarkers that can accurately distinguish clear cell renal cell carcinoma (ccRCC) subtypes, we first determined ccRCC subtypes based on the expression of mRNA, miRNA and lncRNA, named clear cell type 1 (ccluster1) and 2 (ccluster2), using three unsupervised clustering algorithms. Besides being associated with the expression pattern derived from the single type of RNA, the differences between subtypes are relevant to the interactions between RNAs. Then, based on ceRNA network, the optimal combination features are selected using random forest and greedy algorithm. Further, in survivalrelated sub-ceRNA, competing gene pairs centering on miR-106a, miR-192, miR-193b, miR-454, miR-32, miR98, miR-143, miR-145, miR-204, miR-424 and miR-1271 can also well identify ccluster1 and ccluster2 with prediction accuracy over 92%. These subtype-specific features potentially enhance the accuracy with which machine learning methods predict specific ccRCC subtypes. Simultaneously, the changes of miR-106 and OIP5AS1 affect cell proliferation and the prognosis of ccluster1. The changes of miR-145 and FAM13A-AS1 in ccluster2 have an effect on cell invasion, apoptosis, migration and metabolism function. Here miR-192 displays a unique characteristic in both subtypes. Two subtypes also display notable differences in diverse pathways. Tumors belonging to ccluster1 are characterized by Fc gamma R-mediated phagocytosis pathway that affects tissue remodeling and repair, whereas those belonging to ccluster2 are characterized by EGFR tyrosine kinase inhibitor resistance pathway that participates in regulation of cell homeostasis. In conclusion, identifying these gene pairs can shed light on therapeutic mechanisms of ccRCC subtypes.

关键词： ccRCC Random forest greedy algorithm Subtype specific biomarker

来源：评论

学校读者我要写书评

暂无评论

Research on The Maximization of The Equilibrium Influence of Multi-Information Competition Based on greedy algorithm 2020

Research on The Maximization of The Equilibrium Influence of...

引用

Proceedings of the 3rd International Conference on Information Technologies and Electrical Engineering

作者： Yunfei Zhang Jun He Jin Wen Yujian Wang School of Information Engineering Kunming University Kunming china

ISBN: (纸本)9781450388665

关键词： Game equilibrium More information greedy algorithm Maximize Competitive transmission

来源：评论

学校读者我要写书评

暂无评论

greedy algorithm for Generator Start-Up Sequence Optimization in Power System Restoration Considering Transmission Path

Greedy Algorithm for Generator Start-Up Sequence Optimizatio...

引用

IEEE PES Innovative Smart Grid Technologies Europe (IEEE ISGT-Europe)

作者： Zhang, Jian Wang, Dong Xu, Changqing Li, Changcheng Zhang, Ning Tsinghua Univ Dept Elect Engn State Key Lab Power Syst Beijing 100084 Peoples R China State Grid Corp China Dept Safety Supervis Beijing 100031 Peoples R China State Grid Henan Elect Power Co Co Ltd Econ & Technol Res Inst Zhengzhou 450052 Peoples R China Guangxi Univ Sch Elect Engn Nanning 530004 Peoples R China

ISBN: (纸本)9781538682180

An strategic restoration scheme of the power system is able to reduce the load losses during blackouts. The generator start-up sequence is the key of the restoration strategy that determines the time consumed in power system restoration. This paper proposes an optimization method to determine the generator start-up sequence with consideration of transmission path. First, the recovery models of generator and transmission path are developed to explicitly model their recovery time under different conditions. Then, the equivalent generator resilience index is defined to determine the generator start-up priority. Finally, a greedy algorithm based method is proposed to optimizing generator start-up sequence to maximize the equivalent generator resilience index at each step of the restoration process while considering the transmission paths. The simulation results obtained by the IEEE 39-bus test system demonstrate the effectiveness of the proposed method.

关键词： Generator start-up sequence greedy algorithm Power system restoration Transmission path

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：