Precise determination of HER2 subtype is essential for selecting appropriate targeted therapies in breast cancer. However, current HER2 assessment methods remain dependent on invasive tissue biopsies, which are limited by tumor heterogeneity and sampling bias. To address these challenges, this paper proposes a knowledge-guided multi-modal neural network (KMNet) for non-invasive HER2 subtyping by integrating clinical data and ultrasound images. KMNet introduces a Graph-based Clinical Feature encoder (GCF), which constructs a causal graph among clinical indicators based on medical knowledge and extracts high-order feature relationships via the Graph Convolutional Network (GCN). Meanwhile, the Convolutional Neural Network (CNN) and Vision Transformer (ViT)-based hybrid image encoder (CVUIF) captures both local details (calcifications and blood flow) and global dependencies between intra- and peritumoral regions. In addition, the Reduced Dimensional Fusion (RDF) module integrates key information from clinical graph features, ultrasound image features, and structured clinical data to construct a unified multi-modal representation for downstream HER2 subtyping task. Experiments were conducted on the private datasets (HER2USC) and the public datasets (BCW, BCa and SIIM-ISIC). Experimental results demonstrate that KMNet outperformed other reported state-of-the-art multi- modal algorithms in HER2 subtyping task, offering strong potential for clinical decision support in breast cancer treatment.

The theory of "three-stage prevention" in view of the body constitution is the key technology of modern Chinese medicine for "Preventive Treatment of Diseases". In particular, automated body constitution recognition (BCR) is an integral part of intelligent Traditional Chinese Medicine (TCM), which is extremely valuable for disease prevention and diagnosis. Actually, BCR is a challenging multi-label recognition task by the TCM composite constitution theory. First, two new databases are constructed, one is a multi-label facial body constitution (MFBC), and another is a multi-label tongue body constitution (MTBC). Second, a novel MLP-like architecture, named Chaos-MLP, is designed for the BCR task, which interacts with the channel chaotic features of extracted medical images and fuses them with the width and height channel direction features, respectively. Notably, the chaotic transform can enhance the distinguishability of extracted features from the medical images. Moreover, we propose a binary center cognitive gravity loss (BCCGL) to enhance the learning ability of the Chaos-MLP for unbalanced body constitution labels. Our proposed method shows superior performance on both MFBC and MTBC datasets than other state-of-the-art (SOTA) MLP-like networks and a vision graph-based neural network (VGNN), which include Wave-MLP, Cycle-MLP, Vip, and Active-MLP.

In this study, we investigate two different types of duopolistic competitive assortment problems under the multinomial logit model: (1) In simultaneous assortment competition, both retailers make strategic decisions and offer assortments simultaneously. The objective is to identify an assortment strategy profile that prevents unilateral and profitable deviations by either retailer; (2) In sequential assortment competition, retailers sequentially offer assortments, with one round to each retailer. The objective is to determine the optimal strategy for the leader (first-moved retailer), with the follower (second-moved retailer) reacting optimally based on the leader's choice. We extend prior work by introducing a more general competitive model incorporating common products under the multinomial logit model, capable of capturing a variety of choice behaviors that appear in retailing scenarios, such as consumer loyalty and rarity effects.

Medical images such as facial and tongue images have been widely used for intelligence-assisted diagnosis, which can be regarded as the multi-label classification task for disease location (DL) and disease nature (DN) of biomedical images. Compared with complicated convolutional neural networks and Transformers for this task, recent MLP-like architectures are not only simple and less computationally expensive, but also have stronger generalization capabilities. However, MLP-like models require better input features from the image. Thus, this study proposes a novel convolution complex transformation MLP-like (CCT-MLP) model for the multi-label DL and DN recognition task for facial and tongue images. Notably, the convolutional Tokenizer and multiple convolutional layers are first used to extract the better shallow features from input biomedical images to make up for the loss of spatial information obtained by the simple MLP structure. Subsequently, the Channel-MLP architecture with complex transformations is used to extract deep-level contextual features. In this way, multi-channel features are extracted and mixed to perform the multi-label classification of the input biomedical images. Experimental results on our constructed multi-label facial and tongue image datasets demonstrate that our method outperforms existing methods in terms of both accuracy (Acc) and mean average precision (mAP).

Physical signs of patients indicate crucial evidence for diagnosing both location and nature of the disease, where there is a sequential relationship between the two tasks. Thus their joint learning can utilize intrinsic association by transferring related knowledge across relevant tasks. Choosing the right time to transfer is a critical problem for joint learning. However, how to dynamically adjust when tasks interact to capture the right time for transferring related knowledge is still an open issue. To this end, we propose a Task-Coupling Elastic Learning (TCEL) framework to model the task relatedness for classifying disease-location and disease-nature based on physical sign images. The main idea is to dynamically transfer relevant knowledge by progressively shifting task-coupling from loose to tight during the multi-stage training. In the early stage of training, we relax the constraints of modeling relations to focus more in learning the generic task-common features. In the later stage, the semantic guidance will be strengthened to learn the task-specific features. Specifically, a dynamic sequential module (DSM) is proposed to explicitly model the sequential relationship and enable multi-stage training. Moreover, to address the side effect of DSM, a new loss regularization is proposed. The extensive experiments on these two clinical datasets show the superiority of the proposed method over the baselines, and demonstrate the effectiveness of the proposed task-coupling elastic mechanism.

Online healthcare consultation offers people a convenient way to consult doctors. In this paper, we aim at building a generative dialog system for Chinese healthcare consultation. As the original Seq2seq architecture tends to suffer the issue of generating low-quality responses, the multi-source Seq2seq architecture generating more informative responses is much more preferred in this task. The multi-source Seq2seq architecture takes advantage of retrieval techniques to obtain responses from the database, and then takes these responses alongside the user-issued question as input. However, some of the retrieved responses might be not much related to the user-issued question, resulting in the generation of unsatisfying responses that are not correct in diagnosis or instead provide inappropriate advice on prevention or treatment. Therefore, this paper proposes multi-source Seq2seq guided by knowledge (MSSGK) to handle this problem. MSSGK differs from the multi-source Seq2seq architecture in that domain knowledge, including disease labels and topic labels about prevention and treatment, is introduced into the response generation via a multi-task learning framework. To better exploit the domain knowledge, we propose three attention mechanisms to provide more appropriate guidance for response generation. Experimental results on a dataset of real-world healthcare consultation show the effectiveness of the proposed method.

The tongue image provides important physical information of humans. It is of great importance for diagnoses and treatments in clinical medicine. Herbal prescriptions are simple, noninvasive, and have low side effects. Thus, they are widely applied in China. Studies on the automatic construction technology of herbal prescriptions based on tongue images have great significance for deep learning to explore the relevance of tongue images for herbal prescriptions, it can be applied to healthcare services in mobile medical systems. In order to adapt to the tongue image in a variety of photographic environments and construct herbal prescriptions, a neural network framework for prescription construction is designed. It includes single/double convolution channels and fully connected layers. Furthermore, it proposes the auxiliary therapy topic loss mechanism to model the therapy of Chinese doctors and alleviate the interference of sparse output labels on the diversity of results. The experiment use the real-world tongue images and the corresponding prescriptions and the results can generate prescriptions that are close to the real samples, which verifies the feasibility of the proposed method for the automatic construction of herbal prescriptions from tongue images. Also, it provides a reference for automatic herbal prescription construction from more physical information.

This work concerns the mechanism design for online scheduling in a strategic setting. In this setting, each job is owned by a self-interested agent who may misreport the release time, deadline, length, and value of her job, while we need to determine not only the schedule of the jobs, but also the payment of each agent. We focus on the design of incentive compatible (IC) mechanisms, and study the maximization of social welfare (i.e., the aggregated value of completed jobs) by competitive analysis. We first derive two lower bounds on the competitive ratio of any deterministic IC mechanism to characterize the landscape of our research: one bound is 5, which holds for equal-length jobs; the other bound is $\frac{\kappa}{\ln\kappa}+1-o(1)$, which holds for unequal-length jobs, where $\kappa$ is the maximum ratio between lengths of any two jobs. We then propose a deterministic IC mechanism and show that such a simple mechanism works very well for two models: (1) In the preemption-restart model, the mechanism can achieve the optimal competitive ratio of 5 for equal-length jobs and a near optimal ratio of $(\frac{1}{(1-\epsilon)^2}+o(1)) \frac{\kappa}{\ln\kappa}$ for unequal-length jobs, where $0<\epsilon<1$ is a small constant; (2) In the preemption-resume model, the mechanism can achieve the optimal competitive ratio of 5 for equal-length jobs and a near optimal competitive ratio (within factor 2) for unequal-length jobs.

Selfish routing is one of the fundamental models in the study of network traffic systems. While most literature assumes essentially static flows, game theoretical models of dynamic flows began to draw attention recently [1, 5].

This paper concerns the mechanism design for online scheduling in a strategic setting. In this setting, each job is owned by a self-interested agent who may misreport the release time, deadline, length, and value of her job, while we need to determine not only the schedule of the jobs, but also the payment of each agent. We focus on the design of incentive compatible (IC) mechanisms, and study the maximization of social welfare (i.e., the aggregated value of completed jobs) by competitive analysis. We first derive two lower bounds on the competitive ratio of any deterministic IC mechanism to characterize the landscape of our research. We then propose a deterministic IC mechanism and show that such a simple mechanism works very well for both the preemption-restart model and the preemption-resume model. We show the mechanism can achieve the optimal competitive ratio of 5 for equal-length jobs and a near optimal competitive ratio (within a constant factor) for unequal-length jobs.

We address the parallel machines scheduling problems when selling to a selfish customer population with heterogeneous time utility functions. The manufacturer, owning parallel machines resource, has some independent objective. Because of customers' selfishness, anarchistic competition would worsen the manufacturer's performance, and then, cause “Price of Anarchy”. On the other hand, the optimization of the manufacturer's objective would also deteriorate some customers' waiting costs greatly (and then, will harm seller himself in long term). In this paper, noncooperative game is used to model above multi-person multi-objective problem in parallel machine environment. Price of Anarchy is analyzed. To balance each participant's performance, a coordination mechanism which could generate an efficient schedule is provided by choosing payment to motivate all selfish customers to act as the manufacturer wishes. Numerical experiments on proposed coordination mechanism are given at last.