检索结果-南通市图书馆

NEH-Based heuristics for the distributed blocking flowshop with makespan criterion

在线全文

cnki会议

学校读者我要写书评

暂无评论

NEH-Based heuristics for the distributed blocking flowshop w...

第三十九届中国控制会议

The distributed blocking flowshop scheduling problem（DBFSP） that is an important generalization of the traditional blocking flowshop scheduling problem（BFSP）, in which the blocking constraint has to be considered. The NEH heuristic is regarded as the best constructive heuristic for the permutation flowshop scheduling problem. Naderi and Ruiz proposed the NEH2 for the distributed permutation flowshop scheduling problem by adding a factory assignment rule to the Nawaz-Enscore-Ham（NEH） heuristic. In this paper, a priority rule is first presented for generating initial sequence for the NEH2. Then, the proposed rescheduling operator is applied in NEH insertion procedure. Additionally, we generated a sequence containing all job twice, and then the solution for the problem is constructed by applying the NEH insertion procedure on each element of the sequence. Based on the above ideas we proposed three NEH-based heuristics, namely NEH2 E, NEH2 Een and NEH2 EE. Computational results demonstrate that the proposed heuristics perform significantly better than the original NEH2.

关键词： distributed flowshop scheduling heuristic blocking NEH makespan

A New Heuristic for PCBs Grouping Problem with Setup Times

在线全文

cnki会议

学校读者我要写书评

暂无评论

A New Heuristic for PCBs Grouping Problem with Setup Times

第三十九届中国控制会议

作者： Jiang-Ping Huang Quan-Ke Pan M Fatih Tasgetiren Ying-Ying Huang School of mechatronic Engineering and Automation Shanghai University International logistics management department Yasar University

In this paper, we present a new heuristic to divide a batch of printed circuit boards(PCBs) into subgroups to save the setup time for loading and unloading components from the assembly machine. In the heuristic, we propose several concepts about similarity to make the number of groups as few as possible. To better show the relationship between the PCB types and the component types of a group, we introduce a new solution representation. In addition, considering the characteristics of the PCBs grouping problem(PGP), a method for pairing PCBs is presented. With the PCB pairs, an iterative scheme is applied to start a new group. We try the rest PCBs one by one according to the similarity between it and the PCB group. Finally, the experiments and comparisons show the good performance of the proposed heuristic.

关键词： Heuristic PCBs Setup time Grouping Similarity

An iterated local search algorithm for distributed assembly permutation flowshop problem

在线全文

cnki会议

学校读者我要写书评

暂无评论

An iterated local search algorithm for distributed assembly ...

第三十九届中国控制会议

作者： Ying-Ying Huang Quan-ke Pan XiaoLu Hu M Fatih Tasgetiren Jiang-ping Huang School of mechanical and Electrical Engineering and Automation Shanghai University China Rural Technology Development Center International logistics management department Yasar University

Nowadays,the distributed assembly permutation flowshop problem（DAPFSP） has important applications in practice.In this paper,we propose a group iterated local search（gILS） algorithm to solve the problem with total flowtime（TF） criterion.We use the heuristic method based on a ascending order,which is originated from the NEH.In order to simplify and optimize the algorithm,we introduce two kinds of local search methods based on products and jobs respectively.In addition,considering the diversity of search area,we propose a probabilistic random selection based on the TF value and the number of iterations to determine the optimized solution.Acceptance criterion is a simple comparison to determine whether a new solution is acceptable or not.Finally,we calculate 180 instances with our proposed algorithm and compare the results with those from the recent effective algorithms.The results verify the superiority of the presented gILS algorithm.

关键词： Distributed flowshop scheduling Assembly line scheduling Iterated local search Total flowtime

An improved discrete artificial bee colony algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance

在线全文

cnki会议

学校读者我要写书评

暂无评论

An improved discrete artificial bee colony algorithm for the...

第三十九届中国控制会议

作者： Jiayang mao XiaoLu Hu Quan-ke Pa Zhonghua miao Chuangxin He M Fatih Tasgetiren School of mechanical and Electrical Engineering and Automation Shanghai University China Rural Technology Development Center International logistics management department Yasar University

The distributed permutation flowshop scheduling problem with preventive maintenance operator（Pm/DPFSP） is closely related to modern industry.This paper presents an improved discrete artificial bee colony（IDABC） algorithm for solving this problem.The criterion to be optimized is the makespan.An improved NEH heuristic method is proposed to initialize the population effectively.We adapted a local search method with insertion and swap operator to produce neighboring solutions in employ bee phase and onlooker bee phase.A global search method with destruction and reconstruction phase is introduced to avoid local optima in scout bee phase.The parameters for the proposed IDABC are calibrated by means of a design of experiments and analysis of variance.We conduct extensive experiments to test the performance of IDABC.Computational results indicate that IDABC has promising advantages on Pm/DPFSP.

关键词： Distributed scheduling Flowshop Preventive maintenance Artificial bee colony

An iterated greedy algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime

在线全文

cnki会议

学校读者我要写书评

暂无评论

An iterated greedy algorithm for the distributed permutation...

第三十九届中国控制会议

作者： Jiayang mao XiaoLu Hu Quan-ke Pan Zhonghua miao Chuangxin He M Fatih Tasgetiren School of mechanical and Electrical Engineering and Automation Shanghai University China Rural Technology Development Center International logistics management department Yasar University

In recent years,the distributed permutation flowshop scheduling problem（DPFSP） has been widely studied.In this paper,we extended the DPFSP by considering preventive maintenance（Pm） operation to prevent machines from breaking down after the long process.An iterated greedy（IG） algorithm is developed to minimize total flowtime.A heuristic with swapping operator is proposed to initialize the IG.After that,the destruction phase and construction phase are modified to fit our problem.A local search is then applied to further improve the solution generated in the construction stage.At last,a simple simulated annealing-like acceptance criterion is used to prevent local optimal situations.Comparison with three state-of-the art algorithms in the recent literature based on 225 instances shows the high performance of our IG algorithm for solving the DPFSP with Pm operation.

关键词： Distributed scheduling Flowshop Preventive maintenance

Cancer drug resistance in multiple myeloma

在线全文

cnki会议

学校读者我要写书评

暂无评论

Cancer Drug Resistance 2022年第2期5卷 271-276页

作者： fatih m.Uckun Departmens of Oncology and Developmental Therapeutics Ares PharmaceuticalsSt.PaulMN 55110USA Departmens of Translational Oncology Reven PharmaceuticalsWestminsterCO 80234USA.

INTRODUCTION multiple myeloma(mm)is the second most common hematologic malignancy after non-Hodgkin’s lymphoma.Intrinsic and acquired drug resistance of cancer cells to standard drugs is a major obstacle for a more successful survival outcome of mm patients treated on contemporary clinical protocols.The primary purpose of this special issue on“Drug Targets and Resistance mechanisms in multiple myeloma”was to collect new and transformative information regarding new insights about the mechanisms of drug resistance in mm and the role of the tumor microenvironment in treatment failures.

关键词： drug myeloma drugs

机器学习法预测AZ91合金在干滑动摩擦条件下的磨损性能

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Transactions of Nonferrous metals Society of China 2021年第1期31卷 125-137页

作者： fatih AYDIN Rafet DURGUT Department of metallurgical and materials Engineering Karabuk UniversityKarabukTurkey Department of Computer Engineering Karabuk UniversityKarabukTurkey

研究在不同载荷(10~50 N)、滑动速度(160~220 mm/s)及滑动距离(250~1000 m)条件下AZ91合金的磨损行为。结果表明,在一定的滑动距离和滑动速度下,磨损体积损失随负载的增加而增加。当滑动速度为220 mm/s和滑动距离为1000 m时,载荷10、20... 详细信息

研究在不同载荷(10~50 N)、滑动速度(160~220 mm/s)及滑动距离(250~1000 m)条件下AZ91合金的磨损行为。结果表明,在一定的滑动距离和滑动速度下,磨损体积损失随负载的增加而增加。当滑动速度为220 mm/s和滑动距离为1000 m时,载荷10、20、30、40及50 N下合金的体积损失分别为15.0、19.0、24.3、33.9及37.4 mm3。磨损表面显示,载荷为10 N时磨损表面存在磨损和氧化现象,载荷为50 N时发生分层现象。ANOVA结果显示,载荷、滑动距离和滑动速度的贡献率分别为12.99%、83.04%及3.97%。采用人工神经网络(ANN)、支持向量回归(SVR)和随机森林(RF)对AZ91合金的体积损失进行预测。SVR、RF及ANN的相关系数(R2)分别为0.9245、0.980及0.9845。因此,ANN模型能较好地预测AZ91合金的耐磨性能。

关键词： AZ91合金磨损性能人工神经网络支持向量回归随机森林方法

Exploiting natural language services:a polarity based black-box attack

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2022年第5期16卷 213-215页

作者： Fatma GUmUS m.fatih AmASYALI Department of Computer Engineering Yildiz Technical UniversityIstanbul 34220Turkey Department of Computer Engineering Air Force AcademyNational Defence UniversityIstanbul 34149Turkey

1 Introduction Production input of Natural Language Processing(NLP)services can be be manipulated with malicious intent in order to lower the performance to a level that compromises the integrity of the service without any information on the underlying model.The adversaries that perform word-level input perturbations in black-box settings first detect the“important”words,then perform noisy operations,such as replacement or deletion.Gao et al.[1]assigned word importance scores(temporal scores)calculated via querying the partial input for each individual sample.By this procedure,they queried the victim model on both the word score calculation and the perturbation stage,which potentially caused a big requestresponse overhead.In comparison,we only calculate the word importance scores(polarity score)once using an external dataset,and without querying the victim model.

关键词： services service individual

Wilms’tumor gene(WT1)is strongly expressed in high-risk subsets of pediatric acute lymphoblastic leukemia

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Cancer Drug Resistance 2018年第4期1卷 250-265页

作者： fatih m.Uckun Sanjive Qazi Biomarker Research Program AresMIT Biomedical Computational Strategies(ABCS)MinneapolisMinnesota 55110USA Biotherapy Program Ares PharmaceuticalsLLCSt.PaulMinnesota 55110USA Bioinformatics Program Gustavus Adolphus CollegeSt.PeterMinnesota 56082USA

Aim:The purpose of the present study was to perform a comprehensive analysis of WT1 gene expression in high-risk pediatric acute lymphoblastic leukemia(ALL).methods:We performed a meta-analysis of WT1 gene expression for normal hematopoietic cells vs.primary leukemia cells from 801 pediatric ALL samples deposited in the Oncomine database combined with an in-depth gene expression analysis using our in-house database of gene expression profiles of primary leukemia cells from 1416 pediatric ALL cases.We also examined the expression of WT1 in primary leukemic cells from 299 T-lineage ALL patients in the Oncomine database and 189 T-lineage ALL patients in the archived datasets GSE13159,GSE13351,and GSE13159.Results:Our data provide unprecedented evidence that primary leukemia cells from patients with mLL gene rearrangements(mLL-R)express highest levels of WT1 expression within the high-risk subsets of pediatric B-lineage ALL.Notably,mLL-R^(+)patients exhibited>6-fold higher expression levels of the WT1 gene compared to the other B-lineage ALL subtypes combined(PmLL-R^(+)infant B-lineage ALL cases uniquely demonstrated that WT1 is expressed at 1.5-4.2-fold higher levels in mLL-R^(+)infant leukemia cells than in normal hematopoietic cells and revealed that WT1 expression level was substantially higher in steroid-resistant infant leukemia cells when compared to non-leukemic healthy bone marrow cells.Furthermore,our study demonstrates for the first time that the WT1-regulated EWSR1,TP53,U2AF2,and WTAP genes(i.e.,WT1 interactome)were differentially upregulated in mLL-R^(+)leukemia cells illustrating that the mLL-regulatory pathway is aberrantly upregulated in mLL-R^(+)pediatric B-lineage ALL.These novel insights provide a compelling rationale for targeting WT1 in second line treatment of mLL-R^(+)pediatric B-lineage ALL,including mLL-R^(+)infant ALL.Furthermore,our study is the first to demonstrate that leukemia cells from 370 Ph-like patients had significantly higher WT1 expression when compare

关键词： Wilms’tumor gene WT1 gene leukemia chemotherapy resistance immunotherapy