花椒病虫害绿色防控技术研究进展

花椒(Zanthoxylum bungeanum Maxim.)经济价值较高,在中国广泛种植,但其生长过程中易遭受病虫危害,科学的防治技术措施对花椒的绿色发展至关重要。从生态调控技术、生物防治技术、理化诱控技术、科学用药技术4个方面对花椒病虫害绿色防控技术进行综述,以期为生产上花椒病虫害绿色防控提供参考。

二分图中高效计算top-n maximalα-biclique的方法研究

针对当二分图中一类节点的数量固定时,如何搜索另一类型节点数量排序为前n的maximalα-biclique的问题,提出了一种基础搜索算法和一种基于共同邻居概念的改进搜索算法。在使用(1,α)-core剪枝方法加快搜索的算法基础上,基于共同邻居搜索算法使用共同邻居的概念对算法进行了改进,该算法只遍历节点的二跳邻居,并利用节点顺序和最小阈值提高搜索效率。实验结果表明,两种算法都可以有效且高效地搜索节点数量排名为前n的maximalα-biclique。与基础搜索算法相比,基于共同邻居搜索算法的搜索效率提升了80%,在实际应用场景中更具优势。

Revisiting the stretch-induced force deficit:A systematic review with multilevel meta-analysis of acute effects

Background:When recommending avoidance of static stretching prior to athletic performance,authors and practitioners commonly refer to available systematic reviews.However,effect sizes(ES)in previous reviews were extracted in major part from studies lacking control conditions and/or prepost testing designs.Also,currently available reviews conducted calculations without accounting for multiple study outcomes,with ES:0.03 to 0.10,which would commonly be classified as trivial.Methods:Since new meta-analytical software and controlled research articles have appeared since 2013,we revisited the available literatures and performed a multilevel meta-analysis using robust variance estimation of controlled prepost trials to provide updated evidence.Furthermore,previous research described reduced electromyography activity—also attributable to fatiguing training routines—as being responsible for decreased subsequent performance.The second part of this study opposed stretching and alternative interventions sufficient to induce general fatigue to examine whether static stretching induces higher performance losses compared to other exercise routines.Results:Including 83 studies with more than 400 ES from 2012 participants,our results indicate a significant,small ES for a static stretch-induced maximal strength loss(ES=0.21,p=0.003),with high magnitude ES(ES=0.84,p=0.004)for stretching durations≥60 s per bout when compared to passive controls.When opposed to active controls,the maximal strength loss ranges between ES:0.17 to0.28,p<0.001 and 0.040 with mostly no to small heterogeneity.However,stretching did not negatively influence athletic performance in general(when compared to both passive and active controls);in fact,a positive effect on subsequent jumping performance(ES=0.15,p=0.006)was found in adults.Conclusion:Regarding strength testing of isolated muscles(e.g.,leg extensions or calf raises),our results confirm previous findings.Nevertheless,since no(or even positive)effects could be found for athletic performance,our results do not support previous recommendations to exclude static stretching from warm-up routines prior to,for example,jumping or sprinting.

VARIATIONAL ANALYSIS FOR THE MAXIMAL TIME FUNCTION IN NORMED SPACES

For a general normed vector space,a special optimal value function called a maximal time function is considered.This covers the farthest distance function as a special case,and has a close relationship with the smallest enclosing ball problem.Some properties of the maximal time function are proven,including the convexity,the lower semicontinuity,and the exact characterizations of its subdifferential formulas.

GLOBAL BOUND ON THE GRADIENT OF SOLUTIONS TO p-LAPLACE TYPE EQUATIONS WITH MIXED DATA

In this paper,the study of gradient regularity for solutions of a class of elliptic problems of p-Laplace type is offered.In particular,we prove a global result concerning Lorentz-Morrey regularity of the non-homogeneous boundary data problem:-div((s^(2)+|▽u|^(2)p-2/2)▽u)=-div(|f|^(p-2)f)+g inΩ,u=h in■Ω,with the(sub-elliptic)degeneracy condition s∈[0,1]and with mixed data f∈L^(p)(Q;R^(n)),g∈Lp/(p-1)(Ω;R^(n))for p∈(1,n).This problem naturally arises in various applications such as dynamics of non-Newtonian fluid theory,electro-rheology,radiation of heat,plastic moulding and many others.Building on the idea of level-set inequality on fractional maximal distribution functions,it enables us to carry out a global regularity result of the solution via fractional maximal operators.Due to the significance of M_(α)and its relation with Riesz potential,estimates via fractional maximal functions allow us to bound oscillations not only for solution but also its fractional derivatives of orderα.Our approach therefore has its own interest.

A Bitcoin Address Multi-Classification Mechanism Based on Bipartite Graph-Based Maximization Consensus

Bitcoin is widely used as the most classic electronic currency for various electronic services such as exchanges,gambling,marketplaces,and also scams such as high-yield investment projects.Identifying the services operated by a Bitcoin address can help determine the risk level of that address and build an alert model accordingly.Feature engineering can also be used to flesh out labeled addresses and to analyze the current state of Bitcoin in a small way.In this paper,we address the problem of identifying multiple classes of Bitcoin services,and for the poor classification of individual addresses that do not have significant features,we propose a Bitcoin address identification scheme based on joint multi-model prediction using the mapping relationship between addresses and entities.The innovation of the method is to(1)Extract as many valuable features as possible when an address is given to facilitate the multi-class service identification task.(2)Unlike the general supervised model approach,this paper proposes a joint prediction scheme for multiple learners based on address-entity mapping relationships.Specifically,after obtaining the overall features,the address classification and entity clustering tasks are performed separately,and the results are subjected to graph-basedmaximization consensus.The final result ismade to baseline the individual address classification results while satisfying the constraint of having similarly behaving entities as far as possible.By testing and evaluating over 26,000 Bitcoin addresses,our feature extraction method captures more useful features.In addition,the combined multi-learner model obtained results that exceeded the baseline classifier reaching an accuracy of 77.4%.

Continuity of truncated Hardy-Littlewood maximal function

This paper focuses on the continuity of the truncated Hardy-Littlewood maximal function.We first show that the truncated Hardy-Littlewood maximal function is lower semi-continuous.Then by investigating the behavior of the truncated Hardy-Littlewood maximal function when the truncated parameterγchanges,we obtain an equivalent condition of the continuity of the truncated Hardy-Littlewood maximal function.

Quantized Decoders that Maximize Mutual Information for Polar Codes

In this paper,we innovatively associate the mutual information with the frame error rate(FER)performance and propose novel quantized decoders for polar codes.Based on the optimal quantizer of binary-input discrete memoryless channels(BDMCs),the proposed decoders quantize the virtual subchannels of polar codes to maximize mutual information(MMI)between source bits and quantized symbols.The nested structure of polar codes ensures that the MMI quantization can be implemented stage by stage.Simulation results show that the proposed MMI decoders with 4 quantization bits outperform the existing nonuniform quantized decoders that minimize mean-squared error(MMSE)with 4 quantization bits,and yield even better performance than uniform MMI quantized decoders with 5 quantization bits.Furthermore,the proposed 5-bit quantized MMI decoders approach the floating-point decoders with negligible performance loss.

Community detection on elite mathematicians’collaboration network

Purpose:This study focuses on understanding the collaboration relationships among mathematicians,particularly those esteemed as elites,to reveal the structures of their communities and evaluate their impact on the field of mathematics.Design/methodology/approach:Two community detection algorithms,namely Greedy Modularity Maximization and Infomap,are utilized to examine collaboration patterns among mathematicians.We conduct a comparative analysis of mathematicians’centrality,emphasizing the influence of award-winning individuals in connecting network roles such as Betweenness,Closeness,and Harmonic centrality.Additionally,we investigate the distribution of elite mathematicians across communities and their relationships within different mathematical sub-fields.Findings:The study identifies the substantial influence exerted by award-winning mathematicians in connecting network roles.The elite distribution across the network is uneven,with a concentration within specific communities rather than being evenly dispersed.Secondly,the research identifies a positive correlation between distinct mathematical sub-fields and the communities,indicating collaborative tendencies among scientists engaged in related domains.Lastly,the study suggests that reduced research diversity within a community might lead to a higher concentration of elite scientists within that specific community.Research limitations:The study’s limitations include its narrow focus on mathematicians,which may limit the applicability of the findings to broader scientific fields.Issues with manually collected data affect the reliability of conclusions about collaborative networks.Practical implications:This study offers valuable insights into how elite mathematicians collaborate and how knowledge is disseminated within mathematical circles.Understanding these collaborative behaviors could aid in fostering better collaboration strategies among mathematicians and institutions,potentially enhancing scientific progress in mathematics.Originality/value:The study adds value to understanding collaborative dynamics within the realm of mathematics,offering a unique angle for further exploration and research.

A grouping strategy for reinforcement learning-based collective yawcontrol of wind farms

Reinforcement learning(RL)algorithms are expected to become the next generation of wind farm control methods.However,as wind farms continue to grow in size,the computational complexity of collective wind farm control will exponentially increase with the growth of action and state spaces,limiting its potential in practical applications.In this Letter,we employ a RL-based wind farm control approach with multi-agent deep deterministic policy gradient to optimize the yaw manoeuvre of grouped wind turbines in wind farms.To reduce the computational complexity,the turbines in the wind farm are grouped according to the strength of the wake interaction.Meanwhile,to improve the control efficiency,each subgroup is treated as a whole and controlled by a single agent.Optimized results show that the proposed method can not only increase the power production of the wind farm but also significantly improve the control efficiency.

Improving throughput in SWIPT-based wireless multirelay networks with relay selection and rateless codes

This paper studies a dual-hop Simultaneous Wireless Information and Power Transfer(SWIPT)-based multi-relay network with a direct link.To achieve high throughput in the network,a novel protocol is first developed,in which the network can switch between a direct transmission mode and a Single-Relay-Selection-based Cooperative Transmission(SRS-CT)mode that employs dynamic decode-and-forward relaying accomplished with Rateless Codes(RCs).Then,under this protocol,an optimization problem is formulated to jointly optimize the network operation mode and the resource allocation in the SRS-CT mode.The formulated problem is difficult to solve because not only does the noncausal Channel State Information(CSI)cause the problem to be stochastic,but also the energy state evolution at each relay is complicated by network operation mode decision and resource allocation.Assuming that noncausal CSI is available,the stochastic optimization issue is first to be addressed by solving an involved deterministic optimization problem via dynamic programming,where the complicated energy state evolution issue is addressed by a layered optimization method.Then,based on a finite-state Markov channel model and assuming that CSI statistical properties are known,the stochastic optimization problem is solved by extending the result derived for the noncausal CSI case to the causal CSI case.Finally,a myopic strategy is proposed to achieve a tradeoff between complexity and performance without the knowledge of CSI statistical properties.The simulation results verify that our proposed SRS-and-RC-based design can achieve a maximum of approximately 40%throughput gain over a simple SRS-and-RC-based baseline scheme in SWIPT-based multi-relay networks.

Hybrid Block Diagonalization Precoding for Multi-User Weighted Sum-Rate Maximization

This paper studies large-scale multi-input multi-output(MIMO)orthogonal frequency division multiplexing(OFDM)communications in a broadband frequency-selective channel,where a massive MIMO base station(BS)communicates with multiple users equipped with multi-antenna.We develop a hybrid precoding design to maximize the weighted sum-rate(WSR)of the users by optimizing the digital and the analog precoders alternately.For the digital part,we employ block-diagonalization to eliminate inter-user interference and apply water-filling power allocation to maximize the WSR.For the analog part,the optimization of the PSN is formulated as an unconstrained problem,which can be efficiently solved by a gradient descent method.Numerical results show that the proposed block-diagonal hybrid precoding algorithm can outperform the existing works.

CRB:A new rumor blocking algorithm in online social networks based on competitive spreading model and influence maximization

The virtuality and openness of online social platforms make networks a hotbed for the rapid propagation of various rumors.In order to block the outbreak of rumor,one of the most effective containment measures is spreading positive information to counterbalance the diffusion of rumor.The spreading mechanism of rumors and effective suppression strategies are significant and challenging research issues.Firstly,in order to simulate the dissemination of multiple types of information,we propose a competitive linear threshold model with state transition(CLTST)to describe the spreading process of rumor and anti-rumor in the same network.Subsequently,we put forward a community-based rumor blocking(CRB)algorithm based on influence maximization theory in social networks.Its crucial step is to identify a set of influential seeds that propagate anti-rumor information to other nodes,which includes community detection,selection of candidate anti-rumor seeds and generation of anti-rumor seed set.Under the CLTST model,the CRB algorithm has been compared with six state-of-the-art algorithms on nine online social networks to verify the performance.Experimental results show that the proposed model can better reflect the process of rumor propagation,and review the propagation mechanism of rumor and anti-rumor in online social networks.Moreover,the proposed CRB algorithm has better performance in weakening the rumor dissemination ability,which can select anti-rumor seeds in networks more accurately and achieve better performance in influence spread,sensitivity analysis,seeds distribution and running time.

Policy Network-Based Dual-Agent Deep Reinforcement Learning for Multi-Resource Task Offloading in Multi-Access Edge Cloud Networks

The Multi-access Edge Cloud(MEC) networks extend cloud computing services and capabilities to the edge of the networks. By bringing computation and storage capabilities closer to end-users and connected devices, MEC networks can support a wide range of applications. MEC networks can also leverage various types of resources, including computation resources, network resources, radio resources,and location-based resources, to provide multidimensional resources for intelligent applications in 5/6G.However, tasks generated by users often consist of multiple subtasks that require different types of resources. It is a challenging problem to offload multiresource task requests to the edge cloud aiming at maximizing benefits due to the heterogeneity of resources provided by devices. To address this issue,we mathematically model the task requests with multiple subtasks. Then, the problem of task offloading of multi-resource task requests is proved to be NP-hard. Furthermore, we propose a novel Dual-Agent Deep Reinforcement Learning algorithm with Node First and Link features(NF_L_DA_DRL) based on the policy network, to optimize the benefits generated by offloading multi-resource task requests in MEC networks. Finally, simulation results show that the proposed algorithm can effectively improve the benefit of task offloading with higher resource utilization compared with baseline algorithms.

A self-organization formation configuration based assignment probability and collision detection

The formation control of multiple unmanned aerial vehicles(multi-UAVs)has always been a research hotspot.Based on the straight line trajectory,a multi-UAVs target point assignment algorithm based on the assignment probability is proposed to achieve the shortest overall formation path of multi-UAVs with low complexity and reduce the energy consumption.In order to avoid the collision between UAVs in the formation process,the concept of safety ball is introduced,and the collision detection based on continuous motion of two time slots and the lane occupation detection after motion is proposed to avoid collision between UAVs.Based on the idea of game theory,a method of UAV motion form setting based on the maximization of interests is proposed,including the maximization of self-interest and the maximization of formation interest is proposed,so that multi-UAVs can complete the formation task quickly and reasonably with the linear trajectory assigned in advance.Finally,through simulation verification,the multi-UAVs target assignment algorithm based on the assignment probability proposed in this paper can effectively reduce the total path length,and the UAV motion selection method based on the maximization interests can effectively complete the task formation.

Identifying influential spreaders in social networks: A two-stage quantum-behaved particle swarm optimization with Lévy flight

The influence maximization problem aims to select a small set of influential nodes, termed a seed set, to maximize their influence coverage in social networks. Although the methods that are based on a greedy strategy can obtain good accuracy, they come at the cost of enormous computational time, and are therefore not applicable to practical scenarios in large-scale networks. In addition, the centrality heuristic algorithms that are based on network topology can be completed in relatively less time. However, they tend to fail to achieve satisfactory results because of drawbacks such as overlapped influence spread. In this work, we propose a discrete two-stage metaheuristic optimization combining quantum-behaved particle swarm optimization with Lévy flight to identify a set of the most influential spreaders. According to the framework,first, the particles in the population are tasked to conduct an exploration in the global solution space to eventually converge to an acceptable solution through the crossover and replacement operations. Second, the Lévy flight mechanism is used to perform a wandering walk on the optimal candidate solution in the population to exploit the potentially unidentified influential nodes in the network. Experiments on six real-world social networks show that the proposed algorithm achieves more satisfactory results when compared to other well-known algorithms.

Sum-Rate Maximization in Active RIS-Assisted Multi-Antenna WPCN

In this paper,we propose an active reconfigurable intelligent surface(RIS)enabled hybrid relaying scheme for a multi-antenna wireless powered communication network(WPCN),where the active RIS is employed to assist both wireless energy transfer(WET)from the power station(PS)to energyconstrained users and wireless information transmission(WIT)from users to the receiving station(RS).For further performance enhancement,we propose to employ both transmit beamforming at the PS and receive beamforming at the RS.We formulate a sumrate maximization problem by jointly optimizing the RIS phase shifts and amplitude reflection coefficients for both the WET and the WIT,transmit and receive beamforming vectors,and network resource allocation.To solve this non-convex problem,we propose an efficient alternating optimization algorithm with the linear minimum mean squared error criterion,semidefinite relaxation(SDR)and successive convex approximation techniques.Specifically,the tightness of applying the SDR is proved.Simulation results demonstrate that our proposed scheme with 10 reflecting elements(REs)and 4 antennas can achieve 17.78%and 415.48%performance gains compared to the single-antenna scheme with 10 REs and passive RIS scheme with 100 REs,respectively.

Kinematic calibration under the expectation maximization framework for exoskeletal inertial motion capture system

This study presents a kinematic calibration method for exoskeletal inertial motion capture (EI-MoCap) system with considering the random colored noise such as gyroscopic drift.In this method, the geometric parameters are calibrated by the traditional calibration method at first. Then, in order to calibrate the parameters affected by the random colored noise, the expectation maximization (EM) algorithm is introduced. Through the use of geometric parameters calibrated by the traditional calibration method, the iterations under the EM framework are decreased and the efficiency of the proposed method on embedded system is improved. The performance of the proposed kinematic calibration method is compared to the traditional calibration method. Furthermore, the feasibility of the proposed method is verified on the EI-MoCap system. The simulation and experiment demonstrate that the motion capture precision is significantly improved by 16.79%and 7.16%respectively in comparison to the traditional calibration method.

A STABILITY RESULT FOR TRANSLATINGSPACELIKE GRAPHS IN LORENTZ MANIFOLDS

In this paper,we investigate spacelike graphs defined over a domain Ω⊂M^(n) in the Lorentz manifold M^(n)×ℝ with the metric−ds^(2)+σ,where M^(n) is a complete Riemannian n-manifold with the metricσ,Ωhas piecewise smooth boundary,and ℝ denotes the Euclidean 1-space.We prove an interesting stability result for translating spacelike graphs in M^(n)×ℝ under a conformal transformation.

PERIODIC SYSTEMS WITH TIME DEPENDENT MAXIMAL MONOTONE OPERATORS

We consider a first order periodic system in R^(N),involving a time dependent maximal monotone operator which need not have a full domain and a multivalued perturbation.We prove the existence theorems for both the convex and nonconvex problems.We also show the existence of extremal periodic solutions and provide a strong relaxation theorem.Finally,we provide an application to nonlinear periodic control systems.