A Secure Protocol for Spontaneous Wireless Ad Hoc Networks Creation Abstract? A Secure Protocol for Spontaneous Wireless Ad Hoc Networks Creation.a secure protocol for spontaneous wireless ad hoc networks which uses an hybrid symmetric/asymmetric scheme and the trust between users in order to exchange the initial data and to exchange the secret keys that will…
A secure remote user mutual authentication scheme using smart cards Abstract? Authentication thwarts unauthorised users from accessing resources in insecure network environments. Password authentication based on smart cards is one of the simplest and most ef?cient authentication methods and is commonly deployed to authenticate the legitimacy of remote users. Based on cryptographic techniques, several password…
A Secured Authentication System for MANETs using voice and Fingerprint Biometrics Abstract?Mobile Adhoc NETworks (MANET) are collections of wireless mobile devices with restricted broadcast range and resources and communication is achieved by relaying data along appropriate routes that are dynamically discovered and maintained through collaboration between the nodes. MANET is a self configuring, dynamic, multi…
A Security Modeling Approach forWeb-Service-based Business Processes. Several reports indicate that the highest business priorities include: business improvement, security, and IT management. The importance of security and risk management is gaining that even government statements in some cases have imposed the inclusion of security and risk management within business management. Risk assessment has become an…
A Segmentation and Graph-based Sequence Matching Method for Video Copy Detection Abstract? We propose in this paper a segmentation and graph-based video sequence matching method for video copy detection. Specifically, due to the good stability and discriminative ability of local features, we use SIFT descriptor for video content description. However, matching based on SIFT descriptor…
A Set of Complexity Measures Designed for Applying Meta-Learning to Instance Selection Abstract? A Set of Complexity Measures Designed for Applying Meta-Learning to Instance Selection. Some authors have approached the instance selection problem from a meta-learning perspective. In their work, they try to ?nd relationships between the performance of some methods from this ?eld and…
A SIFT-based forensic method for copy-move attack detection and transformation recovery Abstract?One of the principal problems in image forensics is determining if a particular image is authentic or not. This can be a crucial task when images are used as basic evidence to influence judgment like, for example, in a court of law.< Final Year...
A Similarity Measure for Text Classification and Clustering Abstract?A Similarity Measure for Text Classification and Clustering. Measuring the similarity between documents is an important operation in the text processing field. In this paper, a new similarity measure is proposed. To compute the similarity between two documents with respect to a feature, < Final Year Projects...
A Similarity-Based Learning Algorithm Using Distance Transformation Abstract? Numerous theories and algorithms have been developed to solve vectorial data learning problems by searching for the hypothesis that best ?ts the observed training sample. However, many real-world applications involve samples that are not described as feature vectors, but as (dis)similarity data. Converting vectorial data into <...
A Single-Ended With Dynamic Feedback Control 8T Subthreshold SRAM Cell Abstract?A novel 8-transistor (8T) static random access memory cell with improved data stability in subthreshold operation is designed. The proposed single-ended with dynamic feedback control 8T static RAM (SRAM) cell enhances the static noise margin (SNM) for ultralow power supply. < final year projects >…
A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem Abstract?A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem. The multiple longest common subsequence (MLCS) problem, related to the identification of sequence similarity, is an important problem in many fields. As an NP-hard problem, its exact algorithms have difficulty in handling large-scale…