A New Color Image Encryption Scheme Using CML and a Fractional-Order Chaotic System

The chaos-based image cryptosystems have been widely investigated in recent years to provide real-time encryption and transmission. In this paper, a novel color image encryption algorithm by using coupled-map lattices (CML) and a fractional-order chaotic system is proposed to enhance the security and robustness of the encryption algorithms with a permutation-diffusion structure. To make the encryption procedure more confusing and complex, an image division-shuffling process is put forward, where the plain-image is first divided into four sub-images, and then the position of the pixels in the whole image is shuffled. In order to generate initial conditions and parameters of two chaotic systems, a 280-bit long external secret key is employed. The key space analysis, various statistical analysis, information entropy analysis, differential analysis and key sensitivity analysis are introduced to test the security of the new image encryption algorithm. The cryptosystem speed is analyzed and tested as well. Experimental results confirm that, in comparison to other image encryption schemes, the new algorithm has higher security and is fast for practical image encryption. Moreover, an extensive tolerance analysis of some common image processing operations such as noise adding, cropping, JPEG compression, rotation, brightening and darkening, has been performed on the proposed image encryption technique. Corresponding results reveal that the proposed image encryption method has good robustness against some image processing operations and geometric attacks.     

Adaptive medical image encryption algorithm based on multiple chaotic mapping

Digital images are now widely used in modern clinic diagnosis. The diagnostic images with confidential information related to patients’ privacy are stored and transmitted via public networks. Secured schemes to guarantee confidentiality of patients’ privacy are becoming more and more vital. This paper proposes an adaptive medical image encryption algorithm based on improved chaotic mapping in order to overcome the defects of the existing chaotic image encryption algorithm. First, the algorithm used Logistic-sine chaos mapping to scramble the plain image. Then, the scrambled image was divided into 2-by-2 sub blocks. By using the hyper-chaotic system, the sub blocks were adaptively encrypted until all the sub block encryption was completed. By analyzing the key space, the information entropy, the correlation coefficient and the plaintext sensitivity of the algorithm, experimental results show that the proposed algorithm overcomes the shortcoming of lack of diffusion in single direction encryption. It could effectively resist all kinds of attacks and has better security and robustness.     

Double-Exposure Optical Sectioning Structured Illumination Microscopy Based on Hilbert Transform Reconstruction

Structured illumination microscopy (SIM) with axially optical sectioning capability has found widespread applications in three-dimensional live cell imaging in recent years, since it combines high sensitivity, short image acquisition time, and high spatial resolution. To obtain one sectioned slice, three raw images with a fixed phase-shift, normally 2π/3, are generally required. In this paper, we report a data processing algorithm based on the one-dimensional Hilbert transform, which needs only two raw images with arbitrary phase-shift for each single slice. The proposed algorithm is different from the previous two-dimensional Hilbert spiral transform algorithm in theory. The presented algorithm has the advantages of simpler data processing procedure, faster computation speed and better reconstructed image quality. The validity of the scheme is verified by imaging biological samples in our developed DMD-based LED-illumination SIM system.     

An Efficient and Provable Secure Revocable Identity-Based Encryption Scheme

Revocation functionality is necessary and crucial to identity-based cryptosystems. Revocable identity-based encryption (RIBE) has attracted a lot of attention in recent years, many RIBE schemes have been proposed in the literature but shown to be either insecure or inefficient. In this paper, we propose a new scalable RIBE scheme with decryption key exposure resilience by combining Lewko and Waters’ identity-based encryption scheme and complete subtree method, and prove our RIBE scheme to be semantically secure using dual system encryption methodology. Compared to existing scalable and semantically secure RIBE schemes, our proposed RIBE scheme is more efficient in term of ciphertext size, public parameters size and decryption cost at price of a little looser security reduction. To the best of our knowledge, this is the first construction of scalable and semantically secure RIBE scheme with constant size public system parameters.     

An Effective Approach of Secured Medical Image Transmission Using Encryption Method

Various chaos-based image encryption schemes have been proposed in last few years. The proposed image encryption method uses chaotic map. The encryption is done by using 256 bit long external secret key. The initial condition for the chaotic mapping is evaluated by the use of external secret key along with the mapping function. Besides that, the proposed method is made more robust by applying multiple operations to the pixels of the image depending on the outcome of the calculation of the logistic map. Moreover, block shuffling of the image and modifying the secret key after encryption of each row is also done to add chaos to the proposed method.     

PSimScan: Algorithm and Utility for Fast Protein Similarity Search

In the era of metagenomics and diagnostics sequencing, the importance of protein comparison methods of boosted performance cannot be overstated. Here we present PSimScan (Protein Similarity Scanner), a flexible open source protein similarity search tool which provides a significant gain in speed compared to BLASTP at the price of controlled sensitivity loss. The PSimScan algorithm introduces a number of novel performance optimization methods that can be further used by the community to improve the speed and lower hardware requirements of bioinformatics software. The optimization starts at the lookup table construction, then the initial lookup table–based hits are passed through a pipeline of filtering and aggregation routines of increasing computational complexity. The first step in this pipeline is a novel algorithm that builds and selects ‘similarity zones’ aggregated from neighboring matches on small arrays of adjacent diagonals. PSimScan performs 5 to 100 times faster than the standard NCBI BLASTP, depending on chosen parameters, and runs on commodity hardware. Its sensitivity and selectivity at the slowest settings are comparable to the NCBI BLASTP’s and decrease with the increase of speed, yet stay at the levels reasonable for many tasks. PSimScan is most advantageous when used on large collections of query sequences. Comparing the entire proteome of Streptocuccus pneumoniae (2,042 proteins) to the NCBI’s non-redundant protein database of 16,971,855 records takes 6.5 hours on a moderately powerful PC, while the same task with the NCBI BLASTP takes over 66 hours. We describe innovations in the PSimScan algorithm in considerable detail to encourage bioinformaticians to improve on the tool and to use the innovations in their own software development.     

Confidence intervals by constrained optimization—An algorithm and software package for practical identifiability analysis in systems biology

Practical identifiability of Systems Biology models has received a lot of attention in recent scientific research. It addresses the crucial question for models’ predictability: how accurately can the models’ parameters be recovered from available experimental data. The methods based on profile likelihood are among the most reliable methods of practical identification. However, these methods are often computationally demanding or lead to inaccurate estimations of parameters’ confidence intervals. Development of methods, which can accurately produce parameters’ confidence intervals in reasonable computational time, is of utmost importance for Systems Biology and QSP modeling.We propose an algorithm Confidence Intervals by Constraint Optimization (CICO) based on profile likelihood, designed to speed-up confidence intervals estimation and reduce computational cost. The numerical implementation of the algorithm includes settings to control the accuracy of confidence intervals estimates. The algorithm was tested on a number of Systems Biology models, including Taxol treatment model and STAT5 Dimerization model, discussed in the current article.The CICO algorithm is implemented in a software package freely available in Julia (https://github.com/insysbio/LikelihoodProfiler.jl) and Python (https://github.com/insysbio/LikelihoodProfiler.py).     

‘Glocal’ Robustness Analysis and Model Discrimination for Circadian Oscillators

To characterize the behavior and robustness of cellular circuits with many unknown parameters is a major challenge for systems biology. Its difficulty rises exponentially with the number of circuit components. We here propose a novel analysis method to meet this challenge. Our method identifies the region of a high-dimensional parameter space where a circuit displays an experimentally observed behavior. It does so via a Monte Carlo approach guided by principal component analysis, in order to allow efficient sampling of this space. This ‘global’ analysis is then supplemented by a ‘local’ analysis, in which circuit robustness is determined for each of the thousands of parameter sets sampled in the global analysis. We apply this method to two prominent, recent models of the cyanobacterial circadian oscillator, an autocatalytic model, and a model centered on consecutive phosphorylation at two sites of the KaiC protein, a key circadian regulator. For these models, we find that the two-sites architecture is much more robust than the autocatalytic one, both globally and locally, based on five different quantifiers of robustness, including robustness to parameter perturbations and to molecular noise. Our ‘glocal’ combination of global and local analyses can also identify key causes of high or low robustness. In doing so, our approach helps to unravel the architectural origin of robust circuit behavior. Complementarily, identifying fragile aspects of system behavior can aid in designing perturbation experiments that may discriminate between competing mechanisms and different parameter sets.     

Optimization of Regularization Parameters in Compressed Sensing of Magnetic Resonance Angiography: Can Statistical Image Metrics Mimic Radiologists' Perception?

In Compressed Sensing (CS) of MRI, optimization of the regularization parameters is not a trivial task. We aimed to establish a method that could determine the optimal weights for regularization parameters in CS of time-of-flight MR angiography (TOF-MRA) by comparing various image metrics with radiologists’ visual evaluation. TOF-MRA of a healthy volunteer was scanned using a 3T-MR system. Images were reconstructed by CS from retrospectively under-sampled data by varying the weights for the L1 norm of wavelet coefficients and that of total variation. The reconstructed images were evaluated both quantitatively by statistical image metrics including structural similarity (SSIM), scale invariant feature transform (SIFT) and contrast-to-noise ratio (CNR), and qualitatively by radiologists’ scoring. The results of quantitative metrics and qualitative scorings were compared. SSIM and SIFT in conjunction with brain masks and CNR of artery-to-parenchyma correlated very well with radiologists’ visual evaluation. By carefully selecting a region to measure, we have shown that statistical image metrics can reflect radiologists’ visual evaluation, thus enabling an appropriate optimization of regularization parameters for CS.     

Fast,Simple and Accurate Handwritten Digit Classification by Training Shallow Neural Network Classifiers with the ‘Extreme Learning Machine’ Algorithm

Recent advances in training deep (multi-layer) architectures have inspired a renaissance in neural network use. For example, deep convolutional networks are becoming the default option for difficult tasks on large datasets, such as image and speech recognition. However, here we show that error rates below 1% on the MNIST handwritten digit benchmark can be replicated with shallow non-convolutional neural networks. This is achieved by training such networks using the ‘Extreme Learning Machine’ (ELM) approach, which also enables a very rapid training time (∼ 10 minutes). Adding distortions, as is common practise for MNIST, reduces error rates even further. Our methods are also shown to be capable of achieving less than 5.5% error rates on the NORB image database. To achieve these results, we introduce several enhancements to the standard ELM algorithm, which individually and in combination can significantly improve performance. The main innovation is to ensure each hidden-unit operates only on a randomly sized and positioned patch of each image. This form of random ‘receptive field’ sampling of the input ensures the input weight matrix is sparse, with about 90% of weights equal to zero. Furthermore, combining our methods with a small number of iterations of a single-batch backpropagation method can significantly reduce the number of hidden-units required to achieve a particular performance. Our close to state-of-the-art results for MNIST and NORB suggest that the ease of use and accuracy of the ELM algorithm for designing a single-hidden-layer neural network classifier should cause it to be given greater consideration either as a standalone method for simpler problems, or as the final classification stage in deep neural networks applied to more difficult problems.     

Computational Effective Fault Detection by Means of Signature Functions

The paper presents a computationally effective method for fault detection. A system’s responses are measured under healthy and ill conditions. These signals are used to calculate so-called signature functions that create a signal space. The current system’s response is projected into this space. The signal location in this space easily allows to determine the fault. No classifier such as a neural network, hidden Markov models, etc. is required. The advantage of this proposed method is its efficiency, as computing projections amount to calculating dot products. Therefore, this method is suitable for real-time embedded systems due to its simplicity and undemanding processing capabilities which permit the use of low-cost hardware and allow rapid implementation. The approach performs well for systems that can be considered linear and stationary. The communication presents an application, whereby an industrial process of moulding is supervised. The machine is composed of forms (dies) whose alignment must be precisely set and maintained during the work. Typically, the process is stopped periodically to manually control the alignment. The applied algorithm allows on-line monitoring of the device by analysing the acceleration signal from a sensor mounted on a die. This enables to detect failures at an early stage thus prolonging the machine’s life.     

Real-Time State Estimation in a Flight Simulator Using fNIRS

Working memory is a key executive function for flying an aircraft. This function is particularly critical when pilots have to recall series of air traffic control instructions. However, working memory limitations may jeopardize flight safety. Since the functional near-infrared spectroscopy (fNIRS) method seems promising for assessing working memory load, our objective is to implement an on-line fNIRS-based inference system that integrates two complementary estimators. The first estimator is a real-time state estimation MACD-based algorithm dedicated to identifying the pilot’s instantaneous mental state (not-on-task vs. on-task). It does not require a calibration process to perform its estimation. The second estimator is an on-line SVM-based classifier that is able to discriminate task difficulty (low working memory load vs. high working memory load). These two estimators were tested with 19 pilots who were placed in a realistic flight simulator and were asked to recall air traffic control instructions. We found that the estimated pilot’s mental state matched significantly better than chance with the pilot’s real state (62% global accuracy, 58% specificity, and 72% sensitivity). The second estimator, dedicated to assessing single trial working memory loads, led to 80% classification accuracy, 72% specificity, and 89% sensitivity. These two estimators establish reusable blocks for further fNIRS-based passive brain computer interface development.     

The Sense of Agency during Continuous Action: Performance Is More Important than Action-Feedback Association

The sense of agency refers to the feeling that one is controlling events through one’s own behavior. This study examined how task performance and the delay of events influence one’s sense of agency during continuous action accompanied by a goal. The participants were instructed to direct a moving dot into a square as quickly as possible by pressing the left and right keys on a keyboard to control the direction in which the dot traveled. The interval between the key press and response of the dot (i.e., direction change) was manipulated to vary task difficulty. Moreover, in the assisted condition, the computer ignored participants’ erroneous commands, resulting in improved task performance but a weaker association between the participants’ commands and actual movements of the dot relative to the condition in which all of the participants’ commands were executed (i.e., self-control condition). The results showed that participants’ sense of agency increased with better performance in the assisted condition relative to the self-control condition, even though a large proportion of their commands were not executed. We concluded that, when the action-feedback association was uncertain, cognitive inference was more dominant relative to the process of comparing predicted and perceived information in the judgment of agency.     

Primitive Fitting Based on the Efficient multiBaySAC Algorithm

Although RANSAC is proven to be robust, the original RANSAC algorithm selects hypothesis sets at random, generating numerous iterations and high computational costs because many hypothesis sets are contaminated with outliers. This paper presents a conditional sampling method, multiBaySAC (Bayes SAmple Consensus), that fuses the BaySAC algorithm with candidate model parameters statistical testing for unorganized 3D point clouds to fit multiple primitives. This paper first presents a statistical testing algorithm for a candidate model parameter histogram to detect potential primitives. As the detected initial primitives were optimized using a parallel strategy rather than a sequential one, every data point in the multiBaySAC algorithm was assigned to multiple prior inlier probabilities for initial multiple primitives. Each prior inlier probability determined the probability that a point belongs to the corresponding primitive. We then implemented in parallel a conditional sampling method: BaySAC. With each iteration of the hypothesis testing process, hypothesis sets with the highest inlier probabilities were selected and verified for the existence of multiple primitives, revealing the fitting for multiple primitives. Moreover, the updated version of the initial probability was implemented based on a memorable form of Bayes’ Theorem, which describes the relationship between prior and posterior probabilities of a data point by determining whether the hypothesis set to which a data point belongs is correct. The proposed approach was tested using real and synthetic point clouds. The results show that the proposed multiBaySAC algorithm can achieve a high computational efficiency (averaging 34% higher than the efficiency of the sequential RANSAC method) and fitting accuracy (exhibiting good performance in the intersection of two primitives), whereas the sequential RANSAC framework clearly suffers from over- and under-segmentation problems. Future work will aim at further optimizing this strategy through its application to other problems such as multiple point cloud co-registration and multiple image matching.     

Research on cascading high-dimensional isomorphic chaotic maps

In order to overcome the security weakness of the discrete chaotic sequence caused by small Lyapunov exponent and keyspace, a general chaotic construction method by cascading multiple high-dimensional isomorphic maps is presented in this paper. Compared with the original map, the parameter space of the resulting chaotic map is enlarged many times. Moreover, the cascaded system has larger chaotic domain and bigger Lyapunov exponents with proper parameters. In order to evaluate the effectiveness of the presented method, the generalized 3-D Hénon map is utilized as an example to analyze the dynamical behaviors under various cascade modes. Diverse maps are obtained by cascading 3-D Hénon maps with different parameters or different permutations. It is worth noting that some new dynamical behaviors, such as coexisting attractors and hyperchaotic attractors are also discovered in cascaded systems. Finally, an application of image encryption is delivered to demonstrate the excellent performance of the obtained chaotic sequences.     

A Linear Mixed Model Spline Framework for Analysing Time Course ‘Omics’ Data

Time course ‘omics’ experiments are becoming increasingly important to study system-wide dynamic regulation. Despite their high information content, analysis remains challenging. ‘Omics’ technologies capture quantitative measurements on tens of thousands of molecules. Therefore, in a time course ‘omics’ experiment molecules are measured for multiple subjects over multiple time points. This results in a large, high-dimensional dataset, which requires computationally efficient approaches for statistical analysis. Moreover, methods need to be able to handle missing values and various levels of noise. We present a novel, robust and powerful framework to analyze time course ‘omics’ data that consists of three stages: quality assessment and filtering, profile modelling, and analysis. The first step consists of removing molecules for which expression or abundance is highly variable over time. The second step models each molecular expression profile in a linear mixed model framework which takes into account subject-specific variability. The best model is selected through a serial model selection approach and results in dimension reduction of the time course data. The final step includes two types of analysis of the modelled trajectories, namely, clustering analysis to identify groups of correlated profiles over time, and differential expression analysis to identify profiles which differ over time and/or between treatment groups. Through simulation studies we demonstrate the high sensitivity and specificity of our approach for differential expression analysis. We then illustrate how our framework can bring novel insights on two time course ‘omics’ studies in breast cancer and kidney rejection. The methods are publicly available, implemented in the R CRAN package lmms.     

KS-Detect – Validation of Solar Thermal PCR for the Diagnosis of Kaposi’s Sarcoma Using Pseudo-Biopsy Samples

Resource-limited settings present unique engineering challenges for medical diagnostics. Diagnosis is often needed for those unable to reach central healthcare systems, making portability and independence from traditional energy infrastructure essential device parameters. In 2014, our group presented a microfluidic device that performed a solar-powered variant of the polymerase chain reaction, which we called solar thermal PCR. In this work, we expand on our previous effort by presenting an integrated, portable, solar thermal PCR system targeted towards the diagnosis of Kaposi’s sarcoma. We call this system KS-Detect, and we now report the system’s performance as a diagnostic tool using pseudo-biopsy samples made from varying concentrations of human lymphoma cell lines positive for the KS herpesvirus (KSHV). KS-Detect achieved 83% sensitivity and 70% specificity at high (≥10%) KSHV+ cell concentrations when diagnosing pseudo-biopsy samples by smartphone image. Using histology, we confirm that our prepared pseudo-biopsies contain similar KSHV+ cell concentrations as human biopsies positive for KS. Through our testing of samples derived from human cell lines, we validate KS-Detect as a viable, portable KS diagnostic tool, and we identify critical engineering considerations for future solar-thermal PCR devices.     

Following Darwin’s footsteps: Evaluating the impact of an activity designed for elementary school students to link historically important evolution key concepts on their understanding of natural selection

While several researchers have suggested that evolution should be explored from the initial years of schooling, little information is available on effective resources to enhance elementary school students’ level of understanding of evolution by natural selection (LUENS). For the present study, we designed, implemented, and evaluated an educational activity planned for fourth graders (9 to 10 years old) to explore concepts and conceptual fields that were historically important for the discovery of natural selection. Observation field notes and students’ productions were used to analyze how the students explored the proposed activity. Additionally, an evaluation framework consisting of a test, the evaluation criteria, and the scoring process was applied in two fourth‐grade classes (N = 44) to estimate elementary school students’ LUENS before and after engaging in the activity. Our results show that our activity allowed students to link the key concepts, resulting in a significant increase of their understanding of natural selection. They also reveal that additional activities and minor fine‐tuning of the present activity are required to further support students’ learning about the concept of differential reproduction.     

Are V1 Simple Cells Optimized for Visual Occlusions? A Comparative Study

Simple cells in primary visual cortex were famously found to respond to low-level image components such as edges. Sparse coding and independent component analysis (ICA) emerged as the standard computational models for simple cell coding because they linked their receptive fields to the statistics of visual stimuli. However, a salient feature of image statistics, occlusions of image components, is not considered by these models. Here we ask if occlusions have an effect on the predicted shapes of simple cell receptive fields. We use a comparative approach to answer this question and investigate two models for simple cells: a standard linear model and an occlusive model. For both models we simultaneously estimate optimal receptive fields, sparsity and stimulus noise. The two models are identical except for their component superposition assumption. We find the image encoding and receptive fields predicted by the models to differ significantly. While both models predict many Gabor-like fields, the occlusive model predicts a much sparser encoding and high percentages of ‘globular’ receptive fields. This relatively new center-surround type of simple cell response is observed since reverse correlation is used in experimental studies. While high percentages of ‘globular’ fields can be obtained using specific choices of sparsity and overcompleteness in linear sparse coding, no or only low proportions are reported in the vast majority of studies on linear models (including all ICA models). Likewise, for the here investigated linear model and optimal sparsity, only low proportions of ‘globular’ fields are observed. In comparison, the occlusive model robustly infers high proportions and can match the experimentally observed high proportions of ‘globular’ fields well. Our computational study, therefore, suggests that ‘globular’ fields may be evidence for an optimal encoding of visual occlusions in primary visual cortex.     

Investigating key cell types and molecules dynamics in PyMT mice model of breast cancer through a mathematical model

The most common kind of cancer among women is breast cancer. Understanding the tumor microenvironment and the interactions between individual cells and cytokines assists us in arriving at more effective treatments. Here, we develop a data-driven mathematical model to investigate the dynamics of key cell types and cytokines involved in breast cancer development. We use time-course gene expression profiles of a mouse model to estimate the relative abundance of cells and cytokines. We then employ a least-squares optimization method to evaluate the model’s parameters based on the mice data. The resulting dynamics of the cells and cytokines obtained from the optimal set of parameters exhibit a decent agreement between the data and predictions. We perform a sensitivity analysis to identify the crucial parameters of the model and then perform a local bifurcation on them. The results reveal a strong connection between adipocytes, IL6, and the cancer population, suggesting them as potential targets for therapies.