这项工作提出了一种基于形态重建和启发式方法的聚集算法，称为K-Morphological集合（K-MS）。在最坏情况下，K-MS比CPU并行K-均值快，并且可以增强数据集的可视化以及非常不同的聚类。它也比对密度和形状（例如有丝分裂和三升）敏感的类似聚类方法更快。另外，K-MS是确定性的，具有最大簇的内在含义，可以为给定的输入样本和输入参数创建，与K-均值和其他聚类算法不同。换句话说，给定恒定的k，一个结构元素和数据集，k-ms会在不使用随机/伪随机函数的情况下产生K或更少的簇。最后，所提出的算法还提供了一种简单的手段，可以从图像或数据集中删除噪声。

这项工作提出了使用遗传算法（GA）在追踪和识别使用计算机断层扫描（CT）图像的人心包轮廓的过程中。我们假设心包的每个切片都可以通过椭圆建模，椭圆形需要最佳地确定其参数。最佳椭圆将是紧随心包轮廓的紧密椭圆形，因此，将人心脏的心外膜和纵隔脂肪适当地分开。追踪和自动识别心包轮廓辅助药物的医学诊断。通常，由于所需的努力，此过程是手动完成或根本不完成的。此外，检测心包可能会改善先前提出的自动化方法，这些方法将与人心脏相关的两种类型的脂肪分开。这些脂肪的量化提供了重要的健康风险标记信息，因为它们与某些心血管病理的发展有关。最后，我们得出的结论是，GA在可行数量的处理时间内提供了令人满意的解决方案。

我们提出了一种方法，以使用回归算法来预测计算机断层扫描图像中心外膜和纵隔脂肪体积。获得的结果表明，可以高度相关性预测这些脂肪是可行的，从而减轻了两种脂肪体积的手动或自动分割的需求。取而代之的是，仅分割其中一个就足够了，而另一个则可以相当准确地预测。使用MLP回归器通过旋转森林算法获得的相关系数预测基于心外膜脂肪的纵隔脂肪的相关系数为0.9876，相对绝对误差为14.4％，根相对平方误差为15.7％。基于纵隔的心外膜脂肪预测中获得的最佳相关系数为0.9683，相对绝对误差为19.6％，相对平方误差为24.9％。此外，我们分析了使用线性回归器的可行性，该回归器提供了对基础近似值的直观解释。在这种情况下，根据心外膜预测纵隔脂肪的相关系数为0.9534，相对绝对误差为31.6％，根相对平方误差为30.1％。关于基于纵隔脂肪的心外膜脂肪的预测，相关系数为0.8531，相对绝对误差为50.43％，根相对平方误差为52.06％。总而言之，有可能加快一般医学分析以及通过使用这种预测方法在最新技术中采用的一些细分和量化方法，从而降低成本，因此可以实现预防治疗减少健康问题。

早期发现视网膜疾病是预防患者部分或永久失明的最重要手段之一。在这项研究中，提出了一种新型的多标签分类系统，用于使用从各种来源收集的眼底图像来检测多种视网膜疾病。首先，使用许多公开可用的数据集来构建一个新的多标签视网膜疾病数据集，即梅里德数据集。接下来，应用了一系列后处理步骤，以确保图像数据的质量和数据集中存在的疾病范围。在眼底多标签疾病分类中，首次通过大量实验优化的基于变压器的模型用于图像分析和决策。进行了许多实验以优化所提出的系统的配置。结果表明，在疾病检测和疾病分类方面，该方法的性能比在同一任务上的最先进作品要好7.9％和8.1％。获得的结果进一步支持了基于变压器的架构在医学成像领域的潜在应用。

这项工作提出了一种名为形态学分类器（MC）的新型分类器。 MCS汇总数学形态学和监督学习的概念。该聚集的结果是可能在选择停止标准和结构元件的选择之外地保持类的形状特征的分类器。 MCS基本上基于集合理论，其分类模型可以是数学集本身。在当前的工作中提出了两种类型的形态分类剂，即形态学K-NN（MKNN）和形态扩张分类器（MDC），其证明了方法的可行性。这项工作提供了有关MCS的优势的证据，例如，非常快速的分类时间以及竞争精度率。使用P-Dimensional数据集测试MKNN和MDC的性能。在8个数据集中的5个中，MCS绑定或表现优于14种成熟的分类器。在所有场合，所获得的精度高于所有分类器获得的平均精度。此外，所提出的实施方式利用图形处理单元（GPU）的功率来加速处理。

Accurate determination of a small molecule candidate (ligand) binding pose in its target protein pocket is important for computer-aided drug discovery. Typical rigid-body docking methods ignore the pocket flexibility of protein, while the more accurate pose generation using molecular dynamics is hindered by slow protein dynamics. We develop a tiered tensor transform (3T) algorithm to rapidly generate diverse protein-ligand complex conformations for both pose and affinity estimation in drug screening, requiring neither machine learning training nor lengthy dynamics computation, while maintaining both coarse-grain-like coordinated protein dynamics and atomistic-level details of the complex pocket. The 3T conformation structures we generate are closer to experimental co-crystal structures than those generated by docking software, and more importantly achieve significantly higher accuracy in active ligand classification than traditional ensemble docking using hundreds of experimental protein conformations. 3T structure transformation is decoupled from the system physics, making future usage in other computational scientific domains possible.

Variational autoencoders model high-dimensional data by positing low-dimensional latent variables that are mapped through a flexible distribution parametrized by a neural network. Unfortunately, variational autoencoders often suffer from posterior collapse: the posterior of the latent variables is equal to its prior, rendering the variational autoencoder useless as a means to produce meaningful representations. Existing approaches to posterior collapse often attribute it to the use of neural networks or optimization issues due to variational approximation. In this paper, we consider posterior collapse as a problem of latent variable non-identifiability. We prove that the posterior collapses if and only if the latent variables are non-identifiable in the generative model. This fact implies that posterior collapse is not a phenomenon specific to the use of flexible distributions or approximate inference. Rather, it can occur in classical probabilistic models even with exact inference, which we also demonstrate. Based on these results, we propose a class of latent-identifiable variational autoencoders, deep generative models which enforce identifiability without sacrificing flexibility. This model class resolves the problem of latent variable non-identifiability by leveraging bijective Brenier maps and parameterizing them with input convex neural networks, without special variational inference objectives or optimization tricks. Across synthetic and real datasets, latent-identifiable variational autoencoders outperform existing methods in mitigating posterior collapse and providing meaningful representations of the data.

Differentiable Architecture Search (DARTS) has attracted considerable attention as a gradient-based Neural Architecture Search (NAS) method. Since the introduction of DARTS, there has been little work done on adapting the action space based on state-of-art architecture design principles for CNNs. In this work, we aim to address this gap by incrementally augmenting the DARTS search space with micro-design changes inspired by ConvNeXt and studying the trade-off between accuracy, evaluation layer count, and computational cost. To this end, we introduce the Pseudo-Inverted Bottleneck conv block intending to reduce the computational footprint of the inverted bottleneck block proposed in ConvNeXt. Our proposed architecture is much less sensitive to evaluation layer count and outperforms a DARTS network with similar size significantly, at layer counts as small as 2. Furthermore, with less layers, not only does it achieve higher accuracy with lower GMACs and parameter count, GradCAM comparisons show that our network is able to better detect distinctive features of target objects compared to DARTS.

Deep learning techniques with neural networks have been used effectively in computational fluid dynamics (CFD) to obtain solutions to nonlinear differential equations. This paper presents a physics-informed neural network (PINN) approach to solve the Blasius function. This method eliminates the process of changing the non-linear differential equation to an initial value problem. Also, it tackles the convergence issue arising in the conventional series solution. It is seen that this method produces results that are at par with the numerical and conventional methods. The solution is extended to the negative axis to show that PINNs capture the singularity of the function at $\eta=-5.69$

The Government of Kerala had increased the frequency of supply of free food kits owing to the pandemic, however, these items were static and not indicative of the personal preferences of the consumers. This paper conducts a comparative analysis of various clustering techniques on a scaled-down version of a real-world dataset obtained through a conjoint analysis-based survey. Clustering carried out by centroid-based methods such as k means is analyzed and the results are plotted along with SVD, and finally, a conclusion is reached as to which among the two is better. Once the clusters have been formulated, commodities are also decided upon for each cluster. Also, clustering is further enhanced by reassignment, based on a specific cluster loss threshold. Thus, the most efficacious clustering technique for designing a food kit tailored to the needs of individuals is finally obtained.