|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Estimation of infiltration models parameters and their comparison to simulate the onsite soil infiltration characteristics显示文摘Detailed knowledge about soil characteristics and site-specific final steady infiltration rate could help to increase the irrigation water use efficiency and decrease water losses in agricultural system.The experiments were conducted on Agricultural Research Farm of Bahauddin Zakariya University,Multan,Pakistan during 2016.The cumulative infiltration depth was measured using double ring infiltrometer at selected six points of the study area.Most commonly used infiltration models such as Kostikov’s,Philip’s and Horton’s were fitted to the field infiltration data for determination of model parameters and to find the best fit model for the study area.Kostikov’s infiltration model’s parameters such as empirical constant‘c’and infiltration decay constants‘k’were obtained in the ranges of 0.140-0.290 and 0.307-0.433,respectively.Philip’s infiltration model’s parameters such as sorptivity‘S’and conductivity constant‘A’were found in the ranges of 0.167-0.288 cm/min1/2 and-0.001 to-0.009 cm/min,respectively.Similarly,the Horton’s model’s‘parameter‘k’was obtained in the range of-1.619 to-1.238.The value of infiltration capacity at onset of infiltration(fo)was obtained as 1.744 to 3.491 for all the six points.The analysis showed that the infiltration models using the estimated parameters have satisfactory prediction capability at all the selected points.Horton’s model provided the lowest mean values for RMSE(0.235)and highest mean values for ME(94%);and the lowest mean values for MPD(0.127).This indicated that infiltration can be well-described by the Horton’s model at the selected site. | Hafiz Umar Farid Zahid Mahmood-Khan Ijaz Ahmad Aamir Shakoor Muhammad Naveed Anjum Muhammad Mazhar Iqbal Muhammad Mubeen Muhammad Asghar | 2019 | International Journal of Agricultural and Biological Engineering2019，12，3： | 0 |
| 2 | Genome editing in cotton:challenges and opportunities显示文摘Cotton has enormous economic potential providing high-quality protein,oil,and fibre.A large increase in cotton output is necessary due to the world’s changing climate and constantly expanding human population.In the past,conventional breeding techniques were used to introduce genes into superior cotton cultivars to increase production and to improve quality.The disadvantages of traditional breeding techniques are their time-consuming,reliance on genetic differences that are already present,and considerable backcrossing.To accomplish goals in a short amount of time,contemporary plant breeding techniques,in particular modern genome editing technologies(GETs),can be used.Numerous crop improvement initiatives have made use of GETs,such as zinc-finger nucleases,transcription-activator-like effector nucleases,clustered regularly interspaced palindromic repeats(CRISPR),and CRISPR-associated proteins systems(CRISPR/Cas)-based technologies.The CRISPR/Cas system has a lot of potential because it combines three qualities that other GETs lack:simplicity,competence,and adaptability.The CRISPR/Cas mechanism can be used to improve cotton tolerance to biotic and abiotic stresses,alter gene expression,and stack genes for critical features with little possibility of segregation.The transgene clean strategy improves CRISPR acceptability addressing regulatory issues associated with the genetically modified organisms(GMOs).The research opportunities for using the CRISPR/Cas system to address biotic and abiotic stresses,fibre quality,plant architecture and blooming,epigenetic changes,and gene stacking for commercially significant traits are highlighted in this article.Furthermore,challenges to use of CRISPR technology in cotton and its potential for the future are covered in detail. | KHAN Zulqurnain KHAN Sultan Habibullah AHMED Aftab IQBAL Muhammad Umar MUBARIK Muhammad Salman GHOURI Muhammad Zubair AHMAD Furqan YASEEN Saba ALI Zulfiqar KHAN Asif Ali AZHAR Muhammad Tehseen | 2023 | Journal of Cotton Research2023，6，1： | 0 |
| 3 | A Perfect Knob to Scale Thread Pool on Runtime显示文摘Scalability is one of the utmost nonfunctional requirement of server applications,because it maintains an effective performance parallel to the large fluctuating and sometimes unpredictable workload.In order to achieve scalability,thread pool system(TPS)has been used extensively as a middleware service in server applications.The size of thread pool is the most significant factor,that affects the overall performance of servers.Determining the optimal size of thread pool dynamically on runtime is a challenging problem.The most widely used and simple method to tackle this problem is to keep the size of thread pool equal to the request rate,i.e.,the frequencyoriented thread pool(FOTP).The FOTPs are the most widely used TPSs in the industry,because of the implementation simplicity,the negligible overhead and the capability to use in any system.However,the frequency-based schemes only focused on one aspect of changes in the load,and that is the fluctuations in request rate.The request rate alone is an imperfect knob to scale thread pool.Thus,this paper presents a workload profiling based FOTP,that focuses on request size(service time of request)besides the request rate as a knob to scale thread pool on runtime,because we argue that the combination of both truly represents the load fluctuation in server-side applications.We evaluated the results of the proposed system against state of the art TPS of Oracle Corporation(by a client-server-based simulator)and concluded that our system outperformed in terms of both;the response times and throughput. | Faisal Bahadur Arif Iqbal Umar Insaf Ullah Fahad Algarni Muhammad Asghar Khan Samih M.Mostafa | 2022 | Computers, Materials & Continua2022，，7： | 0 |
| 4 | Negotiation Based Combinatorial Double Auction Mechanism in Cloud Computing显示文摘Cloud computing is a demanding business platform for services related to the field of IT.The goal of cloud customers is to access resources at a sustainable price,while the goal of cloud suppliers is to maximize their services utilization.Previously,the customers would bid for every single resource type,which was a limitation of cloud resources allocation.To solve these issues,researchers have focused on a combinatorial auction in which the resources are offered by the providers in bundles so that the user bids for their required bundle.Still,in this allocation mechanism,some drawbacks need to be tackled,such as due to the lower average bid price the users are dropped from the auction process.To solve this problem,we proposed a“Negotiation based Combinatorial Double Auction Mechanism for Resource Allocation(N-CDARA)in cloud computing”.The proposed method negotiates with dropped users.Lower average bid price users are asked by our proposed mechanism to increase their bids,as by the quoted bids they will be dropped by the auctioneer.Most of the users that are close to winning accept the proposal and increase their bid prices.The proposed mechanism is implemented in a CloudSim simulation toolkit.Results are compared with the latest model and performance study shows that in our proposed scheme more users win and get their requested services and the utilization of offered services is increased up to 18.4%than the existing schemes. | Zakir Ullah Asif Umer Mahdi Zaree Jamil Ahmad Faisal Alanazi Noor Ul Amin Arif Iqbal Umar Ali Imran Jehangiri Muhammad Adnan | 2021 | Computers, Materials & Continua2021，，11： | 0 |
| 5 | The Double Edge Sword Based Distributed Executor Service显示文摘Scalability is one of the most important quality attribute of softwareintensive systems,because it maintains an effective performance parallel to the large fluctuating and sometimes unpredictable workload.In order to achieve scalability,thread pool system(TPS)(which is also known as executor service)has been used extensively as a middleware service in software-intensive systems.TPS optimization is a challenging problem that determines the optimal size of thread pool dynamically on runtime.In case of distributed-TPS(DTPS),another issue is the load balancing b/w available set of TPSs running at backend servers.Existing DTPSs are overloaded either due to an inappropriate TPS optimization strategy at backend servers or improper load balancing scheme that cannot quickly recover an overload.Consequently,the performance of software-intensive system is suffered.Thus,in this paper,we propose a new DTPS that follows the collaborative round robin load balancing that has the effect of a double-edge sword.On the one hand,it effectively performs the load balancing(in case of overload situation)among available TPSs by a fast overload recovery procedure that decelerates the load on the overloaded TPSs up to their capacities and shifts the remaining load towards other gracefully running TPSs.And on the other hand,its robust load deceleration technique which is applied to an overloaded TPS sets an appropriate upper bound of thread pool size,because the pool size in each TPS is kept equal to the request rate on it,hence dynamically optimizes TPS.We evaluated the results of the proposed system against state of the art DTPSs by a clientserver based simulator and found that our system outperformed by sustaining smaller response times. | Faisal Bahadur Arif Iqbal Umar Insaf Ullah Fahad Algarni Muhammad Asghar Khan | 2022 | Computer Systems Science & Engineering2022，42，8： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员