Application of power functions to chromatographic data for the enhancement of signal to noise ratios and separation resolution

Chromatographic detection responses are recorded digitally. A peak is represented ideally by a Guassian distribution. Raising a Guassian distribution to the power ‘n’ increases the height of the peak to that power, but decreases the standard deviation by √n. Hence there is an increasing disparity in detection responses as the signal moves from low level noise, with a corresponding decrease in peak width. This increases the S/N ratio and increases peak to peak resolution. The ramifications of these factors are that poor resolution in complex chromatographic data can be improved, and low signal responses embedded at near noise levels can be enhanced. The application of this data treatment process is potentially very useful in 2D-HPLC where sample dilution occurs between dimension, reducing signal response, and in the application of post-reaction detection methods, where band broadening is increased by virtue of reaction coils. In this work power functions applied to chromatographic data are discussed in the context of (a) complex separation problems, (b) 2D-HPLC separations, and (c) post-column reaction detectors.

A secure tag ownership transfer scheme in a closed loop RFID system

In this paper we propose a novel secure tag ownership transfer scheme for closed loop RFID systems. An important property of our method is that the ownership transfer is guaranteed to be atomic and the scheme is protected against desynchronisation leading to permanent DoS. Further, it is suited to the computational constraints of EPC Class-1 Gen-2 passive RFID tags as they only use the CRC and PRNG functions that passive RFID tags are capable of. We provide a detailed security analysis to show that our scheme satisfies the required security properties of tag anonymity, tag location privacy, forward secrecy, forward untraceability while being resistant to replay, desynchronisation and server impersonation attacks. Performance comparisons show that our scheme is practical and can be implemented on passive low-cost RFID tags.

Optimization of gaussian fuzzy membership functions and evaluation of the monotonicity property of fuzzy inference systems

In this paper, two issues relating to modeling of a monotonicity-preserving Fuzzy Inference System (FIS) are examined. The first is on designing or tuning of Gaussian Membership Functions (MFs) for a monotonic FIS. Designing Gaussian MFs for an FIS is difficult because of its spreading and curvature characteristics. In this study, the sufficient conditions are exploited, and the procedure of designing Gaussian MFs is formulated as a constrained optimization problem. The second issue is on the testing procedure for a monotonic FIS. As such, a testing procedure for a monotonic FIS model is proposed. Applicability of the proposed approach is demonstrated with a real world industrial application, i.e., Failure Mode and Effect Analysis. The results obtained are analysis and discussed. The outcomes show that the proposed approach is useful in designing a monotonicity-preserving FIS model.

Gesture types for functions

This paper reports on the different gesture types employed by twenty-three Year 10 students as they endeavoured to explain their understanding of rate of change associated with the functions resulting from two different computer simulations. These gestures also have application to revealing students’ understanding of functions. However, interpretation of gesture is problematic but classification of gestures assisted in the analysis of the videorecorded interviews probing participants’ conceptions of rate of change. This paper builds on the classifications reported in previous research. Five additional gesture types are presented, which provide insights into students’ thinking about rate of change, and hence functions.

Color image reduction by minimizing penalty functions

In image processing, particularly in image reduction, averaging aggregation functions play an important role. In this work we study the aggregation of color values (RGB) and we present an image reduction algorithm for RGB color images. For this purpose, we define and study aggregation functions and penalty functions in product lattices. We show how the arithmetic mean and the median can be obtained by minimizing specific penalty functions. Moreover, we study other penalty functions and we show that, in general, aggregation functions on product lattices do not coincide with the cartesian product of the corresponding aggregation functions. Finally, we make an experimental study where we test our reduction algorithm and we analyze the stability of the penalty functions in images affected by noise.

Iteratively predict protein functions from protein-protein interactions

Current similarity-based approaches of predicting protein functions from protein-protein interaction (PPI) data usually make use of available information in the PPI network to predict functions of un-annotated proteins, and the prediction is a one-off procedure. However the interactions between proteins are more likely to be mutual rather than static and mono-directed. In other words, the un-annotated proteins, once their functions are predicted, will in turn affect the similarities between proteins. In this paper, we propose an innovative iteration algorithm that incorporates this dynamic feature of protein interaction into the protein function prediction, aiming to achieve higher prediction accuracies and get more reasonable results. With our algorithm, instead of one-off function predictions, functions are assigned to an unannotated protein iteratively until the functional similarities between proteins achieve a stable state. The experimental results show that our iterative method can provide better prediction results than one-off prediction methods with higher prediction accuracies, and is stable for large protein datasets.

Dynamically predicting protein functions from semantic associations of proteins

Predicting functions of un-annotated proteins is a significant challenge in the post-genomics era. Among existing computational approaches, exploiting interactions between proteins to predict functions of un-annotated proteins is widely used. However, it remains difficult to extract semantic associations between proteins (i.e. protein associations in terms of protein functionality) from protein interactions and incorporate extracted semantic associations to more effectively predict protein functions. Furthermore, existing approaches and algorithms regard the function prediction as a one-off procedure, ignoring dynamic and mutual associations between proteins. Therefore, deriving and exploiting semantic associations between proteins to dynamically predict functions are a promising and challenging approach for achieving better prediction results. In this paper, we propose an innovative algorithm to incorporate semantic associations between proteins into a dynamic procedure of protein function prediction. The semantic association between two proteins is measured by the semantic similarity of two proteins which is defined by the similarities of functions two proteins possess. To achieve better prediction results, function similarities are also incorporated into the prediction procedure. The algorithm dynamically predicts functions by iteratively selecting functions for the un-annotated protein and updating the similarities between the un-annotated protein and its neighbour annotated proteins until such suitable functions are selected that the similarities no longer change. The experimental results on real protein interaction datasets demonstrated that our method outperformed the similar and non-dynamic function prediction methods. Incorporating semantic associations between proteins into a dynamic procedure of function prediction reflects intrinsic relationships among proteins as well as dynamic features of protein interactions, and therefore, can significantly improve prediction results.