Search

Objective: Insulin-induced hypoglycemia is recognized as a critical problem for diabetic patients, especially at night. To give glucose prediction and advance warning of hypoglycemia of at least 30 minutes, various glucose-insulin models have been proposed. Recognizing the complementary nature of the models, this research proposes a Glucose-Insulin Mixture (GIM) model to predict the glucose values for hypoglycemia detection, by optimally fusing different models with its adjusted parameters to address the inter- and intra-individual variability. Methods: Two types of classic glucose-insulin models, the Ruan model, with single-compartment glucose kinetics, and the Hovorka model, with two-compartment glucose kinetics, are selected as two candidate models. Based on Bayesian inference, GIM is introduced with quantified contributions from the models with the associated parameters. GIM is then applied to predict the glucose values and hypoglycemia events. Results: The proposed model is validated by the nocturnal glucose data collected from 12 participants with type 1 diabetes. The GIM model has promising fitting of RMSE within 0.3465 mmol/L and predicting of RMSE within 0.5571 mmol/L. According to the literature, the hypoglycemia is defined as 3.9 mmol/L, and the GIM model shows good short-term hypoglycemia prediction performance with the data collected within the last hour (accuracy: 95.97%, precision: 91.77%, recall: 95.60%). In addition, the probability of hypoglycemia event in 30 minutes is inferred. Conclusion: GIM, by fusing various glucose-insulin models via Bayesian inference, has the promise to capture glucose dynamics and predict hypoglycemia. Significance: GIM based short-term hypoglycemia prediction has potential clinical utility for timely intervention. [ABSTRACT FROM AUTHOR]

Image synthesis is a novel solution in precision medicine for scenarios where important medical imaging is not otherwise available. The convolutional neural network (CNN) is an ideal model for this task because of its powerful learning capabilities through the large number of layers and trainable parameters. In this research, we propose a new architecture of residual inception encoder–decoder neural network (RIED-Net) to learn the nonlinear mapping between the input images and targeting output images. To evaluate the validity of the proposed approach, it is compared with two models from the literature: synthetic CT deep convolutional neural network (sCT-DCNN) and shallow CNN, using both an institutional mammogram dataset from Mayo Clinic Arizona and a public neuroimaging dataset from the Alzheimer's Disease Neuroimaging Initiative. Experimental results show that the proposed RIED-Net outperforms the two models on both datasets significantly in terms of structural similarity index, mean absolute percent error, and peak signal-to-noise ratio. [ABSTRACT FROM AUTHOR]

This paper presents a Coevolutionary Structure-Redesigned-Based Bacteria Foraging Optimization (CSRBFO) based on the natural phenomenon that most living creatures tend to cooperate with each other so as to fulfill tasks more effectively. Aiming at lowering computational complexity while maintaining the critical search capability of standard bacterial foraging optimization (BFO), we employ a general loop to replace the nested loop and eliminate the reproduction step of BFO. Hence, the proposed CSRBFO only consists of two main steps: (1) chemotaxis and (2) elimination & dispersal. A coevolutionary strategy by which all bacteria can learn from each other and search for optima cooperatively is incorporated into the chemotactic step to accelerate convergence and facilitate accurate search. In the elimination & dispersal step, the three-stage evolutionary strategy with different learning methods for maintaining diversity is studied. An evaluation of the convergence status is then added to determine whether bacteria should move on to the next stage or not. The combination of coevolutionary strategy and convergence status evaluation is expected to balance exploration and exploitation. Experimental results comparing seven well-known heuristic algorithms on 24 benchmark functions demonstrate that the proposed CSRBFO outperforms the comparison algorithms significantly in most of the cases. [ABSTRACT FROM AUTHOR]

The identification of small structures (blobs) from medical images to quantify clinically relevant features, such as size and shape, is important in many medical applications. One particular application explored here is the automated detection of kidney glomeruli after targeted contrast enhancement and magnetic resonance imaging. We propose a computationally efficient algorithm, termed the Hessian-based Difference of Gaussians (HDoG), to segment small blobs (e.g. glomeruli from kidney) from 3D medical images based on local convexity, intensity and shape information. The image is first smoothed and pre-segmented into small blob candidate regions based on local convexity. Two novel 3D regional features (regional blobness and regional flatness) are then extracted from the candidate regions. Together with regional intensity, the three features are used in an unsupervised learning algorithm for auto post-pruning. HDoG is first validated in a 2D form and compared with other three blob detectors from literature, which are generally for 2D images only. To test the detectability of blobs from 3D images, 240 sets of simulated images are rendered for scenarios mimicking the renal nephron distribution observed in contrast-enhanced, 3D MRI. The results show a satisfactory performance of HDoG in detecting large numbers of small blobs. Two sets of real kidney 3D MR images (6 rats, 3 human) are then used to validate the applicability of HDoG for glomeruli detection. By comparing MRI to stereological measurements, we verify that HDoG is a robust and efficient unsupervised technique for 3D blobs segmentation. [ABSTRACT FROM AUTHOR]

Recent advances in medical imaging technology have greatly enhanced imaging-based diagnosis which requires computational effective and accurate algorithms to process the images (e.g., measure the objects) for quantitative assessment. In this research, we are interested in one type of imaging objects: small blobs. Examples of small blob objects are cells in histopathology images, glomeruli in MR images, etc. This problem is particularly challenging because the small blobs often have inhomogeneous intensity distribution and an indistinct boundary against the background. Yet, in general, these blobs have similar sizes. Motivated by this finding, we propose a novel detector termed Hessian-based Laplacian of Gaussian (HLoG) using scale space theory as the foundation. Like most imaging detectors, an image is first smoothed via LoG. Hessian analysis is then launched to identify the single optimal scale on which a presegmentation is conducted. The advantage of the Hessian process is that it is capable of delineating the blobs. As a result, regional features can be retrieved. These features enable an unsupervised clustering algorithm for postpruning which should be more robust and sensitive than the traditional threshold-based postpruning commonly used in most imaging detectors. To test the performance of the proposed HLoG, two sets of 2-D grey medical images are studied. HLoG is compared against three state-of-the-art detectors: generalized LoG, Radial-Symmetry and LoG using precision, recall, and F-score metrics. We observe that HLoG statistically outperforms the compared detectors. [ABSTRACT FROM AUTHOR]

Exceptional opportunities exist for researchers and practitioners to invest in conducting innovative and transformative research in data mining and health informatics. This IEEE Intelligent Systems "Trends and Controversies" (T&C) department hopes to raise awareness and highlight recent research to move toward such goals. The introduction, "Healthcare Intelligence: Turning Data into Knowledge," is written by Hui Yang and Erhun Kundakcioglu. Next, "Empowering Excellence of Care by Radiology Informatics" is written by Jing Li, Teresa Wu, J. Ross Mitchell, Amy K. Hara, William Pavlicek, Leland S. Hu, Alvin C. Silva, and Christine M. Zwart. Third, "Opportunities for Operations Research in Medical Decision Making" is written by Sait Tunc, Oguzhan Alagoz, and Elizabeth Burnside. Fourth, "Diagnostic Network Modeling of Neural Connectivity Using Functional Magnetic Resonance Imaging" is written by W. Art Chaovalitwongse, Georgiy Presnyakov, Yulian Cao, Sirirat Sujitnapitsatham, Daehan Won, Tara Madhyastha, Kurt E. Weaver, Paul R. Borghesani, and Thomas J. Grabowski. The final article, "Spatial Clustering in Public Health: Advances and Challenges," is written by Lianjie Shu, Man Ho Ling, Shui-Yee Wong, and Kwok-Leung Tsui. [ABSTRACT FROM AUTHOR]

In today's highly dynamic and competitive environment, companies are under the pressure to improve their supply chain strategy in order to be more responsive to customer demand. However, supply chains are susceptible to unanticipated events that make responsive supply chain management a challenging task. One such disruption event is a product stockout at the retailer. In this paper, we investigate retail stockouts through the development of an agent-based simulation model in order to develop a better understanding of the effect of different stockout lengths for different products (with different consumer response profiles to stockouts) on both the retailer and the manufacturer of the product. We consider the change of market share as a measure of resilience for both the manufacturer and the retailer to examine the impact of the stockout. Insights are developed for manufacturers and retailers in responding to the stockout disruption. [ABSTRACT FROM PUBLISHER]

Particle swarm optimization (PSO) has attracted much attention and has been applied to many scientific and engineering applications in the last decade. Most recently, an intelligent augmented particle swarm optimization with multiple adaptive methods (PSO-MAM) was proposed and was demonstrated to be effective for diverse functions. However, inherited from PSO, the performance of PSO-MAM heavily depends on the settings of three parameters: the two learning factors and the inertia weight. In this paper, we propose a parameter control mechanism to adaptively change the parameters and thus improve the robustness of PSO-MAM. A new method, adaptive PSO-MAM (APSO-MAM) is developed that is expected to be more robust than PSO-MAM. We comprehensively evaluate the performance of APSO-MAM by comparing it with PSO-MAM and several state-of-the-art PSO algorithms and evolutionary algorithms. The proposed parameter control method is also compared with several existing parameter control methods. The experimental results demonstrate that APSO-MAM outperforms the compared PSO algorithms and evolutionary algorithms, and is more robust than PSO-MAM. [ABSTRACT FROM AUTHOR]

Structure learning of Bayesian Networks (BNs) is an important topic in machine learning. Driven by modern applications in genetics and brain sciences, accurate and efficient learning of large-scale BN structures from high-dimensional data becomes a challenging problem. To tackle this challenge, we propose a Sparse Bayesian Network (SBN) structure learning algorithm that employs a novel formulation involving one L1-norm penalty term to impose sparsity and another penalty term to ensure that the learned BN is a Directed Acyclic Graph (DAG)—a required property of BNs. Through both theoretical analysis and extensive experiments on 11 moderate and large benchmark networks with various sample sizes, we show that SBN leads to improved learning accuracy, scalability, and efficiency as compared with 10 existing popular BN learning algorithms. We apply SBN to a real-world application of brain connectivity modeling for Alzheimer's disease (AD) and reveal findings that could lead to advancements in AD research. [ABSTRACT FROM AUTHOR]

The facility location problem has been studied in many industries including banking network, chain stores, and wireless network. Maximal covering location problem (MCLP) is a general model for this type of problems. Motivated by a real-world banking facility optimization project, we propose an enhanced MCLP model which captures the important features of this practical problem, namely, varied costs and revenues, multitype facilities, and flexible coverage functions. To solve this practical problem, we apply an existing hybrid nested partitions algorithm to the large-scale situation. We further use heuristic-based extensions to generate feasible solutions more efficiently. In addition, the upper bound of this problem is introduced to study the quality of solutions. Numerical results demonstrate the effectiveness and efficiency of our approach. [ABSTRACT FROM AUTHOR]

Electronic messaging protocols such as RosettaNet (RN) automate the asynchronous exchange of business documents between collaborating trading partners over the Internet. Such protocols commonly employ mechanisms such as retries, time-outs, and fault handling to overcome uncertainty in the timing and reliability of message transmission, receipt, and processing. To determine the reliability and performance of such a protocol under varying network and message processing conditions, we have developed reusable patterns for Petri net modeling of these common mechanisms and used them to assemble a timed Petri net simulation that represents the RN standard's behavior. The reusable patterns are derived through translation of the abstract representations provided in the RN standard into an executable model, paving the way for a multimodeling approach for supply chain communications. The resulting stochastic Petri net is simulated to generate performance curves guiding improved protocol reliability. [ABSTRACT FROM AUTHOR]

With an increased focus on collaborative design for success in global markets, there is a need for a negotiation mechanism for designs distributed over autonomous stakeholders. This paper utilizes the unit price of the design variables as a medium for negotiation between autonomous and self-interested design participants represented by design agents (DAs). An artificial agent-the facilitator agent (FA), maximizes the overall utility of the design as a function of the prices of the design variables, and guides the design toward global feasibility. By relating the FA's price space to the DAs' design space through price-variable curves, a negotiation platform is developed and tested. [ABSTRACT FROM AUTHOR]

Machine learning tools aid many Alzheimer's disease-related investigations by enabling multisource data fusion and biomarker identification as well as analysis of functional brain connectivity. [ABSTRACT FROM PUBLISHER]