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

An integer-valued threshold autoregressive process based on negative binomial thinning

STATISTICAL PAPERS 2018年第3期59卷 1131-1160页

作者： Yang, Kai Wang, Dehui Jia, Boting Li, Han Jilin Univ Inst Math Changchun 130012 Jilin Peoples R China Jilin Univ Finance & Econ Sch Stat Changchun 130117 Jilin Peoples R China

In this paper, we introduce an integer-valued threshold autoregressive process, which is driven by independent negative-binomial distributed random variables and based on negative binomial thinning. Basic probabilistic and statistical properties of this model are discussed. Conditional least squares and conditional maximum likelihood estimators and corresponding iterative algorithms are investigated for both the cases that the threshold variable is known or not. Also, the asymptotic properties of the estimators are obtained. Finally, some numerical results of the estimates and a real data example are presented.

关键词： Integer-valued thresholdmodels min-min algorithm Negative binomial thinning Estimation

来源：评论

学校读者我要写书评

暂无评论

A threshold modeling for nonlinear time series of counts: application to COVID-19 data

引用

TEST 2023年第4期32卷 1195-1229页

作者： Shamma, Nisreen Mohammadpour, Mehrnaz Shirozhan, Masoumeh Univ Mazandaran Fac Math Sci Babolsar Iran Water & Wastewater Co Mazandaran Mazandaran Prov Iran

This article studies a threshold autoregressive model with the dependent thinning structure for modeling nonlinear time series of counts. Some properties are derived for the model and two approaches in estimation are applied, the modified conditional least square and conditional maximum likelihood methods which are adjusted by the min-min algorithm. The unknown threshold parameter is estimated using the nested sub-sample search algorithm and the minimum of maximized log-likelihood function methods. The efficiency of the estimators is evaluated using a simulation study. The application of the model is discussed on the COVID-19 data set.

关键词： Dependent counting series False position method Integer-valued threshold autoregressive model min-min algorithm D-NeSS algorithm

来源：评论

学校读者我要写书评

暂无评论

Task-scheduling algorithm based on Improved Genetic algorithm in Cloud Computing Environment

引用

RECENT ADVANCES IN ELECTRICAL & ELECTRONIC ENGINEERING 2021年第1期14卷 13-19页

作者： Weiqing, G. E. Cui, Yanru Univ Technol City Coll Dongguan Dongguan Guangdong Peoples R China

Background: min-min and max-min algorithms were combined on the basis of the traditional genetic algorithm to make up for its shortcomings. Methods: In this paper, a new cloud computing task-scheduling algorithm that introduces min-min and max-min algorithms to generate initialization population, selects task completion time and load balancing as double fitness functions, and improves the quality of initialization population, algorithm searchability and convergence speed, was proposed. Results: The simulation results proved that the cloud computing task-scheduling algorithm was superior to and more effective than the traditional genetic algorithm. Conclusion: The paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.

关键词： Cloud computing genetic algorithm task scheduling min-min algorithm max-min algorithm EIGA scheduling

来源：评论

学校读者我要写书评

暂无评论

A Task Scheduling Approach for Cloud Resource Management

A Task Scheduling Approach for Cloud Resource Management

引用

4th World Conference on Smart Trends in Systems, Security and Sustainability (WorldS4)

作者： Shi, Yong Suo, Kun Kemp, Steven Hodge, Jameson Kennesaw State Univ Coll Comp & Software Engn Marietta GA 30060 USA

ISBN: (纸本)9781728168234

As an emerging subfield of computer science, cloud computing is increasingly relevant to both academia and numerous industries as a solution to high harriers of entry in configuring and maintaining computing hardware and inflexible platform constraints. One vital aspect of cloud computing is task scheduling, which deals with the strategies in assigning tasks to computing resources. There are numerous commonly used task scheduling algorithms defined by their performance trade-off among various factors such as cutting down the completion time and increasing throughput. In this paper, an algorithm called Bmin is designed to augment the performance for algorithm min-min. Using the Cloud Sim package as a framework for simulating cloud processes, we conduct our experiments, yielding experimental results that demonstrate decreased completion time, increased throughput, and improved load balancing of resources outperforming the classical algorithm.

关键词： Task Scheduling min-min algorithm Cloud Computing Work Balance Cloud Simulation

来源：评论

学校读者我要写书评

暂无评论

A novel load balancing method based on genetic algorithm in grid computing system

A novel load balancing method based on genetic algorithm in ...

引用

International Symposium on Advances in Computer and Sensor Networks and Systems

作者： Shu, Wanneng S Cent Univ Natl Coll Comp Sci Wuhan 430074 Peoples R China

ISBN: (纸本)9781427629807

Load balancing is a very important and complex problem in grid computing. Grid computing differs from traditional high performance computing systems in the heterogeneity of the computing nodes and communication links, as well as background workloads that may be present in the computing nodes. There is a need to develop algorithms that could capture this complexity yet can be easily implemented and used to solve a wide range of load balancing scenarios. This paper studies min-min chromosome genetic algorithm (MCGA) to gauge their suitability for solving grid load balancing problems. The effectiveness of MCGA algorithm is shown for a number of test problems. Performance comparisons with min-min, and genetic algorithm also discussed.

关键词： grid computing load balancing min-min algorithm genetic algorithm min-min chromosome genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Load Balancing Heuristic for Tasks Scheduling in Cloud Environment 19

Load Balancing Heuristic for Tasks Scheduling in Cloud Envir...

引用

19th International Conference on Enterprise Information Systems (ICEIS)

作者： Bey, Kadda Beghdad Benhammadi, Farid Boudaren, Mohamed El Yazid Khamadja, Salim Ecole Mil Polytech Informat Syst Lab Algiers 16111 Algeria Ecole Mil Polytech Algiers 16111 Algeria

ISBN: (纸本)9789897582479

Distributed systems, a priori intended for applications by connecting distributed entities, have evolved into supercomputing to run a single application. Currently, Cloud Computing has arisen as a new trend in the world of IT (Information Technology). Cloud computing is an architecture in full development and has become a new computing model for running scientific applications. In this context, resource allocation is one of the most challenging problems. Indeed, assigning optimally the available resources to the needed cloud applications is known to be an NP complete problem. In this paper, we propose a new task scheduling strategy for resource allocation that minimizes the completion time (makespan) in cloud computing environment. To show the interest of the proposed solution, experiments are conducted on a simulated dataset.

关键词： Cloud Computing Task Scheduling Resource Allocation Makespan Optimization min-min algorithm

来源：评论

学校读者我要写书评

暂无评论

LBSR: Load balance over slow resources 1

LBSR: Load balance over slow resources

引用

1st International Conference on Computer Applications and Information Security (ICCAIS)

作者： Saber, Walaa E. Rizk, Rawya Y. Moussa, Walid M. Ghonem, Atef M. Port Said Univ Elect Engn Dept Port Said Egypt Suez Canal Univ Elect Engn Dept Ismailia Egypt

ISBN: (纸本)9781538644270

Cloud provides convenient and on demand network access for computing resources available over internet. There are many tasks required to be executed by the available resources to achieve the best performance, reduce response time and utilize resources. Load balancing algorithms that based only on load balancing, improve resource utilization. However these algorithms don't take resource speed and task length in their consideration. On the other hand, load balancing algorithms that based on completion time of tasks and speed of resources to reduce makespan don't take the resource load into their consideration. In this paper, Load Balance over Slow Resources (LBSR) algorithm is proposed. It assigns tasks to resources in a way that results in high load balancing over all resources including very slow ones. The performance of LBSR algorithm is evaluated against three well known load balancing algorithms: min-min, LBIMM, and Optimized TSA algorithms. The simulation results show that LBSR outperforms the other algorithms significantly in terms of makespan, resource utilization, and load deviation. The enhancement reaches more than 50% in some situations.

关键词： component Cloud Computing Load Balance min-min algorithm Makespan Load deviation Utilization

来源：评论

学校读者我要写书评

暂无评论

An Analysis of the Load Scheduling algorithms in the Cloud Computing Environment: A Survey 9

An Analysis of the Load Scheduling Algorithms in the Cloud C...

引用

9th Int Conf Ind Information Syst (ICIIS2014)

作者： Chaudhary, Divya Kumar, Bijendra Netaji Subhas Inst Technol Dept Comp Engn Sect 3 New Delhi 110078 India

ISBN: (纸本)9781479964994

Cloud Computing is a recent developmental paradigm in the field of computing offering huge power to next generation computers. The dynamic provisioning acts as a base for cloud computing facilitating and supporting the network services. It focuses on making the vision of utility computing a reality with pay-as-you-go. It offers immense potential to bloom the world with applications and products focussing on greater resource utilization and scalability. This paper presents the basic cloud computing fundamentals and the concepts of load balancing i.e., scheduling of load in the cloud. It elaborates the existing load scheduling algorithms with their merits/demerits and suitability in the cloud and heterogeneous computing environment and proposes a new perspective for better results as per desired parameters.

关键词： Cloud Computing Load Balancing Scheduling min-min algorithm A* algorithm

来源：评论

学校读者我要写书评

暂无评论

Grid-based Task Scheduling PMTS algorithm

Grid-based Task Scheduling PMTS Algorithm

引用

2nd International Conference on Frontiers of Manufacturing and Design Science (ICFMD 2011)

作者： Qiu, Jianlin Chen, Li Chen, Jianping Gu, Xiang Chen, Yanyun Nantong Univ Sch Comp Sci & Technol Nantong 226019 Jiangsu Peoples R China

ISBN: (纸本)9783037852828

This paper analyses the min-min algorithm and its improved algorithms through the performances of load balance, time span, quality of service and economic principle. Based on the analysis of the merits of these algorithms, we propose an improved algorithm as PMTS (Priority-based maximum time-span algorithm) by integrating. In the instance of the application, we analyse and compare the performances of these algorithms, and experimental results show that, PMTS algorithm is better than other algorithms in the comprehensive performance of load-balance, time-span, quality of service and other aspects.

关键词： min-min algorithm load balance time span PMTS

来源：评论

学校读者我要写书评

暂无评论

Research of load balancing scheduling under grid computing

Research of load balancing scheduling under grid computing

引用

3rd International Conference on Mechanical, Control, and Electronic Information (ICMCEI)

作者： Cai, Chengyu Lou, Yuansheng Hohai Univ Coll Comp & Informat Nanjing 210000 Jiangsu Peoples R China

ISBN: (纸本)9783038351559

In order to make up for the shortage of min-min in load balancing, a new task scheduling algorithm T-Max-Int Under the grid computing has been proposed in this paper. In T-Max-Int, the Loss Degree of Max-Int has been brought into min-min. T was in the form of percentage, which represents the proportion of selected tasks that have loss degree in the total tasks. Then, experiments of T have been taken to make Makespan the minimum. Finally, T-Max-Int, Max-min, min-min were compared, which proved that T-Max-min is better than the other two algorithms in aspects of Makespan and load balancing.

关键词： task scheduling load balance min-min algorithm Max-Int algorithm time loss

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：