Focus: A Multifaceted Battle Against Cancer: Extracting Knowledge from Chemical Imaging Data Using Computational Algorithms for Digital Cancer Diagnosis

Fourier transform infrared (FTIR) spectroscopic imaging is an emerging microscopy modality for clinical histopathologic diagnoses as well as for biomedical research. Spectral data recorded in this modality are indicative of the underlying, spatially resolved biochemical composition but need computerized algorithms to digitally recognize and transform this information to a diagnostic tool to identify cancer or other physiologic conditions. Statistical pattern recognition forms the backbone of these recognition protocols and can be used for highly accurate results. Aided by biochemical correlations with normal and diseased states and the power of modern computer-aided pattern recognition, this approach is capable of combating many standing questions of traditional histology-based diagnosis models. For example, a simple diagnostic test can be developed to determine cell types in tissue. As a more advanced application, IR spectral data can be integrated with patient information to predict risk of cancer, providing a potential road to precision medicine and personalized care in cancer treatment. The IR imaging approach can be implemented to complement conventional diagnoses, as the samples remain unperturbed and are not destroyed. Despite high potential and utility of this approach, clinical implementation has not yet been achieved due to practical hurdles like speed of data acquisition and lack of optimized computational procedures for extracting clinically actionable information rapidly. The latter problem has been addressed by developing highly efficient ways to process IR imaging data but remains one that has considerable scope for progress. Here, we summarize the major issues and provide practical considerations in implementing a modified Bayesian classification protocol for digital molecular pathology. We hope to familiarize readers with analysis methods in IR imaging data and enable researchers to develop methods that can lead to the use of this promising technique for digital diagnosis of cancer.     

Frequency-dependent conspecific attraction to food patches

In many ecological situations, resources are difficult to find but become more apparent to nearby searchers after one of their numbers discovers and begins to exploit them. If the discoverer cannot monopolize the resources, then others may benefit from joining the discoverer and sharing their discovery. Existing theories for this type of conspecific attraction have often used very simple rules for how the decision to join a discovered resource patch should be influenced by the number of individuals already exploiting that patch. We use a mechanistic, spatially explicit model to demonstrate that individuals should not necessarily simply join patches more often as the number of individuals exploiting the patch increases, because those patches are likely to be exhausted soon or joining them will intensify future local competition. Furthermore, we show that this decision should be sensitive to the nature of the resource patches, with individuals being more responsive to discoveries in general and more tolerant of larger numbers of existing exploiters on a patch when patches are resource-rich and challenging to locate alone. As such, we argue that this greater focus on underlying joining mechanisms suggests that conspecific attraction is a more sophisticated and flexible tactic than currently appreciated.     

Evolutionary epistemology as an overlapping,interlevel theory

I examine the branch of evolutionary epistemology which tries to account for the character of cognitive mechanisms in animals and humans by extending the biological theory of evolution to the neurophysiological substrates of cognition. Like Plotkin, I construe this branch as a struggling science, and attempt to characterize the sort of theory one might expect to find this truly interdisciplinary endeavor, an endeavor which encompasses not only evolutionary biology, cognitive psychology, and developmental neuroscience, but also and especially, the computational modeling of artificial life programming; I suggest that extending Schaffner's notion of interlevel theories to include both horizontal and vertical levels of abstraction best fits the theories currently being developed in cognitive science. Finally, I support this claim with examples drawn from computational modeling data using the genetic algorithm.     

北部湾茅尾海无瓣海桑红树林地上生物量反演——基于XGBoost机器学习算法

无瓣海桑是广西从自治区外引进的外来红树林树种,采用定量化算法精确估算无瓣海桑地上生物量对红树林生态修复以及海洋蓝碳监测提供经验和方法。论文以广西茅尾海自然保护区无瓣海桑红树林为研究对象,以野外实测无瓣海桑红树林地上生物量数据和Sentinel-1/2卫星提取的后向散射数据、波段数据、植被指数数据和纹理指数数据为数据源,通过分析各遥感因子与实测红树林地上生物量之间的重要性关系,采用极端梯度提升(XGBoost)机器学习算法对比了不同的变量组合对模型精度的影响,最后基于优选的变量组合反演了无瓣海桑红树林的地上生物量。结果表明：(1)研究区无瓣海桑红树林实测树高范围为1.55—13.58m,平均值为8.37m,胸径范围为0.7—41cm,平均值为15.62cm;(2)通过XGBoost算法优选的21个特征变量组合模型拟合效果较好,其模型在测试阶段R²=0.7237,RMSE=21.70Mg/hm²。XGBoost算法反演研究区无瓣海桑地上生物量介于19.14—138.46Mg/hm²之间,平均值为51.92Mg/hm^...     

FINGAR: A new genetic algorithm-based method for fitting NMR data

Summary A new NMR refinement method, FINGAR (FIt NMR using a Genetic AlgoRithm), has been developed, which allows one to determine a weighted set of structures that best fits measured NMR-derived data. This method shows appreciable advantages over commonly used refinement methods. FINGAR generates an ensemble of conformations whose average reproduces the experimental NMR-derived restraints. In addition, a statistical importance weight is assigned to each of the conformations in the ensemble. As a result, one is not limited to simply presenting an envelope of sampled conformers. Instead, one can subsequently focus on a select few conformers of high weight. This is critical, because many structural analyses depend on using discrete conformations, not simply averages or ensembles. The genetic algorithm used by FINGAR allows one to simultaneously and reliably fit against many restraints, and to generate solutions which include as many conformations with non-zero weights as are necessary to generate the best fit. An added benefit of FINGAR is that because the time-consuming step in this method needs only to be performed once, in the beginning of the first run, numerous FINGAR simulations can be performed rapidly.