Automatic Static Analysis Tools (ASATs) detect coding rule violations, including mistakes and bad practices that frequently occur during programming. While ASATs are widely used in both OSS and industry, the developer...
详细信息
ISBN:
(纸本)9781728196305
Automatic Static Analysis Tools (ASATs) detect coding rule violations, including mistakes and bad practices that frequently occur during programming. While ASATs are widely used in both OSS and industry, the developers do not resolve more than 80% of the detected violations. As one of the reasons, most ASATs users do not customize their ASATs to their projects after installation;the ASATs with the default configuration report many rule violations that confuse developers. To reduce the ratio of such uninteresting warning messages, we propose a method to customize ASATs according to the product source code automatically. Our fundamental hypothesis is: A software project has interesting ASAT rules that are consistent over time. Our method takes source code as input and generates an ASAT configuration. In particular, the method enables optional (i.e., disabled by default) rules that detected no violations on the version because developers are likely to follow the rules in future development. Our method also disables violated rules because developers were unlikely to follow them. To evaluate the method, we applied our method to 643 versions of four JavaScript projects. The generated configurations for all four projects increased the ASAT precision. They also increased recall for two projects. The result shows that our method helps developers to focus on their attractive rule violations. Our implementation of the proposed method is available at https://***/devreplay/linter-maintainer
coding rules automatically exclude language-specific anti-patterns in the source code. However, developers still need to validate project-specific anti-patterns manually. We present a novel static analysis tool DEVREP...
详细信息
coding rules automatically exclude language-specific anti-patterns in the source code. However, developers still need to validate project-specific anti-patterns manually. We present a novel static analysis tool DEVREPLAY that generates coding rules as regular expressions from real-time source code editing. The generated regular expressions automatically repeat the same changes to the source code. Hence, users can share their own coding rules with inter-project members to keep source code consistency. As a field study, we submitted patches to the most popular open-source projects implemented by different languages, and project reviewers accepted 80% (8 of 10) of our patches. ?? 2022 Elsevier B.V. All rights reserved.
An absolute encoder is widely employed in a computerized numerical control machine. In order to find a zero position, an incremental encoder must have a limit switch and often return to zero. But an absolute encoder c...
详细信息
An absolute encoder is widely employed in a computerized numerical control machine. In order to find a zero position, an incremental encoder must have a limit switch and often return to zero. But an absolute encoder can determine the absolute position of each point. So, it has high efficiency and its structure is simpler compared to the incremental encoder. However, the accuracy and the price of absolute encoders remain to be improved. To improve the measurement accuracy, a novel absolute optical imaging position encoder is proposed. The proposed encoder is based on the pseudo-random sequence, and a CMOS sensor is applied for collecting coding pattern images. A DSP system performs decoding task. A special image processing method is used to improve measurement accuracy. The measurement errors of the images are analyzed. Glass grating is processed by the traditional technology with line width of 10 mu m, so the manufacturing cost is decreased accordingly. Experimental results show that the proposed image processing method can improve the measurement accuracy of the proposed absolute optical imaging position encoder by several microns. (C) 2015 Elsevier Ltd. All rights reserved.
The dynamic encoding algorithm for searches (DEAS) is a recently developed algorithm that comprises a series of global optimization methods based on variable-length binary strings that represent real variables. It has...
详细信息
The dynamic encoding algorithm for searches (DEAS) is a recently developed algorithm that comprises a series of global optimization methods based on variable-length binary strings that represent real variables. It has been successfully applied to various optimization problems, exhibiting outstanding search efficiency and accuracy. Because DEAS manages binary strings or matrices, the decoding rules applied to the binary strings and the algorithm's structure determine the aspects of local search. The decoding rules used thus far in DEAS have some drawbacks in terms of efficiency and mathematical analysis. This paper proposes a new decoding rule and applies it to univariate DEAS (uDEAS), validating its performance against several benchmark functions. The overall optimization results of the modified uDEAS indicate that it outperforms other meta-heuristic methods and obviously improves upon older versions of DEAS series.
The results of the binary and ternary sequences synthesis by new methodology using a generalized coding rule over cyclotomic classes are presented. The effectiveness of the proposed methodology is shown by numerous ex...
详细信息
ISBN:
(纸本)9781424410736
The results of the binary and ternary sequences synthesis by new methodology using a generalized coding rule over cyclotomic classes are presented. The effectiveness of the proposed methodology is shown by numerous examples. Synthesized new regular coding rules for characteristic and binary discretely coded sequences with the given constraints, imposed on the levels of the sidelobes of the correlation functions, on the peak factor, and on the characteristic sequences ensembles of a defined volume, have been synthesized.
coding rules for amino acids in the genetic code are discussed from the point that the genetic code is a minimal code of mutational deterioration. The global mutational deterioration (GMD) function is defined through ...
详细信息
coding rules for amino acids in the genetic code are discussed from the point that the genetic code is a minimal code of mutational deterioration. The global mutational deterioration (GMD) function is defined through several parameters describing single base mutations and amino acid distances. The problem of searching for the global minimum of the GMD function is discussed in some detail. From GMD minimization under initial constraints we have succeeded in deducing the standard genetic code.
暂无评论