PI k mass production and an optimal circuit for the Nečiporuk slice

Letf: {0,1} ⁿ {0,1} ^m be anm-output Boolean function inn variables.f is called ak-slice iff(x) equals the all-zero vector for allx with Hamming weight less thank andf(x) equals the all-one vector for allx with Hamming weight more thank. Wegener showed that PI _k -set circuits (set circuits over prime implicants of lengthk) are at the heart of any optimum Boolean circuit for ak-slicef. We prove that, in PI _k -set circuits, savings are possible for the mass production of anyFX, i.e., any collectionF ofm output-sets given any collectionX ofn input-sets, if their PI _k -set complexity satisfiesSC _m (FX)3n+2m. This PI _k mass production, which can be used in monotone circuits for slice functions, is then exploited in different ways to obtain a monotone circuit of complexity 3n+o(n) for the Neiporuk slice, thus disproving a conjecture by Wegener that this slice has monotone complexity (n ^3/2). Finally, the new circuit for the Neiporuk slice is proven to be asymptotically optimal, not only with respect to monotone complexity, but also with respect to combinational complexity.     

永磁同步电机低复杂度双矢量预测电流控制

针对永磁同步电机传统模型预测电流控制中存在计算负担重和电流脉动大的问题,提出一种低复杂度双矢量预测电流控制方法。首先,利用电流无差拍控制原理快速获得下一周期的第一电压矢量,相比传统方法可减少一个周期的预测次数。其次,进行第二电压矢量的选择时可以采用非零电压矢量,增大备选电压矢量的覆盖范围。最后,根据均方根电流脉动方程,确定满足最小电流脉动条件下各个电压矢量的最佳作用时间。仿真和实验结果表明：相较于传统单矢量、双矢量预测电流控制方法,所提低复杂度双矢量预测电流控制方法能够有效抑制电流脉动,降低算法的复杂度和计算量,提高了永磁同步电机控制系统在实际中的运行性能。     

Low complexity inter coding scheme for Versatile Video Coding (VVC)

The latest coding standard Versatile Video Coding (VVC) developed by the Joint Video Experts Team (JVET) and Video Coding Experts Group (VCEG) was finalized in 2020. By introducing several new coding techniques, VVC improves the compression efficiency by 50% compared with H.265/HEVC. However, the coding complexity increases dramatically, which obstructs it from real-time application. To tackle this issue, a fast inter coding algorithm utilizing coding information is proposed to speed up the coding process. First, by analyzing the coding areas of the neighboring CUs, we predict the coding area of the current CU to terminate unnecessary splitting modes. Then, the temporally optimal coding mode generated during the prediction process is further utilized to shrink the candidate modes to speed up the coding process. Finally, the distribution of neighboring prediction modes are exploited to measure the motion complexity of the current CU, based on which the unnecessary prediction modes can be skipped earlier. Experimental results demonstrate that the proposed method can reduce the coding complexity by 40.08% on average with 0.07 dB BDPSNR decrease and 1.56% BDBR increase, which outperforms the state-of-the-art approach.     

双向特征融合的快速精确任意形状文本检测

现有的基于分割的场景文本检测方法仍较难区分相邻文本区域,同时网络得到分割图后后处理阶段步骤复杂导致模型检测效率较低.为了解决此问题,该文提出一种新颖的基于全卷积网络的场景文本检测模型.首先,该文构造特征提取器对输入图像提取多尺度特征图.其次,使用双向特征融合模块融合两个平行分支特征的语义信息并促进两个分支共同优化.之后,该文通过并行地预测缩小的文本区域图和完整的文本区域图来有效地区分相邻文本.其中前者可以保证不同的文本实例之间具有区分性,而后者能有效地指导网络优化.最后,为了提升文本检测的速度,该文提出一个快速且有效的后处理算法来生成文本边界框.实验结果表明:在相关数据集上,该文所提出的方法均实现了最好的效果,且比目前最好的方法在F-measure指标上最多提升了1.0％,并且可以实现将近实时的速度,充分证明了该方法的有效性和高效性.     

Research on encoding and decoding of non-binary polar codes over GF(2m)

Binary Polar Codes (BPCs) have advantages of high-efficiency and capacity-achieving but suffer from large latency due to the Successive-Cancellation List (SCL) decoding. Non-Binary Polar Codes (NBPCs) have been investigated to obtain the performance gains and reduce latency under the implementation of parallel architectures for multi-bit decoding. However, most of the existing works only focus on the Reed-Solomon matrix-based NBPCs and the probability domain-based non-binary polar decoding, which lack flexible structure and have a large computation amount in the decoding process, while little attention has been paid to general non-binary kernel-based NBPCs and Log-Likelihood Ratio (LLR) based decoding methods. In this paper, we consider a scheme of NBPCs with a general structure over GF(2^m). Specifically, we pursue a detailed Monte-Carlo simulation implementation to determine the construction for proposed NBPCs. For non-binary polar decoding, an SCL decoding based on LLRs is proposed for NBPCs, which can be implemented with non-binary kernels of arbitrary size. Moreover, we propose a Perfect Polarization-Based SCL (PPB-SCL) algorithm based on LLRs to reduce decoding complexity by deriving a new update function of path metric for NBPCs and eliminating the path splitting process at perfect polarized (i.e., highly reliable) positions. Simulation results show that the bit error rate of the proposed NBPCs significantly outperforms that of BPCs. In addition, the proposed PPB-SCL decoding obtains about a 40% complexity reduction of SCL decoding for NBPCs.     

基于像素值排序与块再分的可逆数据隐藏算法

基于像素值排序的可逆数据隐藏算法通过修改图像块中的最大像素和最小像素嵌入数据,但并未充分利用图像块内的每一个像素,从而影响嵌入性能。结合块再分原理,提出基于像素值排序的可逆数据隐藏算法。将原始图像划分为3×3的图像块,计算每一个图像块的局部复杂度。设计12种分块模式将局部复杂度小于阈值的图像块细分为子块A和B。根据子块A和B的不同局部特征分别采用2种不同的扫描顺序读取像素。子块A的像素序列使用次小值预测最小值和次大值预测最大值的方法,获得2个预测误差值,子块B的像素序列利用中值像素连续预测其余4个像素的方法,得到4个预测误差值。在此基础上,利用图像块中预测误差值为0和1的像素嵌入隐藏数据。实验结果表明,该算法在一个图像块中最高可嵌入6 bit的数据,在较低计算复杂度的情况下能够有效提高像素的嵌入性能。     

车联网信息对驾驶员视觉注意与行为的影响

目的探讨不同驾驶情景下车联网信息呈现形式及复杂度对驾驶过程和绩效的影响。方法采用3(信息复杂度:无、简单、复杂)*2(信息通道:视、听)*3(驾驶场景:纵向、横向、转角)多因素混合设计,以驾驶员视觉注意指标、驾驶行为指标为因变量,共招募60名驾驶员,分两组。结果 (1)车联网信息以听觉通道呈现会增加行车稳定性及方向盘控制稳定性,且不会损害驾驶员的视觉注意行为,视觉则相反;(2)信息简单也会增加行车稳定性及方向盘控制稳定性。结论横向与纵向路径以听觉呈现简单信息有利于促进安全驾驶行为,转角路径中应避免车联网信息。     

Perceived production complexity – understanding more than parts of a system

To successfully manage today’s complex production systems it is essential to study operators’ perception of the system. The paper presents perceived production complexity assessed at seven manufacturing companies with the CompleXity Index (CXI) method. While other methods have measured product variants, layout, work content, tools and information items, CXI combines them into three areas. These three complexity areas (Station design, Work variance and Disturbance handling) help to create an understanding of the complex system by visualising how they contribute to complexity, and show the need to support the operators’ ability to handle the varying work.     

Scheduling with agreements: new results

In this paper, the problem of scheduling with agreements (SWA) is considered. In scheduling, this consists of a set of jobs non-preemptively on identical machines subject to constraints that only some specific jobs can be scheduled concurrently on different machines. These constraints are given by an agreement graph and the aim is to minimise the makespan. In the case of two machines we extend two NP-hardness results of SWA with processing times at most three that hold for bipartite agreement graphs to more general agreement graphs. Complexity results of SWA are established in the case of split and complement of bipartite graphs. We also present some approximation results for SWA.     

Common Knowledge and Update in Finite Environments

Logics of knowledge have been shown to provide a useful approach to the high level specification and analysis of distributed systems. It has been proposed that such systems can be developed using knowledge- based protocols, in which agents' actions have preconditions that test their state of knowledge. Both computer-assisted analysis of the knowledge properties of systems and automated compilation of knowledge-based protocols require the development of algorithms for the computation of states of knowledge. This paper studies one of the computational problems of interest, the model checking problem for knowledge formulae in the S5_nKripke structures generated by finite state environments in which states determine an observation for each agent. Agents are assumed to have perfect recall and may operate synchronously or asynchronously. It is shown that, in this setting, model checking of common knowledge formulae is intractable, but efficient incremental algorithms are developed for formulae containing only knowledge operators. Connections to knowledge updates and compilation of knowledge-based protocols are discussed.