No effect of invasive tree species on aboveground biomass increments of oaks and pines in temperate forests

Prunus serotina and Robinia pseudoacacia are the most widespread invasive trees in Central Europe.In addition,according to climate models,decreased growth of many economically and ecologically important native trees will likely be observed in the future.We aimed to assess the impact of these two neophytes,which differ in the biomass range and nitrogen-fixing abilities observed in Central European conditions,on the relative aboveground biomass increments of native oaks Qucrcus robur and Q.petraea and Scots pine Pinus sylvestris.We aimed to increase our understanding of the relationship between facilitation and competition between woody alien species and overstory native trees.We established 72 circular plots(0.05 ha)in two different forest habitat types and stands varying in age in western Poland.We chose plots with different abundances of the studied neophytes to determine how effects scaled along the quantitative invasion gradient.Furthermore,we collected growth cores of the studied native species,and we calculated aboveground biomass increments at the tree and stand levels.Then,we used generalized linear mixed-effects models to assess the impact of invasive species abundances on relative aboveground biomass increments of native tree species.We did not find a biologically or statistically significant impact of invasive R.pseudoacacia or P.serotina on the relative aboveground,biomass increments of native oaks and pines along the quantitative gradient of invader biomass or on the proportion of total stand biomass accounted for by invaders.The neophytes did not act as native tree growth stimulators but also did not compete with them for resources,which would escalate the negative impact of climate change on pines and oaks.The neophytes should not significantly modify the carbon sequestration capacity of the native species.Our work combines elements of the per capita effect of invasion with research on mixed forest management.

DR-IS:Dynamic Response Incremental Scheduling in Time-Sensitive Network

Time-Sensitive Network(TSN)with deterministic transmission capability is increasingly used in many emerging fields.It mainly guarantees the Quality of Service(QoS)of applications with strict requirements on time and security.One of the core features of TSN is traffic scheduling with bounded low delay in the network.However,traffic scheduling schemes in TSN are usually synthesized offline and lack dynamism.To implement incremental scheduling of newly arrived traffic in TSN,we propose a Dynamic Response Incremental Scheduling(DR-IS)method for time-sensitive traffic and deploy it on a software-defined time-sensitive network architecture.Under the premise of meeting the traffic scheduling requirements,we adopt two modes,traffic shift and traffic exchange,to dynamically adjust the time slot injection position of the traffic in the original scheme,and determine the sending offset time of the new timesensitive traffic to minimize the global traffic transmission jitter.The evaluation results show that DRIS method can effectively control the large increase of traffic transmission jitter in incremental scheduling without affecting the transmission delay,thus realizing the dynamic incremental scheduling of time-sensitive traffic in TSN.

Improving Network Availability through Optimized Multipath Routing and Incremental Deployment Strategies

Currently,distributed routing protocols are constrained by offering a single path between any pair of nodes,thereby limiting the potential throughput and overall network performance.This approach not only restricts the flow of data but also makes the network susceptible to failures in case the primary path is disrupted.In contrast,routing protocols that leverage multiple paths within the network offer a more resilient and efficient solution.Multipath routing,as a fundamental concept,surpasses the limitations of traditional shortest path first protocols.It not only redirects traffic to unused resources,effectively mitigating network congestion,but also ensures load balancing across the network.This optimization significantly improves network utilization and boosts the overall performance,making it a widely recognized efficient method for enhancing network reliability.To further strengthen network resilience against failures,we introduce a routing scheme known as Multiple Nodes with at least Two Choices(MNTC).This innovative approach aims to significantly enhance network availability by providing each node with at least two routing choices.By doing so,it not only reduces the dependency on a single path but also creates redundant paths that can be utilized in case of failures,thereby enhancing the overall resilience of the network.To ensure the optimal placement of nodes,we propose three incremental deployment algorithms.These algorithms carefully select the most suitable set of nodes for deployment,taking into account various factors such as node connectivity,traffic patterns,and network topology.By deployingMNTCon a carefully chosen set of nodes,we can significantly enhance network reliability without the need for a complete overhaul of the existing infrastructure.We have conducted extensive evaluations of MNTC in diverse topological spaces,demonstrating its effectiveness in maintaining high network availability with minimal path stretch.The results are impressive,showing that even when implemented on just 60%of nodes,our incremental deployment method significantly boosts network availability.This underscores the potential of MNTC in enhancing network resilience and performance,making it a viable solution for modern networks facing increasing demands and complexities.The algorithms OSPF,TBFH,DC and LFC perform fast rerouting based on strict conditions,while MNTC is not restricted by these conditions.In five real network topologies,the average network availability ofMNTCis improved by 14.68%,6.28%,4.76%and 2.84%,respectively,compared with OSPF,TBFH,DC and LFC.

Hyperspectral Image Super-Resolution Network Based on Reinforcing Inter-Spectral Incremental Information

Hyperspectral images typically have high spectral resolution but low spatial resolution,which impacts the reliability and accuracy of subsequent applications,for example,remote sensingclassification and mineral identification.But in traditional methods via deep convolution neural net-works,indiscriminately extracting and fusing spectral and spatial features makes it challenging toutilize the differentiated information across adjacent spectral channels.Thus,we proposed a multi-branch interleaved iterative upsampling hyperspectral image super-resolution reconstruction net-work(MIIUSR)to address the above problems.We reinforce spatial feature extraction by integrat-ing detailed features from different receptive fields across adjacent channels.Furthermore,we pro-pose an interleaved iterative upsampling process during the reconstruction stage,which progres-sively fuses incremental information among adjacent frequency bands.Additionally,we add twoparallel three dimensional(3D)feature extraction branches to the backbone network to extractspectral and spatial features of varying granularity.We further enhance the backbone network’sconstruction results by leveraging the difference between two dimensional(2D)channel-groupingspatial features and 3D multi-granularity features.The results obtained by applying the proposednetwork model to the CAVE test set show that,at a scaling factor of×4,the peak signal to noiseratio,spectral angle mapping,and structural similarity are 37.310 dB,3.525 and 0.9438,respec-tively.Besides,extensive experiments conducted on the Harvard and Foster datasets demonstratethe superior potential of the proposed model in hyperspectral super-resolution reconstruction.

Ethical Decision-Making Framework Based on Incremental ILP Considering Conflicts

Humans are experiencing the inclusion of artificial agents in their lives,such as unmanned vehicles,service robots,voice assistants,and intelligent medical care.If the artificial agents cannot align with social values or make ethical decisions,they may not meet the expectations of humans.Traditionally,an ethical decision-making framework is constructed by rule-based or statistical approaches.In this paper,we propose an ethical decision-making framework based on incremental ILP(Inductive Logic Programming),which can overcome the brittleness of rule-based approaches and little interpretability of statistical approaches.As the current incremental ILP makes it difficult to solve conflicts,we propose a novel ethical decision-making framework considering conflicts in this paper,which adopts our proposed incremental ILP system.The framework consists of two processes:the learning process and the deduction process.The first process records bottom clauses with their score functions and learns rules guided by the entailment and the score function.The second process obtains an ethical decision based on the rules.In an ethical scenario about chatbots for teenagers’mental health,we verify that our framework can learn ethical rules and make ethical decisions.Besides,we extract incremental ILP from the framework and compare it with the state-of-the-art ILP systems based on ASP(Answer Set Programming)focusing on conflict resolution.The results of comparisons show that our proposed system can generate better-quality rules than most other systems.

CNN-LSTM based incremental attention mechanism enabled phase-space reconstruction for chaotic time series prediction

To improve the prediction accuracy of chaotic time series and reconstruct a more reasonable phase space structure of the prediction network,we propose a convolutional neural network-long short-term memory(CNN-LSTM)prediction model based on the incremental attention mechanism.Firstly,a traversal search is conducted through the traversal layer for finite parameters in the phase space.Then,an incremental attention layer is utilized for parameter judgment based on the dimension weight criteria(DWC).The phase space parameters that best meet DWC are selected and fed into the input layer.Finally,the constructed CNN-LSTM network extracts spatio-temporal features and provides the final prediction results.The model is verified using Logistic,Lorenz,and sunspot chaotic time series,and the performance is compared from the two dimensions of prediction accuracy and network phase space structure.Additionally,the CNN-LSTM network based on incremental attention is compared with long short-term memory(LSTM),convolutional neural network(CNN),recurrent neural network(RNN),and support vector regression(SVR)for prediction accuracy.The experiment results indicate that the proposed composite network model possesses enhanced capability in extracting temporal features and achieves higher prediction accuracy.Also,the algorithm to estimate the phase space parameter is compared with the traditional CAO,false nearest neighbor,and C-C,three typical methods for determining the chaotic phase space parameters.The experiments reveal that the phase space parameter estimation algorithm based on the incremental attention mechanism is superior in prediction accuracy compared with the traditional phase space reconstruction method in five networks,including CNN-LSTM,LSTM,CNN,RNN,and SVR.

Grouping tree species to estimate basal area increment in temperate multispecies forests in Durango,Mexico

Multispecies forests have received increased scientific attention,driven by the hypothesis that biodiversity improves ecological resilience.However,a greater species diversity presents challenges for forest management and research.Our study aims to develop basal area growth models for tree species cohorts.The analysis is based on a dataset of 423 permanent plots(2,500 m^(2))located in temperate forests in Durango,Mexico.First,we define tree species cohorts based on individual and neighborhood-based variables using a combination of principal component and cluster analyses.Then,we estimate the basal area increment of each cohort through the generalized additive model to describe the effect of tree size,competition,stand density and site quality.The principal component and cluster analyses assign a total of 37 tree species to eight cohorts that differed primarily with regard to the distribution of tree size and vertical position within the community.The generalized additive models provide satisfactory estimates of tree growth for the species cohorts,explaining between 19 and 53 percent of the total variation of basal area increment,and highlight the following results:i)most cohorts show a"rise-and-fall"effect of tree size on tree growth;ii)surprisingly,the competition index"basal area of larger trees"had showed a positive effect in four of the eight cohorts;iii)stand density had a negative effect on basal area increment,though the effect was minor in medium-and high-density stands,and iv)basal area growth was positively correlated with site quality except for an oak cohort.The developed species cohorts and growth models provide insight into their particular ecological features and growth patterns that may support the development of sustainable management strategies for temperate multispecies forests.

Selective and Adaptive Incremental Transfer Learning with Multiple Datasets for Machine Fault Diagnosis

The visions of Industry 4.0 and 5.0 have reinforced the industrial environment.They have also made artificial intelligence incorporated as a major facilitator.Diagnosing machine faults has become a solid foundation for automatically recognizing machine failure,and thus timely maintenance can ensure safe operations.Transfer learning is a promising solution that can enhance the machine fault diagnosis model by borrowing pre-trained knowledge from the source model and applying it to the target model,which typically involves two datasets.In response to the availability of multiple datasets,this paper proposes using selective and adaptive incremental transfer learning(SA-ITL),which fuses three algorithms,namely,the hybrid selective algorithm,the transferability enhancement algorithm,and the incremental transfer learning algorithm.It is a selective algorithm that enables selecting and ordering appropriate datasets for transfer learning and selecting useful knowledge to avoid negative transfer.The algorithm also adaptively adjusts the portion of training data to balance the learning rate and training time.The proposed algorithm is evaluated and analyzed using ten benchmark datasets.Compared with other algorithms from existing works,SA-ITL improves the accuracy of all datasets.Ablation studies present the accuracy enhancements of the SA-ITL,including the hybrid selective algorithm(1.22%-3.82%),transferability enhancement algorithm(1.91%-4.15%),and incremental transfer learning algorithm(0.605%-2.68%).These also show the benefits of enhancing the target model with heterogeneous image datasets that widen the range of domain selection between source and target domains.

CAN INCREMENTAL POLICIES SOLVE EMPLOYMENT PROBLEMS?

On October 8,the Information Office of the State Council of the People’s Republic of China held a press conference to outline the steps of“systematically implementing a package of incremental policies to solidly promote economic growth,structural optimization and sustained momentum of development”in the wake of the Third Plenary Session of the 20th Central Committee of the Communist Party of China.The series of policy measures mentioned at the press conference all demonstrated strong continuity,stability,and sustainability.The package of incremental policies reflects three“more attentions,”namely:more attention on improving the quality of economic development,more attention on supporting the healthy development of the real economy and business entities,and more attention on coordinating high-quality development and high-level security.One central goal is to promote high-quality full employment.

A Hybrid Optimization Approach of Single Point Incremental Sheet Forming of AISI 316L Stainless Steel Using Grey Relation Analysis Coupled with Principal Component Analysiss

We investigated the parametric optimization on incremental sheet forming of stainless steel using Grey Relational Analysis(GRA) coupled with Principal Component Analysis(PCA). AISI 316L stainless steel sheets were used to develop double wall angle pyramid with aid of tungsten carbide tool. GRA coupled with PCA was used to plan the experiment conditions. Control factors such as Tool Diameter(TD), Step Depth(SD), Bottom Wall Angle(BWA), Feed Rate(FR) and Spindle Speed(SS) on Top Wall Angle(TWA) and Top Wall Angle Surface Roughness(TWASR) have been studied. Wall angle increases with increasing tool diameter due to large contact area between tool and workpiece. As the step depth, feed rate and spindle speed increase,TWASR decreases with increasing tool diameter. As the step depth increasing, the hydrostatic stress is raised causing severe cracks in the deformed surface. Hence it was concluded that the proposed hybrid method was suitable for optimizing the factors and response.

Exact Rates of Convergence of Functional Limit Theorems for Csorgo-Revesz Increments of a Wiener Process

Let {W(t): t≥0} be a standard Wiener process and S be the Strassen set of functions. We investigate the exact rates of convergence to zero (as T→∞) of the variables sup_(0≤≤T-a_T inf_(f∈S sup_(0≤r≤1 |Y_t, T(x)-f(x)] and inf_(0≤t≤T-a_T sup_(0≤x≤1|Y_(t.T)(x)-f(x)| for any given f∈S, where Y_(t.T)(x)=(W(t+xa_T)-W(t))(2a_T(logTa_T^(-1)+log logT))^(-1/2). We establish a relation between how small the increments are and the functional limit results of Csrg-Revesz increments for a Wiener process. Similar results for partial sums of i.i.d, random variables are also given.

How big are the Csorgo-Revesz increments of two-parameter Wiener processes?

In this paper, we prove a theorem on the set of limit points of the increments of a two-parameter Wiener process via establishing a large deviation principle on the increments of the two-parameter Wiener process.

Filter Bank Networks for Few-Shot Class-Incremental Learning

Deep Convolution Neural Networks(DCNNs)can capture discriminative features from large datasets.However,how to incrementally learn new samples without forgetting old ones and recognize novel classes that arise in the dynamically changing world,e.g.,classifying newly discovered fish species,remains an open problem.We address an even more challenging and realistic setting of this problem where new class samples are insufficient,i.e.,Few-Shot Class-Incremental Learning(FSCIL).Current FSCIL methods augment the training data to alleviate the overfitting of novel classes.By contrast,we propose Filter Bank Networks(FBNs)that augment the learnable filters to capture fine-detailed features for adapting to future new classes.In the forward pass,FBNs augment each convolutional filter to a virtual filter bank containing the canonical one,i.e.,itself,and multiple transformed versions.During back-propagation,FBNs explicitly stimulate fine-detailed features to emerge and collectively align all gradients of each filter bank to learn the canonical one.FBNs capture pattern variants that do not yet exist in the pretraining session,thus making it easy to incorporate new classes in the incremental learning phase.Moreover,FBNs introduce model-level prior knowledge to efficiently utilize the limited few-shot data.Extensive experiments on MNIST,CIFAR100,CUB200,andMini-ImageNet datasets show that FBNs consistently outperformthe baseline by a significantmargin,reporting new state-of-the-art FSCIL results.In addition,we contribute a challenging FSCIL benchmark,Fishshot1K,which contains 8261 underwater images covering 1000 ocean fish species.The code is included in the supplementary materials.

Incremental Learning Based on Data Translation and Knowledge Distillation

Recently, deep convolutional neural networks (DCNNs) have achieved remarkable results in image classification tasks. Despite convolutional networks’ great successes, their training process relies on a large amount of data prepared in advance, which is often challenging in real-world applications, such as streaming data and concept drift. For this reason, incremental learning (continual learning) has attracted increasing attention from scholars. However, incremental learning is associated with the challenge of catastrophic forgetting: the performance on previous tasks drastically degrades after learning a new task. In this paper, we propose a new strategy to alleviate catastrophic forgetting when neural networks are trained in continual domains. Specifically, two components are applied: data translation based on transfer learning and knowledge distillation. The former translates a portion of new data to reconstruct the partial data distribution of the old domain. The latter uses an old model as a teacher to guide a new model. The experimental results on three datasets have shown that our work can effectively alleviate catastrophic forgetting by a combination of the two methods aforementioned.

ILIDViz:An incremental learning-based visual analysis system for network anomaly detection

Background With the development of information technology,there is a significant increase in the number of network traffic logs mixed with various types of cyberattacks.Traditional intrusion detection systems(IDSs)are limited in detecting new inconstant patterns and identifying malicious traffic traces in real time.Therefore,there is an urgent need to implement more effective intrusion detection technologies to protect computer security.Methods In this study,we designed a hybrid IDS by combining our incremental learning model(KANSOINN)and active learning to learn new log patterns and detect various network anomalies in real time.Conclusions Experimental results on the NSLKDD dataset showed that KAN-SOINN can be continuously improved and effectively detect malicious logs.Meanwhile,comparative experiments proved that using a hybrid query strategy in active learning can improve the model learning efficiency.

A Novel Incremental Attribute Reduction Algorithm Based on Intuitionistic Fuzzy Partition Distance

Attribute reduction,also known as feature selection,for decision information systems is one of the most pivotal issues in machine learning and data mining.Approaches based on the rough set theory and some extensions were proved to be efficient for dealing with the problemof attribute reduction.Unfortunately,the intuitionistic fuzzy sets based methods have not received much interest,while these methods are well-known as a very powerful approach to noisy decision tables,i.e.,data tables with the low initial classification accuracy.Therefore,this paper provides a novel incremental attribute reductionmethod to dealmore effectivelywith noisy decision tables,especially for highdimensional ones.In particular,we define a new reduct and then design an original attribute reduction method based on the distance measure between two intuitionistic fuzzy partitions.It should be noted that the intuitionistic fuzzypartitiondistance iswell-knownas aneffectivemeasure todetermine important attributes.More interestingly,an incremental formula is also developed to quickly compute the intuitionistic fuzzy partition distance in case when the decision table increases in the number of objects.This formula is then applied to construct an incremental attribute reduction algorithm for handling such dynamic tables.Besides,some experiments are conducted on real datasets to show that our method is far superior to the fuzzy rough set based methods in terms of the size of reduct and the classification accuracy.

Multi-scale Incremental Analysis Update Scheme and Its Application to Typhoon Mangkhut(2018)Prediction

In the traditional incremental analysis update(IAU)process,all analysis increments are treated as constant forcing in a model’s prognostic equations over a certain time window.This approach effectively reduces high-frequency oscillations introduced by data assimilation.However,as different scales of increments have unique evolutionary speeds and life histories in a numerical model,the traditional IAU scheme cannot fully meet the requirements of short-term forecasting for the damping of high-frequency noise and may even cause systematic drifts.Therefore,a multi-scale IAU scheme is proposed in this paper.Analysis increments were divided into different scale parts using a spatial filtering technique.For each scale increment,the optimal relaxation time in the IAU scheme was determined by the skill of the forecasting results.Finally,different scales of analysis increments were added to the model integration during their optimal relaxation time.The multi-scale IAU scheme can effectively reduce the noise and further improve the balance between large-scale and small-scale increments in the model initialization stage.To evaluate its performance,several numerical experiments were conducted to simulate the path and intensity of Typhoon Mangkhut(2018)and showed that:(1)the multi-scale IAU scheme had an obvious effect on noise control at the initial stage of data assimilation;(2)the optimal relaxation time for large-scale and small-scale increments was estimated as 6 h and 3 h,respectively;(3)the forecast performance of the multi-scale IAU scheme in the prediction of Typhoon Mangkhut(2018)was better than that of the traditional IAU scheme.The results demonstrate the superiority of the multi-scale IAU scheme.

基于增量学习的车联网恶意位置攻击检测研究

近年来,车辆恶意位置攻击检测中主要使用深度学习技术.然而,深度学习模型训练耗时巨大、参数众多,基于深度学习的检测方法缺乏可扩展性,无法适应车联网不断产生新数据的需求.为了解决以上问题,创新地将增量学习算法引入车辆恶意位置攻击检测中,解决了上述问题.首先从采集到的车辆信息数据中提取关键特征;然后,构建恶意位置攻击检测系统,利用岭回归近似快速地计算出车联网恶意位置攻击检测模型;最后,通过增量学习算法对恶意位置攻击检测模型进行更新和优化,以适应车联网中新生成的数据.实验结果表明,相比SVM,KNN,ANN等方法具有更优秀的性能,能够快速且渐进地更新和优化旧模型,提高系统对恶意位置攻击行为的检测精度.

基于分布式潮流控制器的海上风电系统谐波治理方法和控制策略

由于电力电缆的电容效应,海上风电经电缆汇集系统极易出现谐波谐振放大的现象,造成电能质量的下降。分布式潮流控制器属于基于电压源换流器的装置,在进行潮流调节的同时也能进行谐波治理。文中首先构建了海上风电系统的频域相关模型,基于该模型分析了谐波谐振放大的原因;随后,采用了将分布式潮流控制器串入海上风电系统的谐波治理方式,推导并得到了含分布式潮流控制器的海上风电系统的谐波特性。基于该谐波特性,设计了一种控制策略。该策略通过控制分布式潮流控制器实时跟踪使并网点谐波电压幅值为零的谐波补偿电压,从而降低并网点的谐波电压含量。仿真结果表明,所提出的基于分布式潮流控制器的海上风电系统谐波治理方法和控制策略能够有效地降低并网点的谐波电压,改善电能质量。

“双减”背景下作业减负增效的实证研究

有效减负需明确和平衡减负与增效的双重要求。作业减负增效的关键是科学控制作业量,减去额外负担,并通过提升作业有效性达到增效的目标。本研究基于2440名初二年级学生数学作业的实证数据,使用广义倾向值分析,探索中学生作业的减负增效途径。研究发现,数学作业时间与数学成绩呈倒U型关系,达到最佳成绩的每日数学作业时间为45分钟。随着学习机会的增加和数学兴趣的提升,学生达到最佳成绩的作业时间阈值呈现提前的趋势。对于学校教学而言,建议统筹管理作业,科学设计作业结构,减少作业总量;同时,建议提升课堂教育教学质量,增加学生获取知识的学习机会,提升数学学习兴趣,从而有效实现减负增效。