Security Analysis of Multicast/Unicast Router Key Management Protocols

Key Management Protocols (KMPs) are intended to manage cryptographic keys in a cryptosystem. KMPs have been standardized for Internet Protocol Security (IPsec), and these KMPs have been formally validated for their security properties. In the Internet, routing protocols have different requirements on their KMPs, which are not met by the existing IPsec KMPs, such as IKE, IKEv2, and GDOI. Protocol modeling has been used to analyze the security of the IPsec KMPs. For routing protocols, there are new KMPs proposed by the Keying and Authentication for Routing Protocols (KARP) working group of the Internet Engineering Task Force: RKMP, MRKM, and MaRK. These KMPs are designed to have better applicability for general routing protocols. However, the security of these protocols has not been validated. In this thesis, we have summarized the necessary conditions for security of routing protocols. We have analyzed the security aspects of RKMP, MRKM, and MaRK, by formally validating those protocols using the AVISPA modeling tool. This has shown that these KMPs meet the necessary security requirements

Physics-guided Noise Neural Proxy for Low-light Raw Image Denoising

Low-light raw image denoising plays a crucial role in mobile photography, and learning-based methods have become the mainstream approach. Training the learning-based methods with synthetic data emerges as an efficient and practical alternative to paired real data. However, the quality of synthetic data is inherently limited by the low accuracy of the noise model, which decreases the performance of low-light raw image denoising. In this paper, we develop a novel framework for accurate noise modeling that learns a physics-guided noise neural proxy (PNNP) from dark frames. PNNP integrates three efficient techniques: physics-guided noise decoupling (PND), physics-guided proxy model (PPM), and differentiable distribution-oriented loss (DDL). The PND decouples the dark frame into different components and handles different levels of noise in a flexible manner, which reduces the complexity of the noise neural proxy. The PPM incorporates physical priors to effectively constrain the generated noise, which promotes the accuracy of the noise neural proxy. The DDL provides explicit and reliable supervision for noise modeling, which promotes the precision of the noise neural proxy. Extensive experiments on public low-light raw image denoising datasets and real low-light imaging scenarios demonstrate the superior performance of our PNNP framework

Optimal Caching Policy of Stochastic Updating Information in Delay Tolerant Networks

To increase the speed of information retrieval, one message may have multiple replicas in Delay Tolerant Networks (DTN). In this paper, we adopt a discrete time model and focus on the caching policy of stochastic updating information. In particular, the source creates new version in every time slot with certain probability. New version is usually more useful than the older one. We use a utility function to denote the availability of different versions. To constrain the number of replicas, we propose a probabilistic management policy and nodes to discard information with certain probability determined by the version of the information. Our objective is to find the best value of the probability to maximize the total utility value. Because new version is created with certain probability, nodes other than the source may not know whether the information stored in them is the latest version. Therefore, they can make decisions only according to the local state and decisions based on the local state can be seen as local-policy. We also explore the global-policy, that is, nodes understand the real state. We prove that the optimal policies in both cases conform to the threshold form. Simulations based on both synthetic and real motion traces show the accuracy of our theoretical model. Surprisingly, numerical results show that local-policy is better than the global-policy in some cases

DAMO-YOLO : A Report on Real-Time Object Detection Design

In this report, we present a fast and accurate object detection method dubbed DAMO-YOLO, which achieves higher performance than the state-of-the-art YOLO series. DAMO-YOLO is extended from YOLO with some new technologies, including Neural Architecture Search (NAS), efficient Reparameterized Generalized-FPN (RepGFPN), a lightweight head with AlignedOTA label assignment, and distillation enhancement. In particular, we use MAE-NAS, a method guided by the principle of maximum entropy, to search our detection backbone under the constraints of low latency and high performance, producing ResNet/CSP-like structures with spatial pyramid pooling and focus modules. In the design of necks and heads, we follow the rule of ``large neck, small head''.We import Generalized-FPN with accelerated queen-fusion to build the detector neck and upgrade its CSPNet with efficient layer aggregation networks (ELAN) and reparameterization. Then we investigate how detector head size affects detection performance and find that a heavy neck with only one task projection layer would yield better results.In addition, AlignedOTA is proposed to solve the misalignment problem in label assignment. And a distillation schema is introduced to improve performance to a higher level. Based on these new techs, we build a suite of models at various scales to meet the needs of different scenarios. For general industry requirements, we propose DAMO-YOLO-T/S/M/L. They can achieve 43.6/47.7/50.2/51.9 mAPs on COCO with the latency of 2.78/3.83/5.62/7.95 ms on T4 GPUs respectively. Additionally, for edge devices with limited computing power, we have also proposed DAMO-YOLO-Ns/Nm/Nl lightweight models. They can achieve 32.3/38.2/40.5 mAPs on COCO with the latency of 4.08/5.05/6.69 ms on X86-CPU. Our proposed general and lightweight models have outperformed other YOLO series models in their respective application scenarios.Comment: Project Website: https://github.com/tinyvision/damo-yol

Optimized forecast components-SVM-based fault diagnosis with applications for wastewater treatment

Process monitoring of wastewater treatment plant (WWTP) is a challenging industrial problem, due to its exposure to the hostile working environment and significant disturbances. This paper proposed a novel fault diagnosis method, termed as optimization forecast components-support vector machine (OFC-SVM). The method firstly improved the forecastable component analysis (ForeCA) for feature extraction. Secondly, in order to further enhance the method, the quadratic Grid Search (GS) algorithm is utilized to optimize the parameters of the proposed method. Thirdly, to properly evaluate the method performance, a new evaluation index is proposed, named Pre Alarm Rate (PAR), aiming to achieve the quantitative trade-off between false alarm rate (FAR) and missed alarm rate(MAR). Then, the new ROC curve can be further derived by PAR. Finally, the performance of OFC-SVM is strictly compared with other five methods as well as validated by a Monte Carlo model and a full-scale WWTP

Modeling of adaptive multi-output soft-sensors with applications in wastewater treatments

Given the multivariable coupling, strong nonlinearity and time-varying features in the wastewater treatment processes, adaptive strategies, including just-in-time learning (JITL), time difference (TD), and moving window (MW) methods have been chosen in this paper to enhance multi-output soft-sensor models to ensure online prediction for a variety of hard-to-measure variables simultaneously. In the proposed adaptive multi-output soft-sensors, multi-output partial least squares (MPLS), multi-output relevant vector machine (MRVM) and multi-output Gaussian process regression (MGPR) served as the multi-output models. The integration of adaptive strategies and multi-output models not only provides a solution for multi-output prediction, but also offers a potential to alleviate the degradation of multi-output soft-sensors. To further improve the adaptive ability, four adaptive soft-sensors, termed TD-MW, TD-JIT, JIT-MW, and TD-JIT-MW, have been proposed by mixing the three aforementioned adaptive strategies to upgrade multi-output softsensors. All the adaptive multi-output soft-sensors are analyzed and compared in terms of simulation data and practical industrial data, which exhibit stationary and nonstationary behaviors, respectively

Adaptive ranking based ensemble learning of Gaussian process regression models for quality-related variable prediction in process industries

The proper monitoring of quality-related but hard-to-measure variables is currently one of the bottlenecks limiting the safe and efficient operations of industrial processes. This paper proposes a novel ensemble learning algorithm by coordinating global and local Gaussian process regression (GPR) models, and this algorithm is able to capture global and local process behaviours for accurate prediction and timely process monitoring. To further address the deterioration in predictions when using the off-line training and online testing strategy, this paper proposes an adaptive ranking strategy to perform ensemble learning for the sub-GPR models. In this adaptive strategy, we use the moving-window technique to rank and select several of the best sub-model predictions and then average them together to make the final predictions. Last but not least, the least absolute shrinkage and selection operator (Lasso) works together with factor analysis (FA) in a two-step variable selection method to remove under-correlated model input variables in the first stage and to compress over-correlated model input variables in the second stage. The proposed prediction model is validated in two real wastewater treatment plants (WWTPs) with stationary and nonstationary behaviours. The results show that the proposed methodology achieves better performance than other standard methods in the context of their predictions of quality-related variables

Disentangling land model uncertainty via Matrix-based Ensemble Model Inter-comparison Platform (MEMIP)

Background Large uncertainty in modeling land carbon (C) uptake heavily impedes the accurate prediction of the global C budget. Identifying the uncertainty sources among models is crucial for model improvement yet has been difficult due to multiple feedbacks within Earth System Models (ESMs). Here we present a Matrix-based Ensemble Model Inter-comparison Platform (MEMIP) under a unified model traceability framework to evaluate multiple soil organic carbon (SOC) models. Using the MEMIP, we analyzed how the vertically resolved soil biogeochemistry structure influences SOC prediction in two soil organic matter (SOM) models. By comparing the model outputs from the C-only and CN modes, the SOC differences contributed by individual processes and N feedback between vegetation and soil were explicitly disentangled. Results Results showed that the multi-layer models with a vertically resolved structure predicted significantly higher SOC than the single layer models over the historical simulation (1900–2000). The SOC difference between the multi-layer models was remarkably higher than between the single-layer models. Traceability analysis indicated that over 80% of the SOC increase in the multi-layer models was contributed by the incorporation of depth-related processes, while SOC differences were similarly contributed by the processes and N feedback between models with the same soil depth representation. Conclusions The output suggested that feedback is a non-negligible contributor to the inter-model difference of SOC prediction, especially between models with similar process representation. Further analysis with TRENDY v7 and more extensive MEMIP outputs illustrated the potential important role of multi-layer structure to enlarge the current ensemble spread and the necessity of more detail model decomposition to fully disentangle inter-model differences. We stressed the importance of analyzing ensemble outputs from the fundamental model structures, and holding a holistic view in understanding the ensemble uncertainty

Halo Properties and Mass Functions of Groups/Clusters from the DESI Legacy Imaging Surveys DR9

Based on a large group/cluster catalog recently constructed from the DESI Legacy Imaging Surveys DR9 using an extended halo-based group finder, we measure and model the group-galaxy weak lensing signals for groups/clusters in a few redshift bins within redshift range $0.1 \leqslant z<0.6$. Here, the background shear signals are obtained based on the DECaLS survey shape catalog derived with the \textsc{Fourier\_Quad} method. We divide the lens samples into 5 equispaced redshift bins and 7 mass bins, which allow us to probe the redshift and mass dependence of the lensing signals and hence the resulting halo properties. In addition to these sample selections, we have also checked the signals around different group centers, e.g., brightest central galaxy (BCG), luminosity weighted center and number weighted center. We use a lensing model that includes off-centering to describe the lensing signals we measure for all mass and redshift bins. The results demonstrate that our model predictions for the halo masses, bias and concentrations are stable and self-consistent among different samples for different group centers. Taking advantage of the very large and complete sample of groups/clusters, as well as the reliable estimation of their halo masses, we provide measurements of the cumulative halo mass functions up to redshift $z=0.6$, with a mass precision at $0.03\sim0.09$ dex.Comment: revised version submitted to Ap