HEAT SINK FIXTURE DESIGNS FOR ROW-BASED COMPONENTS PROVIDING ENHANCED THERMAL PERFORMANCE

The installation of components in a row-wise arrangement on a printed circuit board (PCB) is a common occurrence in current switch design. However, with the increasing power dissipation of such components the use of heat sinks becomes necessary. Techniques are presented herein that support a new heat sink fixture design which handles components that are installed in a row. Aspects of the presented techniques consume a minimal amount of PCB area, support the use of a phase-change material (PCM), and are circuit trace friendly

A Causal Disentangled Multi-Granularity Graph Classification Method

Graph data widely exists in real life, with large amounts of data and complex structures. It is necessary to map graph data to low-dimensional embedding. Graph classification, a critical graph task, mainly relies on identifying the important substructures within the graph. At present, some graph classification methods do not combine the multi-granularity characteristics of graph data. This lack of granularity distinction in modeling leads to a conflation of key information and false correlations within the model. So, achieving the desired goal of a credible and interpretable model becomes challenging. This paper proposes a causal disentangled multi-granularity graph representation learning method (CDM-GNN) to solve this challenge. The CDM-GNN model disentangles the important substructures and bias parts within the graph from a multi-granularity perspective. The disentanglement of the CDM-GNN model reveals important and bias parts, forming the foundation for its classification task, specifically, model interpretations. The CDM-GNN model exhibits strong classification performance and generates explanatory outcomes aligning with human cognitive patterns. In order to verify the effectiveness of the model, this paper compares the three real-world datasets MUTAG, PTC, and IMDM-M. Six state-of-the-art models, namely GCN, GAT, Top-k, ASAPool, SUGAR, and SAT are employed for comparison purposes. Additionally, a qualitative analysis of the interpretation results is conducted

Polymorphisms of the _ENPP1_ gene are not associated with type 2 diabetes or obesity in the Chinese Han population

*Objective:* Type 2 Diabetes mellitus is a metabolic disorder characterized by chronic hyperglycemia and with a major feature of insulin resistance. Genetic association studies have suggested that _ENPP1_ might play a potential role in susceptibility to type 2 diabetes and obesity. Our study aimed to examine the association between _ENPP1_ and type 2 diabetes and obesity.

*Design:* Association study between two SNPs, rs1044498 (K121Q) and rs7754561 of ENPP1 and diabetes and obesity in the Chinese Han population.

*Subjects:* 1912 unrelated patients (785 male and 1127 female with a mean age 63.8 ± 9 years), 236 IFG/IGT subjects (83 male and 153 female with a mean age 64 ± 9 years) and 2041 controls (635 male and 1406 female with a mean age 58 ± 9 years).
 
*Measurements:* Subjects were genotyped for two SNPs using TaqMan technology on an ABI7900 system and tested by regression analysis.

*Results:* By logistic regression analysis, rs1044498 (K121Q) and rs7754561 showed no statistical association with type 2 diabetes, obesity under additive, dominant and recessive models either before or after adjusting for sex and age. Haplotype analysis found a marginal association of haplotype C-G (p=0.05) which was reported in the previous study.

*Conclusion:* Our investigation did not replicated the positive association found previously and suggested that the polymorphisms of _ENPP1_ might not play a major role in the susceptibility to type 2 diabetes or obesity in the Chinese Han population

Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems

The Frank-Wolfe (FW) method, which implements efficient linear oracles that minimize linear approximations of the objective function over a fixed compact convex set, has recently received much attention in the optimization and machine learning literature. In this paper, we propose a new FW-type method for minimizing a smooth function over a compact set defined as the level set of a single difference-of-convex function, based on new generalized linear-optimization oracles (LO). We show that these LOs can be computed efficiently with closed-form solutions in some important optimization models that arise in compressed sensing and machine learning. In addition, under a mild strict feasibility condition, we establish the subsequential convergence of our nonconvex FW-type method. Since the feasible region of our generalized LO typically changes from iteration to iteration, our convergence analysis is completely different from those existing works in the literature on FW-type methods that deal with fixed feasible regions among subproblems. Finally, motivated by the away steps for accelerating FW-type methods for convex problems, we further design an away-step oracle to supplement our nonconvex FW-type method, and establish subsequential convergence of this variant. Numerical results on the matrix completion problem with standard datasets are presented to demonstrate the efficiency of the proposed FW-type method and its away-step variant.Comment: We updated grant information and fixed some minor typos in Section