Haiyang Zhang¹, Guolong Chen², Xianwei Li^2,3,*

Computer Systems Science and Engineering, Vol.34, No.4, pp. 249-254, 2019, DOI:10.32604/csse.2019.34.249

Abstract As a new computing paradigm, cloud computing has received much attention from research and economics fields in recent years. Cloud resources can be priced according to several pricing options in cloud markets. Usage-based and reserved pricing schemes are commonly adopted by leading cloud service providers (CSPs) such as Amazon and Google. With more and more CSPs entering cloud computing markets, the pricing of cloud resources is an important issue that they need to consider. In this paper, we study how to segment cloud resources using hybrid pricing schemes in order to obtain the maximum revenue More >

Jianxun Deng¹, Jing Chen², Dingcheng Wang³

Computer Systems Science and Engineering, Vol.34, No.4, pp. 201-206, 2019, DOI:10.32604/csse.2019.34.201

Abstract In order to meet the needs of high-altitude glass curtain wall cleaning, a multi-suction sliding cleaning robot was designed. The sliding robot sucker, cleaning system, obstacle avoidance and rotation ability, walking circuit and mobile working principle of the cleaning robot were designed. This involved the analysis of the robot’s anti-rollover mechanics during adsorption, of robotic winds when working at height, and of anti-sliding mechanics during robot movement, in order to explore feasible ways to improve the robot’s adsorption performance. The relationship between the effective diameter D of the suction cup, the vacuum degree △ P, More >

Fengxiang Zhang^∗

Computer Systems Science and Engineering, Vol.34, No.4, pp. 171-178, 2019, DOI:10.32604/csse.2019.34.171

Abstract This paper addresses a number of mathematical issues related to multiprocessor global EDF platforms. We present a deadline-d all busy period and backward interference which are important concepts for multiprocessor EDF systems, and some general schedulability conditions for any studied job are proposed. We formally prove that at most m-1 different tasks’ jobs could contribute their execution time to an interval starting with a P_busy−d, and we propose an approach for computing an exact upper bound of the total deadline-d task load in a given interval. Therefore, the proposed results are important foundations for constructing exact More >

Zheng Xu

Computer Systems Science and Engineering, Vol.34, No.4, pp. 169-170, 2019, DOI:10.32604/csse.2019.34.169

Abstract This article has no abstract. More >

Yuanyuan Xue^1,2, Qi Li¹, LingFeng¹

Computer Systems Science and Engineering, Vol.34, No.3, pp. 151-164, 2019, DOI:10.32604/csse.2019.34.151

Abstract Stress is a common problem all over the world. More and more teenagers today have to cope with different stressor events coming from school, family, peer relation, self-cognition, romantic relation, etc. Over-stress without proper guidance will lead to a series of potential problems including physical and mental disorders, and even suicide due to the shortage of teen’ s psychological endurance and controllability. Therefore, it is necessary and important to timely sense adolescents’ stress and help them release the stress properly. In this paper, we present a micro-blog based system called TeenSensor, aiming to detect teens… More >

Ahmet Elbir^1,∗, Hamza Osman Ilhan¹, Nizamettin Aydin¹

Computer Systems Science and Engineering, Vol.34, No.2, pp. 101-107, 2019, DOI:10.32604/csse.2019.34.101

Abstract The performances of the multivariate techniques are directly related to the variable selection process, which is time consuming and requires resources for testing each possible parameter to achieve the best results. Therefore, optimization methods for variable selection process have been proposed in the literature to find the optimal solution in short time by using less system resources. Contrast enhancement is the one of the most important and the parameter dependent image enhancement technique. In this study, two optimization methods are employed for the variable selection for the contrast enhancement technique. Particle swarm optimization (PSO) and More >

Mohammad Behrouzian Nejad¹, Mohammad Ebrahim Shiri^1,2,*

Computer Systems Science and Engineering, Vol.34, No.2, pp. 91-100, 2019, DOI:10.32604/csse.2019.34.091

Abstract In this paper we propose a new image classification technique. According to this note that most research focuses on extraction of features in the frequency domain, location, and reduction of feature dimensions, in this research we focused on learning step in image classification. The main aim is to use the heuristic methods to increase the function of the estimator of the learning algorithm and continue to achieve the desired state, as well as categorization without user interference and automatically performed by the model produced from the above steps. So, in this paper, a new learning… 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… More >

Resul Das^1,∗, Muhammet Baykara¹, Gurkan Tuna²

Computer Systems Science and Engineering, Vol.34, No.1, pp. 23-32, 2019, DOI:10.32604/csse.2019.34.023

Abstract One of the most well-known and used algorithms for Steganography is Least Significant Bit (LSB) substitution. Although LSB has several advantages such as simplicity, efficiency, and easy-to-do implementation, it has some distinct disadvantages such as it openness to miscellaneous attacks. In this study, we aim to improve the traditional LSB algorithm by eliminating its main disadvantage, being easy to detect, and this way propose an enhanced LSB algorithm called E-LSB. We mainly aim to minimize differences which are due to encryption and image hiding steps in LSB algorithm and make it more difficult to notice… 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… More >