Problem statement: Memoryless QN methods have been regarded effective techniques for solving large-scale problems that can be considered as one step limited memory QN methods. In this study, we present a scaled memoryless modified Symmetric Rank-One (SR1) algorithm and investigate the numerical performance of the proposed algorithm for solving large-scale unconstrained optimization problems. Ap...

This paper gives a lower bound for rate-reliability function of the discrete memoryless channel(DMC) with stochastic encoding. The result shows that, the stochastic encoding gets bigger random coding bound rather than that of the discrete memoryless channel where deterministic encoding is applied. Mathematics Subject Classification: 68P30, 94A24

A computationally efficient, high quality, vector quantization scheme based on a parametric probability density function (PDF) is proposed. In this scheme, speech line spectral frequencies (LSF) are modeled as i.i.d realizations of a multivariate Gaussian mixture density. The mixture model parameters are efficiently estimated using the Expectation Maximization (EM) algorithm. An efficient quant...

Memoryless computation is a novel means of computing any function of a set of registers by updating one register at a time while using no memory. We aim to emulate how computations are performed on modern cores, since they typically involve updates of single registers. The computation model of memoryless computation can be fully expressed in terms of transformation semigroups, or in the case of...

In a memoryless vector quantization system, each image block is independently encoded as a corresponding index and then an index table will be generated. In this paper, we propose two novel schemes to compress the index table without introducing extra encoding distortion. Both our schemes exploit the characteristic that the blocks of images are highly correlated to find the same or similar inde...

In this talk we will give a simple proof of the remarkable result by Alex Wang [6] which states that if n < m * p , then generically the controlled eigenvalues can be assigned arbitrarily by real memoryless output feedback in a linear system with n states, m inputs, and p outputs.

In this paper, we propose two novel memoryless reverse converters for the moduli set {2 − 1, 2, 2 − 1}. The first proposed converter does not entirely cover the dynamic range while the second proposed converter covers the entire dynamic range. First, we simplify the Chinese Remainder Theorem in order to obtain a reverse converter that utilizes mod-(2 − 1) operation. Second, we further reduce th...

We consider the two-user “Z” channel (ZC), where there are two senders and two receivers. One of the senders transmits information to its intended receiver (without interfering with the unintended receiver), while the other sender transmits information to both receivers. The complete characterization of the discrete memoryless ZC remains unknown to date. For the Gaussian ZC, the capacity has on...

We are considering the problem of identifying Wiener systems that includes memoryless nonlinearities. The focus is made on the determination of the system nonlinearity which is not necessarily invertible, smooth or parametric. To this end, a frequency approach is developed, that investigates the system output extrema. In the case where the nonlinearity is strictly monotonic, a simple experiment...

We establish two complementarity relations for the relative entropy of coherence in quantum information processing, i.e., quantum dense coding and teleportation. We first give an uncertainty-like expression relating local quantum coherence to the capacity of optimal dense coding for bipartite system. The relation can also be applied to the case of dense coding by using unital memoryless noisy q...