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.

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.

An Incremental Algorithm for Non-Slicing Floorplan Based on Corner Block List Representation

We present a novel incremental algorithm for non-slicing floorplans based on the corner block list representation. The horizontal and vertical adjacency graphs are derived from the packing of the initial floorplanning results. Based on the critical path and the accumulated slack distances we define,we choose the best position for insertion and do a series of operations incrementally, such as deleting modules, adding modules, and resizing modules quickly. This incremental floorplanning algorithm has a very high speed less than 1μm,which is one of the most important measures in this research. The algorithm preserves the original good performances on area and wire length. It can also supply other tools with good physical estimates for area, wire length, and other performance guidelines.

Springback prediction for incremental sheet forming based on FEM-PSONN technology

In the incremental sheet forming （ISF） process, springback is a very important factor that affects the quality of parts. Predicting and controlling springback accurately is essential for the design of the toolpath for ISF. A three-dimensional elasto-plastic finite element model （FEM） was developed to simulate the process and the simulated results were compared with those from the experiment. The springback angle was found to be in accordance with the experimental result, proving the FEM to be effective. A coupled artificial neural networks （ANN） and finite element method technique was developed to simulate and predict springback responses to changes in the processing parameters. A particle swarm optimization （PSO） algorithm was used to optimize the weights and thresholds of the neural network model. The neural network was trained using available FEM simulation data. The results showed that a more accurate prediction of s!oringback can be acquired using the FEM-PSONN model.

INCREMENTAL AUGMENT ALGORITHM BASED ON REDUCED Q-MATRIX

Reduced Q-matrix （Qr matrix） plays an important role in the rule space model （RSM） and the attribute hierarchy method （AHM）. Based on the attribute hierarchy, a valid/invalid item is defined. The judgment method of the valid/invalid item is developed on the relation between reachability matrix and valid items. And valid items are explained from the perspective of graph theory. An incremental augment algorithm for constructing Qr matrix is proposed based on the idea of incremental forward regression, and its validity is theoretically considered. Results of empirical tests are given in order to compare the performance of the incremental augment algo-rithm and the Tatsuoka algorithm upon the running time. Empirical evidence shows that the algorithm outper-forms the Tatsuoka algorithm, and the analysis of the two algorithms also show linear growth with respect to the number of valid items. Mathematical models with 10 attributes are built for the two algorithms by the linear regression analysis.

Incremental Placement Algorithm for Standard-Cell Layout

A new algorithm W ECOP is presented to effect incremental changes on a standard cell layout automatically.This algorithm deals with cell inserting and cell moving based on rows instead of on cells as most placement algorithms usually do.An integer programming problem is formulated to minimize the adjustment on the initial placement and a heuristic method is presented to search for a shifting path so as to optimize the wirelength.Test of W ECOP on a group of practical test cases shows that the algorithm can successfully accomplish incremental placement with good quality and high speed.

New Incremental Placement Algorithm Based on Integer Programming for Reducing Congestion

A new incremental placement algorithm C-ECOP for standard cell layout is presented to reduce routing congestion.It first estimates the routing congestion through a new routing model.Then,it formulates an integer linear programming (ILP) problem to determine cell flow direction and to avoid the conflictions between adjacent congestion areas.Experimental results show that the algorithm can considerably reduce routing congestion and preserve the performance of the initial placement with high speed.

Incremental Placement Algorithm for Timing and Routability Optimization

A new approach of incremental placement approach is described.The obtained timing information drives an efficient net-based placement technique,which dynamically adapts the net weights during successive placement steps.Several methods to combine timing optimization and congestion reducing together are proposed.Cells on critical paths are replaced according to timing and congestion constraints.Experimental results show that our approach can efficiently reduce cycle time and enhance route ability.The max path delay is reduced by 10% on an average afterincremental placement on wirelength-optimized circuits.And it achieves the same quality with a high speed up compared to timing driven detailed placement algorithm.

Use of Incremental Analysis Updates in 4D-Var Data Assimilation

The four-dimensional variational （4D-Var） data assimilation systems used in most operational and research centers use initial condition increments as control variables and adjust initial increments to find optimal analysis solutions. This approach may sometimes create discontinuities in analysis fields and produce undesirable spin ups and spin downs. This study explores using incremental analysis updates （IAU） in 4D-Var to reduce the analysis discontinuities. IAU-based 4D-Var has almost the same mathematical formula as conventional 4D-Var if the initial condition increments are replaced with time-integrated increments as control variables. The IAU technique was implemented in the NASA/GSFC 4D-Var prototype and compared against a control run without IAU. The results showed that the initial precipitation spikes were removed and that other discontinuities were also reduced, especially for the analysis of surface temperature.

An Incremental Model Transfer Method for Complex Process Fault Diagnosis

Fault diagnosis is an important measure to ensure the safety of production, and all kinds of fault diagnosis methods are of importance in actual production process. However, the complexity and uncertainty of production process often lead to the changes of data distribution and the emergence of new fault classes, and the number of the new fault classes is unpredictable. The reconstruction of the fault diagnosis model and the identification of new fault classes have become core issues under the circumstances. This paper presents a fault diagnosis method based on model transfer learning and the main contributions of the paper are as follows: 1) An incremental model transfer fault diagnosis method is proposed to reconstruct the new process diagnosis model. 2) Breaking the limit of existing method that the new process can only have one more class of faults than the old process, this method can identify M faults more in the new process with the thought of incremental learning. 3) The method offers a solution to a series of problems caused by the increase of fault classes. Experiments based on Tennessee-Eastman process and ore grinding classification process demonstrate the effectiveness and the feasibility of the method.

Multi-sensor optimal weighted fusion incremental Kalman smoother

In practical applications, the system observation error is widespread. If the observation equation of the system has not been verified or corrected under certain environmental conditions,the unknown system errors and filtering errors will come into being.The incremental observation equation is derived, which can eliminate the unknown observation errors effectively. Furthermore, an incremental Kalman smoother is presented. Moreover, a weighted measurement fusion incremental Kalman smoother applying the globally optimal weighted measurement fusion algorithm is given.The simulation results show their effectiveness and feasibility.

Reliability-based multidisciplinary design optimization using incremental shifting vector strategy and its application in electronic product design

Use of multidisciplinary analysis in reliabilitybased design optimization(RBDO) results in the emergence of the important method of reliability-based multidisciplinary design optimization(RBMDO). To enhance the efficiency and convergence of the overall solution process,a decoupling algorithm for RBMDO is proposed herein.Firstly, to decouple the multidisciplinary analysis using the individual disciplinary feasible(IDF) approach, the RBMDO is converted into a conventional form of RBDO. Secondly,the incremental shifting vector(ISV) strategy is adopted to decouple the nested optimization of RBDO into a sequential iteration process composed of design optimization and reliability analysis, thereby improving the efficiency significantly. Finally, the proposed RBMDO method is applied to the design of two actual electronic products: an aerial camera and a car pad. For these two applications, two RBMDO models are created, each containing several finite element models(FEMs) and relatively strong coupling between the involved disciplines. The computational results demonstrate the effectiveness of the proposed method.

Improving convergence of incremental harmonic balance method using homotopy analysis method

We have deduced incremental harmonic balance an iteration scheme in the （IHB） method using the harmonic balance plus the Newton-Raphson method. Since the convergence of the iteration is dependent upon the initial values in the iteration, the convergent region is greatly restricted for some cases. In this contribution, in order to enlarge the convergent region of the IHB method, we constructed the zeroth-order deformation equation using the homotopy analysis method, in which the IHB method is employed to solve the deformation equation with an embedding parameter as the active increment. Taking the Duffing and the van der Pol equations as examples, we obtained the highly accurate solutions. Importantly, the presented approach renders a convenient way to control and adjust the convergence.

A new insertion sequence for incremental Delaunay triangulation

Incremental algorithm is one of the most popular procedures for constructing Delaunay triangulations （DTs）. However, the point insertion sequence has a great impact on the amount of work needed for the construction of DTs. It affects the time for both point location and structure update, and hence the overall computational time of the triangulation algorithm. In this paper, a simple deterministic insertion sequence is proposed based on the breadth-first-search on a Kd-tree with some minor modifications for better performance. Using parent nodes as search-hints, the proposed insertion sequence proves to be faster and more stable than the Hilbert curve order and biased randomized insertion order （BRIO）, especially for non-uniform point distributions over a wide range of benchmark examples.