Various density light field image coding based on distortion minimization interpolation

In recent years, the light field (LF) as a new imaging modality has attracted wide interest. The large data volume of LF images poses great challenge to LF image coding, and the LF images captured by different devices show significant differences in angular domain. In this paper we propose a view prediction framework to handle LF image coding with various sampling density. All LF images are represented as view arrays. We first partition the views into reference view (RV) set and intermediate view (IV) set. The RVs are rearranged into a pseudo sequence and directly compressed by a video encoder. Other views are then predicted by the RVs. To exploit the four dimensional signal structure, we propose the linear approximation prior (LAP) to reveal the correlation among LF views and efficiently remove the LF data redundancy. Based on the LAP, a distortion minimization interpolation (DMI) method is used to predict IVs. To robustly handle the LF images with different sampling density, we propose an Iteratively Updating depth image based rendering (IU-DIBR) method to extend our DMI. Some auxiliary views are generated to cover the target region and then the DMI calculates reconstruction coefficients for the IVs. Different view partition patterns are also explored. Extensive experiments on different types LF images also valid the efficiency of the proposed method.     

低阶煤颗粒-气/油泡间的诱导时间研究

为表征低阶煤颗粒-气/油泡间矿化过程的差异,通过Sutherland理论下固体颗粒进入泡沫产品的总概率(E)和浮选速率常数(k)之间关系,并结合低阶煤颗粒-气/油泡的浮选速率试验,求得了低阶煤颗粒-气/油泡间的诱导时间。浮选实验研究表明,在相同的捕收剂消耗量下低阶煤-油泡浮选产率均高于低阶煤-气泡浮选产率。诱导时间测试表明,低阶煤颗粒-油泡间的诱导时间(35 ms)要明显低于低阶煤颗粒-气泡间的诱导时间(93 ms)。上述实验结果表明,油泡表面的疏水性要强于传统浮选气泡表面的疏水性。然而,进一步利用Sutherland理论中固体颗粒进入泡沫产品的总概率和浮选速率常数之间的数学关系,并结合低阶煤颗粒-气/油泡的浮选速率试验求得的低阶煤颗粒-气/油泡间的诱导时间分别为9.67和8.46 ms,其与诱导时间测试仪分别测量的诱导时间差异很大。这主要是由于在实际浮选过程中气/油泡的上升速度分别为23.26和22.68 cm/s,其远高于2015EZ型诱导时间仪测试过程中气/油泡碰撞速度(2.0 cm/s)。因此,诱导时间理论计算表明气泡-颗粒间的碰撞速度对颗粒-气泡间的诱导时间影响很大。上述研究结果表明油泡浮选效果优于传统浮选的内在原因在于低阶煤颗粒-油泡间的诱导时间小于低阶煤颗粒-气泡间的诱导时间。     

机翼极限环颤振的CFD/CSD全隐式紧耦合方法

针对轴承振动实时状态监控的需要，从符号动力学角度提出了符号聚合近似与Lempel-ziv复杂度（SAX-LZC）融合的振动监控参数。首先，以Logistic映射和Duffing方程为对象，从理论角度验证了SAX-LZC对动力学结构表征的准确性，并验证了该指标的抗噪能力和计算效率；其次，将SAX-LZC指标与信息熵、样本熵、多分段Lempel-ziv复杂度等动力学参数性能进行了综合对比；最后，从实验角度对轴承早期微弱异常进行了监测，并对轴承典型故障进行了特征提取。理论研究结果表明，SAX-LZC具有动力学结构表征准确、抗噪能力好、计算高效简洁等优点，克服了常规动力学参数工程应用能力弱的问题。实验研究结果表明，SAX-LZC对早期微弱异常有准确的监测，对不同种类故障具有较好的区分度，弥补了时域和频域对轴承微弱故障表征能力不足的缺陷，是一种轴承振动实时状态监控与故障特征提取的有效参数。     

Computing approximate blocking probabilities for transparent waveband switching based WDM networks using hierarchical cross-connects

An analytical model is presented to study the dynamics of wavelength division multiplexing (WDM) networks with waveband switching (WBS). The reduced load approximation method is considered to compute approximated network blocking probabilities in WBS-based WDM networks. The analytical model considers the link blocking probability due to insufficient link capacity and an impact of the waveband granularity (G). The analytical model also considers the node blocking probability due to unavailability of a switch port at the wavelength cross connect (WXC) layer of an Hierarchical cross connect (HXC) switch node. The set of nonlinear equations is obtained with the link independence assumption and solved using repeated substitutions. The accuracy of the analytical model is examined by comparing with simulation results considering the random-fit algorithm for waveband and wavelength assignments in different network scenarios. Lightpaths are routed between source and destination (s-d) HXC switch nodes using shortest path first (SPF) routing. An impact of the switch parameter to limit the input and the output WXC switch ports of an HXC switching node is also being investigated using the analytical model as well as through simulation results.     

Replenishment policy for a purchase-to-order seller: a tradeoff between ordering cost and delay cost

We consider replenishment decisions on when and how many goods to purchase for a seller under a purchase-to-order mode where there is no inventory and the seller purchases goods to fulfil orders already placed. For each purchase, there is a constant ordering cost. For each order, delay cost will be incurred if it is not fulfilled timely. Generally, the more frequent the replenishment, the higher the ordering cost but the lower the delay cost. Consequently, there is a tradeoff between the ordering cost and the delay cost for the seller to make replenishment decisions minimising the total cost. In this paper, we study three cases of the problem and investigate both offline versions and online versions according to the seller's knowledge about information of future orders. For offline versions with perfect information, we either develop an optimal policy, or prove it is NP-hard and develop an approximation policy. For online versions without any information about future orders, from the perspective of competitive analysis we prove the lower bound of competitive ratio for any possible online policy and present a 10-competitive online policy for the general case and a 2-competitive online policy for each of two special cases.     

Mixture ratio modeling of dynamic systems

Any knowledge extraction relies (possibly implicitly) on a hypothesis about the modelled-data dependence. The extracted knowledge ultimately serves to a decision-making (DM). DM always faces uncertainty and this makes probabilistic modelling adequate. The inspected black-box modeling deals with “universal” approximators of the relevant probabilistic model. Finite mixtures with components in the exponential family are often exploited. Their attractiveness stems from their flexibility, the cluster interpretability of components and the existence of algorithms for processing high-dimensional data streams. They are even used in dynamic cases with mutually dependent data records while regression and auto-regression mixture components serve to the dependence modeling. These dynamic models, however, mostly assume data-independent component weights, that is, memoryless transitions between dynamic mixture components. Such mixtures are not universal approximators of dynamic probabilistic models. Formally, this follows from the fact that the set of finite probabilistic mixtures is not closed with respect to the conditioning, which is the key estimation and predictive operation. The paper overcomes this drawback by using ratios of finite mixtures as universally approximating dynamic parametric models. The paper motivates them, elaborates their approximate Bayesian recursive estimation and reveals their application potential.     

Process noise covariance estimation via stochastic approximation

Kalman filtering for linear systems is known to provide the minimum variance estimation error, under the assumption that the model dynamics is known. While many system identification tools are available for computing the system matrices from experimental data, estimating the statistics of the output and process noises is still an open problem. Correlation-based approaches are very fast and sufficiently accurate, but there are typically restrictions on the number of noise covariance elements that can be estimated. On the other hand, maximum likelihood methods estimate all elements with high accuracy, but they are computationally expensive, and they require the use of external optimization solvers. In this paper, we propose an alternative solution, tailored for process noise covariance estimation and based on stochastic approximation and gradient-free optimization, that provides a good trade-off in terms of performance and computational load, and is also easy to implement. The effectiveness of the method as compared to the state of the art is shown on a number of recently proposed benchmark examples.     

A directional control method for interface flow considering static voltage stability

A directional control method (DCM) for power flows on a set of interface lines between two regions of power system considering static voltage stability margin is developed in this paper. A surface approximation approach is firstly used to obtain the relationship between the interface flow solution and the generation direction of generator (the portion of generation variation in each participating generator to satisfy the desired power increase on the interface and the system loss). Then, an optimization model is built to determine the optimum dispatching scheme of generators. This method not only can control the total power on the interface to satisfy the power demand but also can realize the directional control of power on each interface line based on the needs of operation. The proposed DCM is further extended to determine the optimum dispatching scheme of generators for maximizing the interface flow margin (IFM), which is the active power margin of the key transmission lines between two regions of power system constrained by static voltage stability. A modified continuation power flow (MCPF) is used to show and evaluate the impacts of the DCM on the IFM. The New England 39-bus system and the IEEE 300-bus system have been employed to verify the effectiveness of the DCM.     

Precise gouging-free tool orientations for 5-axis CNC machining

We present a precise approach to the generation of optimized collision-free and gouging-free tool paths for 5-axis CNC machining of freeform NURBS surfaces using flat-end and rounded-end (bull nose) tools having cylindrical shank. To achieve high approximation quality, we employ analysis of hyper-osculating circles (HOCs) (Wang et al., 1993a,b), that have third order contact with the target surface, and lead to a locally collision-free configuration between the tool and the target surface. At locations where an HOC is not possible, we aim at a double tangential contact among the tool and the target surface, and use it as a bridge between the feasible HOC tool paths. We formulate all such possible two-contact configurations as systems of algebraic constraints and solve them. For all feasible HOCs and two-contact configurations, we perform a global optimization to find the tool path that maximizes the approximation quality of the machining, while being gouge-free and possibly satisfying constraints on the tool tilt and the tool acceleration. We demonstrate the effectiveness of our approach via several experimental results.     

An adaptive Kriging method with double sampling criteria applied to hydrogen preparation case

Kriging model has been widely used to approximate expensive black-box problems in many engineering design fields. How to choose an appropriate sampling strategy to produce new expensive updated points is crucial. For this purpose, an adaptive Kriging method with double sampling criteria (AKM-DSC) is proposed. During every iteration of it, maximum curvature criterion and maximum variance criterion based on Kriging model are respectively optimized by trust region (TR) strategy to produce two candidate points. And then, a new screening method is used to determine final expensive-evaluation points from the two candidates. The proposed method is compared with the two typical Kriging modeling methods. The comparison results of seventeen benchmark functions verify that the proposed method can generate higher accuracy Kriging model. Finally, a hydrogen preparation case illustrates the engineering application value of the AKM-DSC method.