Malware detection: program run length against detection rate

N-gram analysis is an approach that investigates the structure of a program using bytes, characters or text strings. This research uses dynamic analysis to investigate malware detection using a classification approach based on N-gram analysis. A key issue with dynamic analysis is the length of time a program has to be run to ensure a correct classification. The motivation for this research is to find the optimum subset of operational codes (opcodes) that make the best indicators of malware and to determine how long a program has to be monitored to ensure an accurate support vector machine (SVM) classification of benign and malicious software. The experiments within this study represent programs as opcode density histograms gained through dynamic analysis for different program run periods. A SVM is used as the program classifier to determine the ability of different program run lengths to correctly determine the presence of malicious software. The findings show that malware can be detected with different program run lengths using a small number of opcodes

JPEG encoder system-on-a-chip demonstrator

The design of a System-on-a-Chip (SoC) demonstrator for a baseline JPEG encoder core is presented. This combines a highly optimized Discrete Cosine Transform (DCT) and quantization unit with an entropy coder which has been realized using off-the-shelf synthesizable IP cores (Run-length coder, Huffman coder and data packer). When synthesized in a 0.35 µm CMOS process, the core can operate at speeds up to 100 MHz and contains 50 k gates plus 11.5 kbits of RAM. This is approximately 20% less than similar JPEG encoder designs reported in literature. When targeted at FPGA the core can operate up to 30 MHz and is capable of compressing 9-bit full-frame color input data at NTSC or PAL rates.

Polyploid measles virus with hexameric genome length

Particles of most virus species accurately package a single genome, but there are indications that the pleomorphic particles of parainfluenza viruses incorporate multiple genomes. We characterized a stable measles virus mutant that efficiently packages at least two genomes. The first genome is recombinant and codes for a defective attachment protein with an appended domain interfering with fusion-support function. The second has one adenosine insertion in a purine run that interrupts translation of the appended domain and restores function. In that genome, a one base deletion in a different purine run abolishes polymerase synthesis, but restores hexameric genome length, thus ensuring accurate RNA encapsidation, which is necessary for efficient replication. Thus, the two genomes are complementary. The infection kinetics of this mutant indicate that packaging of multiple genomes does not negatively affect growth. We also show that polyploid particles are produced in standard infections at no expense to infectivity. Our results illustrate how the particles of parainfluenza viruses efficiently accommodate cargoes of different volume, and suggest a mechanism by which segmented genomes may have evolved.

Run off Conditions on Rimming Power Law Fluids

The rimming ?ow of a power-law ?uid in the inner surface of a horizontal rotating cylinder is investigated. Exploiting the fact that the liquid layer is thin, the simplest lubrication theory is applied. The generalized run-off condition for the steady-state ?ow of the power-law liquid is derived. In the bounds implied by this condition, ?lm thickness admits a continuous solution. In the supercritical case when the mass of non-Newtonian liquid exceeds a certain value or the speed of rotation is less than an indicated limit, a discontinuous solution is possible and a hydraulic jump may occur in the steady-state regime. The location and height of the hydraulic jump for the power-law liquid is determined.

Addressing Bed Costs for the Elderly: A New Methodology for Modelling Patient Outcomes and Length of Stay

The proportion of elderly in the population has dramatically increased and will continue to do so for at least the next 50 years. Medical resources throughout the world are feeling the added strain of the increasing proportion of elderly in the population. The effective care of elderly patients in hospitals may be enhanced by accurately modelling the length of stay of the patients in hospital and the associated costs involved. This paper examines previously developed models for patient length of stay in hospital and describes the recently developed conditional phase-type distribution (C-Ph) to model patient duration of stay in relation to explanatory patient variables. The Clinics data set was used to demonstrate the C-Ph methodology. The resulting model highlighted a strong relationship between Barthel grade, patient outcome and length of stay showing various groups of patient behaviour. The patients who stay in hospital for a very long time are usually those that consume the largest amount of hospital resources. These have been identified as the patients whose resulting outcome is transfer. Overall, the majority of transfer patients spend a considerably longer period of time in hospital compared to patients who die or are discharged home. The C-Ph model has the potential for considering costs where different costs are attached to the various phases or subgroups of patients and the anticipated cost of care estimated in advance. It is hoped that such a method will lead to the successful identification of the most cost effective case-mix management of the hospital ward.

Identification of tone duration, line length and letter position: An experimental approach to timing and working memory deficits in schizophrenia.

Patients with schizophrenia display numerous cognitive deficits, including problems in working memory, time estimation, and absolute identification of stimuli. Research in these fields has traditionally been conducted independently. We examined these cognitive processes using tasks that are structurally similar and that yield rich error data. Relative to healthy control participants (n = 20), patients with schizophrenia (n = 20) were impaired on a duration identification task and a probed-recall memory task but not on a line-length identification task. These findings do not support the notion of a global impairment in absolute identification in schizophrenia. However, the authors suggest that some aspect of temporal information processing is indeed disturbed in schizophrenia.