55 results about "End-of-file" patented technology

A system and method for presenting document records to a user through a display interface, comprising means for processing data of the first type through a first applet and data of the second type through a second applet and separately extracting data of the two different types using the separate applets. The user interface provides means for selecting a data file from a plurality of data files, displaying the merged and formatted processed first and second data, and managing a plurality of data files with the host application. Each record on the list may be individually selected, comprising providing at least two distinct categorization inputs from the user, providing an indicia in the record list to indicate a respective record classification, and providing means for selectively processing the records according to a respective classification thereof. The data file employs a standard image format file with an embedded index pointer to segregate two data types. A first data type, preferably an image, is referenced by the index pointer and is located near the terminus of the file. A second data type, for example text, appears immediately after the file header which includes the index pointer, and preferably terminates with an end of file marker. Thus, the single file may be read by both a standard image file reader, and a standard text reader, without parsing or segregation. The two data types are preferably text and image data, and the data file is preferably a tagged image format file (TIFF) file with Group-4 image compression.

A universal file format for providing digital rich ink data documents. Digital rich ink data is hidden among the ink image data otherwise stored in a widely-accepted image file format. For example, depending on the type of file, data can be concealed in the least significant bit or bits of pixel information, or stored in-different color indexes of a palette that result in the same color output. In other file types, digital rich ink data may be appended after the end of file marker, or placed in a comment area. When such a file is accessed, computing devices capable of handling rich ink data recognize and extract the rich ink data from the file, while devices incapable of recognizing the format are still able to display the ordinary ink data. Two file formats for describing the arrangement of rich ink data are also provided.

Media files such as MPEG-4 files are fragmented to allow for media and live media creation and delivery. A MPEG-4 standard description box includes synchronization information, end of file information, and chapter information to provide signaling information for near live playback of fragments. Playback can begin upon receiving a first MPEG-4 file fragment. A second MPEG-4 file fragment can be requested using information included in the first MPEG-4 file fragment.

A computer-implemented method for compressing a first stream of data, the first stream of data comprising a plurality of input words. The computer-implemented method includes receiving the plurality input words, and adaptively compressing the plurality of input words into a plurality of compression codes. The computer-implemented method further includes outputting the plurality of compression codes upon encountering an end-of-file signal in the first stream of data, wherein the plurality of compression codes are fewer in number than the number of unique bit patterns requiring unique compression codes under LZW (Lempel Ziv & Welch) compression.

A system and method for presenting document records to a user through a display interface is described. Data of a first type is processed through a first applet, and data of a second type is processed through a second applet. Data of the first and second types is extracted separately using the first and second applets. A user interface provides means for selecting a data file from a plurality of data files. The merged and formatted processed first and second data is displayed. A plurality of data files are managed with a host application. In an aspect, a data file includes data of the first and second types. The data file includes an index portion in a header pointing to the first data type, and the second data type resides between the header and the first data type, having an end of file marker at a terminus thereof.

The invention provides a method and a system for transmitting files with large data sizes. The method for transmitting the files with large data sizes comprises the following steps of step one, processing the files to be transmitted in blocks at a transmitting end of file transmission and generating first verification information of transmission sub-file blocks while generating the transmission sub-file blocks; step two, transmitting the transmission sub-file blocks and the first verification information to a receiving end; step three, generating second verification information every time data of verified bytes agreed with the transmitting end at the receiving end; step four, comparing the second verification information with the received first verification information, and transmitting corresponding information to the transmitting end; step five, after the transmitting end receives the information transmitted by the receiving end, enabling the transmitting end to transmit obtained requests of receiving positions of the files at the receiving end when last transmission is stopped or finished; and step six, judging whether the receiving positions of the files reach the end of the files to be transmitted according to the information returned by the receiving end.

Methods, systems and computer program products for storing data that use a rolling window file that maintains a defined file size while sequentially replacing an oldest portion of previously stored data with new data are provided. The rolling window file operates without the use of a wrap buffer implemented through manipulation of a current offset pointer by moving a first storage region in a sequentially linked plurality of storage regions associated with the rolling window file to become the new last (or end of file) storage region associated with the file. Newly received data may then be stored in the newly designated end of file storage region. Operations moving the first region in the linked sequence to the last position can repeat theoretically indefinitely as new data is received. Accordingly, a fixed file length saving only the most recent data may be provided without ever reallocating the regions, such as clusters of data under a file access table type file systems, that are originally associated with the rolling window file.

A computer-implemented method for compressing a first stream of data, the first stream of data comprising a plurality of input words. The computer-implemented method includes receiving the plurality input words, and adaptively compressing the plurality of input words into a plurality of compression codes. The computer-implemented method further includes outputting the plurality of compression codes upon encountering an end-of-file signal in the first stream of data, wherein the plurality of compression codes are fewer in number than the number of unique bit patterns requiring unique compression codes under LZW (Lempel Ziv & Welch) compression.

In a data processing apparatus which forms a file having a plurality of pages on the basis of image data obtained by sequentially reading images on a plurality of originals, forms a file having the attribute information and end information representing the end of the file for each page, and transmits the file, when file creation processing is interrupted midway during file creation, the end information of the file is added at the interrupt time, thereby transmitting a normal file. In addition, data to be formed into one file is divided into a plurality of blocks in units of pages, and a plurality of files each having end information are sequentially transmitted. At this time, information for allowing the receiving side to convert the divided files into one file is transmitted. Furthermore, a plurality of data stored in a memory are appropriately selected, one file having a plurality of pages is formed on the basis of the selected data, and a file having the attribute information and file end information for each page is formed and transmitted.

A system and method for efficiently performing simultaneous access of files in a clustered file system. A cluster of nodes is coupled to a data storage medium. A first node executes a first thread with write operations for a given file. A second node executes a second thread with read operations for the given file. The first thread is appending the given file. In response, the first node requests a write lock range between an end-of-file for the given file to a highest possible endpoint. If a prediction determines the second thread may request read locks after the range it is currently reading, then the method enables the locks to be efficiently transferred from the first node to the second node before they are required on the second node, allowing the reading second node to proceed with fewer delays.

The invention provides a method and a device for recovering a portable document format (PDF) file. The method comprises the following steps: searching a file header fragment and an end-of-file fragment on storage medium according to a file header feature markup and an end-of-file feature markup; searching the end-of-file fragment matched with information in the file header fragment according to the information in the file header fragment and the information in the end-of-file fragment; taking the matched file header fragment and end-of-file fragment as complete fragments of a to-be-recovered file, so as to recover the to-be-recovered file according to the complete fragments. Structure characteristics of the PDF file can be combined by using the method, correct recovery of the PDF file is achieved, the recovery effect is improved, and use of a user is facilitated.

A “fast approximation” of compression of current data involves using information obtained from an earlier compression of similar data. It overcomes the iterative process of discovering a unique set of optimal symbols. Representatively, a dictionary of symbols corresponding to original data from an earlier compressed file is extracted. Original bits are then obtained from the symbols. Sequences of the original bits are identified in the current data of a current file under consideration. A new bit stream for the current file is created from the original bits and according to the symbols they represent. Every occurrence of the symbols is counted in the new bit stream and a path-weighted Huffman tree is created from the counted occurrences. A coding from the Huffman tree ensues, along with an end-of-file marker. The latter is stored in a new compression file, including the dictionary earlier extracted from the earlier compressed file.

The invention relates to a data processing method, a memory controller and a memory storage device. The data processing method is used for processing data in the memory storage device which is provided with a plurality of solid blocks. The method comprises the following steps of dividing the solid blocks into a data area, a vacant area and a system area, and configuring a plurality of logic addresses, wherein the logic addresses are formatted into a file configuration sheet area with a plurality of cluster entry fields, a root directory area with a plurality of directory entry fields, and a file area with a plurality of clusters; starting to store a communication file from the Kth cluster of the file area; recording a file description block of the corresponding communication file in the Mth directory entry field; and storing an end-of-file code in the cluster entry field of the last cluster stored in the corresponding communication file, wherein K and M are positive integers which are respectively greater than 1. The method is used for preventing the communication file from being overwritten after the communication file is formatted in the memory storage device.

The invention discloses a file transparent encryption method for adding an end-of-file. An end part is added on a file stored on a magnetic disk and a file-encrypted mark is placed. The algorithm of the file encryption can use the algorithm of any block encryption or byte encryption. The scheme is suitable for the encryption of all electronic files and is irrelevant to the formats of the electronic files.

Augmenting data files in a repository of an append-only file system comprises maintaining metadata corresponding to each data file for tracking a logical end-of-file (EOF) for each data file for appending. A global versioning mechanism for the metadata allows selecting the current version of the metadata to read for performing an append job for a set of data files. Each append job comprises multiple append tasks. For each successful append job, the global versioning mechanism increments a valid metadata version to use for each data file appended. Said valid metadata version indicates the logical EOF corresponding to a new physical EOF for each of the data files appended.

A system and method for presenting document records to a user through a display interface, comprising means for processing data of the first type through a first applet and data of the second type through a second applet and separately extracting data of the two different types using the separate applets. The user interface provides means for selecting a data file from a plurality of data files, displaying the merged and formatted processed first and second data, and managing a plurality of data files with the host application. Each record on the list may be individually selected, comprising providing at least two distinct categorization inputs from the user, providing an indicia in the record list to indicate a respective record classification, and providing means for selectively processing the records according to a respective classification thereof. The data file employs a standard image format file with an embedded index pointer to segregate two data types. A first data type, preferably an image, is referenced by the index pointer and is located near the terminus of the file. A second data type, for example text, appears immediately after the file header which includes the index pointer, and preferably terminates with an end of file marker. Thus, the single file may be read by both a standard image file reader, and a standard text reader, without parsing or segregation. The two data types are preferably text and image data, and the data file is preferably a tagged image format file (TIFF) file with Group-4 image compression.

Provided is a watermarking embedding and authentication method of positioning PDF electronic invoice falsification, comprising: A, watermarking generation based on a file reading page, concretely including blocking a reader page, parsing a code page file structure, generating authentication information, and generating watermarking in dependence on the authentication information; B, watermarking embedding based on file codes; C, updating of a cross reference and an end-of-file; and D, generation of a PDF electronic invoice file with watermarking, including performing E authentication information reconstruction, authentication information extraction and F falsification authentication on a PDF electronic file to be detected, and F falsification authentication including falsification authenticity determination and falsification positioning and marking. The method can guarantee invisibility of watermarking, and meanwhile control file increment within 1%. The method has the characteristics of high falsification detection accuracy, and low false drop rate, and can effectively resist replacing, adding, deleting, etc.

The issuance end up loads files to be issued to seed server, and commits information including file list, terminal etc. needed to issue to point-to-point server. The point-to-point server obtains tor information of file from the seed server. Then, the point-to-point server sends the tor information of file to the receiving end of file. After receiving tor information, the receiving end looks up available subsections of file, and executes downloading on nodes in LAN first based on data provided by tor information. If nodes in LAN have no usable file, then the receiving end connects seed server to download subsections of file till all subsections are downloaded completely so as to assemble a correct file. The invention uploads the file to be issued to seed server in order to guarantee that the file is existed, integrated, and correct on the seed server. The invention ensures reliability and stability of file transmission, i.e. 100% transmission guarantee.

The invention provides an acquisition method and a device of a PDF document directory, wherein the method comprises: analyzing the system structure of a PDF document, acquiring the intersection index table of the PDF document; retrieving the intersection index table, obtaining an end-of-file TRAILER dictionary; analyzing the end-of-file TRAILER dictionary, obtaining a directory book CATALOG dictionary corresponding to a key value ROOT; retrieving the directory book CATALOG dictionary, obtaining the directory of the PDF document. The solution of the invention can conveniently, quickly and accurately extract the directory of the PDF document in high efficiency and is convenient for editing and modifying the extracted directory of the PDF document subsequently.

A method and system for combining, communicating, storing and / or separating image data and non-image data. The method involves a computer programmed to identify an end-of-file (EOF) marker of an image file, and being programmed to add the non-image data to the image file after the EOF marker.

Systems and method of media streaming using the Real Time Streaming Protocol (RTSP) with reduced delays in accordance with embodiments of the invention are disclosed. In one embodiment of the invention, a network client includes memory containing a media decoder application and a client application and a processor, where the client application configures the processor to receive portions of streamed media and buffer the received portions of streamed media in the media buffer, provide portions of streamed media buffered in the media buffer to the media decoder application for decoding once a buffering criteria has been met, receive an end of file message, and provide the remaining streamed media buffered in the media buffer to the media decoder application for decoding in response to the end of file message, wherein the media decoder application configures the processor to decode portions of streamed media.

Implementations provide a structure for low-latency live-video streams using existing content delivery networks. An example method includes creating, at the start of a broadcast stream, a playlist forthe broadcast stream that identifies at least two segment files. The content of each of the segment files is a table header. The method also includes transmitting the playlist and each of the segmentfiles to a cache server, obtaining the video broadcast stream as a series of frames, and transmitting each frame in the series of frames to the cache server using an HTTP chunk transfer protocol, each frame being associated with, and written to, a first segment file identified in the playlist. When a frame in the broadcast stream is a break frame, the method includes transmitting an end of file marker for the first segment file and adding a video header for the break frame before it is transmitted.

The invention provides an acquisition method and device of a PDF (Portable Document Format) documentation comment. The method comprises the following steps: analyzing a system structure of a PDF document, and obtaining a cross index table of the PDF document; retrieving the cross index table to obtain an end-of-file Trailer dictionary; analyzing the end-of-file Trailer dictionary to obtain a Catalog dictionary corresponding to key value Root; retrieving the Catalog dictionary to obtain a page dictionary of the PDF document, wherein the page dictionary comprises a PDF document page; and retrieving the page dictionary of the PDF document to obtain a page comment of the PDF document. The scheme of the invention can conveniently, accurately and efficiently extract the comment in the PDF document, and brings convenience for the user to carry out subsequent processing on the extracted comment.

A method and system for combining, communicating, storing and / or separating image data and non-image data. The method involves a computer programmed to identify an end-of-file (EOF) marker of an image file, and being programmed to add the non-image data to the image file after the EOF marker.

The invention discloses a space file transmission method based on a quick negative acknowledgement (NAK), belonging to the technical field of satellite communication. The space file transmission method comprises the following steps that: connection between a file sending end and a file receiving end is established through request / response interaction; the sending end transmits a data packet to the receiving end; transmitted data ends in an EOF (End of File) command frame; the receiving end feeds back an FIN command frame after transmission of all data packets is successfully completed; after the sending end completes transmission of the data packets, the receiving end feeds back a packet supply request NAK and starts an NAK timer if checking that some data packets are not received correctly; the NAK is quickly retransmitted if the timer still does not receive the supplied packet retransmitted by the sending end in the expiry date; and the sending end feeds back a file transmission end acknowledgement after receiving the FIN command frame. A command error-correcting mechanism, an NAK quick retransmission mechanism and an NAK frame structure compression mechanism are adopted; a space link environment can be effectively adaptive; the file transmission handling capacity and the file transmission efficiency are improved; and the space file transmission method disclosed by the invention has the advantages of being short in file transmission time and high in handling capacity.

A method and system for combining, communicating, storing and / or separating image data and non-image data. The method involves a computer programmed to identify an end-of-file (EOF) marker of an image file, and being programmed to add the non-image data to the image file after the EOF marker.

The status of the fragment of the magnetic disk can be calculated out rapidly by the invented method and the system. Based on the starting position of the file allocation table and the length of each cluster, the invented method determines whether each cluster possesses the end-of-file mark or whether the continuous segment is pointed to the adjacent area. Thus, the total amount of the not continuous cluster can be obtained to decide the fragment rate of the magnetic disk.

Media files such as MPEG-4 files are fragmented to allow for media and live media creation and delivery. A MPEG-4 standard description box includes synchronization information, end of file information, and chapter information to provide signaling information for near live playback of fragments. Playback can begin upon receiving a first MPEG-4 file fragment. A second MPEG-4 file fragment can be requested using information included in the first MPEG-4 file fragment.

An improved technique involves providing file system shrink capability by shrinking the size of the volume file in which an upper deck file system is stored. Along these lines, a data storage system, upon receiving a request to shrink an upper deck file system, determines a new address in the upper deck file system, based on an amount the upper deck file system is to be shrunk, to which the end-of-file (EOF) pointer of the volume file will point. The new address will have a smaller distance from the address of the file pointer than the original address to which the EOF pointer points. The data storage system then identifies nonempty data blocks of the upper deck file system that have logical addresses having a larger distance from the address of the file pointer than the second logical address.