Accelerating BPC-PaCo through Visually Lossless Techniques

Fast image codecs are a current need in applications that deal with large amounts of images. Graphics Processing Units (GPUs) are suitable processors to speed up most kinds of algorithms, especially when they allow fine-grain parallelism. Bitplane Coding with Parallel Coefficient processing (BPC-PaCo) is a recently proposed algorithm for the core stage of wavelet-based image codecs tailored for the highly parallel architectures of GPUs. This algorithm provides complexity scalability to allow faster execution at the expense of coding efficiency. Its main drawback is that the speedup and loss in image quality is controlled only roughly, resulting in visible distortion at low and medium rates. This paper addresses this issue by integrating techniques of visually lossless coding into BPC-PaCo. The resulting method minimizes the visual distortion introduced in the compressed file, obtaining higher-quality images to a human observer. Experimental results also indicate 12% speedups with respect to BPC-PaCo.     

基于多通道的ICU脑血管疾病死亡风险预测模型

死亡风险预测指根据病人临床体征监测数据来预测未来一段时间的死亡风险。对于ICU病患，通过死亡风险预测可以有针对性地对病人做出临床诊断，以及合理安排有限的医疗资源。基于临床使用的MEWS和Glasgow昏迷评分量表，针对ICU病人临床监测的17项生理参数，提出一种基于多通道的ICU脑血管疾病死亡风险预测模型。引入多通道概念应用于BiLSTM模型，用于突出每个生理参数对死亡风险预测的作用。采用Attention机制用于提高模型预测精度。实验数据来自MIMIC [Ⅲ]数据库，从中提取3?080位脑血管疾病患者的16?260条记录用于此次研究，除了六组超参数实验之外，将所提模型与LSTM、Multichannel-BiLSTM、逻辑回归（logistic regression）和支持向量机（support vector machine, SVM）四种模型进行了对比分析，准确率Accuracy、灵敏度Sensitive、特异性Specificity、AUC-ROC和AUC-PRC作为评价指标，实验结果表明，所提模型性能优于其他模型，AUC值达到94.3%。     

Comparative analysis of formaldehyde and toluene sorption on indoor floorings and consequence on Indoor Air Quality

Indoor surfaces may be adsorptive sinks with the potential to change Indoor Air Quality. To estimate this effect, the sorption parameters of formaldehyde and toluene were assessed on five floorings by an experimental method using solid-phase microextraction in an airtight emission cell. Adsorption rate constants ranged from 0.003 to 0.075 m·h⁻¹, desorption rate constants from 0.019 to 0.51 h⁻¹, and the partition coefficient from 0.005 to 3.9 m, and these parameters vary greatly from one volatile organic compound/material couple to another indicating contrasted sorption behaviors. A rubber was identified as a sink of formaldehyde characterized by a very low desorption constant close to 0. For these sorbent floorings identified, the adsorption rates of formaldehyde are from 2 to 4 times higher than those of toluene. Two models were used to evaluate the sink effects of floorings on indoor pollutant concentrations in one room from different realistic conditions. The scenarios tested came to the conclusion that the formaldehyde sorption on one rubber (identified as a sink) has a maximum contribution from 15% to 21% for the conditions of low air exchange rate. For other floorings, the sorption has a minor contribution less than or equal to 5%, regardless of the air exchange rate.     

A signal adaptive diffusion filter for video coding: Mathematical framework and complexity reductions

In this paper we combine video compression and modern image processing methods. We construct novel iterative filter methods for prediction signals based on Partial Differential Equation (PDE) based methods. The mathematical framework of the employed diffusion filter class is given and some desirable properties are stated. In particular, two types of diffusion filters are constructed: a uniform diffusion filter using a fixed filter mask and a signal adaptive diffusion filter that incorporates the structures of the underlying prediction signal. The latter has the advantage of not attenuating existing edges while the uniform filter is less complex. The filters are embedded into a software based on HEVC with additional QTBT (Quadtree plus Binary Tree) and MTT (Multi-Type-Tree) block structure. In this setting, several measures to reduce the coding complexity of the tool are introduced, discussed and tested thoroughly. The coding complexity is reduced by up to 70% while maintaining over 80% of the gain. Overall, the diffusion filter method achieves average bitrate savings of 2.27% for Random Access having an average encoder runtime complexity of 119% and 117% decoder runtime complexity. For individual test sequences, results of 7.36% for Random Access are accomplished.     

面部运动单元检测研究综述

面部运动单元检测旨在让计算机从给定的人脸图像或视频中自动检测需要关注的运动单元目标。经过二十多年的研究，尤其是近年来越来越多的面部运动单元数据库的建立和深度学习的兴起，面部运动单元检测技术发展迅速。首先，阐述了面部运动单元的基本概念，介绍了已有的常用面部运动单元检测数据库，概括了包括预处理、特征提取、分类器学习等步骤在内的传统检测方法；然后针对区域学习、面部运动单元关联学习、弱监督学习等几个关键研究方向进行了系统性的回顾梳理与分析；最后讨论了目前面部运动单元检测研究存在的不足以及未来潜在的发展方向。     

基于双离合变速器电控单元的Volcano CAN开发

Volcano 是集汽车电子网络设计、实现和测试于一体的完整工具链。它包括整车网络规划及优化设计工具VNA,网络节点(TCU等)实现工具VTP以及网络测试工具Tellus。本文着重介绍了基于TCU的VTP。     

Lagrangian relaxation hybrid with evolutionary algorithm for short-term generation scheduling

Short-term generation scheduling is an important function in daily operational planning of power systems. It is defined as optimal scheduling of power generators over a scheduling period while respecting various generator constraints and system constraints. Objective of the problem includes costs associated with energy production, start-up cost and shut-down cost along with profits. The resulting problem is a large scale nonlinear mixed-integer optimization problem for which there is no exact solution technique available. The solution to the problem can be obtained only by complete enumeration, often at the cost of a prohibitively computation time requirement for realistic power systems. This paper presents a hybrid algorithm which combines Lagrangian Relaxation (LR) together with Evolutionary Algorithm (EA) to solve the problem in cooperative and competitive energy environments. Simulation studies were carried out on different systems containing various numbers of units. The outcomes from different algorithms are compared with that from the proposed hybrid algorithm and the advantages of the proposed algorithm are briefly discussed.     

ATSP:时态网络可视化的自适应时间片划分方法

现有的时态网络可视化方法大多采用等量时间片来可视化网络的演变，不利于时态模式的快速挖掘和发现。为此，根据时态网络固有的特征提出自适应时间片划分方法（Adaptive Time Slice Partition method，ATSP）。在时态网络的两种表示方式（基于事件的表示方式和基于快照的表示方式）的基础上，构建了ATSP的基础模型，同时提出了一种改进模型用来描述事件间隔时间服从长尾分布的时态网络。为了实现时间片的不等量划分，针对探索任务的不同提出了基于时态模式的ATSP规则和基于中心节点的ATSP规则，并提出了实现算法--层次划分算法（Hierarchical Partition algorithm，HP）和增量划分算法（Incremental Partition algorithm，IP）。实验结果表明，ATSP方法比传统的时间片划分方法更能准确地表示网络的时态特征，且该方法应用于可视化时，能有效归纳并展示网络的特征，明显提高了视觉分析的效率。     

LPNN-based approach for LASSO problem via a sequence of regularized minimizations

In compressive sampling theory, the least absolute shrinkage and selection operator (LASSO) is a representative problem. Nevertheless, the non-differentiable constraint impedes the use of Lagrange programming neural networks (LPNNs). We present in this article the -LPNN model, a novel algorithm that tackles the LASSO minimization together with the underlying theory support. First, we design a sequence of smooth constrained optimization problems, by introducing a convenient differentiable approximation to the non-differentiable -norm constraint. Next, we prove that the optimal solutions of the regularized intermediate problems converge to the optimal sparse signal for the LASSO. Then, for every regularized problem from the sequence, the -LPNN dynamic model is derived, and the asymptotic stability of its equilibrium state is established as well. Finally, numerical simulations are carried out to compare the performance of the proposed -LPNN algorithm with both the LASSO-LPNN model and a standard digital method.     

On the capacity of the state‐dependent interference relay channel

This paper considers the state‐dependent interference relay channel (SIRC) in which one of the two users may operate as a secondary user and the relay has a noncausal access to the signals from both users. For discrete memoryless SIRC, we first establish the achievable rate region by carefully merging Han‐Kobayashi rate splitting encoding technique, superposition encoding, and Gelfand‐Pinsker encoding technique. Then, based on the achievable rate region that we derive, the capacity of the SIRC is established in many different scenarios including (a) the weak interference regime, (b) the strong interference regime, and (c) the very strong interference regime. This means that our capacity results contain all available known results in the literature. Next, the achievable rate region and the associated capacity results are also evaluated in the case of additive Gaussian noise. Additionally, many numerical examples are investigated to show the value of our theoretical derivations.