Search

A generic way to verify asymptotic optimality of semi-open-loop policies for a wide class of MDPs with large lead times. In many real-life inventory models, order lead times can result in uncertain effects of inventory decisions. However, as the lead time grows large, one would naturally postulate that the effect of the delayed order depends weakly on the current inventory level and, thus, intuit that decoupling the delayed order with the current inventory level may provide good heuristics. Motivated by these examples, in "Asymptotic Optimality of Semi-open-Loop Policies in Markov Decision Processes with Large Lead Times," Bai et al. consider a generic Markov decision process (MDP) with one delayed control and one immediate control. For MDPs defined on general spaces with uniformly bounded cost functions and a fast mixing property, they construct a periodic semi-open-loop policy for each lead time value and show that these policies are asymptotically optimal as the lead time goes to infinity. For MDPs defined on Euclidean spaces with linear dynamics and convex structures, they impose another set of conditions under which constant delayed-control policies are asymptotically optimal. We consider a generic Markov decision process (MDP) with two controls: one control taking effect immediately and the other control whose effect is delayed by a positive lead time. As the lead time grows, one naturally expects that the effect of the delayed action only weakly depends on the current state, and decoupling the delayed action from the current state could provide good controls. The purpose of this paper is to substantiate this decoupling intuition by establishing asymptotic optimality of semi-open-loop policies, which specify open-loop controls for the delayed action and closed-loop controls for the immediate action. For MDPs defined on general spaces with uniformly bounded cost functions and a fast mixing property, we construct a periodic semi-open-loop policy for each lead time value and show that these policies are asymptotically optimal as the lead time goes to infinity. For MDPs defined on Euclidean spaces with linear dynamics and convex structures (convex cost functions and constraint sets), we impose another set of conditions under which semi-open-loop policies (actually, constant delayed-control policies) are asymptotically optimal. Moreover, we verify that these conditions hold for a broad class of inventory models, in which there are multiple controls with nonidentical lead times. Funding: Research of the first three authors was partly supported by the National Science Foundation [Grant CMMI-1635160]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/opre.2021.0088. [ABSTRACT FROM AUTHOR]

Breast cancer is a heterogeneous disease and can be divided into several subtypes with unique prognostic and molecular characteristics. The classification of breast cancer subtypes plays an important role in the precision treatment and prognosis of breast cancer. Benefitting from the relation-aware ability of a graph convolution network (GCN), we present a multi-omics integrative method, the attention-based GCN (AGCN), for breast cancer molecular subtype classification using messenger RNA expression, copy number variation and deoxyribonucleic acid methylation multi-omics data. In the extensive comparative studies, our AGCN models outperform state-of-the-art methods under different experimental conditions and both attention mechanisms and the graph convolution subnetwork play an important role in accurate cancer subtype classification. The layer-wise relevance propagation (LRP) algorithm is used for the interpretation of model decision, which can identify patient-specific important biomarkers that are reported to be related to the occurrence and development of breast cancer. Our results highlighted the effectiveness of the GCN and attention mechanisms in multi-omics integrative analysis and the implement of the LRP algorithm can provide biologically reasonable insights into model decision. [ABSTRACT FROM AUTHOR]

In order to detect the early fatigue crack of mechanical components simply, this paper puts forward the ultrasonic testing technology of different side collinear mixing. Firstly, based on the nonlinear ultrasonic theory, the method of calculating the difference frequency and sum frequency nonlinear coefficients of mixing ultrasonic is deduced. Then, the ram-5000 SINAP ultrasonic system is used to detect the aluminum alloy specimens with five different depth fatigue cracks, and the corresponding spectrum diagram is drawn. From the experimental results, we get that the crack depth is positively correlated with the nonlinear coefficients of difference frequency and sum frequency within a certain crack depth. Finally, by analyzing and fitting the experimental data, the prediction models of the difference frequency and sum frequency nonlinear coefficients on the crack depth are established. Through the analysis and combination of the above two prediction models, the prediction model of the mixing relative nonlinear coefficient is established, and the average error of the three prediction models is compared. The results show that the mixing relative nonlinear model has better results. The research work in this paper makes a useful exploration for crack detection and crack depth prediction.