IOSR Journal of Computer Engineering (IOSR-JCE)

Nov. - Dec. 2016 Volume 18 - Issue 6

Version 1 Version 2 Version 3 Version 4 Version 5 Version 6

Paper Type : Research Paper
Title : Evolution of Wireless Technology: A Survey
Country : India
Authors : Sharmila

Abstract: At present wireless communication used everywhere like in educational institutes, research institutes, industrial applications, automotive industries, health care and medical applications. Nowadays interest is increasing to use wireless communication technologies in place of wired communication technologies. Wireless communication means transfer of information over a distance without wires. The distances involved may be short like television remote control or may be long like radio communications. In this paper I shall throw light on the evolution and development of various wireless technology along with their significance and advantages of one over the other.

Keywords: Wired technology , wireless technology, bluetooth, wi-fi, wimax, gi-fi, li-fi.

[1]. Palak P. Parikh, Student Member, IEEE, Mitalkumar. G. Kanabar, Student Member, IEEE, Tarlochan S. Sidhu, Fellow, IEEE,
[2]. Ma Xinluo; Li Xiaozhong; Ge Changtao . Construction and application of Wireless Local Area Network [M] . Beijing : National Defense Industry Press.2009
[3]. Mei-Fang Lin, Jung-Yung Tzu, Lin, L., Huey-Ming Lee. The IEEE802.11n capability analysis model based on mobile networking architecture[C]. in: Systems, Man and Cybernetics, 2009. SMC 2009. IEEE International Conference on,pp,1857-1860
[4]. Nakamura, R., Sanada, Y. Experimental Investigation of IEEE802.11n Reception with Fractional Sampling[C]. in: Personal Indoor and Mobile Radio Communications (PIMRC), 2010 IEEE 21st International Symposium on,pp.1044-1048
[5]. Jin-Shyan Lee, Yu-Wei Su, and Chung-Chou Shen A Comparative Study ofWireless Protocols: Bluetooth, UWB, ZigBee, and Wi-Fi The 33rd Annual Conference of the IEEE Industrial Electronics Society (IECON) Nov. 5-8, 2007, Taipei, Taiwan.

Paper Type : Research Paper
Title : The NoSQL Movement
Country : India
Authors : Prof. (Dr) Mohammad Ubaidullah Bokhari || Afreen Khan

Abstract: With the advent of technology, the growth and usage of web data has increased and hence the need to store such large amount of data is rising at an exponential rate. It has thereby caused an immediate need for a novel database management system that can deal with the storage of huge amount of unstructured and semi-structured data. The ever-increasing fame of Cloud Computing and Big Data is the stirring power for the companies to make their shift from classic relational databases to non-relational datastores. These non-relational databases are better referred as "NoSQL", meaning "Not Only SQL." NoSQL databases are not a replacement theory for the relational databases but rather they came into existence with the notion of dealing with the unstructured data very well..........

Keywords: Big data, NoSQL, Structured data, Security, Unstructured data.

[1]. Chris Eaton et al, Understanding Big Data- Analytics for Enterprise Class Hadoop and Streaming Data, (USA: McGraw Hill, 2012) pp. xv-xviii.
[2]. Sreeranga Rajan et al, Expanded Top Ten Big Data Security and Privacy Challenges, Cloud Security Alliance, April 2013.
[3]. Evans and Eric, NOSQL 2009, Blog Post May 2009,
[4]. Evans and Eric, NoSQL: What‟s in a name, Blog Post October 2009, http://www.deadcafe. org/2009/10/30/nosql_ whats_in_a_name.html
[5]. Avinash Lakshman and Prashant Malik, Cassandra- Structured Storage System over a P2P Network, June 2009, Presentation at NoSQL meet-up in San Francisco on 2009-06-11,

Paper Type : Research Paper
Title : Big Data: Emerging Challenges of Big Data and Techniques for Handling
Country : India
Authors : Dr.M.Padmavalli

Abstract: Big Data is the large amount of data that cannot be processed by making use of traditional methods of data processing. Due to widespread usage of many computing devices such as smartphones, laptops, wearable computing devices; billions of people are connected to internet worldwide, generating large amount of data at the rapid rate. The data processing over the internet has exceeded more than the modern computers can handle. Due to this high growth rate, the term Big Data is envisaged. However, the fast growth rate of such large data generates numerous challenges, such as data analysis, Storage, quering, inconsistency and incompleteness, scalability, timeliness, and security...........

Keywords: Big Data, Big Table Hadoop, MapReduce, ETL Process, Big Data Mining.

[1]. Golfarelli, M., & Rizzi, S. (2009). Data warehouse design: modern principles and methodologies. Columbus: McGraw-Hill
[4]. Berkovich, S., Liao, D.: On Clusterization of big data Streams. In: 3rd International Conference on Computing for Geospatial Research and Applications, article no. 26. ACM Press, New York (2012)
[5]. A, Katal, Wazid M, and Goudar R.H. "Big data: Issues, challenges, tools and Good practices." Noida: 2013, pp. 404 – 409, 8-10 Aug. 2013.]

Paper Type : Research Paper
Title : Enhancing Cloud Security by DES through K-NN Computation
Country : India
Authors : K. Sindhuja || B. Lakshmi Ramani || T. Praveen

Abstract: Protecting databases or data contents from the web world environment is a tough task for a company. Because every Company/ Financial Institute/ Hospital was hiding their customers or end users list secretly and will not open for all. But now Tom's gang (Hackers) made this possible and tries stealing the data and major portion Tom's gang was successful in doing this one. In these conditions securing the data outsourcing area such as web hosting and cloud space storage option are becoming very prominent. To manage the situation many were out with secured sharing solutions. Now one more novel approach with high secured and efficient sharing option in data retrieving by end user is demonstrating in this paper. The technique is comprises with two famous algorithms one is DES an encryption scheme and the next is K-NN query passing and data retrieving code. Distance and verification for nearest values will generate the query passing value. The files were secured by using DES encryption mode.

Keywords: Tom's gang, Cloud spacing, Secured, Sharing, DES, K-NN, Query.

[1]. Yousef Elmehdwi, Bharath K. Samanthula and Wei Jiang, "Secure k-Nearest Neighbor Query over Encrypted Data in Outsourced Environments",
[2]. Hu, Haibo, et al. "Processing private queries over untrusted data cloud through privacy homomorphism." Data Engineering (ICDE), 2011 IEEE 27th International Conference on. IEEE, 2011.
[3]. Nandhini, N., and P. G. Kathiravan. "An Efficient Retrieval of Encrypted Data In Cloud Computing."
[4]. Rakesh Agrawal, Jerry Kiernan, Ramakrishnan Srikant, and YirongXu. Order preserving encryption for numeric data. In Proceedings of the 2004 ACM SIGMOD international conference on Management of data, SIGMOD '04,pages 563–574, New York, NY, USA, 2004. ACM.
[5]. P. Samarati and L. Sweeney. Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical report, 1998..

Paper Type : Research Paper
Title : Computer Simulation of Fluid Flow Dynamics in a Novel Design of a Continuous Casting Tundish
Country : México.
Authors : Gerardo Barrera C. || Ramiro Escudero G. || Armando López M.

Abstract: The main role of the tundish is to provide and distribute the molten steel, at a constant rate to the casting mold; however, because of the most rigorous quality requirements in recent years, the tundish has acquired great importance in eliminating inclusions. Traditionally, the continuous casting tundish is related to a rectangular container. In this research work the fluid dynamic of an innovative design of a continuous casting tundish consisting of a cylindrical body with half spherical ends was studied by using mathematical modeling...............

Keywords: Continuous casting, Mathematical simulation, steel tundish, cylindrical tundish.

[1]. Irving. W.R. "Continuous Casting of Steel", Editorial Cambridge, (1993), pp. 1-38.
[2]. Lopez-Ramirez S., Barreto J. de J., Palafox-Ramos J., Morales R.D. y Zacharias D. "Modeling Study of the Study of Turbulence Inhibitors on the Molten Steel Flow, Tracer Dispersion and Inclusion Trajectories in Tundishes". Metallurgical and Materials Transactions B Volume 32b, August 2001.
[3]. Barrera G. y Barreto J. de J. "Análisis del desempeño Hidrodinámico Anisotérmico del Distribuidor de la Máquina de Colada Continua del acero.". Revista IDEAS, UAEM, (1997) pp. 2-7.
[4]. Jha P K., Dash K. S. y Kumar S. "Fluid Flow and Mixing in a Six Strand Billet Caster Tundish: A parametric Study" ISIJ International, Vol. 41 (2001), No. 12, pp. 1437–1446.
[5]. Mazumdar D. y Guthrie R. "The Physical and Mathematical Modelling of Continuous Casting Tundish Systems." ISIJ International, Vol. 39 (1999), No. 6, pp. 524-567...

Paper Type : Research Paper
Title : An Improved Dynamic Round Robin CPU Scheduling Algorithm Based on Variant Time Quantum
Country : India
Authors : Jayanti Khatri

Abstract: Scheduling is considered one of the main factors that affect the performance of real-time embedded systems. It plays a vital role by switching the CPU among several processes concentrating on maximizing the CPU utilization and throughput and minimizing the waiting time, turnaround time and number of context switching for a set of processes. Many algorithms are available for CPU scheduling such as First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR), Priority Scheduling etc. Among all these algorithms Round Robin is most popular and widely used algorithm for timesharing systems. This paper presents a new Improved Dynamic Round Robin approach (IDRR) to reduce the average waiting time and turnaround time. The proposed algorithm IDRR is also compared with various variants of Round Robin algorithm. It produces minimal average waiting time and average turnaround time.

Keywords: CPU Scheduling, RR Scheduling, Waiting Time, Turnaround Time, Gantt Chart, Burst Time.

[1]. A. R. Dash. S. K. Sahu and S. K. Samantra, An Optimized Round Robin CPU Scheduling Algorithm with Dynamic Time Quantum International Journal of Computer Science, Engineering and Information Technology (lJCSEIT), Vol. 5, No. I, February 2015.
[2]. Ahmed Alsheikhy, Reda Ammar and Raafat Elfouly An Improved Dynamic Round Robin Scheduling Algorithm Based on a Variant Quantum Time, 978-1-5090-0275-7/15/$31.00 ©2015 IEEE
[3]. Arfa Yasin, Ahmed Faraz, Saad Rehman, Prioritized Fair Round Robin Algorithm with Variable Time Quantum, 13th International Conference on Frontiers of Information Technology 2015 IEEE
[4]. Silberschatz, Galvin and Gagne, Operating system concepts, 8th edition, Wiley, 2009
[5]. Tenanbaum, A.S., Modern Operating Systems, 3rd edition, PHI.

Paper Type : Research Paper
Title : NetworkForensic Application in General Cases
Country : Indonesia
Authors : Akhyar Lubis || Andysah Putera Utama Siahaan

Abstract: The common cases that often occur on a computer network is a weak point of computer security on computer networks. Network Forensic is a process of analyzing activity, recording, or even to identify the network to find digital evidence from a computer crime. Since the existence of the Internet as a global communication tool, it is a crime that often occurs gap. Internet containing the network forensics and lawful interception are important tasks for many organizations including small medium business, enterprises, banking and finance industry. This archiving and restoration of internet data can be used for legal evidence in case of disagreement. Government and intelligence agencies use technology to protect and defend national security. In general, computer forensics is simply the application of computer investigation and analysis techniques to determine the legal evidence that may be. There are several ways to find a crime on a computer network. The use of several applications supported are to improve the success of network forensic processes in the common cases..

Keywords: Network Forensic, Digital Evidence.

[1]. B. Ruchandani, M. Kumar, A. Kumar, K. Kumari dan A. Sinha, "Experimentation In Network Forensics Analysis," dalam Proceedings of the Term Paper Series under CDACCNIE, Bangalore, India, 2006.
[2]. A. Lubis dan A. P. U. Siahaan, "WLAN Penetration Examination of The University of Pembangunan Panca Budi," International Journal of Engineering Trends and Technology, vol. 37, no. 3, pp. 165 - 168, 2016.
[3]. N. Meghanathan, S. R. Allam dan L. A. Moore, "Tools and Techniques for Network," International Journal of Network Security & Its Applications, vol. 1, no. 1, pp. 14-25, 2009.
[4]. B.-H. Kang, "A Generic Framework for Network Forensics," International Journal of Computer Applications, vol. 1, no. 11, pp. 1-6, 2010.
[5]. M. Cohen, "An Advanced Network Forensic Framework," dalam The Digital Forensic Research Conference, USA, 2008..

Paper Type : Research Paper
Title : Dining Philosophers Theory and Concept in Operating System Scheduling
Country : Indonesia
Authors : Zuhri Ramadhan || Andysah Putera Utama Siahaan

Abstract: This research describes how to avoid deadlock condition in dining philosophers problem. It is the undesirable condition of concurrent systems. It is marked as in a circular waiting state. At first, most people wear concepts simple synchronization is supported by the hardware, such as user or user interrupt routines that may have been implemented by hardware. In 1967, Dijkstra proposed a concept wearer an integer variable to count the number of processes that are active or who are inactive. This type of variable is called semaphore. The mostly semaphore also be used to synchronize the communication between devices in the device. In this journal, semaphore used to solve the problem of synchronizing dining philosophers problem............

Keywords: Dining Philosophers Problem, Race Condition, Concurrent, Deadlock, Starvation

[1]. A. P. U. Siahaan, "Penyelarasan Pada Masalah Dining Philosophers Menggunakan Algoritma Lock & Release," Techsi, vol. 6, no. 1, pp. 14-18, 2015.
[2]. M. Samek, Application Note Dining Philosophers Problem (DPP) Example, USA: Quantum Leaps, 2012.
[3]. V. R. Raojillelamudi, S. Mukherjee, R. S. Ray and U. K. Ray, "Lock-Free Dining Philosopher," International Journal of Computer & Communication Technology, vol. 4, no. 3, pp. 54-58, 2013.
[4]. E. Styer and G. Peterson, "Improved Algorithms for Distributed Resource Allocation," in Proc. 7th ACM Symposium on Principles of Distributed Computing, Toronto, Canada, 1988.
[5]. R. Alur, H. Attiya and G. Taubenfeld, "Time-Adaptive Algorithms for Synchronization," in Proc. 26th ACM Symposium on Theory of Computing, Canada, 1994..

Paper Type : Research Paper
Title : A Survey of Manet Governance Survivability on 4g Routing Techniques
Country : India
Authors : Chilakalapudi Meher Babu || Dr. Ashish B. Sasankar

Abstract: The various research activities being done by various groups on fourth generation of the cellular system will provide single interface to all kinds of wireless networks allowing participating nodes to access to the network through cellular, wireless LAN networks, and new protocols such as successful and safe implementation of the fourth generation of the wireless technology into the mobile ad-hoc network for the next generation military environment might face tough challenges. It also can be interrupted due to significant differences between the civil and military environment. Physical and technological constraints, geographical limitations and DoS attacks are some of foreseeable challenges. By putting all possible technological advances together from the 4G and MANET, this has set an example for future battle-field. The era of the new wireless communications is very challenging on 4G and MANET communication systems has been emphasized in this paper..

Keywords: 4G, Mobile Ad-hoc Network, Military Wireless Network, m-Governance, 4GWs.

[1]. A. K. Rai, R. R. Tewari and S. K. Upadhyay, "Different Types of Attacks on Integrated MANET-Internet Com- munication," International Journal of Computer Science and Security, Vol. 4, No. 3, 2010, pp. 265-274.
[2]. H. L. Nguyen and U. T. Nguyen, "Study of Different Types of Attacks on Multicast in Mobile Ad Hoc Net- works," Networking, International Conference on Sys- tems and International Conference on Mobile Communi- cations and Learning Technologies, 23-29 April 2006, 149 p.
[3]. B. Wu, J. M. Chen, J. Wu and M. Cardei, "A Survey on Attacks and Countermeasures in Mobile Ad Hoc Net- works," Wireless/Mobile Network Security, Springer, Ber- lin, 2007, pp. 103-135.
[4]. V. Gokhale, S. K. Ghosh, et al., "Classification of At- tacks on Wireless Mobile Ad Hoc Networks and Vehicu- lar Ad Hoc Networks," Security of Self-Organizing Net- works, Auerbach Publications: MANET, WSN, WMN, VANET, 2010, p. 195.
[5]. Y.-C. Hu and A. Perrig, "A Survey of Secure Wireless Ad Hoc Routing," IEEE Security & Privacy, Vol. 2, No. 3, 2004, pp. 28-39. doi:10.1109/MSP.2004.1.

Paper Type : Research Paper
Title : Proposed Efficient Scheduling Algorithm in Grid Computing Using Gap Filling Approach
Country : Nigeria
Authors : Haruna Abdu || Abubakar Aliyu || Faisal Murtala

Abstract: Computer grids are systems containing heterogeneous, autonomous and geographically distributed nodes that are capable of executing user's applications (job). The proper functioning of a grid depends mainly on the efficient management of grid resources to carry out the various jobs that users send to the grid. In grid computing system management of resources and scheduling of jobs are the most crucial problem, a lot of scheduling policies are in to existence such as, First Come First Serve (FCFS) which is a simple policy used to improve efficiency of the scheduler...............

Keywords:Grid Computing, Algorithm, Architecture, Gap filling, Intelligent Agent.

[1]. Angulo, D., Foster, I., Liu, C., and Yang, L. (2002). Design and Evaluation of a Resource Selection Framework for Grid Applications, Proceeding of IEEE International Symposium on High Performance Distributed Computing (HPDC-11), Edinburgh, and Scotland.

[2] GeorgianaM. (2011) Grid Computing Technology, Database Systems Journal vol. II, No. 3/2011

[3] Yanmin Zhu, Lionel M. Ni, (2013) A Survey on Grid Scheduling Systems, Technical Report SJTU_CS_TR_200309001, Department of Computer Science and Engineering, Shanghai Jiao Tong University, 2013.

[4] Suganya G. (2014) An Efficnet Job Scheduling Approach in Grid Environment Using Biggest Hole Priority Algorithm. International Journal of Computer & Organization Trends – Volume 9 Number 1 – Jun 2014

[5] Blythe, J., Deelman, E., Gil, Y., Kesselman, C., Agwal, A., Mehta, G., Vehi, K., (2003) The Role of Planning in Grid Computing, in Proceeding of international conference on AI planning and Scheduling, (ICAPS). Treanto (Italy)..

Paper Type : Research Paper
Title : The Cyber ethics Issues: Factors and Impact of Internet Scamming among Undergraduate Students
Country : Malaysia
Authors : Muhamad Syamil Hakeem Bin Dzulkafli || Hamizan bt Sharbini || Noor Hazlini Borhan || Yanti Rosmunie Bujang

Abstract: Nowadays, emerging of technology has led to cybercrime issues, which affecting Malaysian society. The role of computer and smart phone and other electronic devices has become crucial and from there it can seed a good and the bad of networking activities. One of the activities is chain letter or messages using social media platform. Chain letters are messages which are broadcast to a large number of people that ask recipients to forward them to as many as possible. Some chain letters can be humorous and was send for the sake of having fun by the sender. Some can contain threats that are hidden and cannot be foreseen. This paper will study on the factors and effects of spreading chain letters and the results were analyzed among university students conducted in University Malaysia Sarawak, Malaysia

Keywords: Cyber ethics, Cybercrime, Chain letter, Internet Scamming, Kantianism, Universal Law

[1] Crook, Tim. (2010). Comparative Media Law and Ethics, London, Routledge.
[2] Gastwirth, J., & Bhattacharya, P. (1984). Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable. Operations Research, 32(3), 527-536.
[3] Hussein, S. (2000). The Malaysian Communications and Multimedia Act 1998 - Its Implications on the Information Technology (IT) Industry. Information & Communications Technology Law, 9(1), 79-88.
[4] Hamsi, A., Bahry, F., Tobi, S., & Masrom, M. (2015). Cybercrime over Internet Love Scams in Malaysia: A Discussion on the Theoretical Perspectives, Connecting Factors and Keys to the Problem. Jmr, 7(2), 169.
[5] Obar, J., Zube, P., & Lampe, C. Advocacy 2.0 (2012). An Analysis of How Advocacy Groups in the United States Perceive and Use Social Media as Tools for Facilitating Civic Engagement and Collective Action. SSRN Electronic Journal.

Paper Type : Research Paper
Title : An Overview of the RC4 Algorithm
Country : Indonesia
Authors : Isnar Sumartono || Andysah Putera Utama Siahaan || Nova Mayasari

Abstract: File security is critical in maintaining the confidentiality of the information, especially sensitive information that should only be known by authorized persons only. If the data is not kept secret, the information obtained may lead to undesirable events and misused by parties who are not responsible.The best way is used for file security is cryptography. One of the algorithms used is RC4. In the process of this algorithm, the key generated by forming the S-Box. The results of the S-Box then is carried out by XOR process with the existing plain character. This study discusses how to perform encryption and decryption process uses the RC4 algorithm to each of the ASCII file.

Keywords:File Protection, RC4, Cryptography

[1]. T. D. B. Weerasinghe, "Analysis of a Modified RC4 Algorithm," International Journal of Computer Applications, vol. 51, no. 22, 2012.
[2]. L. Stošić dan M. Bogdanović, "RC4 Stream Cipher and Possible Attacks on WEP," International Journal of Advanced Computer Science and Applications, pp. 110-114, 2012.
[3]. P. Jindal dan B. Singh, "A Survey on RC4 Stream Cipher," I. J. Computer Network and Information Security, pp. 37-45, 2015.
[4]. A. P. U. Siahaan, "RC4 Technique in Visual Cryptography RGB Image Encryption," International Journal of Computer Science and Engineering, vol. 3, no. 7, pp. 1-6, 26 04 2016.
[5]. A. P. U. Siahaan, "Blum Blum Shub in Generating Key in RC4," International Journal of Science & Technoledge, vol. 4, no. 10, pp. 1-5, 2016..

Paper Type : Research Paper
Title : An Intelligent Resource Sharing Protocol on Write Buffers in Simultaneous Multi-Threading Processors
Country : USA
Authors : Yilin Zhang || Wei-Ming Lin

Abstract: Simultaneous Multi-Threading (SMT) has been widely studied to lend modern-day CPUs a mechanism to improve resource utilization so as to lead to a higher instruction throughput by allowing concurrent execution of multiple independent threads with sharing of key datapath components. The key to a high-performance SMT is to optimize the distribution of shared resources among temporally competing threads. Allowing any of the threads to overwhelm these resources not only leads to unfair thread processing but also may severely degrade overall system throughput...........

Keywords: Simultaneous Multi-Threading, Superscalar, Write Buffer

[1] H. Hirate, K. Kimura, S. Nagamine, Y. Mochizuki, A. Nishimura, Y. Nakase and T. Nishizawa, "An Elementary Processor Architecture with Simultaneous Instruction Issuing from Multiple Threads", Proc. of 19th Annual International Symposium on Computer Architecture, 1992, May, 136-145.
[2] D. Tullsen, S. J. Eggers and H. M. Levy, "Simultaneous Multithreading: Maximizing On-Chip Parallelism", Proc. of 22nd Annual International Symposium on Computer Architecture, 1995, May, 392-493.
[3] P. P. Chu and R. Gottipati, "Write Buffer Design for On-Chip Cache", In the Proceedings of IEEE International Conference on Computer Design: VLSI in Computers and Processors, pp. 311-316, October 1994.
[4] J. L. Hennessy and D. A. Patterson, "Computer Architecture:A Quantitative Approach", Morgan Kaufmann Publishers, 2007.
[5] D. M. Tullsen, S. J. Emer, H. M. Levy, J. L. Lo and R. L. Stamm, "Exploiting Choice: Instruction Fetch and Issue on an Implementable Simultaneous Multi-Threading Processor", Proc. of 23rd Annual International Symposium on Computer Architecture, 1996, May, 191-202...

Paper Type : Research Paper
Title : Fingerprint Pattern Recoqnition Using LVQ
Country : Indonesia
Authors : Muhammad Donni Lesmana Siahaan || Andysah Putera Utama Siahaan2

Abstract: Various ways are developed to determine a person's personality. One was the use of neural networks to determine the human fingerprint patterns. This method is associated with dermatoglyphics. Dermatoglyphics is the study of human fingerprints and relation to aspects of a person's behavior. Fingerprint pattern everyone has its uniqueness. According to Dermatoglyphics science, fingerprint patterns can be used to understand the nature of a person's inborn. These properties include self-potential, personality, and preferences of the person.Meanwhile, the thickness and size of a person's fingerprint will continue to increase with age..........

Keywords: LVQ, Dermatoglyphics, Fingerprint, Neural Network

[1]. P. Hájek, "Fuzzy Logic and Arithmetical Hierarchy," Fuzzy Sets and Systems, vol. 73, pp. 359-363, 1994.
[2]. A. P. U. Siahaan, "Fuzzification of College Adviser Proficiency Based on Specific Knowledge," International Journal of Advanced Research in Computer Science and Software Engineering, vol. 6, no. 7, pp. 164-168, 2016.
[3]. S. B. N., B. M. Bannur, B. G. Patil, G. A. Hadimani and D. P. Jose, "Dermatoglyphic Patterns in Patients of Bronchial Asthma: A Quantitative Study," International Journal of Biological & Medical Research,, vol. 2, no. 1, pp. 38-42, 2013.
[4]. S. Prasad, V. K. Singh and Akshay, "Handwriting Analysis based on Segmentation Method for Prediction of Human Personality using Support Vector Machine," International Journal of Computer Applications, vol. 8, no. 12, pp. 25-29, 2010.
[5]. S. Yohannes, T. Hundessa, B. Duale, B. Getahun, H. Ali and D. Negasa, "Dermatoglyphic Biomarkers and Functional Handedness in Multiple Intelligence: A University Based Cross-Sectional Study," International Journal of Current Research, vol. 7, no. 8, pp. 19278-19283, 2015.

Paper Type : Research Paper
Title : Effect of Cloud Computing Environment on Total Cost of Ownership; a Case of Internet Service Providers (Safaricom and Access Kenya)
Country : Kenya
Authors : Samuel M. Ole Sopia || Dr. James Ogalo || Prof. Kibiwott Kurgatt

Abstract: Cloud computing plays a crucial role when addressing the concept of data storage and determining total cost of ownership in organizations. The purpose of the study was to assess the effect of cloud computing environment on total cost of ownership among the internet service providers focusing on Safaricom and Access Kenya. The objectives of the study were to determine the effect of cloud computing on acquisition costs of computer accessories and to determine the effect of cloud computing on infrastructure support costs. The study was based on a descriptive study design......

Keywords:Cloud Computing, Total Cost of Ownership, Acquisition Cost, Infrastructure Costs, Internet Service providers, Safaricom, Access Kenya

[1]. Ajay, S. (2014). Sampling Techniques and Determination of Sample Size in Applied Statistics Research. International Journal of Economics, Commerce and Management, 6.
[2]. Ajmani, S. (2014). Automatic Software Upgrades for Distributed Systems, MIT-LCS-TR.
[3]. Altman, E. I. (2006). Predicting Financial Distress of Companies. Journal of Finance, 9-10,25.
[4]. Arsen J. Darnay, M. D. (2008). Encyclopedia of Small Business, USA: Thomson Gale.
[5]. Babbie, E. (1992). The Practice of Social Research, Belmont, California: Wadsworth...

Paper Type : Research Paper
Title : EXHIPS: Extending the Span of 6LowPAN Networks by Propagating Malicious Node Alert Message
Country : India
Authors : A.Jahir Husain || M.A.Maluk Mohamed

Abstract: In this paper, we propose a hybrid, Intrusion Prevention architecture for Internet of Things. This is an extension of our previous architecture Hierarchical Intrusion Prevention System (HIPS). In this both centralized and distributed methods are used to eradicate the Denial of Sleep attack in IoT when it is deployed in a widerrange. We evaluate the performance by simulatingthe network and comparing with other existing systems. Thesimulation results confirm that our systemis performing betterthan other systems in terms of extending the life time of IoT nodes.

Keywords:Hybrid Systems, Internet of Things, Intrusion Prevention, Malicious Node Alert

[1] Deru, Laurent, et al. Redundant border routers for mission-critical 6LoWPAN networks, Real-world wireless sensor networks.Springer International Publishing,Vol.281, 2014.195-203.
[2] A.Merlo, M. Migliardi, and L. Caviglione, A survey on energy-aware security mechanisms, Pervasive Mob.Comput., vol. 24, pp. 2015, 77–90.
[3] B.Tourancheau, F. Rousseau, A. Duda, L. Damon, and R. Guizzetti, Energy Cost of Security in an Energy-Harvested IEEE 802.15.4 Wireless Sensor Network, 2014,198–201. [4] A.Jahir Husain and M.A.Maluk Mohamed, "HIPS: Hierarchical Intrusion Prevention System for Conquering Denial of Sleep Attacks in Internet of Things", Accepted for publication in Asian Journal of Research in Social Sciences and Humanities (ISSN:2249-7315)
[5] Stajano, Frank, and Ross Anderson. "The resurrecting duckling: security issues for ubiquitous computing." ComputerVol. 35(4), (2002): 22-26...

Paper Type : Research Paper
Title : Mining Frequent Itemsets Along with Rare Itemsets Based on Categorical Multiple Minimum Support
Country : China
Authors : Md. Fazla Elahe || Kun Zhang

Abstract: Mining interesting itemsets is one of the key tasks in data mining. In real world applications both frequent itemsets and rare itemsets might be interesting. Frequent itemsets are the itemsets that occur with a frequency greater than user specified threshold. Sometimes we need to mine frequent itemsets along with rare itemsets. It is computationally expensive and unwise to mine all the itemsets form the database. Researchers have proposed several algorithms to mine interesting itemsets (both frequent and rare)............

Keywords:Frequent itemset mining; Multiple minimum support; Rare itemset, C-MSApriori

[1] R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. pages 206–216. In ACM SIGMOD International Conference on Management of Data, 1993.
[2] Agrawal, R., and Srikanth, R. "Fast algorithms for mining association rules." VLDB, 1994.
[3] J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov., 8(1):53–87, 2004.
[4] H. Mannila, Database methods for data mining, in: ACM SIGKDD Conf on Knowledge Discovery and Data Mining (KDD 1998) Tutorial, 1998.
[5] B. Liu, W. Hsu, and Y. Ma, "Mining association rules with multiple minimum supports," Proceedings of 1999 ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining 1999, pp. 337-341.

Paper Type : Research Paper
Title : Intrusion Detection System in Network Forensic Analysis and Investigation
Country : Indonesia
Authors : Hariyanto || Andysah Putera Utama Siahaan

Abstract: Intrusion Detection System is built to protect the network from threats of hackers, crackers and security experts from the possibility of action that does not comply with the law. Problems arise when new attacks emerge in a relatively fast so that a network administrator must create their signature and stay updated with new types of attacks that appear. IDS would oversee the packets in the network and benchmark against only those packages with a signature database that is owned by IDS systems or attributes of the attempted attacks ever known. By using IDS, network security will be more secure. Network administrators will be easier to know if network conditions change

Keywords: Network Forensic, Intrusion Detection System

[1]. B. Ruchandani, M. Kumar, A. Kumar, K. Kumari dan A. Sinha, "Experimentation In Network Forensics Analysis," dalam Proceedings of the Term Paper Series under CDACCNIE, Bangalore, India, 2006.
[2]. A. Lubis dan A. P. U. Siahaan, "WLAN Penetration Examination of The University of Pembangunan Panca Budi," International Journal of Engineering Trends and Technology, vol. 37, no. 3, pp. 165 - 168, 2016.
[3]. N. Meghanathan, S. R. Allam dan L. A. Moore, "Tools and Techniques for Network," International Journal of Network Security & Its Applications, vol. 1, no. 1, pp. 14-25, 2009.
[4]. B.-H. Kang, "A Generic Framework for Network Forensics," International Journal of Computer Applications, vol. 1, no. 11, pp. 1-6, 2010.
[5]. M. Cohen, "An Advanced Network Forensic Framework," dalam The Digital Forensic Research Conference, USA, 2008

Paper Type : Research Paper
Title : Feature Selection Based Neural Networks for Software Defect Prediction
Country : India
Authors : M Satya Srinivas || Dr. A Yesubabu || Dr. G Pradeepini

Abstract: Predicting software defects in advance greatly reduces the software development cost. To predict the software defects already various methodologies are proposed like decision trees, Ada boost, SVM and Neural networks. The datasets are obtained from NASA and PROMISE. These datasets contain large number of attributes. Applying mining techniques on large number of attributes reduces the performance of classifier and hence, In this paper we are proposing Principle component analysis for feature selection, then Neural networks are used for best fitting non linear relationships between attributes. In this paper we considered AR1 dataset from PROMISE and presented the results of applying Neural Networks with feature selection & without feature selection.

Keywords: Software defect Prediction, Feature selection, Principle component analysis, Neural Networks

[1]. Jiang Y Fault prediction using early lifecycledata. In:18th IEEE International Symposium on Software Reliablity.2007.p 237-246.
[2]. Emam KE, Melo W, Machado JC. The prediction of faulty classes using object oriented designmtrics. Journal of System & Software 2001;p 63-75
[3]. Sandhu PS A model for early prediction of faults in Software systems. In : 2nd International conference on Computer & Automation engineering. 2010.p.281-285.
[4]. Yanmin Suna,∗, Mohamed S. Kamela, Andrew K.C.Wongb,YangWangc "Cost-sensitive boosting for classification of imbalanced data" in pattern recognition society, Elsevier publication,2007.
[5]. Yang Yi, Jiansheng Wu., Wei Xu "Incremental SVM based on reserved set for network intrusion detection" in Expert Systems with Applications 38 ,2011

Paper Type : Research Paper
Title : Interactive Computer Simulation and Computer Simulation Video: Comparative Perspective in Cognitive Achievement in Petrol Engine
Country : Nigeria
Authors : Igwe, Ndukwe || Ibezim, N. E.

Abstract: This study compared two groups of four technical college classes studying automobile engine. One group learned using interactive computer simulation; the other group learned using computer simulation video. The study adopted a pretest, posttest, control group, quasi-experimental research design. There were three weeks (of 45 minutes each) of treatment for the study. Cognitive achievement test was used to obtain data. Pearson Product Moment Correlation was computed to establish a correlation coefficient of 0.82 after test-retest of cognitive achievement test.............

[1]. Bloom, B. S. (1971). Taxonomy of educational objectives. New York: Longman Publishers. Retrieved from on September 17, 2014
[2]. Direct Industry (2015). Simulation software. Retrieved from on June 24, 2015
[3]. Fitzalan, G. (2014). Cognitive testing vs. achievement testing. Retrieved from on January 14, 2013
[4]. Hick, S. (1997). Benefits of interactive multimedia courseware. Retrieved from benifit.html on February 4, 2016
[5]. Holzinger, A., Kickmeier-Rust, M., Wassertheurer, S., & Hessinger M. (2009). Learning performance with interactive simulations in medical education: Lessons learned from results of learning complex physiological models with the HAEMOdynamics SIMulator. Computers & Education 52 (292–301). Retrieved from S0360131508001346 on August 16, 2015

Paper Type : Research Paper
Title : Explosives Detection Techniques using Wireless based Technologies: A Review
Country : Iraq
Authors : Assist Prof. Dr. Saad. A. Makki || M.Sc. Ali Jamil Hashim

Abstract: Explosives and Bombs represents a great danger to the human life. It's important to use the modern technologies and science to detect and defuse the bombs. There are multiple technologies in wireless systems as a bombs detection techniques. A wireless based system has a wide spread over the network fields. The wireless based systems is used to accomplish multiple objectives as in data transfer and data communication. One of the fields that using the wireless networks is to join the wireless system with the bombs detection systems for data transfer and decision making. This paper shows the modern and advanced technology in wireless based systems for detecting bombs types. This paper explain the basic strategies and technologies that is uses the wireless network technologies for detecting bombs types.

Keywords: Bomb, Wirelees,Detection, Technologies, Network

[1]. Jeffrey I. Steinfeld, Jody Wormhoudt, "EXPLOSIVES DETECTION: A Challenge for Physical Chemistry", Department of Chemistry, Massachusetts Institute of Technology, Cambridge, Massachusetts. USA. 1998
[2]. Dana A. Shea, Daniel Morgan, " Detection of Explosives on Airline Passengers: Recommendation of the 9/11 Commission and Related Issues", CRS report for the Congress, 2007
[3]. Drago Strle , Bogdan Štefane, Erik Zupanič, Mario Trifkovič, Marijan Maček, Gregor Jakša, Ivan Kvasič , Igor Muševič, "Sensitivity Comparison of Vapor Trace Detection of Explosives Based on Chemo-Mechanical Sensing with Optical Detection and Capacitive Sensing with Electronic Detection", Sensors,ISSN 1424-8220. 2014
[4]. Ivan Marsic, "Wireless Networks Local and Ad Hoc Networks", Department of Electrical and Computer Engineering and the CAIP Center,Rutgers University, new Jersey, USA
[5]. M.MUDASSAR RAMZAN, "Transmission Medium", Applied research Group, Department of computer engineering, Kastesart university, 2000

Paper Type : Research Paper
Title : Digital Image Forgery Detection Using SURF
Country : India
Authors : Veena S Babu || Akhil Paulose || Shalu Krishna G

Abstract: Digital images are widely used today. One of the principal problems in image forensics is determining if a particular image is authentic or not. This can be a crucial task when images are used as basic evidence to influence judgment like, for example, in a court of law .Copy-move tampering is a common type of image synthesizing, where a part of an image is copied and pasted to another place. In this paper, an efficient algorithm based on the SURF is proposed . Results of experiments indicate that the proposed method is valid in detecting the image region duplication and quite robust to additive noise and blurring

Keywords: Image forensic, Copy-move forgery, SURF

[1]. K.Kiruthika, S.Devi Mahalakshmi, K.Vijayalakshmi, Detecting Multiple Copies of Copy-Move Forgery Based on SURF,Volume 3, Special Issue 3, March 2014.
[2]. Weihai Li and Nenghai Yu, Rotation Robust Detection Of Copy-Move Forgery, MOE-Microsoft Key Laboratory of Multimedia Computing and Communication
[3]. B.L.Shivakumar1 Lt. Dr. S.Santhosh Baboo,Detecting Copy-Move Forgery in Digital Images, Vol. 10 Issue 7 Ver. 1.0 September 2010
[4]. B.L.Shivakumar1 and Lt. Dr. S.Santhosh Baboo2 "Detection of Region Duplication Forgery in Digital Images ",Vol. 8, Issue 4, No 1, July 2011.

Paper Type : Research Paper
Title : Kernel methods for gene function prediction
Country : Vietnam
Authors : Nguyen Quynh Chi || Do Thi Bich Ngoc

Abstract: This paper proposes an approach using kernel methods to gene function prediction of combining many types of data to get a better performance than the prediction performance of each individual type of data. Some experiments with microarray data and sub-cellular localization data have been implemented. The results show that when we predict some biological process the combination of different types of data using kernels predicts with a better performance than each individual type of data and microarray data with fast fourier transformation gives better prediction performance than original microarray data in some cases.

Keywords: Kernel methods; gene function prediction; biological process; support vector machine, microarray data, sub-cellular localization data

[1] Shah, I., & Hunter, L. 1997. Predicting Enzyme Function from Sequence: A Systematic Appraisal. Pages 276–283 of: ISMB 97.
[2] Bork, P., Dandekar, T., Diaz-Lazcoz, Y., Eisenhaber, F., Huynen, M., & Yuan, Y. 1998. Predicting Function: From Genes to Genomes and Back. Journal of Molecular Biology, 283, 707–725.
[3] Park, J., Teichmann, S.A., Hubbard, T., & Chothia, C. 1997. Intermediate sequences increase the detection of homology between sequences. J Mol Biol, 273(1)(Oct), 349–54.
[4] Karwath, A., & King, R.D. 2002. Homology Induction: The use of machine learning to improve sequence similarity searches. BMC Bioinformatics 2002, 3:11.
[5] Pawlowski, K., Jaroszewski, L., Rychlewski, L., & Godzik, A. 2000. Sensitive Sequence Comparison as Protein Function Predictor. Pages 42–53 of: Pacific Symposium on Biocomputing

Paper Type : Research Paper
Title : Highly Secure Communication using Reversible Texture Synthesis
Country : China
Authors : Venkata Sireesha Pochimcherla || Leelavathy Narkedamilly || Y. Jnapika

Abstract: Steganography is a procedure for hiding text in side digital media such as image, audio, video. Secrete communication is must required while transferring data from sender to receiver. For protecting data we need to hide the data instead of converting into cipher text, if we are using cryptography technique the third person or attacker my steal the information after he can use any effective algorithm to decipher the information in order to make more complex to the hacker we are using stegnography concept , using this concept any user can hide the information inside image or audio or video............

Keywords: Reversible data hiding, image encryption, privacy protection, signal classification

[1]. Y. Guo, G. Zhao, Z. Zhou, and M. Pietikäinen, "Video texture synthesis with multi-frame LBP-TOP and diffeomorphic growth model," IEEE Trans. Image Process., vol. 22, no. 10, pp. 3879–3891, Oct. 2013.
[2]. L.-Y. Wei and M. Levoy, "Fast texture synthesis using tree-structured vector quantization," in Proc. 27th Annu. Conf. Comput. Graph. Interact. Techn., 2000, pp. 479–488
[3]. A. A. Efros and T. K. Leung, "Texture synthesis by non-parametric sampling," in Proc. 7th IEEE Int. Conf. Comput. Vis., Sep. 1999, pp. 1033–1038.
[4]. C. Han, E. Risser, R. Ramamoorthi, and E. Grinspun, "Multiscale texture synthesis," ACM Trans. Graph., vol. 27, no. 3, 2008, Art. ID 51.
[5]. H. Otori and S. Kuriyama, "Data-embeddable texture synthesis," in Proc. 8th Int. Symp. Smart Graph., Kyoto, Japan, 2007, pp. 146–157.s

Researcher can also search IOSR published article contents through

IOSR Xplore