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.     

Mechanical properties,corrosion resistance,and rubber pad forming of cold differential speed-rolled pure titanium for bipolar plates of proton-exchange membrane fuel cells

Due to problems such as pores on surface-treated coatings, the corrosion resistance of pure titanium bipolar plates for proton-exchange membrane fuel cells can be further improved by increasing the corrosion resistance of pure titanium by using differential speed-rolling (DSR); however, these materials have not yet reached the standard requirements of bipolar plates (corrosion current density i_corr＜10³ nA·cm^?2). In this work, the corrosion resistance of pure titanium was improved by optimizing the DSR process while the strength was maintained. The best corrosion resistance of the DSR pure titanium was achieved when the roller speed ratio was 2, while i_corr was 429 nA·cm^?2 in a solution of 0.5 M H₂SO₄ and 2 mg/L HF at room temperature. The formability of the DSR pure titanium for bipolar plates was verified. The optimal holding pressure range was 6.8–7.0 kN.     

Decreased CD10-positive granulocytes for the differential diagnosis of myelodysplastic syndrome

Myelodysplastic syndromes (MDS) are highly heterogeneous myeloid neoplasms, and a large number of patients are difficult to diagnose and classify by blood and bone marrow examination. As a surface marker of granulocyte, studies have shown CD10 can be used to define the degree of granulocyte maturation in MDS patients. However, whether it can be used for differential diagnosis of MDS and other hematological diseases remains inconclusive. To explore the value of CD10 for differential diagnosis of MDS, 60 newly diagnosed MDS, 20 aplastic anemia (AA) patients, and 35 iron-deficient anemia (IDA) patients were selected for this study. Bone marrow (BM) specimens were processed for surface marker analysis and labeled with pre-conjugated monoclonal antibodies. Stained cells were detected by flow cytometry. Our results indicated that CD10-positive granulocytes were significantly decreased in BM of MDS patients than AA and IDA patients, and the level of CD10-positive mature granulocytes was not associated with the clinical stages of malignancy. Receiver operating characteristic (ROC) areas under the curve (AUC) of CD10-positive granulocytes was 0.86 and 0.85, respectively, in MDS patients than the IDA group and AA group with good specificity and sensitivity. Further, CD10-positive granulocytes were increased after effective treatment. In conclusion, we found the decrease in CD10-positive granulocytes has a differential diagnostic value of MDS.     

A novel fast distance relay for series compensated transmission lines

This paper presents a fast distance relay for series compensated transmission lines based on the R–L differential-equation algorithm using the theory of equal transfer process of transmission lines. The measuring distances based on the proposed algorithm can fast approach the actual value of fault distance when a fault occurs in front of the series capacitor. When a fault occurs behind of the series capacitor, the fault loop, including the series capacitor, does not match the R–L transmission line model, so the measuring distances fluctuate severely. Based on this, the relative position of the fault with respect to the series capacitor can be judged effectively according to the fluctuation range of the measuring distances, and the accurate fault location can be obtained fast. A variety of PSCAD/EMTDC simulation tests show that the new relay has fast operating speed and high accuracy when applied to the long series compensated transmission lines.     

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.     

An unsupervised approach to generating generic summaries of documents

We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately.     

A gradient boosting decision tree approach for insider trading identification: An empirical model evaluation of China stock market

Insider trading is a kind of criminal behavior in stock market by using nonpublic information. In recent years, it has become the major illegal activity in China’s stock market. In this study, a combination approach of GBDT (Gradient Boosting Decision Tree) and DE (Differential Evolution) is proposed to identify insider trading activities by using data of relevant indicators. First, insider trading samples occurred from year 2007 to 2017 and corresponding non-insider trading samples are collected. Next, the proposed method is trained by the GBDT, and initial parameters of the GBDT are optimized by the DE. Finally, out-of-samples are classified by the trained GBDT–DE model and its performances are evaluated. The experiment results show that our proposed method performed the best for insider trading identification under time window length of ninety days, indicating the relevant indicators under 90-days time window length are relatively more useful. Additionally, under all three time window lengths, relative importance result shows that several indicators are consistently crucial for insider trading identification. Furthermore, the proposed approach significantly outperforms other benchmark methods, demonstrating that it could be applied as an intelligent system to improve identification accuracy and efficiency for insider trading regulation in China stock market.     

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.     

Protection of power transformer using multi criteria decision-making

Power transformers are protected by different relays that operate independently. Malfunction of each relay has a major role in reducing the reliability of the protection system. In order to mitigate the main drawbacks of the power transformer relays, an overall protection scheme is presented in this paper. This scheme proposes a novel multi criterion algorithm using decision-making based on fuzzy logic. In this paper the outputs of restricted earth fault relay and a directional check unit, are combined with the output of the differential protection relay. Therefore, problems that are pertaining to independent operation of each relay have been mitigated and the relays cover protection blind spots of each other. The improved power transformer protection (IPTP) scheme enhances the sensitivity and reliability of the power transformer protection. Extensive simulations are used to measure the effectiveness and merit of the proposed IPTP relay. The above efforts result in a multi criteria approach for protection of power transformers.