The Poverty Alleviation Model for the Solitary Elderly People in the Poor Mountainous Areas of Southwest China: Analysis of "Five Batches Project" in Xundian County

The solitary elderly people in rural areas are not only an important part of the rural population,but also an important issue that can not be ignored in the battle to get rid of poverty. In recent years,according to the working thinking of ' accurate statistics,scientific arrangement,classified implementation,and rapid progress',Xundian County has gone through joint exploration and practice at the county and township levels,and has found out the path of work of ' Five Batches Project' to solve the problem of poverty alleviation for the solitary elderly people and make them live in their own homes. This has effectively solved the problem of safe and stable housing for 4 443 solitary elderly people in the county. It has found a new way to solve the housing problem of the solitary elderly people. At the end of 2017,the incidence of poverty in the county dropped to 0. 35%,and it was successfully listed as one of the first counties in Yunnan Province to get rid of poverty. Based on field research and interviews,this paper analyzes and summarizes the concrete methods,main achievements,practical experience,lessons and reference of the poverty alleviation model of ' Five Batches Project' in Xundian County to solve the problem of housing for the elderly,in order to provide necessary reference for the poor counties in Yunnan Province and other similar provinces( cities,autonomous regions) to solve the problem of housing for ' solitary elderly people' in Yunnan Province.

Study on the Treatment Strategy of Batches of the Wounded and Partial First-Aid Procedures in Public Emergencies in Tertiary General Hospitals

Objective: The purpose is to formulate treatment strategies of batches of the wounded and partial first-aid procedures, and further improve the emergency rescue capability of hospitals. Methods: This study analyzed the emergency treatment case that we participated in. In this case, we used various means to start the emergency plan, run the emergency procedures, optimize diagnosis, treatment, and rescue procedures, mobilize medical rescue resources, provide a reference for emergency command decisions, formulate a set of coping strategies of tertiary general hospitals on public emergencies. Results: Through the scientific and effective management of our hospital, 20 wounded have been discharged from the hospital and achieved the ideal effect of zero deaths in the hospital. Conclusions: The new mode of first-aid and health emergency management on the scene of modern disaster needs to find ways to minimize the loss of life and property brought by public emergencies, integrate the various sections of modern disaster medicine, integrate a large number of international and domestic basic and clinical research achievements of disaster first-aid, and upgrade to information, digital system.

An improved multi-objective optimization algorithm for solving flexible job shop scheduling problem with variable batches

In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches.

APPLICATION OF CONVECTION-DIFFUSION EQUATION TO THEANALYSES OF CONTAMINATION BETWEEN BATCHESIN MULTI-PRODUCTS PIPELINE TRANSPORT

Contamination between batches in multi-products pipeline transport is studied. The influences of convection and diffusion on the contamination are studied in detail. Diffusion equations, which are mainly controlled by convection, are developed under turbulent pipe flow. The diffusion equation is separated into a pure convection equation and a pure diffusion equation which are solved by characteristics method and finite difference method respectively to obtain numerical solutions. The results of numerical computation explain the forming and developing of contamination very well.

Foreign trade apparel companies transforming in small batches of personalized customization

Faced with the new changes in the market affected by the pandemic,Chinese foreign trade apparel companies have adjusted their market models and product structures,upgrading from traditional manufacturing to flexible manufacturing and itelligent manufacturing to improve priaillity.

Activation of sulfite by ferric ion for the degradation of 2,4,6-tribromophenol with the addition of sulfite in batches

In this work,the removal of 2,4,6-tribromophenol(TBP)by ferric ion-activated sulfite[Fe(Ⅲ)/S(Ⅳ)]process was systematically investigated with determining the intermediate products and evaluating the influences of some operational conditions and water matrices.Our results show that batching addition of S(Ⅳ)benefits the S(Ⅳ)utilization efficiency and TBP removal,with SO_(4)^(-)being the primary reactive radical accounting for TBA degradation.The maximum TBP removal in the Fe(Ⅲ)/S(Ⅳ)process was observed at pH 4.0 and oxygen is essential in this process.With increasing Fe(Ⅲ)and S(Ⅳ)dosages from 0.05 and 0.1 mmol/L to 0.2 and 2.0 mmol/L,respectively,TBP removal followed trends of first increase then decrease.As the acute toxicity of the TBP solution was significantly reduced,the Fe(Ⅲ)/S(Ⅳ)process was believed to be a good choice in the treatment of TBP.

Application of Convolutional Neural Networks in Classification of GBM for Enhanced Prognosis

The lethal brain tumor “Glioblastoma” has the propensity to grow over time. To improve patient outcomes, it is essential to classify GBM accurately and promptly in order to provide a focused and individualized treatment plan. Despite this, deep learning methods, particularly Convolutional Neural Networks (CNNs), have demonstrated a high level of accuracy in a myriad of medical image analysis applications as a result of recent technical breakthroughs. The overall aim of the research is to investigate how CNNs can be used to classify GBMs using data from medical imaging, to improve prognosis precision and effectiveness. This research study will demonstrate a suggested methodology that makes use of the CNN architecture and is trained using a database of MRI pictures with this tumor. The constructed model will be assessed based on its overall performance. Extensive experiments and comparisons with conventional machine learning techniques and existing classification methods will also be made. It will be crucial to emphasize the possibility of early and accurate prediction in a clinical workflow because it can have a big impact on treatment planning and patient outcomes. The paramount objective is to not only address the classification challenge but also to outline a clear pathway towards enhancing prognosis precision and treatment effectiveness.

A Blind Batch Encryption and Public Ledger-Based Protocol for Sharing Sensitive Data

For the goals of security and privacy preservation,we propose a blind batch encryption-and public ledger-based data sharing protocol that allows the integrity of sensitive data to be audited by a public ledger and allows privacy information to be preserved.Data owners can tightly manage their data with efficient revocation and only grant one-time adaptive access for the fulfillment of the requester.We prove that our protocol is semanticallly secure,blind,and secure against oblivious requesters and malicious file keepers.We also provide security analysis in the context of four typical attacks.

Improving the accuracy of mechanistic models for dynamic batch distillation enabled by neural network:An industrial plant case

Neural networks are often viewed as pure‘black box’models,lacking interpretability and extrapolation capabilities of pure mechanistic models.This work proposes a new approach that,with the help of neural networks,improves the conformity of the first-principal model to the actual plant.The final result is still a first-principal model rather than a hybrid model,which maintains the advantage of the high interpretability of first-principal model.This work better simulates industrial batch distillation which separates four components:water,ethylene glycol,diethylene glycol,and triethylene glycol.GRU(gated recurrent neural network)and LSTM(long short-term memory)were used to obtain empirical parameters of mechanistic model that are difficult to measure directly.These were used to improve the empirical processes in mechanistic model,thus correcting unreasonable model assumptions and achieving better predictability for batch distillation.The proposed method was verified using a case study from one industrial plant case,and the results show its advancement in improving model predictions and the potential to extend to other similar systems.

基于改进K-Means算法的电动汽车充电负荷特性分析

电动汽车充电行为具有较大的随机性,一定程度上影响电网的稳定运行和规划。为更准确地分析电动汽车充电负荷的特性,提出一种基于改进K-Means算法的聚类分析方法。针对K-Means算法在初始聚类中心选取上的随机性和不稳定性,首先利用Mini Batch K-Means算法的随机抽样能力优化初始聚类中心的选择,随后结合K-Means算法进行迭代优化,有效解决K-Means算法聚类结果不稳定的问题。以云南某城市充电桩负荷数据进行算例分析,结果表明,所提算法相比传统方法相比能更加准确地对多个不同负荷特性的用户进行分类,从而更有效地指导有序用电管理策略的制定。

Performance Prediction Based Workload Scheduling in Co-Located Cluster

Cloud service providers generally co-locate online services and batch jobs onto the same computer cluster,where the resources can be pooled in order to maximize data center resource utilization.Due to resource competition between batch jobs and online services,co-location frequently impairs the performance of online services.This study presents a quality of service(QoS)prediction-based schedulingmodel(QPSM)for co-locatedworkloads.The performance prediction of QPSM consists of two parts:the prediction of an online service’s QoS anomaly based on XGBoost and the prediction of the completion time of an offline batch job based on randomforest.On-line service QoS anomaly prediction is used to evaluate the influence of batch jobmix on on-line service performance,and batch job completion time prediction is utilized to reduce the total waiting time of batch jobs.When the same number of batch jobs are scheduled in experiments using typical test sets such as CloudSuite,the scheduling time required by QPSM is reduced by about 6 h on average compared with the first-come,first-served strategy and by about 11 h compared with the random scheduling strategy.Compared with the non-co-located situation,QPSM can improve CPU resource utilization by 12.15% and memory resource utilization by 5.7% on average.Experiments show that the QPSM scheduling strategy proposed in this study can effectively guarantee the quality of online services and further improve cluster resource utilization.

A linkable signature scheme supporting batch verification for privacy protection in crowd-sensing

The maturity of 5G technology has enabled crowd-sensing services to collect multimedia data over wireless network,so it has promoted the applications of crowd-sensing services in different fields,but also brings more privacy security challenges,the most commom which is privacy leakage.As a privacy protection technology combining data integrity check and identity anonymity,ring signature is widely used in the field of privacy protection.However,introducing signature technology leads to additional signature verification overhead.In the scenario of crowd-sensing,the existing signature schemes have low efficiency in multi-signature verification.Therefore,it is necessary to design an efficient multi-signature verification scheme while ensuring security.In this paper,a batch-verifiable signature scheme is proposed based on the crowd-sensing background,which supports the sensing platform to verify the uploaded multiple signature data efficiently,so as to overcoming the defects of the traditional signature scheme in multi-signature verification.In our proposal,a method for linking homologous data was presented,which was valuable for incentive mechanism and data analysis.Simulation results showed that the proposed scheme has good performance in terms of security and efficiency in crowd-sensing applications with a large number of users and data.

Data complexity-based batch sanitization method against poison in distributed learning

The security of Federated Learning(FL)/Distributed Machine Learning(DML)is gravely threatened by data poisoning attacks,which destroy the usability of the model by contaminating training samples,so such attacks are called causative availability indiscriminate attacks.Facing the problem that existing data sanitization methods are hard to apply to real-time applications due to their tedious process and heavy computations,we propose a new supervised batch detection method for poison,which can fleetly sanitize the training dataset before the local model training.We design a training dataset generation method that helps to enhance accuracy and uses data complexity features to train a detection model,which will be used in an efficient batch hierarchical detection process.Our model stockpiles knowledge about poison,which can be expanded by retraining to adapt to new attacks.Being neither attack-specific nor scenario-specific,our method is applicable to FL/DML or other online or offline scenarios.

Research on Flexible Job Shop Scheduling Based on Improved Two-Layer Optimization Algorithm

To improve the productivity,the resource utilization and reduce the production cost of flexible job shops,this paper designs an improved two-layer optimization algorithm for the dual-resource scheduling optimization problem of flexible job shop considering workpiece batching.Firstly,a mathematical model is established to minimize the maximum completion time.Secondly,an improved two-layer optimization algorithm is designed:the outer layer algorithm uses an improved PSO(Particle Swarm Optimization)to solve the workpiece batching problem,and the inner layer algorithm uses an improved GA(Genetic Algorithm)to solve the dual-resource scheduling problem.Then,a rescheduling method is designed to solve the task disturbance problem,represented by machine failures,occurring in the workshop production process.Finally,the superiority and effectiveness of the improved two-layer optimization algorithm are verified by two typical cases.The case results show that the improved two-layer optimization algorithm increases the average productivity by 7.44% compared to the ordinary two-layer optimization algorithm.By setting the different numbers of AGVs(Automated Guided Vehicles)and analyzing the impact on the production cycle of the whole order,this paper uses two indicators,the maximum completion time decreasing rate and the average AGV load time,to obtain the optimal number of AGVs,which saves the cost of production while ensuring the production efficiency.This research combines the solved problem with the real production process,which improves the productivity and reduces the production cost of the flexible job shop,and provides new ideas for the subsequent research.

A Cooperated Imperialist Competitive Algorithm for Unrelated Parallel Batch Machine Scheduling Problem

This study focuses on the scheduling problem of unrelated parallel batch processing machines(BPM)with release times,a scenario derived from the moulding process in a foundry.In this process,a batch is initially formed,placed in a sandbox,and then the sandbox is positioned on a BPM formoulding.The complexity of the scheduling problem increases due to the consideration of BPM capacity and sandbox volume.To minimize the makespan,a new cooperated imperialist competitive algorithm(CICA)is introduced.In CICA,the number of empires is not a parameter,and four empires aremaintained throughout the search process.Two types of assimilations are achieved:The strongest and weakest empires cooperate in their assimilation,while the remaining two empires,having a close normalization total cost,combine in their assimilation.A new form of imperialist competition is proposed to prevent insufficient competition,and the unique features of the problem are effectively utilized.Computational experiments are conducted across several instances,and a significant amount of experimental results show that the newstrategies of CICAare effective,indicating promising advantages for the considered BPMscheduling problems.

Batch Active Learning for Multispectral and Hyperspectral Image Segmentation Using Similarity Graphs

Graph learning,when used as a semi-supervised learning(SSL)method,performs well for classification tasks with a low label rate.We provide a graph-based batch active learning pipeline for pixel/patch neighborhood multi-or hyperspectral image segmentation.Our batch active learning approach selects a collection of unlabeled pixels that satisfy a graph local maximum constraint for the active learning acquisition function that determines the relative importance of each pixel to the classification.This work builds on recent advances in the design of novel active learning acquisition functions(e.g.,the Model Change approach in arXiv:2110.07739)while adding important further developments including patch-neighborhood image analysis and batch active learning methods to further increase the accuracy and greatly increase the computational efficiency of these methods.In addition to improvements in the accuracy,our approach can greatly reduce the number of labeled pixels needed to achieve the same level of the accuracy based on randomly selected labeled pixels.

Optimized air-ground data fusion method for mine slope modeling

Refined 3D modeling of mine slopes is pivotal for precise prediction of geological hazards.Aiming at the inadequacy of existing single modeling methods in comprehensively representing the overall and localized characteristics of mining slopes,this study introduces a new method that fuses model data from Unmanned aerial vehicles(UAV)tilt photogrammetry and 3D laser scanning through a data alignment algorithm based on control points.First,the mini batch K-Medoids algorithm is utilized to cluster the point cloud data from ground 3D laser scanning.Then,the elbow rule is applied to determine the optimal cluster number(K0),and the feature points are extracted.Next,the nearest neighbor point algorithm is employed to match the feature points obtained from UAV tilt photogrammetry,and the internal point coordinates are adjusted through the distanceweighted average to construct a 3D model.Finally,by integrating an engineering case study,the K0 value is determined to be 8,with a matching accuracy between the two model datasets ranging from 0.0669 to 1.0373 mm.Therefore,compared with the modeling method utilizing K-medoids clustering algorithm,the new modeling method significantly enhances the computational efficiency,the accuracy of selecting the optimal number of feature points in 3D laser scanning,and the precision of the 3D model derived from UAV tilt photogrammetry.This method provides a research foundation for constructing mine slope model.

Exact Tail Asymptotics for a Queueing System with a Retrial Orbit and Batch Service

This paper discusses a queueing system with a retrial orbit and batch service, in which the quantity of customers’ rooms in the queue is finite and the space of retrial orbit is infinite. When the server starts serving, it serves all customers in the queue in a single batch, which is the so-called batch service. If a new customer or a retrial customer finds all the customers’ rooms are occupied, he will decide whether or not to join the retrial orbit. By using the censoring technique and the matrix analysis method, we first obtain the decay function of the stationary distribution for the quantity of customers in the retrial orbit and the quantity of customers in the queue. Then based on the form of decay rate function and the Karamata Tauberian theorem, we finally get the exact tail asymptotics of the stationary distribution.

The Meeting Points a New Way out for Surfactant Industrial Chain

In March 2024,a large batch of people along the surfactant industrial chain attended the“2024 Chinese Surfactant Industrial Meeting”,also the 2024(The 2nd)Chinese International Surfactant Industrial Expo held between March 25 and March 28,so as to explore new possibilities in the industry.This event was hosted by China Research Institute of Daily Chemical Industry and National Engineering Research Center for Surfactant(NERCS)and organized by Productivity Promotion Centre for the Surfactant and Detergent Industry and China Daily chemical Industry Information Center,with the special support by China Quality Mark Certification Group.