Bidirectional rotating direct-current triboelectric nanogenerator with self-adaptive mechanical switching for harvesting reciprocating motion

Amid the growing interest in triboelectric nanogenerators(TENGs)as novel energy-harvesting devices,several studies have focused on direct current(DC)TENGs to generate a stable DC output for operating electronic devices.However,owing to the working mechanisms of conventional DC TENGs,generating a stable DC output from reciprocating motion remains a challenge.Accordingly,we propose a bidirectional rotating DC TENG(BiR-TENG),which can generate DC outputs,regardless of the direction of rotation,from reciprocating motions.The distinct design of the BiR-TENG enables the mechanical rectification of the alternating current output into a rotational-direction-dependent DC output.Furthermore,it allows the conversion of the rotational-direction-dependent DC output into a unidirectional DC output by adapting the configurations depending on the rotational direction.Owing to these tailored design strategies and subsequent optimizations,the BiR-TENG could generate an effective unidirectional DC output.Applications of the BiR-TENG for the reciprocating motions of swinging doors and waves were demonstrated by harnessing this output.This study demonstrates the potential of the BiR-TENG design strategy as an effective and versatile solution for energy harvesting from reciprocating motions,highlighting the suitability of DC outputs as an energy source for electronic devices.

A multi-scale second-order autoregressive recursive filter approach for the sea ice concentration analysis

To effectively extract multi-scale information from observation data and improve computational efficiency,a multi-scale second-order autoregressive recursive filter(MSRF)method is designed.The second-order autoregressive filter used in this study has been attempted to replace the traditional first-order recursive filter used in spatial multi-scale recursive filter(SMRF)method.The experimental results indicate that the MSRF scheme successfully extracts various scale information resolved by observations.Moreover,compared with the SMRF scheme,the MSRF scheme improves computational accuracy and efficiency to some extent.The MSRF scheme can not only propagate to a longer distance without the attenuation of innovation,but also reduce the mean absolute deviation between the reconstructed sea ice concentration results and observations reduced by about 3.2%compared to the SMRF scheme.On the other hand,compared with traditional first-order recursive filters using in the SMRF scheme that multiple filters are executed,the MSRF scheme only needs to perform two filter processes in one iteration,greatly improving filtering efficiency.In the two-dimensional experiment of sea ice concentration,the calculation time of the MSRF scheme is only 1/7 of that of SMRF scheme.This means that the MSRF scheme can achieve better performance with less computational cost,which is of great significance for further application in real-time ocean or sea ice data assimilation systems in the future.

Dynamic Economic Scheduling with Self-Adaptive Uncertainty in Distribution Network Based on Deep Reinforcement Learning

Traditional optimal scheduling methods are limited to accurate physical models and parameter settings, which aredifficult to adapt to the uncertainty of source and load, and there are problems such as the inability to make dynamicdecisions continuously. This paper proposed a dynamic economic scheduling method for distribution networksbased on deep reinforcement learning. Firstly, the economic scheduling model of the new energy distributionnetwork is established considering the action characteristics of micro-gas turbines, and the dynamic schedulingmodel based on deep reinforcement learning is constructed for the new energy distribution network system with ahigh proportion of new energy, and the Markov decision process of the model is defined. Secondly, Second, for thechanging characteristics of source-load uncertainty, agents are trained interactively with the distributed networkin a data-driven manner. Then, through the proximal policy optimization algorithm, agents adaptively learn thescheduling strategy and realize the dynamic scheduling decision of the new energy distribution network system.Finally, the feasibility and superiority of the proposed method are verified by an improved IEEE 33-node simulationsystem.

Non-Recursive Base Conversion Using a Deterministic Markov Process

We prove that non-recursive base conversion can always be implemented by using a deterministic Markov process. Our paper discusses the pros and cons of recursive and non-recursive methods, in general. And we include a comparison between non-recursion and a deterministic Markov process, proving that the Markov process is twice as efficient.

Numerical simulation of LWD resistivity response of carbonate formation using self-adaptive hp-FEM

Most of the carbonate formation are highly heterogeneous with cavities of different sizes, which makes the prediction of cavity-filled reservoir in carbonate rocks difficult. Large cavities in carbonate formations pose serious threat to drilling operations. Logging-whiledrilling （LWD） is currently used to accurately identify and evaluate cavities in reservoirs during drilling. In this study, we use the self-adaptive hp-FEM algorithm simulate and calculate the LWD resistivity responses of fracture-cavity reservoir cavities. Compared with the traditional h-FEM method, the self-adaptive hp-FEM algorithm has the characteristics of the self-adaptive mesh refinement and the calculations exponentially converge to highly accurate solutions. Using numerical simulations, we investigated the effect of the cavity size, distance between cavity and borehole, and transmitted frequency on the LWD resistivity response. Based on the results, a method for recognizing cavities is proposed. This research can provide the theoretical basis for the accurate identification and quantitative evaluation of various carbonate reservoirs with cavities encountered in practice.

EVOLUTIONARY FUZZY GUIDANCE LAW WITH SELF-ADAPTIVE REGION

Effective guidance is one of the most important tasks to the performance of air-to-air missile. The fuzzy logic controller is able to perform effectively even in situations where the information about the plant is inaccurate and the operating conditions are uncertain. Based on the proportional navigation, the fuzzy logic and the genetic algorithm are combined to develop an evolutionary fuzzy navigation law with self-adapt region for the air-to-air missile guidance. The line of sight (LOS) rate and the closing speed between the missile and the target are inputs of the fuzzy controller. The output of the fuzzy controller is the commanded acceleration. Then a nonlinear function based on the conventional fuzzy logic control is imported to change the region. This nonlinear function can be changed with the input variables. So the dynamic change of the fuzzy variable region is achieved. The guidance law is optimized by the genetic algorithm. Simulation results of air-to-air missile attack using MATLAB show that the method needs less acceleration and shorter flying time, and its realization is simple.[KH*3/4D]

Poststack reverse-time migration using a non-reflecting recursive algorithm on surface relief

Presently the research based on the accurate seismic imaging methods for surface relief, complex structure, and complicated velocity distributions is of great significance. Reverse-time migration is considered to be one of highly accurate methods. In this paper, we propose a new non-reflecting recursive algorithm for reverse-time migration by introducing the wave impedance function into the acoustic wave equation and the algorithm for the surface relief case is derived from the coordinate transformation principle. Using the exploding reflector principle and the zero-time imaging condition of poststack reverse- time migration, poststack numerical simulation and reverse-time migration with complex conditions can be realized. The results of synthetic and real data calculations show that the method effectively suppresses unwanted internal reflections and also deals with the seismic imaging problems resulting from surface relief. So, we prove that this method has strong adaptability and practicality.

BIO-INSPIRED SELF-ADAPTIVE MANUFACTURING SYSTEM CONTROL ARCHITECTURE

Future manufacturing systems need to cope with frequent changes and disturbances, therefore their control architectures require constant adaptability, agility, stability, self-organization, intelligence, and robustness. Bio-inspired manufacturing system can well satisfy these requirements. For this purpose, by referencing the biological organization structure and the mechanism, a bio-inspired manufacturing cell is presented from a novel view, and then a bio-inspired self-adaptive manufacturing model is established based on the ultra-short feedback mechanism of the neuro-endocrine system. A hio-inspired self-adaptive manufacturing system coordinated model is also established based on the neuro-endocrine-immunity system （NEIS）. Finally, an example based on pheromone communication mechanism indicates that the robustness of the whole manufacturing system is improved by bio-inspired technologies.

Calculation connectivity reliability of road networks based on recursive decomposition arithmetic

In order to decrease the calculation complexity of connectivity reliability of road networks, an improved recursive decomposition arithmetic is proposed. First, the basic theory of recursive decomposition arithmetic is reviewed. Then the characteristics of road networks, which are different from general networks, are analyzed. Under this condition, an improved recursive decomposition arithmetic is put forward which fits road networks better. Furthermore, detailed calculation steps are presented which are convenient for the computer, and the advantage of the approximate arithmetic is analyzed based on this improved arithmetic. This improved recursive decomposition arithmetic directly produces disjoint minipaths and avoids the non-polynomial increasing problems. And because the characteristics of road networks are considered, this arithmetic is greatly simplified. Finally, an example is given to prove its validity.

FAST RECURSIVE LEAST SQUARES LEARNING ALGORITHM FOR PRINCIPAL COMPONENT ANALYSIS

Based on the least-square minimization a computationally efficient learning algorithm for the Principal Component Analysis(PCA) is derived. The dual learning rate parameters are adaptively introduced to make the proposed algorithm providing the capability of the fast convergence and high accuracy for extracting all the principal components. It is shown that all the information needed for PCA can be completely represented by the unnormalized weight vector which is updated based only on the corresponding neuron input-output product. The convergence performance of the proposed algorithm is briefly analyzed.The relation between Oja’s rule and the least squares learning rule is also established. Finally, a simulation example is given to illustrate the effectiveness of this algorithm for PCA.

Recursive Least Square Vehicle Mass Estimation Based on Acceleration Partition

Vehicle mass is an important parameter in vehicle dynamics control systems. Although many algorithms have been developed for the estimation of mass, none of them have yet taken into account the different types of resistance that occur under different conditions. This paper proposes a vehicle mass estimator. The estimator incorporates road gradient information in the longitudinal accelerometer signal, and it removes the road grade from the longitudinal dynamics of the vehicle. Then, two different recursive least square method （RLSM） schemes are proposed to estimate the driving resistance and the mass independently based on the acceleration partition under different conditions. A 6 DOF dynamic model of four In-wheel Motor Vehicle is built to assist in the design of the algorithm and in the setting of the parameters. The acceleration limits are determined to not only reduce the estimated error but also ensure enough data for the resistance estimation and mass estimation in some critical situations. The modification of the algorithm is also discussed to improve the result of the mass estimation. Experiment data on asphalt road, plastic runway, and gravel road and on sloping roads are used to validate the estimation algorithm. The adaptability of the algorithm is improved by using data collected under several critical operating conditions. The experimental results show the error of the estimation process to be within 2.6%, which indicates that the algorithm can estimate mass with great accuracy regardless of the road surface and gradient changes and that it may be valuable in engineering applications. This paper proposes a recursive least square vehicle mass estimation method based on acceleration partition.

FOUR-PARAMETER AUTOMATIC TRANSMISSION TECHNOLOGY FOR CONSTRUCTION VEHICLE BASED ON ELMAN RECURSIVE NEURAL NETWORK

From the viewpoint of energy saving and improving transmission efficiency, the ZL50E wheel loader is taken as the study object. And the system model is analyzed based on the transmission system of the construction vehicle. A new four-parameter shift schedule is presented, which can keep the torque converter working in the high efficiency area. The control algorithm based on the Elman recursive neural network is applied, and four-parameter control system is developed which is based on industrial computer. The system is used to collect data accurately and control 4D180 power-shift gearbox of ZL50E wheel loader shift timely. An experiment is done on automatic transmission test-bed, and the result indicates that the control system could reliably and safely work and improve the efficiency of hydraulic torque converter. Four-parameter shift strategy that takes into account the power consuming of the working pump has important operating significance and reflects the actual working status of construction vehicle.

New recursive algorithm for matrix inversion

To reduce the computational complexity of matrix inversion, which is the majority of processing in many practical applications, two numerically efficient recursive algorithms （called algorithms I and II, respectively） are presented. Algorithm I is used to calculate the inverse of such a matrix, whose leading principal minors are all nonzero. Algorithm II, whereby, the inverse of an arbitrary nonsingular matrix can be evaluated is derived via improving the algorithm I. The implementation, for algorithm II or I, involves matrix-vector multiplications and vector outer products. These operations are computationally fast and highly parallelizable. MATLAB simulations show that both recursive algorithms are valid.

Piecewise linear recursive convolution FDTD method for magnetized plasmas

The piecewise linear recursive convolution （PLRC） finite-different time-domain （FDTD） method greatly improves accuracy over the original recursive convolution （RC） FDTD approach but retains its speed and efficiency advantages. A PLRC-FDTD formulation for magnetized plasma which incorporates both anisotropy and frequency dispersion at the same time is presented, enabled the transient analysis of magnetized plasma media. The technique is illustrated by numerical simulations the reflection and transmission coefficients through a magnetized plasma layer. The results show that the PLRC-FDTD method has significantly improved the accuracy over the original RC method.

Recursive Partitioning Analysis Classification and Graded Prognostic Assessment for Non-Small Cell Lung Cancer Patients with Brain Metastasis:A Retrospective Cohort Study

Objective：To assess prognostic factors and validate the effectiveness of recursive partitioning analysis （RPA） classes and graded prognostic assessment （GPA） in 290 non-small cell lung cancer （NSCLC） patients with brain metastasis （BM）.Methods：From Jan 2008 to Dec 2009,the clinical data of 290 NSCLC cases with BM treated with multiple modalities including brain irradiation,systemic chemotherapy and tyrosine kinase inhibitors （TKIs） in two institutes were analyzed.Survival was estimated by Kaplan-Meier method.The differences of survival rates in subgroups were assayed using log-rank test.Multivariate Cox＇s regression method was used to analyze the impact of prognostic factors on survival.Two prognostic indexes models （RPA and GPA） were validated respectively.Results：All patients were followed up for 1-44 months,the median survival time after brain irradiation and its corresponding 95% confidence interval （95% CI） was 14 （12.3-15.8） months.1-,2-and 3-year survival rates in the whole group were 56.0%,28.3%,and 12.0%,respectively.The survival curves of subgroups,stratified by both RPA and GPA,were significantly different （P0.001）.In the multivariate analysis as RPA and GPA entered Cox＇s regression model,Karnofsky performance status （KPS） ≥ 70,adenocarcinoma subtype,longer administration of TKIs remained their prognostic significance,RPA classes and GPA also appeared in the prognostic model.Conclusion：KPS ≥70,adenocarcinoma subtype,longer treatment of molecular targeted drug,and RPA classes and GPA are the independent prognostic factors affecting the survival rates of NSCLC patients with BM.

Recursive State-space Model Identification of Non-uniformly Sampled Systems Using Singular Value Decomposition

In this paper a recursive state-space model identification method is proposed for non-uniformly sampled systems in industrial applications. Two cases for measuring all states and only output(s) of such a system are considered for identification. In the case of state measurement, an identification algorithm based on the singular value decomposition(SVD) is developed to estimate the model parameter matrices by using the least-squares fitting. In the case of output measurement only, another identification algorithm is given by combining the SVD approach with a hierarchical identification strategy. An example is used to demonstrate the effectiveness of the proposed identification method.

Fast recursive algorithm for two-dimensional Tsallis entropy thresholding method

Recently, a two-dimensional （2-D） Tsallis entropy thresholding method has been proposed as a new method for image segmentation. But the computation complexity of 2-D Tsallis entropy is very large and becomes an obstacle to real time image processing systems. A fast recursive algorithm for 2-D Tsallis entropy thresholding is proposed. The key variables involved in calculating 2-D Tsallis entropy are written in recursive form. Thus, many repeating calculations are avoided and the computation complexity reduces to O（L2） from O（L4）. The effectiveness of the proposed algorithm is illustrated by experimental results.

Research on SINS Error Recursive Model of Ballistic Missile

The strap-down inertial navigation system (SINS) error of ballistic missile is generated by the mutual influence of gyroscope and accelerometer, and the recursive model is completely different from that of gimbaled INS. In the paper, a discrete error recursive model was obtained by studying the applied SINS error model of ballistic missile, and the discrete Kalman filtering simulation based on the model was carried out. The simulated results show that the model can depict the SINS error exactly and provide the advantages for research on integrated guidance and improved hit accuracy.

Self-adaptive learning based discrete differential evolution algorithm for solving CJWTA problem

Cooperative jamming weapon-target assignment （CJWTA） problem is a key issue in electronic countermeasures （ECM）. Some symbols which relevant to the CJWTA are defined firstly. Then, a formulation of jamming fitness is presented. Final y, a model of the CJWTA problem is constructed. In order to solve the CJWTA problem efficiently, a self-adaptive learning based discrete differential evolution （SLDDE） algorithm is proposed by introduc-ing a self-adaptive learning mechanism into the traditional discrete differential evolution algorithm. The SLDDE algorithm steers four candidate solution generation strategies simultaneously in the framework of the self-adaptive learning mechanism. Computa-tional simulations are conducted on ten test instances of CJWTA problem. The experimental results demonstrate that the proposed SLDDE algorithm not only can generate better results than only one strategy based discrete differential algorithms, but also outper-forms two algorithms which are proposed recently for the weapon-target assignment problems.

Large eddy simulation of aircraft wake vortex with self-adaptive grid method

A self-adaptive-grid method is applied to numerical simulation of the evolu- tion of aircraft wake vortex with the large eddy simulation （LES）. The Idaho Falls （IDF） measurement of run 9 case is simulated numerically and compared with that of the field experimental data. The comparison shows that the method is reliable in the complex atmospheric environment with crosswind and ground effect. In addition, six cases with different ambient atmospheric turbulences and Brunt V^iis/il^i （BV） frequencies are com- puted with the LES. The main characteristics of vortex are appropriately simulated by the current method. The onset time of rapid decay and the descending of vortices are in agreement with the previous measurements and the numerical prediction. Also, sec-ondary structures such as baroclinic vorticity and helical structures are also simulated. Only approximately 6 million grid points are needed in computation with the present method, while the number can be as large as 34 million when using a uniform mesh with the same core resolution. The self-adaptive-grid method is proved to be practical in the numerical research of aircraft wake vortex.