Results 41 to 50 of about 461,576 (313)
CodeT: Code Generation with Generated Tests
CoRR, 2022 The task of generating code solutions for a given programming problem can benefit from the use of pre-trained language models such as Codex, which can produce multiple diverse samples. However, a major challenge for this task is to select the most appropriate solution from the multiple samples generated by the pre-trained language models. A natural way
Bei Chen 0008 +6 more
openaire +3 more sources
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Chronic micro‐inflammation in patients with end‐stage renal disease (ESRD) is a significant driver of cardiovascular complications and diminished quality of life. While standard hemodialysis (SHD) effectively manages small‐molecule clearance, its ability to remove medium‐to‐large uremic toxins—the primary catalysts of systemic ...
Hongwei Zuo +5 more
wiley +1 more source
Code Generation for Niche Programming Languages with Large Language Models [PDF]
Code generation is a prominent use-case for Large Language Models (LLMs). Specialized LLMs such as CodeLlama or Codestral are trained on a large variety of programming languages and achieve a strong performance on coding tasks.
Chen, Wei +2 more
core +1 more source
A Comparative Analysis of Fine-Tuning and Prompt Engineering for LLM-Based Automation of Building Energy Models for Rooftop Photovoltaics [PDF]
E3S Web of ConferencesThis study examines the effectiveness of Large Language Models (LLMs) in automating the generation of EnergyPlus Input Data Files (IDFs) for buildings equipped with integrated rooftop photovoltaic (PV) systems.
Pagri Muhammad Ihza Febriyan +3 more
doaj +1 more source
Generalized twisted Gabidulin codes [PDF]
Journal of Combinatorial Theory, Series A, 2018 Let $\mathcal{C}$ be a set of $m$ by $n$ matrices over $\mathbb{F}_q$ such that the rank of $A-B$ is at least $d$ for all distinct $A,B\in \mathcal{C}$. Suppose that $m\leqslant n$. If $\#\mathcal{C}= q^{n(m-d+1)}$, then $\mathcal{C}$ is a maximum rank distance (MRD for short) code.
Lunardon, Guglielmo +2 more
openaire +4 more sources
Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation
FEBS Letters, EarlyView.Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe +3 more
wiley +1 more source
Representations of finite element tensors via automated code generation [PDF]
, 2009 We examine aspects of the computation of finite element matrices and vectors which are made possible by automated code generation. Given a variational form in a syntax which resembles standard mathematical notation, the low-level computer code for ...
core +1 more source
, 2021 These are the datasets and generated code generators for our paper "Code Generation by Example" at MODELSWARD 2022.
openaire +2 more sources
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Two-Level Dictionary Code Compression: A New Scheme to Improve Instruction Code Density of Embedded Applications [PDF]
, 2009 Dictionary code compression is a technique which has been studied as a method to reduce the energy consumed in the instruction fetch path of processors. Instructions or instruction sequences in the code are replaced with short code words.
Mats Brorsson +3 more
core +1 more source