한동수 교수

MOTIVATION: The growing use of next-generation sequencing and enlarged sequencing throughput require efficient short-read alignment, where seeding is one of the major performance bottlenecks. The key challenge in the seeding phase is searching for exact matches of substrings of short reads in the reference DNA sequence. Existing algorithms, however, present limitations in performance due to their frequent memory accesses. RESULTS: This article presents BWA-MEME, the first full-fledged short read

We found by micromagnetic simulations that the motion of a transverse wall (TW)–type domain wall in magnetic thin-film nanostripes can be manipulated via interaction with spin waves (SWs) propagating through the TW. The velocity of the TW motion can be controlled by changes of the frequency and amplitude of the propagating SWs. Moreover, the TW motion is efficiently driven by specific SW frequencies that coincide with the resonant frequencies of the local modes existing inside the TW structure.

Motivated by limitations in today’s host-centric IP network, recent studies have proposed clean-slate network architectures centered around alternate first-class principals, such as content, services, or users. However, much like the host-centric IP design, elevating one principal type above others hinders communication between other principals and inhibits the network’s capability to evolve. This paper presents the eXpressive Internet Architecture (XIA), an architecture with native support for

The interfacial Dzyaloshinskii-Moriya interaction (DMI) is intimately related to the prospect of superior domain-wall dynamics and the formation of magnetic skyrmions. Although some experimental efforts have been recently proposed to quantify these interactions and the underlying physics, it is still far from trivial to address the interfacial DMI. Inspired by the reported tilt of the magnetization of the side edge of a thin film structure, we here present a quasi-static, straightforward measure

Lattice vibration modes are collective excitations in periodic arrays of atoms or molecules. These modes determine novel transport properties in solid crystals. Analogously, in periodical arrangements of magnetic vortex-state disks, collective vortex motions have been predicted. Here, we experimentally observe wave modes of collective vortex gyration in one-dimensional (1D) periodic arrays of magnetic disks using time-resolved scanning transmission x-ray microscopy. The observed modes are interp

Residential Internet connectivity is growing at a phenomenal rate. A number of recent studies have attempted to characterize this connectivity - measuring coverage and performance of last-mile broadband links - from a various vantage points on the Internet, via wireless APs, and even with user cooperation. These studies, however, sacrifice accuracy or require substantial human time. In this work, we present a novel two-pass method to characterize neighborhood networks. We demonstrate that the tw

Generating pure spin currents via the spin Hall effect in heavy metals has been an active topic of research in the last decade. In order to reduce the energy required to efficiently switch neighboring ferromagnetic layers for applications, one should not only increase the charge-to-spin conversion efficiency but also decrease the longitudinal resistivity of the heavy metal. In this work, we investigate the spin Hall conductivity in W1-xTax/CoFeB/MgO (x = 0–0.2) using spin torque ferromagnetic re

Transport protocols must accommodate diverse application and network requirements. As a result, TCP has evolved over time with new congestion control algorithms such as support for generalized AIMD, background flows, and multipath. On the other hand, explicit congestion control algorithms have been shown to be more efficient. However, they are inherently more rigid because they rely on in-network components. Therefore, it is not clear whether they can be made flexible enough to support diverse a

Many types of time-critical communication occur in today’s networks. However, providing reliability or robustness to such transfers is often challenging. Retransmission-based schemes can violate timing constraints, and redundancy-based FEC schemes impose significant bandwidth overhead and are difficult to tune. In light of recent advances in content-aware networking, we argue that redundancy-based approaches need to be re-engineered. Content-aware networks allow the overhead of redundancy to be

Abstract Motivation The growing use of next-generation sequencing and enlarged sequencing throughput require efficient short-read alignment, where seeding is one of the major performance bottlenecks. The key challenge in the seeding phase is searching for exact matches of substrings of short reads in the reference DNA sequence. Existing algorithms, however, present limitations in performance due to their frequent memory accesses. Results This paper presents BWA-MEME, the first full-fledged short

Internet Service Providers (ISPs) are in a constant race to meet the bandwidth demands of their subscribers. Access link upgrades, however, are expensive and take years to deploy. Many ISPs are looking for alternative solutions to reduce the need for continuous and expensive infrastructure expansion. This paper shows that there are many forms of local connectivity and storage in residential environments, and that these resources can be used to relieve the access network load. Making effective us

We performed micromagnetic numerical and analytical calculations in studying the effects of change in the primitive unit cells of one-dimensional (1D) vortex arrays on collective vortex-gyration dispersion. As the primitive basis, we consider alternating constituent materials (NiMnSb vs. Permalloy) and alternating dimensions including constituent disk diameter and thickness. In the simplest case, that of one vortex-state disk of given dimensions and single material in the primitive cell, only a

Transport protocols must accommodate diverse application and network requirements. As a result, TCP has evolved over time with new congestion control algorithms such as support for generalized AIMD, background flows, and multipath. On the other hand, explicit congestion control algorithms have been shown to be more efficient. However, they are inherently more rigid because they rely on in-network components. Therefore, it is not clear whether they can be made flexible enough to support diverse a