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

Checking delivery availability...

background-sm
Search
3

Updates found with 'article'

Page  1 1

Updates found with 'article'

JAVA/DOT NET PROJECTS ABSTRACT 2016-2107 TRUST AGENT-BASED BEHAVIOR INDUCTION IN SOCIAL NETWORKS ABSTRACT: The essence of social networks is that they can influence people's public opinions and group behaviors form quickly. Negative group behavior influences societal stability significantly, but existing behavior-induction approaches are too simple and inefficient. To automatically and efficiently induct behavior in social networks, this article introduces trust agents and designs their features according to group behavior features. In addition, a dynamics control mechanism can be generated to coordinate participant behaviors in social networks to avoid a specific restricted negative group behavior. This article investigates the importance of the endogenous selection of partners for trust and cooperation in market exchange situations, where there is information asymmetry between investors and trustees. We created an experimental-data driven agent-based model where the endogenous link between interaction outcome and social structure formation was examined starting from heterogeneous agent behaviour. By testing various social structure configurations, we showed that dynamic networks lead to more cooperation when agents can create more links and reduce exploitation opportunities by free riders. Furthermore, we found that the endogenous network formation was more important for cooperation than the type of network. Our results cast serious doubt about the static view of network structures on cooperation and can provide new insights into market efficiency.EXISTING SYSTEMS Online behavioral analysis and modeling has aroused considerable interest from closely related research fields such as data mining, machine learning, and information retrieval. This special issue provides a forum for researchers in behavior analysis to review pressing needs, discuss challenging research issues, and showcase state-of-the-art research and development in modern Web platforms. Research on network group behavior tendency generally can be divided into two areas: negative tendencies and hot-issue tendencies. For a negative tendency in group behavior, Yiting Zhang explained why violent behavior exists on the Internet and proposed countermeasure research to avoid it.PROPOSED SYSTEMS In Proposed systems by focusing on short texts published on social networks, one group of researchers proposed a biterm topic model that learns behavior topics by directly modeling the generation of word co-occurrence patterns (that is, biterms) in the corpus. The core problem of behavior induction in this article is as follows: with some restricted behaviors predetermined, how to induct participants in social networks to avoid these behaviors? There are all kinds of interaction relations between participants in social networks, but the most important one is trust. Abstractly, trust is the measure taken by one party about the willingness and ability of another party to act in the interest of the former party in a certain situation. However, there’s still no research on trust related to behavior induction in social networks—in particular, how to design features that make trust agents trusted by participants, maximize the effect of participant behaviors, and enhance the effectiveness of behavior induction.System Configuration:H/W System Configuration: Processor - Pentium –IIISpeed - 1.1 GhzRAM - 256 MB(min)Hard Disk - 20 GBFloppy Drive - 1.44 MBKey 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 : Mysql Database Connectivity : JDBC.CONCLUSION: Now that we’ve proposed and experimentally validated our trust agent-based social behavior induction approach. In future work we’ll introduce Latent Dirichlet Allocation to abstract the behavior features of users in social networks, such as Twitter. We can construct links in behavior feature-driven social networks using the Pearson similarity of users’ behavior features.The explicit formulation of trust, reputation, and related quantities suggests a straightforward implementation of the model in a multi-agent environment.
Send Enquiry
Read More
JAVA /DOT NET PROJECTS ABSTRACT 2016-2017 IDENTITY-BASED ENCRYPTION WITH CLOUD REVOCATION AUTHORITY AND ITS APPLICATIONS. ABSTRACT: Identity-based encryption (IBE) is a public key cryptosystem and eliminates the demands of public key infrastructure (PKI) and certificate administration in conventional public key settings. Due to the absence of PKI, the revocation problem is a critical issue in IBE settings. Several revocable IBE schemes have been proposed regarding this issue. Quite recently, by embedding an outsourcing computation technique into IBE, Li et al. proposed a revocable IBE scheme with a key-update cloud service provider (KU-CSP). However, their scheme has two shortcomings. One is that the computation and communication costs are higher than previous revocable IBE schemes. The other shortcoming is lack of scalability in the sense that the KU-CSP must keep a secret value for each user. In the article, we propose a new revocable IBE scheme with a cloud revocation authority (CRA) to solve the two shortcomings, namely, the performance is significantly improved and the CRA holds only a system secret for all the users. For security analysis, we demonstrate that the proposed scheme is semantically secure under the decisional bilinear Diffie-Hellman (DBDH) assumption. Finally, we extend the proposed revocable IBE scheme to present a CRA-aided authentication scheme with period-limited privileges for managing a large number of various cloud services.Existing System: Privacy is very important especially for users who are sensitive to information leakage. In our design of Friendbook, we also considered the privacy issue and the existing system can provide two levels of privacy protection. First, Friendbook protects users’ privacy at the data level. Instead of uploading raw data to the servers, Friendbook processes raw data and classifies them into activities in real-time. The recognized activities are labeled by integers. In this way, even if the documents containing the integers are compromised, they cannot tell the physical meaning of the documents. Second, Friendbook protects users’ privacy at the life pattern level. Instead of telling the similar life styles of users, Friendbook only shows the recommendation scores of the recommended friends with the users. With the recommendation score, it is almost impossible to infer the life styles of recommended friends..PROPOSED SYSTEM: With the metric in , our recommendation mechanism for finding the most appropriate friends to a query user is described as follows. For a query user i, the server calculates the recommendation scores for all the users in the system and sorts them in the descending order according to their recommendation scores. The top p users will be returned to the query user i. The parameter p is an integer and can be defined by the querying user. The complexity of our recommendation mechanism is O(n) since it checks all users in the system, where n is the overall number of users in the system. As the number of users increases the overhead of query and recommendation increases linearly. In reality, users may have totally different life styles and it is not necessary to calculate their recommendation scores at all. Therefore, in order to speed up the query and recommendation process, we adopt the reverse index table using pair in the database.shows the difference. Illustration of the reverse index table. reverse index table, before calculating recommendation score for each user, the server first picks up all the users having overlapping life styles with the query user and sets the similarities of rest users to the query user to 0. The server then checks all the users to calculate their recommendation scores. Although the complexity is still O(n), we can observe that the reverse index table reduces the computation overhead, the advantage of which is considerable when the system is in large-scale.SYSTEM SPECIFICATIONHardware 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 : ASP.Net with C#• Front-End : Visual Studio 2012 Professional.• Data Base : SQL Server 2008.Conclusion: In this article, we proposed a new revocable IBE scheme with a cloud revocation authority (CRA), in which the revocation procedure is performed by the CRA to alleviate the load of the PKG. This outsourcing computation technique with other authorities has been employed in Li et al.’s revocable IBE scheme with KU-CSP. However, their scheme requires higher computational and communicational costs than previously proposed IBE schemes. For the time key update procedure, the KU-CSP in Li et al.’s scheme must keep a secret value for each user so that it is lack of scalability. In our revocable IBE scheme with CRA, the CRA holds only a master time key to perform the time key update procedures for all the users without affecting security. As compared with Li et al.’s scheme, the performances of computation and communication are significantly improved. By experimental results and performance analysis, our scheme is well suited for mobile devices. For security analysis, we have demonstrated that our scheme is semantically secure against adaptive-ID attacks under the decisional bilinear Diffie-Hellman assumption. Finally, based on the proposed revocable IBE scheme with CRA, we constructed a CRA aided authentication scheme with period-limited privileges for managing a large number of various cloud services.
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
VLSI PROJECTS ABSTRACT 2016-2017 FULL-SWING LOCAL BITLINE SRAM ARCHITECTURE BASED ON THE 22-NM FINFET TECHNOLOGY FOR LOW-VOLTAGE OPERATION ABSTRACT: The previously proposed average-8T static random access memory (SRAM) has a competitive area and does not require a write-back scheme. In the case of an average-8T SRAM architecture, a full-swing local bitline (BL) that is connected to the gate of the read buffer can be achieved with a boosted wordline (WL) voltage. However, in the case of an average-8T SRAM based on an advanced technology, such as a 22-nm FinFET technology, where the variation in threshold voltage is large, the boosted WL voltage cannot be used, because it degrades the read stability of the SRAM. Thus, a full-swing local BL cannot be achieved, and the gate of the read buffer cannot be driven by the full supply voltage (VDD), resulting in a considerably large read delay. To overcome the above disadvantage, in this paper, a differential SRAM architecture with a full-swing local BL is proposed. In the proposed SRAM architecture, full swing of the local BL is ensured by the use of cross-coupled pMOSs, and the gate of the read buffer is driven by a full VDD, without the need for the boosted WL voltage. Various configurations of the proposed SRAM architecture, which stores multiple bits, are analyzed in terms of the minimum operating voltage and area per bit. The proposed SRAM that stores four bits in one block can achieve a minimum voltage of 0.42 V and a read delay that is 62.6 times lesser than that of the average-8T SRAM based on the 22-nm FinFET technology. The proposed architecture of this paper area and power consumption analysis using HSpice. EXISTING SYSTEM: Several SRAM cell alternatives with a decoupled read port have been proposed for a low-voltage operation. The advantage of adding a decoupled read port is that it eliminates the tradeoff between the read stability and the write ability in the SRAM array to which the bit-interleaving is not applied; thus, the read stability and write ability can be optimized separately, facilitating a low-voltage operation. An SRAM cell is also susceptible to soft errors induced by α-particles; to address these errors, it is necessary for the SRAM array to exhibit bit-interleaving. Fig. 1 shows a bit-interleaved SRAM array architecture. In a bit-interleaved SRAM array, the selected cells are the SRAM cells targeted for the read or write operation. The row half-selected cells are the SRAM cells located on the selected row and the unselected column, whereas the column half-selected cells are the SRAM cells located on the unselected row and the selected column. During the write operation, the row half-selected cells are disturbed because of the selection of the wordline (WL) of the row half-selected cells. Thus, the stability of the row half-selected cells should also be considered in the SRAM design.PROPOSED SYSTEM: The proposed differential SRAM stores multiple bits in one block, as in the case of an average-8T SRAM. Fig. 3 shows the architecture of the proposed SRAM that stores i bits in one block. The minimum operating voltage and area per bit of the proposed SRAM depend on the number of bits in one block.ADVANTAGES:• not require a write-back scheme for bit-interleaving• exhibits a competitive area DISADVANTAGES• High area • Operating voltage is high SOFTWARE IMPLEMENTATION:• HSpice
Send Enquiry
Read More
DOT NET PROJECTS ABSTRACT 2016-2017 A DATA AND TASK CO-SCHEDULING ALGORITHM FOR SCIENTIFIC CLOUD WORKFLOWS ABSTRACT: Cloud computing has emerged as a promising computational infrastructure for cost-efficient workflow execution by provisioning on-demand resources in a pay-as-you-go manner. While scientific workflows require accessing community-wide resources, they usually need to be performed in collaborative cloud environments composed of multiple datacenters. Although such environments facilitate scientific collaboration, the movements of input and intermediate datasets across geographically distributed data centers may cause intolerable latency that would hinder efficient execution of large-scale data-intensive scientific workflows. To address the problem, in this article we propose a novel multi-level K-cut graph partitioning algorithm to minimize the volume of data transfer across data centers while satisfying load balancing and fixed data constraints. The algorithm first contracts the fixed input datasets in the same data center and their consuming tasks, and coarsens the contracted graph to a predefined scale in a level-by-level manner. Then, aK-cut algorithm is used to partition the resulted graph into K parts such that the cut size is minimized. After that, the partitioned graphis projected back to the original workflow graph, during which the load balancing constraint is maintained. We evaluate our algorithm using three real-world workflow applications and the results demonstrate that the proposed algorithm outperforms other state-of-the-art algorithms.
Send Enquiry
Read More
Page 1 1