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

World Scientific Research Journal 2019年第9期5卷 278-287页

作者： Yue Liu Peng Ling

In recent years, with the shortage of human resources and the increase in employment costs, the demand for intelligent processing system operations in various industries has increased. The smart car RGV can accept the command to automatically control the moving direction, distance and realize the loading and unloading work, which greatly solves the problem of workshop work cost and efficiency. In this paper, the greedy algorithm is combined with MATLAB [1], JAVA [2] and other languages. According to the different RGV different workshop operations requirements, the corresponding RGV dynamic scheduling model and algorithm are established. The analytic hierarchy process is used to evaluate the model. Consistency test, finally by consulting the literature, the improved model is based on genetic algorithm and K-Means++ RGV dynamic scheduling model to reduce the system imbalance caused by CNC failure and meet greater production needs. For the task, we can divide the RGV operation into two specific situations: RGV processing of materials in one process: By analyzing the RGV straight-track round-trip loading and unloading operation, we made the total time of loading and unloading of 8 CNC machine tools (CNC) as the optimization goal, aiming to use the most time in the loading and unloading process within 8 hours of continuous operation shift. The figure describes the RGV straight-track operation. By comparing the start time and RGV arrival time of each CNC, a dynamic scheduling model based on TSP algorithm is established, and the iterative conditions are satisfied. The corresponding planning model is written and written in JAVA. Solve. The first group can process 146 materials. The occurrence of RGV failure and the elimination of the processing effects on the first and second processes: From the title, the probability of failure and the time of troubleshooting are known. The faulty machine number within the range and the exclusion time are generated by the random function.

关键词： greedy algorithm RGV dynamic scheduling strategy AHP analytic hierarchy process matlab establishment of FLAG

来源：评论

学校读者我要写书评

暂无评论

Weighting Attributes Based on the greedy algorithm Properties

引用

Procedia Computer Science 2024年 246卷 4883-4892页

作者： Beata Zielosko Urszula Stańczyk Kamil Jabloński University of Silesia in Katowice Institute of Computer Science Bȩdzińska 39 41-200 Sosnowiec Poland Department of Computer Graphics Vision and Digital Systems Faculty of Automatic Control Electronics and Computer Science Silesian University of Technology Akademicka 2A 44-100 Gliwice Poland

Estimation of importance for considered features is an important issue for any knowledge exploration process and it can be executed by a variety of approaches. In the research reported in this study, the primary aim was the development of a methodology for creating attribute rankings. Based on the properties of the greedy algorithm for inducing decision rules, a new application of this algorithm has been proposed. Instead of constructing a single ordering of features, attributes were weighted multiple times. The input datasets were discretised with several algorithms representing supervised and unsupervised discretisation approaches. Each resulting discrete data variant was exploited to construct a ranking of attributes. The effectiveness of the obtained rankings was confirmed through a rule filtering process governed by weighted attributes. The methodology was applied to the stylometric task of authorship attribution. The experimental outcomes demonstrate the value of the proposed research method, as it generally led to improved predictions while taking into account a noticeably decreased sets of attributes and decision rules.

关键词： greedy algorithm Weighting attributes Decision rules Rule filtering Authorship attribution

来源：评论

学校读者我要写书评

暂无评论

Multi Agent model based on Chemical Reaction Optimization with greedy algorithm for Flexible Job shop Scheduling Problem

引用

Procedia Computer Science 2017年 112卷 81-90页

作者： Bilel Marzouki Olfa Belkahla Driss Khaled Ghédira Ecole Nationale des Sciences de l’Informatique Université de Manouba Tunisia COSMOS Laboratory Université de Manouba Tunisia Ecole Supérieure de Commerce de Tunis Université de Manouba Tunisia Institut Supérieur de Gestion Université de Tunis Tunisia

Scheduling in production systems consists in assigning operations on a set of available resources in order to achieve defined objectives. The Flexible Job shop Scheduling Problem (FJSP) is one of the scheduling problems and also an extension of classical Job shop Scheduling Problem (JSP) such that each operation can be processed on different machine and its processing time depends on the used machine. The FJSP is classified, as most of scheduling problems, NP-Hard in complexity theory and can be decomposed into two sub-problems: a routing sub-problem, which consists of assigning each operation to a machine out of a set of alternative machines, and a scheduling sub-problem, which consists of sequencing the assigned operations on all selected machines in order to attain a feasible schedule with optimized objectives. In this paper, we propose a decentralized model named Multi Agent model based on Chemical Reaction Optimization with greedy algorithm (MACROG-FJSP) to solve the FJSP in order to minimize the maximum completion time (Makespan). Experiments are performed on well known benchmark instances proposed in the literature which are Fattahi, Kacem, Brandimarte and Hurink instances to evaluate the performance of our model.

关键词： Multi-Agent system Optimization Manufacturing Scheduling Flexible Job shop Scheduling Problem Chemical Reaction Optimization metaheuristic greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Stiffness Optimization Through a Modified greedy algorithm

引用

Procedia Structural Integrity 2022年 37卷 755-762页

作者： Iulian Constantin Coropețchi Alexandru Vasile Ștefan Sorohan Cătălin Radu Picu Dan Mihai Constantinescu Military Technical Academy “Ferdinand I” Bulevardul George Coşbuc nr. 39-49 050141 Bucharest Romania University POLITEHNICA of Bucharest Splaiul Independeţei nr. 313 060042 Bucharest Romania Rensselaer Polytechnic Institute 110 Eighth Street Troy NY USA 12180

Due to the 3D printing techniques, it is possible to create and design components with soft and rigid combinations of materials with different elastic properties which may satisfy multiple material requirements. A soft (blue) and a rigid (purple) material with moduli of elasticity in a ratio 1:10 can be innkjet printed together following an initial pattern. The objective function was formulated as to maximize the effective stiffness on both in-plane directions. Finite element analyses were performed by using the PyAnsys software under an MIT License in a domain with 16 Q8 elements which represents by symmetry a representative volume element (RVE). The objective function to be maximized can also reduce the anisotropy of the printed topology. We proved that the formulation of three objective functions affects the results obtained with a greedy algorithm.

关键词： optimization greedy algorithm PyAnsys composite microstructure

来源：评论

学校读者我要写书评

暂无评论

Real-Time Prediction for Future Profile of Car Travel Based on Statistical Data and greedy algorithm

引用

SICE Journal of Control, Measurement, and System Integration 2015年第1期8卷 7-14页

作者： Takuma Yamaguchi Akihiko Kawashima Akira Ito Shinkichi Inagaki Tatsuya Suzuki Nagoya University Nagoya UniversityDENSO CORPORATION Nagoya UniversityJST CREST

Electric Vehicles (EVs) and Plug-in Hybrid Vehicles (PHVs) are expected to be used as power-storage devices in Home Energy Management Systems (HEMSs) due to their high capacity batteries. When planning the charge and discharge of the vehicle's battery by the HEMS, the expected profile of car's departures and arrivals for home is required. This paper presents a real-time estimation method for the Profile of Departure and Arrival Times (PDATs) over one day. The PDAT prediction problem is formulated as a maximum-likelihood estimation problem with the probability based on the Statistics of Departure and Arrival Times (SDAT). In the proposed method, the maximum-likelihood estimation problem is decomposed to optimization subproblems, each of which is solved by a greedy algorithm. Due to this decomposition, it is possible to find a plausible solution of the PDAT with a reasonable computational cost. The utility of the proposed method is evaluated by numerical experiments with SDATs derived from the real data of three subjects who use gasoline vehicles.

关键词： profile of the departure and arrival time greedy algorithm maximum-likelihood estimation energy management system

来源：评论

学校读者我要写书评

暂无评论

A Landmark Selection Method for L-Isomap Based on greedy algorithm and its Application

A Landmark Selection Method for L-Isomap Based on Greedy Alg...

引用

IEEE Annual Conference on Decision and Control

作者： Hao Shi Baoqun Yin Xiaofeng Zhang Yu Kang Yingke Lei Department of Automation University of Science and Technology of China 230027 Hefei China Electronic Engineering Institute 230027 Hefei China

ISBN: (纸本)9781479978878

Isometric feature mapping (Isomap) is a widely-used nonlinear dimensionality reduction method, but it suffers from high computational complexity. L-Isomap is a variant of Isomap which is faster than Isomap. In this algorithm, a subset of points are chosen out of the total data points as landmark points so as to simplify the embedding computation. In this paper, we propose a novel landmark selection method for L-Isomap based on a greedy algorithm. Experiments performed on synthetic and physical data sets validate the effectiveness of the proposed method. Internet traffic matrix has been an effective model to analyzing the Internet. However, the Internet traffic matrix data usually possesses high dimensionality. In this paper, we apply the improved L-Isomap to the real Internet traffic matrix data to investigate its low-dimensional features. The experiment results show that the Internet traffic matrix has a small intrinsic dimension and there indeed exists a low-dimensional manifold structure.

关键词： greedy algorithm flow matrix landmarks Internets total Information selection methods

来源：评论

学校读者我要写书评

暂无评论

Task-scheduling scheme based on greedy algorithm in integrated radar and communication systems

引用

JOURNAL OF ENGINEERING-JOE 2019年第19期2019卷 5864-5867页

作者： Huang, Ling Zhang, Yu Li, Qingyu Pan, Changyong Song, Jian Tsinghua Univ Tsinghua Natl Lab Informat Sci & Technol TNList Beijing 100084 Peoples R China Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

Integrated radar and communication system can significantly enhance the work efficiency and considerably occupy less hardware resources. However, the integrated systems have limited supply resources, where a proper scheduling scheme is needed to meet the requirement of systems. Here, the authors propose a task-scheduling scheme based on the greedy algorithm, where each arrangement is the result of selecting the minimum shift time compared with the expected time. By guaranteeing the best result of each task, the minimum average time shift ratio (ATSR) of the whole tasks is obtained. Simulation results show that when the number of the tasks is quite large, the proposed scheme has more advantages than the traditional scheme based on time pointer algorithm. Authors' proposed scheme can significantly reduce the average offset time of tasks while maintaining a satisfactory successful scheduling rate (SSR), which shows more advantages in the integrated systems.

关键词： scheduling adaptive scheduling greedy algorithms task-scheduling scheme greedy algorithm integrated radar communication system hardware resources integrated systems supply resources proper scheduling scheme minimum shift time expected time minimum average time shift ratio traditional scheme time pointer algorithm satisfactory successful scheduling rate

来源：评论

学校读者我要写书评

暂无评论

On a greedy algorithm to Construct Universal Cycles for Permutations

引用

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2019年第1期30卷 61-72页

作者： Gao, Alice L. L. Kitaev, Sergey Steiner, Wolfgang Zhang, Philip B. Northwestern Polytech Univ Dept Appl Math Xian 710072 Shaanxi Peoples R China Univ Strathclyde Dept Comp & Informat Sci 26 Richmond St Glasgow G1 1XH Lanark Scotland Univ Paris Diderot Paris 7 CNRS UMR 8243 IRIF F-75205 Paris 13 France Tianjin Normal Univ Coll Math Sci Tianjin 300387 Peoples R China

A universal cycle for permutations of length n is a cyclic word or permutation, any factor of which is order-isomorphic to exactly one permutation of length n, and containing all permutations of length n as factors. It is well known that universal cycles for permutations of length n exist. However, all known ways to construct such cycles are rather complicated. For example, in the original paper establishing the existence of the universal cycles, constructing such a cycle involves finding an Eulerian cycle in a certain graph and then dealing with partially ordered sets. In this paper, we offer a simple way to generate a universal cycle for permutations of length n, which is based on applying a greedy algorithm to a permutation of length n - 1. We prove that this approach gives a unique universal cycle Pi(n) for permutations, and we study properties of Pi(n).

关键词： Universal cycles combinatorial generation greedy algorithm permutations

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Deciphering the antifungal mechanism and functional components of cinnamomum cassia essential oil against Candida albicans through integration of network-based metabolomics and pharmacology, the greedy algorithm, and molecular docking

引用

JOURNAL OF ETHNOPHARMACOLOGY 2024年第Part2期319卷 117156页

作者： Gu, Keru Feng, Shengyi Zhang, Xinyue Peng, Yuanyuan Sun, Peipei Liu, Wenchi Wu, Yi Yu, Yun Liu, Xijian Liu, Xiaohui Deng, Guoying Zheng, Jun Li, Bo Zhao, Linjing Shanghai Univ Engn Sci Coll Chem & Chem Engn Shanghai 201620 Peoples R China Shanghai Univ Tradit Chinese Med Yueyang Hosp Integrated Tradit Chinese & Western M Ctr Traumatol & Orthoped Shanghai 200437 Peoples R China Shanghai Jiao Tong Univ Shanghai Gen Hosp Trauma Ctr Sch Med Shanghai 201620 Peoples R China

Ethnopharmacological relevance: Fungal pathogens can cause deadly invasive infections and have become a major global public health challenge. There is an urgent need to find new treatment options beyond established antifungal agents, as well as new drug targets that can be used to develop novel antifungal agents. Cinnamomum cassia is a tropical aromatic plant that has a wide range of applications in traditional Chinese medicine, especially in the treatment of bacterial and fungal *** of the study: The present study aimed to explore the mechanism of action and functional components of Cinnamomum cassia essential oil (CEO) against Candida albicans using an integrated strategy combining network -based metabolomics and pharmacology, the greedy algorithm and molecular docking. Materials and methods: CEO was extracted using hydrodistillation and its chemical composition was identified by GC-MS. Cluster analysis was performed on the compositions of 19 other CEOs from the published literature, as well as the sample obtained in this study. The damages of C. albicans cells upon treatment with CEO was observed using a scanning electron microscope. The mechanisms of its antifungal effect at a subinhibitory concentration of 0.1 x MIC were determined using microbial metabolomics and network analysis. The functional components were studied using the greedy algorithm and molecular ***: A total of 69 compounds were identified in the chemical analysis of CEO, which accounted for 90% of the sample. The major compounds were terpenoids (34.04%), aromatic compounds (4.52%), aliphatic compounds (0.9%), and others. Hierarchical cluster analysis of the compositions of 20 essential oils extracted from Cinnamomum cassia grown in different geographical locations showed a wide diversity of chemical composition with four major chemotypes. CEO showed strong antifungal activity and caused destruction of cell membranes in a concentration-dependent way. Metabolic fingerprint a

关键词： Cinnamomum cassia Essential oil Candida albicans Antifungal activity Microbial metabolomics Network pharmacology greedy algorithm Molecular docking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：