In order to take full advantage of regeneration process to reduce fresh water consumption and avoid the accumulation of trace contaminants, regeneration reuse and regeneration recycle should be distinctive. A stepwise...In order to take full advantage of regeneration process to reduce fresh water consumption and avoid the accumulation of trace contaminants, regeneration reuse and regeneration recycle should be distinctive. A stepwise optimal design for water network is developed to simplify solution procedures for the formulated MINLP problem. In this paper, a feasible water reuse network framework is generated. Some heuristic rules from water reuse network are used to guide the placement of regeneration process. Then the outlet stream of regeneration process is considered as new water source. Regeneration reuse network structure is obtained through an iterative optimal procedure by taking the insights from reuse water network structure. Furthermore, regeneration recycle is only utilized to eliminate fresh water usage for processes in which regeneration reuse is impossible. Compared with the results obtained by relevant researches for the same example, the present method not only provides an appropriate regeneration reuse water network with minimum fresh water and regenerated water flow rate but also suggests a water network involving regeneration recycle with minimum recycle water flow rate. The design can utilize reuse, regeneration reuse and regeneration recycle step by step with minor water network structure change to achieve better flexibility. It can satisfy different demands for new plants and modernization of existing plants.展开更多
Community division is an important method to study the characteristics of complex networks.The widely used fast-Newman(FN)algorithm only considers the topology division of the network at the static layer,and dynamic t...Community division is an important method to study the characteristics of complex networks.The widely used fast-Newman(FN)algorithm only considers the topology division of the network at the static layer,and dynamic traffic flow demand is ignored.The result of the division is only structurally optimal.To improve the accuracy of community division,based on the static topology of air route network,the concept of network traffic contribution degree is put forward.The concept of operational research is introduced to optimize the network adjacency matrix to form an improved community division algorithm.The air route network in East China is selected as the object of algorithm comparison experiment,including 352 waypoints and 928 segments.The results show that the improved algorithm has a more ideal effect on the division of the community structure.The proportion of the number of nodes included in the large community has increased by 21.3%,and the modularity value has increased from 0.756 to 0.806,in which the modularity value is in the range of[-0.5,1).The research results can provide theoretical and technical support for the optimization of flight schedules and the rational use of air route resources.展开更多
The phenomenon of data explosion represents a severe challenge for the upcoming big data era.However,the current Internet architecture is insufficient for dealing with a huge amount of traffic owing to an increase in ...The phenomenon of data explosion represents a severe challenge for the upcoming big data era.However,the current Internet architecture is insufficient for dealing with a huge amount of traffic owing to an increase in redundant content transmission and the end-point-based communication model.Information-centric networking(ICN)is a paradigm for the future Internet that can be utilized to resolve the data explosion problem.In this paper,we focus on content-centric networking(CCN),one of the key candidate ICN architectures.CCN has been studied in various network environments with the aim of relieving network and server burden,especially in name-based forwarding and in-network caching functionalities.This paper studies the effect of several caching strategies in the CCN domain from the perspective of network and server overhead.Thus,we comprehensively analyze the in-network caching performance of CCN under several popular cache replication methods(i.e.,cache placement).We evaluate the performance with respect to wellknown Internet traffic patterns that follow certain probabilistic distributions,such as the Zipf/Mandelbrot–Zipf distributions,and flashcrowds.For the experiments,we developed an OPNET-based CCN simulator with a realistic Internet-like topology.展开更多
基金Supported by the National Natural Science Foundation of China(20906007)
文摘In order to take full advantage of regeneration process to reduce fresh water consumption and avoid the accumulation of trace contaminants, regeneration reuse and regeneration recycle should be distinctive. A stepwise optimal design for water network is developed to simplify solution procedures for the formulated MINLP problem. In this paper, a feasible water reuse network framework is generated. Some heuristic rules from water reuse network are used to guide the placement of regeneration process. Then the outlet stream of regeneration process is considered as new water source. Regeneration reuse network structure is obtained through an iterative optimal procedure by taking the insights from reuse water network structure. Furthermore, regeneration recycle is only utilized to eliminate fresh water usage for processes in which regeneration reuse is impossible. Compared with the results obtained by relevant researches for the same example, the present method not only provides an appropriate regeneration reuse water network with minimum fresh water and regenerated water flow rate but also suggests a water network involving regeneration recycle with minimum recycle water flow rate. The design can utilize reuse, regeneration reuse and regeneration recycle step by step with minor water network structure change to achieve better flexibility. It can satisfy different demands for new plants and modernization of existing plants.
基金the Fundamental Research Funds for the Central Universities,and the Foundation of Graduate Innovation Center in NUAA(No.kfjj20190735)。
文摘Community division is an important method to study the characteristics of complex networks.The widely used fast-Newman(FN)algorithm only considers the topology division of the network at the static layer,and dynamic traffic flow demand is ignored.The result of the division is only structurally optimal.To improve the accuracy of community division,based on the static topology of air route network,the concept of network traffic contribution degree is put forward.The concept of operational research is introduced to optimize the network adjacency matrix to form an improved community division algorithm.The air route network in East China is selected as the object of algorithm comparison experiment,including 352 waypoints and 928 segments.The results show that the improved algorithm has a more ideal effect on the division of the community structure.The proportion of the number of nodes included in the large community has increased by 21.3%,and the modularity value has increased from 0.756 to 0.806,in which the modularity value is in the range of[-0.5,1).The research results can provide theoretical and technical support for the optimization of flight schedules and the rational use of air route resources.
基金supported by Basic Science Research Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Education(2014R1A1A2057796)and(2015R1D1A1A01059049)
文摘The phenomenon of data explosion represents a severe challenge for the upcoming big data era.However,the current Internet architecture is insufficient for dealing with a huge amount of traffic owing to an increase in redundant content transmission and the end-point-based communication model.Information-centric networking(ICN)is a paradigm for the future Internet that can be utilized to resolve the data explosion problem.In this paper,we focus on content-centric networking(CCN),one of the key candidate ICN architectures.CCN has been studied in various network environments with the aim of relieving network and server burden,especially in name-based forwarding and in-network caching functionalities.This paper studies the effect of several caching strategies in the CCN domain from the perspective of network and server overhead.Thus,we comprehensively analyze the in-network caching performance of CCN under several popular cache replication methods(i.e.,cache placement).We evaluate the performance with respect to wellknown Internet traffic patterns that follow certain probabilistic distributions,such as the Zipf/Mandelbrot–Zipf distributions,and flashcrowds.For the experiments,we developed an OPNET-based CCN simulator with a realistic Internet-like topology.
