Analysis of Virus Algorithms (Report) Analysis of Virus Algorithms (Report)

Analysis of Virus Algorithms (Report‪)‬

Journal of Computer Science 2006, Oct, 2, 10

    • $5.99
    • $5.99

Publisher Description

Abstract: Security of wired and wireless networks is the most challengeable in today's computer world. The aim of this study was to give brief introduction about viruses and worms, their creators and characteristics of algorithms used by viruses. Here wired and wireless network viruses are elaborated. Also viruses are compared with human immune system. On the basis of this comparison four guidelines are given to detect viruses so that more secure systems are made. While concluding this study it is found that the security is most challengeable, thus it is required to make more secure models which automatically detect viruses and prevent the system from its affect. Key words: TSR, viruses, worms, malware

GENRE
Computers & Internet
RELEASED
2006
October 1
LANGUAGE
EN
English
LENGTH
13
Pages
PUBLISHER
Science Publications
SELLER
The Gale Group, Inc., a Delaware corporation and an affiliate of Cengage Learning, Inc.
SIZE
153.9
KB
A Fast Approximate String Searching Algorithm. A Fast Approximate String Searching Algorithm.
2005
Management Information Systems Role in Decision-Making During Crises: Case Study (Report) Management Information Systems Role in Decision-Making During Crises: Case Study (Report)
2010
A Study of the Contracting and Procurement Process for COTS Software Projects (Commercial Off-The-Shelf) A Study of the Contracting and Procurement Process for COTS Software Projects (Commercial Off-The-Shelf)
2007
Fast Algorithms for Outlier Detection. Fast Algorithms for Outlier Detection.
2008
The Cyber Space and Information, Communication and Technology: A Tool for Westernization Or Orientalism Or both (Report) The Cyber Space and Information, Communication and Technology: A Tool for Westernization Or Orientalism Or both (Report)
2011
An Exact Algorithm for the Unbounded Knapsack Problem with Minimizing Maximum Processing Time. An Exact Algorithm for the Unbounded Knapsack Problem with Minimizing Maximum Processing Time.
2007