International Journal of Computer Science and Technology
IJCST 9.1 ver-1 (Jan-March 2018)

S.No. Research Topic Paper ID Download

Analysis of Benefits of Interaction Factors of English Teaching Strategy based on Echo State Network

Gao Baohua, Wu Yan


To improve the accuracy for evaluating the benefits of interaction factors of English teaching strategy, one evaluation method for the benefits of interaction factors of English teaching strategy based on Analytic Hierarchy Process and Echo State Network (AHPESN) has been proposed. Analytic hierarchy process has been adopted to construct evaluation index system. Indexes that have important influence on evaluation results have been screened out as echo state network input. Echo state network has been adopted to set up evaluation model for the benefits of interaction factors of English teaching strategy. Simulation results have shown that AHP-SEN not only simplifies the structure of analysis model for benefits of interaction factors of English teaching strategy, but also improves the evaluation accuracy and evaluation efficiency for the benefits of interaction factors of English teaching strategy. It is a feasible and effective evaluation method for the benefits of interaction factors of English teaching strategy.
Full Paper


Statistical Analysis and Visualization Solution for Multidimensional Data

Prarthana A. Deshkar, Dr. Parag S. Deshpande, Prof. A. Thomas


From the ancient time it is observed that statistics plays very important role in the analysing data and so as to make the decisions. Due to the speed of the data generation and various formats in which data is generated, it is challenging to analyze such data. Organizations are trying to dig inside the data and extracting the insights from the data using advanced statistical analytics. With the help of statistical algorithms data scientist can discover the patterns present in data which would have unnoticed. Always it is not possible to have technically expert data analyst. The ITDA (Integrated Tool for Data Analysis) project focuses on providing one stop solution for data analysis and visualization using statistical analysis and data mining techniques. The objective of this paper is to introduce with the statistical analysis capability of ITDA.
Full Paper


Enhancing Salted Password Hashing Technique Using Swapping Elements in an Array Algorithm

Dr. Abdelrahman Karrar, Talal Almutiri, Sultan Algrafi, Naif Alalwi, Ammar Alharbi


The importance of internet has become highly valid environment for organizations and governments due to providing services and easily dealing with e-commerce and government services. All of these services are provided to registered users which an organization store their profiles in its databases. User’s profile may contain sensitive information such as passwords, credit card numbers, and personal data. One of most concerned issues is how to protect this sensitive information. However, a dictionary attack, brute force attack and rainbow table are the most common ways of guessing passwords in cryptanalysis. As a result, salted password hashing technique one of most efficient ways to protect user’s passwords. In cryptography, a salt is random string appending or prepending to original user’s password before enter it hash function. This is paper will provide guidelines to use this technique to increase efficiency for preventing dictionary attack, brute force attacks and rainbow table from guessing users’ passwords. Also, this paper will provide an algorithm to improve salted password hashing technique by swapping elements in array which work to rearrange the user’s password and salt before send it to hash function. For example, suppose the user’ password is “123” and the salt is “abc”. The common way is use hash(user’ password, salt) – hash(123abc). This algorithm is to reorder user’s password and salt to become like “a1bc23” and then send it to hash function. Also in common using of salted password hashing technique the salt is storing in database without any changes, therefore this algorithm we will rearrange the salt before storing it in database. This algorithm will make guessing the password more difficultbecause isolating the password and the salt from each other through the final hashes will become very difficult.
Full Paper


Energy Consumption through Cluster Head Selection in Wireless Sensor Networks

Upendar Gandham, E Jagadeeswararao, G Stalin Babu


Wireless Sensor Networks (WSNs) are being utilized widely to monitor and observation in a few fields like military territory, agricultural fields, forests, atomic reactors and so on. A Wireless Sensor Network for the most part comprises of an expansive number of small and minimal effort sensor nodes powered by small non-rechargeable batteries and furnished with different detecting gadgets. It is normal that it will be all of a sudden dynamic to assemble the required information for infrequently when something is recognized, and after that residual to a great extent latent for drawn out stretches of time. In this way, efficient power saving plans and relating algorithms must be produced and planned keeping in mind the end goal to give sensible energy utilization and to enhance the network lifetime for WSNs. The cluster-based method is one of the great ways to deal with diminish energy utilization in wireless sensor networks. The lifetime of wireless sensor networks is stretched out by utilizing the uniform cluster area and adjusting the network stacking among the clusters. In this exploration work, different energy efficient plans apply in WSNs have been considered. The clustering based approach has been contemplated and an adjusted convention has been executed which depends on determination likelihood. The sensor just transmits when the limit level is accomplished for this choice potential. It chooses a node as a cluster head if its lingering energy is more than framework normal energy and have less energy utilization rate in the past round. The objectives of this plan are, increment security time of the network, and limit loss of detected information.
Full Paper


A New Technique for Secure Image Communication via Chaotic Circuit

Khaled El Hadad


Our research paper describes secure imaging system based on chaotic noise generating circuit. A chaotic system operates based on a synchronized Master–Slave Chaotic circuits. Indeed the analog circuit is used as a master generator having chaotic and random number. In that frame, chaotic behavior is so difficult to be predicted by analytical methods without knowledge of the initial condition. Moreover, the chaotic systems show unpredictable and complex behaviors. These characteristics, make the chaotic circuit’s ideal tools for improving the level of security. Moreover, in this paper, new technique has been used, and the chaotic signal with the gray image signal are masked. The sender and receiver must be able to produce exactly the same chaotic noise in order to add and subtract same chaotic noise. This becomes possible with synchronization between Chaotic circuit. The results from the experiments with statistical tests prove that suggested gray encryption of the image and decryption on the basis of chaotic.
Full Paper


Security of Data Transmission in Cloud Computing

Zeyad Halabi, Faisal Babtain, Mohammed Saif


Cloud computing is a very popular and interesting technology today; a lot of people are using cloud services directly or indirectly like e-mail, Facebook or ICloud etc. These are some application using cloud computing to get access them anywhere at any time just you need a connection with internet. Also, cloud computing have the ability to store any kind of data, and users can access and store their data with low cost, high features, and good services provided. During that flexibility, everyone now using cloud to transferring there data. For storing data via cloud the user has to send the data to the service provider who will managing and storing data. So, it is very important for companies to secure that data. The data will be secured if its integrity, availability, and confidentiality is present. For securing data there are many algorithms are developed. This paper discusses the popular kinds of cryptography of algorithms.
Full Paper


Enhanced Strategies with Policy on Content Sharing Sites using A3P

G. Kranthi, Kodanda Rama Swami


Social media’s have turned out to be a standout amongst the most vital piece of our everyday life as it empowers us to speak with numerous users. Social Networking Sites like Google, Flickr and Facebook and so on are giving more chances to meet the new users and furthermore in the other various groups over the World. Users who are getting to the social-Networking administrations share their classified Information with extensive number of Friends, which may prompts Privacy Violation. On account of User’s the users who are sharing the vast majority of picture information crosswise over more number of People. So there is have to enhance security as indicated by the users Satisfactory Level. Existing System named Adaptive Privacy Policy Prediction (A3P) comprises two – level Inter linkage Framework which screens the users accessible history in the sites, The A3P System helps the users by anticipating protection settings consequently for the transferred Images. The Adaptive Privacy strategy Prediction framework has extensive structure which derives protection inclinations in view of data which is accessible for a given User. Enhancing the Privacy Prediction precision over the current methodologies is the fundamental point of the Proposed System. This framework accumulates the vast majority of the users information from the substance picture sharing sites and predicts strategy forecast alongside getting to confinements alongside the blocking plans for the social networking sites by utilizing the Data Mining Techniques. To play out this, the framework uses APP (Accessing Policy Prediction) and Accessing Control Mechanism by applying the Privacy Risk Score (PRS) Algorithm.
Full Paper


The Advanced Progressive Technique for Multihop Wireless sensor Networks

B.Venkataramana, Kesavarao Seerapu


In multihop wireless networks, once a mobile node needs to communicate with a destination, it relies upon alternate nodes to propel the packets. This multihop packet transmission will broaden the network scope space exploitation confined power and enhance space separate strength. Inside the arranged multihop wireless network ESTAR coordinates the installment and expectation framework with the directing methodology with the reason for elaborate course dependableness and steadiness. The installment framework portray to claim the nodes that send packets and reward those forward packets. The trust framework is essential to gauge the nodes’ dependability and dependableness in sending packets regarding multi-dimensional trust esteems and in this manner the trust esteems square measure ascertained for every node and created 2 steering protocol is utilized to send the packets through to a great degree trusty nodes having enough vitality to limit the probability of breaking the course. To reinforce the confide in examination, proposal from each node is encased in put stock in computation by TP (Trusted Party). This protocol is created over the Manet network and imitated persecution NS2. Execution assessed from the parameters like packet delivery greatness connection, choice acknowledgment size connection and course period.
Full Paper


An Efficient Methodology for Secure Data Sharing in Various Groups

Y.Praveen, K.China Busi


In cloud giving security, ensures for the sharing data file. Tragically, in light of the continuous difference in the enrollment, sharing data while giving security saving is as yet a testing issue, particularly for an untrusted cloud because of the collusion attack. In this examination work, we propose a protected data sharing scheme for dynamic individuals Firstly, we propose a safe route for key circulation with no safe correspondence channels, and the clients can safely acquire their private keys from group chief. Besides, our scheme can accomplish fine-grained get to control, any client in the group can utilize the source in the cloud and disavowed clients can’t get to the cloud again after they are repudiated. Thirdly, we can shield the scheme from collusion attack, which implies that repudiated clients can’t get the first data file regardless of whether they plot with the untrusted cloud This scheme can accomplish fine effectiveness, which implies past clients require not to refresh their private keys for the circumstance either another client participates in the group or a client is disavowed from the group.
Full Paper


Peer-To-Peer Self Organizing Confidence Model Systems

V. V. Sharma, R. B. Wagh


In peer-to-peer interconnection applications are largely used in distinct systems. Peer-to-Peer is relay on gather of peers in sequence to obtain the process. However due to the open nature of Peer-to-Peer applications, there are many number of security issue associated. In Peer-to-Peer applications, it is simple to perform the any malicious activity and this becomes the large security threat. Designing the long term confidence relationship between the distinct peers may deliver more secure environment by reduced the uncertainty and risk in upcoming Peer-to-Peer intercommunications. But the major issue is to establish the confidence in unknown peer under the malicious environment. Additionally, confidence is nothing but social things which is extremely complex to compute with the numerical values. Such metrics are required to present the confidence in computational models. This becomes the problem statement for Peer-to-Peer systems. To resolve such issues in Peer-to-Peer applications, number of solution introduced in literature but failed to optimize the security against different malicious peers in network.
Full Paper