Recently, joint advertising has gained significant attention as an effective approach to enhancing the efficiency and revenue of advertising slot allocation. Unlike traditional advertising, which allocates advertising slots exclusively to a single advertiser, joint advertising displays advertisements from brands and stores that have established a joint selling relationship within the same advertising slot. However, existing approaches often struggle to accommodate both joint and traditional advertising frameworks, thereby limiting the revenue potential and generalizability of joint advertising. Furthermore, these methods are constrained by two critical limitations: they generally neglect the influence of global externalities, and they fail to address the bidding variability stemming from multi-party advertiser participation. Collectively, these limitations present substantial challenges to the design of joint auction mechanisms. To address these challenges, we propose a Joint Auction Framework incorporating Externalities and Adaptation, and leverage the automated mechanism design (AMD) method through our proposed JEANet to compute joint auction mechanisms that satisfy the conditions of individual rationality (IR) and approximate dominant strategy incentive compatibility (DSIC). As the first AMD method to integrate global externalities into joint auctions, JEANet dynamically adapts to the bidding characteristics of multi-party advertiser and enables unified auctions that integrate both joint and traditional advertising. Extensive experimental results demonstrate that JEANet outperforms state-of-the-art baselines in multi-slot joint auctions.

To improve the accuracy and efficiency of tool wear predictions, this study proposes a tool wear prediction model called LSTM_ResNet which is based on the long short-term memory (LSTM) network and the Residual Network (ResNet). The model utilizes LSTM layers for processing, where the first block and loop blocks serve as the core modules of the deep residual network. The model employs a series of methods including convolution, batch normalization (BN), and Rectified Linear Unit (ReLU) to enhance the model’s expression and prediction capabilities. The performance of the LSTM_ResNet model was evaluated using experimental data from the PHM2010 datasets and two different depths (64 and 128 layers), training both LSTM_ResNet models for 200 epochs. The 64-layer model’s root mean square error (RMSE) values are 3.36, 4.35, and 3.59, and the mean absolute error (MAE) values are 2.42, 2.85, and 2.21; using 128 layers, the RMSE values are 3.66, 3.99, and 3.77, and the MAE values are 2.49, 2.73, and 3.01. The results indicate that the 64-layer LSTM has smaller average errors, suggesting that compared to other common network structures, the LSTM_ResNet network has a higher performance. This research provides an effective solution for tool wear prediction and helps to improve the technical level of tool wear prediction in China.

The performance of the permanent magnet synchronous motor (PMSM) sensorless control system is limited in the case of the low carrier ratio such as high-power transmission systems. This work analyzes the main factors that cause system delay under low carrier ratio. A linear current prediction method base on volt-second equilibrium principle is proposed to solve the sampling filter and inverter nonlinear delay. Meanwhile, a self-adjustive position compensation is obtained through a PI controller based on the$dq$-axis voltage error to further suppress the digital control delay. On this basis, a sensorless field oriented control system is built based on a model reference adaptive system. Finally, a 1.5-kW SPMSM is tested to verify the feasibility of the proposed method.

We propose a contraction transformation algorithm to plan a complete coverage trajectory for a mobile robot to accomplish specific types of missions based on the Arnold dynamical system. First, we construct a chaotic mobile robot by combining the variable z of the Arnold equation and the kinematic equation of the robot. Second, we construct the candidate sets including the initial points with a relatively high coverage rate of the constructed mobile robot. Then the trajectory is contracted to the current position of the robot based on the designed contraction transformation strategy, to form a continuous complete coverage trajectory to execute the specific types of missions. Compared with the traditional method, the designed algorithm requires no obstacle avoidance to the boundary of the given workplace, possesses a high coverage rate, and keeps the chaotic characteristics of the produced coverage trajectory relatively unchanged, which enables the robot to accomplish special missions with features of completeness, randomness, or unpredictability.

BACKGROUND: Molecular recognition features (MoRFs) are short binding regions located in longer intrinsically disordered protein regions. Although these short regions lack a stable structure in the natural state, they readily undergo disorder-to-order transitions upon binding to their partner molecules. MoRFs play critical roles in the molecular interaction network of a cell, and are associated with many human genetic diseases. Therefore, identification of MoRFs is an important step in understanding functional aspects of these proteins and in finding applications in drug design. RESULTS: Here, we propose a novel method for identifying MoRFs, named as MFSPSSMpred (Masked, Filtered and Smoothed Position-Specific Scoring Matrix-based Predictor). Firstly, a masking method is used to calculate the average local conservation scores of residues within a masking-window length in the position-specific scoring matrix (PSSM). Then, the scores below the average are filtered out. Finally, a smoothing method is used to incorporate the features of flanking regions for each residue to prepare the feature sets for prediction. Our method employs no predicted results from other classifiers as input, i.e., all features used in this method are extracted from the PSSM of sequence only. Experimental results show that, comparing with other methods tested on the same datasets, our method achieves the best performance: achieving 0.004~0.079 higher AUC than other methods when tested on TEST419, and achieving 0.045~0.212 higher AUC than other methods when tested on TEST2012. In addition, when tested on an independent membrane proteins-related dataset, MFSPSSMpred significantly outperformed the existing predictor MoRFpred. CONCLUSIONS: This study suggests that: 1) amino acid composition and physicochemical properties in the flanking regions of MoRFs are very different from those in the general non-MoRF regions; 2) MoRFs contain both highly conserved residues and highly variable residues and, on the whole, are highly locally conserved; and 3) combining contextual information with local conservation information of residues facilitates the prediction of MoRFs.