To effectively address the challenge where the speed of tunnel lining construction struggles to match that of tunnel face and inverted arch construction,and to enhance the quality of secondary lining,a new type of ske...To effectively address the challenge where the speed of tunnel lining construction struggles to match that of tunnel face and inverted arch construction,and to enhance the quality of secondary lining,a new type of skeleton-free,traversing secondary lining trolley has been developed.This trolley features a set of gantries paired with two sets of formwork.The formwork adopts a multi-segment hinged and strengthened design,ensuring its own strength can meet the requirements of secondary lining concrete pouring without relying on the support of the gantries.When retracted,the formwork can be transported by the gantries through another set of formwork in the supporting state,enabling early formwork support,effectively accelerating the construction progress of the tunnel’s secondary lining,and extending the maintenance time of the secondary lining with the formwork.Finite element software modeling was used for simulation calculations,and the results indicate that the structural strength,stiffness,and other performance parameters of the new secondary lining trolley meet the design requirements,verifying the rationality of the design.展开更多
Aiming at the problem that only some types of SPARQL （ simple protocal and resource description framework query language） queries can be answered by using the current resource description framework link traversal ba...Aiming at the problem that only some types of SPARQL （ simple protocal and resource description framework query language） queries can be answered by using the current resource description framework link traversal based query execution （RDF-LTE） approach, this paper discusses how the execution order of the triple pattern affects the query results and cost based on concrete SPARQL queries, and analyzes two properties of the web of linked data, missing backward links and missing contingency solution. Then three heuristic principles for logic query plan optimization, namely, the filtered basic graph pattern （FBGP） principle, the triple pattern chain principle and the seed URIs principle, are proposed. The three principles contribute to decrease the intermediate solutions and increase the types of queries that can be answered. The effectiveness and feasibility of the proposed approach is evaluated. The experimental results show that more query results can be returned with less cost, thus enabling users to develop the full potential of the web of linked data.展开更多
This paper proposes an image encryption algorithm based on spatiotemporal chaos and middle order traversal of a binary tree.Firstly,other programming software is used to perform the middle order traversal,and the plai...This paper proposes an image encryption algorithm based on spatiotemporal chaos and middle order traversal of a binary tree.Firstly,other programming software is used to perform the middle order traversal,and the plaintext image is sorted according to the middle order traversal sequence on the permutation.Secondly,the chaotic sequence is generated using the coupled map lattice to set the chaotic interference value.Finally,the XOR operation between the adjacent pixel values of the replacement image is completed to generate the ciphertext matrix.The simulation and experimental results show that the proposed algorithm can resist typical attacks and has good robustness.展开更多
This study proposes a new medical image encryption scheme based on Josephus traversing and hyper-chaotic Lorenz system.First,a chaotic sequence is generated through hyperchaotic system.This hyperchaotic sequence is us...This study proposes a new medical image encryption scheme based on Josephus traversing and hyper-chaotic Lorenz system.First,a chaotic sequence is generated through hyperchaotic system.This hyperchaotic sequence is used in the scrambling and diffusion stages of the algorithm.Second,in the scrambling process,the image is initially confused by Josephus scrambling,and then the image is further confused by Arnold map.Finally,generated hyperchaos sequence and exclusive OR operation is used for the image to carry on the positive and reverse diffusion to change the pixel value of the image and further hide the effective information of the image.In addition,the information of the plaintext image is used to generate keys used in the algorithm,which increases the ability of resisting plaintext attack.Experimental results and security analysis show that the scheme can effectively hide plaintext image information according to the characteristics of medical images,and is resistant to common types of attacks.In addition,this scheme performs well in the experiments of robustness,which shows that the scheme can solve the problem of image damage in telemedicine.It has a positive significance for the future research.展开更多
<p align="left"> <span style="font-family:Verdana;">During the model-based software testing process, test cases are generated from modeled requirements to conduct acceptance testing. Ho...<p align="left"> <span style="font-family:Verdana;">During the model-based software testing process, test cases are generated from modeled requirements to conduct acceptance testing. However, existing approaches generate erroneous test cases, lack full coverage criteria and prototype tools. Therefore, the aim of this research is to develop an approach capable of reducing erroneous test case generation based on full coverage criteria and a prototype tool. The method employed was to develop a parser to extract information from the XMI file of a modeling diagram where a tree is constructed and a traversal operation executed on the nodes and edges to generate test cases. The results obtained from the proposed approach showed that 97.35% of the generated test cases were precise and comprehensive enough to conduct testing because 99.01% of all the nodes and edges were fully covered during the traversal operations.</span> </p>展开更多
Binary tree is a very important data structure in computer science. Some major properties are discussed. Both recursive and non-recursive traversal methods of binary tree are discussed in detail. Some improvement...Binary tree is a very important data structure in computer science. Some major properties are discussed. Both recursive and non-recursive traversal methods of binary tree are discussed in detail. Some improvements in programming are proposed.展开更多
P2P streaming application must realize network address translation （NAT） traversal. To handle low success ratio of the existing NAT traversal algorithm, UPnP-STUN （UPUN） and port-mapping sample estimation （PMSE）...P2P streaming application must realize network address translation （NAT） traversal. To handle low success ratio of the existing NAT traversal algorithm, UPnP-STUN （UPUN） and port-mapping sample estimation （PMSE） algorithm are recommended in this paper. UPUN is the combination of UPnP and STUN, and PMSE utilizes port mapping samples added by symmetric NAT for different sessions to estimate regularity of port mapping of symmetric NAT, which takes advantage of the Bernoulli law of large numbers. Besides, for the situation that both peers are behind NAT, and to handle heavy relay server load when many inner peers want to communicate with each other, a peer auxiliary-relay （PAR） algorithm is presented. PAR lets outer peers with sufficient bandwidth act as relay servers to alleviate pressure of real server, which could avoid NAT traversal failure caused by single point failure of relay server. Finally, experiments show that the proposed algorithms could improve the success ratio significantly for NAT traversal in P2P streaming application as well as improve P2P streaming application applicability.展开更多
The modeling of dynamical systems from a time series implemented by our DSA program introduces binary trees of height D with all leaves on the same level, and the related subtrees of height L 〈 D. These are called e-...The modeling of dynamical systems from a time series implemented by our DSA program introduces binary trees of height D with all leaves on the same level, and the related subtrees of height L 〈 D. These are called e-trees and e-subtrees. The recursive and nonrecursive versions of the traversal algorithms for the trees with dynamically created nodes are discussed. The original nonrecursive algorithms that return the pointer to the next node in preorder, inorder and postorder traversals are presented. The space-time complexity analysis shows and the execution time measurements confirm that for these O（2D） algorithms, the recursive versions have approximately 10-25% better time constants. Still, the use of nonrecursive algorithms may be more appropriate in several occasions.展开更多
While wormholes are just as good a prediction of Einstein’s theory as black holes, they are subject to severe restrictions from quantum field theory. To allow for the possibility of interstellar travel, a macroscopic...While wormholes are just as good a prediction of Einstein’s theory as black holes, they are subject to severe restrictions from quantum field theory. To allow for the possibility of interstellar travel, a macroscopic wormhole would need to maintain sufficiently low radial tidal forces. It is proposed in this paper that the assumption of zero tidal forces, i.e., the limiting case, is sufficient for overcoming the restrictions from quantum field theory. The feasibility of this approach is subsequently discussed by 1) introducing the additional conditions needed to ensure that the radial tidal forces can indeed be sufficiently low and 2) by viewing traversable wormholes as emergent phenomena, thereby increasing the likelihood of their existence.展开更多
This paper presents a new generating criterion for self-similar geometric fractalsDynamic Traversal Criterion (DTC) and the principle to practice it. According to the principle,symbol shifting technique is put forward...This paper presents a new generating criterion for self-similar geometric fractalsDynamic Traversal Criterion (DTC) and the principle to practice it. According to the principle,symbol shifting technique is put forward which can control the traversal symbols dynamically in recursive procession. The Dynamic Traversal Criterion inherits the mechanism for generating self-similar fractals from traditional way and creates more fractal images from one initiator and generator than Static traversal strategy.展开更多
文摘To effectively address the challenge where the speed of tunnel lining construction struggles to match that of tunnel face and inverted arch construction,and to enhance the quality of secondary lining,a new type of skeleton-free,traversing secondary lining trolley has been developed.This trolley features a set of gantries paired with two sets of formwork.The formwork adopts a multi-segment hinged and strengthened design,ensuring its own strength can meet the requirements of secondary lining concrete pouring without relying on the support of the gantries.When retracted,the formwork can be transported by the gantries through another set of formwork in the supporting state,enabling early formwork support,effectively accelerating the construction progress of the tunnel’s secondary lining,and extending the maintenance time of the secondary lining with the formwork.Finite element software modeling was used for simulation calculations,and the results indicate that the structural strength,stiffness,and other performance parameters of the new secondary lining trolley meet the design requirements,verifying the rationality of the design.
基金The National Natural Science Foundation of China(No.61070170)the Natural Science Foundation of Higher Education Institutions of Jiangsu Province(No.11KJB520017)Suzhou Application Foundation Research Project(No.SYG201238)
文摘Aiming at the problem that only some types of SPARQL （ simple protocal and resource description framework query language） queries can be answered by using the current resource description framework link traversal based query execution （RDF-LTE） approach, this paper discusses how the execution order of the triple pattern affects the query results and cost based on concrete SPARQL queries, and analyzes two properties of the web of linked data, missing backward links and missing contingency solution. Then three heuristic principles for logic query plan optimization, namely, the filtered basic graph pattern （FBGP） principle, the triple pattern chain principle and the seed URIs principle, are proposed. The three principles contribute to decrease the intermediate solutions and increase the types of queries that can be answered. The effectiveness and feasibility of the proposed approach is evaluated. The experimental results show that more query results can be returned with less cost, thus enabling users to develop the full potential of the web of linked data.
基金Project supported by the National Natural Science Foundation of China(Grant No.61672124)the Password Theory Project of the 13th Five-Year Plan National Cryptography Development Fund(Grant No.MMJJ20170203)+2 种基金Liaoning Province Science and Technology Innovation Leading Talents Program Project(Grant No.XLYC1802013)Key Research and Development Projects of Liaoning Province,China(Grant No.2019020105-JH2/103)Jinan City‘20 universities’Funding Projects Introducing Innovation Team Program(Grant No.2019GXRC031).
文摘This paper proposes an image encryption algorithm based on spatiotemporal chaos and middle order traversal of a binary tree.Firstly,other programming software is used to perform the middle order traversal,and the plaintext image is sorted according to the middle order traversal sequence on the permutation.Secondly,the chaotic sequence is generated using the coupled map lattice to set the chaotic interference value.Finally,the XOR operation between the adjacent pixel values of the replacement image is completed to generate the ciphertext matrix.The simulation and experimental results show that the proposed algorithm can resist typical attacks and has good robustness.
基金the National Natural Science Foundation of China(No.61402051)the Natural Science Basic Research Plan in Shaanxi Province of China(No.2016JM6076)。
文摘This study proposes a new medical image encryption scheme based on Josephus traversing and hyper-chaotic Lorenz system.First,a chaotic sequence is generated through hyperchaotic system.This hyperchaotic sequence is used in the scrambling and diffusion stages of the algorithm.Second,in the scrambling process,the image is initially confused by Josephus scrambling,and then the image is further confused by Arnold map.Finally,generated hyperchaos sequence and exclusive OR operation is used for the image to carry on the positive and reverse diffusion to change the pixel value of the image and further hide the effective information of the image.In addition,the information of the plaintext image is used to generate keys used in the algorithm,which increases the ability of resisting plaintext attack.Experimental results and security analysis show that the scheme can effectively hide plaintext image information according to the characteristics of medical images,and is resistant to common types of attacks.In addition,this scheme performs well in the experiments of robustness,which shows that the scheme can solve the problem of image damage in telemedicine.It has a positive significance for the future research.
文摘<p align="left"> <span style="font-family:Verdana;">During the model-based software testing process, test cases are generated from modeled requirements to conduct acceptance testing. However, existing approaches generate erroneous test cases, lack full coverage criteria and prototype tools. Therefore, the aim of this research is to develop an approach capable of reducing erroneous test case generation based on full coverage criteria and a prototype tool. The method employed was to develop a parser to extract information from the XMI file of a modeling diagram where a tree is constructed and a traversal operation executed on the nodes and edges to generate test cases. The results obtained from the proposed approach showed that 97.35% of the generated test cases were precise and comprehensive enough to conduct testing because 99.01% of all the nodes and edges were fully covered during the traversal operations.</span> </p>
文摘Binary tree is a very important data structure in computer science. Some major properties are discussed. Both recursive and non-recursive traversal methods of binary tree are discussed in detail. Some improvements in programming are proposed.
基金Supported by the Nat/onal Science and Technology Support Projects of China（No. 2008BAH28B04） and the National Natural Science Foundation of China _（No..60903218F0208） andthe National High Technology Research and Development Programme of China （No. 2008AA01A317）
文摘P2P streaming application must realize network address translation （NAT） traversal. To handle low success ratio of the existing NAT traversal algorithm, UPnP-STUN （UPUN） and port-mapping sample estimation （PMSE） algorithm are recommended in this paper. UPUN is the combination of UPnP and STUN, and PMSE utilizes port mapping samples added by symmetric NAT for different sessions to estimate regularity of port mapping of symmetric NAT, which takes advantage of the Bernoulli law of large numbers. Besides, for the situation that both peers are behind NAT, and to handle heavy relay server load when many inner peers want to communicate with each other, a peer auxiliary-relay （PAR） algorithm is presented. PAR lets outer peers with sufficient bandwidth act as relay servers to alleviate pressure of real server, which could avoid NAT traversal failure caused by single point failure of relay server. Finally, experiments show that the proposed algorithms could improve the success ratio significantly for NAT traversal in P2P streaming application as well as improve P2P streaming application applicability.
文摘The modeling of dynamical systems from a time series implemented by our DSA program introduces binary trees of height D with all leaves on the same level, and the related subtrees of height L 〈 D. These are called e-trees and e-subtrees. The recursive and nonrecursive versions of the traversal algorithms for the trees with dynamically created nodes are discussed. The original nonrecursive algorithms that return the pointer to the next node in preorder, inorder and postorder traversals are presented. The space-time complexity analysis shows and the execution time measurements confirm that for these O（2D） algorithms, the recursive versions have approximately 10-25% better time constants. Still, the use of nonrecursive algorithms may be more appropriate in several occasions.
文摘While wormholes are just as good a prediction of Einstein’s theory as black holes, they are subject to severe restrictions from quantum field theory. To allow for the possibility of interstellar travel, a macroscopic wormhole would need to maintain sufficiently low radial tidal forces. It is proposed in this paper that the assumption of zero tidal forces, i.e., the limiting case, is sufficient for overcoming the restrictions from quantum field theory. The feasibility of this approach is subsequently discussed by 1) introducing the additional conditions needed to ensure that the radial tidal forces can indeed be sufficiently low and 2) by viewing traversable wormholes as emergent phenomena, thereby increasing the likelihood of their existence.
文摘This paper presents a new generating criterion for self-similar geometric fractalsDynamic Traversal Criterion (DTC) and the principle to practice it. According to the principle,symbol shifting technique is put forward which can control the traversal symbols dynamically in recursive procession. The Dynamic Traversal Criterion inherits the mechanism for generating self-similar fractals from traditional way and creates more fractal images from one initiator and generator than Static traversal strategy.
