55 results about "Page break" patented technology

Dynamic pagination for electronic documents, such as electronic books, is disclosed. In one embodiment, a computer-implemented method first processes a document made up of at least text, as a number of segments. Second, the method determines a number of page breaks within a predetermined segment. This segment, for example, may be entered into the memory of a viewing device, such as an electronic book device. Third, the method renders a predetermined page within the predetermined segment, and finally displays the predetermined page. For example, the page can be displayed on a display device such as a flat-panel display of an electronic book device.

A method and system for publishing a plurality of books for user access to information includes selecting a plurality of books, converting each book from a publisher's digital form, e.g., by training a tool to detect characteristic features (such as layout, typeface, and hierarchical or organizational features such as chapter headings, captions, drawings and tables), and extracting text or data information of the book tagged with the features. This produces a searchable library database arranged, for example, as an xml database indexed by book structure such that a user may remotely, over the internet or other network, access the database, search desired content, and view an image of a portion of the book with the desired data. The system includes a user registration module to identify an authorized user, and may maintain a personal bookshelf for the user. A search engine may score search results based on their position in the hierarchy or other factors, determining degree of relevance of text or data information located by the search engine. The other factors may include position of located search data in the hierarchy, identification of search data in the user's personal library or in a prior search by the user, or degree of match of data identified in the search. An interface with a commercially available search engine may operate to adapt the search. When provided a search query by a user, it may search for an exact match and score hits for relevance, and in the event an exact match is not found, operate to expand the query and return hits in order of rank together with an indication of the expanded search. The user may thus ascertain a degree of likely relevance of returned text or data information. The relational database may include hyperlinks to section headings and related data passages, such that a user accessing a page of a book may immediately view related data and context of a page. The relational database is indexed by logical subunits of the book such that expanded searches for Boolean combinations or proximity of elements span page breaks of book text to identify all instances of the desired search data. The search engine may expand a search if all hits have low ranking, and may suppress hits of low ranking when the search produces hits of high ranking. In further embodiments, the search engine may search tables, drawings and formulae of the converted book file.

A system and method for paginating objects, such as graphical images, within a predefined space, such as a viewable or printed page, is provided. The system and method includes substantially evenly distributing graphical images on a selected number of pages. Alternately, the system and method may determine remainders based on supplied numbers of graphical images per page and total number of pages, and redetermine and reassign depending upon the remainders, or may employ a page layout technique using scoring to establish a best layout for available graphical images and assign graphical images to pages using the page layout technique, or may determine pagination based on expected viewing conditions. The system and method may also receive specific hard page breaks establishing chapters and compute soft page breaks based on certain criteria.

A computer implemented method, apparatus, and computer program product for resolving inter-page nodes in flow diagrams is presented. In one embodiment, an inter-page node in a flow diagram is identified. An inter-page node is a node laid out on a page break in a multi-page flow diagram. A set of candidate pages is formed. A bid for each page in a set of candidate pages is requested from each policy in a set of page break policies. A page is selected from the set of candidate pages based on bids received from the set of page break policies. A value of each bid indicates a level of suitability of each page in the set of candidate pages. The inter-page node located on the page break is moved to a new location on the selected page. The new location on the selected page is located off of all page breaks for the flow diagram.

On-line or computer based document generation and consumption has become as common, or more so, than paper based document generation and consumption. With the move away from paper there is no longer the physical restriction of the paper on which a document may be printed. It is still desirable, however, to break documents into readable pages. We allow a selection of logical page breaks at locations that are deemed convenient, also allow for selection of approximate page dimensions for pages within each logical section. Because these pages are approximate, pagination is less computationally expensive than fixed pagination. Moreover, many of the appearance problems that plague fixed pagination dissolve.

In one aspect of the present invention, page breaks are identified in the following manner. A set of ink data and a document description are processed by a variety of scoring methods, each of which generates a score for each possible insertion point in the ink. These scores are combined to produce a ranked list of hypothesized page breaks for the corresponding ink data. This ranked list is then used either to insert page breaks automatically using a predefined threshold to determine a cut-off in the list; or to present, on-line, to a human for verification / approval; or a mixture of the two based on two thresholds: one for automatic insertion and the other for human verification. It is to be understood not all scoring methods need be used, that is, one or more of the scoring methods may be used as needed.