Results 61 to 70 of about 12,796,570 (330)
Source Code Optimization using Equivalent Mutants
, 2018 A mutant is a program obtained by syntactically modifying a program's source code; an equivalent mutant is a mutant, which is functionally equivalent to the original program. Mutants are primarily used in \emph{mutation testing}, and when deriving a test
Kushik, Natalia +2 more
core +3 more sources
A unary error correction code for the near-capacity joint source and channel coding of symbol values from an infinite set [PDF]
, 2013 A novel Joint Source and Channel Code (JSCC) is proposed, which we refer to as the Unary Error Correction (UEC) code. Unlike existing JSCCs, our UEC facilitates the practical encoding of symbol values that are selected from a set having an infinite ...
Hanzo, L. +3 more
core +1 more source
The likelihood encoder for source coding [PDF]
2013 IEEE Information Theory Workshop (ITW), 2013 The likelihood encoder with a random codebook is demonstrated as an effective tool for source coding. Coupled with a soft covering lemma (associated with channel resolvability), likelihood encoders yield simple achievability proofs for known results, such as rate-distortion theory.
Paul Cuff, Eva C. Song
openaire +2 more sources
Multi-modal Attention Network Learning for Semantic Source Code Retrieval [PDF]
International Conference on Automated Software Engineering, 2019 Code retrieval techniques and tools have been playing a key role in facilitating software developers to retrieve existing code fragments from available open-source repositories given a user query (e.g., a short natural language text describing the ...
Yao Wan +6 more
semanticscholar +1 more source
L’écriture collective du code source informatique
Revue d'anthropologie des connaissances, 2012 This article analyzes the collective writing of software source code. Software source code is a set of textual documents that formally specify the behavior of software – its script. The article draws on work in the sociology of science and technology and
Stéphane Couture
doaj +1 more source
Coding Schemes for Achieving Strong Secrecy at Negligible Cost
, 2016 We study the problem of achieving strong secrecy over wiretap channels at negligible cost, in the sense of maintaining the overall communication rate of the same channel without secrecy constraints. Specifically, we propose and analyze two source-channel
Bloch, Matthieu +3 more
core +3 more sources
On locally decodable source coding [PDF]
2015 IEEE International Conference on Communications (ICC), 2015 Locally decodable channel codes form a special class of error-correcting codes with the property that the decoder is able to reconstruct any bit of the input message from querying only a few bits of a noisy codeword. It is well known that such codes require significantly more redundancy (in particular have vanishing rate) compared to their non-local ...
Makhdoumi, Ali +3 more
openaire +3 more sources
Generating Adversarial Examples for Holding Robustness of Source Code Processing Models
AAAI Conference on Artificial Intelligence, 2020 Automated processing, analysis, and generation of source code are among the key activities in software and system lifecycle. To this end, while deep learning (DL) exhibits a certain level of capability in handling these tasks, the current state-of-the ...
Huangzhao Zhang +5 more
semanticscholar +1 more source
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi), 2023 Microservices architecture is widely used because of the ease of maintaining its microservices, as opposed to encapsulating functionality in a monolithic, which may negatively impact the development process when the application continues to grow.
Siti Rochimah, Bintang Nuralamsyah
doaj +1 more source
Analog coding of a source with erasures [PDF]
2016 IEEE International Symposium on Information Theory (ISIT), 2016 Analog coding decouples the tasks of protecting against erasures and noise. For erasure correction, it creates an "analog redundancy" by means of band-limited discrete Fourier transform (DFT) interpolation, or more generally, by an over-complete expansion based on a frame.
Marina Haikin, Ram Zamir
openaire +2 more sources