Abstract: Embodiments of the present disclosure provide a method, an electronic device, and a medium for bug classification. The method includes determining, based on description information of a bug generated during product testing, classification information of the bug through at least one trained computing model; presenting the classification information of the bug; determining, based on user interaction for the presented classification information, whether performance of the at least one computing model satisfies a predetermined condition; and determining that the at least one computing model needs to be retrained in response to determining that the performance of the at least one computing model does not satisfy the predetermined condition. In this way, automatic classification of the bug is realized, and the computing model can be dynamically adjusted by retraining, so as to ensure accuracy of the automatic classification and improve efficiency of bug processing.

Abstract: Embodiments of the present disclosure provide a method, an electronic device, and a computer program product for determining a navigation path. The method may include acquiring a source geographical location and a destination geographical location received from a user side device. In addition, the method may include determining a navigation path from the source geographical location to the destination geographical location based on a communication resource heat database, the communication resource heat database including at least a plurality of geographical regions associated with the navigation path and communication resource heat of each of the plurality of geographical regions, the communication resource heat including signal quality, signal strength, and a remaining resource capacity. Then, the method may include sending the determined navigation path to the user side device.

Abstract: The present disclosure provides a multi-factor quantitative analysis method for deformation of a neighborhood tunnel. The method includes the following steps: analyzing monitoring data generated at a tunnel site; simulating collapse occurring at a shallow buried section of a tunnel; determining the degree of influence of each factor on the tunnel and a stratum; and determining quantitative influence of each factor on tunnel deformation. The present disclosure can not only provide an accurate theoretical basis for the construction of the shallow buried section of the small-distance tunnel, but also guarantee safety and cost saving during tunnel construction.

Abstract: Techniques are described herein for generating synthetic paired source code snippets that are semantically equivalent but syntactically distinct. In various implementations, few shot learning may be performed to prompt a large language model, based on demonstration source code snippet(s) in syntactically constrained pseudocode, to generate additional source code snippets in the syntactically constrained pseudocode. Based on additional source code snippets in additional programming language(s), the large language model may be used to generate more training source code snippets in the syntactically constrained pseudocode. The training source code snippets in the syntactically constrained pseudocode may be programmatically translated to generate synthetic training pairs of semantically equivalent source code snippets.

Abstract: The present disclosure discloses a method for producing raw cotton of machine-harvested long-staple cotton with a modal length of greater than or equal to 35 mm, including the steps: planting sea-island long-staple cotton and machining seed cotton, wherein planting the sea-island long-staple cotton includes preparation before machine harvesting, defoliation and ripening, choosing a cotton variety, etc.; and machining the seed cotton includes preparation before seed cotton ginning, mechanical separation of cotton seeds and raw cotton, and finishing the separated raw cotton. Raw cotton fibers obtained by the method of the present disclosure have main quality indexes that: a fiber length is 36.5-38.4 mm, a specific strength is 42.3-46.1 cN/tex, a uniformity is 86.2-87.0%, a foreign-fiber content is 0.2-0.4 g/t, and an impurity content is 2.6-3.4%.

Abstract: Provided is a flange (100) connected to an end of an insulating tube (10), the flange includes a flange plate (110) abutting the end of the insulating tube, a groove (111) recessed toward inside of the insulating tube is disposed on the flange plate, the groove is connected to the insulating tube, an inflation valve (120) is disposed within the groove, the groove is filled with sealing material (130) which covers the inflation valve. Provided are also insulator and insulated support post using the flange. The flange, the insulator and insulated support post help to protect the inflation valve from external force and the groove is filled with the sealing material to ensure the sealing performance of the flange.

Abstract: Implementations are described herein for leveraging machine learning to automate source code refactoring and/or rearchitecting. In various implementations, one or more ground truth boundaries may be removed from one or more boundaried source code files to produce one or more boundary-less source code files. One or more of the boundary-less source code files may be processed using a machine learning model to predict one or more candidate boundaries for reintroduction into the one or more boundary-less source code files. The one or more ground truth boundaries may be compared with the one or more predicted candidate boundaries. The machine learning model may be trained based on the comparing.

Abstract: Implementations are described herein for adapting existing source code snippets to new contexts. In various implementations, a command may be detected to incorporate an existing source code snippet into destination source code. An embedding may be generated based on the existing source code snippet, e.g., by processing the existing source code snippet using an encoder. The destination source code may be processed to identify one or more decoder constraints. Subject to the one or more decoder constraints, the embedding may be processed using a decoder to generate a new version of the existing source code snippet that is adapted to the destination source code.

Abstract: Implementations are described herein for building and/or applying a library of transformation templates to automate migration of source code. In various implementations, pre-migration and post-migration versions of source code that exist prior to and after migration of the source code may be analyzed. Based on the analysis, one or more transformations made to the pre-migration version of the source code to yield the post-migration version of the source code may be identified. A library of transformation templates that are applicable subsequently to automate migration of new source code may be built. In some implementations, for one or more of the transformations, a plurality of candidate transformation templates may be generated with different permutations of tokens being replaced with placeholders. One of the plurality of candidate transformation templates may be selected for inclusion in the library based on one or more criteria.

Abstract: Techniques are described herein for translating source code in one programming language to source code in another programming language using machine learning. In various implementations, one or more components of one or more generative adversarial networks, such as a generator machine learning model, may be trained to generate “synthetically-naturalistic” source code that can be used as a translation of source code in an unfamiliar language. In some implementations, a discriminator machine learning model may be employed to aid in training the generator machine learning model, e.g., by being trained to discriminate between human-generated (“genuine”) and machine-generated (“synthetic”) source code.

Abstract: Implementations are described herein for adapting existing source code snippets to new contexts. In various implementations, a command may be detected to incorporate an existing source code snippet into destination source code. An embedding may be generated based on the existing source code snippet, e.g., by processing the existing source code snippet using an encoder. The destination source code may be processed to identify one or more decoder constraints. Subject to the one or more decoder constraints, the embedding may be processed using a decoder to generate a new version of the existing source code snippet that is adapted to the destination source code.

Abstract: Techniques are described herein for translating source code using sparse-self attention. In various implementations, a source code snippet in a first programming language may be processed to obtain graph(s) representing snippet tokens, and relationships therebetween. Based on the graph(s), a subset of snippet token pairs may be identified from a superset of all possible token pairs in the source code snippet. Each token pair of the subset may include snippet tokens that are represented by nodes connected by one or more edges of the one or more graphs. A self-attention network of a translation machine learning model may be adapted to sparsely attend across the identified subset of token pairs. The source code snippet may then be processed based on the adapted translation machine learning model to generate a translation of the source code snippet in the second programming language.

Abstract: Techniques are described herein for using artificial intelligence to “learn,” statistically, a target programming style that is imposed in and/or evidenced by a code base. Once the target programming style is learned, it can be used for various purposes. In various implementations, one or more generative adversarial networks (“GANs”), each including a generator machine learning model and a discriminator machine learning model, may be trained to facilitate learning and application of target programming style(s). In some implementations, the discriminator(s) and/or generator(s) may operate on graphical input, and may take the form of graph neural networks (“GNNs”), graph attention neural networks (“GANNs”), graph convolutional networks (“GCNs”), etc., although this is not required.

Abstract: Implementations are described herein for leveraging machine learning to automate source code refactoring and/or rearchitecting. In various implementations, one or more ground truth boundaries may be removed from one or more boundaried source code files to produce one or more boundary-less source code files. One or more of the boundary-less source code files may be processed using a machine learning model to predict one or more candidate boundaries for reintroduction into the one or more boundary-less source code files. The one or more ground truth boundaries may be compared with the one or more predicted candidate boundaries. The machine learning model may be trained based on the comparing.

Abstract: Implementations are described herein for leveraging prior source code transformations to facilitate automatic creation and/or recommendation of tools for automating aspects of source code transformations captured in real time. In various implementations, a transformation made by a programmer to a source code snipped may be captured in a source code editor application in real time. Based on the transformation and the intent, one or more candidate source code transformations may be identified from one or more repositories of prior source code transformations made by one or more other programmers. The source code editor application may be caused to provide output indicative of a tool that is operable to automate one or more edits associated with both the transformation made by the programmer to the source code snippet and with one or more of the candidate source code transformations.

Abstract: Implementations are described herein for using machine learning to perform various tasks related to migrating source code based on relatively few (“few shots”) demonstrations. In various implementations, an autoregressive language model may be conditioned based on demonstration tuple(s). In some implementations, a demonstration tuple may include a pre-migration version of a first source code snippet and a post-migration version of the first source code snippet. In other implementations, demonstration tuples may include other data, such as intermediate forms (e.g., natural language descriptions or pseudocode), input-output pairs demonstrating intended behavior, etc. The autoregressive language model may be trained on corpora of source code and natural language documentation on the subject of computer programming.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for identifying one or more regions of a brain of a biological organism that are predicted to be functionally-specialized for performing a task. In one aspect, a method comprises: obtaining data defining a synaptic connectivity graph representing synaptic connectivity between neurons in the brain of the biological organism; identifying a plurality of sub-graphs of the synaptic connectivity graph; determining, for each sub-graph of the plurality of sub-graphs, a performance measure characterizing a performance of a neural network having a neural network architecture that is specified by the sub-graph in accomplishing the task; and determining, based on the performance measures, that one or more sub-graphs of the plurality of sub-graphs correspond to regions of the brain of the biological organism that are predicted to be functionally-specialized for performing the task.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for using a neural network to predict locations of feeders in an electrical power grid. One of the methods includes training a generative adversarial network comprising a generator and a discriminator; and generating, by the generator, from input images, output images with feeder metadata that represents predicted locations of feeder assets, including receiving by the generator a first input image and generating by the generator a corresponding first output image with first feeder data that identifies one or more feeder assets and their respective locations, wherein the one or more feeder assets had not been identified in any input to the generator.

Abstract: Implementations are described herein for leveraging prior source code transformations to facilitate automatic creation and/or recommendation of tools for automating aspects of source code transformations captured in real time. In various implementations, a transformation made by a programmer to a source code snipped may be captured in a source code editor application in real time. Based on the transformation and the intent, one or more candidate source code transformations may be identified from one or more repositories of prior source code transformations made by one or more other programmers. The source code editor application may be caused to provide output indicative of a tool that is operable to automate one or more edits associated with both the transformation made by the programmer to the source code snippet and with one or more of the candidate source code transformations.

Abstract: Implementations are described herein for using machine learning to perform various tasks related to migrating source code based on relatively few (“few shots”) demonstrations. In various implementations, an autoregressive language model may be conditioned based on demonstration tuple(s). In some implementations, a demonstration tuple may include a pre-migration version of a first source code snippet and a post-migration version of the first source code snippet. In other implementations, demonstration tuples may include other data, such as intermediate forms (e.g., natural language descriptions or pseudocode), input-output pairs demonstrating intended behavior, etc. The autoregressive language model may be trained on corpora of source code and natural language documentation on the subject of computer programming.