Enhancing Low-resource Fine-grained Named Entity Recognition by Leveraging Coarse-grained Datasets

Named Entity Recognition (NER) frequently suffers from the problem of insufficient labeled data, particularly in fine-grained NER scenarios. Although $K$-shot learning techniques can be applied, their performance tends to saturate when the number of annotations exceeds several tens of labels. To overcome this problem, we utilize existing coarse-grained datasets that offer a large number of annotations. A straightforward approach to address this problem is pre-finetuning, which employs coarse-grained data for representation learning. However, it cannot directly utilize the relationships between fine-grained and coarse-grained entities, although a fine-grained entity type is likely to be a subcategory of a coarse-grained entity type. We propose a fine-grained NER model with a Fine-to-Coarse(F2C) mapping matrix to leverage the hierarchical structure explicitly. In addition, we present an inconsistency filtering method to eliminate coarse-grained entities that are inconsistent with fine-grained entity types to avoid performance degradation. Our experimental results show that our method outperforms both $K$-shot learning and supervised learning methods when dealing with a small number of fine-grained annotations.Comment: Accepted to EMNLP 202

Data Augmentation for Neural Machine Translation using Generative Language Model

Despite the rapid growth in model architecture, the scarcity of large parallel corpora remains the main bottleneck in Neural Machine Translation. Data augmentation is a technique that enhances the performance of data-hungry models by generating synthetic data instead of collecting new ones. We explore prompt-based data augmentation approaches that leverage large-scale language models such as ChatGPT. To create a synthetic parallel corpus, we compare 3 methods using different prompts. We employ two assessment metrics to measure the diversity of the generated synthetic data. This approach requires no further model training cost, which is mandatory in other augmentation methods like back-translation. The proposed method improves the unaugmented baseline by 0.68 BLEU score

Optical manipulation of a dielectric particle along polygonal closed-loop geometries within a single water droplet

This work was supported by the National Research Foundation of Korea (NRF) Grant funded by the Korea government (MSIT) (No. 2019R1A2C2011293) and the UK Engineering and Physical Sciences Research Council (Grant EP/P030017/1).We report a new method to optically manipulate a single dielectric particle along closed-loop polygonal trajectories by crossing a suite of all-fiber Bessel-like beams within a single water droplet. Exploiting optical radiation pressure, this method demonstrates the circulation of a single polystyrene bead in both a triangular and a rectangle geometry enabling the trapped particle to undergo multiple circulations successfully. The crossing of the Bessel-like beams creates polygonal corners where the trapped particles successfully make abrupt turns with acute angles, which is a novel capability in microfluidics. This offers an optofluidic paradigm for particle transport overcoming turbulences in conventional microfluidic chips.Publisher PDFPeer reviewe

Carrot and stick?: Impact of a low-stakes school accountability program on student achievement

A key concern in the design of education policies relates to the structure of incentives in accountability systems. This paper examines a school accountability program that provides financial support to low-performing schools but has no direct punishment scheme for recipients who do not exhibit improvement. Although the program does not include high-stakes consequences, our estimates indicate that the program reduced the share of underperforming students by 18 percent. This paper's results suggest that to improve student achievement, a school accountability program does not need to set high-stakes consequences that potentially induce unwanted strategic behaviors on the part of school workers

Identification of the early and late responder genes during the generation of induced pluripotent stem cells from mouse fibroblasts

111Ysciescopu

Prefoldin 6 mediates longevity response from heat shock factor 1 to FOXO in C-elegans

Heat shock factor 1 (HSF-1) and forkhead box O (FOXO) are key transcription factors that protect cells from various stresses. In Caenorhabditis elegans, HSF-1 and FOXO together promote a long life span when insulin/IGF-1 signaling (IIS) is reduced. However, it remains poorly understood how HSF-1 and FOXO cooperate to confer IIS-mediated longevity. Here, we show that prefoldin 6 (PFD-6), a component of the molecular chaperone prefoldin-like complex, relays longevity response from HSF-1 to FOXO under reduced IIS. We found that PFD-6 was specifically required for reduced IIS-mediated longevity by acting in the intestine and hypodermis. We showed that HSF-1 increased the levels of PFD-6 proteins, which in turn directly bound FOXO and enhanced its transcriptional activity. Our work suggests that the prefoldin-like chaperone complex mediates longevity response from HSF-1 to FOXO to increase the life span in animals with reduced IIS.11Ysciescopu

CD82/KAI1 Maintains the Dormancy of Long-Term Hematopoietic Stem Cells through Interaction with DARC- Expressing Macrophages

Hematopoiesis is regulated by crosstalk between long-term repopulating hematopoietic stem cells (LT-HSCs) and supporting niche cells in the bone marrow (BM). Here, we examine the role of CD82/ KAI1 in niche-mediated LT-HSC maintenance. We found that CD82/ KAI1 is expressed predominantly on LT-HSCs and rarely on other hematopoietic stem-progenitor cells (HSPCs). In Cd82 +/-/+/- mice, LTHSCs were selectively lost as they exited from quiescence and differentiated. Mechanistically, CD82based TGF-b1/ Smad3 signaling leads to induction of CDK inhibitors and cell-cycle inhibition. The CD82 binding partner DARC/ CD234 is expressed on macrophages and stabilizes CD82 on LT-HSCs, promoting their quiescence. When DARC + BMmacrophages were ablated, the level of surface CD82 on LT-HSCs decreased, leading to cell-cycle entry, proliferation, and differentiation. A similar interaction appears to be relevant for human HSPCs. Thus, CD82 is a functional surface marker of LT-HSCs that maintains quiescence through interaction with DARC-expressing macrophages in the BM stem cell niche.113525Ysciescopu

Bioinformatics services for analyzing massive genomic datasets

The explosive growth of next-generation sequencing data has resulted in ultra-large-scale datasets and ensuing computational problems. In Korea, the amount of genomic data has been increasing rapidly in the recent years. Leveraging these big data requires researchers to use large-scale computational resources and analysis pipelines. A promising solution for addressing this computational challenge is cloud computing, where CPUs, memory, storage, and programs are accessible in the form of virtual machines. Here, we present a cloud computing-based system, Bio-Express, that provides user-friendly, cost-effective analysis of massive genomic datasets. Bio-Express is loaded with predefined multi-omics data analysis pipelines, which are divided into genome, transcriptome, epigenome, and metagenome pipelines. Users can employ predefined pipelines or create a new pipeline for analyzing their own omics data. We also developed several web-based services for facilitating down-stream analysis of genome data. Bio-Express web service is freely available at https://www. bioexpress.re.kr/. ?? 2020, Korea Genome Organization

Routing algorithms for field-programmable gate arrays

textField-Programmable Gate Arrays (FPGAs) have been one of the most popular devices for system prototyping, logic emulation, and reconfigurable computing. Their user-programmable prefabricated logic modules and routing structures provide low manufacturing cost and fast time-to-market implementation solutions to the users. However, the routing delay due to their inherent routing structure has been one of the biggest bottlenecks of their speed performance. As the VLSI fabrication feature size is shrunk to deep submicron dimension in modern technology, the portion taken up by routing in both of area and timing grows even more significantly. In this dissertation, we address issues on routing algorithms to optimize area and timing of an FPGA system. We present a new timing-driven routing algorithm for FPGAs. The algorithm finds a routing solution with minimum critical path delay for a given placed netlist using the Lagrangian relaxation technique. Lagrangian multipliers used to relax timing constraints are updated by subgradient method over iterations. Incorporated into the cost function, these multipliers guide the router to construct routing trees for the nets. Experimental results on benchmark circuits show that our approach outperforms the state-of-the-art VPR router. The routing channels of an FPGA consist of wire segments of various types, which provide the tradeoff between performance and routability. To fully exploit the potential of the routing architectures with various wire types, it is beneficial to perform appropriate assignment of wire types to routes for nets. We present a wire-type assignment algorithm that is based on iterative applications of mincost max-flow technique to simultaneously route many nets. At each stage of the network flow computation, we have guaranteed optimal result in terms of routability and total delay cost. Experimental results show that our algorithm can route more nets with smaller total delay. We also present a congestion-driven detailed routing algorithm. Using the min-cost flow approach, our algorithm routes all the nets connected to a common logic module simultaneously. At each stage of the min-cost flow computation, we guarantee optimal routing result for the nets connected to a logic block in terms of routability and total delay cost. To achieve better overall results, we adopt an iterative refinement scheme based on the Lagrangian relaxation technique. We compared the routing results with those from VPR router, and the results show that our router uses less or equal number of routing tracks with smaller critical path delay as well as total routing delay.Electrical and Computer Engineerin