Lo Heander, Emma Söderberg, Christofer Rydenfält · 2024
Code review occupies a significant amount of developers’ work time and is an established practice in modern software development. Despite misaligments between users’ goals and the code review tools and processes pointed out by recent research, the code review tooling has largely stayed the same since the early 90s. Improving these tools, even slightly, has the potential for a large impact spread out over time and the large developer community.
Cited by 3Open access
YunSeok Choi, Hyojun Kim, Jee-Hyong Lee · 2023
Code summarization, which aims to automatically generate natural language descriptions from source code, has become an essential task in software development for better program understanding.Abstract Syntax Tree (AST), which represents the syntax structure of the source code, is helpful when utilized together with the sequence of code tokens to improve the quality of code summaries.Recent works on code summarization attempted to capture the sequential and structural information of the source code, but they considered less the property that source code consists of multiple code blocks.In this paper, we propose BLOCSUM, BLOck scope-based source Code SUMmarization via shared block representation that utilizes block-scope information by representing various structures of the code block.We propose a shared block position embedding to effectively represent the structure of code blocks and merge both code and AST.Furthermore, we develop variant ASTs to learn rich information such as block and global dependencies of the source code.To prove our approach, we perform experiments on two real-world datasets, the Java dataset and the Python dataset.We demonstrate the effectiveness of BLOCSUM through various experiments, including ablation studies and a human evaluation.
Cited by 2Open access
Heander, Lo · Lund University Publications (Lund University) · 2024
Code review occupies a significant amount of developers’ work time and is an established practice in modern software development. Despite misaligments between users’ goals and the code review tools and processes pointed out by recent research, the code review tooling has largely stayed the same since the early 90s. Improving these tools, even slightly, has the potential for a large impact spread out over time and the large developer community.In this paper, we use the Double Diamond design process to work together with a team of industry practitioners to find, refine, prototype, and evaluate ways to make it easier to compare refactored code blocks and find previously hard-to-see changes in them. The results show that a flexible comparison modal integrated into Gerrit could reduce the mental load of code review on refactored code. Potentially, it could also have effects on how code is written by no longer discouraging refactoring due to it complicating the review. The user interface created in this collaborative manner was also intuitive enough for all of the participants to be able to use it without any hints or instructions.
Cited by 0Open access
Heander, Lo · Figshare · 2024
Code review occupies a significant amount of developers’ work time and is an established practice in modern software development. Despite misaligments between users’ goals and the code review tools and processes pointed out by recent research, the code review tooling has largely stayed the same since the early 90s. Improving these tools, even slightly, has the potential for a large impact spread out over time and the large developer community.In this paper, we use the Double Diamond design process to work together with a team of industry practitioners to find, refine, prototype, and evaluate ways to make it easier to compare refactored code blocks and find previously hard-to-see changes in them. The results show that a flexible comparison modal integrated into Gerrit could reduce the mental load of code review on refactored code. Potentially, it could also have effects on how code is written by no longer discouraging refactoring due to it complicating the review. The user interface created in this collaborative manner was also intuitive enough for all of the participants to be able to use it without any hints or instructions.
Cited by 0Open access
Changlong Xu, Liangming Wu, Wei Liu et al. · 2024
In Long Term Evolution (LTE) and New Radio (NR) systems, Reed-Muller (RM) code-based block codes have been employed to encode Uplink Control Information (UCI) with very small payload sizes. However, there is room for further improvement in the performance of these block codes. In this paper, we propose a unified block code design based on Golay code for UCI, considering codeword lengths of 20, 24, and 32 bits, which are potentially relevant for 6G systems. The block codes with a codeword length of 20 bits are initially constructed by shortening the extended Golay code (24,12) and subsequently adding parity check bits. These parity check bits are obtained through a nested exhaustive search, aiming to maximize the minimum Hamming distance and achieve the best weight distribution. We carefully select candidate generator matrices with the fewest low weights. Subsequently, we construct block codes with codeword lengths of 24 bits and 32 bits by extending the 20-bit block codes. Our proposed Golay-based block codes outperform RM-based block codes in LTE and NR systems in terms of both performance and complexity. Notably, for the case of a 24-bit codeword length, the proposed Golay-based block codes exhibit approximately 0.5 dB better performance than RM-based block codes for the majority of payload sizes.
Cited by 0
YIN Kangqi, WU Ming, WANG Pengcheng, XU Yun · SHILAP Revista de lepidopterología · 2020
Code completion suggestion can significantly enhance coding efficiency in programming,but existing tools and methods are not effective enough in collecting suitable candidate codes from codes with large size difference.To address the problem,this paper proposes a new code block completion suggestion method based on gapped code clone techniques.By improving a matching algorithm based on sliding windows and error-matching indexes,this method searches for candidate code blocks similar to to-be-completed blocks.Then it performs feature extraction,clustering and similarity-based sorting on candidate code blocks,so as to obtain the order of suggested code blocks.Experimental results show that,compared with the code block completion suggestion method proposed by HILL etc.,this proposed method has a higher accuracy,and is applicable to more code block completion scenarios.
Cited by 0Open access
Roberto Lublinerman, Stavros Tripakis · 2009
Abstract. We study modular, automatic code generation from hierarchical block diagrams with synchronous semantics. Such diagrams are the fundamental model behind widespread tools such as Simulink and SCADE. Modularity means code is generated for a given composite block independently from context, that is, without knowing in which diagrams this block is going to be used. This can be achieved by abstracting a given macro (i.e., composite) block into a set of interface functions plus a set of dependencies between these functions. These two pieces of information form the exported interface for a block. This approach allows modularity to be quantified, in terms of the size of the interface, that is, the number of interface functions that are generated per block. The larger this number, the less modular the code is. This definition reveals a fundamental trade-off between modularity and reusability (set of diagrams the block can be used in): using an abstraction that is too coarse (i.e., too few interface functions) may create false input-output dependencies and result in dependency cycles due to feedback loops. In this paper we explore this and other trade-offs. We also show how the method can be extended from a purely synchronous block diagram model to triggered and timed block diagrams, which allow for modeling multi-rate systems. 1
Cited by 0
M.V. Khoroshailova, A.V. Turetsky, Yu.A. Pirogova · Radioengineering · 2025
Problem statement. The proposed approach opens up new possibilities for adaptive decoding, allowing you to dynamically adjust the parameters of the decoder depending on the characteristics of the received signal. This is especially important in conditions of changing channel noise or when using variable-length codes. Using a hypernet to manage subnet parameters ensures efficient allocation of computing resources, concentrating them on the most problematic nodes of the Tanner graph. The arctanh approximation by the activation function based on the Taylor decomposition reduces computational complexity, which is critical for real-time decoder implementation. Goal. The development of a hypernet specialized for decoding short block codes, which makes it possible to create a more flexible and adaptive decoding system capable of efficiently processing various types of short block codes with minimal resource expenditure. Results. The simulation results show that the proposed method makes it possible to achieve significant improvements in decoding characteristics compared to traditional approaches, especially in conditions of a low signal-to-noise ratio. This opens up prospects for the application of the proposed method in a wide range of telecommunication systems requiring high reliability of data transmission. Practical significance. The results obtained make it possible to significantly improve the speed and accuracy of decoding short block codes, which is especially important for communication systems where response time and reliability of data transmission play a critical role.
Cited by 0
Hamid Jafarkhani · IEEE Transactions on Communications · 2001
It has been shown that a complex orthogonal design that provides full diversity and full transmission rate for a space-time block code is not possible for more than two antennas. Previous attempts have been concentrated in generalizing orthogonal designs which provide space-time block codes with full diversity and a high transmission rate. We design rate one codes which are quasi-orthogonal and provide partial diversity. The decoder of the proposed codes works with pairs of transmitted symbols instead of single symbols.
Cited by 1,316
Ahmed S. Hadi · 2008
In this paper the linear block code decoder is constructed by neural network. The neural network will be adapted for a single-bit error. Each layer of a neural network will simulate a linear block code decoder stage. The syndrome generator, the error detection, and the error correction stages of the linear block code decoder will be simulated by the proposed neural network.
Cited by 11
Myeongsook Seo, Sang Wu Kim · 2002
Transmission power adaptations are considered in a space-time block code (STBC) system utilizing feedback channel gain information. We investigate the optimal power adaptation scheme that minimizes the average BER subject a fixed average transmission power constraint. We present the power gain provided by the optimal adaptation scheme over the conventional STBC without power adaptation. The power gain provided is found to be 13.8 dB at BER of 10/sup -5/ in a Rayleigh fading channel. Also, we analyze the performance of STBC system with optimal truncated power adaptation which compensates for fading above a certain fade depth: below the cutoff level data transmission is suspended (ie, outage condition is declared). Finally, we propose a simple adaptation scheme for STBC systems based on two-bits feedback information that provides a power gain of 4.3 dB at BER of 10/sup -5/.
Cited by 10
Gang Li, Junfeng Liu, Jun Long et al. · 2017 International Conference on Computer Systems, Electronics and Control (ICCSEC) · 2017
Rank criteria, a conventional recognition method of error correcting codes, was widely used for noiseless channel before. In this paper, the recognition of binary linear block code is considered, and it is different from the previous works. Firstly, an improved algorithm based on rank calculating to recognize code length is proposed. Then, an algorithm based on probability statistics to recognize synchronization deviation is used. At last, the parity check matrix is recovered by performing an elementary row transformation of the dual vectors. The analysis is confirmed by experimental results.
Cited by 3
Hamid Jafarkhani · 2002
It has been shown that a complex orthogonal design which provides full diversity and full transmission rate for a space-time block code is not possible for more than two antennas. Previous attempts have been concentrated in generalizing orthogonal designs which provide space-time block codes with full diversity and a high transmission rate. In this work, we design rate one codes which are quasi-orthogonal and provide partial diversity. The decoder of the proposed codes works with pairs of transmitted symbols instead of single symbols.
Cited by 67
Roberto Lublinerman, Christian Szegedy, Stavros Tripakis · 2009
We study modular, automatic code generation from hierarchical block diagrams with synchronous semantics. Such diagrams are the fundamental model behind widespread tools in the embedded software domain, such as Simulink and SCADE. Code is modular in the sense that it is generated for a given composite block independently from context (i.e., without knowing in which diagrams the block is to be used) and using minimal information about the internals of the block. In previous work, we have shown how modular code can be generated by computing a set of interface functions for each block and a set of dependencies between these functions that is exported along with the interface. We have also introduced a quantified notion of modularity in terms of the number of interface functions generated per block, and showed how to minimize this number, which is essential for scalability. Finally, we have exposed the fundamental trade-off between modularity and reusability (set of diagrams the block can be used in).
Cited by 54
Cheng, Kevin, Trevathan, James, Ludwig, Kip · Zenodo (CERN European Organization for Nuclear Research) · 2025
Data analysis scripts for Nature Communications article, "Application of kilohertz-frequency block to mitigate off-target motor effects of vagus nerve stimulation" by Cheng et al. at the University of Wisconsin-Madison. These scripts use a custom version of the pyeCAP (https://pyecap.readthedocs.io/en/latest/) analysis package developed by the Ludwig group at the University of Wisconsin-Madison. Raw data can be found at the following Dryad repository. Dataset DOI: 10.5061/dryad.1rn8pk17k
Cited by 1Open access
Ramesh Pyndiah, Patrick Adde · SPIRE - Sciences Po Institutional REpository · 2001
International audience
Cited by 0
G. Lakhani · Journal of Electronic Imaging · 2012
We present a study of JPEG baseline coding. It aims to determine the minimum storage needed to buffer the JPEG Huffman code bits of 8-bit image blocks. Since DC is coded separately, and the encoder represents each AC coefficient by a pair of run-length/AC coefficient level, the net problem is to perform an efficient search for the optimal run-level pair sequence. We formulate it as a two-dimensional, nonlinear, integer programming problem and solve it using a branch-and-bound based search method. We derive two types of constraints to prune the search space. The first one is given as an upper-bound for the sum of squares of AC coefficients of a block, and it is used to discard sequences that cannot represent valid DCT blocks. The second type constraints are based on some interesting properties of the Huffman code table, and these are used to prune sequences that cannot be part of optimal solutions. Our main result is that if the default JPEG compression setting is used, space of minimum of 346 bits and maximum of 433 bits is sufficient to buffer the AC code bits of 8-bit image blocks. Our implementation also pruned the search space extremely well; the first constraint reduced the initial search space of 4263 nodes down to less than 232 nodes, and the second set of constraints reduced it further by 97.8%.
Cited by 0
Pierre-jean Bouvet, Maryline Hélard · 2009
Cited by 0
Philipp Straubinger, Laura Caspari, Gordon Fraser · arXiv (Cornell University) · 2023
Learning to program has become common in schools, higher education and individual learning. Although testing is an important aspect of programming, it is often neglected in education due to a perceived lack of time and knowledge, or simply because testing is considered less important or fun. To make testing more engaging, we therefore introduce Code Critters, a Tower Defense game based on testing concepts: The aim of the game is to place magic mines along the route taken by small "critters" from their home to a tower, such that the mines distinguish between critters executing correct code from those executing buggy code. Code is shown and edited using a block-based language to make the game accessible for younger learners. The mines encode test inputs as well as test oracles, thus making testing an integral and fun component of the game.
Cited by 0Open access
Chau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung · 2013
higher code rate than orthogonal STBC and lower decoding complexity than non-orthogonal STBC. In this paper, we first derive the algebraic structure of QO-STBC, then we apply it in a novel graph-based search algorithm to find high-rate QO-STBCs with code rates greater than 1. From the four-antenna codes found using this approach, it is found that the maximum code rate is limited to 5/4 with symbolwise diversity level of four, and 4 with symbolwise diversity level of two. The maximum likelihood decoding of these high-rate QO-STBCs can be performed on two separate sub-groups of symbols. The rate-5/4 codes are the first known QO-STBCs with code rate greater 1 that has full symbolwise diversity level.
Cited by 0