Nandhini Jembu Mohanram^1,2,*, Gnanasekaran Thangavel³, N. M. Jothi Swaroopan⁴

Computer Systems Science and Engineering, Vol.38, No.2, pp. 215-228, 2021, DOI:10.32604/csse.2021.015027

Abstract Fault tolerance (FT) schemes are intended to work on a minimized and static amount of physical resources. When a host failure occurs, the conventional FT frequently proceeds with the execution on the accessible working hosts. This methodology saves the execution state and applications to complete without disruption. However, the dynamicity of open cloud assets is not seen when taking scheduling choices. Existing optimization techniques are intended in dealing with resource scheduling. This method will be utilized for distributing the approaching tasks to the VMs. However, the dynamic scheduling for this procedure doesn’t accomplish the objective of adaptation of internal failure.… More >

Naiwei Lu^1,*, Honghao Wang¹, Kai Wang¹, Yang Liu²

CMES-Computer Modeling in Engineering & Sciences, Vol.127, No.1, pp. 345-360, 2021, DOI:10.32604/cmes.2021.013792

Abstract The steadily growing traffic load has resulted in lots of bridge collapse events over the past decades, especially for short-to-medium span bridges. This study investigated probabilistic and dynamic traffic load effects on short-to-medium span bridges using practical heavy traffic data in China. Mathematical formulations for traffic-bridge coupled vibration and probabilistic extrapolation were derived. A framework for extrapolating probabilistic and dynamic traffic load effect was presented to conduct an efficient and accurate extrapolation. An equivalent dynamic wheel load model was demonstrated to be feasible for short-to-medium span bridges. Numerical studies of two types of simply-supported bridges were conducted based on site-specific… More >

Xueping Fan^*, Guanghong Yang, Zhipeng Shang, Xiaoxiong Zhao, Yuefei Liu^*

Structural Durability & Health Monitoring, Vol.15, No.1, pp. 69-83, 2021, DOI:10.32604/sdhm.2021.011922

Abstract This article presented a new data fusion approach for reasonably predicting dynamic serviceability reliability of the long-span bridge girder. Firstly, multivariate Bayesian dynamic linear model (MBDLM) considering dynamic correlation among the multiple variables is provided to predict dynamic extreme deflections; secondly, with the proposed MBDLM, the dynamic correlation coefficients between any two performance functions can be predicted; finally, based on MBDLM and Gaussian copula technique, a new data fusion method is given to predict the serviceability reliability of the long-span bridge girder, and the monitoring extreme deflection data from an actual bridge is provided to illustrated the feasibility and application… More >

Kun Ding¹, Shanshan Liu¹, Yuhao Zhang², Hui Zhang¹, Xiaoxiong Zhang^1,*, Tongtong Wu^2,3, Xiaolei Zhou¹

CMC-Computers, Materials & Continua, Vol.68, No.1, pp. 377-389, 2021, DOI:10.32604/cmc.2021.016301

Abstract The joint extraction of entities and their relations from certain texts plays a significant role in most natural language processes. For entity and relation extraction in a specific domain, we propose a hybrid neural framework consisting of two parts: a span-based model and a graph-based model. The span-based model can tackle overlapping problems compared with BILOU methods, whereas the graph-based model treats relation prediction as graph classification. Our main contribution is to incorporate external lexical and syntactic knowledge of a specific domain, such as domain dictionaries and dependency structures from texts, into end-to-end neural models. We conducted extensive experiments on… More >

Xiaoli Li¹, Shuailing Zhou¹, Zixu An^2,*, Zhenlong Du¹

CMC-Computers, Materials & Continua, Vol.67, No.3, pp. 3765-3780, 2021, DOI:10.32604/cmc.2021.012422

Abstract Rough set theory has been widely researched for time series prediction problems such as rainfall runoff. Accurate forecasting of rainfall runoff is a long standing but still mostly significant problem for water resource planning and management, reservoir and river regulation. Most research is focused on constructing the better model for improving prediction accuracy. In this paper, a rainfall runoff forecast model based on the variable-precision fuzzy neighborhood rough set (VPFNRS) is constructed to predict Watershed runoff value. Fuzzy neighborhood rough set define the fuzzy decision of a sample by using the concept of fuzzy neighborhood. The fuzzy neighborhood rough set… More >

Priya Baldoss^1,2,*, Gnanasekaran Thangavel³

CMC-Computers, Materials & Continua, Vol.67, No.1, pp. 253-265, 2021, DOI:10.32604/cmc.2021.013695

Abstract In the present scenario, cloud computing service provides on-request access to a collection of resources available in remote system that can be shared by numerous clients. Resources are in self-administration; consequently, clients can adjust their usage according to their requirements. Resource usage is estimated and clients can pay according to their utilization. In literature, the existing method describes the usage of various hardware assets. Quality of Service (QoS) needs to be considered for ascertaining the schedule and the access of resources. Adhering with the security arrangement, any additional code is forbidden to ensure the usage of resources complying with QoS.… More >

Mugang Lin^1,2,*, Fangju Liu³, Huihuang Zhao^1,2, Jianzhen Chen^1,2

CMES-Computer Modeling in Engineering & Sciences, Vol.125, No.1, pp. 197-214, 2020, DOI:10.32604/cmes.2020.09502

Abstract Given a connected undirected graph G whose edges are labeled, the minimum labeling spanning tree (MLST) problem is to find a spanning tree of G with the smallest number of different labels. The MLST is an NP-hard combinatorial optimization problem, which is widely applied in communication networks, multimodal transportation networks, and data compression. Some approximation algorithms and heuristics algorithms have been proposed for the problem. Firey algorithm is a new meta-heuristic algorithm. Because of its simplicity and easy implementation, it has been successfully applied in various fields. However, the basic firefly algorithm for the MLST problem is proposed in this… More >

Sardar Khaliq uz Zaman¹, Tahir Maqsood¹, Mazhar Ali¹, Kashif Bilal¹, Sajjad A. Madani¹, Atta ur Rehman Khan^2,*

Computer Systems Science and Engineering, Vol.34, No.2, pp. 79-90, 2019, DOI:10.32604/csse.2019.34.079

Abstract Optimal task allocation in Large-Scale Computing Systems (LSCSs) that endeavors to balance the load across limited computing resources is considered an NP-hard problem. MinMin algorithm is one of the most widely used heuristic for scheduling tasks on limited computing resources. The MinMin minimizes makespan compared to other algorithms, such as Heterogeneous Earliest Finish Time (HEFT), duplication based algorithms, and clustering algorithms. However, MinMin results in unbalanced utilization of resources especially when majority of tasks have lower computational requirements. In this work we consider a computational model where each machine has certain bounded capacity to execute a predefined number of tasks… More >

Morteza Okhovvat, Mohammad Reza Kangavari^*

Computer Systems Science and Engineering, Vol.34, No.1, pp. 13-21, 2019, DOI:10.32604/csse.2019.34.013

Abstract Existing works on scheduling in Wireless Sensor Actor Networks (WSANs) are mostly concerned with energy savings and ignore time constraints and thus increase the make-span of the network. Moreover, these algorithms usually do not consider balance of workloads on the actor nodes and hence, sometimes some of the actors are busy when some others are idle. These problem causes the actors are not utilized properly and the actors’ lifetime is reduced. In this paper we take both time awareness and balance of workloads on the actor in WSANs into account and propose a convex optimization model (TAMMs) to minimize make-span.… More >

Morteza Okhovvat, Mohammad Reza Kangavari^*

Computer Systems Science and Engineering, Vol.34, No.1, pp. 5-12, 2019, DOI:10.32604/csse.2019.34.005

Abstract In this paper, we propose a mathematical task dispatching model to reduce the total tasks completion time, i.e. make-span, in Wireless Sensor Actor Networks (WSANs). The proposed approach minimizes the completion time of tasks that have been allocated to actors but have not yet been dispatched to actors for execution in the networks. We calculate the best rate of dispatching of tasks by the network sink to allocated actors through a steady state analysis of our proposed model to solve equations and inequalities. It is shown that this dispatching rate improves the network lifetime too. Experimental results with a prototyped… More >