Patent classifications
G06F40/146
THIN-LAYER WEBPAGE CLONING FOR OFF-LINE DEMONSTRATION
A computer implemented method, computer system, and computer program product are provided for cloning a webpage. Webpage assets for a webpage are received. Using the webpage assets, the webpage is rendered for display within a graphical user interface of a webpage cloning system. Responsive to rendering the webpage, a thin-layer clone of the webpage as rendered for display in the graphical user interface is recorded. An off-line demonstration of the webpage is then generated from the thin-layer clone.
THIN-LAYER WEBPAGE CLONING FOR OFF-LINE DEMONSTRATION
A computer implemented method, computer system, and computer program product are provided for cloning a webpage. Webpage assets for a webpage are received. Using the webpage assets, the webpage is rendered for display within a graphical user interface of a webpage cloning system. Responsive to rendering the webpage, a thin-layer clone of the webpage as rendered for display in the graphical user interface is recorded. An off-line demonstration of the webpage is then generated from the thin-layer clone.
FPGA-BASED FAST PROTOCOL DECODING METHOD, APPARATUS, AND DEVICE
A field-programmable gate array (FPGA)-based FAST protocol decoding method, apparatus, and device, and a readable storage medium. The method acquires an actual XML template in real time and analyzes the actual XML template, generates a FAST protocol intermediate representation, and determines, according to preset decoding parameters, the maximum number of fields which are read at a single time, so as to generate a field matching state machine. Thus, the present disclosure can support a dynamically updated XML template, and allows flexible setting of the maximum number of fields according to an actual network bandwidth, and is applicable to disclosure scenarios of different network bandwidths. In a decoding process, the present disclosure realizes, by means of a field shift register and the field matching state machine, the function of reading and decoding a plurality of fields in parallel each time, significantly improving decoding efficiency.
Regular expression generation using longest common subsequence algorithm on combinations of regular expression codes
Disclosed herein are techniques related to automated generation of regular expressions. In some embodiments, a regular expression generator may receive input data comprising one or more character sequences. The regular expression generator may convert character sequences into a sets of regular expression codes and/or span data structures. The regular expression generator may identify a longest common subsequence shared by the sets of regular expression codes and/or spans, and may generate a regular expression based upon the longest common subsequence.
Regular expression generation using longest common subsequence algorithm on combinations of regular expression codes
Disclosed herein are techniques related to automated generation of regular expressions. In some embodiments, a regular expression generator may receive input data comprising one or more character sequences. The regular expression generator may convert character sequences into a sets of regular expression codes and/or span data structures. The regular expression generator may identify a longest common subsequence shared by the sets of regular expression codes and/or spans, and may generate a regular expression based upon the longest common subsequence.
Regular expression generation based on positive and negative pattern matching examples
Disclosed herein are techniques related to automated generation of regular expressions. In some embodiments, a regular expression generator may receive input data comprising one or more character sequences. The regular expression generator may convert character sequences into a sets of regular expression codes and/or span data structures. The regular expression generator may identify a longest common subsequence shared by the sets of regular expression codes and/or spans, and may generate a regular expression based upon the longest common subsequence.
Regular expression generation based on positive and negative pattern matching examples
Disclosed herein are techniques related to automated generation of regular expressions. In some embodiments, a regular expression generator may receive input data comprising one or more character sequences. The regular expression generator may convert character sequences into a sets of regular expression codes and/or span data structures. The regular expression generator may identify a longest common subsequence shared by the sets of regular expression codes and/or spans, and may generate a regular expression based upon the longest common subsequence.
Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device
A three-dimensional data encoding method includes: generating an N-ary tree structure of three-dimensional points included in three-dimensional data, where N is an integer greater than or equal to 2; generating first encoded data by encoding a first branch using a first encoding process, the first branch having, as a root, a first node included in a first layer that is one of layers included in the N-ary tree structure; generating second encoded data by encoding a second branch using a second encoding process different from the first encoding process, the second branch having, as a root, a second node included in the first layer and different from the first node; and generating a bitstream including the first encoded data and the second encoded data.
Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device
A three-dimensional data encoding method includes: generating an N-ary tree structure of three-dimensional points included in three-dimensional data, where N is an integer greater than or equal to 2; generating first encoded data by encoding a first branch using a first encoding process, the first branch having, as a root, a first node included in a first layer that is one of layers included in the N-ary tree structure; generating second encoded data by encoding a second branch using a second encoding process different from the first encoding process, the second branch having, as a root, a second node included in the first layer and different from the first node; and generating a bitstream including the first encoded data and the second encoded data.
SYSTEMS AND METHODS FOR ENHANCING ELECTRONIC COMMUNICATIONS
Systems and methods are provided for enhancing text-based electronic communications. In one embodiment, a sending agent automatically, or upon request by a user, disambiguates identifiers and terms included in a communication internally or in collaboration with a remote device or server based on the identity and history of the sending or intended receiving device or user, the content or context of the communication and/or the sending or intended receiving device or user and automatically or at the request of the sender, appends, enhances or provides certain additional information related to the identifier or terms to the message in real time. This additional information is then included or referenced, but not necessarily initially displayed or communicated, in the communication. The integrated system also may include a receiving agent on the receiving device that can disambiguate the identifier or terms and provide additional information and services related to the identifier or terms in the communication.