Research ArticleOpen accessIn the abstractAccelerating Digital Forensics through Parallel ComputingGhada Elkabbany, Mohamed Rasslan, Heba AslanDigital crimes in the era of big data and cloud computing imposes significant challenges in digital forensics. Cloud environment provides low cost, easy management and reasonable solutions. Moreover, it supports big data structures and solutions (i.e., security, privacy and digital forensics). In order to achieve a secure digital forensics analysis in cloud environment, researchers have proposed solutions with expensive communication … …Journal of Computer Science, Vol. 14, Issue 2 · 20 Feb 2018 · 8,040 accessesView PDFCite
Research ArticleOpen accessIn the abstractQuadrotor Obstacle Avoidance Based on Integral BacksteppingLianchuan Zhang, Young Baik Kim, Kil To ChongThis paper addressed obstacle avoidance problem of a quadrotor in outdoor environment. Path planning was finished by employing classical Dijkstra algorithm and the controller of the quadrotor adopted integral backstepping method. In order to get a smooth trajectory with time optimal and acceleration constraints properties, quantic polynomials were utilized to generate trajectory file. The scheme is particularly practical and useful … …American Journal of Applied Sciences, Vol. 13, Issue 7 · 27 Jul 2016 · 6,985 accessesView PDFCite
Research ArticleOpen accessIn the abstractA VARIANT OF POLLARD'S RHO ATTACK ON ELLIPTIC CURVE CRYPTOSYSTEMSSiham Ezzouak, Mohammed Elamrani, Abdelmalek AziziElliptic Curve cryptosystems appear to be more secure and efficient when requiring small key size to implement than other public key cryptosystems. Its security is based upon the difficulty of solving Elliptic Curve Discrete Logarithm Problem (ECDLP). This study proposes a variant of generic algorithm Pollard's Rho for finding ECDLP using cycle detection with stack and a mixture of cycle … …Journal of Computer Science, Vol. 10, Issue 8 · 9 Apr 2014 · 7,272 accessesView PDFCite
Research ArticleOpen accessIn the abstractIMPROVING FAULT TOLERANT RESOURCE OPTIMIZED AWARE JOB SCHEDULING FOR GRID COMPUTINGK. Nirmala Devi, A. TamilarasiWorkflow brokers of existing Grid Scheduling Systems are lack of cooperation mechanism which causes inefficient schedules of application distributed resources and it also worsens the utilization of various resources including network bandwidth and computational cycles. Furthermore considering the literature, all of these existing brokering systems primarily evolved around models of centralized hierarchical or client/server. In such models, vital responsibility such … …Journal of Computer Science, Vol. 10, Issue 5 · 4 Jan 2014 · 6,904 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Efficient Fault Tolerant Scheduling Approach for Computational GridP. Keerthika, N. KasthuriGrid computing serves as an important technology to facilitate distributed computation computational grids solve large scale scientific problems using heterogeneous geographically distributed resources. Problems like dispatching and scheduling of tasks are considered as major issues in computational grid environment. The Grid Scheduler must select proper resources for executing the tasks with less response time. There are various reasons such as … …American Journal of Applied Sciences, Vol. 9, Issue 12 · 5 Jan 2013 · 7,001 accessesView PDFCite
Research ArticleOpen accessIn the abstractVariable Neighborhood Simplex Search Methods for Global Optimization ModelsPongchanun LuangpaiboonProblem statement: Many optimization problems of practical interest are encountered in various fields of chemical, engineering and management sciences. They are computationally intractable. Therefore, a practical algorithm for solving such problems is to employ approximation algorithms that can find nearly optimums within a reasonable amount of computational time. Approach: In this study the hybrid methods combining the Variable Neighborhood Search … …Journal of Computer Science, Vol. 8, Issue 4 · 15 Feb 2012 · 6,517 accessesView PDFCite
Research ArticleOpen accessIn the abstractPAPR Reduction Using BPSO/PTS and STBC in MIMO OFDM SystemKarima El Mouhib, Ahmed Oquour, Younes Jabrane et al.Problem statement: The Multiple Input Multiple Output (MIMO) Orthogonal Frequency Division Multiplexing (OFDM) system has been receiving a great attention, as one of solutions for achieving high speed, efficient and high-quality service for the wireless communications. However, the transmitted signal still has high PAPR because of OFDM characteristics. Many methods have been proposed to solve this problem, but the most … …Journal of Computer Science, Vol. 7, Issue 4 · 4 Apr 2011 · 7,199 accessesView PDFCite
Research ArticleOpen accessIn the abstractEstimating the Parameters of the Negative-Lindley Distribution using Broyden-Fletcher-Goldfarb-ShannoNaushad Mamode KhanProblem statement: The Maximum Likelihood Estimation (MLE) technique is the most efficient statistical approach to estimate parameters in a cross-sectional model. Often, MLE gives rise to a set of non-linear systems of equations that need to be solved iteratively using the Newton-Raphson technique. However, in some situations such as in the Negative-Lindley distribution where it involves more than one unknown … …Journal of Mathematics and Statistics, Vol. 7, Issue 1 · 29 Jan 2011 · 7,381 accessesView PDFCite
Research ArticleOpen accessIn the abstractEnergy Efficient Hidden Markov Model Based Target Tracking Mechanism in Wireless Sensor NetworksB. Amutha, M. PonnavaikkoProblem statement: Target tracking is a challenging application in Wireless Sensor Networks (WSNs) because it is computation-intensive and requires real-time location processing. This study proposes a practical target tracking system based on the Hidden Markov Model in a distributed signal processing framework. In this framework, wireless sensor nodes perform target detection and tracking, whereas target localization requires the collaborative signal … …Journal of Computer Science, Vol. 5, Issue 12 · 31 Dec 2009 · 7,177 accessesView PDFCite
Research ArticleOpen accessIn the abstractUsing Both a Probabilistic Evolutionary Graph and the Evidence Theory for Color Scene AnalysisNassim Ammour, Abderrezak Guessoum, Daoud BerkaniIn this research, we introduce a new color images segmentation algorithm. The color scene analytic method is based on the progress of a probabilistic evolutionary graph. The strategy consists in making grow an evolutionary graph, which presents the scene elements in an unsupervised segmented image. The graph evolution development is based on the computation of the belonging probabilities to the … …American Journal of Applied Sciences, Vol. 5, Issue 12 · 31 Dec 2008 · 7,018 accessesView PDFCite