摘要:
The adaptive compression technique improves the Lempel-Ziv (LZ) technique because it reduces the required storage space (18) and transmission time with transferring data (22). Pre-filled compression dictionaries (48) are utilized to resolve prior problems with the Lempel-Ziv technique where compression software starts with an empty compression dictionary and little compression is attained until dictionary has been filled with sequences common in the data being compared. The compression dictionary (48) is pre-filled with letter sequences, words and/or phrases that are commonly found in the compressed area. They may be used in the pre-filled dictionary where they are determined by sampling text data from the same text genre. Initially, multiple pre-filled dictionaries (52) may be utilized by the software, where the most appropriate dictionary for maximum compression is identified and used to compress current data. These modifications are made to any of the known Lempel-Ziv compression techniques based on the variants detailed in 1977 and 1978 articles by Ziv and Lempel.
摘要:
The adaptive compression technique improves the Lempel-Ziv (LZ) technique because it reduces the required storage space (18) and transmission time with transferring data (22). Pre-filled compression dictionaries (48) are utilized to resolve prior problems with the Lempel-Ziv technique where compression software starts with an empty compression dictionary and little compression is attained until dictionary has been filled with sequences common in the data being compared. The compression dictionary (48) is pre-filled with letter sequences, words and/or phrases that are commonly found in the compressed area. They may be used in the pre-filled dictionary where they are determined by sampling text data from the same text genre. Initially, multiple pre-filled dictionaries (52) may be utilized by the software, where the most appropriate dictionary for maximum compression is identified and used to compress current data. These modifications are made to any of the known Lempel-Ziv compression techniques based on the variants detailed in 1977 and 1978 articles by Ziv and Lempel.
摘要:
The adaptive compression technique improves the Lempel-Ziv (LZ) technique because it reduces the required storage space (18) and transmission time with transferring data (22). Pre-filled compression dictionaries (48) are utilized to resolve prior problems with the Lempel-Ziv technique where compression software starts with an empty compression dictionary and little compression is attained until dictionary has been filled with sequences common in the data being compared. The compression dictionary (48) is pre-filled with letter sequences, words and/or phrases that are commonly found in the compressed area. They may be used in the pre-filled dictionary where they are determined by sampling text data from the same text genre. Initially, multiple pre-filled dictionaries (52) may be utilized by the software, where the most appropriate dictionary for maximum compression is identified and used to compress current data. These modifications are made to any of the known Lempel-Ziv compression techniques based on the variants detailed in 1977 and 1978 articles by Ziv and Lempel.
摘要:
A system and method for scheduling the receipt of desired movies and other forms of data from a network which simultaneously distributes many sources of such data to many customers, as in a cable television system. Customer profiles are developed for the recipient describing how important certain characteristics of the broadcast video program, movie or other data are to each customer. From these profiles, an 'agreement matrix' (908) is calculated by comparing the recipient's profiles to the actual profiles of the characteristics of the available video programs, movies, or other data. The agreement matrix (908) thus characterizes the attractiveness of each video program, movie, or other data to each prospective customer. 'Virtual' channels are generated from the agreement matrix (908) to produce a series of video or data programming which will provide the greatest satisfaction to each customer. Feedback paths (1020, 1024) are also provided so that the customer's profiles and/or the profiles of the video programs or other data may be modified to reflect actual usage, and so that the data downloaded to the customer's set top terminal (620) may be minimized. Kiosks (figure 11) are also developed which assist customers in the selection of videos, music, books, and the like in accordance with the customer's objective profiles.
摘要:
A system and method for scheduling the receipt of desired movies and other forms of data from a network which simultaneously distributes many sources of such data to many customers, as in a cable television system. Customer profiles are developed for the recipient describing how important certain characteristics of the broadcast video program, movie or other data are to each customer. From these profiles, an 'agreement matrix' (908) is calculated by comparing the recipient's profiles to the actual profiles of the characteristics of the available video programs, movies, or other data. The agreement matrix (908) thus characterizes the attractiveness of each video program, movie, or other data to each prospective customer. 'Virtual' channels are generated from the agreement matrix (908) to produce a series of video or data programming which will provide the greatest satisfaction to each customer. Feedback paths (1020, 1024) are also provided so that the customer's profiles and/or the profiles of the video programs or other data may be modified to reflect actual usage, and so that the data downloaded to the customer's set top terminal (620) may be minimized. Kiosks (figure 11) are also developed which assist customers in the selection of videos, music, books, and the like in accordance with the customer's objective profiles.