Fast content-based file type identification

Digital forensic examiners often need to identify the type of a file or file fragment based only on the content of the file. Content-based file type identification schemes typically use a byte frequency distribution with statistical machine learning to classify file types. Most algorithms analyze the entire file content to obtain the byte frequency distribution, a technique that is inefficient and time consuming. This paper proposes two techniques for reducing the classification time. The first technique selects a subset of features based on the frequency of occurrence. The second speeds classification by sampling several blocks from the file. Experimental results demonstrate that up to a fifteen-fold reduction in file size analysis time can be achieved with limited impact on accuracy.

Rank and file : assessing research quality in Australia

In this paper, the author describes recent developments in the assessment of research activity and publication in Australia. Of particular interest to readers will be the move to rank academic journals. Educational Philosophy and Theory (EPAT) received the highest possible ranking, however, the process is far from complete. Some implications for the field, for this journal and particularly, for the educational foundations are discussed.

Setting aside default judgment - whether applicant must file affidavit providing direct evidence of defence 'on the merits'

In Prus-Butwilowicz v Moxey [2002] QDC 166 the court examined the question whether an applicant for an order setting aside a default judgment was required to file an affidavit providing direct evidence of a defence 'on the merits' and whether the position had changed under the Uniform Civil Procedure Rules 1999 (Qld).

Understanding file access mechanisms for embedded ubicomp collaboration interfaces

This paper explores the nature of interfaces to support people in accessing their files at tabletop displays embedded in the environment. To do this, we designed a study comparing people's interaction with two very different classes of file system access interface: Focus, explicitly designed for tabletops, and the familiar hierarchical Windows Explorer. In our within-subjects double-crossover study, participants collaborated on 4 planning tasks. Based on video, logs, questionnaires and interviews, we conclude that both classes of interface have a place. Notably, Focus contributed to improved collaboration and more efficient use of the workspace than with Explorer. Our results inform a set of recommendations for future interfaces enabling this important class of interaction -- supporting access to files for collaboration at tabletop devices embedded in an ubicomp environment.

A comparative study of multiple attribute tree and inverted file structures for large bibliographic files

A variety of data structures such as inverted file, multi-lists, quad tree, k-d tree, range tree, polygon tree, quintary tree, multidimensional tries, segment tree, doubly chained tree, the grid file, d-fold tree. super B-tree, Multiple Attribute Tree (MAT), etc. have been studied for multidimensional searching and related problems. Physical data base organization, which is an important application of multidimensional searching, is traditionally and mostly handled by employing inverted file. This study proposes MAT data structure for bibliographic file systems, by illustrating the superiority of MAT data structure over inverted file. Both the methods are compared in terms of preprocessing, storage and query costs. Worst-case complexity analysis of both the methods, for a partial match query, is carried out in two cases: (a) when directory resides in main memory, (b) when directory resides in secondary memory. In both cases, MAT data structure is shown to be more efficient than the inverted file method. Arguments are given to illustrate the superiority of MAT data structure in an average case also. An efficient adaptation of MAT data structure, that exploits the special features of MAT structure and bibliographic files, is proposed for bibliographic file systems. In this adaptation, suitable techniques for fixing and ranking of the attributes for MAT data structure are proposed. Conclusions and proposals for future research are presented.

The File Marked "Rita". Selections from the Letters of Herbert Mueller and Rita Klein (1939-1945) 1939-1946

Exchange of letters between Herbert Mueller and Rita Klein after Mueller's emigration to England in 1939; Rita Klein's attempt to obtain divorce; suicide attempt by her husband Leo Klein; correspondence through intermediaries after outbreak of World War II; notice of Rita Klein's deportation to Auschwitz; (translation from original German)

Huffman Binary Coding of WLN Symbols for File-Compression

Construction of Huffman binary codes for WLN symbols is described for the compression of a WLN file. Here, a parenthesized representation of the tree structure is used for computer encoding.

Photocopies of previous file of orders of service

Digital image

Single-File Diffusion of Confined Water Inside SWNTs: An NMR Study

We report a nuclear magnetic resonance (NMR) study of confined water inside similar to 1.4 nm diameter single-walled carbon nanotubes (SWNTs). We show that the confined water does not freeze even up to 223 K. A pulse field gradient (PFG) NMR method is used to determine the mean squared displacement (MSD) of the water molecules inside the nanotubes at temperatures below 273 K, where the bulk water outside the nanotubes freezes and hence does not contribute to the proton NMR signal. We show that the mean squared displacement varies as the square root of time, predicted for single-file diffusion in a one-dimensional channel. We propose a qualitative understanding of our results based on available molecular dynamics simulations.

Single-File Diffusion of Water Inside Narrow Carbon Nanorings

We use atomistic molecular dynamics (MD) simulations to study the diffusion of water molecules confined inside narrow (6,6) carbon nanorings. The water molecules form two oppositely polarized chains. It is shown that the effective interaction between these two chains is repulsive in nature. The computed mean-squared displacement (MSD) clearly shows a scaling with time similar to t(1/2), which is consistent with single-file diffusion (SFD). The time up to which the water molecules undergo SFD is shown to be the lifetime of the water molecules inside these chains. Simulations of "uncharged" water molecules inside the nanoring show the formation of several water chains and yield SFD. These observations conclusively prove that the diffusion is Fickian when there is a single chain of water and SFD is observed only when two or more chains are present.

An analytical model for capacity evaluation of VoIP on HCCA and TCP file transfers over EDCA in an IEEE 802.11e WLAN

In the context of the IEEE 802.11e standard for WLANs, we provide an analytical model for obtaining the maximum number of VoIP calls that can be supported on HCCA, such that the delay QoS constraint of the accepted calls is met, when TCP downloads are coexistent on EDCA. In this scenario, we derive the TCP download throughput by using an analytical model for the case where only TCP sessions are present in the WLAN. We show that the analytical model for combined voice and TCP transfers provides accurate results in comparison with simulations (using ns-2).

An analytical model for the capacity estimation of combined VoIP and TCP file transfers over EDCA in an IEEE 802.11e WLAN

In this paper we develop and numerically explore the modeling heuristic of using saturation attempt probabilities as state dependent attempt probabilities in an IEEE 802.11e infrastructure network carrying packet telephone calls and TCP controlled file downloads, using Enhanced Distributed Channel Access (EDCA). We build upon the fixed point analysis and performance insights in [1]. When there are a certain number of nodes of each class contending for the channel (i.e., have nonempty queues), then their attempt probabilities are taken to be those obtained from saturation analysis for that number of nodes. Then we model the system queue dynamics at the network nodes. With the proposed heuristic, the system evolution at channel slot boundaries becomes a Markov renewal process, and regenerative analysis yields the desired performance measures.The results obtained from this approach match well with ns2 simulations. We find that, with the default IEEE 802.11e EDCA parameters for AC 1 and AC 3, the voice call capacity decreases if even one file download is initiated by some station. Subsequently, reducing the voice calls increases the file download capacity almost linearly (by 1/3 Mbps per voice call for the 11 Mbps PHY).

Discovery of Application Workloads from Network File Traces

An understanding of application I/O access patterns is useful in several situations. First, gaining insight into what applications are doing with their data at a semantic level helps in designing efficient storage systems. Second, it helps create benchmarks that mimic realistic application behavior closely. Third, it enables autonomic systems as the information obtained can be used to adapt the system in a closed loop.All these use cases require the ability to extract the application-level semantics of I/O operations. Methods such as modifying application code to associate I/O operations with semantic tags are intrusive. It is well known that network file system traces are an important source of information that can be obtained non-intrusively and analyzed either online or offline. These traces are a sequence of primitive file system operations and their parameters. Simple counting, statistical analysis or deterministic search techniques are inadequate for discovering application-level semantics in the general case, because of the inherent variation and noise in realistic traces.In this paper, we describe a trace analysis methodology based on Profile Hidden Markov Models. We show that the methodology has powerful discriminatory capabilities that enable it to recognize applications based on the patterns in the traces, and to mark out regions in a long trace that encapsulate sets of primitive operations that represent higher-level application actions. It is robust enough that it can work around discrepancies between training and target traces such as in length and interleaving with other operations. We demonstrate the feasibility of recognizing patterns based on a small sampling of the trace, enabling faster trace analysis. Preliminary experiments show that the method is capable of learning accurate profile models on live traces in an online setting. We present a detailed evaluation of this methodology in a UNIX environment using NFS traces of selected commonly used applications such as compilations as well as on industrial strength benchmarks such as TPC-C and Postmark, and discuss its capabilities and limitations in the context of the use cases mentioned above.