Testing of large number multiplication functions in cryptographic systems

Integer multiplication is one of the fundamental functions in cryptographic systems. Although much research has already been done on the testing of multiplication functions, most does not meet the need of cryptographic systems, where very large numbers are involved. Others provide only probabilistic algorithms. In this paper we propose an efficient deterministic algorithm for verifying large number multiplications in cryptographic systems. A deterministic oracle for large integer multiplication functions will result. In addition, our method can also be used to verify selected segments of digits in the product of two numbers.published_or_final_versio

Automated functional testing of online search services

Search services are the main interface through which people discover information on the Internet. A fundamental challenge in testing search services is the lack of oracles. The sheer volume of data on the Internet prohibits testers from verifying the results. Furthermore, it is difficult to objectively assess the ranking quality because different assessors can have very different opinions on the relevance of a Web page to a query. This paper presents a novel method for automatically testing search services without the need of a human oracle. The experimental findings reveal that some commonly used search engines, including Google, Yahoo!, and Live Search, are not as reliable as what most users would expect. For example, they may fail to find pages that exist in their own repositories, or rank pages in a way that is logically inconsistent. Suggestions are made for search service providers to improve their service quality. Copyright © 2010 John Wiley & Sons, Ltd. A novel method for automatically testing search services without the need of a human oracle is presented. The experimental findings reveal that some commonly used search engines, including Google, Yahoo!, and Live Search, are not as reliable as what most users would expect. For example, they may fail to find pages that exist in their own repositories, or rank pages in a way that is logically inconsistent. Suggestions are made for search service providers to improve their service quality. Copyright © 2010 John Wiley & Sons, Ltd.link_to_subscribed_fulltex

Monitoring and analysis of power plant’s bus voltages

2003-2004 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe

ShapeCodes: Self-Supervised Feature Learning by Lifting Views to Viewgrids

We introduce an unsupervised feature learning approach that embeds 3D shape information into a single-view image representation. The main idea is a self-supervised training objective that, given only a single 2D image, requires all unseen views of the object to be predictable from learned features. We implement this idea as an encoder-decoder convolutional neural network. The network maps an input image of an unknown category and unknown viewpoint to a latent space, from which a deconvolutional decoder can best "lift" the image to its complete viewgrid showing the object from all viewing angles. Our class-agnostic training procedure encourages the representation to capture fundamental shape primitives and semantic regularities in a data-driven manner---without manual semantic labels. Our results on two widely-used shape datasets show 1) our approach successfully learns to perform "mental rotation" even for objects unseen during training, and 2) the learned latent space is a powerful representation for object recognition, outperforming several existing unsupervised feature learning methods.Comment: To appear at ECCV 201

Characterizing the malignancy and drug resistance of cancer cells from their membrane resealing response

In this report, we showed that two tumor cell characteristics, namely the malignancy and drug-resistance status can be evaluated by their membrane resealing response. Specifically, membrane pores in a number of pairs of cancer and normal cell lines originated from nasopharynx, lung and intestine were introduced by nano-mechanical puncturing. Interestingly, such nanometer-sized holes in tumor cells can reseal ∼ 2-3 times faster than those in the corresponding normal cells. Furthermore, the membrane resealing time in cancer cell lines exhibiting resistance to several leading chemotherapeutic drugs was also found to be substantially shorter than that in their drug-sensitive counterparts, demonstrating the potential of using this quantity as a novel marker for future cancer diagnosis and drug resistance detection. Finally, a simple model was proposed to explain the observed resealing dynamics of cells which suggested that the distinct response exhibited by normal, tumor and drug resistant cells is likely due to the different tension levels in their lipid membranes, a conclusion that is also supported by direct cortical tension measurement.published_or_final_versio

Proteome profiling of cadmium-induced apoptosis by antibody array analyses in human bronchial epithelial cells

Protein array technology is a powerful platform for the simultaneous determination of the expression levels of a number of proteins as well as post-translational modifications such as phosphorylation. Here, we screen and report for the first time, the dominant signaling cascades and apoptotic mediators during the course of cadmium (Cd)-induced cytotoxicity in human bronchial epithelial cells (BEAS-2B) by antibody array analyses. Proteins from control and Cd-treated cells were captured on Proteome Profiler™ Arrays for the parallel determination of the relative levels of protein phosphorylation and proteins associated with apoptosis. Our results indicated that the p38 MAPK- and JNK-related signal transduction pathways were dramatically activated by Cd treatment. Cd potently stimulates the phosphorylations of p38α (MAPK14), JNK1/2 (MAPK8/9), and JUN; while the phosphorylations of Akt1, ERK1/2 (MAPK3/1), GSK3β, and mTOR were suppressed. Moreover, there was an induction of proapoptotic protein BAX, release of cytochrome c (CYCS) from mitochondria, activation of caspase-3/9 (CASP3/9); as well as decreased expression of cell cycle checkpoint proteins (TP53, p21, and p27) and several inhibitors of apoptosis proteins (IAPs) [including cIAP-1/2 (BIRC2/3), XIAP (BIRC4), and survivin (BIRC5)]. Pretreatment of cells with the thiol antioxidant glutathione or p38 MAPK/JNK inhibitors before Cd treatment effectively abrogated ROS activation of p38 MAPK/JNK pathways and apoptosis-related proteins. Taken together, our results demonstrate that Cd causes oxidative stress-induced apoptosis; and the p38 MAPK/JNK and mitochondrial pathways are more importantly participated for signal transduction and the induction of apoptosis in Cd-exposed human lung cells.published_or_final_versio

Enhancing supervised classifications with metamorphic relations

We report on a novel use of metamorphic relations (MRs) in machine learning: instead of conducting metamorphic testing, we use MRs for the augmentation of the machine learning algorithms themselves. In particular, we report on how MRs can enable enhancements to an image classification problem of images containing hidden visual markers ("Artcodes"). Working on an original classifier, and using the characteristics of two different categories of images, two MRs, based on separation and occlusion, were used to improve the performance of the classifier. Our experimental results show that the MR-augmented classifier achieves better performance than the original classifier, algorithms, and extending the use of MRs beyond the context of software testing

A partial oracle for uniformity statistics

This paper investigates the problem of testing implementations of uniformity statistics. In this paper we used Metamorphic Testing to address the oracle problem, of checking the output of one or more test executions, for uniformity statistics. We defined a partial oracle that uses regression analysis (a Regression Model based Metamorphic Relation). We investigated the effectiveness of our partial oracle. We found that the technique can achieve mutation scores ranging from 77.78% to 100%, and tends towards higher mutation scores in this range. These results are promising, and suggest that the Regression Model based Metamorphic Relation approach is a viable method of alleviating the oracle problem in implementations of uniformity statistics, and potentially other classes of statistics e.g. correlation statistics

Galileons as Wess-Zumino Terms

We show that the galileons can be thought of as Wess-Zumino terms for the spontaneous breaking of space-time symmetries. Wess-Zumino terms are terms which are not captured by the coset construction for phenomenological Lagrangians with broken symmetries. Rather they are, in d space-time dimensions, d-form potentials for (d+1)-forms which are non-trivial co-cycles in Lie algebra cohomology of the full symmetry group relative to the unbroken symmetry group. We introduce the galileon algebras and construct the non-trivial (d+1)-form co-cycles, showing that the presence of galileons and multi-galileons in all dimensions is counted by the dimensions of particular Lie algebra cohomology groups. We also discuss the DBI and conformal galileons from this point of view, showing that they are not Wess-Zumino terms, with one exception in each case.Comment: 49 pages. v2 minor changes, version appearing in JHE