Explore the vast range of titles available.

يضم هذا الكتاب مجموعة من أروع القصائد الشعرية، التي كتبها شاعر مقاطعة \"يونان\" الصينية لورو دي جي Lure Diji) بلهجة الماندرين الصينية، مترجمة إلى اللغة العربية. وقد استمد لورو قصائده من المحيط البعيد للعالم الثقافي الصيني تناول خلالها الأرض الحمراء للهضبة العليا في المناطق الحدودية العالية في جنوب غرب الصين، والمنطقة التي تعلوها أعمال الطبيعة الحرة من أي قيود، بالإضافة إلى جبال الهيمالايا والغابات شبه الاستوائية العميقة، وجبال الثلج العملاقة والوديان ذات الانحدار الشديد، بالإضافة إلى روافد نهر يانغتسي، حيث تأخذ العديد من قصائد هذا الكتاب مكانها بين هذه التكوينات الطبيعية العظيمة، وتغوص في قصص الناس الذين يعيشون هناك، وتتناول الانطباعات التي تركوها على الأرض للحظات. إنها تحية وجدانية عظيمة مليئة بالوفاء والإكبار لإحدى براري الصين الأكثر جمالا ودفئا، من أحد أبنائها الأبرار.

The stochastic block model is a popular tool for studying community structures in network data. We develop a goodness-of-fit test for the stochastic block model. The test statistic is based on the largest singular value of a residual matrix obtained by subtracting the estimated block mean effect from the adjacency matrix. Asymptotic null distribution is obtained using recent advances in random matrix theory. The test is proved to have full power against alternative models with finer structures. These results naturally lead to a consistent sequential testing estimate of the number of communities.

We provide upper bounds of the expected Wasserstein distance between a probability measure and its empirical version, generalizing recent results for finite dimensional Euclidean spaces and bounded functional spaces. Such a generalization can cover Euclidean spaces with large dimensionality, with the optimal dependence on the dimensionality. Our method also covers the important case of Gaussian processes in separable Hilbert spaces, with rate-optimal upper bounds for functional data distributions whose coordinates decay geometrically or polynomially. Moreover, our bounds of the expected value can be combined with mean-concentration results to yield improved exponential tail probability bounds for the Wasserstein error of empirical measures under Bernstein-type or log Sobolev-type conditions.

The stochastic block model (SBM) and its variants have been a popular tool for analyzing large network data with community structures. In this article, we develop an efficient network cross-validation (NCV) approach to determine the number of communities, as well as to choose between the regular stochastic block model and the degree corrected block model (DCBM). The proposed NCV method is based on a block-wise node-pair splitting technique, combined with an integrated step of community recovery using sub-blocks of the adjacency matrix. We prove that the probability of under-selection vanishes as the number of nodes increases, under mild conditions satisfied by a wide range of popular community recovery algorithms. The solid performance of our method is also demonstrated in extensive simulations and two data examples. Supplementary materials for this article are available online.

We develop a general framework for distribution-free predictive inference in regression, using conformal inference. The proposed methodology allows for the construction of a prediction band for the response variable using any estimator of the regression function. The resulting prediction band preserves the consistency properties of the original estimator under standard assumptions, while guaranteeing finite-sample marginal coverage even when these assumptions do not hold. We analyze and compare, both empirically and theoretically, the two major variants of our conformal framework: full conformal inference and split conformal inference, along with a related jackknife method. These methods offer different tradeoffs between statistical accuracy (length of resulting prediction intervals) and computational efficiency. As extensions, we develop a method for constructing valid in-sample prediction intervals called rank-one-out conformal inference, which has essentially the same computational efficiency as split conformal inference. We also describe an extension of our procedures for producing prediction bands with locally varying length, to adapt to heteroscedasticity in the data. Finally, we propose a model-free notion of variable importance, called leave-one-covariate-out or LOCO inference. Accompanying this article is an R package conformalInference that implements all of the proposals we have introduced. In the spirit of reproducibility, all of our empirical results can also be easily (re)generated using this package.

This study presents a multimodal framework that uses smartphone motion sensors and generative AI to create audio comics from live news headlines. The system operates without direct touch or voice input, instead responding to simple hand-wave gestures. The system demonstrates potential as an alternative input method, which may benefit users who find traditional touch or voice interaction challenging. In the experiments, we investigated the generation of comics on based on the latest tech-related news headlines using Really Simple Syndication (RSS) on a simple hand wave gesture. The proposed framework demonstrates extensibility beyond comic generation, as various other tasks utilizing large language models and multimodal AI could be integrated by mapping them to different hand gestures. Our experiments with open-source models like LLaMA, LLaVA, Gemma, and Qwen revealed that LLaVA delivers superior results in generating panel-aligned stories compared to Qwen3-VL, both in terms of inference speed and output quality, relative to the source image. These large language models (LLMs) collectively contribute imaginative and conversational narrative elements that enhance diversity in storytelling within the comic format. Additionally, we implement an AI-in-the-loop mechanism to iteratively improve output quality without human intervention. Finally, AI-generated audio narration is incorporated into the comics to create an immersive, multimodal reading experience.

An association rule mining algorithm is an algorithm that mines the association between things and is often used to mine the association knowledge between things. Association rule mining algorithms can find potential connections between different qualities of college students from the data of college students’ life and learning, which can help teachers discover the problems and their own strengths of different students and achieve teaching according to their aptitude. The purpose of this paper is to solve some problems related to the associative rule extraction algorithm and to investigate the impact of applying the associative rule extraction algorithm in a college student quality assessment system. Based on the algorithm, a quality assessment system for college students has been developed. A modified script-based associative rule extraction algorithm is used to find the correlation between the quality and the ability of college students. The quality assessment data of college students are analyzed and studied. The results show that the use of associative rule extraction algorithms to assess the quality and ability of college students can improve the efficiency of the test by 24% and the accuracy of the test score by 33% and reduce the probability of outliers in the scoring process by 27%. It can be seen that the association rule extraction algorithm can be applied to college students’ quality assessment system and also reduces the probability of encountering obstacles in accuracy and performance assessment. At the same time, this experiment also proves the robustness and feasibility of the algorithm in this paper.

Organ transplantation is the most effective therapy for patients with end-stage disease. Preservation solutions and techniques are crucial for donor organ quality, which is directly related to morbidity and survival after transplantation. Currently, static cold storage (SCS) is the standard method for organ preservation. However, preservation time with SCS is limited as prolonged cold storage increases the risk of early graft dysfunction that contributes to chronic complications. Furthermore, the growing demand for the use of marginal donor organs requires methods for organ assessment and repair. Machine perfusion has resurfaced and dominates current research on organ preservation. It is credited to its dynamic nature and physiological-like environment. The development of more sophisticated machine perfusion techniques and better perfusates may lead to organ repair/reconditioning. This review describes the history of organ preservation, summarizes the progresses that has been made to date, and discusses future directions for organ preservation.

Background Intensive evidence has highlighted the effect of aberrant alternative splicing (AS) events on cancer progression when triggered by dysregulation of the SR protein family. Nonetheless, the underlying mechanism in breast cancer (BRCA) remains elusive. Here we sought to explore the molecular function of SRSF1 and identify the key AS events regulated by SRSF1 in BRCA. Methods We conducted a comprehensive analysis of the expression and clinical correlation of SRSF1 in BRCA based on the TCGA dataset, Metabric database and clinical tissue samples. Functional analysis of SRSF1 in BRCA was conducted in vitro and in vivo. SRSF1-mediated AS events and their binding motifs were identified by RNA-seq, RNA immunoprecipitation-PCR (RIP-PCR) and in vivo crosslinking followed by immunoprecipitation (CLIP), which was further validated by the minigene reporter assay. PTPMT1 exon 3 (E3) AS was identified to partially mediate the oncogenic role of SRSF1 by the P-AKT/C-MYC axis. Finally, the expression and clinical significance of these AS events were validated in clinical samples and using the TCGA database. Results SRSF1 expression was consistently upregulated in BRCA samples, positively associated with tumor grade and the Ki-67 index, and correlated with poor prognosis in a hormone receptor-positive (HR+) cohort, which facilitated proliferation, cell migration and inhibited apoptosis in vitro and in vivo. We identified SRSF1-mediated AS events and discovered the SRSF1 binding motif in the regulation of splice switching of PTPMT1. Furthermore, PTPMT1 splice switching was regulated by SRSF1 by binding directly to its motif in E3 which partially mediated the oncogenic role of SRSF1 by the AKT/C-MYC axis. Additionally, PTPMT1 splice switching was validated in tissue samples of BRCA patients and using the TCGA database. The high-risk group, identified by AS of PTPMT1 and expression of SRSF1, possessed poorer prognosis in the stage I/II TCGA BRCA cohort. Conclusions SRSF1 exerts oncogenic roles in BRCA partially by regulating the AS of PTPMT1, which could be a therapeutic target candidate in BRCA and a prognostic factor in HR+ BRCA patient.