High-resolution ice core records covering long time spans enable reconstruction of the past climatic and environmental conditions allowing the investigation of the earth system's evolution. Preprocessing of ice co...High-resolution ice core records covering long time spans enable reconstruction of the past climatic and environmental conditions allowing the investigation of the earth system's evolution. Preprocessing of ice cores has direct impacts on the data quality control for further analysis since the conventional ice core processing is time-consuming, produces qualitative data, leads to ice mass loss, and leads to risks of potential secondary pollution. However, over the past several decades, preprocessing of ice cores has received less attention than the improvement of ice drilling, the analytical methodology of various indices, and the researches on the climatic and environmental significance of ice core records. Therefore, this papers reviews the development of the processing for ice cores including framework, design as well as materials, analyzes the technical advantages and disadvantages of the different systems. In the past, continuous flowanalysis(CFA) has been successfully applied to process the polar ice cores. However, it is not suitable for ice cores outside polar region because of high level of particles, the memory effect between samples, and the filtration before injection. Ice core processing is a subtle and professional operation due to the fragility of the nonmetallic materials and the random distribution of particles and air bubbles in ice cores, which aggravates uncertainty in the measurements. The future developments of CFA are discussed in preprocessing, memory effect, challenge for brittle ice, coupling with real-time analysis and optimization of CFA in the field. Furthermore, non-polluting cutters with many different configurations could be designed to cut and scrape in multiple directions and to separate inner and outer portions of the core. This system also needs to be coupled with streamlined operation of packaging, coding, and stacking that can be implemented at high resolution and rate, avoiding manual intervention. At the same time, information of the longitudinal sections could be scanned andidentified, and then classified to obtain quantitative data. In addition, irregular ice volume and weight can also be obtained accurately. These improvements are recorded automatically via user-friendly interfaces. These innovations may be applied to other paleomedias with similar features and needs.展开更多
Kernel hooks are very important con- trol data in OS kernel. Once these data are com- promised by attackers, they can change the control flow of OS kemel＇s execution. Previ- ous solutions suffer from limitations in t...Kernel hooks are very important con- trol data in OS kernel. Once these data are com- promised by attackers, they can change the control flow of OS kemel＇s execution. Previ- ous solutions suffer from limitations in that： 1） some methods require modifying the source code of OS kernel and kernel modules, which is less practical for wide deployment; 2） other methods cannot well protect the kernel hooks and function return addresses inside kernel mo- dules whose memory locations cannot be pre- determined. To address these problems, we propose OPKH, an on-the-fly hook protection system based on the virtualization technology. Compared with previous solutions, OPKH off- ers the protected OS a fully transparent envi- ronment and an easy deployment. In general, the working procedure of OPKH can be di- vided into two steps. First, we utilise the me- mory virtualization for offiine profiling so that the dynamic hooks can be identified. Second, we exploit the online patching technique to in- strument the hooks for run-time protection. The experiments show that our system can pro- tect the dynamic hooks effectively with mini- mal performance overhead.展开更多
This paper formally defines and analyses the new notion of correctness called quasi serializability, and then outlines corresponding concurrency control protocol QDHP for distributed real-time databases. Finally, thro...This paper formally defines and analyses the new notion of correctness called quasi serializability, and then outlines corresponding concurrency control protocol QDHP for distributed real-time databases. Finally, through a series of simulation studies, it shows that using the new concurrency control protocol the performance of distributed real-time databases can be much improved.展开更多
Iterative algorithms for solving the data assimilation problems are considered，based on the main and adjoint equations.Spectral properties of the control operators of the problem are studied, the iterative algorithm...Iterative algorithms for solving the data assimilation problems are considered，based on the main and adjoint equations.Spectral properties of the control operators of the problem are studied, the iterative algorithms are justified.展开更多
Software Defined Networking （SDN） is an emerging networking paradigm that assumes a logically centralized control plane separated from the data plane. Despite all its advantages, separating the control and data plan...Software Defined Networking （SDN） is an emerging networking paradigm that assumes a logically centralized control plane separated from the data plane. Despite all its advantages, separating the control and data planes introduces new challenges regarding resilient communications between the two. That is, disconnec- tions between switches and their controllers could result in substantial packet loss and performance degradation. This paper addresses this challenge by studying the issue of control traffic protection in SDNs with arbitrary numbers of controllers. Specifically, we propose a control traffic protection scheme that combines both local rerouting and constrained reverse path forwarding protections, through which switches can locally react to fail- ures and redirect the control traffic using standby backup forwarding options. Our goal is then to find a set of primary routes for control traffic, called protected control network, where as many switches as possible can benefit from the proposed protection scheme. We formulate the protected control network problem, prove its NP-hardness, and develop an algorithm that reconciles proteetability and performance （e.g., switch-to-control latency）. Through extensive simulations based on real topologies, we show that our approach significantly im- proves protectability of control traffic. The results should help further the process of deploying SDN in real-world networks.展开更多
A class of networked control systems is investigated whose communication network is shared with other applications. The design objective for such a system setting is not only the optimization of the control performanc...A class of networked control systems is investigated whose communication network is shared with other applications. The design objective for such a system setting is not only the optimization of the control performance but also the efficient utilization of the communication resources. We observe that at a large time scale the data packet delay in the communication network is roughly varying piecewise constant, which is typically true for data networks like the Internet. Based on this observation, a dynamic data packing scheme is proposed within the recently developed packet-based control framework for networked control systems. As expected this proposed approach achieves a fine balance between the control performance and the communication utilization: the similar control performance can be obtained at dramatically reduced cost of the communication resources. Simulations illustrate the effectiveness of the proposed approach.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.41630754)the State Key Laboratory of Cryospheric Science(SKLCS-ZZ-2017)CAS Key Technology Talent Program and Open Foundation of State Key Laboratory of Hydrology-Water Resources and Hydraulic Engineering(2017490711)
文摘High-resolution ice core records covering long time spans enable reconstruction of the past climatic and environmental conditions allowing the investigation of the earth system's evolution. Preprocessing of ice cores has direct impacts on the data quality control for further analysis since the conventional ice core processing is time-consuming, produces qualitative data, leads to ice mass loss, and leads to risks of potential secondary pollution. However, over the past several decades, preprocessing of ice cores has received less attention than the improvement of ice drilling, the analytical methodology of various indices, and the researches on the climatic and environmental significance of ice core records. Therefore, this papers reviews the development of the processing for ice cores including framework, design as well as materials, analyzes the technical advantages and disadvantages of the different systems. In the past, continuous flowanalysis(CFA) has been successfully applied to process the polar ice cores. However, it is not suitable for ice cores outside polar region because of high level of particles, the memory effect between samples, and the filtration before injection. Ice core processing is a subtle and professional operation due to the fragility of the nonmetallic materials and the random distribution of particles and air bubbles in ice cores, which aggravates uncertainty in the measurements. The future developments of CFA are discussed in preprocessing, memory effect, challenge for brittle ice, coupling with real-time analysis and optimization of CFA in the field. Furthermore, non-polluting cutters with many different configurations could be designed to cut and scrape in multiple directions and to separate inner and outer portions of the core. This system also needs to be coupled with streamlined operation of packaging, coding, and stacking that can be implemented at high resolution and rate, avoiding manual intervention. At the same time, information of the longitudinal sections could be scanned andidentified, and then classified to obtain quantitative data. In addition, irregular ice volume and weight can also be obtained accurately. These improvements are recorded automatically via user-friendly interfaces. These innovations may be applied to other paleomedias with similar features and needs.
基金supported in part by the National High Technology Research and Development Program of China(863 Program)under Grant No.2009AA01Z433the Project of National Ministry under Grant No.A21201-10006the Open Foundation of State Key Laboratory of Information Security(Institute of Information Engineering,Chinese Academy of Sciences)under Grant No.2013-4-1
文摘Kernel hooks are very important con- trol data in OS kernel. Once these data are com- promised by attackers, they can change the control flow of OS kemel＇s execution. Previ- ous solutions suffer from limitations in that： 1） some methods require modifying the source code of OS kernel and kernel modules, which is less practical for wide deployment; 2） other methods cannot well protect the kernel hooks and function return addresses inside kernel mo- dules whose memory locations cannot be pre- determined. To address these problems, we propose OPKH, an on-the-fly hook protection system based on the virtualization technology. Compared with previous solutions, OPKH off- ers the protected OS a fully transparent envi- ronment and an easy deployment. In general, the working procedure of OPKH can be di- vided into two steps. First, we utilise the me- mory virtualization for offiine profiling so that the dynamic hooks can be identified. Second, we exploit the online patching technique to in- strument the hooks for run-time protection. The experiments show that our system can pro- tect the dynamic hooks effectively with mini- mal performance overhead.
基金the National Natural Science Foundation of China and the Commission of Science,Technokgy and Industry for National Defense
文摘This paper formally defines and analyses the new notion of correctness called quasi serializability, and then outlines corresponding concurrency control protocol QDHP for distributed real-time databases. Finally, through a series of simulation studies, it shows that using the new concurrency control protocol the performance of distributed real-time databases can be much improved.
基金Project supported by the Russian Foundation forBasic Research(grant 00-01-00611).
文摘Iterative algorithms for solving the data assimilation problems are considered，based on the main and adjoint equations.Spectral properties of the control operators of the problem are studied, the iterative algorithms are justified.
基金supported in part by National High-tech R&D Program of China(863 Program)(Grant Nos.2013AA0133012015AA016101)
文摘Software Defined Networking （SDN） is an emerging networking paradigm that assumes a logically centralized control plane separated from the data plane. Despite all its advantages, separating the control and data planes introduces new challenges regarding resilient communications between the two. That is, disconnec- tions between switches and their controllers could result in substantial packet loss and performance degradation. This paper addresses this challenge by studying the issue of control traffic protection in SDNs with arbitrary numbers of controllers. Specifically, we propose a control traffic protection scheme that combines both local rerouting and constrained reverse path forwarding protections, through which switches can locally react to fail- ures and redirect the control traffic using standby backup forwarding options. Our goal is then to find a set of primary routes for control traffic, called protected control network, where as many switches as possible can benefit from the proposed protection scheme. We formulate the protected control network problem, prove its NP-hardness, and develop an algorithm that reconciles proteetability and performance （e.g., switch-to-control latency）. Through extensive simulations based on real topologies, we show that our approach significantly im- proves protectability of control traffic. The results should help further the process of deploying SDN in real-world networks.
基金supported by the National Natural Science Foundation of China(Grant Nos.6142230761174061&61304048)+4 种基金the Scientific Research Starting Foundation for the Returned Overseas Chinese Scholars,Ministry of Education of Chinathe National Hi-Tech Research and Development Program of China("863"Project)(Grant No.2014AA06A503)the Youth Innovation Promotion Association,Chinese Academy of Sciences,in part by the Youth Top-Notch Talent Support Programthe 1000-Talent Youth ProgramZhejiang 1000-Talent Program
文摘A class of networked control systems is investigated whose communication network is shared with other applications. The design objective for such a system setting is not only the optimization of the control performance but also the efficient utilization of the communication resources. We observe that at a large time scale the data packet delay in the communication network is roughly varying piecewise constant, which is typically true for data networks like the Internet. Based on this observation, a dynamic data packing scheme is proposed within the recently developed packet-based control framework for networked control systems. As expected this proposed approach achieves a fine balance between the control performance and the communication utilization: the similar control performance can be obtained at dramatically reduced cost of the communication resources. Simulations illustrate the effectiveness of the proposed approach.
