智能电网隐私保护技术的分析研究

融合各种新兴的技术,智能电网的出现给电力系统带来了很大的变革。但和所有新兴事物一样,智能电网也将面临新的风险,尤其是用户侧的风险。面对智能电网用户侧风险,如何保护用户隐私权,是亟待解决的问题,也是文中研究的重点。首先分析了智能电网带来的风险,尤其是用户侧面临的风险;接着,介绍了智能电网隐私保护,对智能电网隐私保护特点进行了详细的解读;最后,结合电力系统,对我国智能电网隐私保护进行了思考,对未来的工作给出了建议。     

Study of a downward gas jet in a two–dimensional fluidized bed

The study of a downward gas jet was performed in a two–dimensional (2–D) fluidized bed of sand particles under conditions of minimum fluidization and at atmospheric pressure and room temperature. The jet shifted through a cyclic sequence of left–central–right–central–left positions. The probability of the left and right jets was 40% each, while the less stable central jet occurred only 20% of the time. Discrete probability distributions of jet presence for each of the three jet configurations and an overall distribution are presented. They show that jets are dominant along the external walls of the nozzle. The depth of the downward jet increased with air flowrate in agreement with the correlation from Massimilla and Russo (1973).     

On the complexity of role updating feasibility problem in RBAC

In Role Based Access Control (RBAC) systems, it is necessary and important to update the role–permission assignments in order to reflect the evolutions of the system transactions. However, role updating is generally complex and challenging, especially for large-scale RBAC systems. This is because the resulting state is usually expected to meet various requirements and constraints. In this paper, we focus on a fundamental problem of role updating in RBAC, which determines whether there exists a valid role–permission assignment, i.e., whether it can satisfy all the requirements of the role updating and without violating any role–capacity or permission–capacity constraint. We formally define such a problem as the Role Updating Feasibility Problem (RUFP), and study the computational complexity of RUFP in different subcases. Our results show that although several subcases are solvable in linear time, this problem is NP-complete in the general case.     

Holographic algorithms on bases of rank 2

An essential problem in the design of holographic algorithms is to decide whether the required signatures can be realized under a suitable basis transformation (SRP). For holographic algorithms with matchgates on domain size 2, , ,  and  have built a systematical theory. In this paper, we reduce SRP on domain size k≥3$k\ge 3$ to SRP on domain size 2 for holographic algorithms with matchgates on bases of rank 2. Furthermore, we generalize the collapse theorem of [3] to domain size k≥3$k\ge 3$.     

Order-k α-hulls and α-shapes

We introduce order-k α-hulls and α-shapes – generalizations of α-hulls and α-shapes. Being also a generalization of k-hull (known in statistics as “k-depth contour”), order-k α-hull provides a link between shape reconstruction and statistical depth. As a generalization of α-hull, order-k α-hull gives a robust shape estimation by ignoring locally up to k outliers in a point set. Order-k α-shape produces an “inner” shape of the set, with the amount of “digging” into the points controlled by k. As a generalization of k-hull, order-k α-hull is capable of determining “deep” points amidst samples from a multimodal distribution: it correctly identifies points which lie outside clusters of samples.The order-k α-hulls and α-shapes are related to order-k Voronoi diagrams in the same way in which α-hulls and α-shapes are related to Voronoi diagrams. This implies that order-k α-hull and α-shape can be readily built from order-k Voronoi diagram, and that the number of different order-k α-shapes for all possible values of α is proportional to the complexity of order-k Voronoi diagram.     

大开口高承载网格加筋壳的设计与工艺

本文采用有限元法计算了承受高轴压和外压作用下的大开口复合材料纵横密加筋壳的稳定性，得出不同铺层角度、不同受力工况下的大开口圆柱壳的临界载荷，并采用1：1试验件进行试验验证，将计算值与实验值进行了比较；对大开口复合材料纵横密加筋壳的缠绕工艺进行了研究，解决了大开口网格加筋壳开口补强的一次成型技术和密筋及开口部分的多丝嘴、无增量、非线性机械化缠绕成型工艺技术。     

Sky Based Light Metering for High Dynamic Range Images

Image calibration requires both linearization of pixel values and scaling so that values in the image correspond to real‐world luminances. In this paper we focus on the latter and rather than rely on camera characterization, we calibrate images by analysing their content and metadata, obviating the need for expensive measuring devices or modeling of lens and camera combinations. Our analysis correlates sky pixel values to luminances that would be expected based on geographical metadata. Combined with high dynamic range (HDR) imaging, which gives us linear pixel data, our algorithm allows us to find absolute luminance values for each pixel—effectively turning digital cameras into absolute light meters. To validate our algorithm we have collected and annotated a calibrated set of HDR images and compared our estimation with several other approaches, showing that our approach is able to more accurately recover absolute luminance. We discuss various applications and demonstrate the utility of our method in the context of calibrated color appearance reproduction and lighting design.     

Variational Tree Synthesis

Modelling trees according to desired shapes is important for many applications. Despite numerous methods having been proposed in tree modelling, it is still a non‐trivial task and challenging. In this paper, we present a new variational computing approach for generating realistic trees in specific shapes. Instead of directly modelling trees from symbolic rules, we formulate the tree modelling as an optimization process, in which a variational cost function is iteratively minimized. This cost function measures the difference between the guidance shape and the target tree crown. In addition, to faithfully capture the branch structure of trees, several botanical factors, including the minimum total branches volume and spatial branches patterns, are considered in the optimization to guide the tree modelling process. We demonstrate that our approach is applicable to generate trees with different shapes, from interactive design and complex polygonal meshes.     

A Projective Framework for Polyhedral Mesh Modelling

We present a novel framework for polyhedral mesh editing with face‐based projective maps that preserves planarity by definition. Such meshes are essential in the field of architectural design and rationalization. By using homogeneous coordinates to describe vertices, we can parametrize the entire shape space of planar‐preserving deformations with bilinear equations. The generality of this space allows for polyhedral geometric processing methods to be conducted with ease. We demonstrate its usefulness in planar‐quadrilateral mesh subdivision, a resulting multi‐resolution editing algorithm, and novel shape‐space exploration with prescribed transformations. Furthermore, we show that our shape space is a discretization of a continuous space of conjugate‐preserving projective transformation fields on surfaces. Our shape space directly addresses planar‐quad meshes, on which we put a focus, and we further show that our framework naturally extends to meshes with faces of more than four vertices as well.     

Robust Treatment of Degenerate Elements in Interactive Corotational FEM Simulations

We address the problem of robust and efficient treatment of element collapse and inversion in corotational FEM simulations of deformable objects in two and three dimensions, and show that existing degeneration treatment methods have previously unreported flaws that seriously threaten robustness and physical plausibility in interactive applications. We propose a new method that avoids such flaws, yields faster and smoother degeneration recovery and extends the range of well‐behaved degenerate configurations without adding significant complexity or computational cost to standard explicit and quasi‐implicit solvers.