Abstract: Converting shared libraries is provided. A shadow shared library is generated based on symbol information of each respective symbol of an original shared library. A symbol receiver that corresponds to the shadow shared library is generated. The symbol receiver corresponding to the shadow shared library and the original shared library are deployed as a microservice on a set of servers.

Abstract: According to some aspects, systems and methods for optimizing the mapping and translating of natural language phrases into query code (e.g., SQL) via Generative AI are provided. Various embodiments employ optimizations to resolve at least some of the known issues with conventional LLM usage. Various embodiments are configured to leverage prompt engineering and/or fine tuning of a generative AI model to optimize the translation of natural language into code. For example, a database dictionary system manages creation of a database dictionary that describes an existing database target to a model. The database dictionary can be used as part of a query prompt input to an LLM. Employing the database dictionary, the output of the LLM is optimized for the specific database/context responsive to any request provided by a user. In various embodiments, the database dictionary is constructed and supplied to the LLM as part of a query prompt.

Abstract: A computer-implemented process is disclosed. An application is loaded into a local address space. A request by the application to load a target shared library is intercepted by an interceptor. Using the interceptor and based upon the request being intercepted, a shared library correlation table is searched for a loading count and a loading policy associated with the target shared library. Based upon the loading count and the loading policy, a selection is made between loading the target shared library as a shared library container, and loading the target shared library into the local address space. The target shared library is loaded based upon the selecting. The loading count represents a number of times the target shared library was loaded, and the loading policy indicates how the target shared library is to be loaded.

Abstract: A computer receives a log file, where the log file comprises records associated with the instructions in a source code. The computer loads, using a debugger, the log file and the source code. The computer receives a loading address from the log file. The computer updates a debugging data format (DWARF) with the one or more records of the log file, where the DWARF is accessed using the loading address and comprises one or more data structure entries. The computer identifies a calling address from the log file and identifies the one or more data structure entries associated with the calling address.

Abstract: The disclosure presents methods and apparatus that can be used to generate a software source code according to a user-provided specification based on example snippets searched from the Internet or a local database, comprising: providing a user-defined specification of the target program including input data, output data, a function or algorithm, and other parameters; decomposing the function into sub-functions if necessary; searching a list of related programming example codes and snippets of each sub-function; analyzing and ranking the search results; selecting and extracting the best snippet source codes; refactoring and reformatting the codes; gluing and testing the generated codes. The final source codes are supposed to be compiled successfully and implement the desired function and meet the performance requirements. Even the final compilation success is not guaranteed the described method and apparatus can help on a best-effort basis and reduce a great effort in programming.

Abstract: The disclosure presents methods and apparatus that can be used to generate a software source code according to a user-provided specification based on example snippets searched from the Internet or a local database, comprising: providing a user-defined specification of the target program including input data, output data, a function or algorithm, and other parameters; decomposing the function into sub-functions if necessary; searching a list of related programming example codes and snippets of each sub-function; analyzing and ranking the search results; selecting and extracting the best snippet source codes; refactoring and reformatting the codes; gluing and testing the generated codes. The final source codes are supposed to be compiled successfully and implement the desired function and meet the performance requirements. Even the final compilation success is not guaranteed the described method and apparatus can help on a best-effort basis and reduce a great effort in programming.

Abstract: Processing a job request for multiple versions of a distributed computing service. The service processing node does this by at least interleavingly (e.g., via time sharing with rapid context switching, or by actually concurrently) running a first runtime library associated with a first service version of the distributed computerized service and a second runtime library associated with a different service version of the distributed computerized service. While running the first runtime library, job requests of a first service version may be at least partially processed using a first set of one or more executables that interact with the first runtime library. While running the second runtime library, job requests of a second service version may be at least partially processed using a second set of one or more executables that interact with the second runtime library.

Abstract: A feeding network of a dual-beam antenna and a dual-beam antenna are disclosed. The feeding network includes: a cavity, including an upper grounding metal plate and a lower grounding metal plate; a printed circuit board PCB, disposed inside the cavity, where a splitting network circuit and a phase-shift circuit in the feeding network are integrated into the PCB, and arrangement of the PCB and the cavity enables a wire on the PCB to have a strip line structure as a whole; and at least two radio-frequency signal input ports, where the at least two radio-frequency signal input ports are connected to the splitting network circuit on the PCB.

Abstract: Processing received job requests for a multi-versioned distributed computerized service. For each received job request, the job request is channeled to an appropriate service processing node that depends on the version of the distributed computing service that is to handle the job request. A version of the distributed computing service is assigned to the incoming job request. A service processing node that runs a runtime library for the assigned service version is then identified. The identified service processing node also has an appropriate set of one or more executables that allows the service processing node to plan an appropriate role (e.g., compiler, scheduler, worker) in the distributed computing service. The job request is then dispatched to the identified service processing node.

Abstract: Processing a job request for multiple versions of a distributed computing service. The service processing node does this by at least interleavingly (e.g., via time sharing with rapid context switching, or by actually concurrently) running a first runtime library associated with a first service version of the distributed computerized service and a second runtime library associated with a different service version of the distributed computerized service. While running the first runtime library, job requests of a first service version may be at least partially processed using a first set of one or more executables that interact with the first runtime library. While running the second runtime library, job requests of a second service version may be at least partially processed using a second set of one or more executables that interact with the second runtime library.

Abstract: Aspects extend to methods, systems, and computer program products for optimally pipelining result sets with fault tolerance in distributed query execution. Distributed computing jobs are optimized by dividing the distributed computing jobs into one or more bubbles for execution. Each bubble can be independently executed, potentially in parallel with other bubbles, when resources to handle the bubble are available. Intra-bubble communication can be streamed between vertices within a bubble. Inter-bubble communication can be stored to durable storage. Bubbles provide a failure boundary for a job graph and re-executing a bubble along with storage of intermediate results in durable storage can be used to recover from failures. When a vertex inside a bubble fails, computation can resume by rescheduling the execution of the failed bubble from the durable inputs for that bubble. Durable storage provides a light-weight failover to handle non-deterministic behavior.

Abstract: Processing a job request for multiple versions of a distributed computing service. The service processing node does this by at least interleavingly (e.g., via time sharing with rapid context switching, or by actually concurrently) running a first runtime library associated with a first service version of the distributed computerized service and a second runtime library associated with a different service version of the distributed computerized service. While running the first runtime library, job requests of a first service version may be at least partially processed using a first set of one or more executables that interact with the first runtime library. While running the second runtime library, job requests of a second service version may be at least partially processed using a second set of one or more executables that interact with the second runtime library.

Abstract: An approach for collection and presentation of runtime data semantics. At least one of code-coverage history, system runtime history and code version information are received. An inspection line of code or variable(s) are received and runtime data semantics is retrieved from at least one of code-coverage history, system runtime history and code version information. The runtime data semantics are filtered based on the inspection line of code and/or variable(s) and are output.

Abstract: A feeding network of a dual-beam antenna and a dual-beam antenna are disclosed. The feeding network includes: a cavity, including an upper grounding metal plate and a lower grounding metal plate; a printed circuit board PCB, disposed inside the cavity, where a splitting network circuit and a phase-shift circuit in the feeding network are integrated into the PCB, and arrangement of the PCB and the cavity enables a wire on the PCB to have a strip line structure as a whole; and at least two radio-frequency signal input ports, where the at least two radio-frequency signal input ports are connected to the splitting network circuit on the PCB.

Abstract: Aspects extend to methods, systems, and computer program products for optimally pipelining result sets with fault tolerance in distributed query execution. Distributed computing jobs are optimized by dividing the distributed computing jobs into one or more bubbles for execution. Each bubble can be independently executed, potentially in parallel with other bubbles, when resources to handle the bubble are available. Intra-bubble communication can be streamed between vertices within a bubble. Inter-bubble communication can be stored to durable storage. Bubbles provide a failure boundary for a job graph and re-executing a bubble along with storage of intermediate results in durable storage can be used to recover from failures. When a vertex inside a bubble fails, computation can resume by rescheduling the execution of the failed bubble from the durable inputs for that bubble. Durable storage provides a light-weight failover to handle non-deterministic behavior.

Abstract: Techniques for reducing broadcast and multicast traffic in a stacking system are provided. In one embodiment, a master device in the stacking system can automatically determine a minimal set of VLAN associations for stacking links in the stacking system. The minimal set of VLAN associations can avoid unnecessary transmission of broadcast or multicast packets through the system's topology.

Abstract: Techniques for aggregating hardware routing resources in a system of devices are provided. In one embodiment, a device in the system of devices can divide routing entries in a software routing table of the system into a plurality of route subsets. The device can further assign each route subset in the plurality of route subsets to one or more devices in the system. The device can then install, for each route subset that is assigned to the device, routing entries in the route subset into a hardware routing table of the device.

Abstract: The disclosure discloses a method and an electronic device for recommending a video. The method includes: categorizing and ranking videos in each of categories according to a degree of popularity corresponding to each video, analyzing a preference value for each of the categories of each of user identities according to a browsing history, obtaining the preference values for each of the categories of a user identity logging in a terminal device according to the user identity logging in the terminal device and the preference value for each of the categories of each of user identities, and selecting and pushing one or more videos from each of the categories to the terminal device for displaying according to the preference value for each of the categories of the user logging in the terminal device and the ranking result. The popularity degree of the pushed videos rises and the user has no need to enter the keywords for searching manually and more convenient for user.

Abstract: An approach for collection and presentation of runtime data semantics. At least one of code-coverage history, system runtime history and code version information are received. An inspection line of code or variable(s) are received and runtime data semantics is retrieved from at least one of code-coverage history, system runtime history and code version information. The runtime data semantics are filtered based on the inspection line of code and/or variable(s) and are output.

Abstract: Processing a job request for multiple versions of a distributed computing service. The service processing node does this by at least interleavingly (e.g., via time sharing with rapid context switching, or by actually concurrently) running a first runtime library associated with a first service version of the distributed computerized service and a second runtime library associated with a different service version of the distributed computerized service. While running the first runtime library, job requests of a first service version may be at least partially processed using a first set of one or more executables that interact with the first runtime library. While running the second runtime library, job requests of a second service version may be at least partially processed using a second set of one or more executables that interact with the second runtime library.