International Journal of Science Engineering and Advance Technology (IJSEAT)
Not a member yet
    1075 research outputs found

    A Novel Approach To Recognize Malicious Application In Face Book- FRAppE

    Get PDF
    Our key commitment is in creating FRAppEseemingly the main apparatus concentrated on recognizing malicious applications on Facebook. To create FRAppE, we utilize data gathered by watching the posting conduct of 111K Facebook applications seen crosswise over 2.2 million clients on Facebook. In the first place, we recognize an arrangement of elements that help us recognize pernicious applications from considerate ones. For instance, we locate that malicious applications frequently share names with different applications, and they ordinarily ask for less consents than benign applications. Second, utilizing these recognizing highlights, we demonstrate that FRAppE can identify pernicious applications with 99.5% precision, with no false positives and a high genuine positive rate (95.9%). At long last, we investigate the biological system of pernicious Facebook applications and recognize instruments that these applications use to spread. Curiously, we locate that numerous applications connive and bolster each other; in our dataset, we find 1584 applications empowering the viral proliferation of 3723 different applications through their posts

    Anomaly Detection on Firewall Logs from Multifold System Based on Email Classification

    Get PDF
    Most of the existing systems categorize the document or firewall logs-corpus based on the term similarity by find the document-term relationship. It cannot identify the conceptual similarity or correlation among them. But proposed system focuses on both term wise as well as conceptual wise similarity to find the firewall logs statistics to tag the firewall logs with suitable type. Categorization of firewall logs data is multi fold in proposed system. Major stages of proposed approach are described in the following section. Classification of the emails based on their conceptual similarity rather than blind term wise similarity along with firewall logs header, html content and attachment analysis.

    Enhanced Overlay routing With Efficient Key Distribution in Network

    Get PDF
    We demonstrate the issue of secure routing utilizing weighted coordinated graphs and propose a boolean linear programming (LP) issue to locate the ideal way. Though the way that the answers for boolean LP issues are of considerably higher complexities, we propose a technique for tackling our issue in polynomial time. So as to assess its execution and safety efforts, we apply our proposed calculation to various as of late proposed symmetric and unbalanced key pre-dissemination strategies. The outcomes demonstrate that our proposed algorithm offers extraordinary system execution changes and in addition security upgrades while augmenting benchmark procedures

    Detailed Analysis On Security And Performance Of Anonycontrol and Anonycontrol-F

    Get PDF
    Computing resources are make available enthusiastically via Internet and the data storage and computation are outsourced to somebody or some party in a ‘cloud. It very much pull towards you attention and interest from both academic world and industry due to the profitability. Methods are able to look after user’s space to you against each single authority. Ingredient information is disclosed in AnonyControl and no information is disclosed in AnonyControl-F. We make available detailed analysis on security and performance to show probability of the scheme AnonyControl and Anony Control-F

    A Modified Gradient Boosting Trees Methods To Transform Social Networking Features Into Embeddings

    Get PDF
    We propose a novel answer for cross-webpage cool start item suggestion, which expects to prescribe items from online business sites to clients at long range informal communication destinations in "frosty begin" circumstances, an issue which has once in a while been investigated some time recently. A noteworthy test is the manner by which to use information separated from long range interpersonal communication destinations for cross-site icy begin item suggestion. We propose to utilize the connected clients crosswise over interpersonal interaction destinations and online business sites (clients who have long range interpersonal communication accounts and have made buys on internet business sites) as an extension to guide clients' informal communication elements to another element portrayal for item suggestion. In particular, we propose learning both clients' and items' element portrayals (called client embeddings and item embeddings, individually) from information gathered from online business sites utilizing repetitive neural systems and afterward apply a changed angle boosting trees technique to change clients' person to person communication highlights into client embeddings. We then build up a component based lattice factorization approach which can use the learnt client embeddings for frosty begin item suggestion

    Bilinear Pairings Technique on Concrete ID-PUIC Protocol

    Get PDF
    We propose a novel intermediary arranged information transferring and remote information uprightness checking model in identity-based public key cryptography: IDPUIC (identity-based proxy-oriented data uploading and remote data integrity checking in public cloud). We give the formal definition, framework model and security display. At that point, a solid ID-PUIC protocol is planned by utilizing the bilinear pairings. The proposed ID-PUIC protocol is provably secure in view of the hardness of CDH (computational Diffie-Hellman) issue. Our ID-PUIC protocol is additionally productive and adaptable. In view of the first customer's approval, the proposed ID-PUIC protocol can understand private remote information uprightness checking, appointed remote information integrity checking and open remote information integrity checkin

    To Improve The Security Of OLSR Routing Protocol Based On Local Detection Of Link Spoofing

    Get PDF
    We survey a particular DOS attack called node separation attack and propose another moderation technique. Our answer called Denial Contradictions with Fictitious Node Mechanism (DCFM) depends on the interior information gained by every node amid routine directing, and growth of virtual (imaginary) nodes. Additionally, DCFM uses similar methods utilized by the attack so as to avert it. The overhead of the extra virtual nodes decreases as system size builds, which is steady with general claim that OLSR capacities best on huge systems. The proposed insurance avoids more than 95 percent of attacks, and the overhead required definitely diminishes as the system measure increments until it is non-discernable

    Enabling the Fusion Of Local Sensitivity And Low Rank Factorization To Mitigate The Risk Of Over Fitting

    Get PDF
    We propose a novel locality sensitive low-rank model for picture label finishing, which approximates the worldwide nonlinear model with a gathering of neighbourhood direct models. To viably imbue the possibility of territory sensitivity, a simple and compelling pre-handling module is intended to learn appropriate portrayal for information parcel, and a worldwide accord regularizer is acquainted with alleviate the danger of over fitting. In the interim, low-rank framework factorization is utilized as nearby models, where the local geometry structures are saved for the low-dimensional portrayal of both labels and tests. Broad experimental assessments led on three datasets exhibit the viability and proficiency of the proposed strategy, where our technique outflanks past ones by a vast edge

    Micro-blogging attributes to Latent Feature Representation for Product Recommendations

    Get PDF
    We suggest to use the linked users through social networking sites and e-commerce websites as a link to map users’ social networking structures to added feature demonstration for product recommendation. In detailed, we suggest wisdom both users’ and products’ feature illustrations (called user embeddings and product embeddings, individually) from data collected from e-commerce websites using repeated neural networks and then apply a improved gradient boosting trees technique to change users’ social networking structures into user embeddings. We then improve a feature-based matrix factorization method which can leverage the learnt user embeddings for cold-start product recommendation

    Low Complex And Reconfigurable Fir Filter Using Low Power Architecture

    Get PDF
    Coefficient multipliers are the hindrances exhibit in programmable finite impulse response (FIR) advanced channels. As the channel coefficients change either powerfully or occasionally, the scan for basic sub articulations for multiplier less execution should be performed over the whole extent of numbers of the coveted exactness, and the measure of movements related with each recognized basic sub articulation should be retained. The multifaceted nature of a quality inquiry is in this manner past the current outline calculations in light of ordinary double and marked digit portrayals. Another plan worldview for the programmable FIR channels by misusing the expanded twofold base number framework (EDBNS). Because of its sparsity and intrinsic reflection of the whole of parallel moved fractional items, the sharing of adders in the time-multiplexed various consistent increase pieces of the programmable FIR channels can be boosted by an immediate mapping from the semi least EDBNS. The multiplexing cost can be further reduced by merging double base terms. In this, power is reduced by using modified booth encoding algorithm. Partial products generation stage is optimized by using Radix8 modified booth encoding algorithm

    1,006

    full texts

    1,075

    metadata records
    Updated in last 30 days.
    International Journal of Science Engineering and Advance Technology (IJSEAT)
    Access Repository Dashboard
    Do you manage Open Research Online? Become a CORE Member to access insider analytics, issue reports and manage access to outputs from your repository in the CORE Repository Dashboard! 👇