Search

The document titled "The Thought Broadcast: How to critique a paper" is a podcast episode from Australasian Psychiatry. In this episode, Dr. Ed Miller, Dr. Andrew Amos, and Dr. Michael Weightman discuss the importance of psychiatric journal clubs and the significance of knowing how to critique scientific papers. They explore the history of journal clubs in medicine and highlight common flaws in academic publishing that can be addressed through effective critique. The episode also provides insights into best practices for running psychiatric journal clubs. [Extracted from the article]

This paper summarizes some hot communication topics from January to February in 2013 by combining academic views of some scholars. These topics include the reasons for the failure of The Daily, big data and data mining, the transformation of newspapers and the two media markets in mainland China. The development of new media and the transformation of traditional media are always the topics that can draw lots of attention. The competition and cooperation between them can not only show the development of new techniques, but also play an important role in charging the habits of audiences, the mode of reporting news and some communication theories. More and more participation of pubic will bring much more challenges for the model of the guidance of public opinion in China. In order to adapt to the new broadcasting environment, the media needs more attempt and innovation. [ABSTRACT FROM AUTHOR]

Copyright of Historia y Comunicación Social is the property of Universidad Complutense de Madrid and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Revista Electrónica de LEEME is the property of Institut de Creativitat i Innovacions Educatives and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The Last decade saw significant growth in the digital terrestrial television (DTT) subscribers. The High peak-to-average power ratio (PAPR) of the transmitted signal is implied by the large fluctuations in its amplitude, which is a serious issue in the contemporary and next generation DTT broadcasting systems. These large fluctuations prevent feeding the high power amplifier (HPA) at an operating point near its non-linear (NL) saturation region, thereby lowering its power efficiency. For a better future, energy-efficient green communications is the need of hour. This paper focuses on digital predistortion (DPD), which is among the widely used techniques for HPA linearization in order to minimize the NL effects. DPD technique requires a feedback signal. This paper proposes a novel adding signal-based digital predistortion, where the output of the HPA is gradually linearized by adding a signal at the input in an iterative manner. By Taylor series approximation, the DPD problem can be posed as a convex one. We prove that a tighter upper bound exists for the convergence factor and instead of directly solving the convex problem, we pick a convergence factor value within its bounds that offers a good trade-off between convergence speed and residual error value. The simulation results show that the proposed technique can quickly linearize the HPA with good convergence. [ABSTRACT FROM AUTHOR]

We consider transmission over the ergodic fading multiple-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the receiver. Over the equivalent non-fading channel, capacity has recently been shown to be achievable using transmission schemes that were designed for the "dirty paper" channel. We focus on a similar "fading paper" model. The evaluation of the fading paper capacity is difficult to obtain. We confine ourselves to the linear-assignment capacity, which we define, and use convex analysis methods to prove that its maximizing distribution is Gaussian. We compare our fading-paper transmission to an application of dirty paper coding that ignores the partial state information and assumes the channel is fixed at the average fade. We show that a gain is easily achieved by appropriately exploiting the information. We also consider a cooperative upper bound on the sum-rate capacity as suggested by Sato. We present a numeric example that indicates that our scheme is capable of realizing much of this upper bound. [ABSTRACT FROM AUTHOR]

Dirty paper coding (DPC) scheme is the capacity achieving transmission technique in multiuser MIMO downlink channels. As a suboptimal solution to DPC, successive zero-forcing DPC (SZF-DPC) has been proposed recently. The zero-interference constraint in designing the precoding matrices limits the number of supportable users. In this correspondence, we propose three low-complexity suboptimal user scheduling algorithms to exploit the multiuser diversity gain in SZF-DPC as the number of users grows. The first algorithm greedily maximizes the true sum rate. The second algorithm is based on eigenvalues. The third algorithm relies on the diagonal elements of the effective channel matrix since eigenvalues and diagonal entries of a Hermitian matrix have a strong relationship. Simulation results show that the proposed scheduling algorithms can obtain a significant fraction of sum rate of the optimal solution. Furthermore, the performance analysis is provided to prove that the proposed user selection algorithms can achieve the same asymptotic sum rate as that of DPC. [ABSTRACT FROM AUTHOR]

Those of us whose lives have been deeply touched by the technology of papermaking -- and many others besides -- are in for a real treat this coming fall when the book On Paper is scheduled to be published. The author, Nicholas Basbanes, employs an engaging, personalized approach as he brings to life the story of how paper has enabled the progress of civilization throughout two millennia. I first learned about Nick's grand project, to capture the most intriguing aspects of paper's story, during a re-broadcast of his hour-long interview that was presented on the CSPAN TV network. His enthusiasm is infectious, and it can be an uplifting experience to have him as a tour-guide to "all things paper". [ABSTRACT FROM AUTHOR]

This letter presents two results for multiuser wireless systems employing dirty-paper coding strategies along with greedy scheduling over the broadcast multiple-input multiple-output channel. Specifically, an efficient and suboptimal downlink scheduler is proposed to approximate the maximum sum rate using equal power allocation, and it is shown to approach the maximum sum rate of optimal power allocation for a large number of users under optimal scheduling. The second result demonstrates that the average maximum sum rate can be tightly upper bounded when spatial multiplexing is maximized. [ABSTRACT FROM AUTHOR]