Refinery system, a typical example of process systems, is presented as complex network in this paper. The topology of this system is described by task-resource network and modeled as directed and weighted graph, in wh...Refinery system, a typical example of process systems, is presented as complex network in this paper. The topology of this system is described by task-resource network and modeled as directed and weighted graph, in which nodes represent various tasks and edges denote the resources exchanged among tasks. Using the properties of node degree distribution, strength distribution and other weighted quantities, we demonstrate the heterogeneity of the network and point out the relation between structural characters of vertices and the functionality of correspond- ing tasks. The above phenomena indicate that the design requirements and principles of production process contrib- ute to the heterogeneous features of the network. Besides, betweenness centrality of nodes can be used as an impor- tance indicator to provide additional information for decision making. The correlations between structure and weighted properties are investigated to further address the influence brought by production schemes in system con- nectivity patterns. Cascading failures model is employed to analyze the robustness of the network when targeted at- tack happens. Two capacity assignment strategies are compared in order to improve the robustness of the network at certain cost. The refinery system displays more reliable behavior when the protecting strategy considers heteroge- neous properties. This phenomenon further implies the structure-activity relationship of the refinery system and provides insightful suggestions for process system design. The results also indicate that robustness analysis is a _promising applicat!on of methodologies from complex networks to process system engineering..展开更多
To provide a high-security guaran- tee to network coding and lower the comput- ing complexity induced by signature scheme, we take full advantage of homomorphic prop- erty to build lattice signature schemes and sec- u...To provide a high-security guaran- tee to network coding and lower the comput- ing complexity induced by signature scheme, we take full advantage of homomorphic prop- erty to build lattice signature schemes and sec- ure network coding algorithms. Firstly, by means of the distance between the message and its sig- nature in a lattice, we propose a Distance-bas- ed Secure Network Coding （DSNC） algorithm and stipulate its security to a new hard problem Fixed Length Vector Problem （FLVP）, which is harder than Shortest Vector Problem （SVP） on lattices. Secondly, considering the bound- ary on the distance between the message and its signature, we further propose an efficient Bo- undary-based Secure Network Coding （BSNC） algorithm to reduce the computing complexity induced by square calculation in DSNC. Sim- ulation results and security analysis show that the proposed signature schemes have stronger unforgeability due to the natural property of lattices than traditional Rivest-Shamir-Adleman （RSA）-based signature scheme. DSNC algo- rithm is more secure and BSNC algorithm greatly reduces the time cost on computation.展开更多
基金Supported by the National High Technology Research and Development Program of China (2012AA041102)the State Key Development Program for Basic Research of China (2012CB720500)
文摘Refinery system, a typical example of process systems, is presented as complex network in this paper. The topology of this system is described by task-resource network and modeled as directed and weighted graph, in which nodes represent various tasks and edges denote the resources exchanged among tasks. Using the properties of node degree distribution, strength distribution and other weighted quantities, we demonstrate the heterogeneity of the network and point out the relation between structural characters of vertices and the functionality of correspond- ing tasks. The above phenomena indicate that the design requirements and principles of production process contrib- ute to the heterogeneous features of the network. Besides, betweenness centrality of nodes can be used as an impor- tance indicator to provide additional information for decision making. The correlations between structure and weighted properties are investigated to further address the influence brought by production schemes in system con- nectivity patterns. Cascading failures model is employed to analyze the robustness of the network when targeted at- tack happens. Two capacity assignment strategies are compared in order to improve the robustness of the network at certain cost. The refinery system displays more reliable behavior when the protecting strategy considers heteroge- neous properties. This phenomenon further implies the structure-activity relationship of the refinery system and provides insightful suggestions for process system design. The results also indicate that robustness analysis is a _promising applicat!on of methodologies from complex networks to process system engineering..
基金ACKNOWLEDGEMENT This work was partially supported by the National Basic Research Program of China under Grant No. 2012CB315905 the National Natural Sci- ence Foundation of China under Grants No. 61272501, No. 61173154, No. 61370190 and the Beijing Natural Science Foundation under Grant No. 4132056.
文摘To provide a high-security guaran- tee to network coding and lower the comput- ing complexity induced by signature scheme, we take full advantage of homomorphic prop- erty to build lattice signature schemes and sec- ure network coding algorithms. Firstly, by means of the distance between the message and its sig- nature in a lattice, we propose a Distance-bas- ed Secure Network Coding （DSNC） algorithm and stipulate its security to a new hard problem Fixed Length Vector Problem （FLVP）, which is harder than Shortest Vector Problem （SVP） on lattices. Secondly, considering the bound- ary on the distance between the message and its signature, we further propose an efficient Bo- undary-based Secure Network Coding （BSNC） algorithm to reduce the computing complexity induced by square calculation in DSNC. Sim- ulation results and security analysis show that the proposed signature schemes have stronger unforgeability due to the natural property of lattices than traditional Rivest-Shamir-Adleman （RSA）-based signature scheme. DSNC algo- rithm is more secure and BSNC algorithm greatly reduces the time cost on computation.
