signature files
Recently Published Documents


TOTAL DOCUMENTS

54
(FIVE YEARS 0)

H-INDEX

12
(FIVE YEARS 0)

2020 ◽  
Vol 5 (3) ◽  
pp. 364
Author(s):  
Randi Rizal ◽  
Ruuhwan Ruuhwan ◽  
Septian Chandra

The number of crimes committed by utilizing advances in information technology such as information leakage, embezzlement of money in banks, credit card fraud, pornography, terrorism, drug trafficking and many more are definitely related to the name digital data. File signatures or magic numbers are one of the forensic science techniques that assist in processing this digital data. The method used in this research is the National Institute Standards Technology method to analyze the authenticity of digital data and the method of proof to obtain valid evidence during the identification process of data or file content. This research is presented in the form of an analysis of the use of signature files in investigations to determine the type of file in the case of leaking company information xyz, the research stage uses evidence handling procedures in the laboratory. Contributions made after conducting a series of case investigations using signature files have been successfully carried out using the Access Data FTK Imager application version 4.2.0 and WinHex version 18.6. Signature files can be used for case investigations in identifying and verifying file types so that files that have been modified can be restored and can be read by the operating system by checking file types through hexadecimal values in the header file (file prefix) that show the characteristics of each type file so that the file type can be found and the file can be read by the operating system.


2018 ◽  
pp. 3491-3495
Author(s):  
Mario A. Nascimento
Keyword(s):  

Author(s):  
Mario A. Nascimento
Keyword(s):  

2016 ◽  
Vol 6 (4) ◽  
pp. 16-29 ◽  
Author(s):  
Arun Kumar Yadav ◽  
Divakar Yadav ◽  
Rajesh Prasad

Searching on the web is one of the most progressive and expanding field nowadays. A large amount of information is available on the World Wide Web, motivating the need of efficient text indexing method that support fast text retrieval. In the past, two main indexing techniques: Signature files and Inverted files have been proposed. First require much larger space to store index and are more expensive to construct and update than inverted files. Second has been efficiently implemented using different structures like Sorted array and B-Tree. Sorted array was very expensive in updating the indices while appending a new keyword and B-tree method breaks down if there are many words with the same prefix. This paper presents a modified index structure for text retrieval that keeps a good result to optimize the space needed to store and time to search document. The proposed index is designed using the Wavelet Tree (WT), which was originally designed as wavelet transform for images. Experimental results show that on increasing the query length, the WT based index performs better than others.


2013 ◽  
Vol 18 ◽  
pp. 63-74
Author(s):  
Pedram Ghodsnia ◽  
Kamran Tirdad ◽  
J. Ian Munro ◽  
Alejandro López-Ortiz

Author(s):  
Anita L. Blanchard ◽  
Lisa Slattery Rashotte

In this chapter, the authors will elaborate a theoretical model for the development of group trust and the role that technology plays in that process. They first will articulate the particular nature of group trust, as opposed to individual trust or generalized trust. The authors then discuss the variables which affect group trust, such as sense of virtual community, entitativity, identity, and support. The authors will present a model that posits that technological features affect the commitment and attachment that lead to group trust. Technological features include group and personal identification cues (e.g., signature files, member activity). Future research directions utilizing this model are discussed.


2009 ◽  
Vol 50 (4) ◽  
pp. 510-519 ◽  
Author(s):  
Vincent P. Magnini ◽  
Earl D. Honeycutt

2009 ◽  
Vol 39 (2) ◽  
pp. 311-316 ◽  
Author(s):  
Cindy Harmon-Jones ◽  
Brandon J. Schmeichel ◽  
Eddie Harmon-Jones
Keyword(s):  

Author(s):  
Yangjun Chen

An important question in information retrieval is how to create a database index which can be searched efficiently for the data one seeks. Today, one or more of the following four techniques have been frequently used: full text searching, B-trees, inversion and the signature file. Full text searching imposes no space overhead, but requires long response time. In contrast, B-trees, inversion and the signature file work quickly, but need a large intermediary representation structure (index), which provides direct links to relevant data. In this paper, we concentrate on the techniques of signature files and discuss different construction approaches of a signature file. The signature technique cannot only be used in document databases, but also in relational and object-oriented databases. In a document database, a set of semistructured (XML) documents is stored and the queries related to keywords are frequently evaluated. To speed up the evaluation of such queries, we can construct signatures for words and superimpose them to establish signatures for document blocks, which can be used to cut off non-relevant documents as early as possible when evaluating a query. Especially, such a method can be extended to handle the socalled containment queries, for which not only the key words, but also the hierarchical structure of a document has to be considered. We can also handle queries issued to a relational or an objectoriented database using the signature technique by establishing signatures for attribute values, tuples, as well as tables and classes.


Sign in / Sign up

Export Citation Format

Share Document