Comparative analysis shows high level of lineage sorting in genomic regions with low recombination in the extended Picea likiangensis species complex

Genome-scale data,while promising for illuminating phylogenetic relationships,frequently pose a conundrum by yielding conflicting topologies and highly variable gene tree distributions(Pease et al.,2016).This complexity likely arises from the reticulate evolution observed in many taxa,where genetic information exchange occurs through diverse biological processes.

Digital Twin Technology of Human-Machine Integration in Cross-Belt Sorting System

The Chinese express delivery industry processes nearly 110 billion items in 2022,averaging an annual growth rate of 200%.Among the various types of sorting systems used for handling express items,cross-belt sorting systems stand out as the most crucial.However,despite their high degree of automation,the workload for operators has intensified owing to the surging volume of express items.In the era of Industry 5.0,it is imperative to adopt new technologies that not only enhance worker welfare but also improve the efficiency of cross-belt systems.Striking a balance between efficiency in handling express items and operator well-being is challenging.Digital twin technology offers a promising solution in this respect.A realization method of a human-machine integrated digital twin is proposed in this study,enabling the interaction of biological human bodies,virtual human bodies,virtual equipment,and logistics equipment in a closed loop,thus setting an operating framework.Key technologies in the proposed framework include a collection of heterogeneous data from multiple sources,construction of the relationship between operator fatigue and operation efficiency based on physiological measurements,virtual model construction,and an online optimization module based on real-time simulation.The feasibility of the proposed method was verified in an express distribution center.

A novel integrated microfluidic chip for on-demand electrostatic droplet charging and sorting

On-demand droplet sorting is extensively applied for the efficient manipulation and genome-wide analysis of individual cells.However,state-of-the-art microfluidic chips for droplet sorting still suffer from low sorting speeds,sample loss,and labor-intensive preparation procedures.Here,we demonstrate the development of a novel microfluidic chip that integrates droplet generation,on-demand electrostatic droplet charging,and high-throughput sorting.The charging electrode is a copper wire buried above the nozzle of the microchannel,and the deflecting electrode is the phosphate buffered saline in the microchannel,which greatly simplifies the structure and fabrication process of the chip.Moreover,this chip is capable of high-frequency droplet generation and sorting,with a frequency of 11.757 kHz in the drop state.The chip completes the selective charging process via electrostatic induction during droplet generation.On-demand charged microdroplets can arbitrarilymove to specific exit channels in a three-dimensional(3D)-deflected electric field,which can be controlled according to user requirements,and the flux of droplet deflection is thereby significantly enhanced.Furthermore,a lossless modification strategy is presented to improve the accuracy of droplet deflection or harvest rate from 97.49% to 99.38% by monitoring the frequency of droplet generation in real time and feeding it back to the charging signal.This chip has great potential for quantitative processing and analysis of single cells for elucidating cell-to-cell variations.

Phylotranscriptomic discordance is best explained by incomplete lineage sorting within Allium subgenus Cyathophora and thus hemiplasy accounts for interspecific trait transition

The transition of traits between genetically related lineages is a fascinating topic that provides clues to understanding the drivers of speciation and diversification.Much can be learned about this process from phylogeny-based trait evolution.However,such inference is often plagued by genome-wide gene-tree discordance(GTD),mostly due to incomplete lineage sorting(ILS)and/or introgressive hybridization,especially when the genes underlying the traits appear discordant.Here,by collecting transcriptomes,whole chloroplast genomes(cpDNA),and population genetic datasets,we used the coalescent model to turn GTD into a source of information for ILS and employed hemiplasy to explain specific cases of apparent“phylogenetic discordance”between different morphological traits and probable species phylogeny in the Allium subg.Cyathophora.Both concatenation and coalescence methods consistently showed the same phylogenetic topology for species tree inference based on single-copy genes(SCGs),as supported by the KS distribution.However,GTD was high across the genomes of subg.Cyathophora:~27%e38.9%of the SCG trees were in conflict with the species tree.Plasmid and nuclear incongruence was also present.Our coalescent simulations indicated that such GTD was mainly a product of ILS.Our hemiplasy risk factor calculations supported that random fixation of ancient polymorphisms in different populations during successive speciation events along the subg.Cyathophora phylogeny may have caused the character transition,as well as the anomalous cpDNA tree.Our study exemplifies how phylogenetic noise can be transformed into evolutionary information for understanding character state transitions along species phylogenies.

Enhancing XRF sensor-based sorting of porphyritic copper ore using particle swarm optimization-support vector machine(PSO-SVM)algorithm

X-ray fluorescence(XRF)sensor-based ore sorting enables efficient beneficiation of heterogeneous ores,while intraparticle heterogeneity can cause significant grade detection errors,leading to misclassifications and hindering widespread technology adoption.Accurate classification models are crucial to determine if actual grade exceeds the sorting threshold using localized XRF signals.Previous studies mainly used linear regression(LR)algorithms including simple linear regression(SLR),multivariable linear regression(MLR),and multivariable linear regression with interaction(MLRI)but often fell short attaining satisfactory results.This study employed the particle swarm optimization support vector machine(PSO-SVM)algorithm for sorting porphyritic copper ore pebble.Lab-scale results showed PSO-SVM out-performed LR and raw data(RD)models and the significant interaction effects among input features was observed.Despite poor input data quality,PSO-SVM demonstrated exceptional capabilities.Lab-scale sorting achieved 93.0%accuracy,0.24%grade increase,84.94%recovery rate,57.02%discard rate,and a remarkable 39.62 yuan/t net smelter return(NSR)increase compared to no sorting.These improvements were achieved by the PSO-SVM model with optimized input combinations and highest data quality(T=10,T is XRF testing times).The unsuitability of LR methods for XRF sensor-based sorting of investigated sample is illustrated.Input element selection and mineral association analysis elucidate element importance and influence mechanisms.

Improving path planning efficiency for underwater gravity-aided navigation based on a new depth sorting fast search algorithm

This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapidly-exploring Random Trees*(Q-RRT*)algorithm.A cost inequality relationship between an ancestor and its descendants was derived,and the ancestors were filtered accordingly.Secondly,the underwater gravity-aided navigation path planning system was designed based on the DSFS algorithm,taking into account the fitness,safety,and asymptotic optimality of the routes,according to the gravity suitability distribution of the navigation space.Finally,experimental comparisons of the computing performance of the ChooseParent procedure,the Rewire procedure,and the combination of the two procedures for Q-RRT*and DSFS were conducted under the same planning environment and parameter conditions,respectively.The results showed that the computational efficiency of the DSFS algorithm was improved by about 1.2 times compared with the Q-RRT*algorithm while ensuring correct computational results.

Accelerating Large-Scale Sorting through Parallel Algorithms

This study explores the application of parallel algorithms to enhance large-scale sorting, focusing on the QuickSort method. Implemented in both sequential and parallel forms, the paper provides a detailed comparison of their performance. This study investigates the efficacy of both techniques through the lens of array generation and pivot selection to manage datasets of varying sizes. This study meticulously documents the performance metrics, recording 16,499.2 milliseconds for the serial implementation and 16,339 milliseconds for the parallel implementation when sorting an array by using C++ chrono library. These results suggest that while the performance gains of the parallel approach over its serial counterpart are not immediately pronounced for smaller datasets, the benefits are expected to be more substantial as the dataset size increases.

Real-time ore sorting using color and texture analysis

Sensor-based ore sorting is a technology used to classify high-grade mineralized rocks from low-grade waste rocks to reduce operation costs.Many ore-sorting algorithms using color images have been proposed in the past,but only some validate their results using mineral grades or optimize the algorithms to classify rocks in real-time.This paper presents an ore-sorting algorithm based on image processing and machine learning that is able to classify rocks from a gold and silver mine based on their grade.The algorithm is composed of four main stages:(1)image segmentation and partition,(2)color and texture feature extraction,(3)sub-image classification using neural networks,and(4)a voting system to determine the overall class of the rock.The algorithm was trained using images of rocks that a geologist manually classified according to their mineral content and then was validated using a different set of rocks analyzed in a laboratory to determine their gold and silver grades.The proposed method achieved a Matthews correlation coefficient of 0.961 points,higher than other classification algorithms based on support vector machines and convolutional neural networks,and a processing time under 44 ms,promising for real-time ore sorting applications.

基于SORT映射的IRCMFDE在旋转机械故障诊断中的应用

针对旋转机械振动信号的强非线性和非平稳性,导致故障特征提取困难的问题,提出了一种基于SORT映射的改进精细复合多尺度波动散布熵(IRCMFDE)和蝙蝠算法优化的相关向量机(BA-RVM)的旋转机械故障诊断方法。首先,利用SORT映射函数替换了精细复合多尺度波动散布熵(RCMFDE)方法的正态累积分布函数,同时对RCMFDE方法的粗粒化方式进行了改进,提出了基于SORT映射的IRCMFDE方法;随后,利用IRCMFDE方法提取了旋转机械振动信号的故障特征,构造了故障特征集;最后,采用BA-RVM分类器对旋转机械的故障类型进行了智能化的识别和分类;将基于IRCMFDE和BA-RVM的故障诊断方法应用于滚动轴承、离心泵和齿轮箱的实验数据分析,并将其与现有故障诊断方法进行了对比分析。研究结果表明:基于IRCMFDE和BA-RVM的故障诊断方法能够有效地识别旋转机械的故障状态,识别准确率分别达到了100%、98%和99%,相比基于RCMFDE、精细复合多尺度熵、精细复合多尺度模糊熵、精细复合多尺度排列熵和精细复合多尺度散布熵的故障特征提取方法,该故障诊断方法的效率和平均识别准确率均优于对比方法,其更适合应用于旋转机械的在线实时故障监测。

分布式网络中连续时间周期的全局top-K频繁流测量

在分布式网络中,测量top-K频繁流对资源分配、安全监控等应用至关重要。现有的top-K频繁流测量工作存在不适用于测量分布式网络流量或只考虑单时间周期等局限。为此,提出了分布式网络中连续时间周期的全局top-K频繁流测量方案,在分布节点中布置了紧凑的概率数据结构来记录网络流信息,每个时间周期结束后分布节点向中心节点发送必要信息,中心节点汇聚得到从测量开始至当前时间周期的全局top-K频繁流。考虑到每条流可能出现在一个或多个测量节点,使用了不同的方法来减少传输开销。对于每条流只会出现在单一节点的情况,采用传输分段最小值的方法来获得阈值,实验结果表明这种方法减少了全量传输超过50%的传输开销。对于每条流会出现在多个节点的情况,提出了多阶段无误差处理方法和单阶段快速处理方法,分别应对不能容忍误差的场景和实际高速网络流量,相比每个时间周期都使用已有单周期方法,传输开销的实验表现降低了两个数量级。最后还提出了一种利用历史平均增值信息降低通信延迟的方法,实验结果表明该方法有效降低了限制信息的平均相对误差。

High-throughput sorting of two-color fluorescent-labeled zebrafish embryos

The zebrafish embryos were widely employed in genetics,development and drug discovery studies as miniatured animal models.Sorting of two-color fluorescent embryos is often required in large-scale experiments but it is challenging to manually sort with high efficiency.Here,we reported a high-throughput sorting system for two-color fluorescent zebraflsh embryos.The embryos can be automatically loaded from a sample pool and sorted based on the average fluorescent intensity.The two-color fluorescent signals were split into two lines and detected by an area array camera.The system achieves the sorting of 100 embryos in less than 10 min with an accuracy of greater than 95%.

一次性条件下top-k高平均效用序列模式挖掘算法

针对传统序列模式挖掘(SPM)不考虑模式重复性且忽略各项的效用(单价或利润)与模式长度对用户兴趣度影响的问题,提出一次性条件下top-k高平均效用序列模式挖掘(TOUP)算法。TOUP算法主要包括两个核心步骤:平均效用计算和候选模式生成。首先,提出基于各项出现位置与项重复关系数组的CSP(Calculation Support of Pattern)算法计算模式支持度,从而实现模式平均效用的快速计算;其次,采用项集扩展和序列扩展生成候选模式,并提出了最大平均效用上界,基于该上界实现对候选模式的有效剪枝。在5个真实数据集和1个合成数据集上的实验结果表明,相较于TOUP-dfs和HAOP-ms算法,TOUP算法的候选模式数分别降低了38.5%~99.8%和0.9%~77.6%;运行时间分别降低了33.6%~97.1%和57.9%~97.2%。TOUP的算法性能更优,能更高效地挖掘用户感兴趣的模式。

Improvement of Counting Sorting Algorithm

By analyzing the internal features of counting sorting algorithm. Two improvements of counting sorting algorithms are proposed, which have a wide range of applications and better efficiency than the original counting sort while maintaining the original stability. Compared with the original counting sort, it has a wider scope of application and better time and space efficiency. In addition, the accuracy of the above conclusions can be proved by a large amount of experimental data.

Theoretical Justification of the Efficient Operation of the Seed Sorting Device

In this article, the results of researches on the sorting of seeds in the cotton ginning enterprises were described. The main goal of the research work is to theoretically study the technology of separating various impurities and immature seeds from the composition of seeds. As a result, the theoretical basis for increasing the efficiency of the sorting process is created.

Bubble-sort网络的一类条件连通度

[目的]为评价网络容错性,以具有高对称性和递归结构的Bubble-sort网络为研究对象,确定其h-extra r-分支边连通度.[方法] Bubble-sort网络Bn可以分解成n个子图Bn(i),其中Bn(i)是由点集{x_(1)x_(2)…x_(n):x_(n)=i}(1≤i≤n)导出的子图,并且Bn(i)同构于B_(n-1),利用它的结构特点,用数学归纳法推理证明了主要结果.[结果]确定了bubble-sort网络的h-extra r-分支边连通度cλ2/3(B_(n))=4n-10(n≥4).[结论]研究了bubble-sort网络的一类条件连通度,可用于衡量网络的可靠性.今后将继续深入研究bubble-sort网络的其他条件连通度.

基于SORT算法的图像轨迹跟踪混合控制方法

当目标物体被其他物体部分或完全遮挡时,目标的有效特征点数量会逐渐减少,跟踪器无法继续准确地锁定目标,导致目标轨迹中断。为此,文中研究基于SORT算法的图像轨迹跟踪混合控制方法。选取FCOS算法,利用特征金字塔结构,依据检测头层输出的目标分类得分、位置回归结果以及中心度检测图像目标。将目标检测结果作为卡尔曼滤波器的输入,利用离散控制过程系统描述视频图像中的目标运动状态,预测目标轨迹。利用SORT算法控制图像目标检测结果与目标轨迹预测结果进行级联匹配与IoU匹配,输出匹配成功的目标,即图像目标轨迹跟踪结果。实验结果表明,该方法可有效地跟踪视频图像目标轨迹,未出现ID变更情况,轨迹中断占比低于0.2%。

Garbage Sorting

Garbage sorting plays a crucial role in fostering a positive social climate that brings benefits not only to society but also to our personal well-being.While we dispose of trash on a daily basis,have you ever wondered about their fate?Many items undergo processes like burning,grinding,or composting,which ensure safer and healthier outcomes for us.However,some end up accumulating in open spaces,leading to unpleasant odors and posing harm to the environment.

Fully Automated Paper Document Sorting Robot Design

A fully automated paper document sorting robot was developed in this project.This robot classifies documents efficiently and accurately.The objective of this project was to improve the efficiency of classifying or sorting paper documents,reduce costs,and save time.The robot can classify documents according to user-defined rules,such as keywords,dates,serial numbers,bar codes,and the meaning of paragraphs.Since it can classify or sort documents intelligently,it can complete large-scale document classification quickly.The robot is constructed using an aluminum profile to create a box-type truss gantry structure frame.It was built on the LubanCat 4 motherboard and controlled through Python language programming.Driven by a stepper motor to move the manipulator.The camera module is combined with an artificial intelligence algorithm to recognize paper in real time,and the text is recognized after taking pictures of the paper.The sorting function is performed by several sensors.In addition,a web-based human-computer interaction platform was developed using the Flask web framework in Python.Users could access this platform in a variety of ways,allowing them to easily and swiftly configure parameters and send operational instructions to perform various functions.

PeakSketch:检测网络流中的top-k流的无偏和通用草图

通过对现有Sketch结构的研究,提出一种新的Sketch结构:PeakSketch,本文将其应用于三种任务:检测top-k频繁流,检测top-k重变化流,检测top-k持久流,从理论上证明了PeakSketch可以提供无偏估计,并且给出了算法的误差界。实验结果表明,PeakSketch的各项性能优秀,在检测top-k频繁流任务中,PeakSketch的吞吐量显著提升,特别是在分配内存小于200 kB以下时,吞吐量最高提升可以达到50%,准确率最高提升一倍,PeakSketch也展现突出的性能。

大图中多样化Top-k模式挖掘算法研究

频繁模式挖掘(Frequent Pattern Mining,FPM)是图数据挖掘领域的一项重要任务。该任务的目标是从图数据中找到出现频次大于给定阈值的所有模式。近年来,随着社交网络等大规模图数据的涌现,单一大图上的FPM问题受到广泛关注,并得到了较为充分的研究,取得了一系列研究成果。然而,已有技术大都存在着计算成本高、挖掘结果理解困难以及并行计算难等问题。针对上述问题,文中提出了一种从大规模图数据中挖掘多样化top-k模式的方法。首先设计了一个多样化函数,用于度量模式集合的多样性;随后设计了一种面向分布式图数据,具有提前终止特性的分布式挖掘算法DisTopk,以实现多样化top-k模式高效挖掘。在真实图数据和合成图数据上进行了大量实验,结果表明,与传统分布式挖掘算法相比,DisTopk算法能更高效地挖掘多样化top-k模式。