Color Coded Cryptography Abstract? Color Coded Cryptography. Data encryption technique converts data into a unreadable format so as to protect the information from external intrusion. It is thus useful in ensuring the privacy and security of the < Final Year Projects 2016 > information transferred or shared between the systems. Text compression algorithms can be…
Colour Image Segmentation Approach for Detection of Malaria Parasites Using Various Colour Models and k-Means Clustering Abstract?Recent progress based on microscopic imaging has given significant contribution in diagnosis of malaria infection based on blood images. Due to the requirement of prompt and accurate diagnosis of malaria, the current study has proposed an unsupervised colour…
Combination of classification and regression in decision tree for multi-labeling image annotation and retrieval Abstract? Combination of classification and regression in decision tree for multi-labeling image annotation and retrieval. Video View Demo [numbers_sections number=”1″ title=”Including =Packages=” last=”no” ] Complete Source Code Complete Documentation Complete Presentation Slides Flow Diagram Database File Screenshots Execution Procedure Readme File…
Combining Left and Right Palmprint Images for More Accurate Personal Identification Abstract?Combining Left and Right Palmprint Images for More Accurate Personal Identification. Multibiometrics can provide higher identification accuracy than single biometrics, so it is more suitable for some real-world personal identification applications that need high-standard security. Among various biometrics technologies, palmprint identification has received much…
CommTrust: Computing Multi-Dimensional Trustby Mining E-Commerce Feedback Comments Abstract?CommTrust: Computing Multi-Dimensional Trustby Mining E-Commerce Feedback Comments. Reputation-based trust models are widely used in e-commerce applications, and feedback ratings are aggregated to compute sellers’ reputation trust scores. The ?all good reputation? problem, however, is prevalent in current reputation systems-reputation scores are universally high for sellers and…
Community-Aware Opportunistic Routing in Mobile Social Networks Abstract?Mobile social networks (MSNs) are a kind of delay tolerant network that consists of lots of mobile nodes with social characteristics. Recently, many social-aware algorithms have been proposed to address routing problems in MSNs. However, these algorithms tend to forward messages to the nodes with locally optimal social…
Community-Based User Domain Model Collaborative Recommendation Algorithm. Abstract?Collaborative Filtering (CF) is a commonly used technique in recommendation systems. It can promote items of interest to a target user from a large selection of available items. It is divided into two broad classes: memory-based algorithms and model-based algorithms. The latter requires some time to build…
Compact Conformal Map for Greedy Routing in Wireless Mobile Sensor Networks Abstract?Motivated by mobile sensor networks as in participatory sensing applications, we are interested in developing a practical, lightweight solution for routing in a mobile network. While greedy routing is robust to mobility, location errors and link dynamics, it may get stuck in a local…
Compact DFA : Scalable Pattern Matchning Using Longest Prefix Match Solutions Abstract?Compact DFA : Scalable Pattern Matchning Using Longest Prefix Match Solutions. A central component in all contemporary intrusion detection systems (IDSs) is their pattern matching algorithms, which are often based on constructing and traversing a deterministic finite automaton (DFA) that represents the patterns. While…
Compact MIMO Antenna for Portable UWB Applications With Band-Notched Characteristic Abstract? A multiple-input-multiple-output (MIMO) band notched antenna with a compact size of only 22 ? 36 mm is proposed for portable ultra wideband < Final Year Projects 2016 > UWB applications. The antenna consists of two square monopole-antenna elements, a T-shaped ground stub, a vertical…
CompactDFA: Scalable Pattern Matching Using Longest Prefix Match Solutions Abstract? CompactDFA: Scalable Pattern Matching Using Longest Prefix Match Solutions. A central component in all contemporary intrusion detection systems (IDSs) is their pattern matching algorithms, which are often based on constructing and traversing a deterministic finite automaton (DFA) that represents the patterns. While this approach ensures…