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 >

Yuanyuan Xue^1,2, Qi Li¹, TongWu¹, LingFeng¹, Liang Zhao³, FengYu³

Computer Systems Science and Engineering, Vol.34, No.2, pp. 65-78, 2019, DOI:10.32604/csse.2019.34.065

Abstract Suicide has been a perplexing social problem around the world for a long time. Timely sensing hidden suicide risk and offering effective intervention are highly desirable and valuable for individuals and their families. Psychological studies prove that stress status, suicide-related expressions, and social engagement are reliable predictors of suicide risk. However, existing clinical diagnosis can only provide effective treatments to a restricted number of people because of its limited capacity. With the popular usage of social media like microblogs, a new channel to touch the inner world of many potential suicides arises. In this paper,… More >

Vengadeswaran^∗, Balasundaram

Computer Systems Science and Engineering, Vol.34, No.1, pp. 47-60, 2019, DOI:10.32604/csse.2019.34.047

Abstract The tremendous growth of data being generated today is making storage and computing a mammoth task. With its distributed processing capability Hadoop gives an efficient solution for such large data. Hadoop’s default data placement strategy places the data blocks randomly across the nodes without considering the execution parameters resulting in several lacunas such as increased execution time, query latency etc., Also, most of the data required for a task execution may not be locally available which creates data-locality problem. Hence we propose an innovative data placement strategy based on dependency of data blocks across the More >

Meera Sharma¹, H. Pham², V.B. Singh³

Computer Systems Science and Engineering, Vol.34, No.1, pp. 33-46, 2019, DOI:10.32604/csse.2019.34.033

Abstract In Open Source Software (OSS), users report different issues on issues tracking systems. Due to time constraint, it is not possible for developers to resolve all the issues in the current release. The leftover issues which are not addressed in the current release are added in the next release issue content. Fixing of issues result in code changes that can be quantified with a measure known as complexity of code changes or entropy. We have developed a 2-dimensional entropy based mathematical model to determine the leftover issues of different releases of five Apache open source 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 >

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. More >

Reeseo Cha¹, Wonhong Nam^2,*, Jin-Young Choi¹

Computer Systems Science and Engineering, Vol.33, No.6, pp. 447-455, 2018, DOI:10.32604/csse.2018.33.447

Abstract Many programming languages provides mechanism to guarantee the error ranges of exact numbers and intervals. However, when they are integrated with unreliable approximated numbers, we cannot rely on the error-ranges anymore. Such unreliable error-ranges may cause serious errors in programs, and especially in safety critical systems they cost us huge amount of money and/or threaten human’s life. Hence, in this paper, we propose a novel number system to safely perform arithmetic operations with guaranteed error ranges. In the number system, exact numbers are separated from approximated numbers, and approximated numbers with strictly guaranteed error-ranges are More >