加油站电气改造应重视的几个问题

由于加油站电气改造工程的质量对加油站的日常经营和安全管理有重大影响，针对改造中存在的一些共性问题，根据国家有关规范和标准，从电气改造工程的设计、配电系统、配电线路，以及防雷、防静电和防过电压等方面提出了要求和建议。     

Parametric circles and spheres

Formulations for parametric circles and spheres in terms of rational Gaussian (RaG) curves and surfaces are introduced. With the proposed formulations, a full circle is generated by interpolating a closed RaG curve to the vertices of an equilateral triangle, and a full sphere is generated by interpolating a closed RaG surface to the vertices of an octahedron with equilateral triangular faces. Generation of circles and spheres in this manner is very intuitive and easy to remember as the weights are all 1 and the nodes are all unique and uniformly spaced.     

Stability analysis of network-based cooperative resource allocation strategies

Resource allocation involves deciding how to divide a resource of limited availability among multiple demands in a way that optimizes current objectives. In this brief paper we focus on one type of distributed resource allocation problem where via an imperfect communication network multiple processors can share the load presented by multiple task types. We introduce asynchronous “cooperative” resource allocation strategies, and show that they lead to a bounded cumulative demand.     

Nonpathological Lyapunov functions and discontinuous Carathéodory systems

Differential equations with discontinuous right-hand side and solutions intended in Carathéodory sense are considered. For these equations, sufficient conditions which guarantee both Lyapunov stability and asymptotic stability in terms of nonsmooth Lyapunov functions are given. An invariance principle is also proven.     

Finding feasible mold parting directions using graphics hardware

We present new programmable graphics hardware accelerated algorithms to test the 2-moldability of geometric parts and assist with part redesign. These algorithms efficiently identify and graphically display undercuts as well as minimum and insufficient draft angles. Their running times grow only linearly with respect to the number of facets in the solid model, making them efficient subroutines for our algorithms that test whether a tessellated CAD model can be manufactured in a two-part mold. We have developed and implemented two such algorithms to choose candidate directions to test for 2-moldability using accessibility analysis and Gauss maps. The efficiency of these algorithms lies in the fact that they identify groups of candidate directions such that if any one direction in the group is undercut-free, all are, or if any one is not undercut-free, none are. We examine trade-offs between the algorithms' speed, accuracy, and whether they guarantee that an undercut-free direction will be found for a part if one exists.     

Bullwhip reduction for ARMA demand: The proportional order-up-to policy versus the full-state-feedback policy

A ‘proportional’ order-up-to policy reacting to ARMA demand is analyzed using stochastic optimal control theory. This policy is compared with a full-state-feedback order-up-to policy. Necessary conditions for an optimum of a weighted sum of the inventory and the ordering variances for both policies are formulated. Based on this a relatively simple expression for the ‘full-state’ policy is derived. The comparison between the two policies demonstrates that the ‘intuitively’ designed proportional policy does not fulfill the objective of controlling both the inventory and ordering variance for all parameter values of the demand model as well as the full-state-feedback policy. The full-state-feedback policy outperforms the proportional policy in several aspects.     

Data decomposition using independent component analysis with prior constraints

In many data analysis problems, it is useful to consider the data as generated from a set of unknown (latent) generators or sources. The observations we make of a system are then taken to be related to these sources through some unknown function. Furthermore, the (unknown) number of underlying latent sources may be less than the number of observations. Recent developments in independent component analysis (ICA) have shown that, in the case where the unknown function linking sources to observations is linear, such data decomposition may be achieved in a mathematically elegant manner. In this paper, we extend the general ICA paradigm to include a very flexible source model, prior constraints and conditioning on sets of intermediate variables so that ICA forms one part of a hierarchical system. We show that such an approach allows for efficient discovery of hidden representation in data and for unsupervised data partitioning.