共查询到20条相似文献,搜索用时 125 毫秒
1.
2.
3.
4.
5.
智能天车倒垛优化是提高钢卷库堆场利用率的重要手段,同时对提升钢铁仓库物流效率具有重要意义。针对该问题,建立最小倒垛次数为目标的天车作业负荷数学模型。在对模型求解过程中,借鉴了 Alpha Go-Zero中树搜索方法,设计了蒙特卡洛钢卷搜索树(MCRST)。为了提升搜索树的收敛速度和结果的准确性,将树的置信度上界(UCT)改为快速动作值估计(RAVE),同时引入绝对剪枝策略避免节点盲目扩展。通过不同规模算例实验,将改进算法与原树搜索和粒子群算法(PSO)进行比较,证明了该算法在大规模问题上的优越性;同时该算法也考虑了订单钢卷出库顺序和出库量等因素,验证了算法的适用性。 相似文献
6.
针对HHO算法存在搜索过程调整不够灵活,不能针对性地进行阶段性搜索,有时会陷入局部最优使算法搜索精度相对较差等问题,提出了一种基于改进哈里斯鹰优化(IHHO)算法的参数辨识方法.对HHO算法进行了两项改进:引人柔性递减策略,在迭代初期扩大全局搜索范围,在迭代后期延长局部搜索时间,从而加强了初期的全局搜索能力和后期的局部... 相似文献
7.
针对工艺路线规划中满足多重约束的最优方案选择问题,提出一种细菌觅食和蚁群优化(bacteria foraging ant colony optimization,BFACO)算法。首先,将工艺路线规划转化为对加工元顺序的优化问题,构造满足多种工艺准则的加工元拓扑优先顺序图,并构建了在缩短加工周期、提高加工质量和降低加工成本目标下的最低加工资源更换成本的目标函数;其次,设计加工元序列与加工资源两个搜索阶段的蚁群搜索,拓扑优先顺序图可弥补加工元序列搜索阶段信息素匮乏的缺点,而在加工资源搜索阶段引入细菌觅食优化算法的复制与趋向操作,可使加工元在多个可选加工资源的情况下获得加工资源更换成本最低的加工序列;最后,基于细菌觅食与蚁群算法的融合优化,完成多个加工元序列的信息素积累并输出最优解,解决蚁群算法局部收敛且计算速度慢的问题。将BFACO算法应用于实例并与其他优化算法的优化结果进行对比,结果显示BFACO算法在工艺路线优化方面较其他优化算法具有较高的计算效率,验证了BFACO算法的可行性与有效性。研究表明,BFACO算法可有效应用于同时考虑工艺约束与加工资源更换成本的工艺规划,为实际生产提供高效且灵活的工艺路线的优化选择。 相似文献
8.
针对无线传感器网络(WSN)路由协议存在的安全问题,考虑到WSN节点能量低、资源有限的缺陷,提出了一种新型的WSN安全路由协议——VH-GEAR协议。VH-GEAR协议在地理位置能量感知路由(GEAR)协议的基础上引入了纵向(vertocal,V)和横向(horizontal,H)分析相结合的WSN节点信誉评测模型来提高路由协议的安全性,同时通过改进路由协议的信誉更新机制来减小能耗。基于NS2的仿真实验表明,VH-GEAR路由协议能有效识别网络中的恶意节点,减小对合法节点的误判,降低网络能耗,从而加强了网络的安全性,延长了网络的生命周期,提高了网络的整体性能。 相似文献
9.
考虑到现有光突发交换(OBS)网络协议在时延、丢包率性能上的不足,在恰量时间(JET)协议的基础上,提出了一种基于并行调度(PS)处理思想的新型资源预留协议--PS-JET协议,给出了该协议的实现方案及具体的信令帧格式,并通过分析与系统仿真,将其性能同带优先级的恰量时间(PJET)资源预留协议做了详细的比较.结果表明,PS-JET协议在实际的多跳网络中具有更好的时延性能和更低的丢包率,同时,具有和PJET同样良好的QoS区分特性. 相似文献
10.
11.
Rainer Steinwandt Adriana Suárez Corona 《Applicable Algebra in Engineering, Communication and Computing》2014,25(1-2):1-20
A protocol compiler is presented which transforms any unauthenticated (attribute-based) group key establishment protocol into an authenticated attribute-based group key establishment. If the protocol to which the compiler is applied does not make use of long-term secrets, then the resulting protocol is, in addition, deniable. In particular, applying our compiler to an unauthenticated 2-round protocol going back to Burmester and Desmedt results in a 3-round solution for attribute-based group key establishment, offering both forward secrecy and deniability. 相似文献
12.
Vladimir Shpilrain Gabriel Zapata 《Applicable Algebra in Engineering, Communication and Computing》2006,17(3-4):291-302
After some excitement generated by recently suggested public key exchange protocols due to Anshel–Anshel–Goldfeld and Ko–Lee et al., it is a prevalent opinion now that the conjugacy search problem is unlikely to provide sufficient level of security if a braid group is used as the platform. In this paper we address the following questions: (1) whether choosing a different group, or a class of groups, can remedy the situation; (2) whether some other “hard” problem from combinatorial group theory can be used, instead of the conjugacy search problem, in a public key exchange protocol. Another question that we address here, although somewhat vague, is likely to become a focus of the future research in public key cryptography based on symbolic computation: (3) whether one can efficiently disguise an element of a given group (or a semigroup) by using defining relations. 相似文献
13.
Combined with the dense coding mechanism and the bias-BB84 protocol, an efficient quantum key distribution protocol with dense coding on single photons (QDKD-SP) is proposed. Compared with the BB84 or bias-BB84 protocols based on single photons, our QDKD-SP protocol has a higher capacity without increasing the difficulty of its experiment implementation as each correlated photon can carry two bits of useful information. Compared with the quantum dense key distribution (QDKD) protocol based on entangled states, our protocol is more feasible as the preparation and the measurement of a single-photon quantum state is not difficult with current technology. In addition, our QDKD-SP protocol is theoretically proved to be secure against the intercept-resend attack. 相似文献
14.
Quantum key agreement is a promising key establishing protocol that can play a significant role in securing 5G/6G communication networks. Recently, Liu et al. (Quantum Information Processing 18(8):1-10, 2019) proposed a multi-party quantum key agreement protocol based on four-qubit cluster states was proposed. The aim of their protocol is to agree on a shared secret key among multiple remote participants. Liu et al. employed four-qubit cluster states to be the quantum resources and the X operation to securely share a secret key. In addition, Liu et al.'s protocol guarantees that each participant makes an equal contribution to the final key. The authors also claimed that the proposed protocol is secure against participant attack and dishonest participants cannot generate the final shared key alone. However, we show here that Liu et al. protocol is insecure against a collusive attack, where dishonest participants can retrieve the private inputs of a trustworthy participant without being caught. Additionally, the corresponding modifications are presented to address these security flaws in Liu et al.'s protocol. 相似文献
15.
模糊核迹方法是研究正则半群上模糊同余的重要手段,模糊核作为一个方法的组成部分成为重要的讨论对象。目的在于研究正则半群的模糊子集满足什么条件构成模糊同余的模糊核:引入一般半群上的模糊等价关系浸满一个模糊子集的概念,证明了正则半群上每个模糊同余浸满它的模糊核,给出了正则半群的模糊子集是某个模糊同余的模糊核的充要条件。 相似文献
16.
17.
Quantum secure direct communication (QSDC) can transmit secret messages
directly from one user to another without first establishing a shared secret key, which is
different from quantum key distribution. In this paper, we propose a novel quantum secure
direct communication protocol based on signal photons and Bell states. Before the execution
of the proposed protocol, two participants Alice and Bob exchange their corresponding
identity IDA and IDB through quantum key distribution and keep them secret, respectively.
Then the message sender, Alice, encodes each secret message bit into two single photons
(| 01〉or|10〉) or a Bell state
, and
composes an ordered secret message sequence. To insure the security of communication,
Alice also prepares the decoy photons and inserts them into secret message sequence on
the basis of the values of IDA and IDB. By the secret identity IDA and IDB, both sides of the
communication can check eavesdropping and identify each other. The proposed protocol
not only completes secure direct communication, but also realizes the mutual
authentication. The security analysis of the proposed protocol is presented in the paper.
The analysis results show that this protocol is secure against some common attacks, and
no secret message leaks even if the messages are broken. Compared with the two-way
QSDC protocols, the presented protocol is a one-way quantum communication protocol
which has the immunity to Trojan horse attack. Furthermore, our proposed protocol can be
realized without quantum memory. 相似文献
18.
19.
20.
考虑到未来移动通信设备能够支持多种接入标准和协议栈,而且协议栈重配置能力将会成为一种促进异构系统融合的关键驱动技术,本文研究了协议栈重配置系统的协议组件的管理,并基于组件化的协议框架,提出了一套管理协议组件的方法.为了使得协议栈能够针对不同的通信情况对自身进行配置调整,从而达到为每个无线业务定制最佳协议栈的目标,提出了一种针对协议组件的评估机制和一种在网络协议组件库中寻找最佳组件来替代当前系统中运行效果不佳的协议组件的协议栈优化方法.上述机制和方法的最终目标是通过灵活的协议栈配置为用户提供最佳的业务体验. 相似文献