for Journals by Title or ISSN
for Articles by Keywords
help
International Journal of Research in Computer and Communication Technology
   [4 followers]  Follow    
  This is an Open Access Journal Open Access journal
     ISSN (Print) 2320-5156 - ISSN (Online) 2278-5841
     Published by Suryansh Publications Homepage  [2 journals]
  • A Game Theory To Load Balancing Strategy To Improve The Efficiency In
           Public Cloud Environment

    • Authors: V.Prudhvi Govind, K.Chandra Sekhar, M.Radhika Mani
      Abstract: Good load balancing makes cloud computing more proficient and increases user satisfaction. At present cloud computing is one of the utmost platforms which deliver storage of data in very lowers cost and accessible for all time over the internet. But it has more serious issue like security, load management and fault tolerance. Load balancing in the cloud computing environment has a significant influence on the presentation. The algorithm relates the game theory to the load balancing approach to increase the proficiency in the public cloud environment. This article announces an improved load balance model for the public cloud centered on the cloud segregating concept with a switch mechanism to select different approaches for different circumstances.
      PubDate: 2014-12-16
      Issue No: Vol. 3 (2014)
       
  • A Novel Approach for Reducing Routing Overhead In Mobile Ad hoc Network

    • Authors: T. Shekinah, M.Radhika Mani, B.A.S Roopa Devi
      Abstract: The Mobile Adhoc Networks(MANET) are the examples of infrastructure less networks and are having frequent occurrence of route discoveries. In MANET, the routing has been performed with the help of neighbouring information. The route discovery of MANET suffers with the broadcast where it involves additional routing overhead with frequent transmission of broadcasting messages to neighbour nodes. The present work proposes new approach for reducing routing overhead (RPO) for MANET .The propose RPO approach computes for determing spread factor. Then the present work proposes a method for calculating rebroadcast probability. This step is further involves the computation of Additional Coverage Ratio (ACR) and Connectivity Factor (CF) single broadcast and CF explains the connectivity relationship of a node. With this information, the proposed method can decreases the transmission rate and routing overhead and thus improves the routing performance.
      PubDate: 2014-12-16
      Issue No: Vol. 3 (2014)
       
  • Energy Efficient Group Key Management For Secure Data Processing In Ad hoc
           Networks

    • Authors: A. Bala Koteswari, N. V. Satya Pradeep. Kotla
      Abstract: The key management is the course of action of maintaining the secret key between the sender and receiver. By means of this key the sender can encrypt the data which is broadcasted to the receiver and send it with the security key to decrypt the message. The receiver decrypts the transmitted message from sender using security key. The existing key management paradigms cannot covenant with these challenges resourcefully. This paper proposes and states a etiquette for allocating and administrating secure group keys in ad hoc environments which applies for the Secure Optimized Link State Routing Protocol (SOLSR). The code of behaviour deals with group keys taking into observation the frequent network partitions and the absence of infrastructure. We have using an Energy Efficient Group key management (EEGK) for secure data processing on network. A provably secure protocol in the new key management hypothesis and execute widespread experiments in the circumstance of mobile ad hoc networks. The analysis shows that the protocol is energy proficient for high key replacement rates and frequent network partitions.
      PubDate: 2014-12-16
      Issue No: Vol. 3 (2014)
       
  • Random Key Generation For Advanced Encryption System (Aes) Using Rm-Prng
           Algotihm

    • Authors: Ch Ravi Sankar, P Rambabu
      Abstract: The advent of electronics have played a vital role in the development of communication system. One of the major issues in the field of communications is maintaining security and privacy of the data transmitted and received. Secured communications means transmission of data between the sender and receiver without any loss of original information. One of the methods for secured transmission is cryptography. Cryptography consists of two techniques-encryption and decryption. In encryption the original message is converted into unreadable cipher text with the help of an encryption key. The transmitted encrypted data will be decrypted on the sender side with the same key used at the transmitter side. Hence the key generated at the transmitted side is also send through the communication channel to the receiver.  The receiver decrypts the cipher text into plain text using the decryption key. The security of the transmitted data depends on the key generated. The key used should be nonlinear and random. The cost of the hardware generating the key should also be less. This paper proposes RM-PRNG which reduces the cost of hardware, provides non-linearity and high throughput.
      PubDate: 2014-12-09
      Issue No: Vol. 3 (2014)
       
  • Decentralized Probabilistic Text Clustering by using Distributed
           Hierarchical peer to peer Clustering

    • Authors: Attuluri Uday Kiran, Rakesh Nayak
      Abstract: Document clustering (or text clustering) is the application of cluster analysis to textual documents. It has applications in automatic document organization, topic extraction and fast information retrieval or filtering. For text clustering we are using decentralized probabilistic text clustering Algorithm to mine the data, it is an traditional centralized approach by using this approach analyzing massive distributed data. But it is extremely difficult to draw conclusions based on the collective characteristics of disparate data. The goal is to achieve modularity and scalability. Decentralized probabilistic text clustering Algorithm is less scalable in distributed clustering. Distributed Hierarchically Peer-to-Peer Clustering (DHP2PC) Algorithm is scalable and efficient algorithm. In this a subset of the document collection is centrally partitioned into clusters, for which cluster signatures are created. The DHP2PC algorithm finds its roots in a parallel implementation. By using cluster signatures we can mine the Massive distributed data. The algorithm offers probabilistic guarantees for the correctness of each document assignment to a cluster.
      PubDate: 2014-12-09
      Issue No: Vol. 3 (2014)
       
  • An Obfuscation threshold as part of the Access policy in processing
           systems

    • Authors: Ch Lalitha Syama Sundari, Rakesh Nayak
      Abstract: In business processes, it is essential to detect inconsistencies or failures early. For example, in manufacturing and logistic processes, while we transporting items we have check the routing during this session. We evolving a new concept CEP complex event processing system for large scale industries to maintain the data secure and privacy when we transmitting the data through the network In addition, to collaborative nature of today’s financial results in huge scale networks, where n number of  users, with different companies, or groups exchange events.  This project presents a fine-grained access management for complex event processing. For every incoming task and outgoing task can be secured by the access policy algorithm in an efficient manner. This project mainly concentrates on enhancing the obfuscation calculation and methods to increase the Bayesian Network size so we are able to measure obfuscation over more than one correlation steps.  To make data very secure and privacy total incoming task is equalized and applying stream operation.   In Large scale industries and distributing application, we do many operations over hetero operation can be spread over multiple security domains. An conflict can change from legally received outgoing task streams confidential input streams of the event processing system. The major problem with the large scale processing operation is making the event confidential for total event stream. This paper presents a fine-grained access management for complex event processing. Here we are going to implement a algorithms for access consolidation one each incoming event stream can be protected by the specification of an access policy.
      PubDate: 2014-12-09
      Issue No: Vol. 3 (2014)
       
  • Mycobacterium Tuberculosis Bacilli cells Recognition using Multiple
           Classifier.

    • Authors: Eknathrao Jadhav, Kale K.V
      Abstract: Abstract—Many computer science researchers have been working on developing and    designing an automated system for fast & accurate recognition of tuberculosis (TB), which would ensure speed up of treatment process. Manually for proper identification of Mycobacterium tuberculosis require skilled person it is critical, time consuming and hectic too. Identification of TB bacilli manually sometime may confuse with some stain residue & non tuberculosis bacilli. Due to this we get the faulty results. For this reason need of atomization is required for exact identification of tuberculosis. We present an object, pattern (Mycobacterium Tuberculosis cell) recognition method using Support Vector Machine (SVM), k-nearest neighbor (Knn) and Gaussian membership function. The object i.e. M.TB bacilli cells are extracted using color segmentation method, from Ziehl-Nelson stained sputum smears images. These images have blue background on which red color M.TB bacilli cells. Images are by self developed data set, obtained using a bright field microscope. The various shapes of objects are extracted using segmentation method. The extracted shapes is the mixture of M. TB bacilli cells,  non TB cells and few are stain residue etc. For proper recognition(M.TB cells) the shape based feature of these patterns are extracted on the basis of these futures data set the multiple classifiers like SVM, Knn and Gaussian are applied for recognition of M.TB bacilli cells. The recognition rate obtains using SVM is highest than Knn and Gaussian.
      PubDate: 2014-12-09
      Issue No: Vol. 3 (2014)
       
  • Agile Software Development Teams on Autopoiesies Aspects

    • Authors: A. Vanathi, K. Raja Sravan Kumar
      Abstract: Self-organizing teams are at the spirit of agile software development. Self-organizing Agile teams are composed of individuals supervise their own workload shift work among themselves based on need and best fit  and participate in team decision making. Self-organizing teams must have frequent focus, mutual trust, respect and the capability to systematize frequently to meet new challenges. The scrum method particularly mentions self-organizing agile teams and the concept of empowered teams has recently been added to XP. Self-organizing teams are not only seen as allowing Agile engineering practices but also as capturing the spirit of Agile values and principles which focus on human and social aspects of software engineering. Self-organizing teams is one of the principles behind the agile proposal and have been recognized as one of the significant success factors of agile projects. This paper presents the results of a qualitative Grounded Theory (GT) study involving agile practitioners from different software organizations in New Zealand and India conducted over a period of four years. As a part of the study semi structured, face-to-face interviews were conducted with Agile practitioners in the New Zealand and Indian software industries using open-ended questions.
      PubDate: 2014-12-04
      Issue No: Vol. 3 (2014)
       
  • LD: A Leak Detector Mechanism For Finding Misbehaving Nodes In MANETS

    • Authors: R S Lavanya Devi Magapu, SK. Ahmad Shah
      Abstract: MANET is a collection of mobile nodes equipped with both a wireless-transmitter and receiver that communicate with each other via bi-directional wireless links either directly or indirectly. Due to the open medium and broad division of nodes make MANET weak to malicious attackers and collusion of misbehaving nodes has not been effectively addressed. To overcome this proposing  a new  Enhanced Adaptive Acknowledgment  which protects manet from attackers and introducing leakdetector to detect colluding malicious nodes in wireless networks.  
      PubDate: 2014-12-04
      Issue No: Vol. 3 (2014)
       
  • Data Possession Of Multiple Replicas Across The Distributed Storage System
           By Third Party Auditor

    • Authors: A. Sasidhar, D Vijay
      Abstract: Cloud computing has four models as Public cloud through which the service is obtainable to all public use. Private cloud through which service is accessible to private enterprise or organization. Community Cloud permits us to share infrastructure among various organizations through which we can achieve security, compliance and jurisdiction. Users should be able to just use the cloud storage as if it is local without worrying about the need to authenticate its integrity. Thus enabling public audit capability for cloud storage is of critical importance so that users can resort to a third party auditor (TPA) to check the integrity of outsourced data and be worry-free. To securely introduce an effective TPA the auditing process should bring in no new vulnerabilities towards user data privacy and introduce no additional online burden to user. In this we propose a secure cloud storage system supporting privacy-preserving public auditing. We further extend our result to enable the TPA to execute audits for multiple users simultaneously and efficiently.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Minimizing energy utilization and source anonymity in wireless Sensor
           Networks

    • Authors: N.Eswara Reddy, D. Vijay
      Abstract: Monitoring networks consist of energy unnatural nodes that are expected to function over an extended period of time making energy competent monitoring a chief feature for unattended networks. In such situation nodes are designed to transmit information only when a appropriate event is detected i.e. event-triggered transmission. As a result given the location of an event-triggered node the location of a real event reported by the node can be approximated within the node’s sensing range. The places of the combat vehicle at different time intervals can be exposed to an opponent observing nodes transmissions. There are three limitations that can be connected with an event detected and reported by a sensor node as the description of the event, the time of the event and the location of the event. When sensor networks are organized in untrustworthy environments protecting the privacy of the three parameters that can be attributed to an event triggered transmission turn out to be an important security feature in the design of wireless sensor networks.  
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • An Efficient Content Sharing Scheme For Delay-Tolerant Smart Phone
           Networks

    • Authors: P. Manasa, U.Vinod Kumar
      Abstract: Some smart phones in the network store content that they are ready to share with others. All Smartphone users are eager to assist and provide a limited amount of their resources such as bandwidth, storage and processing power to aid others. The objective is to permit users to issue queries for content stored on other smart phones wherever in the network and to measure the chances of obtaining the information needed. We take for granted that smart phones can carry out searches on their local storage and we find the applicable results for a given query to make easy searching. Theoretically the content sharing process is considered into two phases the content discovery phase and the content delivery phase. In the content discovery phase a user inputs requirements for content in a content sharing application. In our work we scrutinize a network of smart phones with the deliberation that Smartphone carriers expend most of their time indoors where GPS cannot be accessed. Previous research shows that GPS signal is available for 4.5 percent only of a typical user’s day. Consequently we require to design a system to support location-based services in indoor environments.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • A Novel Social TV For Improving Users Viewing Experience By Using Cloud

    • Authors: P. Amaravathi, M. Usha, S.Asha Latha
      Abstract: The latest cloud computing technology with its wealthy possessions to balance for the limitations of mobile devices and connections can potentially endow with an ideal platform to hold up the desired mobile services. Strong challenges occur on how to efficiently exploit cloud resources to make easy mobile services particularly those with inflexible interaction delay requirements. I propose the design of a Cloud-based novel Mobile social TV system (CloudMoV). The system efficiently utilizes both PaaS (Platform-as-a-Service) and IaaS (Infrastructure-as-a- Service) cloud services to suggest the living-room knowledge of video watching to a group of dissimilar mobile users who can interrelate socially while sharing the video. To assurance good streaming quality as experienced by the mobile users with time varying wireless connectivity i employ a substitute for each user in the IaaS cloud for video downloading and social exchanges on behalf of the user.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Enabling Secure File Sharing On Untrusted Servers Using Mona

    • Authors: S.Vijaya Lakshmi, M Jyothi
      Abstract: Identity privacy is one of the most important obstruction for the wide operation of cloud computing. Without the guarantee of identity privacy users may be reluctant to join in cloud computing systems since their real identities could be easily revealed to cloud providers and attackers. Unconditional identity privacy may bring upon you the abuse of privacy. For pattern a misbehaved staff can deceive others in the company by sharing false files without being noticeable. Therefore traceability which enables the group manager e.g., a company manager to reveal the real identity of a user is also highly desirable.  It is extremely suggested that any member in a group should be able to fully enjoy the data storing and sharing services provided by the cloud which is defined as the multiple-owner manner. Compared with the single-owner manner where only the group manager can store and adapt data in the cloud the multiple-owner manner is suppler in practical applications. More concretely each user in the group is able to not only read data, but also modify his/ her part of data in the entire data file shared by the company.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Detecting Network And Application Layer Attacks in Networks

    • Authors: N.V.V. Soujanya, G.Uma Mahesh
      Abstract: Distributed Denial of Service (DDoS) flooding attacks are launched by attackers disturbing server services as well as Individual users who are active in internet.espicially attackers are targeting network Transport level DDOS flooding attacks and application level ddos attacks. disrupt a legitimate user’s connectivity by exhausting bandwidth, router processing capacity or network resources these are essentially network transport-level flooding attacks and disrupt a legitimate user’s services by exhausting the server resources like  sockets, CPU, memory, disk,database bandwidth,  these essentially include application-level flooding attacks .monitor and ddos detecting algorithm and host based intrusion detection system  is proposed to prevent these attacks. finally our approach is efficient and effective.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Evaluate the Vulnerabilities of Existing Protocols to Routing Layer
           Resource Depletion Attacks

    • Authors: S. Vivekananda devi, Beebi Sufia Sheik
      Abstract: We describe a Resource Depletion attack as the work of art and transmission of a message that causes more energy to be consumed by the network than if an honest node transmitted a message of identical size to the same destination though using different packet headers. These are also called Vampire attacks. We calculate the strength of the attack by the ratio of network energy used in the benevolent case to the energy used in the malicious case i.e. the ratio of network-wide power utilization with malevolent nodes present to energy convention with only honest nodes when the number and size of packets sent remains invariable. Security from Vampire attacks entails that this ratio is 1. Energy use by malicious nodes is not measured since they can always unilaterally sewer their own batteries. We present a sequence of increasingly damaging Vampire attacks estimate the vulnerability of several example protocols and propose how to improve elasticity. In source routing protocols we show how a malicious packet source can indicate paths through the network which are far longer than optimal wasting energy at middle nodes who forward the packet based on the included source route.  
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Accurate Alignment of Search Result Records from Web Data Base

    • Authors: Soumya Snigdha Mohapatra, M.Kalyan Ram
      Abstract: Most search engines are returning results page that are come from structured databases. This type of search engines also referred as web databases. Each results page contains search results records and each record contains multiple data items. In the proposed method we are introducing an automatic annotation approach that first aligns the data units on a result page into different groups such that the data in the same group have the same semantic. Then, for each group we annotate it from different aspects and aggregate the different annotations to predict a final annotation label for it. An annotation wrapper for the search site is automatically constructed and can be used to annotate new result pages from the same web database.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Distributed Hash Table (DHT) Based Clone Detection In WSN’s

    • Authors: P.V. Siva Durga, U. Vinod Kumar
      Abstract: Distributed Hash Table (DHT) by which a completely decentralized, key-based caching and checking system is created to catch cloned nodes efficiently. The protocol arrangement on competent storage utilization and eminent security level is tentatively deducted through a probability model and the resultant equations with essential adjustments for real application are supported by the simulations. The second distributed detection protocol named randomly directed exploration presents good communication performance for dense sensor networks by a probabilistic bound for forwarding method along with random initial direction and border determination. The simulation results support the protocol aim and show its effectiveness on communication overhead and satisfactory detection probability. Wireless sensor networks are a collection of sensor nodes scattered over the area for data collection. But the main problem is it is in danger to the node clone
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Annotation Wrapper for Annotating The Search Result Records Retrieved From
           Any Given Web Database

    • Authors: G. Lava Raju, Darapu Uma
      Abstract: An annotation wrapper for the search site is automatically created and can be used to interpret new result pages from the similar web database.  The data units arrived from the fundamental database are generally encoded into the result pages dynamically for human browsing. For the encoded data units to be machine process able which is vital for many applications such as deep web data collection and Internet comparison shopping they need to be remove out and allocate meaningful labels. In this paper we present an automatic annotation approach that first bring into line the data units on a result page into dissimilar groups such that the data in the similar group have the same semantic. Then for each group we annotate it from diverse aspects and collective the different annotations to forecast a final annotation label for it. This kind of search engines also referred as web databases. In results page holds search results records and each record encloses multiple data items. In this project we establish an automatic annotation approach that first aligns the data units on a result page into different groups such that the data in the same group have the same semantic.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Provide Secure And Privacy-Preserving Access Control To Users Anonymously
           Utilize The Cloud Resource Using Mona

    • Authors: P Amaravathi, V. Josephraju, K Challayamma
      Abstract: Involvement in a multi-owner manner while preserving data and identity privacy from an untrusted cloud is still a challenging issue due to the regular change of the membership.In the meantime the storage overhead and encryption computation cost of our method are autonomous with the number of revoked users. In addition we analyze the security of our scheme with rigorous proofs and reveal the competence of our scheme in experiments.Sharing group resource among cloud users is a major problem so cloud computing provides a reasonable and efficient solution. In this paper we propose a secure multi-owner data sharing scheme named Mona for dynamic groups in the cloud. By leveraging group signature and dynamic broadcast encryption methods any cloud user can anonymously share data with others. Due to frequent change of membership sharing data in a multi-owner manner to an untrusted cloud is still a challenging issue
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • To Ensure Data Possession of Multiple Auditing In The Distributed Storage
           System Using TPA

    • Authors: P Amaravathi, V Josephraju, M.Mani Deepika
      Abstract: In view of the large size of the outsourced data and the user’s inhibited resource capability the tasks of auditing the data correctness in a cloud environment can be frightening and expensive for the cloud users. Users may not want to go through the difficulty in verifying the data integrity. Besides there may be more than one user accesses the same cloud storage say in an enterprise setting. For easier management it is enviable that cloud only entertains verification request from a single designated party. It is of vital importance to enable public auditing service for cloud data storage so that users may resort to an independent third-party auditor (TPA) to audit the outsourced data when needed. The TPA who has expertise and capabilities that users do not and can periodically check the integrity of all the data stored in the cloud on behalf of the users which provides a much more easier and affordable way for the users to ensure their storage correctness in the cloud. 
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Effective Load Balancing Technique In Pcloud

    • Authors: P Amaravathi, G.Devi Himaja
      Abstract: In present days cloud computing is one of the greatest platform which provides storage of data in very lower cost and available for all time over the internet. But it has more critical issue like security, load management and fault tolerance. In this paper we are discussing Load Balancing approach. Many types of load concern with cloud like memory load, CPU load and network load. Load balancing is the process of distributing load over the different nodes which provides good resource utilization when nodes are overloaded with job. Load balancing has to handle the load when one node is overloaded. When node is overloaded at that time load is distributed over the other ideal nodes. Many algorithms are available for load balancing like Static load balancing and Dynamic load balancing. Load balancing in the cloud computing environment has an important impact on the performance. Good load balancing makes cloud computing more efficient and improves user satisfaction. This article introduces a better load balance model for the public cloud based on the cloud partitioning concept with a switch mechanism to choose different strategies for different situations. The algorithm applies the game theory to the load balancing strategy to improve the efficiency in the public cloud environment.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Using Conventional MMQA To Automatically Annotate Media Entities

    • Authors: Kondapalli.V V SubbaRao, V.Chandra Kumar
      Abstract: It is worth stating that already exist several research efforts enthusiastic to automatically answering questions with multimedia data i.e. the so-called Multimedia Question Answering (MMQA). But these approaches generally work on definite narrow domains and can barely be generalized to handle questions in broad domains. This is due to the fact that in order to complete automatic MMQA we first need to understand questions which are not an easy assignment. Our proposed approach in this work does not aim to directly answer the questions and instead we augment the community-contributed answers with multimedia contents. The plan divides the huge gap between question and multimedia answer into two smaller gaps i.e., the gap between question and textual answer and the gap between textual answer and multimedia answer. In our scheme the first gap is linked by the crowd-sourcing intelligence of community members and thus we can focus on solving the second gap. Therefore our scheme can also be viewed as an approach that achieved the MMQA problem by jointly exploring human and computer. The proposal of a novel scheme which will enrich community-contributed textual answers in cQA with appropriate media data.  
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Detecting of Disconnected from Source (DOS) and Connected but a Cut
           Occurred Somewhere (CCOS) in Wireless Sensor Networks

    • Authors: Prajna Sree Katikadala
      Abstract: A wireless sensor network can get separated into multiple connected sensors .but some nodes are failure due to mechanical, electrical problems, environmental degradation battery depletion or hostile tampering. which is called a “cut”. In this project the problem of detecting cuts by the remaining nodes of a wireless sensor network. We propose an algorithm that achieves. The algorithm works based on a imaginative “electrical potential” of the nodes which is an iterative method and the convergence rate of the scheme is independent of the network.  
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • The Feasibility Of Content Sharing With (Dtn) On Commercial Smart Phones

    • Authors: K Aparna, M Jyothi
      Abstract: The increase in the number of smart phone users has lead to the increase in the peer-to-peer adhoc content sharing. Traditional data delivery schemes are not suitable for such networks due to intermittent connectivity between smart phones. Thus new content sharing mechanisms should be proposed. To share the contents in such a scenario, researchers have proposed store-carry-forward as an efficient content sharing scheme with efficient a client-based cache consistency scheme that is implemented for caching data items .where a node stores a message and carries it for certain duration until a communication opportunity arises and then delivers it to the destination. Previous works in this field focused on whether two nodes would encounter each other and the place and time of encounter and did not consider the activities of malicious peers. This paper proposes discover-predict-deliver as efficient content sharing scheme where special nodes cache the queries and the addresses of the nodes that store the responses to these queries that enable peers to share contents.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • A Novel Way To Automatically Mine Comparable Entities From Comparative
           Questions

    • Authors: P Ujwala Sai, N Rajesh Babu
      Abstract: A comparison activity usually contains search for applicable web pages containing information about the targeted products, find competing products, read reviews and identify pros and cons. In this paper we focus on finding a set of comparable entities given a user’s input entity. Comparing one thing with another is a archetypal part of human decision making process. Conversely it is not all the time simple to know what to compare and what are the substitutes. To deal with this complexity we present a novel way to automatically mine comparable entities from comparative questions that users posted online. To make sure high accuracy and high recall we develop a weakly-supervised bootstrapping method for comparative question recognition and similar entity extraction by leveraging a large online question archive. Both considerably do better than an existing state-of-the-art method.  
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Network Ids Approach To Counter Zombie Explorative Attacks Using Network
           Intrusion Detection And Countermeasures Election (Nice)

    • Authors: B Hemanth, U Vinod Kumar
      Abstract: Attackers can look at vulnerabilities of a cloud system and compromise virtual machines to organize additional large-scale Distributed Denial-of-Service (DDoS). DDoS attacks generally occupy early stage actions such as multi-step exploitation, low frequency vulnerability scanning and compromising identified vulnerable virtual machines as zombies and lastly DDoS attacks through the compromised zombies. Within the cloud system particularly the Infrastructure-as-a-Service (IaaS) clouds the detection of zombie study attacks is tremendously hard. This is for the reason that cloud users may set up susceptible applications on their virtual machines. To prevent susceptible virtual machines from being compromised in the cloud we suggest a multi-phase distributed vulnerability detection, measurement and countermeasure selection method called NICE which is built on attack graph based on analytical models and reconfigurable virtual network-based countermeasures. The planned framework leverages Open Flow network programming APIs to assemble a monitor and control plane over dispersed programmable virtual switches in order to considerably pick up attack detection and mitigate attack consequences.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • A Protective Scheme To Prevent The Attacker From Forging Acknowledgment
           Packets In Manets’s Using Eaack

    • Authors: K Pravardhan, U Vinod Kumar
      Abstract: Amongst all the modern wireless networks Mobile Ad hoc network (MANET) is one of the most significant and exclusive applications. MANET does not necessitate a fixed network infrastructure every single node works as both a transmitter and a receiver. Nodes communicate directly with each other when they are both within the same communication range. Or else they depend on their neighbours to relay messages. The self-configuring capability of nodes in MANET made it well-liked among decisive mission applications like military use or emergency recovery. Though the open medium and broad allocation of nodes make MANET susceptible to malicious attackers. It is crucial to build up well-organized intrusion-detection mechanisms to guard MANET from attacks. With the developments of the technology and cut in hardware costs we are observing a current trend of expanding MANETs into industrial applications.  We propose and implement a new intrusion-detection system named Enhanced Adaptive Acknowledgment (EAACK) particularly considered for MANETs.  
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Cooperative Caching Strategy For Provisioning Cost Minimization In Social
           Wireless Networks(Swnet’s)

    • Authors: P Nagaraju, Rajesh Babu Nagineni
      Abstract: Social Wireless Networks are formed by mobile devices such as data enabled phones, electronic book readers etc., allocating common interests in electronic content and physically gathering together in public places. Electronic object caching in such social wireless networks (SWNETs)are capable to diminish the content provisioning cost which depends greatly on the service and pricing dependences amide range of stakeholders together with content providers (CP), network service providers and End Consumers (EC). Drawing inspiration from Amazon’s Kindle electronic book delivery business, this paper build up practical network, service and pricing models which are then used for creating two object caching approaches for diminishing content provisioning costs in networks with homogenous and assorted object demands. The paper createslogical and replication models for analyzing the proposed caching approachesin the presence of selfish users that diverge from network-wide cost-optimal policies.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Mobile Ad Hoc Networks Authentication Using Npv Method

    • Authors: Koneru Sudhir, Rajesh Babu Nagineni
      Abstract: NPV (neighbour position verification) method is companionable with security architectures counting the ones that havebeen projected for vehicular networks whichsymbolize a likely deployment environment for NPV.Such a situation is of particular interest since it leaves thedoor open for adversarial nodes to misuse or disturb thelocation-based services.Wedeal withthe open issue by suggesting a completelycirculated cooperative solution that is robust against independent andcolluding adversaries and can be weaken only by an overwhelming presence of adversaries.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Provable Security Against Vampire Attacks From Wsn’s

    • Authors: K Rajeev, Rajesh Babu Nagineni
      Abstract: The “Vampire” attacks are not precise to any detailed etiquette but quite rely on the properties of various popular classes of routing protocols. Examined protocols are vulnerable to Vampire attacks which are devastating, difficult to detect and are simple to carry out by means of few as one malicious insider transfer only protocol-compliant messages.  A single Vampire can augment network-wide energy usage by a factor of O (N), where N in the number of network nodes. We discuss methods to alleviate these types of attacks including a new proof-of-concept protocol that provably limits the damage caused by Vampires throughout the packet forwarding phase.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Classified Average Precision (Cap) To Evaluate The Performance Of
           Inferring User Search Goals

    • Authors: H M Sameera, N Rajesh Babu
      Abstract: The presumption and examination of user search goals can be very useful in getting better performance of search engine. To deduce user search goals by analyzing search engine query logs a novel approach is proposed. We suggest a novel approach to infer user search goals by analyzing search engine query logs. Initially we propose a framework to find out different user search goals for a query by clustering the proposed feedback sessions. Feedback sessions are created from user click-through logs and can resourcefully imitate the information needs of users. Second we propose a novel approach to produce pseudo-documents to better stand for the feedback sessions for clustering. Finally we propose a new criterion “Classified Average Precision (CAP)” to calculate the performance of inferring user search goals. We define user search goals as the information on different aspects of a query that user groups want to obtain. Information need is a user’s particular need to attain information to convince his/her need. User search goals can be considered as the clusters of information needs for a query.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Energy Efficient Group Key Management (Eegk) For Secure Data Processing In
           Ad Hoc And Wsn Networks.

    • Authors: K Haribabu, D Vijay
      Abstract: WMNs have been in recent times recommended as a capable low-cost approach to provide last-mile high-speed Internet access. A typical WMN is a multihop hierarchical wireless network. A major challenge in formulating such systems is to prevail over the difficulty of the potentially limited communication from the group to the sender. The unavailability of a completely trusted key generation centre and the dynamics of the sender. The existing key management paradigms cannot deal with these challenges efficiently. This paper proposes and states a protocol for allocating and administrating secure group keys in ad hoc environments which applies for the Secure Optimized Link State Routing Protocol (SOLSR). Our protocol manages group keys taking into contemplation the frequent network partitions and the absence of infrastructure. The analysis shows that the protocol is energy efficient for high key replacement rates and frequent network partitions. We have using an Energy Efficient Group key management (EEGK) for secure data processing on network. A provably secure protocol in the new key management paradigm and execute widespread experiments in the context of mobile ad hoc networks.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Enhance The Performance Of Mobile Presence Services By Scalable Server
           Architecture (Presence Cloud)

    • Authors: NLDRS Kalyan, Rajesh Babu Nagineni
      Abstract: A mobile existence overhaul is a necessary constituent of a social network application as it uphold each mobile user’s presence information such as the current status, GPS location and network address. Also updates the user’s online friends with the information repeatedly. If presence updates happen frequently, the massive number of messages dispersed by presence servers may lead to a scalability issue in a large-scale mobile presence service. The proposal of an efficient and scalable server architecture called Presence Cloud which facilitates mobile presence services to hold up large-scale social network applications. We study the performance of Presence Cloud in terms of the search cost and search satisfaction level. The search cost is defined as the total number of messages created by the presence server when a user arrives and search satisfaction level is defined as the time it takes to look for the arriving user’s friend list.
      PubDate: 2014-12-03
      Issue No: Vol. 3 (2014)
       
  • Load balancing and a Gossip protocol for dynamic resource allocation in
           cloud Environment

    • Authors: P.S. Lavanya, K. Devipriya
      Abstract: The new emerging cloud computing technology is providing various services to users and organizations. Now we are focusing on Infrastructure as a service which allows customers to use resource multiplexing through virtualization technology. Cloud computing applications are developed using MapReduce programming. Cloud computing distributed file system nodes perform functionality like computing as well as storage in this a file is partitioned into a number of chunks allocated in distinct nodes .based on that  MapReduce tasks can be performed in parallel over the nodes but in a cloud computing environment, failure is the common means  nodes may be upgraded, replaced, and added in the system. Files can also be dynamically created, deleted, and appended. This results in load imbalance in a distributed file system; that is, the file chunks are not distributed as uniformly among the nodes. In this project introducing distributed load rebalancing algorithm which eliminated load imbalance problem and proposing gossip protocol which maintains dynamic resource management for large scale cloud. It dynamically maximizing the cloud utility under CPU and memory constraints.
      PubDate: 2014-12-02
      Issue No: Vol. 3 (2014)
       
  • A Key Private Re-Encryption Scheme To Secure And Privacy-Preserving Using
           Cam

    • Authors: R. Ramadevi, SK.Ahmad Shah
      Abstract: In a remote Health monitoring system a client can set up a portable sensor to collect various physiological data to diagnosis himself. Such physiological data could then be sent to a central server which could then run a variety of web medical applications on these data to return timely advice to the client. Cloud-assisted mHealth monitoring could offer a great prospect to perk up the quality of healthcare services and potentially reduce healthcare costs there is a hesitant block in making this technology a reality. It is based on a new alternative of key private proxy re-encryption scheme in which the company only wants to achieve encryption once at the setup phase while shifting the rest computational tasks to the cloud without compromising privacy moreover reducing the computational and communication burden on clients and the cloud.
      PubDate: 2014-12-02
      Issue No: Vol. 3 (2014)
       
  • Technique For Content-Based Filtering On Unwanted Messages Posted On OSN
           User Walls

    • Authors: T.Radha Rukmini, N.Rajesh Babu
      Abstract: Every day constant communications entail the swap of several types of content as well as free text, image, audio, and video data.  Online Social Networks (OSNs) are today one of the most well-liked interactive medium to communicate, share and distribute a substantial amount of human life information. Conversely the aim of the majority of these proposals is mainly to offer users a classification mechanism to avoid they are besieged by useless data. In OSNs, information filtering can also be used for a different more sensitive purpose. This is due to the fact that in OSNs there is the opportunity of posting or commenting other posts on particular public/private areas called in general walls. The system provides a powerful rule layer exploiting a supple language to identify Filtering Rules (FRs) by which users can state what contents should not be displayed on their walls. FRs can support a multiplicity of different filtering criteria that can be combined and customized according to the user needs. More accurately FRs exploit user profiles, user relationships as well as the output of the ML classification process to state the filtering criteria to be compulsory. In addition the system provides the support for user-defined BlackLists (BLs) that is lists of users that are temporarily prevented to post any kind of messages on a user wall.
      PubDate: 2014-12-02
      Issue No: Vol. 3 (2014)
       
  • Content-based image retrieval using DWT based feature extraction and
           texture, shape and color features

    • Authors: Yogita Dhanraj Mistry, Dilip T.Ingole
      Abstract: Content Based Image Retrieval (CBIR) is the retrieval of images based on visual features such as colour, texture and shape. In this paper, we propose the algorithm on the basis of extraction and matching of color and texture. These algorithm are based on the computation of energy levels and Euclidean distance between the energy of the query image and database images. The precision in the results are compared for the given features.
      PubDate: 2014-12-01
      Issue No: Vol. 3 (2014)
       
  • VHDL Implementation of High Speed Fault Injection Tool for testing FPGA
           based designs

    • Authors: G.Roja Shanthi, B.V . Ramana, K. Sirisha, K.Praveen Kumar
      Abstract: Fault injection is mainly used to test and evaluate the fault-tolerance based designs. In current VLSI technology fault injection has become a popular technique for experimentally determining dependability parameters of a system, such as fault latency, fault propagation and fault coverage. Even though a considerable progress has been made in research part of the fault injection algorithms, there is a little implementation is done which could be of great interest to VLSI industry. In this project an FPGA-based fault injection tool  has been developed to build a real time fault injection mechanism with good Performance in all the aspects.
      PubDate: 2014-12-01
      Issue No: Vol. 3 (2014)
       
  • Wireless real time health monitoring system built with FPGA and RF
           networks

    • Authors: P. Girish, B .V . Ramana, G.M.V. Prasad, S.V.S.M. Madhulika
      Abstract: In recent Days, heart disease is a major concern in the health indicator for the elderly. Cardiovascular diseases are always the leading cause of death in many countries. Due to the rapid growth of elderly population in recent years, health monitoring systems have played a more important role in the early detection of heart attack and cardiovascular diseases. In this project, a real-time ECG monitoring system featuring HRV (Heart Rate Variability) analysis and wireless data transmission through radio frequency based on a System-on-Chip (SoC) development platform is proposed Modelsim Xilinx Edition (MXE) and Xilinx ISE will be used simulation and synthesis respectively. The Xilinx Chipscope tool will be used to test the FPGA inside results while the logic running on FPGA. The Xilinx Spartan 3E Family FPGA development board will be used for this project.
      PubDate: 2014-12-01
      Issue No: Vol. 3 (2014)
       
  • Pipeline Based Distributed and Anonymised Skyline Query Processing

    • Authors: Y.Sai Sindhu, G.Suryakala Eswari, N. Leelavathy
      Abstract: In recent ages handling of large amount of data as well as passing queries to such data is going to become challenging. More advanced query operators are essential to actionable knowledge discovery. Here actionable knowledge means the information which is used to take any decision for implementation. Skyline query processing in highly effervescent and strewn milieu requires no conformist methods or algorithms due to lack of inclusive acquaintance. This paper presents a novel approach called “Pipeline Based Distributed and Anonymised Skyline Query Processing”. Due to this strategy query processing is pipelined to speed up the process as well as version wise query results to differentiate results from time to time due to dynamic insertions or deletions in Skyline dataset. An algorithm is proposed to simulate the proposed approach.
      PubDate: 2014-12-01
      Issue No: Vol. 3 (2014)
       
  • Real time Implementation of Side-Channel Passive Attacks on Cryptographic
           Hardware using FPGA

    • Authors: K.Durga Rajasekhar, O.Sudha Bharathi, K. Sirisha, R.Satish Kumar
      Abstract: Cryptanalysis is the field of research where the cryptographic algorithms are studied to break them and further extract the information. There are several types of cryptanalysis algorithms apart from brute force attacks on dictionary based searching. In recent days the new class of cryptanalysis algorithms is evolved based on clock violations and Meta stable conditions of flip-flops which are part of encryption algorithms. In this project an FPGA based test bed is realized for injecting faults through clock glitches, to result in setup and hold violations.  The UART interface is realized on FPGA to provide PC based controlling for this fault injection. The pre-build serial International Data Encryption (IDEA) algorithm synthesis models (.ngc files) will be used as test encryption algorithm. A main objective of our research is to develop an efficient method for protecting FPGA-based implementations of cryptographic algorithms through effective concurrent testing of various types of faults, including faults injected by the attackers. An essential part of this research is to develop a method and tool for the evaluation of susceptibility of FPGA-based circuits to fault injection attacks. In this paper, we present such a method and tool. It allows us to examine an FPGA-based circuit, in particular an implementation of a cryptographic algorithm, subjected to a fault injection attack based on clock glitching. The effectiveness of the proposed approach is assessed for the IDEA implementation.  
      PubDate: 2014-12-01
      Issue No: Vol. 3 (2014)
       
  • Robust Image Watermarking Using Three Domains of SVD

    • Authors: Madhuri Vinakollu, K. Veera Swamy
      Abstract: In this paper robust watermarking scheme is proposed using SVD. Initially singular value decomposition is applied to the host image. After SVD, watermark is embedded in three domains i.e., in D, U and V. Watermark is embedded in individual domain as well as combination of domains. Embedding in D domain is implemented by modifying bits. Embedding in U and V domains is implemented by changing coefficient values. Robustness of the proposed algorithm is verified by applying attacks like rotation, rows removal, cropping, salt & pepper noise, speckle noise and gaussian noise. Results indicate the proposed method is able to survive for different attacks.
      PubDate: 2014-12-01
      Issue No: Vol. 3 (2014)
       
  • Modelling of Buck-Boost Converter for Photovoltaic and Battery Power
           Systems

    • Authors: K. Arun kumar, B.W.Vijay kumar, B.Subba Reddy
      Abstract: In this paper a buck-boost converter with photovoltaic (PV) and battery power for high step-up system is discussed and implemented. The motive of this project is to design a MPPT(maximum power point tracking ) Algorithm will be disabled only when the  battery charging voltage is too high. The objective of this project to design a MPPT for efficiently maximizing the  power of a PV panel supplying to a load or battery bus under varying metrological conditions. The coupled inductors are used to achieve high step-up voltage gain and reduce the voltage stress of input side switches. A PV array output power is used to directly control the dc-dc converter this reducing the complexity of the system . A PWM dc-dc SEPI converter topology operating in continuous current mode is simulated for the MPPT. The monitoring of power output is choosen as tracking algorithms for the MPPT. The controlled scheme of the proposed converter has Merits of high boosting level reduce number of devices and simple control strategy.
      PubDate: 2014-12-01
      Issue No: Vol. 3 (2014)
       
  • Performance Analysis of Thirteen Level Asymmetrical Multi String Multi
           Level Inverter Fed Three Phase Induction Motor Drive

    • Authors: M.Veera Brahmam, K.V.Eswara Rao, B. Subba Reddy
      Abstract: The concept of multilevel inverters, introduced about 20 years ago entails performing power conversion in multiple voltage steps to obtain improved power quality, lower switching losses, better electromagnetic compatibility, and higher voltage capability. The benefits are especially clear for medium-voltage drives in industrial applications and are being considered for future naval ship propulsion systems. Several topologies for multilevel inverters have been proposed over the years; the most popular cascaded H-bridge multi level inverter (CHBMLI) apart from other multilevel inverters is the capability of utilizing different dc voltages on the individual H-bridge cells which results in splitting the power conversion amongst higher-voltage lower-frequency and lower-voltage higher-frequency inverters. But the main disadvantages of Cascaded H-bridge multi level inverters are complexity, requiring a more number of power devices and passive components, and complex control circuitry.  In this thesis, a Multi String Multi Level Inverter (MSMLI) topology is proposed, which offer strong advantages like an improved output waveforms, smaller filter size, and lower electromagnetic interference. Here an asymmetrical configuration of thirteen-level inverter (TLI) based Multi String Multi Level topology fed Three Phase Induction Motor Drive performance is analyzed and compared with conventional cascaded H- bridge multi level inverter. The performance factors are obtained at both transient, load variation and steady state operating conditions with usage of minimum number of switches so that switching losses total harmonic distortion (THD) can be reduced effectively with multi string multi level approach.
      PubDate: 2014-12-01
      Issue No: Vol. 3 (2014)
       
  • Multichannel Contact Center Performance Analysis

    • Authors: Priya Kishor Ithape, Anil S. Hiwale
      Abstract: The Contact Centers play important role in customer interactions. They provide information to differentiate company products and services and build loyalty relations with customers. The Contact Center is the central point where customer contacts are managed. Multichannel means several ways of managing customer contacts. The Multichannel Contact Center allows your business to interact with different communication media like text/sms, email, fax, web chats including the traditional phone calls. The Multichannel Contact Center offer customers a variety of ways to communicate with the organizations and enhance customer relationships and provide quality of service. We design and implement a system that supports Multichannel Contact Center and present the performance analysis for the system.
      PubDate: 2014-12-01
      Issue No: Vol. 3 (2014)
       
  • Unobservable Secure Proactive Routing Protocol For Fast & Secure
           Transmission

    • Authors: S. Srikanth, S.Penchala Reddy, V. Jai Kumar
      Abstract: A mobile ad hoc network (MANET) is a collection of mobile nodes that is connected through a wireless medium forming rapidly changing topologies.  it allowing people and devices to seamlessly communicate without any pre-existing communication architecture. Each node in the network also acts as a router. Privacy preserving routing mechanism is very important for MANET. Mobile Ad-hoc Networks (MANETS) are particularly useful and well-suited for critical scenarios, including military, law enforcement. Security protection, unobservability otherwise the data may hacked by attackers. Number of schemes have been proposed even they don’t have efficient routing mechanism for protecting the MANET. In this project we proposed unobservable secure proactive routing protocol (UOSPR) efficient it uses a combination of group signature and ID-based encryption for route discovery..  The main objective of this work is to develop a privacy preserving routing protocol scheme that consumes low network delay, minimum packet loss, packet delivery fraction. By implementing a UOSPR protocol using advanced hashing technique in NS2 and designed by using spread spectrum technique, the performance of UOSPR Protocol is improved and the same is proved through NS2 simulation compared with USOR protocol.
      PubDate: 2014-11-30
      Issue No: Vol. 3 (2014)
       
  • Cloud-based Mobile Social Networking Video Monitoring

    • Authors: B.Swarna Latha, T.Sudha Rani
      Abstract: The latest cloud computing knowledge with wealthy possessions to recompense for the limitations of mobile devices and connections can potentially provide a perfect proposal to hold up the desired mobile services. We propose the design of a Cloud-based novel Mobile social TV system. The system efficiently uses both Platform-as-a-Service and Infrastructure-as a- Service cloud services to present the living-room knowledge of video watching to a group of unequal mobile users who can interrelate socially while sharing the video. To agreement good streaming quality as knowledgeable by the mobile users with time unreliable wireless connectivity these different designs for supple transcoding capabilities, battery efficiency of mobile devices and spontaneous social interactivity jointly provide an ideal platform for mobile social TV services. The individual mobile devices are as long as greatly richer contents and social interactions to users on the move. This trend though is throttled by the limited battery lifetime of mobile devices and unbalanced wireless connectivity making the uppermost probable quality of service experienced by mobile users not possible.
      PubDate: 2014-11-30
      Issue No: Vol. 3 (2014)
       
  • Capabilities and Limitations of Path Gain Adjustment in Harmonic Rejection
           Mixers

    • Authors: Ludwig Lubich
      Abstract: Harmonic rejection ratios (HRR) of harmonic rejection mixers (HRM) are limited because of gain and phase inaccuracies. Gain and phase calibration can be employed to enhance HRRs. This paper deals in a systematic way with the number of harmonics that can be completely suppressed simultaneously in HRMs using only gain adjustment in the presence of uncorrected phase errors. For this purpose the conditions for harmonic suppression are expressed as a system of equations and the system is examined. The restrictions on the combinations of completely suppressed harmonics are examined too. It is shown that the complete suppression of some combinations of local oscillator harmonics can result in extremely large path gains and unacceptable SNR degradation. The results are applicable to HRMs with gain calibration as well as to HRMs employing digital domain harmonic rejection techniques.
      PubDate: 2014-11-30
      Issue No: Vol. 3 (2014)
       
  • Power Analysis of Concurrent Error Detection in Orthogonal Latin Squares
           Codec

    • Authors: M Lalita_Kiranmani, G S S Prasad
      Abstract: One of the major drawbacks of the data transmission is existence of errors. These errors exist in the circuits for transmission, reception and data storage. Error correction codes (ECCs) are commonly used to protect memories from errors. As multi bit errors become more frequent, single error correction codes are not enough and more advanced ECCs are needed. Orthogonal Latin squares (OLS) codes are one-step majority logic decodable (OS-MLD) and have been recently considered to protect caches and memories. OLS codes are better than the other codes used as they provide wide range for block sizes and error correction capabilities. The proposed method reduces the overhead of the parity bits by extending the data block size to be protected. The proposed codes are implemented in Spartan 6 xc6slx453csg324 and  power analysis have been performed.
      PubDate: 2014-11-30
      Issue No: Vol. 3 (2014)
       
  • Big data Analytics in the Education Sector: Needs, Opportunities and
           Challenges

    • Authors: Shikha Anirban
      Abstract: Academic institutions are now drawing attention in finding methods for making effective learning process, for identifying learner’s achievements and weakness, for tracing academic progress and also for predicting future performance. People’s increased expectation for accountability and transparency makes it necessary to implement big data analytics in the educational institution. But not all the educationalist and administrators are ready to take the challenge. So, it is now obvious to know about the necessity and opportunity as well as challenges of implementing big data analytics. This paper will describe the needs, opportunities and challenges of implementing big data analytics in the education sector.
      PubDate: 2014-11-30
      Issue No: Vol. 3 (2014)
       
  • Effective Mining Scheme for Large Streams Personalized Data Using Sparse
           Data

    • Authors: D.Narsimha Reddy, B. Sivaiah
      Abstract: Reference methods are extremely significant in the fields of E-commerce and other Web-based services. One of the major complexities is dynamically providing high-quality suggestion on sparse data. In this paper a work of fiction lively modified suggestion algorithm is proposed in which information contained in both ratings and profile contents are make use by searching hidden relations between ratings a set of dynamic features are calculated to explain user inclinations in multiple segments and lastly a recommendation is made by adaptively weighting the features. Tentative consequences on public datasets show that the planned algorithm has gratifying presentation.  
      PubDate: 2014-11-30
      Issue No: Vol. 3 (2014)
       
  • A New Approach to Increase the Efficiency of Classical Approach In
           Designing Management Information Systems (MIS’S)

    • Authors: Mohammad M M Abu Omar
      Abstract: Classical approach is one of information systems methodologies that are used to design and build the management information systems (MIS’s), it always uses the all five stages in its life cycle during the design of (MIS). Management information system (MIS) is a computer based system which concerns greatly with computer programs, and according to the availability of wide range of computer programs (software), this paper presents a new approach in designing management information systems by using classical approach according to the type of computer program (software) that (MIS) needs. This approach will lead in some cases to partially use of classical approach life cycle instead of the fully use of the life cycle, which will save time, effort and cost in designing the (MIS) , and this will increase the efficiency of designing (MIS) by using classical approach.
      PubDate: 2014-11-30
      Issue No: Vol. 3 (2014)
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2014