Surface-enhanced Raman scattering nanosensors for <Emphasis Type="Italic">in vivo</Emphasis> detection of nucleic acid targets in a large animal model

Although nanotechnology has led to important advances in in vitro diagnostics, the development of nanosensors for in vivo detection remains very challenging. Here, we demonstrated the proof-of-principle of in vivo detection of nucleic acid targets using a promising type of surface-enhanced Raman scattering (SERS) nanosensor implanted in the skin of a large animal model (pig). The in vivo nanosensor used in this study involves the “inverse molecular sentinel” detection scheme using plasmonics-active nanostars, which have tunable absorption bands in the near infrared region of the “tissue optical window”, rendering them efficient as an optical sensing platform for in vivo optical detection. Ex vivo measurements were also performed using human skin grafts to demonstrate the detection of SERS nanosensors through tissue. In this study, a new core–shell nanorattle probe with Raman reporters trapped between the core and shell was utilized as an internal standard system for self-calibration. These results illustrate the usefulness and translational potential of the SERS nanosensor for in vivo biosensing.

Open image in new window

     

Stacking graphic elements to avoid over-plotting

An ongoing challenge for information visualization is how to deal with over-plotting forced by ties or the relatively limited visual field of display devices. A popular solution is to represent local data density with area (bubble plots, treemaps), color (heatmaps), or aggregation (histograms, kernel densities, pixel displays). All of these methods have at least one of three deficiencies:1) magnitude judgments are biased because area and color have convex downward perceptual functions, 2) area, hue, and brightness have relatively restricted ranges of perceptual intensity compared to length representations, and/or 3) it is difficult to brush or link to individual cases when viewing aggregations. In this paper, we introduce a new technique for visualizing and interacting with datasets that preserves density information by stacking overlapping cases. The overlapping data can be points or lines or other geometric elements, depending on the type of plot. We show real-dataset applications of this stacking paradigm and compare them to other techniques that deal with over-plotting in high-dimensional displays.     

Visualization of diversity in large multivariate data sets

Understanding the diversity of a set of multivariate objects is an important problem in many domains, including ecology, college admissions, investing, machine learning, and others. However, to date, very little work has been done to help users achieve this kind of understanding. Visual representation is especially appealing for this task because it offers the potential to allow users to efficiently observe the objects of interest in a direct and holistic way. Thus, in this paper, we attempt to formalize the problem of visualizing the diversity of a large (more than 1000 objects), multivariate (more than 5 attributes) data set as one worth deeper investigation by the information visualization community. In doing so, we contribute a precise definition of diversity, a set of requirements for diversity visualizations based on this definition, and a formal user study design intended to evaluate the capacity of a visual representation for communicating diversity information. Our primary contribution, however, is a visual representation, called the Diversity Map, for visualizing diversity. An evaluation of the Diversity Map using our study design shows that users can judge elements of diversity consistently and as or more accurately than when using the only other representation specifically designed to visualize diversity.     

Recognition and analysis of cell nuclear phases for high-content screening based on morphological features

Automated analysis of molecular images has increasingly become an important research in computational life science. In this paper some new and efficient algorithms for recognizing and analyzing cell phases of high-content screening are presented. The conceptual frameworks are based on the morphological features of cell nuclei. The useful preprocessing includes: smooth following and linearization; extraction of morphological structural points; shape recognition based morphological structure; issue of touching cells for cell separation and reconstruction. Furthermore, the novel detecting and analyzing strategies of feed-forward and feed-back of cell phases are proposed based on gray feature, cell shape, geometrical features and difference information of corresponding neighbor frames. Experiment results tested the efficiency of the new method.     

Fuzzy posterior-probabilistic fusion

The paradigm of the permanence of updating ratios, which is a well-proven concept in experimental engineering approximation, has recently been utilized to construct a probabilistic fusion approach for combining knowledge from multiple sources. This ratio-based probabilistic fusion, however, assumes the equal contribution of attributes of diverse evidences. This paper introduces a new framework of a fuzzy probabilistic data fusion using the principles of the permanence of ratios paradigm, and the theories of fuzzy measures and fuzzy integrals. The fuzzy sub-fusion of the proposed approach allows an effective model for incorporating evidence importance and interaction.     

Robust control via concave minimization local and global algorithms

This paper is concerned with the robust control problem of linear fractional representation (LFT) uncertain systems depending on a time-varying parameter uncertainty. Our main result exploits a linear matrix inequality (LMI) characterization involving scalings and Lyapunov variables subject to an additional essentially nonconvex algebraic constraint. The nonconvexity enters the problem in the form of a rank deficiency condition or matrix inverse relation on the scalings only. It is shown that such problems, but also more generally rank inequalities and bilinear constraints, can be formulated as the minimization of a concave functional subject to LMI constraints. First of all, a local Frank and Wolfe (1956) feasible direction algorithm is introduced in this context to tackle this hard optimization problem. Exploiting the attractive concavity structure of the problem, several efficient global concave programming methods are then introduced and combined with the local feasible direction method to secure and certify global optimality of the solutions. Computational experiments indicate the viability of our algorithms, and in the worst case, they require the solution of a few LMI programs     

Flexible and Autonomous Integrated System for Characterizing Metal Oxide Gas Sensor Response in Dynamic Environment

Characterization and calibration of gas sensor is a complex problem due to the dynamic behavior of gases and the limitations of current technology. This article reports a flexible, robust, and autonomous integrated system that is able to perform characterization on metal oxide-based gas sensors in dynamic environments. The system controls the concentration and flow of the relevant gases into the gas chamber and simultaneously measuring the sensor response. This feature allows the characterization of the sensor under continuous dynamic flow of gases similar to conditions on a robot or flow pipes. Several experiments have been performed on the system using hydrogen sulfide. The results provide information on the general characteristics of the sensor as well as its sensitivity. The noise levels were studied with different reference voltages. Overall, the results verify that the system is reliable and able to produce repeatable measurements.     

Genetic algorithms for match-up rescheduling of the flexible manufacturing systems

Scheduling plays a vital role in ensuring the effectiveness of the production control of a flexible manufacturing system (FMS). The scheduling problem in FMS is considered to be dynamic in its nature as new orders may arrive every day. The new orders need to be integrated with the existing production schedule immediately without disturbing the performance and the stability of existing schedule. Most FMS scheduling methods reported in the literature address the static FMS scheduling problems. In this paper, rescheduling methods based on genetic algorithms are described to address arrivals of new orders. This study proposes genetic algorithms for match-up rescheduling with non-reshuffle and reshuffle strategies which accommodate new orders by manipulating the available idle times on machines and by resequencing operations, respectively. The basic idea of the match-up approach is to modify only a part of the initial schedule and to develop genetic algorithms (GAs) to generate a solution within the rescheduling horizon in such a way that both the stability and performance of the shop floor are kept. The proposed non-reshuffle and reshuffle strategies have been evaluated and the results have been compared with the total-rescheduling method.     

A spatially constrained fuzzy hyper-prototype clustering algorithm

We present in this paper a fuzzy clustering algorithm which can handle spatially constraint problems often encountered in pattern recognition. The proposed method is based on the notions of hyperplanes, the fuzzy c-means, and spatial constraints. By adding a spatial regularizer into the fuzzy hyperplane-based objective function, the proposed method can take into account additionally important information of inherently spatial data. Experimental results have demonstrated that the proposed algorithm achieves superior results to some other popular fuzzy clustering models, and has potential for cluster analysis in spatial domain.     

Supervised restoration of degraded medical images using multiple-point geostatistics

Reducing noise in medical images has been an important issue of research and development for medical diagnosis, patient treatment, and validation of biomedical hypotheses. Noise inherently exists in medical and biological images due to the acquisition and transmission in any imaging devices. Being different from image enhancement, the purpose of image restoration is the process of removing noise from a degraded image in order to recover as much as possible its original version. This paper presents a statistically supervised approach for medical image restoration using the concept of multiple-point geostatistics. Experimental results have shown the effectiveness of the proposed technique which has potential as a new methodology for medical and biological image processing.