Blind Speech Watermarking Method with Frame Self-Synchronization Based on Spread-Spectrum Using Linear Prediction Residue

State-of-the-art speech watermarking techniques enable speech signals to be authenticated and protected against any malicious attack to ensure secure speech communication. In general, reliable speech watermarking methods must satisfy four requirements: inaudibility, robustness, blind-detectability, and confidentiality. We previously proposed a method of non-blind speech watermarking based on direct spread spectrum (DSS) using a linear prediction (LP) scheme to solve the first two issues (inaudibility and robustness) due to distortion by spread spectrum. This method not only effectively embeds watermarks with small distortion but also has the same robustness as the DSS method. There are, however, two remaining issues with blind-detectability and confidentiality. In this work, we attempt to resolve these issues by developing an approach called the LP-DSS scheme, which takes two forms of data embedding for blind detection and frame synchronization. We incorporate blind detection with frame synchronization into the scheme to satisfy blind-detectability and incorporate two forms of data embedding process, front-side and back-side embedding for blind detection and frame synchronization, to satisfy confidentiality. We evaluated these improved processes by carrying out four objective tests (PESQ, LSD, Bit-error-rate, and accuracy of frame synchronization) to determine whether inaudibility and blind-detectability could be satisfied. We also evaluated all combinations with the two forms of data embedding for blind detection with frame synchronization by carrying out BER tests to determine whether confidentiality could be satisfied. Finally, we comparatively evaluated the proposed method by carrying out ten robustness tests against various processing and attacks. Our findings showed that an inaudible, robust, blindly detectable, and confidential speech watermarking method based on the proposed LP-DSS scheme could be achieved.     

Low-Complexity Alternatives to the Optimal Linear Coding Scheme for Transmitting ARMA Sources

In the era of the Internet of Things, there are many applications where numerous devices are deployed to acquire information and send it to analyse the data and make informed decisions. In these applications, the power consumption and price of the devices are often an issue. In this work, analog coding schemes are considered, so that an ADC is not needed, allowing the size and power consumption of the devices to be reduced. In addition, linear and DFT-based transmission schemes are proposed, so that the complexity of the operations involved is lowered, thus reducing the requirements in terms of processing capacity and the price of the hardware. The proposed schemes are proved to be asymptotically optimal among the linear ones for WSS, MA, AR and ARMA sources.     

Exact solution of plane isolated crack normal to a bimaterial interface of infinite extent

This paper presents an exact solution for the transverse interface crack in the plane strain case. The crack is perpendicular to the interface and in one material. The exact complex stress functions are first obtained with some unknown constants. The satisfactions of all boundary conditions are then checked, the condition at infinity is considered and the unknown constants are determined. Further study may focus on the case with different shear moduli and the influence of the large deformation.The English text was polished by Keren Wang.     

Chemometric Analysis of Urinary Volatile Organic Compounds to Monitor the Efficacy of Pitavastatin Treatments on Mammary Tumor Progression over Time

Volatile organic compounds (VOCs) in urine are potential biomarkers of breast cancer. Previously, our group has investigated breast cancer through analysis of VOCs in mouse urine and identified a panel of VOCs with the ability to monitor tumor progression. However, an unanswered question is whether VOCs can be exploited similarly to monitor the efficacy of antitumor treatments over time. Herein, subsets of tumor-bearing mice were treated with pitavastatin at high (8 mg/kg) and low (4 mg/kg) concentrations, and urine was analyzed through solid-phase microextraction (SPME) coupled with gas chromatography-mass spectrometry (GC-MS). Previous investigations using X-ray and micro-CT analysis indicated pitavastatin administered at 8 mg/kg had a protective effect against mammary tumors, whereas 4 mg/kg treatments did not inhibit tumor-induced damage. VOCs from mice treated with pitavastatin were compared to the previously analyzed healthy controls and tumor-bearing mice using chemometric analyses, which revealed that mice treated with pitavastatin at high concentrations were significantly different than tumor-bearing untreated mice in the direction of healthy controls. Mice treated with low concentrations demonstrated significant differences relative to healthy controls and were reflective of tumor-bearing untreated mice. These results show that urinary VOCs can accurately and noninvasively predict the efficacy of pitavastatin treatments over time.     

Multiple Jacobi Elliptic Function Solutions to Integrable Higher Order Broer-Kaup Equation in (2+1)-Dimensional Spaces

In this paper, we improve the method for deriving Jacobi elliptic function solutions of nonlinear evolution equations given in Ref. [12] and apply it to the integrable higher-order Broer-Kaup system in (2 1)-dimensional spaces.Some new elliptic function solutions are obtained.     

Quantum Circuit Optimization for Solving Discrete Logarithm of Binary Elliptic Curves Obeying the Nearest-Neighbor Constrained

In this paper, we consider the optimization of the quantum circuit for discrete logarithm of binary elliptic curves under a constrained connectivity, focusing on the resource expenditure and the optimal design for quantum operations such as the addition, binary shift, multiplication, squaring, inversion, and division included in the point addition on binary elliptic curves. Based on the space-efficient quantum Karatsuba multiplication, the number of CNOTs in the circuits of inversion and division has been reduced with the help of the Steiner tree problem reduction. The optimized size of the CNOTs is related to the minimum degree of the connected graph.     

电阻抗图像重建中Jacobi矩阵的快速算法

Jacobi矩阵是电阻抗图像重建中计算量最大的部份。利用摄动法导出该矩阵的快速算法,可以大幅度地减少计算量。算例表明,这种方法是有效的。     

线性二次型最优控制的并行算法和软件

构造了线性二次型最优控制的并行算法，介绍了这个并行算法在武汉大学“ＷＵＤＰ９１”并行分布式处理系统上试算的数值应用软件的框图．本软件适用于既定动态系统的平衡问题．对于经济系统，可通过政策控制变量来调节和改善其状态和响应．对于自治系统可找出最优控制使得消耗函数达到最小值．通过对一系列例子进行试算，结果证实，所构造的并行算法和相应的数值软件是有效的，其加速比约为７．     

系数密集间断边值问题并行计算分析

研究系数密集间断的边值问题，采用降维方法，使得在数值计算上可实现并行计算，并且收敛性的证明变得很简洁．     

答YapH.P.和TeoS.K.问题

本文证得：如果Ｆ是Ｃｎ中的一条种路，则Ｇ中同时通过ｋ余弦ｅ１，ｅ２，．．．，ｅｋ而不通过Ｆ中的任一条边的圈最多只有一个且Ｇ中同时通过ｋ条弦ｅ１，ｅ２，．．．，ｅｋ的圈最多只有２个，进而由之给出了Ｍ（ｋ）的上界和ｍ（ｋ）的下界及ｍ（ｋ）＝（ｋ＋１）（ｋ＋２）／２成立的一个条件，否定地回答了ＹａｐＨ．Ｐ．和ＴｅｏＳ．Ｋ．１９８４年提出的一个问题。