http://WWW.FINALYEARPROJECTS.NET
http://WWW.FINALYEARPROJECTS.NET

Checking delivery availability...

background-sm
Search
3

Updates found with 'natural images'

Page  1 1

Updates found with 'natural images'

JAVA/DOT NET PROJECTS ABSTRACT 2016-2107 TAG BASED IMAGE SEARCH BY SOCIAL RE-RANKING ABSTRACT: Social media sharing websites like Flickr allow users to annotate images with free tags, which significantly contribute to the development of the web image retrieval and organization. Tag-based image search is an important method to find images contributed by social users in such social websites. However, how to make the top ranked result relevant and with diversity is challenging. In this paper, we propose a social re-ranking system for tag-based image retrieval with the consideration of image’s relevance and diversity. We aim at re-ranking images according to their visual information, semantic information and social clues. The initial results include images contributed by different social users. Usually each user contributes several images. First we sort these images by inter-user re-ranking. Users that have higher contribution to the given query rank higher. Then we sequentially implement intra-user re-ranking on the ranked user’s image set, and only the most relevant image from each user’s image set is selected. These selected images compose the final retrieved results. We build an inverted index structure for the social image dataset to accelerate the searching process. Experimental results on Flickr dataset show that our social re-ranking method is effective and efficient.EXISITING SYSTEMS: Users cannot precisely describe their request with single words and tag suggestion system always recommend words that are highly correlated to the existing tag set, thus add little information to a users’ contribution. Besides, polysemy and synonyms are the other causes of the query ambiguity. the existing approaches highly rely on the visual and semantic information, and thus ignore the social clues such as user and view information. a fundamental problem in the re-ranking of the tag-based social image retrieval is how to reliably solve these problems.DISADVANTAGES: The re-ranking problem in the tag-based image retrieval has gained researchers’ wide attention. Nonetheless, the following challenges block the path for the development of re-ranking technologies in the tag-based image retrieval. Tag mismatch. Social tagging requires all the users in the social network to label their uploaded images with their own keywords and share with others. image annotation, there is no predefined ontology or taxonomy in social image tagging. Every user has his own habit to tag images.PROPOSED SYSTEMS: We take the views into consideration to learn the relevance score of each image on the basis, In order to achieve this, a new iterative algorithm to obtain the relevance score is proposed. this paper is more considerate. Discussions about weight selection and image features in the regularization framework are complemented. Through this discussion, we find that our performance doesn’t rely on the adjustment of parameters and feature selection. It’s robust and relatively stable. Besides, in order to find an optimal number of representative images which are selected from each user’s image set, many new comparison experiments and comprehensive discussions are added. proposed a tag ranking method to rank the tags of a given image, in which probability density estimation is used to get the initial relevance scores and a random walk is proposed to refine these scores over a tag similarity graph. proposed to learn the relevance of tags by visually weighted neighbor voting, a variant of the popular baseline neighbor voting algorithm.ADVANTAGES: `Tag-based image search is an important method to find images contributed by social users in such social websites. However, how to make the top ranked result relevant and with diversity is challenging. In this paper, we propose a social re-ranking system for tag-based image retrieval with the consideration of image’s relevance and diversity. We aim at re-ranking images according to their visual information, semantic information and social clues. The initial results include images contributed by different social users. Usually each user contributes several images.System Configuration:HARDWARE REQUIREMENTS: Hardware - Pentium Speed - 1.1 GHz RAM - 1GB Hard Disk - 20 GB Floppy Drive - 1.44 MB Key Board - Standard Windows Keyboard Mouse - Two or Three Button Mouse Monitor - SVGASOFTWARE REQUIREMENTS: Operating System : WindowsTechnology : Java and J2EEWeb Technologies : Html, JavaScript, CSSIDE : My EclipseWeb Server : TomcatTool kit : Android PhoneDatabase : My SQLJava Version : J2SDK1.5CONCLUSION: We propose a social re-ranking method for tag-based image retrieval. In this social re-ranking method, inter-user re-ranking and intra-user re-ranking are carried out to obtain the retrieved results. In order to enhance the diversity performance, user information is firstly introduced into our proposed approach and obtains satisfactory results. Besides, views of social image is also firstly fused into a traditional regularization framework to enhance the relevance performance of retrieved results. Discussions and experiments have demonstrated that our proposed method is effective and time-saving. However, in the inter-user ranking process only user’s contribution is considered and the similarity among users is ignored. In addition to this, many information in Flickr dataset are still ignored, such as title information, time stamp and so on. For future work, we will investigate the similarity among user groups in Flickr dataset. Therefore, we can fuse these relationships to enhance the diversity performance of image ranking system.
Send Enquiry
Read More
IEEE 2016 - 2017 Matlab Image Processing TitlesS.No Project Titles 1. Data-driven Soft Decoding of Compressed Images in Dual Transform-Pixel Domain 2. Double-Tip Arte fact Removal from Atomic Force Microscopy Images 3. Quaternion Collaborative and Sparse Representation With Application to Color Face Recognition 4. Multi-Level Canonical Correlation Analysis for Standard-Dose PET Image Estimation 5. Weakly Supervised Fine-Grained Categorization with Part-Based Image Representation 6. Robust Visual Tracking via Convolutional Networks without Training 7. Context-based prediction filtering of impulse noise images 8. Predicting the Forest Fire Using Image Processing 9. A Review Paper on detection of Glaucoma using Retinal Fundus Images 10. Performance Analysis of Filters on Complex Images for Text Extraction through Binarization 11. Automated Malaria Detection from Blood Samples Using Image Processing 12. Learning Invariant Color Features for Person Re-Identification 13. A Diffusion and Clustering-based Approach for Finding Coherent Motions and Understanding Crowd Scenes 14. Automatic Design of Color Filter Arrays in The Frequency Domain 15. Learning Iteration-wise Generalized Shrinkage-Thresholding Operators for Blind Deconvolution 16. Image Segmentation Using Parametric Contours With Free Endpoints 17. CASAIR: Content and Shape-Aware Image Retargeting and Its Applications 18. Texture classification using Dense Micro-block Difference 19. Statistical performance analysis of a fast super-resolution technique using noisy translations 20. Trees Leaves Extraction In Natural Images Based On Image segmentation and generating Its plant details
Send Enquiry
Read More
JAVA PROJECTS ABSTRACT 2016-2017 A LOCALITY SENSITIVE LOW-RANK MODEL FOR IMAGE TAG COMPLETION ABSTRACT: Tag-based image retrieval often used to increase performance to retrieving images with the help of search engines. Image retrieval based on user-provided image tags on the photo sharing websites. A requirement for effective searching and retrieval of images in rapid growing online image databases is that each image has accurate and useful annotation. Many visual applications have benefited from the outburst of web images, yet the imprecise and incomplete tags arbitrarily provided by users. In this paper, we propose a novel locality sensitive low-rank model for image tag completion, which approximates the global nonlinear model with a collection of local linear models. To effectively infuse the idea of locality sensitivity, a simple and effective pre-processing module is designed to learn suitable representation for data partition.In thi paper they used for BIRCH algorithm. BIRCH (balanced iterative reducing and clustering using hierarchies) is an unsupervised data mining algorithm used to perform hierarchical clustering over particularly large data-sets.An advantage of BIRCH is its ability to incrementally and dynamically cluster incoming, multi-dimensional metric data points in an attempt to produce the best quality clustering for a given set of resources (memory and time constraints). In most cases, BIRCH only requires a single scan of the database.Existing SystemThe user-labeled visual data, such as images which are uploaded and shared in Flickr, are usually associated with imprecise and incomplete tags. This will pose threats to the retrieval or indexing of these images, causing them difficult to be accessed by users. Unfortunately, missing label is inevitable in the manual labeling phase, since it is infeasible for users to label every related word and avoid all possible confusions, due to the existence of synonyms and user preference. Therefore, image tag completion or refinement has emerged as a hot issue in the multimedia community.Many visual applications have benefited from the outburst of web images, yet the imprecise and incomplete tags arbitrarily provided by users, as the thorn of the rose, may hamper the performance of retrieval or indexing systems relying on such data.Proposed SystemTo effectively infuse the idea of locality sensitivity, a simple and effective pre-processing module is designed to learn suitable representation for data partition, and a global consensus regularizer is introduced to mitigate the risk of overfitting. Meanwhile, low-rank matrix factorization is employed as local models, where the local geometry structures are preserved for the low-dimensional representation of both tags and samples. Extensive empirical evaluations conducted on three datasets demonstrate the effectiveness and efficiency of the proposed method, where our method outperforms pervious ones by a large margin.Advantages• We propose a locality sensitive low-rank model for image tag completion, which approximates the global nonlinear model with a collection of local linear models, by which complex correlation structures can be captured. • Several adaptations are introduced to enable the fusion of locality sensitivity and low-rank factorization, including a simple and effective pre-processing module and a global consensus regularizer to mitigate the risk of overfitting.Disadvantages• image tag completion or refinement has emerged as a hot issue in the multimedia community.• The existing completion methods are usually founded on linear assumptions, hence the obtained models are limited due to their incapability to capture complex correlation patterns.System RequirementsH/W System Configuration:-Processor - Pentium –IIISpeed - 1.1 GhzRAM - 256 MB(min)Hard Disk - 20 GBKey Board - Standard Windows KeyboardMouse - Two or Three Button MouseMonitor - SVGA S/W System Configuration Operating System :Windows95/98/2000/XP  Application Server : Tomcat5.0/6.X  Front End : HTML, Java, Jsp Scripts : JavaScript. Server side Script : Java Server Pages. Database Connectivity : Mysql.Conclusion In this paper we propose a locality sensitive low-rank model for image tag completion. The proposed method can capture complex correlations by approximating a nonlinear model with a collection of local linear models. To effectively integrate locality sensitivity and low-rank factorization, several adaptations are introduced, including the design of a pre-processing module and a global consensus regularizer. Our method achieves superior results on three datasets and outperforms pervious methods by a large margin.
Send Enquiry
Read More
JAVA PROJECTS ABSTRACT 2016-2017PASSBYOP: BRING YOUR OWN PICTURE FOR SECURING GRAPHICAL PASSWORDSABSTRACT: PassBYOP is a new graphical password scheme for public terminals that replaces the static digital images typically used in graphical password systems with personalized physical tokens, herein in the form of digital pictures displayed on a physical user-owned device such as a mobile phone. Users present these images to a system camera and then enter their password as a sequence of selections on live video of the token. Highly distinctive optical features are extracted from these selections and used as the password. We present three feasibility studies of PassBYOP examining its reliability, usability, and security against observation. The reliability study shows that image-feature based passwords are viable and suggests appropriate system thresholds—password items should contain a minimum of seven features, 40% of which must geometrically match originals stored on an authentication server in order to be judged equivalent. The usability study measures taskcompletion times and error rates, revealing these to be 7.5 s and 9%, broadly comparable with prior graphical password systems that use static digital images. Finally, the security study highlights PassBYOP’s resistance to observation attack—three attackers are unable to compromise a password using shoulder surfing, camera based observation, or malware. These results indicate that Pass- BYOP shows promise for security while maintaining the usability of current graphical password schemes.Existing System:TEXTUAL passwords have been the most widely used authentication method for decades. Comprised of number sand upper- and lower-case letters, textual passwords are considered strong enough to resist against brute force attacks. However, a strong textual password is hard to memorize and recollect. Therefore, users tend to choose passwords that are either short or from the dictionary, rather than random alphanumeric strings.. Proposed System: Various graphical password authentication schemes were developed to address the problems and weaknesses associated with textual passwords. Based on some studies such as those in , humans have a better ability to memorize images with long-term memory(LTM) than verbal representations. Image-based passwords were proved to be easier to recollect in several user studies As a result, users can set up a complex authentication password and are capable of recollecting it after a long time even if the memory is not activated periodically. ConclusionWith the increasing trend of web services and apps, users are able to access these applications anytime and anywhere with various devices. In order to protect users’ digital property, authentication is required every time they try to access their personal account and data. However, conducting theauthentication process in public might result in potential shoulder surfing attacks. Even a complicated password can be cracked easily through shoulder surfing. Using traditional textual passwords or PIN method, users need totype their passwords to authenticate themselves and thus these passwords can be revealed easily if someone peeks over shoulder or uses video recording devices such as cell phones.
Send Enquiry
Read More
JAVA PROJECTS ABSTRACT 2016-2017 A SHOULDER SURFING RESISTANT GRAPHICAL AUTHENTICATION SYSTEM ABSTRACT:Abstract :Authentication based on passwords is used largely in applications for computer security and privacy. However, human actions such as choosing bad passwords and inputting passwords in an insecure way are regarded as ”the weakest link” in the authentication chain. Rather than arbitrary alphanumeric strings, users tend to choose passwords either short or meaningful for easy memorization. With web applications and mobile apps piling up, people can access these applications anytime and anywhere with various devices. This evolution brings great convenience but also increases the probability of exposing passwords to shoulder surfing attacks. Attackers can observe directly or use external recording devices to collect users’ credentials. To overcome this problem, we proposed a novel authentication system PassMatrix, based on graphical passwords to resist shoulder surfing attacks. With a one-time valid login indicator and circulative horizontal and vertical bars covering the entire scope of pass-images, PassMatrix offers no hint for attackers to figure out or narrow down the password even they conduct multiple camera-based attacks. We also implemented a PassMatrix prototype on Android and carried out real user experiments to evaluate its memorability and usability. From the experimental result, the proposed system achieves better resistance to shoulder surfing attacks while maintaining usability. Existing Systems: In order to be more secure than the existing Android pattern password with entropy 18:57 bits against brute force attacks, users have to set two pass-images and use the graphical method to obtain the one-time login indicators. Like most of other graphical password authentication systems, PassMatrix is vulnerable to random guess attacks based on hot-spot analyzing. TEXTUAL passwords have been the most widely used authentication method for decades. Comprised of numbers and upper- and lower-case letters, textual passwords are considered strong enough to resist against brute force attacks. According to an article in Computer world, a security team at a large company ran a network password cracker and surprisingly cracked approximately 80% of the employees’ passwords within 30 seconds [3]. Textual passwords are often insecure due to the difficulty of maintaining strong ones.Proposed Systems: This evolution brings great convenience but also increases the probability of exposing passwords to shoulder surfing attacks. Attackers can observe directly or use external recording devices to collect users’ credentials. To overcome this problem, we proposed a novel authentication system PassMatrix, based on graphical passwords to resist shoulder surfing attacks. With a one-time valid login indicator and circulative horizontal and vertical bars covering the entire scope of pass-images, PassMatrix offers no hint for attackers to figure out or narrow down the password even they conduct multiple camera-based attacks. a lot of research on password authentication has been done in the literature. Among all of these proposed schemes, this paper focuses mainly on the graphical-based authentication systems. To keep this paper concise, we will give a brief review of the most related schemes that were mentioned in the previous section. The accuracy perspective focuses on the successful login rates in both sessions, including the practice logins. The usability perspective is measured by the amount of time users spent in each PassMatrix phase.Advantage:Two techniques are proposed to generate session passwords using text and colors which are resistant to shoulder surfing. The habitual movements and the preference of users that the attacker may take advantage of to figure out the potential passwords. 1) Any communication between the client device and the server is protected by SSL so that packets or information will not be eavesdropped or intercepted by attackers during transmission. 2) The server and the client devices in our authentication system are trustworthy. 3) The keyboard and the entire screen of mobile devices are difficult to protect, but a small area (around 1:5 cm2) is easy to be protected from malicious people who might shoulder surf passwords. 4) Users are able to register an account in a place that is safe from observers with bad intention or surveillance cameras that are not under proper management.SOFTWARE REQUIREMENTS: Operating System : Windows Technology : Java and J2EE Web Technologies : Html, JavaScript, CSS IDE : My Eclipse Web Server : Tomcat Network : LAN Database : My SQL Java Version : J2SDK1.5 HARDWARE REQUIREMENTS: Hardware : Pentium Speed : 1.1 GHz RAM : 1GB Hard Disk : 20 GB Floppy Drive : 1.44 MB Key Board : Standard Windows Keyboard Mouse : Two or Three Button Mouse Monitor : SVGAConclusion:With the increasing trend of web services and apps, users are able to access these applications anytime and anywhere with various devices. In order to protect users’ digital property, authentication is required every time they try to access their personal account and data. However, conducting theauthentication process in public might result in potential shoulder surfing attacks. Even a complicated password can be cracked easily through shoulder surfing. Using traditional textual passwords or PIN method, users need totype their passwords to authenticate themselves and thus these passwords can be revealed easily if someone peeks over shoulder or uses video recording devices such as cell phones.
Send Enquiry
Read More
JAVA PROJECTS ABSTRACT 2016-2017: AN EXPLORATION OF GEOGRAPHIC AUTHENTICATION SCHEMES ABSTRACT: We design and explore the usability and security of two geographic authentication schemes: GeoPass and GeoPass- Notes. GeoPass requires users to choose a place on a digital map to authenticate with (a location password). GeoPassNotes—an extension of GeoPass—requires users to annotate their location password with a sequence of words that they can associate with the location (an annotated location password). In GeoPassNotes, users are authenticated by correctly entering both a location and an annotation. We conducted user studies to test the usability and assess the security of location passwords and annotated location passwords. The results indicate that both variants are highly memorable, and that annotated location passwords may be more advantageous than location passwords alone due to their increased security and the minimal usability impact introduced by the annotation.EXISTING SYSTEM: Passwords have well-known problems relating to their memorability and vulnerability to being easily guessed by an adversary. The security problems with passwords appear to be even worse than previously believed. To ensure security requirements are met, unusable password policies are implemented that cause an increasing burden on users. When passwords are forgotten, many systems rely on secondary authentication such as challenge (or “personal knowledge”) questions for resetting his or her password. Unfortunately, such methods also appear to offer questionable security. These issues motivate new user authentication strategies that have improved memorability and security.PROPOSED SYSTEM: People generally have better memory for images over words this has motivated many graphical password schemes that involve users remembering images (or parts of images) instead of words. We hypothesize that location passwords should be highly memorable under an appropriate system design; after all, map locations are visual, and represent places (which may be more “concrete” and easier to remember). A challenge that we tackle is designing location password interfaces that are memorable and provide security against guessing attacks. Therefore, we aim to enhance the security of location passwords by asking users to choose a note they can associate with their chosen location; we call this combination of the location password and its note an annotated location password. Users are authenticated by correctly entering both a location and an annotation. In essence, an annotated location password is using the location component to cue a user’s memory for text information; however, both components (location and text) are used together for stronger authentication. GeoPassNotes is our implementation of an annotated location password system.ADVANTAGE: stronger authentication The addition of the annotation is simple but purposeful Increase resistance to both online and offline attacks Reduce time for searching the route between the locations. Gives accurate details about the current location. User friendly. Reduces paper works. Easy communication between user and the admin.SYSTEM SPECIFICATION:HARDWARE REQUIREMENTS: System : Pentium IV 2.4 GHz. Hard Disk : 40 GB. Floppy Drive : 1.44 Mb. Monitor : 14’ Colour Monitor. Mouse : Optical Mouse. Ram : 512 Mb.SOFTWARE REQUIREMENTS: Operating system : Windows 7 Ultimate. Coding Language : Java. Front-End : Eclipse. Data Base : SQLite Manger.CONCLUSION:Passwords have well-known problems relating to their memorability and vulnerability to being easily guessed by an adversary. Passwords are forgotten. To overcome this type of problems we are using location as password. Thus we can overcome password forgotten problem because people have better memory over place than the passwords. Stronger authentication. The addition of the annotation is simple but purposeful. Increase resistance to both online and offline attacks. Reduce time for searching the route between the locations. Gives accurate details about the current location. User friendly. Reduces paper works. Easy communication between user and the admin. Thus geo authentication is explained.
Send Enquiry
Read More
JAVA/ DOT NET PROJECT ABSTRACT 2016-2017 SECURE DATA SHARING IN CLOUD COMPUTING USING REVOCABLE-STORAGE IDENTITY-BASED ENCRYPTION ABSTRACT: Cloud computing provides a flexible and convenient way for data sharing, which brings various benefits for both the society and individuals. But there exists a natural resistance for users to directly outsource the shared data to the cloud server since the data often contain valuable information. Thus, it is necessary to place cryptographically enhanced access control on the shared data. Identity-based encryption is a promising cryptographical primitive to build a practical data sharing system. However, access control is not static. That is, when some user’s authorization is expired, there should be a mechanism that can remove him/her from the system. Consequently, the revoked user cannot access both the previously and subsequently shared data. To this end, we propose a notion called revocable-storage identity-based encryption (RS-IBE), which can provide the forward/backward security of ciphertext by introducing the functionalities of user revocation and ciphertext update simultaneously. Furthermore, we present a concrete construction of RS-IBE, and prove its security in the defined security model. The performance comparisons indicate that the proposed RS-IBE scheme has advantages in terms of functionality and efficiency, and thus is feasible for a practical and cost-effective data-sharing system. Finally, we provide implementation results of the proposed scheme to demonstrate its practicability.Existing Systems: Cloud computing provides a flexible and convenient way for data sharing, which brings various benefits for both the society and individuals. But there exists a natural resistance for users to directly outsource the shared data to the cloud server since the data often contain valuable information. Thus, it is necessary to place cryptographically enhanced access control on the shared data. Identity-based encryption is a promising cryptographical primitive to build a practical data sharing system. However, access control is not static. That is, when some user’s authorization is expired, there should be a mechanism that can remove him/her from the system.Disadvantages: Regardless of the setting of IBE or PKI, there must be an approach to revoke users from the system when necessary, e.g., the authority of some user is expired or the secret key of some user is disclosed. In the traditional PKI setting, the problem of revocation has been well studied and several techniques are widely approved, such as certificate revocation list or appending validity periods to certificates.Propossed Systems: we propose a notion called revocable-storage identity-based encryption (RS-IBE), which can provide the forward/backward security of ciphertext by introducing the functionalities of user revocation and ciphertext update simultaneously. Furthermore, we present a concrete construction of RS-IBE, and prove its security in the defined security model. The performance comparisons indicate that the proposed RS-IBE scheme has advantages in terms of functionality and efficiency, and thus is feasible for a practical and cost-effective data-sharing system. proposed an efficient RIBE scheme resistant to a realistic threat called decryption key exposure, whichmeans that the disclosure of decryption key for current time period has no effect on the security of decryption keys for other time periods. We present a concrete construction of RS-IBE. The proposed scheme can provide confidentiality and backward/forward2 secrecy simultaneously . We prove the security of the proposed scheme in the standard model, under the decisional ℓ-Bilinear Diffie-Hellman Exponent (ℓ-BDHE) assumption. In addition, the proposed scheme can withstand decryption key exposure.Advantages: The comparison results demonstrate that our scheme has advantages in terms of efficiency and functionality, and thus is more feasible for practical applications. The performance comparisons indicate that the proposed RS-IBE scheme has advantages in terms of functionality and efficiency, and thus is feasible for a practical and cost-effective data-sharing system. We say that the decisional ℓ-BDHE assumption holds in G1 provided that no PPT algorithm can solve the decisional ℓ-BDHE problem with a non-negligible advantage.
Send Enquiry
Read More
Mechanical Design Project Titles Mechanical Design project titles1. Design & analysis of connecting rod using aluminum silicon carbide 2. Design, animation & analysis of agricultural chipper 3. Design, animation & analysis of hybrid air engine 4. Design & analysis of support platform for small form factor pc in ruggedness testing environment 5. Analysis of noise reduction in rotor blade by using composite material 6. Modeling and analysis of screw engine 7. Stress analysis of washing machine drum 8. 3d thermal analysis of liquid propellant rocket with bell nozzle 9. Modeling & structural analysis of piston by using mg-sic 10. Modeling, analysis of tri axial tipper (different angle) 11. Design & analysis of poppet valve using composite 12. Failure analysis and optimization of planner machine horizontal mechanism 13. Design and analysis of industrial pneumatic trolley 14. Design and analysis of aluminum & copper connecting rod 15. Modeling & analysis of suspension steering system 16. Design and analysis of piston by composite materials 17. Design, animation & analysis of shredding, chipping and murching 18. Tribological analysis on disc brake pad 19. Dynamic balancing of rotor 20. Design & analysis of piston by using composite materials aluminum & magnesium 21. Modeling & analysis of motorized screw jack 22. Wear rate analysis of nano coated cutting tools 23. Design & analysis of composite leaf spring 24. Design & analysis of vacuum assisted wall climber 25. Design & analysis of splines elimination of starter motor shaft 26. Multipurpose agricultural machinery dynamic analysis for shaft 27. Modeling & analysis of leaf spring under dynamic load condition for tata sumo 28. Design & analysis of supercharging an engine using vehicle suspension 29. Analysis of failure mechanism of 90? Pipe elbow with in-plane and out-of plane loading 30. Analysis of cam shaft using composite material 31. Design and analysis of composite helical gear 32. Productivity improvement by automatic lifting 33. Modeling and structural analysis on flight wing by using ansys 34. Design and analysis of a hydraulic die ejector for a powder metallurgy component 35. Structural analysis of heavy vehicle chassis using honey comb structure 36. Study of wear behavior of aluminum based composite fabricated by stir casting technique 37. Design and stress analysis of four-post rollover protective structure of agricultural-wheeled tractor 38. Design and analysis of scissor jack 39. 3d modeling and analysis of micro gas turbine compressor blade 40. Design, animation & analysis of suspension steering system 41. Design & analysis of piston by using composite materials aluminum & magnesium 42. Design & analysis of stirling engine 43. Design and analysis of electromagnetic engine 44. Design and analysis of the windmill by the composite material 45. Design & analysis of hybrid magnetic bearing 46. Design & analysis of vacuum assisted wall climber 47. Redesign of bead extruder head assembly (analysis) 48. Design & analysis of screw engine 49. Design & analysis of composite gear wheel 50. Analysis of impeller using aluminum composite 51. Design & analysis of auto tilting mechanism in car 52. Design, modeling and analysis of a 3 stage epicyclic planetary reduction gear unit of a flight vehicle 53. Finite element analysis of normal and vented disc brake rotor 54. Design and analysis of rocker arm using composite material 55. Design and analysis of composite over bridge coupling 56. Modeling and analysis of drum brake 57. Analysis of adhesively bonded single lap riveted joint using ansys 58. Finite element analysis and natural frequency optimization of engine bracket 59. Analysis of helical coil compression spring for three wheeler automotive front suspension 60. Fatigue analysis of aluminum alloy wheel under radial load 61. Design and analysis of dumped body 62. Design and analysis of connecting rod using aluminum alloy 7068 t6, t6511 63. Finite element analysis and optimization of piston using cae tools 64. Design and analysis of three axis hydraulic modern trailer 65. Design and analysis of helical spring with shock absorber 66. Modeling and analysis of automobile chassis brackets 67. Design and analysis of disappearing car door 68. Design and analysis of wind car 69. Modeling and analysis of bicycle frame 70. Studies on friction stir welding aa2024 & aa6061 71. Stress analysis of mechanisms for trolley-cum-wheelchair 72. Stress analysis of seat backrest of car 73. Modeling and squeal analysis of brake disc rotor using ansys 74. Design and analysis of composite brake pedal: an ergonomic approach 75. Thermal analysis on composite materials 76. Modeling & analysis solar assisted air dryer 77. Analysis of electricity production mechanical system 78. Structural analysis of rivet joint 79. Design & analysis of special purpose lifting equipment 80. Finite element analysis of bus body structure 81. Static and vibration analyzing shock absorber power generation using piezo electric 82. Design & analysis of mechanical locking system for fuel flap 83. Design & analysis of coil spring with different materials 84. Analysis of frp composite cylinders 85. Modeling and analysis of a motorcycle wheel rim 86. Design and analysis of jet wind turbine blades 87. Comparative analysis of tractors trolley axle by using fea(by considering change in materials existing shape and size) 88. Design and analysis of electromagnetic suspension system 89. Design and analysis of crane hook assembly 90. Vibration analysis of leaf spring 91. Design and analysis of composite helical gear 92. Analysis of windmill blade by using composite material 93. Analysis of triangular air compressor with common combustion chamber 94. Transient analysis of disk brake by using ansys software 95. Impact analysis on front sub frame system using composite material 96. Design and analysis of automobile frame 97. Finite element analysis of the classic bicycle wheel 98. Design & analysis of quick lifting jack with gear arrangement 99. Study and analysis of aircraft fuselage body structure by using composite material
Send Enquiry
Read More
IEEE 2016 -2017 BIG DATA ANDROID DOTNET JAVA TITLESBIG DATA1. FiDoop: Parallel Mining of Frequent Itemsets Using MapReduce.ss2. Self-Healing in Mobile Networks with Big Data.ANDROID1. An Exploration of Geographic Authentication Schemes.2. Intelligent Hands Free Speech based SMS System on Android.3. PassBYOP: Bring Your Own Picture for Securing Graphical Passwords.4. Privacy-Preserving Location Sharing Services for Social Networks.5. SBVLC: Secure Barcode-based Visible Light Communication for Smartphones.6. A Shoulder Surfing Resistant Graphical Authentication System.7. A Cloud-Based Smart-Parking System Based on Internet-of-Things Technologies.8. STAMP: Enabling Privacy-Preserving Location Proofs for Mobile Users.9. Understanding Smartphone Sensor and App Data for Enhancing the Security of Secret Questions..NET1. Attribute-based Access Control with Constant-size Ciphertext in Cloud Computing.2. Attribute-Based Data Sharing Scheme Revisited in Cloud Computing3. Catch You if You Misbehave: Ranked Keyword Search Results Verification in Cloud Computing4. CDStore: Toward Reliable, Secure, and Cost-Efficient Cloud Storage via Convergent Dispersal5. Cloud workflow scheduling with deadlines and time slot availability6. Dynamic and Public Auditing with Fair Arbitration for Cloud Data7. Dynamic Proofs of Retrievability for Coded Cloud Storage Systems8. Enabling Cloud Storage Auditing with Verifiable Outsourcing of Key Updates9. Identity-Based Encryption with Cloud Revocation Authority and Its Applications10. Identity-Based Proxy-Oriented Data Uploading and Remote Data Integrity Checking in Public Cloud11. MMBcloud-tree: Authenticated Index for Verifiable Cloud Service Selection12. Prioritization of Overflow Tasks to Improve Performance of Mobile Cloud13. Providing User Security Guarantees in Public Infrastructure Clouds14. Publicly Verifiable Inner Product Evaluation over Outsourced Data Streams under Multiple Keys15. Reversible Data Hiding in Encrypted Images by Reversible Image Transformation16. Searchable Attribute-Based Mechanism with Efficient Data Sharing for Secure Cloud Storage17. Secure Data Sharing in Cloud Computing Using Revocable-Storage Identity-Based Encryption18. Service Usage Classification with Encrypted Internet Traffic in Mobile Messaging Apps19. Shadow Attacks based on Password Reuses: A Quantitative Empirical Analysis20. A Performance Evaluation of Machine Learning-Based Streaming Spam Tweets DetectionJAVA1. A Locality Sensitive Low-Rank Model for Image Tag Completion2. A Shoulder Surfing Resistant Graphical Authentication System3. DeyPoS: Deduplicatable Dynamic Proof of Storage for Multi-User Environments4. Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search5. KSF-OABE: Outsourced Attribute-Based Encryption with Keyword Search Function for Cloud Storage6. Mining User-Aware Rare Sequential Topic Patterns in Document Streams7. Mitigating Cross-Site Scripting Attacks with a Content Security Policy8. Practical Approximate k Nearest Neighbor Queries with Location and Query Privacy9. Quality-Aware Subgraph Matching Over Inconsistent Probabilistic Graph Databases10. SecRBAC: Secure data in the Clouds11. Tag Based Image Search by Social Re-rankingCLOUD COMPUTING1. Cost Minimization for Rule Caching in Software Defined Networking.2. Performance Enhancement of High-Availability Seamless Redundancy (HSR) Networks Using OpenFlow.3. Data Plane and Control Architectures for 5G Transport Networks.4. HBD: Towards Efficient Reactive Rule Dispatching in Software-Defined Networks.5. SDN-based Application Framework for Wireless Sensor and Actor Networks.6. Geo-Social Distance-based Data Dissemination for Socially Aware Networking.7. An Open-Source Wireless Mesh Networking Module for Environmental Monitoring.8. Hybrid IP/SDN networking: open implementation and experiment management tools.9. Software-Defined Networking (SDN) and Distributed Denial of Service (DDoS) Attacks in Cloud Computing Environments: A Survey, Some Research Issues, and Challenges.10. Cloud Computing-Based Forensic Analysis for Collaborative Network Security Management System.NETWORK SECUIRTY1. Collaborative Network Security in Multi-Tenant Data Center for Cloud Computing.DATA MINING1. Systematic Determination of Discrepancies Across Transient Stability Software Packages.2. Identification of Type 2 Diabetes Risk Factors Using Phenotypes Consisting of Anthropometry and Triglycerides based on Machine Learning.3. Teaching Network Security With IP Darkspace Data.4. A Survey of Data Mining and Machine Learning Methods for Cyber Security Intrusion Detection.5. Mining High Utility Patterns in One Phase without Generating Candidates.6. An Improved String-Searching Algorithm and Its Application in Component Security Testing.
Send Enquiry
Read More
Page 1 1