Useless Med School Notes; Medical Education Through Mnemonics

BACKGROUND: The volume of content required for synthesis by medical students is immense and continues to grow as more insight and information is added to the existing compendium of medical knowledge. Mnemonics, memory palaces, and other visual memory aids have been used throughout history for assisting students and scholars in recalling information; offering an alternative to the practice of rote memorization. While technology has advanced and a shift towards paid-subscription services that offer pre-made mnemonics has gained great popularity among medical students, studies have shown that the act of creating the mnemonic in of itself serves as a powerful memory formation tool. OBJECTIVE: Through engaging students in social media platforms, this project aims to build a bank of mnemonics as well as engage users in the creation of their own mnemonics to facilitate richer and more interactive educational experiences. METHODS: Since its inception, this project has utilized instagram ® as a platform for social communication. Using the app GoodNotes ® as a drawing platform, images are created and then uploaded to instagram ® , where they are shared with the followers of the content. RESULTS: 250+ mnemonics have been created and posted to the platform, amassing over 1,100 followers. Each post averages 800+ views and 40-70 “likes” from followers. CONCLUSION: By increasing the reach of this social mnemonic service, this project intends to become a staple in assisting long-term memory formation for medical students. As the reach of this project continues to grow, it will provide opportunities to assess the impact and effectiveness of the various memory devices, as well as the power of influence that the project has on encouraging students to engage in the creation of their own visual means of learning

A New Stable Peer-to-Peer Protocol with Non-persistent Peers

Recent studies have suggested that the stability of peer-to-peer networks may rely on persistent peers, who dwell on the network after they obtain the entire file. In the absence of such peers, one piece becomes extremely rare in the network, which leads to instability. Technological developments, however, are poised to reduce the incidence of persistent peers, giving rise to a need for a protocol that guarantees stability with non-persistent peers. We propose a novel peer-to-peer protocol, the group suppression protocol, to ensure the stability of peer-to-peer networks under the scenario that all the peers adopt non-persistent behavior. Using a suitable Lyapunov potential function, the group suppression protocol is proven to be stable when the file is broken into two pieces, and detailed experiments demonstrate the stability of the protocol for arbitrary number of pieces. We define and simulate a decentralized version of this protocol for practical applications. Straightforward incorporation of the group suppression protocol into BitTorrent while retaining most of BitTorrent's core mechanisms is also presented. Subsequent simulations show that under certain assumptions, BitTorrent with the official protocol cannot escape from the missing piece syndrome, but BitTorrent with group suppression does.Comment: There are only a couple of minor changes in this version. Simulation tool is specified this time. Some repetitive figures are remove

Refinement of the random coding bound

An improved pre-factor for the random coding bound is proved. Specifically, for channels with critical rate not equal to capacity, if a regularity condition is satisfied (resp. not satisfied), then for any $\epsilon >0$ a pre-factor of $O(N^{-\frac{1}{2}\left( 1 - \epsilon + \bar{\rho}^\ast_R \right)})$ (resp. $O(N^{-\frac{1}{2}})$) is achievable for rates above the critical rate, where $N$ and $R$ is the blocklength and rate, respectively. The extra term $\bar{\rho}^\ast_R$ is related to the slope of the random coding exponent. Further, the relation of these bounds with the authors' recent refinement of the sphere-packing bound, as well as the pre-factor for the random coding bound below the critical rate, is discussed.Comment: Submitted to IEEE Trans. Inform. Theor

A Rate-Distortion Approach to Index Coding

We approach index coding as a special case of rate-distortion with multiple receivers, each with some side information about the source. Specifically, using techniques developed for the rate-distortion problem, we provide two upper bounds and one lower bound on the optimal index coding rate. The upper bounds involve specific choices of the auxiliary random variables in the best existing scheme for the rate-distortion problem. The lower bound is based on a new lower bound for the general rate-distortion problem. The bounds are shown to coincide for a number of (groupcast) index coding instances, including all instances for which the number of decoders does not exceed three.Comment: Substantially extended version. Submitted to IEEE Transactions on Information Theor

The third-order term in the normal approximation for singular channels

For a singular and symmetric discrete memoryless channel with positive dispersion, the third-order term in the normal approximation is shown to be upper bounded by a constant. This finding completes the characterization of the third-order term for symmetric discrete memoryless channels. The proof method is extended to asymmetric and singular channels with constant composition codes, and its connection to existing results, as well as its limitation in the error exponents regime, are discussed.Comment: Submitted to IEEE Trans. Inform. Theor