In response to the issues of open deployment environment， weak security measures， vulnerability to security attacks， and insufficient computing and network resources of blockchain edge nodes， a blockchain security architecture based on Trusted Execution Environment （TEE）， named P-Dledger， was proposed. In this architecture， by constructing a two-stage trust chain， the trustworthiness of the loaded components was ensured on the basis of meeting requirements for convenient software iteration； by constructing a trustworthy execution framework for smart contracts and a trustworthy data storage based on Serial Peripheral Interface Not OR Flash （SPI NOR Flash）， the trustworthy computation of smart contracts and the secure storage of data were guaranteed. Additionally， a monotonically increasing unique identifier was assigned to consensus proposals to restrict the behavior of Byzantine nodes. Experimental and analysis results demonstrate that this architecture ensures the security and trustworthiness of loaded entities， ledger data， and execution processes. When the network latency exceeds 60 ms or the number of nodes is greater than 8， P-Dledger achieves higher throughput than blockchain systems employing Practical Byzantine Fault Tolerance （PBFT） algorithm， and P-Dledger has more stable performance as network latency and the number of nodes increase.

As the core of steel production， hot rolling process has demands of strict production continuity and complex production technology. The random arrival of rush orders and urgent delivery requirements have adverse impacts on production continuity and quality stability. Aiming at those kind of dynamic events of rush order insertion， a hot rolling rescheduling optimization method was proposed. Firstly， the influence of order disturbance factor on the scheduling scheme was analyzed， and a mathematical model of hot rolling rescheduling was established with the optimization objective of minimizing the weighted sum of tardiness of orders and jump penalty of slabs. Then， an Estimation of Distribution Algorithm （EDA） for hot rolling rescheduling was designed. In this algorithm， aiming at the insertion processing of rush orders， an integer encoding scheme was proposed based on the insertion position， the probability model based on the characteristics of the model was designed， and the fitness function based on the penalty value was defined by considering the targets and constraints comprehensively. The feasibility and validity of the model and the algorithm were verified by the simulation experiment on the actual production data.

Accurate extraction of a target’s edge in a log-polar space is a precondition and key point to successfully apply the visual invariance of the log-polar transformation. Since it is impossible for traditional algorithms to extract the single-pixel edge in an intensively noisy environment, a unique edge extraction algorithm on the basis of active contour model and level set method was designed. After noise removal on the whole via Canny operator based level set method, the energy-driving active contour model was used to iteratively approach the potential edges. By clearing out false edges with an improved tracing way, the true target’s edge was extracted finally. The experimental results demonstrate the effective performance of the proposed algorithm with the edge feature similarity up to 96%.

It is indicated that Cao Guoliang et al's multicast key management scheme based on generalized cat map does not satisfy the independent security requirement of individual keys of group members. A modification scheme was proposed by using one way function. The presented scheme satisfies the independent security requirement of individual keys of group members. Compared with Cao Guoliang et al's scheme, this modification scheme has higher security and lower computation and communication overheads.

Ad Hoc network often supplies reliable authentication service for nodes by distributed certificate authority authentication model due to its dynamic topology and other characteristics; however, the problem of secure auditing is not solved by existing schemes. Therefore, a distributed secret share distribution scheme was put forward based on threshold warrant certificates, which carried out strict auditing towards the nodes that applied for secret shares, and could effectively withstand several malicious nodes working together to recover the secret key of system, and make sure that only the credible and high-quality-service nodes were able to gain the secret shares. In the end, the security and success probability of the scheme were analyzed in theory, and its effectiveness was confirmed by simulations.