Decision-makers usually have an aspiration level,a target,or a benchmark they aim to achieve.This behavior can be rationalized within the expected utility framework,which incorporates the probability of success(achiev...Decision-makers usually have an aspiration level,a target,or a benchmark they aim to achieve.This behavior can be rationalized within the expected utility framework,which incorporates the probability of success(achieving the aspiration level)as an important aspect of decision-making.Motivated by these theories,this study defines the probability of success as the number of days a firm’s return outperformed its benchmark in the portfolio formation month.This study uses portfolio-level and firm-level analyses,revealing an economically substantial and statistically significant relationship between the probability of success and expected stock returns,even after controlling for common risk factors and various characteristics.Additional analyses support the behavioral theory of the firm,which posits that firms act to achieve short-term aspiration levels.展开更多
As the chaff centroid jamming can introduce the guiding error of the anti-warship missile's seeker and decrease its hitting probability,a new quantitative analysis method and a mathematic model are proposed in thi...As the chaff centroid jamming can introduce the guiding error of the anti-warship missile's seeker and decrease its hitting probability,a new quantitative analysis method and a mathematic model are proposed in this paper to evaluate the success jamming probability.By using this method,the optimal decision scheme of chaff centroid jamming in different threat situations can be found,and also the success probability of this scheme can be calculated quantitatively.Thus,the operation rules of the centroid jamming and the tactical approach for increasing the success probability can be determined.展开更多
The probabilistic quantum teleportation scheme [Phys. Lett. A 305 （2002） 12] is improved via two seemingly different methods （i.e., the usual aneilla method and the so-called Kraus method）, respectively. The essen...The probabilistic quantum teleportation scheme [Phys. Lett. A 305 （2002） 12] is improved via two seemingly different methods （i.e., the usual aneilla method and the so-called Kraus method）, respectively. The essence of the improvements is to fetch a part from the residues so that the success probability is accordingly increased. The two improved versions and a similar protocol proposed by Li et al. [Phys. Rev. A 61 （2000） 034301] are compared mutually and discussed. It is found that they are equally efficient and can reach the success probability threshold determined by the inherent entanglement of the quantum channel.展开更多
Cascading failures pose a serious threat to the survivability of underwater unmanned swarm networks(UUSNs),significantly limiting their service ability in collaborative missions such as military reconnaissance and env...Cascading failures pose a serious threat to the survivability of underwater unmanned swarm networks(UUSNs),significantly limiting their service ability in collaborative missions such as military reconnaissance and environmental monitoring.Existing failure models primarily focus on power grids and traffic systems,and don't address the unique challenges of weak-communication UUSNs.In UUSNs,cascading failure present a complex and dynamic process driven by the coupling of unstable acoustic channels,passive node drift,adversarial attacks,and network heterogeneity.To address these challenges,a directed weighted graph model of UUSNs is first developed,in which node positions are updated according to ocean-current-driven drift and link weights reflect the probability of successful acoustic transmission.Building on this UUSNs graph model,a cascading failure model is proposed that integrates a normal-failure-recovery state-cycle mechanism,multiple attack strategies,and routingbased load redistribution.Finally,under a five-level connectivity UUSNs scheme,simulations are conducted to analyze how dynamic topology,network load,node recovery delay,and attack modes jointly affect network survivability.The main findings are:(1)moderate node drift can improve survivability by activating weak links;(2)based-energy routing(BER)outperform based-depth routing(BDR)in harsh conditions;(3)node self-recovery time is critical to network survivability;(4)traditional degree-based critical node metrics are inadequate for weak-communication UUSNs.These results provide a theoretical foundation for designing robust survivability mechanisms in weak-communication UUSNs.展开更多
Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in ...Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in which one source sends messages to k destinations through m relays using random linear network coding over a Galois field. The formulation at a （all） sink（s） represents the impact of major parameters, i.e., the size of field, the number of relays （and sinks） and provides theoretical groundings to numerical results in the literature. Such condition maps to the receivers＇ capability to decode the original information and its mathematical characterization is helpful to design the coding. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized.展开更多
High reliability applications in dense access scenarios have become one of the main goals of 6G environments.To solve the access collision of dense Machine Type Communication(MTC)devices in cell-free communication sys...High reliability applications in dense access scenarios have become one of the main goals of 6G environments.To solve the access collision of dense Machine Type Communication(MTC)devices in cell-free communication systems,an intelligent cooperative secure access scheme based on multi-agent reinforcement learning and federated learning is proposed,that is,the Preamble Slice Orderly Queue Access(PSOQA)scheme.In this scheme,the preamble arrangement is combined with the access control.The preamble arrangement is realized by preamble slices which is from the virtual preamble pool.The access devices learn to queue orderly by deep reinforcement learning.The orderly queue weakens the random and avoids collision.A preamble slice is assigned to an orderly access queue at each access time.The orderly queue is determined by interaction information among multiple agents.With the federated reinforcement learning framework,the PSOQA scheme is implemented to guarantee the privacy and security of agents.Finally,the access performance of PSOQA is compared with other random contention schemes in different load scenarios.Simulation results show that PSOQA can not only improve the access success rate but also guarantee low-latency tolerant performances.展开更多
Quantum algorithms have demonstrated provable speedups over classical counterparts,yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge.In this work,we de...Quantum algorithms have demonstrated provable speedups over classical counterparts,yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge.In this work,we decode the quantum search advantage by investigating the critical role of quantum state properties in random-walk-based algorithms.We propose three distinct variants of quantum random-walk search algorithms and derive exact analytical expressions for their success probabilities.These probabilities are fundamentally determined by specific initial state properties:the coherence fraction governs the first algorithm’s performance,while entanglement and coherence dominate the outcomes of the second and third algorithms,respectively.We show that increased coherence fraction enhances success probability,but greater entanglement and coherence reduce it in the latter two cases.These findings reveal fundamental insights into harnessing quantum properties for advantage and guide algorithm design.Our searches achieve Grover-like speedups and show significant potential for quantum-enhanced machine learning.展开更多
随着高速铁路的不断发展和列车速度的不断提高,高铁场景下车地通信的可靠性和高效性引起广泛关注。列车速度的提升导致更加频繁的越区切换,使系统的可靠性得不到保障,因此列车速度的提升对高铁通信网络的安全性和可靠性产生严重影响。...随着高速铁路的不断发展和列车速度的不断提高,高铁场景下车地通信的可靠性和高效性引起广泛关注。列车速度的提升导致更加频繁的越区切换,使系统的可靠性得不到保障,因此列车速度的提升对高铁通信网络的安全性和可靠性产生严重影响。本文提出1种将LTE-A(Long Term Evolution-Advanced)网络应用到高速铁路场景并基于协同多点传输/接收CoMP(Coordinated Multi-Point transmission/reception)技术的切换优化方案模型,方案参考协作集加入模型。对系统切换成功率等进行性能分析,并与传统切换方案进行性能对比。分析表明:本文基于CoMP的切换方案可有效提升高移动性下网络的切换成功概率,明显改善系统的可靠性和效率。展开更多
文摘Decision-makers usually have an aspiration level,a target,or a benchmark they aim to achieve.This behavior can be rationalized within the expected utility framework,which incorporates the probability of success(achieving the aspiration level)as an important aspect of decision-making.Motivated by these theories,this study defines the probability of success as the number of days a firm’s return outperformed its benchmark in the portfolio formation month.This study uses portfolio-level and firm-level analyses,revealing an economically substantial and statistically significant relationship between the probability of success and expected stock returns,even after controlling for common risk factors and various characteristics.Additional analyses support the behavioral theory of the firm,which posits that firms act to achieve short-term aspiration levels.
文摘As the chaff centroid jamming can introduce the guiding error of the anti-warship missile's seeker and decrease its hitting probability,a new quantitative analysis method and a mathematic model are proposed in this paper to evaluate the success jamming probability.By using this method,the optimal decision scheme of chaff centroid jamming in different threat situations can be found,and also the success probability of this scheme can be calculated quantitatively.Thus,the operation rules of the centroid jamming and the tactical approach for increasing the success probability can be determined.
基金Supported by the Program for New Century Excellent Talents at the University of China under Grant No.NCET-06-0554the National Natural Science Foundation of China under Grant Nos.10975001,60677001,10747146,and 10874122+3 种基金the Science-Technology Fund of Anhui Province for Outstanding Youth under Grant No.06042087the General Fund of the Educational Committee of Anhui Province under Grant No.2006KJ260Bthe Natural Science Foundation of Guangdong Province under Grant Nos.06300345 and 7007806 the Talent Foundation of High Education of Anhui Province for Outstanding Youth under Grant No.2009SQRZ018
文摘The probabilistic quantum teleportation scheme [Phys. Lett. A 305 （2002） 12] is improved via two seemingly different methods （i.e., the usual aneilla method and the so-called Kraus method）, respectively. The essence of the improvements is to fetch a part from the residues so that the success probability is accordingly increased. The two improved versions and a similar protocol proposed by Li et al. [Phys. Rev. A 61 （2000） 034301] are compared mutually and discussed. It is found that they are equally efficient and can reach the success probability threshold determined by the inherent entanglement of the quantum channel.
基金supported in part by the National Natural Science Foundation of China(Key Program)under Grant No.62031021。
文摘Cascading failures pose a serious threat to the survivability of underwater unmanned swarm networks(UUSNs),significantly limiting their service ability in collaborative missions such as military reconnaissance and environmental monitoring.Existing failure models primarily focus on power grids and traffic systems,and don't address the unique challenges of weak-communication UUSNs.In UUSNs,cascading failure present a complex and dynamic process driven by the coupling of unstable acoustic channels,passive node drift,adversarial attacks,and network heterogeneity.To address these challenges,a directed weighted graph model of UUSNs is first developed,in which node positions are updated according to ocean-current-driven drift and link weights reflect the probability of successful acoustic transmission.Building on this UUSNs graph model,a cascading failure model is proposed that integrates a normal-failure-recovery state-cycle mechanism,multiple attack strategies,and routingbased load redistribution.Finally,under a five-level connectivity UUSNs scheme,simulations are conducted to analyze how dynamic topology,network load,node recovery delay,and attack modes jointly affect network survivability.The main findings are:(1)moderate node drift can improve survivability by activating weak links;(2)based-energy routing(BER)outperform based-depth routing(BDR)in harsh conditions;(3)node self-recovery time is critical to network survivability;(4)traditional degree-based critical node metrics are inadequate for weak-communication UUSNs.These results provide a theoretical foundation for designing robust survivability mechanisms in weak-communication UUSNs.
基金Supported by the National Natural Science Foundation of China(61271174,61301178)the Science and Technology Innovation Foundation of Xi’an(CXY1352WL28)
文摘Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in which one source sends messages to k destinations through m relays using random linear network coding over a Galois field. The formulation at a （all） sink（s） represents the impact of major parameters, i.e., the size of field, the number of relays （and sinks） and provides theoretical groundings to numerical results in the literature. Such condition maps to the receivers＇ capability to decode the original information and its mathematical characterization is helpful to design the coding. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized.
基金supported in part by the National Natural Science Foundation of China under grants 61771255in part by the Provincial and Ministerial Key Laboratory Open Project under grant 20190904in part by the Key Technologies R&D Program of Jiangsu (Prospective and Key Technologies for Industry)under Grants BE2022067,BE2022067-1 and BE2022067-2。
文摘High reliability applications in dense access scenarios have become one of the main goals of 6G environments.To solve the access collision of dense Machine Type Communication(MTC)devices in cell-free communication systems,an intelligent cooperative secure access scheme based on multi-agent reinforcement learning and federated learning is proposed,that is,the Preamble Slice Orderly Queue Access(PSOQA)scheme.In this scheme,the preamble arrangement is combined with the access control.The preamble arrangement is realized by preamble slices which is from the virtual preamble pool.The access devices learn to queue orderly by deep reinforcement learning.The orderly queue weakens the random and avoids collision.A preamble slice is assigned to an orderly access queue at each access time.The orderly queue is determined by interaction information among multiple agents.With the federated reinforcement learning framework,the PSOQA scheme is implemented to guarantee the privacy and security of agents.Finally,the access performance of PSOQA is compared with other random contention schemes in different load scenarios.Simulation results show that PSOQA can not only improve the access success rate but also guarantee low-latency tolerant performances.
基金supported by the Fundamental Research Funds for the Central Universities,the National Natural Science Foundation of China(Grant Nos.12371132,12075159,12171044,12071179,and 12405006)the specific research fund of the Innovation Platform for Academicians of Hainan Province.
文摘Quantum algorithms have demonstrated provable speedups over classical counterparts,yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge.In this work,we decode the quantum search advantage by investigating the critical role of quantum state properties in random-walk-based algorithms.We propose three distinct variants of quantum random-walk search algorithms and derive exact analytical expressions for their success probabilities.These probabilities are fundamentally determined by specific initial state properties:the coherence fraction governs the first algorithm’s performance,while entanglement and coherence dominate the outcomes of the second and third algorithms,respectively.We show that increased coherence fraction enhances success probability,but greater entanglement and coherence reduce it in the latter two cases.These findings reveal fundamental insights into harnessing quantum properties for advantage and guide algorithm design.Our searches achieve Grover-like speedups and show significant potential for quantum-enhanced machine learning.
文摘随着高速铁路的不断发展和列车速度的不断提高,高铁场景下车地通信的可靠性和高效性引起广泛关注。列车速度的提升导致更加频繁的越区切换,使系统的可靠性得不到保障,因此列车速度的提升对高铁通信网络的安全性和可靠性产生严重影响。本文提出1种将LTE-A(Long Term Evolution-Advanced)网络应用到高速铁路场景并基于协同多点传输/接收CoMP(Coordinated Multi-Point transmission/reception)技术的切换优化方案模型,方案参考协作集加入模型。对系统切换成功率等进行性能分析,并与传统切换方案进行性能对比。分析表明:本文基于CoMP的切换方案可有效提升高移动性下网络的切换成功概率,明显改善系统的可靠性和效率。
