526 research outputs found

    Source Broadcasting to the Masses: Separation has a Bounded Loss

    Full text link
    This work discusses the source broadcasting problem, i.e. transmitting a source to many receivers via a broadcast channel. The optimal rate-distortion region for this problem is unknown. The separation approach divides the problem into two complementary problems: source successive refinement and broadcast channel transmission. We provide bounds on the loss incorporated by applying time-sharing and separation in source broadcasting. If the broadcast channel is degraded, it turns out that separation-based time-sharing achieves at least a factor of the joint source-channel optimal rate, and this factor has a positive limit even if the number of receivers increases to infinity. For the AWGN broadcast channel a better bound is introduced, implying that all achievable joint source-channel schemes have a rate within one bit of the separation-based achievable rate region for two receivers, or within log2T\log_2 T bits for TT receivers

    Multistage optical interconnection architecture with the least possible growth of system size

    Get PDF
    Cataloged from PDF version of article.Multistage interconnection architectures can provide an arbitrary pattern of one-to-one connections between N input and N output channels. We show that bitonic multistage architectures, such as the Banyan architecture, result in the fundamentally least possible growth of system size with increasing N

    Dendritic Cells in the Gut: Interaction with Intestinal Helminths

    Get PDF
    The mucosal environment in mammals is highly tolerogenic; however, after exposure to pathogens or danger signals, it is able to shift towards an inflammatory response. Dendritic cells (DCs) orchestrate immune responses and are highly responsible, through the secretion of cytokines and expression of surface markers, for the outcome of such immune response. In particular, the DC subsets found in the intestine have specialized functions and interact with different immune as well as nonimmune cells. Intestinal helminths primarily induce Th2 responses where DCs have an important yet not completely understood role. In addition, this cross-talk results in the induction of regulatory T cells (T regs) as a result of the homeostatic mucosal environment. This review highlights the importance of studying the particular relation “helminth-DC-milieu” in view of the significance that each of these factors plays. Elucidating the mechanisms that trigger Th2 responses may provide the understanding of how we might modulate inflammatory processes

    Optical-coordinate transformation methods and optical-interconnection architectures

    Get PDF
    Cataloged from PDF version of article.The analogy between optical one-to-one point transformations and optical one-to-one interconnections is discussed. Methods for performing both operations are reviewed and compared. The multifacet and multistage architectures have the flexibility to implement any arbitrary one-to-one transformation or interconnection pattern. The former would be preferred for low-cost and low-resolution applications, whereas the latter would be preferred for high-cost and high-performance applications

    Fractional Fourier transforms and their optical implementation: I

    Get PDF
    Cataloged from PDF version of article.Fourier transforms of fractional order a are defined in a manner such that the common Fourier transform is a special case with order a = 1. An optical interpretation is provided in terms of quadratic graded index media and discussed from both wave and ray viewpoints. Several mathematical properties are derived

    Fractional Fourier Transforms and their optical implementation II

    Get PDF
    Cataloged from PDF version of article.The linear transform kernel for fractional Fourier transforms is derived. The spatial resolution and the space-bandwidth product for propagation in graded-index media are discussed in direct relation to fractional Fourier transforms, and numerical examples are presented. It is shown how fractional Fourier transforms can be made the basis of generalized spatial filtering systems: Several filters are interleaved between several fractional transform stages, thereby increasing the number of degrees of freedom available in filter synthesis

    Every Fourier optical system is equivalent to consecutive fractional-Fourier-domain filtering

    Get PDF
    Cataloged from PDF version of article.We consider optical systems composed of an arbitrary number of lenses and filters, separated by arbitrary distances, under the standard approximations of Fourier optics. We show that every such system is equivalent to 1i2 consecutive filtering operations in several fractional Fourier domains and 1ii2 consecutive filtering operations alternately in the space and the frequency domains

    Optical implementations of two-dimensional fractional Fourier transforms and linear canonical transforms with arbitrary parameters

    Get PDF
    Cataloged from PDF version of article.We provide a general treatment of optical two-dimensional fractional Fourier transforming systems. We not only allow the fractional Fourier transform orders to be specified independently for the two dimensions but also allow the input and output scale parameters and the residual spherical phase factors to be controlled. We further discuss systems that do not allow all these parameters to be controlled at the same time but are simpler and employ a fewer number of lenses. The variety of systems discussed and the design equations provided should be useful in practical applications for which an optical fractional Fourier transforming stage is to be employed. © 1998 Optical Society of Americ

    Computing π(N)\pi(N): An elementary approach in O~(N)\tilde{O}(\sqrt{N}) time

    Full text link
    We present an efficient and elementary algorithm for computing the number of primes up to NN in O~(N)\tilde{O}(\sqrt N) time, improving upon the existing combinatorial methods that require O~(N2/3)\tilde{O}(N ^ {2/3}) time. Our method has a similar time complexity to the analytical approach to prime counting, while avoiding complex analysis and the use of arbitrary precision complex numbers. While the most time-efficient version of our algorithm requires O~(N)\tilde{O}(\sqrt N) space, we present a continuous space-time trade-off, showing, e.g., how to reduce the space complexity to O~(N3)\tilde{O}(\sqrt[3]{N}) while slightly increasing the time complexity to O~(N8/15)\tilde{O}(N^{8/15}). We apply our techniques to improve the state-of-the-art complexity of elementary algorithms for computing other number-theoretic functions, such as the the Mertens function (in O~(N)\tilde{O}(\sqrt N) time compared to the known O~(N0.6)\tilde{O}(N^{0.6})), summing Euler's totient function, counting square-free numbers and summing primes. Implementation code is provided
    corecore