Android Based School Bus Tracking System

Mobile Computing, Web Application
" Name Android Based School Bus Tracking System Technology Android Category Mobile Computing Description This system is a combination of web as well as android application where the driver will be using the android application whereas admin and parent will be using web application. This application is meant for drivers who is driving the school bus. System allows admin to add a new driver where driver id and password is generated and stored into the system. The driver will have the android application installed in his android phone, when the driver will login to the application, his GPS location will be sent and stored into database. As soon as driver logs in, GPS location of the driver will be tracked automatically by the application and stores the GPS co-ordinates into…
Read More

Android Smart City Traveler

Mobile Computing, Web Application
Name Android Smart City Traveler Technology Android Category Mobile Computing Description The purpose of developing this android application is to create a schedule for the traveler travelling to city and wanted to explore the city by specifying the time in hours. System then smartly analyzes the questionnaire and creates a schedule for traveler based on provided time. The development is done in two technical languages as Java for Android Application for User/Traveler and Asp .net for Web portal which is used by Admin. First of all, traveler need to register himself by filling up the details using android application. After successful registration, user can login now using login credentials which then proceeds with questionnaire where application ask user about their likings and habits. Based on questionnaire, application smartly analyzes for…
Read More

Android Attendance System

Mobile Computing, Web Application
" Name Android Attendance System Technology Android Category Mobile Computing Description The mobile attendance system has been built to eliminate the time and effort wasted in taking attendances in schools and colleges. It also greatly reduces the amount of paper resources needed in attendance data management.This is an android mobile app. It’s built to be used for school/college faculty so that they may take student attendance on their phones. The system is divided into following modules: Student Attendance List Creation: Once this App is installed on a phone, a it allows user to create a student attendance sheet consisting of name, roll number, date, Absent/Present mark and subject. He has to fill student names along with associated roll numbers. Attendance Marking: The faculty has the list on his phone now.…
Read More

Android Geo Fencing App Project

Mobile Computing, Web Application
Name Android Geo Fencing App Project Technology Android, Dot net Category Mobile Computing Description This developed project work for parents and their children’s. The parents and children’s both should have GPS based smart phones. The application is used to track the child’s location using their smartphone. To access this application, parent need to create an account by filling up basic registration details and create a login id and password. Using valid login credentials, parent can login and access the application modules. After successful login, parent need to add their child details and also need to create a login id and password for their child in order to track their location. While registering their child name, parent need to set a geo fence around their children by selecting a point on…
Read More

Secure Mining of Association Rules in Horizontally Distributed Databases

Data mining
Name Secure Mining of Association Rules in Horizontally Distributed Databases Technology Dot net, MS SQL Category Data Mining Description We propose a protocol for secure mining of association rules in horizontally distributed databases. The current leading protocol is that of Kantarcioglu and Clifton [18]. Our protocol, like theirs, is based on the Fast Distributed Mining (FDM) algorithm of Cheung et al. [8], which is an unsecured distributed version of the Apriori algorithm. The main ingredients in our protocol are two novel secure multi-party algorithms—one that computes the union of private subsets that each of the interacting players hold, and another that tests the inclusion of an element held by one player in a subset held by another. Our protocol offers enhanced privacy with respect to the protocol in [18]. In…
Read More

An Efficient Certificateless Encryption for Secure Data Sharing in Public Clouds (Data Mining with cloud)

Data mining
Name An Efficient Certificateless Encryption for Secure Data Sharing in Public Clouds (Data Mining with cloud) Technology Dot net, MS SQL Category Data Mining Description We propose a mediated certificateless encryption scheme without pairing operations for securely sharing sensitive information in public clouds. Mediated certificateless public key encryption (mCL-PKE) solves the key escrow problem in identity based encryption and certificate revocation problem in public key cryptography. However, existing mCL-PKE schemes are either inefficient because of the use of expensive pairing operations or vulnerable against partial decryption attacks. In order to address the performance and security issues, in this paper, we first propose a mCL-PKE scheme without using pairing operations. We apply our mCL-PKE scheme to construct a practical solution to the problem of sharing sensitive information in public clouds. The…
Read More

Infrequent Weighted Itemset Mining Using Frequent Pattern Growth

Data mining
Name Infrequent Weighted Itemset Mining Using Frequent Pattern Growth Technology Dot net, MS SQL Category Data Mining Description Frequent weighted itemsets represent correlations frequently holding in data in which items may weight differently. However, in some contexts, e.g., when the need is to minimize a certain cost function, discovering rare data correlations is more interesting than mining frequent ones. This paper tackles the issue of discovering rare and weighted itemsets, i.e., the infrequent weighted itemset (IWI) mining problem. Two novel quality measures are proposed to drive the IWI mining process. Furthermore, two algorithms that perform IWI and Minimal IWI mining efficiently, driven by the proposed measures, are presented. Experimental results show efficiency and effectiveness of the proposed approach. IEEE Paper Yes IEEE Paper Year 2014
Read More

Interpreting the Public Sentiment Variations on Twitter

Data mining
Name Interpreting the Public Sentiment Variations on Twitter Technology Dot net, MS SQL Category Data Mining Description Millions of users share their opinions on Twitter, making it a valuable platform for tracking and analyzing public sentiment. Such tracking and analysis can provide critical information for decision making in various domains. Therefore it has attracted attention in both academia and industry. Previous research mainly focused on modeling and tracking public sentiment. In this work, we move one step further to interpret sentiment variations. We observed that emerging topics (named foreground topics) within the sentiment variation periods are highly related to the genuine reasons behind the variations. Based on this observation, we propose a Latent Dirichlet Allocation (LDA) based model, Foreground and Background LDA (FB-LDA), to distill foreground topics and filter out…
Read More

Supporting Privacy Protection in Personalized Web Search

Data mining
Name Supporting Privacy Protection in Personalized Web Search Technology Dot net, MS SQL Category Data Mining Description Personalized web search (PWS) has demonstrated its effectiveness in improving the quality of various search services on the Internet. However, evidences show that users’ reluctance to disclose their private information during search has become a major barrier for the wide proliferation of PWS. We study privacy protection in PWS applications that model user preferences as hierarchical user profiles. We propose a PWS framework called UPS that can adaptively generalize profiles by queries while respecting user specified privacy requirements. Our runtime generalization aims at striking a balance between two predictive metrics that evaluate the utility of personalization and the privacy risk of exposing the generalized profile. We present two greedy algorithms, namely GreedyDP and…
Read More

Keyword Query Routing

Data mining
Name Keyword Query Routing Technology Dot net, MS SQL Category Data Mining Description Keyword search is an intuitive paradigm for searching linked data sources on the web. We propose to route keywords only to relevant sources to reduce the high cost of processing keyword search queries over all sources. We propose a novel method for computing top-k routing plans based on their potentials to contain results for a given keyword query. We employ a keyword-element relationship summary that compactly represents relationships between keywords and the data elements mentioning them. A multilevel scoring mechanism is proposed for computing the relevance of routing plans based on scores at the level of keywords, data elements, element sets, and subgraphs that connect these elements. Experiments carried out using 150 publicly available sources on the…
Read More

Set Predicates in SQL: Enabling Set- Level Comparisons for Dynamically Formed Groups

Data mining
Name Set Predicates in SQL: Enabling Set- Level Comparisons for Dynamically Formed Groups Technology Dot net, MS SQL Category Data Mining Description In data warehousing and OLAP applications, scalar level predicates in SQL become increasingly inadequate to support a class of operations that require set-level comparison semantics, i.e., comparing a group of tuples with multiple values. Currently, complex SQL queries composed by scalar-level operations are often formed to obtain even very simple set-level semantics. Such queries are not only difficult to write but also challenging for a database engine to optimize, thus can result in costly evaluation. This paper proposes to augment SQL with set predicate, to bring out otherwise obscured set-level semantics. We studied two approaches to processing set predicates—an aggregate function-based approach and a bitmap index-based approach. Moreover,…
Read More

An Empirical Performance Evaluation of Relational Keyword Search Techniques

Data mining
Name An Empirical Performance Evaluation of Relational Keyword Search Techniques Technology Dot net, MS SQL Category Data Mining Description Extending the keyword search paradigm to relational data has been an active area of research within the database and IR community during the past decade. Many approaches have been proposed, but despite numerous publications, there remains a severe lack of standardization for the evaluation of proposed search techniques. Lack of standardization has resulted in contradictory results from different evaluations, and the numerous discrepancies muddle what advantages are proffered by different approaches. In this paper, we present the most extensive empirical performance evaluation of relational keyword search techniques to appear to date in the literature. Our results indicate that many existing search techniques do not provide acceptable performance for realistic retrieval tasks.…
Read More

Facilitating Document Annotation Using Content and Querying Value

Data mining
Name Facilitating Document Annotation Using Content and Querying Value Technology Dot net, MS SQL Category Data Mining Description A large number of organizations today generate and share textual descriptions of their products, services, and actions. Such collections of textual data contain significant amount of structured information, which remains buried in the unstructured text. While information extraction algorithms facilitate the extraction of structured relations, they are often expensive and inaccurate, especially when operating on top of text that does not contain any instances of the targeted structured information. We present a novel alternative approach that facilitates the generation of the structured metadata by identifying documents that are likely to contain information of interest and this information is going to be subsequently useful for querying the database. Our approach relies on the idea that humans are more likely to add the necessary metadata during creation time,…
Read More

Context-Based Diversification for Keyword Queries Over XML Data

Data mining
Name Context-Based Diversification for Keyword Queries Over XML Data Technology Dot net, MS SQL Category Data Mining Description While keyword query empowers ordinary users to search vast amount of data, the ambiguity of keyword query makes it difficult to effectively answer keyword queries, especially for short and vague keyword queries. To address this challenging problem, in this paper we propose an approach that automatically diversifies XML keyword search based on its different contexts in the XML data. Given a short and vague keyword query and XML data to be searched, we first derive keyword search candidates of the query by a simple feature selection model. And then, we design an effective XML keyword search diversification model to measure the quality of each candidate. After that, two efficient algorithms are proposed to incrementally compute top-k qualified query candidates as the diversified search intentions. Two selection criteria are…
Read More

Tweet Segmentation and Its Application to Named Entity Recognition

Data mining
Name Tweet Segmentation and Its Application to Named Entity Recognition Technology Dot net, MS SQL Category Data Mining Description Twitter has attracted millions of users to share and disseminate most up-to-date information, resulting in large volumes of data produced everyday. However, many applications in Information Retrieval (IR) and Natural Language Processing (NLP) suffer severely from the noisy and short nature of tweets. In this paper, we propose a novel framework for tweet segmentation in a batch mode, called HybridSeg . By splitting tweets into meaningful segments, the semantic or context information is well preserved and easily extracted by the downstream applications. HybridSeg finds the optimal segmentation of a tweet by maximizing the sum of the stickiness scores of its candidate segments. The stickiness score considers the probability of a segment being a phrase in English (i.e., global context) and the probability of a segment…
Read More

Polarity Consistency Checking for Domain Independent Sentiment Dictionaries

Data mining
Polarity classification of words is important for applications such as Opinion Mining and Sentiment Analysis. A number of sentiment word/sense dictionaries have been manually or (semi)automatically constructed. We notice that these sentiment dictionaries have numerous inaccuracies. Besides obvious instances, where the same word appears with different polarities in different dictionaries, the dictionaries exhibit complex cases of polarity inconsistency, which cannot be detected by mere manual inspection. We introduce the concept of polarity consistency of words/senses in sentiment dictionaries in this paper. We show that the consistency problem is NP-complete. We reduce the polarity consistency problem to the satisfiability problem and utilize two fast SAT solvers to detect inconsistencies in a sentiment dictionary. We perform experiments on five sentiment dictionaries and WordNet to show inter- and intra-dictionaries inconsistencies.
Read More

RRW—A Robust and Reversible Watermarking Technique for Relational Data

Data mining
Name RRW—A Robust and Reversible Watermarking Technique for Relational Data Technology Dot net, MS SQL Category Data Mining Description Advancement in information technology is playing an increasing role in the use of information systems comprising relational databases. These databases are used effectively in collaborative environments for information extraction; consequently, they are vulnerable to security threats concerning ownership rights and data tampering. Watermarking is advocated to enforce ownership rights over shared relational data and for providing a means for tackling data tampering. When ownership rights are enforced using watermarking, the underlying data undergoes certain modifications; as a result of which, the data quality gets compromised. Reversible watermarking is employed to ensure data quality along-with data recovery. However, such techniques are usually not robust against malicious attacks and do not provide any mechanism to selectively watermark a particular attribute by taking into account its role in knowledge discovery. Therefore,…
Read More

Building Confidential and Efficient Query Services in the Cloud with RASP Data Perturbation

Cloud Computing
Name Building Confidential and Efficient Query Services in the Cloud with RASP Data Perturbation Technology Dot net, MS SQL Category Cloud Computing Description With the wide deployment of public cloud computing infrastructures, using clouds to host data query services has become an appealing solution for the advantages on scalability and cost-saving. However, some data might be sensitive that the data owner does not want to move to the cloud unless the data confidentiality and query privacy are guaranteed. On the other hand, a secured query service should still provide efficient query processing and significantly reduce the in-house workload to fully realize the benefits of cloud computing. We propose the random space perturbation (RASP) data perturbation method to provide secure and efficient range query and kNN query services for protected data in the cloud. The…
Read More

Balancing Performance, Accuracy, and Precision for Secure Cloud Transactions

Cloud Computing
Name Balancing Performance, Accuracy, and Precision for Secure Cloud Transactions Technology Dot net, MS SQL Category Cloud Computing Description In distributed transactional database systems deployed over cloud servers, entities cooperate to form proofs of authorizations that are justified by collections of certified credentials. These proofs and credentials may be evaluated and collected over extended time periods under the risk of having the underlying authorization policies or the user credentials being in inconsistent states. It therefore becomes possible for policy-based authorization systems to make unsafe decisions that might threaten sensitive resources. In this paper, we highlight the criticality of the problem. We then define the notion of trusted transactions when dealing with proofs of authorization. Accordingly, we propose several increasingly stringent levels of policy consistency constraints, and present different enforcement approaches to guarantee the trustworthiness of transactions…
Read More

A Location- and Diversity-aware News Feed System for Mobile Users

Mobile Computing, Security and Encryption
Name A Location- and Diversity-aware News Feed System for Mobile Users Technology Dot net, MS SQL Category Mobile Computing,Security Description A location-aware news feed system enables mobile users to share geo-tagged user-generated messages, e.g., a user can receive nearby messages that are the most relevant to her. In this paper, we present MobiFeed that is a framework designed for scheduling news feeds for mobile users. MobiFeed consists of three key functions, location prediction, relevance measure, and news feed scheduler. The location prediction function is designed to predict a mobile user’s locations based on an existing path prediction algorithm. The relevance measure function is implemented by combining the vector space model with non-spatial and spatial factors to determine the relevance of a message to a user. The news feed scheduler works…
Read More

Generating Searchable Public-Key Ciphertexts with Hidden Structures for Fast Keyword Search

Security and Encryption
Name Generating Searchable Public-Key Ciphertexts with Hidden Structures for Fast Keyword Search Technology Dot net, MS SQL Category Security Description Existing semantically secure public-key searchable encryption schemes take search time linear with the total number of the ciphertexts. This makes retrieval from large-scale databases prohibitive. To alleviate this problem, this paper proposes Searchable Public-Key Ciphertexts with Hidden Structures (SPCHS) for keyword search as fast as possible without sacrificing semantic security of the encrypted keywords. In SPCHS, all keyword-searchable ciphertexts are structured by hidden relations, and with the search trapdoor corresponding to a keyword, the minimum information of the relations is disclosed to a search algorithm as the guidance to find all matching ciphertexts efficiently. We construct a SPCHS scheme from scratch in which the ciphertexts have a hidden star-like structure.…
Read More

Panda: Public Auditing for Shared Data with Efficient User Revocation in the Cloud

Cloud Computing, Data mining, Parallel And Distributed System, Security and Encryption, Web Application
With data storage and sharing services in the cloud, users can easily modify and share data as a group. To ensure shared data integrity can be verified publicly, users in the group need to compute signatures on all the blocks in shared data. Different blocks in shared data are generally signed by different users due to data modifications performed by different users. For security reasons, once a user is revoked from the group, the blocks which were previously signed by this revoked user must be re-signed by an existing user. The straightforward method, which allows an existing user to download the corresponding part of shared data and re-sign it during user revocation, is inefficient due to the large size of shared data in the cloud. In this paper, we propose…
Read More

Identity-Based Distributed Provable Data Possession in Multicloud Storage

Cloud Computing
Remote data integrity checking is of crucial importance in cloud storage. It can make the clients verify whether their outsourced data is kept intact without downloading the whole data. In some application scenarios, the clients have to store their data on multi-cloud servers. At the same time, the integrity checking protocol must be efficient in order to save the verifier’s cost. From the two points, we propose a novel remote data integrity checking model: ID-DPDP (identity-based distributed provable data possession) in multi-cloud storage. The formal system model and security model are given. Based on the bilinear pairings, a concrete ID-DPDP protocol is designed. The proposed ID-DPDP protocol is provably secure under the hardness assumption of the standard CDH (computational Diffie-Hellman) problem. In addition to the structural advantage of elimination of…
Read More

Query Aware Determinization of Uncertain Objects

Data mining
This paper considers the problem of determinizing probabilistic data to enable such data to be stored in legacy systems that accept only deterministic input. Probabilistic data may be generated by automated data analysis/enrichment techniques such as entity resolution, information extraction, and speech processing. The legacy system may correspond to pre-existing web applications such as Flickr, Picasa, etc. The goal is to generate a deterministic representation of probabilistic data that optimizes the quality of the end-application built on deterministic data. We explore such a determinization problem in the context of two different data processing tasks -- triggers and selection queries. We show that approaches such as thresholding or top-1 selection traditionally used for determinization lead to suboptimal performance for such applications. Instead, we develop a query-aware strategy and show its advantages…
Read More

Discovery of Ranking Fraud for Mobile Apps

Data mining
Ranking fraud in the mobile App market refers to fraudulent or deceptive activities which have a purpose of bumping up the Apps in the popularity list. Indeed, it becomes more and more frequent for App develops to use shady means, such as inflating their Apps’ sales or posting phony App ratings, to commit ranking fraud. While the importance of preventing ranking fraud has been widely recognized, there is limited understanding and research in this area. To this end, in this paper, we provide a holistic view of ranking fraud and propose a ranking fraud detection system for mobile Apps. Specifically, we investigate two types of evidences, ranking based evidences and rating based evidences, by modeling Apps’ ranking and rating behaviors through statistical hypotheses tests. In addition, we propose an optimization…
Read More

Control Cloud Data Access Privilege and Anonymity with Fully Anonymous Attribute-Based Encryption

Cloud Computing
Cloud computing is a revolutionary computing paradigm which enables flexible, on-demand and low-cost usage of computing resources, but the data is outsourced to some cloud servers, and various privacy concerns emerge from it. Various schemes based on the Attribute-Based Encryption have been proposed to secure the cloud storage. However, most work focuses on the data contents privacy and the access control, while less attention is paid to the privilege control and the identity privacy. In this paper, we present a semi-anonymous privilege control scheme AnonyControl to address not only the data privacy but also the user identity privacy in existing access control schemes.AnonyControl decentralizes the central authority to limit the identity leakage and thus achieves semi-anonymity. Besides, it also generalizes the file access control to the privilege control, by which…
Read More

Design of a Secured E-voting System

Mobile Computing
Name Design of a Secured E-voting System Technology Android, Dot net, MS SQL Category Mobile Computing Description E-voting systems are becoming popular with the widespread use of computers and embedded systems. Security is the vital issue should be considered in such systems. This paper proposes a new e-voting system that fulfills the security requirements of e-voting. It is based on homomorphic property and blind signature scheme. The proposed system is implemented on an embedded system which serves as a voting machine. The system employes RFID to store all conditions that comply with the rule of the government to check voter eligibility. IEEE Paper Yes IEEE Paper Year 2012 Contact Form [contact-form-7 id="71" title="Contact form 1"]
Read More

Shopping Application System With Near Field Communication (NFC) Based on Android

Mobile Computing, Web Application
Name Shopping Application System With Near Field Communication (NFC) Based on Android Technology Android, Dot net, MS SQL Category Mobile Computing Description The rapid development of mobile communications systems today, along with the changing times and technology, both in terms of hardware, operating system used and the use of Internet bandwidth, making some mobile applications also contribute to exploit these developments. Mobile Commerce Applications for an example, became the most popular applications for mobile users who do not want to trouble yourself with having to carry cash everywhere. An important technology behind mobile payments is called Near Field Communication (NFC). As an indication that NFC represents the potential and tremendous business, leading companies such as Nokia, Microsoft and NXP Semiconductors, actively engaged in the NFC Forum. Shopping application process integrated…
Read More

Developing an Android based Learning Application for Mobile Devices

Mobile Computing
Name Developing an Android based Learning Application for Mobile Devices Technology Andorid, Dot net, MS SQL Category Mobile Computing Description his paper is about the development of MLEA, a platform that assists, through Android cellphones and tablets, the mobility of users of learning virtual environments. MLEA is an application that implements computational techniques such as web services, design patterns, ontologies, and mobile computational techniques in order to allow the communication between mobile devices and the content management system – Moodle. It´s based on a service oriented, client server architecture that combines the REST protocol and JSON format for data interchange. The client will be provided with features for alerts, file downloads, chats and forums, grade books, quizzes, and calendar, among others. IEEE Paper Yes IEEE Paper Year 2012 Contact Form…
Read More

Location Based Services using Android Mobile Operating System

Mobile Computing
Name Location Based Services using Android Mobile Operating System Technology Android Category Mobile Computing Description The motivation for every location based information system is: “To assist with the exact information, at right place in real time with personalized setup and location sensitiveness”. In this era we are dealing with palmtops and iPhones, which are going to replace the bulky desktops even for computational purposes. We have vast number of applications and usage where a person sitting in a roadside café needs to get relevant data and information. Such needs can only be catered with the help of LBS. These applications include security related jobs, general survey regarding traffic patterns, decision based on vehicular information for validity of registration and license numbers etc. A very appealing application includes surveillance where instant…
Read More

Mobile Phone Based Drunk Driving Detection

Mobile Computing
Name Mobile Phone Based Drunk Driving Detection Technology Android, Dot net Category Mobile Computing Description Drunk driving, or officially Driving Under the Influence (DUI) of alcohol, is a major cause of traffic accidents throughout the world. In this paper, we propose a highly efficient system aimed at early detection and alert of dangerous vehicle maneuvers typically related to drunk driving. The entire solution requires only a mobile phone placed in vehicle and with accelerometer and orientation sensor. A program installed on the mobile phone computes accelerations based on sensor readings, and compares them with typical drunk driving patterns extracted from real driving tests. Once any evidence of drunk driving is present, the mobile phone will automatically alert the driver or call the police for help well before accident actually happens.…
Read More

Android based elimination of potholes

Mobile Computing
Name Android based elimination of potholes Technology Android, Dot net, MS-SQL Category Mobile Computing Description Its a web based project where user or normal residential people can complain about their nearby potholes. They can take an image of it and upload it to submit to BMC department. Every user will have their own credentials to login and to view the potholes. BMC will have their own admin login details to look after the posting and tackle or reply to each complaints so that they can sort those problem as soon as possible. IEEE Paper Yes IEEE Paper Year 2012 Contact Form [contact-form-7 id="71" title="Contact form 1"]
Read More

A Personalized Mobile Search Engine

Mobile Computing
Name A Personalized Mobile Search Engine Technology Android, Dot net Category Mobile Computing Description We propose a personalized mobile search engine, PMSE, that captures the users’ preferences in the form of concepts by mining their clickthrough data. Due to the importance of location information in mobile search, PMSE classifies these concepts into content concepts and location concepts. In addition, users’ locations (positioned by GPS) are used to supplement the location concepts in PMSE. The user preferences are organized in an ontology-based, multi-facet user profile, which are used to adapt a personalized ranking function for rank adaptation of future search results. To characterize the diversity of the concepts associated with a query and their relevances to the users need, four entropies are introduced to balance the weights between the content and…
Read More

Designing the Next Generation of Mobile Tourism Application based on Situation Awareness

Mobile Computing
Name Designing the Next Generation of Mobile Tourism Application based on Situation Awareness Technology Android Category Mobile Computing Description Mobile tourism applications are changing the way travelers plan and experience tourism in the years to come. A large and growing body of literature has investigated the development of context awareness mobile applications for tourism industry. Various aspects of context awareness are studied and applied in tour guide companions and recommendation systems. However, these context awareness mobile applications do not improve traveler’s situation awareness especially in pre-visiting and during visiting phases. In other words, when using mobile applications, travelers may not perceive the situation correctly, fail to comprehend the situation or they are unable to anticipate the future development. This paper proposes a theoretical approach for designing mobile tourism applications using…
Read More

Secure Authentication using Image Processing and Visual Cryptography for Banking Applications

Web Application
Name Secure Authentication using Image Processing and Visual Cryptography for Banking Applications Technology PHP / Dot Net Category Web Application Description Core banking is a set of services provided by a group of networked bank branches. Bank customers may access their funds and perform other simple transactions from any of the member branch ofces. The major issue in core banking is the authenticity of the customer. Due to unavoidable hacking of the databases on the internet, it is always quite difcult to trust the information on the internet. To solve this problem of authentication, we are proposing an algorithm based on image processing and visual cryptography. This paper proposes a technique of processing the signature of a customer and then dividing it into shares. Total number of shares to be…
Read More

An Algorithm to Automatically Generate Schedule for School Lectures Using a Heuristic Approach

Web Application
Name An Algorithm to Automatically Generate Schedule for School Lectures Using a Heuristic Approach Technology PHP / Dot Net Category Web Application Description This paper proposes a general solution for the School timetabling problem. Most heuristic proposed earlier approaches the problem from the students’ point of view. This solution, however, works from the teachers’ point of view i.e. teacher availability for a given time slot. While all the hard constraints (e.g. the availability of teachers, etc.) are resolved rigorously, the scheduling solution presented in this paper is an adaptive one, with a primary aim to solve the issue of clashes of lectures and subjects, pertaining to teachers. IEEE Paper Yes IEEE Paper Year 2012 Contact Form [contact-form-7 id="71" title="Contact form 1"]
Read More

A Mixed Reality Virtual Clothes Try-On System

Web Application
Name A Mixed Reality Virtual Clothes Try-On System Technology PHP / Dot Net Category Networking Description Virtual try-on of clothes has received much attention recently due to its commercial potential. It can be used for online shopping or intelligent recommendation to narrow down the selections to a few designs and sizes. In this paper, we present a mixed reality system for 3D virtual clothes try-on that enables a user to see herself wearing virtual clothes while looking at a mirror display, without taking off her actual clothes. The user can select various virtual clothes for trying-on. The system physically simulates the selected virtual clothes on the user's body in real-time and the user can see virtual clothes fitting on the her mirror image from various angles as she moves. The…
Read More