Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “code density”

Code and Datasets for "Minimum Density Hyperplanes"

Pavlidis, Nicos · University of Lancaster · 2016

The zip files contain code (in MATLAB) implementing the clustering and semi-supervised algorithms proposed in the paper "Minimum Density Hyperplanes". The publicly available datasets used in this paper are also included. The code is released under the LGPL licence, https://www.gnu.org/licenses/lgpl-3.0.txt

Cited by 0Open access

PartonDensity.jl: a novel parton density determination code

Capel, Francesca, Aggarwal, Ritu, Botje, Michiel et al. · arXiv (Cornell University) · 2024

We introduce our novel Bayesian parton density determination code, PartonDensity.jl. The motivation for this new code, the framework and its validation are described. As we show, PartonDensity.jl provides both a flexible environment for the determination of parton densities and a wealth of information concerning the knowledge update provided by the analyzed data set.

Cited by 0Open access

Optimizing the Density Functional Theory Code WIEN2k

Ruh, Thomas · reposiTUm (TU Wien) · 2023

Erkenntnisse über moderne Materialien auf einem atomistischen Level sowie ein Verständnis von Struktur-Eigenschaftsbeziehungen sind von größter Bedeutung, wenn es um das Design und/oder die Optimierung von Materialien geht. Eine Möglichkeit, solche Erkenntnisse zu gewinnen, stellen Computersimulationen dar, für deren Durchführung heute eine Vielzahl verschiedener Modelle und Näherungsmethoden im Einsatz sind. Das Softwarepaket WIEN2k verwendet „Full-Potential Linearized Augmented Plane Wave“ Kohn-Sham-Dichtefunktionaltheorie (DFT), um Materialien zu beschreiben und deren Eigenschaften zu berechnen und/oder vorherzusagen. Die Grundlage dafür sind fundamentale quantenmechanische Simulationen ihrer elektronischen Strukturen. Heutzutage ist die Leistungsfähigkeit moderner Computerhardware so weit fortgeschritten, dass es möglich ist, derartige Simulationen auf einem „normalen“ Laptop zu rechnen, sofern es sich um „einfache“ Materialien handelt. Allerdings wachsen die komputativen Kosten solcher Simulationen mit der dritten Potenz der Zahl der Atome, die notwendig ist, um das Material zu modellieren. Dies führt dazu, dass die Verwendung von hocheffizienten und optimierten Computercodes unerlässlich ist, um deshalb immer noch herausfordernde komplexere Materialien mit Simulationen behandeln zu können. Eine der größten Hürden bei der Behandlung von komplexen Materialien besteht in der Tatsache, dass im Zuge von DFT-Simulationen wiederholt generalisierte Eigenwertprobleme zu lösen sind, die immer noch zu den für Computer am schwierigsten zu lösenden algebraischen Problemen gehören. In dieser Arbeit wird die Leistungsfähigkeit der in WIEN2k verwendeten Algorithmen zur Lösung von Eigenwertproblemen getestet und optimiert – sowohl im Zusammenhang mit High Performing Computing (deutsch etwa „Hochleistungsrechnen“) als auch für Fälle, in denen alle statt nur „einige“ der niedrigsten Eigenwerte benötigt werden (wie es bei Routinerechnungen mit WIEN2k der Fall ist). Darüber hinaus wird mithilfe eines neuen Programms (3DDENS) eine neue signifikant schnellere Methode zur Berechnung von Elektronendichten auf 3D-Rastern aus WIEN2k-Daten implementiert. Schließlich wird WIEN2k auf einige Fallbeispiele unterschiedlicher Komplexität angewendet, um unterschiedliche Anforderungen verschiedener Problemstellungen an komputative Parameter sowie Optimierungsansätze zu zeigen.

Cited by 1Open access

Systematic Convolutional Low Density Generator Matrix Code

Suihua Cai, Wenchao Lin, Xinyuanmeng Yao et al. · IEEE Transactions on Information Theory · 2021

In this paper, we propose a systematic low density generator matrix (LDGM) code ensemble, which is defined by the Bernoulli process. We prove that, under maximum likelihood (ML) decoding, the proposed ensemble can achieve the capacity of binary-input output symmetric (BIOS) memoryless channels in terms of bit error rate (BER). The proof technique reveals a new mechanism, different from lowering down frame error rate (FER), that the BER can be lowered down by assigning light codeword vectors to light information vectors. The finite length performance is analyzed by deriving an upper bound and a lower bound, both of which are shown to be tight in the high signal-to-noise ratio (SNR) region. To improve the waterfall performance, we construct the systematic convolutional LDGM (SysConv-LDGM) codes by a random splitting process. The SysConv-LDGM codes are easily configurable in the sense that any rational code rate can be realized without complex optimization. As a universal construction, the main advantage of the SysConv-LDGM codes is their near-capacity performance in the waterfall region and predictable performance in the error-floor region that can be lowered down to any target as required by increasing the density of the uncoupled LDGM codes. Numerical results are also provided to verify our analysis.

Cited by 15

Chimpanzee density - unmarked 'gdistsamp' code and inputs.pdf

Chitayat, Adrienne · Figshare · 2020

Hierarchical distance sampling model code and inputs for 'gdistsamp' in the package Unmarked in R. Code used to assess the ecological correlates of chimpanzee density in Mahale Mountains National Park, Tanzania.<br><br>

Cited by 0Open access

Abstract Improving Code Density Using Compression Techniques

Charles Lefurgy, Peter Bird, I-cheng Chen et al. · 2008

We propose a method for compressing programs in embedded processors where instruction memory size dominates cost. A post-compilation analyzer examines a program and replaces common sequences of instructions with a single instruction codeword. A microprocessor executes the compressed instruction sequences by fetching codewords from the instruction memory, expanding them back to the original sequence of instructions in the decode stage, and issuing them to the execution stages. We apply our technique to the PowerPC instruction set and achieve 30 % to 50% reduction in size for SPEC CINT95 programs. Keywords:

Cited by 0

Parsimonious Quantum Low-Density Parity-Check Code Surgery

Andrew C. Yuan, Alexander Cowtan, Zhiyang He et al. · ArXiv.org · 2026

Quantum code surgery offers a flexible, low-overhead framework for executing logical measurements within quantum error-correcting codes. It encompasses several fault-tolerant logical computation schemes, including parallel surgery, universal adapters and fast surgery, and serves as the key primitive in extractor architectures. The efficiency of these schemes crucially depends on constructing low-overhead ancilla systems for measuring arbitrary logical operators in general quantum Low-Density Parity-Check (qLDPC) codes. In this work, we introduce a method to construct an ancilla system of qubit size $O(W \log W)$ to measure an arbitrary logical Pauli operator of weight $W$ in any qLDPC stabilizer code. This new construction immediately reduces the asymptotic overhead across various quantum code surgery schemes.

Cited by 0Open access

Divided Cage and Social Density Data and Code

Cook, Chelsea N. · Figshare · 2025

Social animals exhibit complex, coordinated behaviors that can drive significant environmental change. Within groups, individuals sense their environment and share information to facilitate collective action. Direct physical contact is a key mechanism of communication in many social species, yet its role in organizing collective behaviors remains underexplored. Here, we investigate how tactile interactions influence thermoregulatory fanning behavior in honey bees (<i>Apis mellifera</i>), a critical collective response to environmental stress. By reducing the ability of bees to engage in physical contact, we demonstrated that direct tactile interactions are necessary to initiate and coordinate fanning. Increasing social density by modulating spatial constraints further enhanced the probability of fanning. Using video tracking, we confirmed that elevated social densities resulted in more frequent direct contacts, identifying tactile interactions—specifically head-to-head contacts—as a driver of fanning behavior. Our findings highlight tactile communication as a mechanism for information transfer in an ecologically relevant collective behavior. By elucidating how social interactions mediate environmental responses, this work contributes to our understanding of the resilience of social systems in a rapidly changing world.

Cited by 0Open access

Code for "DCFO: Density-Based Counterfactuals for Outliers"

Amico, Tommaso, Matthews, Pernille, Assent, Ira et al. · Zenodo (CERN European Organization for Nuclear Research) · 2025

This is the code for "DCFO: Density-Based Counterfactuals for Outliers", accepted at SIGKDD 2026

Cited by 0Open access

Code vector density in topographic mappings: Scalar case

S.P. Luttrell · IEEE Transactions on Neural Networks · 1991

The author derives some new results that build on his earlier work (1989) of combining vector quantization (VQ) theory and topographic mapping (TM) theory. A VQ model (with a noisy transmission medium) is used to model the processes that occur in TMs, which leads to the standard TM training algorithm, albeit with a slight modification to the encoding process. To emphasize this difference, the model is called a topographic vector quantizer (TVQ). In the continuum limit of the one-dimensional (scalar) TVQ. It is found that the density of code vectors is proportional to P(x)(a) (alpha=1/3) assuming that the transmission medium introduces additive noise with a zero-mean, symmetric, monotically decreasing probability density. This result is dramatically different from the result that is predicted when the standard TM training algorithm is used with a uniform symmetric neighborhood [-n, +n], and it is noted that this difference arises entirely from using minimum distortion rather than nearest neighbor encoding.

Cited by 56