Proposing an Effective Framework for Hybrid Clustering on Heterogeneous Data in Distributed Systems

Authors : Peyman Zohrevandi, Farhang Jaryani

Keywords :– Effective Framework, Hybrid Clustering, Heterogeneous Data, Distributed Systems.
Published Online : 09 september 2018

  • View Full Abstract

    Combined clustering algorithms have more advantages than other clustering algorithms. These algorithms
    often produce better clustering; they combine clustering that cannot be produced by any other clustering
    algorithm alone, have less sensitivity to noise, and are able to integrate creating results from distributed
    resources. The proposed process presented in this study will consist of three major parts: (1) the
    recognition of two-sided clusters, (2) weighing primary clusters and (3) Aggregation clustering on
    distributed heterogeneous data. To determine the two-sidedness of clusters between clustering, an
    algorithm is proposed to determine which two clusters correspond to each other in two different clustering.
    Weighing the clustering is done to the point that higher quality clusters in the production of the final result
    have a greater impact on clustering that is of lower quality. The proposed strategy has been evaluated on
    heterogeneously distributed data. The results of the evaluations have been compared with the other four
    algorithms in the field of compromise clustering. The comparisons have shown that the proposed strategy
    is more effective than other algorithms in most cases.  
  • View References

    [1] AKBARI, E., DAHLAN, H. M., IBRAHIM, R. & ALIZADEH, H. 2015. Hierarchical cluster ensemble
    selection. Engineering Applications of Artificial Intelligence, 39, 146-156.

    [2] ALAM, S., DOBBIE, G. & RIDDLE, P. An evolutionary particle swarm optimization algorithm for
    data clustering. Swarm Intelligence Symposium, 2008. SIS 2008. IEEE, 2008. IEEE, 1-6.

    [3] ASUNCION, A. & NEWMAN, D. J. 2007. UCI Machine Learning Repository [http://www. ics. uci.
    edu/~ mlearn/MLRepository. html]. Irvine, CA: University of California. School of Information and
    Computer Science.

    [4] CHANG, H. & YEUNG, D.-Y. 2008. Robust path-based spectral clustering. Pattern Recognition, 41,
    191-203.

    [5] EBERHART, R. C. & KENNEDY, J. A new optimizer using particle swarm theory. Proceedings of the
    sixth international symposium on micro machine and human science, 1995. New York, NY, 39-43.

    [6] ESMIN, A. A., COELHO, R. A. & MATWIN, S. 2013. A review on particle swarm optimization
    algorithm and its variants to clustering high-dimensional data. Artificial Intelligence Review, 1-23.

    [7] GONG, M., CAI, Q., CHEN, X. & MA, L. 2014. Complex network clustering by multi objective discrete
    particle swarm optimization based on decomposition. Evolutionary Computation, IEEE Transactions
    on, 18, 82-97.

    [8] JAIN, A. K. & LAW, M. H. 2005. Data clustering: A user’s dilemma. Pattern Recognition and Machine
    Intelligence. Springer.

    [9] KENNEDY, J. 2010. Particle swarm optimization. Encyclopedia of Machine Learning. Springer.

    [10] KENNEDY, J. & EBERHART, R. C. A discrete binary version of the particle swarm algorithm.
    Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation. 1997 IEEE
    International Conference on, 1997. IEEE, 4104-4108.

    [11] OMRAN, M., ENGELBRECHT, A. P. & SALMAN, A. 2015. Particle swarm optimization method for
    image clustering. International Journal of Pattern Recognition and Artificial Intelligence, 19, 297-321.

    [12] POLI, R., KENNEDY, J. & BLACKWELL, T. 2017. Particle swarm optimization. Swarm intelligence,
    1, 33-57.

    [13] STREHL, A. & GHOSH, J. 2003. Cluster ensembles—a knowledge reuse framework for combining
    multiple partitions. The Journal of Machine Learning Research, 3, 583-617.

    [14] VAN DER MERWE, D. & ENGELBRECHT, A. P. Data clustering using particle swarm optimization.
    Evolutionary Computation, 2013. CEC’13. The 2013 Congress on, 2013. IEEE, 215-220.

    [15] YANG, L.-Y., ZHANG, J.-Y. & WANG, W.-J. Cluster Ensemble Based on Particle Swarm
    Optimization. Intelligent Systems, 2009. GCIS’09. WRI Global Congress on, 2009. IEEE, 519-523.

    [16] ZHANG, B., HSU, M. & DAYAL, U. 1999. K-harmonic means-a data clustering algorithm. Hewlett-
    Packard Labs Technical Report HPL-1999-124.

Improving Performance of User-Based Collaborative Filtering Recommender Systems Using the Weighted Similarity Method

Authors : Younes Narouiee, Hassan Asadollahi

Keywords :– Recommender systems, Collaborative filtering, traditional similarity measures, Weighted Similarity. 
Published Online : 09 september 2018

  • View Full Abstract

    Recommender systems are an example of the most successful web personalization tools. The most
    important duty of a recommender system, is finding the user’s favorite items in a very large space of
    selectable items. Similarity-based algorithms, often referred to as memory-based collaborative filtering
    techniques, are one of the most successful methods in recommendation systems. When explicit ratings are
    available, similarity is usually defined using similarity functions, such as the Pearson correlation coefficient,
    cosine similarity or mean square difference. These metrics assume similarity is a symmetric criterion.
    Therefore, two users have equal impact on each other in recommending new items. In this paper, we
    introduce new weighting factors that allow us to consider new features in finding similarities between users.
    These weighting factors, first, transform symmetric similarity to asymmetric similarity by considering the
    number of ratings given by users on non-common items. Second, they take into account the habit effects
    on users which are regarded on rating items by measuring the proximity of the number of repetitions for
    each rate on common rated items. Experiments on dataset were implemented and compared to other
    similarity measures. The results show that adding weighted factors to traditional similarity measures
    significantly decreases Error resulting from them.  
  • View References

    [1] Zhang, F., Gong, T., Lee, V. E., Zhao, G., Rong, C., & Qu, G. (2016). Fast algorithms to evaluate
    collaborative filtering recommender systems. Knowledge-Based Systems, 96, 96-103.

    [2] Liu H, Hu Z, Mian AU, Tian H, Zhu X (2014) A new user similarity model to improve the accuracy of
    collaborative filtering.Knowl-Based Syst 56:156–166

    [3] Choi, S. M., Ko, S. K., & Han, Y. S. (2012). A movie recommendation algorithm based on genre
    correlations. Expert Systems with Applications, 39(9), 8079-8085

    [4] Pham XH, Jung JJ (2014) Recommendation system based on multilingualentity matching on linked
    open data. J Intell Fuzzy Syst 27(2):589–599

    [5] Rahul Katarya, Om Prakash Verma, An effective collaborative movie recommender system with cuckoo
    search, In Egyptian Informatics Journal, Volume 18, Issue 2, 2017, Pages 105-112, ISSN 1110-8665

    [6] Cleger-Tamayo, S., Fernández-Luna, J. M., & Huete, J. F. (2012). Top-N news recommendations in
    digital newspapers. Knowledge-Based Systems, 27, 180-189.

    [7] Koohi, H., & Kiani, K. (2016). User based Collaborative Filtering using fuzzy C-means. Measurement,
    91, 134-139.

    [8] Massa P, Avesani P (2009) Trust metrics in recommender systems. In: Computing with social trust.
    Springer, pp 259–285

    [9] Garcia, I., Sebastia, L., & Onaindia, E. (2011). On the design of individual and group recommender
    systems for tourism. Expert systems with applications, 38(6), 7683-7692.

    [10] Jamali M, Ester M (2009) Trustwalker: a random walk model for combining trust-based and item-
    based recommendation. In: Proceedings ACM SIGKDD (2009), 15th international conference on
    knowledge discovery and data mining. ACM, pp 397–406

    [11] Carrer-Neto, W., Hernández-Alcaraz, M. L., Valencia-García, R., & García-Sánchez, F. (2012). Social
    knowledge-based recommender system. Application to the movies domain. Expert Systems with
    applications, 39(12), 10990-11000.

    [12] Li, Q., Myaeng, S. H., & Kim, B. M. (2007). A probabilistic music recommender considering user
    opinions and audio features. Information processing & management, 43(2), 473-487

    [13] Nilashi, M., & Ibrahim, O. B. (2014). A model for detecting customer level intentions to purchase in
    B2C websites using TOPSIS and fuzzy logic rule-based system. Arabian Journal for Science and
    Engineering, 39(3), 1907-1922.

    [14] Al-Shamri, M. Y. H., & Al-Ashwal, N. H. (2014). Fuzzy-weighted similarity measures for memory-based
    collaborative recommender systems. Journal of Intelligent Learning Systems and Applications, 2014.

    [15] Al-Shamri, M. Y. H. (2014). Power coefficient as a similarity measure for memory-based collaborative
    recommender systems. Expert Systems with Applications, 41(13), 5680-5688.

    [16] Chang, C. C., & Chu, K. H. (2013, June). A recommender system combining social networks for tourist
    attractions. In Computational Intelligence, Communication Systems and Networks (CICSyN), 2013
    Fifth International Conference on (pp. 42-47). IEEE.

    [17] Bobadilla J, Ortega F, Hernando A, Bernal J (2012) A collaborative filtering approach to mitigate the
    new user cold start problem.Knowl-Based Syst 26(1–2):225–238

    [18] Gorgoglione, M., & Panniello, U. (2009, May). Including context in a transactional recommender
    system using a pre-filtering approach: Two real e-commerce applications. In Advanced Information
    Networking and Applications Workshops, 2009. WAINA’09. International Conference on (pp. 667-672).
    IEEE.

Enhancement of the Safety of Vehicle Network Data by Controlling Data Access Policies

Authors : Sajad Karimi, Hassan Asadollahi

Keywords :– Network security, Ad-Hoc networks, Vehicular networks, Policy in networks. 
Published Online : 09 september 2018

  • View Full Abstract

    Vehicular ad-hoc networks (VANETs) are a subclass of mobile ad-hoc networks (MANETs) in which the
    mobile nodes are vehicles; these vehicles are autonomous systems connected by wireless communication.
    This kind of network has the advantage of being able to be set-up and deployed anywhere and anytime
    because it has no infrastructure set-up and no central administration. Distributing information between
    these vehicles over long ranges in such networks, however, is a very challenging task, since sharing
    information always has a risk of information disclosure attached to it especially when the information is
    confidential like in military applications. This thesis therefore focuses on the issue of security in VANET and
    especially controlling information flow. This thesis introduces a policy-based framework to control the
    dissemination of messages communicated between nodes in order to ensure message confidentiality not
    only during transmission, but also after it has been communicated to another peer. In this framework,
    policies that specify how the information can be used by the receiver according the requirements of the
    originator are attached to messages. These requirements are represented as a set of policy rules defined
    by a policy language proposed in this thesis that explicitly instructs recipients how the information can be
    disseminated to other nodes in order to avoid unintended disclosure. To evaluate the framework, Network
    Simulator (NS-2) was used to test the performance of the proposed policy-based agent protocol using
    average delay and overhead as performance metrics. Also, some scenarios are presented in this thesis to
    show how data dissemination can be controlled based on the policy of the originator and the results of
    these case studies show the feasibility of our research.
  • View References

    [1] Ghebleh, R. (2017). A Comparative Classification of Information Dissemination Approaches in
    Vehicular Ad hoc Networks from Distinctive Viewpoints: A Survey. Computer Networks, 131:15–37.

    [2] Herwitz, S. R., Johnson, L. F., Dunagan, S. E., Higgins, R. G., Sullivan, D. V., Zheng, J., … & Slye, R. E.
    (2014). Imaging from an unmanned aerial vehicle: agricultural surveillance and decision support.
    Computers and electronics in agriculture, 44(1), 49-61.

    [3] Iwata, C., & Mavris, D. (2013). Object-oriented discrete event simulation modeling environment for
    aerospace vehicle maintenance and logistics process. Procedia Computer Science, 16, 187-196.

    [4] Maza, S., & Castagna, P. (2015). A performance-based structural policy for conflict-free routing of bi-
    directional automated guided vehicles. Computers in Industry, 56(7), 719-733.

    [5] Mondal, A., & Mitra, S. (2016, November). TDMAC: A timestamp defined message authentication code
    for secure data dissemination in VANET. In Advanced Networks and Telecommunications Systems
    (ANTS), 2016 IEEE International Conference on (pp. 1-6). IEEE.

    [6] El Faouzi, N. E., Leung, H., & Kurian, A. (2011). Data fusion in intelligent transportation systems:
    Progress and challenges–A survey. Information Fusion, 12(1), 4-10.

    [7] Wang, R., & Lukic, S. M. (2011, September). Review of driving conditions prediction and driving style
    recognition based control algorithms for hybrid electric vehicles. In Vehicle Power and Propulsion
    Conference (VPPC), 2011 IEEE (pp. 1-7). IEEE.

    [8] Meiring, G. A. M., & Myburgh, H. C. (2015). A review of intelligent driving style analysis systems and
    related artificial intelligence algorithms. Sensors, 15(12), 30653-30682.

Approach to Efficiently Allocated Resources and Independent Program Scheduling in Grid Systems using Fuzzy Inference

Authors : Jahanbakhsh Parmah, Javad Hosseinkhani

Keywords :– Resource Allocation, Scheduling, Grid Systems and Fuzzy Inference.
Published Online : 09 september 2018

  • View Full Abstract

    Grid computing is a new technology that allows us to access various types of resources through the use of
    communication infrastructure and computer networks, as well as the application of the finite degree of distributed
    system concepts and facilities. There is no limit to the geographical scope and the type of resources covered. Since
    resource source and source speed are two opposite factors, in other words, the fast source is usually expensive;
    scheduler should apply the user’s resources in assigning tasks to resources. For example, if a user is concerned about
    the cost of performing his work, assignment assigns it to a cheap resource, and if the user is concerned about the
    completion time of his work, the scheduler should assign tasks to a quick source. This scheduler gives the user more
    freedom to apply the comment. Research in this area suffers from a number of flaws, including optimization, completion
    time and cost of execution. Similarly, in some other studies, it has been attempted to prioritize the importance of
    completion time or cost, which has the disadvantage of prioritizing. Therefore, in this research, we will introduce a new
    algorithm that, based on fuzzy decision, performs the best choice according to the user and system conditions. And
    taking into account all the variables and the effect of each one in its own right, it will provide the most ideal solution
    possible from both the system and the user’s point of view. In order to make a satisfactory decision, one should be able
    to predict the value of any probable outcome that will be obtained after the decision is made, and indirectly compare
    these values with a quantitative scale, and examine the probability of success. The proposed algorithm calculates the
    most suitable source for satisfying the user’s needs, and calculates the lowest runtime for jobs on the resource. In the
    end, the results of the comparison showed that the proposed algorithm can significantly improve the required repetition
    and the time consumed (cost) to achieve an optimal solution.
  • View References

    [1] Singh, Krishan Veer, and Zahid Raza. “A GA based job scheduling strategy for computational grid.”
    Computer Engineering and Applications (ICACEA), 2015 International Conference on Advances in.
    IEEE, 2015.

    [2] Prakash, Shiv, and Deo Prakash Vidyarthi. “Maximizing availability for task scheduling in
    computational grid using genetic algorithm.” Concurrency and Computation: Practice and Experience
    27.1 (2015): 193-210.

    [3] Bahnasawy, Nirmeen A., et al. “Optimization procedure for algorithms of task scheduling in high
    performance heterogeneous distributed computing systems.” Egyptian Informatics Journal 12.3 (2017):
    219-229.

    [4] Khajemohammadi, Hassan, Ali Fanian, and T. Aaron Gulliver. “Fast workflow scheduling for grid
    computing based on a multi-objective genetic algorithm.” Communications, Computers and Signal
    Processing (PACRIM), 2013 IEEE Pacific Rim Conference on. IEEE, 2013.

    [5] Nirmeen A. Bahnasawy, Fatma Omara, Magdy A. Koutb, Mervat Mosa. “Optimization procedure for
    algorithms of task scheduling in high performance heterogeneous distributed computing systems using
    Fuzzy Inference”. Egyptian Informatics Journal, pp. 219–229 (2015)

    [6] Darmawan, Irfan, Yoga Priyana, and M. Ian Joseph. “Grid computing process improvement through
    computing resource scheduling using genetic algorithm and Tabu Search integration.”
    Telecommunication Systems, Services, and Applications (TSSA), 2016 7th International Conference on.
    IEEE, 2016.

    [7] Fangpeng Dong and Selim G. Akl, “Scheduling Algorithms for Grid Computing: State of the Art and
    Open Problems”, Technical Report No. 2016-504, January 2016

    [8] E. Cox, M. O’Hagan, R. Taber, and M. O’Hagen, The Fuzzy Systems Handkbook with Cdrom: Academic
    Press, Inc., 1998.

    [9] S. Sumathi and S. Paneerselvam, Computational intelligence paradigms: theory & applications using
    MATLAB: CRC Press, 2010.

    [10] Doshi, satish, et al. A M, July 2015, Grid Computing, Computer society of India at 122, pp, 218-247.

    [11] R. Buyya and M. Murshed, “GridSim: A Toolkit for the Modeling and Simulation of Distributed
    Resource Management and Scheduling for Grid Computing”, Journal of Concurrency and Computation:
    Practice and Experience, pp. 1-32, May 2012.

Proposing a Hybrid Approach in order to Increase the Efficiency and Security of Outsourced Data in Social Networks based on Data Mining

Authors : Javad Makaremi Isfahani, Farhang Jaryani

Keywords :– Privacy, Increase the Efficiency, Security of Outsourced Data, Data Mining.
Published Online : 03 April 2018

  • View Full Abstract

    A cloud based distributed anonymizer is proposed in this study. The anonymizer is placed on Virtual machines on cloud services. By expanding the use of social networks, privacy in these networks has become one of the most important security challenges. Today, anonymity and privacy techniques are used in many data environments (table data and network data). In this research, a method has been developed in which the data owner organizes the exploration of the dependency rules of the encrypted and outsourced data in the cloud environment to the n data server in the cloud environment, which together Explore the dependency rules and returns the data to the data owner in encrypted form. Data owner to reduce the risk of loss of privacy Data can select servers from different cloud service providers, which is at least one of the trusted servers. In this way, each server can calculate the support for an item set in a subset of the database, and each time before this, all transactions are tangled up so that the transaction structure can be hidden afterwards Encrypted dataset support and the minimum encryption threshold are compared with the conditional gate. Therefore, the purpose of privacy is that the existence of the relationship between its entities is represented by tags. The main goal is to balance optimality between the entity’s privacy and data applicability. Also, even though all nodes are K-unknown, communication disclosure can occur, which can improve the organization’s workflow and increase the efficiency and security of the previous methods significantly. 
  • View References

    [1] Birgani, Anoosh Mansouri, and Javad Hosseinkhani. Proposing an Algorithm in order to Detect Communities in Social Networks using Multi-Objective Evolutionary Algorithm. 2016.

    [2] Ken, et al. Privacy preserving analysis technique for secure, cloud based big data analytics. Hitachi Review 63.9: 578. 2014.

    [3] Deokate Pallavi B., M.M. Waghmare. Privacy-Preserving in Outsourced Transaction Databases from Association Rules Mining. International Journal of Engineering Research and General Science Volume 2, Issue 6, October-November, ISSN 2091-2730. 2014.

    [4] Kumarage, Heshan, et al. Secure Data Analytics for Cloud-Integrated Internet of Things Applications. IEEE Cloud Computing 3.2: 46-56. 2016.

    [5] Vishal Ravindra Redekar, Dr. K.N.Honwadkar. Privacy-Preserving Mining of Association Rules in Cloud. Smt. Kashibai Navale College of Engineering, Pune, Maharashtra, India. 2319-7064. 2012.

    [6] Chandrasekaran. K. Essentials of cloud computing. CRC Press, 2014.

    [7] Monreale, Anna, and Wendy Hui Wang. Privacy-Preserving Outsourcing of Data Mining. Computer Software and Applications Conference (COMPSAC), IEEE 40th Annual. Vol. 2. IEEE, 2016.

    [8] V.Ragunath, C.R.Dhivya. Privacy Preserved Association Rule Mining For Attack Detection and Prevention. International Journal of Innovative Research in Computer and Communication Engineering, 2320-9801, 2014.

    [9] F. Giannotti, L. V. S. Lakshmanan, A. Monreale, D. Pedreschi, and W. H. Wang. Privacy-preserving mining of association rules from outsourced transaction databases. IEEE Systems Journal, Volume 7, Issue 3, pages: 385–395, 2011.

    [10] I. Molloy, N. Li, and T. Li. On the (in) security and (im) practicality of outsourcing precise association rule mining. In ICDM 2013, The Ninth IEEE International Conference on Data Mining, Miami, Florida, USA, 6-9 December 2009, pages 872–877, 2013.

    [11] C. Tai, P. S. Yu, and M. Chen. K-support anonymity based on pseudo taxonomy for outsourcing of frequent itemset mining. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, pages 473–482, 2010.

    [12] W. K. Wong, D. W. Cheung, E. Hung, B. Kao, and N. Mamoulis. Security in outsourcing of association rule mining. In Proceedings of the 33rd International Conferencem on Very Large Data Bases, University of Vienna, Austria, pages 111–122, 2017.

    [13] Z. Huang, Q. Li, D. Zheng, K. Chen, and X. Li, YI Cloud: Improving user privacy with secret key recovery in cloud storage, in Service Oriented System Engineering (SOSE). 2011 IEEE 6th International Symposium on, 2011, pp. 268–272.

    [14] N. Cao, C. Wang, M. Li, K. Ren, and W. Lou. Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data. IEEE Trans. Parallel Distrib. Syst., Volume 25, Issue 1, pages: 222–233, Jan. 2014.

    [15] C. Örencik and E. Sava\cs. An efficient privacy-preserving multi-keyword search over encrypted cloud data with ranking. Distrib. Parallel Databases, Volume 32, Issue 1, pages: 119–160, 2014.

    [16] T. S. M. Okuhara, T. Shiozaki, Security architectures for cloud computing. FUJITSU Sci. Tech, FUJITSU Sci. Tech, Volume 46, Issue 4, pages 397–402, 2010.

    [17] Rittinghouse, John W., and James F. Ransome. Cloud computing: implementation, management, and security. CRC press, 2016.

Providing an Effective Method for Maximizing the Load Balancing in Cloud Computing using the Memetic Algorithm

Authors : Iman Ahrari, Parisa Rahmani  

Keywords :– Cloud Computing, Memetic Algorithm, Load Balance, Dragonfly Algorithm, Genetic Algorithm. 
Published Online : 03 April 2018

  • View Full Abstract

    Today’s users use cloud computing extensively, and most of their daily work are to use the services in the
    cloud. The use of the cloud, despite the reduced complexity of the user, can create special problems for
    cloud providers, one of them is the problem of balancing the load in the cloud and preventing the drowning
    of cloud servers in a bunch of various tasks that users need. In this study, the load balancing in the cloud
    was introduced using the Memetic algorithm, a kind of hybrid genetic algorithm, which was introduced by a
    person called Dawkins, a genetic comparison of cultural evolution, and is now one of the growing research
    spaces in Evolutionary calculations have been reviewed and the results have been compared with some of
    the work done in this area. Investigating the results of the proposed algorithm, this study shows that the
    use of the Memetic algorithm, which is an evolutionary algorithm, can optimally balance the load and
    reduce the average waiting time for the response.  
  • View References

    [1] P. Mell and T. Grance, “The NIST definition of cloud computing. 2011. Available at: h ttp,” csrc. nist.
    gov/publications/nistpubs/800-145/SP800-145. pdf. Accessed April, Volume 26, 2015.
    [2] Xu G, Pang J, Fu X. A load balancing model based on cloud partitioning for the public cloud[J]. Tsinghua Science and
    Technology, 2017, Volume 18, No 1, pages 34-39.
    [3] Pan J S, Wang H, Zhao H, et al. Interaction Artificial Bee Colony Based Load Balance Method in Cloud
    Computing[M]//Genetic and Evolutionary Computing. Springer International Publishing, 2015: pages 49- 57.
    [4] Mao Y, Chen X, Li X. Max–min task scheduling algorithm for load balance in cloud computing[C]//Proceedings of
    International Conference on Computer Science and Information Technology. Springer India, 2014: pages 457-465.
    [5] J. Cao, K. Li, and I. Stojmenovic, “Optimal power allocation and load distribution for multiple heterogeneous multicore server
    processors across clouds and data centers,” IEEE Transactions on Computers, Volume 63, Issue 1, pp. 45–58, 2014.
    [6] R. N. Calheiros and R. Buyya, “Meeting deadlines of scientific workflows in public clouds with tasks replication,” IEEE
    Transactions on Parallel and Distributed Systems, Volume 25, Issue 7, pp. 1787–1796, 2014.
    [7] R. Basker, V. Rhymend Uthariaraj, and D. Chitra Devi, “An enhanced scheduling in weighted round robin for the cloud
    infrastructure services,” International Journal of Recent Advance in Engineering & Technology, Volume 2, Issue 3, pages 81–86,
    2014.
    [8] M. Rahman, R. Hassan, R. Ranjan, and R. Buyya, “Adaptive workflow scheduling for dynamic grid and cloud computing
    environment,” Concurrency and Computation: Practice and Experience, Volume 25, Issue 13, pages 1816–1842, 2013.
    [9] L. D. Dhinesh Babu and P. Venkata Krishna, “Honey bee behavior inspired load balancing of tasks in cloud computing
    environments,” Applied Soft Computing Journal, Volume 13, Issue 5, pages 2292–2303, 2013.
    [10] Z. Xiao, W. Song, and Q. Chen, “Dynamic resource allocation using virtual machines for cloud computing environment,” IEEE
    Transactions on Parallel and Distributed Systems, Volume 24, Issue 6, pages 1107–1117, 2013.

Providing a Method for Managing Efficient Resources in Cloud Computing based on Cuckoo’s Algorithm

Authors : Saeid Hosseinifar, Hassan Asadollahi

Keywords : Efficient Resource Management, Cloud Computing, Cuckoo Algorithm. 
Published Online : 03 April 2018

  • View Full Abstract

    In recent years, the cloud computing model has been very much considered due to its high scalability,
    reliability, information sharing and low cost of single-processor machines. The term cloud is a metaphorical
    concept that refers to the huge repository of hardware and software that can be easily accessed through
    the Internet. Data centers, including those with high processing power, can respond to thousands of user-
    generated computing needs. Today, most of these data centers use virtualization techniques, and thus
    provide a distributed computing environment in which cloud services are provided on a virtual machine
    platform, and virtual machines run on physical host’s platform. One of the major problems with data centers
    is their high energy consumption, which is neglected following the competition of large companies for the
    rapid development of data centers. One of the solutions to reduce energy consumption in data centers is to
    reduce the processing burden of hosts. In order to minimize the processing burden of hosts, optimal
    management should be done on virtual machine hosts in physical hosts so that the lowest possible number
    of these hosts is used. Our goal in this research is to automate virtual machines in such a way. We make
    physical hosts use fewer hosts. This issue is of the NP problem type, and we solved this problem using the
    Cuckoo algorithm. Cuckoo algorithm is one of the most commonly used randomization optimization tools
    that are used in many problems and simply problems with optimization functions. It solves various
    problems and can simply transform the optimization functions. Here, our goal is to manage optimal
    resources in cloud computing. Using the Cuckoo Optimization algorithm, we can perform a lot of virtual
    machines and physical hosts better than other exploratory and spurious algorithms. Using optimal resource
    management algorithms plays an important role in reducing the energy consumption of data centers.
  • View References

    [1] Maharana, Debendra, Bibhudatta Sahoo, and Srinivas Sethi. “Energy-efficient real-time tasks scheduling in cloud data centers.” Volume 4, Issue 12, 2017, pages 768-773.

    [2] Jung ,Gihun, MongSim, Kwang , “Location-Aware Dynamic Resource Allocation Model for Cloud Computing Environment” ,
    proceedings of International Conference on Information and Computer Applications ,Dubai ,2013, pages 256-269.

    [3] G, ¬¬lovasz, F, Nieedermeier, Hermann DE Meer, “Performance tradeoffs of energy-aware virtual machine Consolidation”, 2012, DOI 10.1007/s10586, pages 481-496.

    [4] T, Ferreto, ¬¬¬M, Netto, R,¬Calheiros, ” Server consolidation with migration control for virtualized data centers”, Elsevier,
    Future Generation Computer systems, October 2013, Volume 27 Issue 8, pages 1027-1034.

    [5] Beloglazov, Anton, Abawajy, Jemal, Buyy, Rajkumar,” Energy-aware resource allocation heuristics for efficient management of data centers for Cloud computing”, Elsevier Future Generation Computer Systems, Volume 28, 2012, pages 755-768.
    [6] Chung Tam, Sik , Kuan, Tam , Hou, Mou Tam, Lap, Zhang, Tong, A New Optimization Method, the Algorithm of
    Changes, for Bin Packing Problem, IEEE, 2010, 978-1-4244-6439-5/10, 2010.
    [7] Andrea, Berl, Gelenbe, Erol, Girolamo, Giovanni, Giuliani, Hermann DE Meer, “Energy-Efficient Cloud Computing”,
    published by Oxford University Press on behalf of The British Computer Society, 2009, Volume 53, DOi:
    10.1093/comjnl/bxp080, pages 1046-1051.
    [8] P. Venkata Krishna, “Honey bee behavior inspired load balancing of tasks in cloud computing environments,” Applied soft
    computing, Volume 13, pages 2292-2303, 2013.
    [9] B. Mondal, K. Dasgupta, and P. Dutta, “Load balancing in cloud computing using stochastic hill climbing-a soft computing
    approach,” Procedia Technology, Volume 4, pages 783-789, 2012.
    [10] Zhan, Shaobin, and Hongying Huo. “Improved PSO-based task scheduling algorithm in cloud computing.” Journal of
    Information & Computational Science Volume 9, Issue 13, 2012, pages 3821-3829.
    [11] Jena, R. K. “Multi Objective Task Scheduling in Cloud Environment Using Nested PSO Framework.” Procedia Computer
    Science, Volume 57, 2015, pages 1219-1227.

Provide an Optimal Protocol to Improve Reliability and Assurance of Servility in Ad Hoc Networks with uzzy-Neural Logic Approach 

Authors : Saman Pazhoohesh , Mohammad Reza Vazifeh , Mohammad Reza Shahbazi

Keywords : Ad Hoc Networks, Reliability, Protection, Routing, fuzzy. 
Published Online : 06 February 2018

  • View Full Abstract

    Mobile case networks are among the subsets of the technology of wireless networks, which nowadays are
    considered in many researches and are used in various fields. The characteristics of mobile case networks
    have made it especially important for the concept of security, especially in sensitive applications. On the
    one hand, the unique architecture of this group of networks has led to the use of traditional methods
    provided for wired networks and other wireless networks in this type of network are not efficient. And thus,
    ensuring and maintaining security has a fundamental difference with other computer networks. The
    importance of this factor, especially in some of key applications dedicated to these networks, has attracted
    many researchers with the goal of providing mechanisms that support reliability and security. The focus of
    past research in this regard is often on the issue of support for security. But so far, an efficient research has
    not been provided with the capability to provide and support security assurance. Accordingly, and given the
    remaining challenges in this area, there is also a need for more research in this field. In current research,
    by considering the characteristics of mobile case networks, the limitations of prior research and reliability
    and security requirements, an efficient and targeted protocol with support for both critical security and
    security aspects, SRMRP Is presented. The protocol introduced by its method of operation through reliable
    and trusted multimode routing, utilizes the capabilities of fuzzy sets based on the reliability and security
    indexes, has been designed to provide the most security and confidence in the exchange, And minimizes
    the problems caused by the absence of these two basic factors. The SRMRP protocol is highly compatible with mobile case networks and applications of these networks, and has expanded to fit the security and
    security features. The proposed protocol provides the expectations of a reliable and secure mechanism
    according to its capabilities. To evaluate the efficiency and capabilities of the proposed SRMRP protocol,
    this protocol was evaluated using OPNET simulation tool in different scenarios. The results of the
    simulations show the overall performance improvement of mobile cell network performance with the
    proposed protocol as compared to previous studies, especially the TQR-based research.
  • View References

    [1] Maharana, Debendra, Bibhudatta Sahoo, and Srinivas Sethi. “Energy-efficient real-time tasks scheduling in cloud data centers.” Volume 4, Issue 12, 2017, pages 768-773.

     
    [2] Jung ,Gihun, MongSim, Kwang , “Location-Aware Dynamic Resource Allocation Model for Cloud Computing Environment” ,
    proceedings of International Conference on Information and Computer Applications ,Dubai ,2013, pages 256-269.

     
    [3] G, ¬¬lovasz, F, Nieedermeier, Hermann DE Meer, “Performance tradeoffs of energy-aware virtual machine Consolidation”,
    2012, DOI 10.1007/s10586, pages 481-496.

     
    [4] T, Ferreto, ¬¬¬M, Netto, R,¬Calheiros, ” Server consolidation with migration control for virtualized data centers”, Elsevier,
    Future Generation Computer systems, October 2013, Volume 27 Issue 8, pages 1027-1034.

     
    [5] Beloglazov, Anton, Abawajy, Jemal, Buyy, Rajkumar,” Energy-aware resource allocation heuristics for efficient management of data centers for Cloud computing”, Elsevier Future Generation Computer Systems, Volume 28, 2012, pages 755-768.

     
    [6] Chung Tam, Sik , Kuan, Tam , Hou, Mou Tam, Lap, Zhang, Tong, A New Optimization Method, the Algorithm of
    Changes, for Bin Packing Problem, IEEE, 2010, 978-1-4244-6439-5/10, 2010.

     
    [7] Andrea, Berl, Gelenbe, Erol, Girolamo, Giovanni, Giuliani, Hermann DE Meer, “Energy-Efficient Cloud Computing”,
    published by Oxford University Press on behalf of The British Computer Society, 2009, Volume 53, DOi:
    10.1093/comjnl/bxp080, pages 1046-1051.

     
    [8] P. Venkata Krishna, “Honey bee behavior inspired load balancing of tasks in cloud computing environments,” Applied soft
    computing, Volume 13, pages 2292-2303, 2013.

     
    [9] B. Mondal, K. Dasgupta, and P. Dutta, “Load balancing in cloud computing using stochastic hill climbing-a soft computing
    approach,” Procedia Technology, Volume 4, pages 783-789, 2012.

     
    [10] Zhan, Shaobin, and Hongying Huo. “Improved PSO-based task scheduling algorithm in cloud computing.” Journal of
    Information & Computational Science Volume 9, Issue 13, 2012, pages 3821-3829.

     
    [11] Jena, R. K. “Multi Objective Task Scheduling in Cloud Environment Using Nested PSO Framework.” Procedia Computer
    Science, Volume 57, 2015, pages 1219-1227.

     

     

Enhancing the Prediction Accuracy of Chronic Kidney Insufficiency using Fuzzy C-Means Algorithm and Neural Networks

Authors : Mohammad Karimi , Javad Hosseinkhani

Keywords : Accuracy of Forecasting, Chronic Renal Failure, Fuzzy C-Means Algorithm, Neural Network.
Published Online : 03 February 2018

  • View Full Abstract

    Data mining methods can replace time / cost tests in the medical field. In this regard, current research has presented a new method for predicting chronic renal disease, in which relevant data are clustered in a fuzzy fashion and then categorized using a neural network. The current research tries to improve the accuracy of the neural network using an uncontrolled method and thus combine an observation method with an uncontrolled method. The differentiation of the proposed method with previous methods is the use of an uncontrolled (clustering) algorithm in the structure of a method by the control. In addition, the proposed method, in view of its ability to improve the final accuracy of the improvement model, will eliminate the limitations of the inadequacy of predictive accuracy during the execution phase, and, on the other hand, due to the use of a batch method BD can be trained more quickly. Numerical tests implemented on the proposed model represent the superiority of the new model’s performance to the conventional methods in the subject literature.
  • View References

    [1] Celik, E., Atalay, M., & Kondiloglu, A. (2016). The Diagnosis and Estimate of Chronic Kidney Disease Using the Machine Learning Methods, Expert Sytems with Applications, 12(170), 2027-2031.

    [2] Rumelhart, D. (1986). Learning Representations by Back Propagation Error. Nature, 323, 533-536.

    [3] Lakshmi, G. D., Kumar, P. R., Bharavi, K., Annapurna, P., Rajendar, B., Patel, P. T & Rao, G. S. (2012). Protective effect of Tribulus terrestris linn on liver and kidney in cadmium intoxicated rats, Spectrum, 73, 107- 128.

    [4] Abhishek, G. S. M. T., & Gupta, D. (2012). Proposing Efficient Neural Network Training Model for Kidney Stone Diagnosis. International Journal of Computer Science and Information Technologies, 3(3), 3900-3904.

    [5] Krishna Apparao, R. (2012). Statistical and Data Mining Aspects on Kidney Stones: A Systematic Review and Meta-analysis. Open Access Scientific Reports, 1-7.

    [6] Van Eyck, J., Ramon, J., Guiza, F., Meyfroidt, G., Bruynooghe, M., & Van den Berghe, G. (2012). Data mining techniques for predicting acute kidney injury after elective cardiac surgery. Critical Care, 16(1), P344.

    [7] Khavanin Zadeh, M., Rezapour, M., & Sepehri, M. M. (2013). Data mining performance in identifying the Risk Factors of early arteriovenous fistula failure in Hemodialysis Patients. International journal of hospital research, 2(1), 49-54.

    [8] Lakshmi, K. R., Nagesh, Y., & Krishna, M. V. (2014). Performance comparison of three data mining techniques for predicting kidney dialysis survivability. International Journal of Advances in Engineering & Technology, 7(1), 242.