KWTA networks and their applications

Winner-Take-All (WTA) or K-Winner-Take-All (KWTA) networks have been frequently used as the basic building blocks of complex neural networks. This paper introduces a new selection rule for network connections that implements stable KWTA networks. To widen the applications of WTA networks, a new class of WTA networks is proposed, and their efficient design methods are presented. We demonstrate the properties of the generalized class of WTA networks, through three application examples.     

Screening for diabetic retinopathy: the utility of nonmydriatic retinal photography in Egyptian adults

BACKGROUND AND OBJECTIVE: Drug resistance has become a major cause of treatment failure in patients with acute leukemia. P-glycoprotein (Pgp), which is associated with the multidrug resistance (MDR) phenotype, has been reported to be an important predictor of treatment outcome. The aim of this study was to analyze the value of Pgp expression in bone marrow or peripheral blood as a predictor of the response to remission induction chemotherapy as well as the duration of remission in patients with de novo acute myeloid leukemia (AML). DESIGN AND METHODS: We examined the expression of Pgp in 82 patients with de novo AML using an immunocytochemical assay with the C219 monoclonal antibody. RESULTS: Twenty-seven of the 82 patients (33%) were C219-positive in from 1% to 100% of their cells. Thirteen cases (16%) showed a positive reaction in more than 50% of the leukemic cells. Only hyperleukocytosis was significantly associated with higher expression of Pgp. Although 8 of the 13 cases (62%) with more than 50% of cells having Pgp expression were CD34-positive, this association was not statistically significant. A univariate analysis of resistance to induction therapy showed a significantly higher resistance rate in patients with increased Pgp expression (P = 0.01) as well as in those patients with decreased reactivity to myeloperoxidase. The multivariate analysis revealed the independent prognostic value of Pgp expression. C219 reactivity did not have an influence on remission duration. INTERPRETATION AND CONCLUSIONS: Our data indicate that P-glycoprotein expression is a reliable marker of resistance to induction treatment in patients with de novo AML.     

Visual tracking using convolutional features with sparse coding

Artificial Intelligence Review - Visual object tracking has become one of the most active research topics in computer vision, and it has been applied in several commercial...     

Blind estimation of the PN sequence in lower SNR DS-SS signals with residual carrier

This paper presents a method of singular value decomposition (SVD) plus digital phase lock loop (DPLL) to solve the difficult problem of blind pseudo-noise (PN) sequence estimation in low signal to noise ratios (SNR) direct sequence spread spectrum (DS-SS, DS) signals with residual carrier. Of course, the method needs to know the parameters of DS signal, such as the period and code rate of PN sequence. Firstly, the received signal is sampled and divided into non-overlapping signal vectors according to a temporal window, whose duration is two periods of PN sequence. Then, an autocorrelation matrix is computed and accumulated by the signal vectors one by one. The PN sequence with residual carrier can be estimated by the principal eigenvector of this autocorrelation matrix. Furthermore, a DPLL is used to deal with the estimated PN sequence with residual carrier, it estimates and tracks the residual carrier, removes the residual carrier in the end. Theory analysis and computer simulation results show that this method can effectively realize the PN sequence estimation from the input DS signals with residual carrier in lower SNR.     

The squash-and-stretch stylization for character motions

The squash-and-stretch describes the rigidity of the character. This effect is the most important technique in traditional cartoon animation. In this paper, we introduce a method that applies the squash-and-stretch effect to character motion. Our method exaggerates the motion by sequentially applying the spatial exaggeration technique and the temporal exaggeration technique. The spatial exaggeration technique globally deforms the pose in order to make the squashed or stretched pose by modeling it as a covariance matrix of joint positions. Then, the temporal exaggeration technique computes a time-warping function for each joint, and applies it to the position of the joint allowing the character to stretch its links appropriately. The motion stylized by our method is a sequence of squashed and stretched poses with stretching limbs. By performing a user survey, we prove that the motion created using our method is similar to that used in 2D cartoon animation and is funnier than the original motion for human observers who are familiar with 2D cartoon animation.     

Register allocation for write activity minimization on non-volatile main memory for embedded systems

Non-volatile memories are good candidates for DRAM replacement as main memory in embedded systems and they have many desirable characteristics. Nevertheless, the disadvantages of non-volatile memory co-exist with its advantages. First, the lifetime of some of the non-volatile memories is limited by the number of erase operations. Second, read and write operations have asymmetric speed or power consumption in non-volatile memory. This paper focuses on the embedded systems using non-volatile memory as main memory. We propose register allocation technique with re-computation to reduce the number of store instructions. When non-volatile memory is applied as the main memory, reducing store instructions will reduce write activities on non-volatile memory. To re-compute the spills effectively during register allocation, a novel potential spill selection strategy is proposed. During this process, live range splitting is utilized to split certain long live ranges such that they are more likely to be assigned into registers. In addition, techniques for re-computation overhead reduction is proposed on systems with multiple functional units. With the proposed approach, the lifetime of non-volatile memory is extended accordingly. The experimental results demonstrate that the proposed technique can efficiently reduce the number of store instructions on systems with non-volatile memory by 33% on average.     

Advanced partial encryption using watermarking and scrambling in MP3

In this paper, we propose an advanced partial encryption of watermarking and scrambling using the magnitude information of Modifed Discrete Cosine Transform (MDCT). In MPEG-1/Audio Layer III (MP3), the magnitude and phase information of modified discrete cosine transform (MDCT) coefficients is encrypted. The proposed method uses both watermarking and scrambling, and aims at protecting the contents against eavesdropping and moreover against illegal mass distribution after descrambled. Experimental results show that the proposed method can achieve higher security and less computational complexity by reusing the MDCT coefficients obtained in MP3.     

Integer linear programming optimization of joint RRM policies for heterogeneous wireless systems

Wireless systems will be characterized by the coexistence of heterogeneous Radio Access Technologies (RATs) with different, but also complementary, performance and technical characteristics. These heterogeneous wireless networks will provide network operators the possibility to efficiently and coordinately use the heterogeneous radio resources, for which novel Joint Radio Resource Management (JRRM) policies need to be designed. In this context, this work proposes and evaluates a JRRM policy that simultaneously determines for each user an adequate combination of RAT and number of radio resources within such RAT to guarantee the user/service QoS requirements, and efficiently distribute the radio resources considering a user fairness approach aimed at maximizing the system capacity. To this aim, the JRRM algorithm, which takes into account the discrete nature of radio resources, is based on integer linear programming optimization mechanisms.