Investigation of telomere lengths measurement by quantitative real-time PCR to predict age

Currently DNA profiling methods only compare a suspect’s DNA with DNA left at the crime scene. When there is no suspect, it would be useful for the police to be able to predict what the person of interest looks like by analysing the DNA left behind in a crime scene. Determination of the age of the suspect is an important factor in creating an identikit. Human somatic cells gradually lose telomeric repeats with age. This study investigated if one could use a correlation between telomere length and age, to predict the age of an individual from their DNA. Telomere length, in buccal cells, of 167 individuals aged between 1 and 96 years old was measured using real-time quantitative PCR. Telomere length decreased with age (r = −0.185, P < 0.05) and the age of an individual could be roughly determined by the following formula: (age = relative telomere length −1.5/−0.005). The regression (R2) value between telomere length and age was not, vert, similar0.04, which is too low to be use for forensics. The causes for the presence of large variation in telomere lengths in the population were further investigated. The age prediction accuracies were low even after dividing samples into non-related Caucasians, males and females (5%, 9% and 1%, respectively). Mean telomere lengths of eight age groups representing each decade of life showed non-linear decrease in telomere length with age. There were variations in telomere lengths even among similarly aged individuals aged 26 years old (n = 10) and age 54 years old (n = 9). Therefore, telomere length measurement by real-time quantitative PCR cannot be used to predict age of a person, due to the presence of large inter-individual variations in telomere lengths.

Utility of real-time decision-making in commercial data stream mining domains

The objective is to measure utility of real-time commercial decision making. It is important due to a higher possibility of mistakes in real-time decisions, problems with recording actual occurrences, and significant costs associated with predictions produced by algorithms. The first contribution is to use overall utility and represent individual utility with a monetary value instead of a prediction. The second is to calculate the benefit from predictions using the utility-based decision threshold. The third is to incorporate cost of predictions. For experiments, overall utility is used to evaluate communal and spike detection, and their adaptive versions. The overall utility results show that with fewer alerts, communal detection is better than spike detection. With more alerts, adaptive communal and spike detection are better than their static versions. To maximise overall utility with all algorithms, only 1% to 4% in the highest predictions should be alerts.

Aura, real-time motion capture dance and 3D stereoscopic dance

Aura explored the potential of motion capture and 3D stereo projection to visualize 1950's dance philosopher, Susanne K. Langer's notion of 'virtual force'.

Key success factors in real-time industrial system assurance

The thesis analyses the issues of implementing real-time software systems in industrial applications. The benefit is the development of the Integrated Mega Project Development Model, to improve the effectiveness of planning and timely delivery of software, the quality of the delivered software and reducing problems associated with integrating software systems.

Prototyping real-time systems using Petri net and object-oriented models

The objective of the research for this thesis is to develop techniques in order to build an executable model of a real-time system. This model is to be used early in the development of the system not only to detect errors in the specification of the system but also to validate expectations of the developer as to the operation of the system. A graphical specification of a real-time system called the transformation schema was chosen to be used to build the model. Two executable models of a real-time system are described.

Kernel performance in meeting hard real-time system characteristics (the ARTOS real-time kernel)

Describes the design and implementation of an operating system kernel specifically designed to support real-time applications. It emphasises portability and aims to support state-of-the-art concepts in real-time programming. Discusses architectural aspects of the ARTOS kernel, and introduces new concepts on the areas of interrupt processing, scheduling, mutual exclusion and inter-task communication. Also explains the programming environment of ARTOS kernal and its task model, defines the real-time task states and system data structures and discusses exception handling mechanisms which are used to detect missed deadlines and take corrective action.

Time-of-flight secondary ion mass spectrometry investigation of epoxy resin curing behavior in real time

Time-of-flight secondary ion mass spectrometry and principal components analysis were used in real time to monitor the progress of curing reactions on the surface of a diglycidyl ether of bisphenol A (DGEBA) and diglycidyl ether of bisphenol F (DGEBF) epoxy resin blend reacted with the diamine hardener isophorone diamine at different time intervals. Molecular ions in the mass spectra that characterized the curing reactions steps, including blocking, coupling, branching, and crosslinking, were identified. The aliphatic hydrocarbon ions were correlated to the curing reaction rate, and this indicated that coupling and branching occurred much faster than the blocking and crosslinking curing reactions steps. The total conversion of the coupling and branching reaction steps were followed on the basis of changes with time in the relative ion intensity of molecular ions assigned to the DGEBA/DGEBF, aliphatic hydrocarbon, epoxide, and aromatic ring structures. Indicative measures of crosslinking density were monitored through the observation of changes in the ratio of the relative intensities of the aliphatic hydrocarbon and hydroxyl molecular ions over time. The curing reaction conversion was established by the observation of the changes in the relative ion intensity of the molecular ions that were related to the DGEBA/ DGEBF molecules.

Real-time early infectious outbreak detection systems using emerging technologies

The use of emerging technologies ( such as RFID - Radio Frequency Identification and remote sensing) can be employed to reduce health care costs and also to facilitate the automatic streamlining of infectious disease outbreak detection and monitoring processes in local health departments. It can assist medical practitioners with fast and accurate diagnosis and treatments. In this paper we outline the design and application of a real-time RFID and sensor-base Early Infectious (e.g., cholera) Outbreak Detection and Monitoring (IODM) system for health care.

A quick-response real-time stepping stone detection scheme

Stepping stone attacks are often used by network intruders to hide their identities. To detect and block stepping stone attacks, a stepping stone detection scheme should be able to correctly identify a stepping-stone in a very short time and in real-time. However, the majority of past research has failed to indicate how long or how many packets it takes for the monitor to detect a stepping stone. In this paper, we propose a novel quick-response real-time stepping stones detection scheme which is based on packet delay properties. Our experiments show that it can identify a stepping stone within 20 seconds which includes false positives and false negatives of less than 3%.

Getting the real-time precise round-trip time for stepping stone detection

Stepping stone attacks are often used by network intruders to hide their identities. The Round Trip Times (RTT) between the send packets and corresponding echo packets for the connection chains of stepping stones are critical for detecting such attacks. In this paper, we propose a novel real-time RTT getting algorithm for stepping stones which is based on the estimation of the current RTT value. Our experiments show that it is far more precise than the previous real-time RTT getting algorithms. We also present the probability analysis which shows that our algorithm has a high matching rate and a high accurate rate.