CA2435731C - System and method for constraint-based document generation - Google Patents
System and method for constraint-based document generation Download PDFInfo
- Publication number
- CA2435731C CA2435731C CA002435731A CA2435731A CA2435731C CA 2435731 C CA2435731 C CA 2435731C CA 002435731 A CA002435731 A CA 002435731A CA 2435731 A CA2435731 A CA 2435731A CA 2435731 C CA2435731 C CA 2435731C
- Authority
- CA
- Canada
- Prior art keywords
- document
- constraints
- specifying
- constraint
- electronically
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/103—Formatting, i.e. changing of presentation of documents
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F40/00—Handling natural language data
- G06F40/10—Text processing
- G06F40/166—Editing, e.g. inserting or deleting
- G06F40/186—Templates
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
Abstract
What is disclosed is a system and method for specifying a custom document as a constraint satisfaction problem (CSP) to create the specified document using existing constraint solving algorithms wherein the document, its content components, and its layout requirements as elements of a constraint satisfaction problem which when solved, results in an automated document layout for the set of content components. This enables an easier (i.e., automated) custom document creation process while providing a wider array of output documents.
Description
SYSTEM AND METHOD FOR CONSTRAINT-BASED DOCIJIVIENT
GENERATION
Field of the Invention The present invention is directed to systems and methods to find document components and assemble them into a custom document such as a variable data document and, in particular, those systems and methods which use constraint-based approaches wherein the document, its content, components, and its requirements are expressed as elements of a constraint satisfaction problem.
Background of the Inventioin Custom documents are documents that are personalized or tailored in some way to the particular user of the document. Two growing applicaitions of custom documents are in the domain of variable data printing, as well as in web personalization.
In traditional variable data applications the creation of a custom document is accomplished by an expert in graphic arts, databases, layout, document design, etc.. This expert document creator develops an overall layout for the document that includes slots for the variable data. The creator also finds or creates appropriate content pieces, and specifies rules for how to fill in the variable slots with this content, or places the content in a database and then links the slots to particular fields in the database.
The variable data application then creates a document for each customer by inserting the data for the customer into its linked slot. These types of templates are typically called "lick and stick", because the template has "art holes" which are defined by the document creator, and then the variable data is placed into those art holes to form different instances of the document. The resulting set of documents is typically quite similar: each variable slot has one piece of content of about the same size and the general layout is the same for all instances, regardless of the available content pieces. Thus, the traditional 'variable data template' not only requires extensive time and expertise from the document creator, but it also does not respond dynamically to varying amounts or types of content pieces, or to restrictions imposed by the variable content.
In the domain of web documents and web personalization, the focus is often not on a dynamic document layout per se but rather on dynamic data. The assumption is that the document template is pre-determined and the challenge is to find the right data at the right time. For instance, dynamic web documents are typically formed by embedding "scripts" (i.e., programs) into the HTML page. These scripts are then interpreted by the web server. This enables certain elements of the document (e.g., a weather reading) to be inserted or created at the time of document display. This approach can only produce documents according to the underlying program. In order to achieve different results, the program must be changed and thus this approach is not truly dynamic. In web personalization applications, much of the focus is on user profiling and understanding what e-commerce customers are doing online so that you can provide the appropriate information: Again, the focus is on finding the appropriate information, not on laying it out differently based on what is found. The techniques used to create dynamic web pages often involve writing specific scripts or programs that can be embedded in web pages and interpreted by the web server. This approach lacks in generality, introduces restrictive platform dependencies, and can be extremely difficult and expensive to maintain.
Traditional creation of custom documents such as variable data documents requires expertise in many areas such as graphic arts and databases and is a time consuming process. With the ever-increasing amount of information in the digital world and the amount of un-trained users producing documents, old publishing tools often prove cumbersome and demanding whereas present dynamic digital environments demand tools that can reproduce both the contents and the layout automatically tailored to personal needs and which can enable novices to easily create such documents.
In the realm of custom document creation, what is needed in the arts is a way to automatically select document content and lay it out into a fiiial document, without relying on expert graphic artists, or using specialized scripts that are embedded in an HTML file.
Known methods for automated creation of documents have focused more on particular types of documents, and not on modeling the problem in a general way in order to address all types of documents. Existing work provides methods for creating diagrams (see Dengler, E. Friedell, M., Marks, J., Constraint-Driven Diagram Lavout, Proceedings
GENERATION
Field of the Invention The present invention is directed to systems and methods to find document components and assemble them into a custom document such as a variable data document and, in particular, those systems and methods which use constraint-based approaches wherein the document, its content, components, and its requirements are expressed as elements of a constraint satisfaction problem.
Background of the Inventioin Custom documents are documents that are personalized or tailored in some way to the particular user of the document. Two growing applicaitions of custom documents are in the domain of variable data printing, as well as in web personalization.
In traditional variable data applications the creation of a custom document is accomplished by an expert in graphic arts, databases, layout, document design, etc.. This expert document creator develops an overall layout for the document that includes slots for the variable data. The creator also finds or creates appropriate content pieces, and specifies rules for how to fill in the variable slots with this content, or places the content in a database and then links the slots to particular fields in the database.
The variable data application then creates a document for each customer by inserting the data for the customer into its linked slot. These types of templates are typically called "lick and stick", because the template has "art holes" which are defined by the document creator, and then the variable data is placed into those art holes to form different instances of the document. The resulting set of documents is typically quite similar: each variable slot has one piece of content of about the same size and the general layout is the same for all instances, regardless of the available content pieces. Thus, the traditional 'variable data template' not only requires extensive time and expertise from the document creator, but it also does not respond dynamically to varying amounts or types of content pieces, or to restrictions imposed by the variable content.
In the domain of web documents and web personalization, the focus is often not on a dynamic document layout per se but rather on dynamic data. The assumption is that the document template is pre-determined and the challenge is to find the right data at the right time. For instance, dynamic web documents are typically formed by embedding "scripts" (i.e., programs) into the HTML page. These scripts are then interpreted by the web server. This enables certain elements of the document (e.g., a weather reading) to be inserted or created at the time of document display. This approach can only produce documents according to the underlying program. In order to achieve different results, the program must be changed and thus this approach is not truly dynamic. In web personalization applications, much of the focus is on user profiling and understanding what e-commerce customers are doing online so that you can provide the appropriate information: Again, the focus is on finding the appropriate information, not on laying it out differently based on what is found. The techniques used to create dynamic web pages often involve writing specific scripts or programs that can be embedded in web pages and interpreted by the web server. This approach lacks in generality, introduces restrictive platform dependencies, and can be extremely difficult and expensive to maintain.
Traditional creation of custom documents such as variable data documents requires expertise in many areas such as graphic arts and databases and is a time consuming process. With the ever-increasing amount of information in the digital world and the amount of un-trained users producing documents, old publishing tools often prove cumbersome and demanding whereas present dynamic digital environments demand tools that can reproduce both the contents and the layout automatically tailored to personal needs and which can enable novices to easily create such documents.
In the realm of custom document creation, what is needed in the arts is a way to automatically select document content and lay it out into a fiiial document, without relying on expert graphic artists, or using specialized scripts that are embedded in an HTML file.
Known methods for automated creation of documents have focused more on particular types of documents, and not on modeling the problem in a general way in order to address all types of documents. Existing work provides methods for creating diagrams (see Dengler, E. Friedell, M., Marks, J., Constraint-Driven Diagram Lavout, Proceedings
2 of the 1993 IEEE Symposium on Visual Languages, pages 330-335, Bergen, Norway, 1993), or multimedia presentations (see Rousseau, F., Garcia-Macias, A., Valdeni de Lima, J., and Duda, A., User Adaptable Multimedia Presentations for the WWW, Electronic Proceedings from the $"' International World Wide Web Conference, 1999), or flowcharts and yellow pages (see Graf, W. H., The Constraint-Based Layout Framework LayLab and Apblications, Electronic Proceedings of the ACM Workshop on Effective Abstractions in Multimedia, 1995). Others have explored automating the process of web document layout (see Kroener, A., The Design Composer: Context-Based Automated Layout for the Internet, Proceedings of the AAAI Fall Symposium Series: Using Layout for the Generation, Understanding, or Retrieval of Documents, 1999). None of the existing automated approaches provide a formalized, constraint-satisfaction formulation of the document creation process, nor do they include the selection of content in their automated process. Furthermore, existing automated approaches concentrate solely on a single type of document.
What is needed in the arts is a way to eliminate some of the traditional limitations of custom document creation by providing a methodology that supports a flexible and efficient assembly of document components resulting in truly dynamic and personalized documents.
Summary of the Invention What is disclosed is a system and method for specifying a custom document as a constraint satisfaction problem (CSP) to create the specified document using existing constraint solving algorithms wherein the document, its content components, and its layout requirements as elements of a constraint satisfaction problem which when solved, results in an automated document layout for the set of content components.
This process enables an easier (i.e., automated) custom document creatio:ri process, while also providing a wider array of output documents than is possible today.
The document is expressed as a template made up of variables, values, and constraints. An instance of that template is then created, resulting in a set of content and a layout of that content, by using one of a set of well-known constraint satisfaction algorithms. The present invention described herein is the formulation of document
What is needed in the arts is a way to eliminate some of the traditional limitations of custom document creation by providing a methodology that supports a flexible and efficient assembly of document components resulting in truly dynamic and personalized documents.
Summary of the Invention What is disclosed is a system and method for specifying a custom document as a constraint satisfaction problem (CSP) to create the specified document using existing constraint solving algorithms wherein the document, its content components, and its layout requirements as elements of a constraint satisfaction problem which when solved, results in an automated document layout for the set of content components.
This process enables an easier (i.e., automated) custom document creatio:ri process, while also providing a wider array of output documents than is possible today.
The document is expressed as a template made up of variables, values, and constraints. An instance of that template is then created, resulting in a set of content and a layout of that content, by using one of a set of well-known constraint satisfaction algorithms. The present invention described herein is the formulation of document
3 creation as a constraint satisfaction problem and the application of existing constraint satisfaction algorithms to automatically create the desired output document, the combination of which is heretofore unknown in the arts. The present method of document composition comprises the steps of; specifying problem variables by identifying zero to n document areas which have associated constraints and at least 1 document parameter that can be changed; specifying value domains for each variable, by identifying either content pieces appropriate for the associated document area, or by identifying valid ranges for the associated document parameter;; specifying layout and/or content constraints which further constrain the valid values of the document parameter and/or document area variables; optionally specifying dynamic constraints that are added/deleted as problem solving occurs; determining a layout for the document such that the values chosen for the document parameters and document areas pass all of the specified constraints according to one of a plurality of existing constraint satisfaction algorithms.
In accordance with one aspect of the present invention, there is provided a system for constraint-based generation of documents comprising:
a processor; and an input device to input user specified constraints;
said processor specifying, in accordance with the inputted user specified constraints, document area problem variables by identifying a plurality of document areas which have associated constraints;
said processor specifying, in accordance with the inputted user specified constraints, document parameter problem variables by identifying document parameters that can be changed;
said processor specifying document area value domains for each document area problem variable by identifying content pieces appropriate for the document areas having associated constraints;
said processor specifying document parameter value domains for each document parameter problem variable by identifying valid ranges for each document parameter;
said processor specifying a layout constraint which further constrains the document parameter value domains;
In accordance with one aspect of the present invention, there is provided a system for constraint-based generation of documents comprising:
a processor; and an input device to input user specified constraints;
said processor specifying, in accordance with the inputted user specified constraints, document area problem variables by identifying a plurality of document areas which have associated constraints;
said processor specifying, in accordance with the inputted user specified constraints, document parameter problem variables by identifying document parameters that can be changed;
said processor specifying document area value domains for each document area problem variable by identifying content pieces appropriate for the document areas having associated constraints;
said processor specifying document parameter value domains for each document parameter problem variable by identifying valid ranges for each document parameter;
said processor specifying a layout constraint which further constrains the document parameter value domains;
4 said processor specifying content constraints which further constrain the document area value domains of the document areas having associated constraints;
said processor determining a document layout based on the processor specifying such that the user specified constraints are satisfied; and said processor generating a document in accordance with the determined layout that satisfies the user specified constraints.
In accordance with another aspect of the present invention, there is provided a method of constraint-based generation of documents comprising:
(a) electronically inputting user specified constraints;
(b) specifying, electronically and in accordance with inputted user specified constraints, document area problem variables by identifying a plurality of document areas which have associated constraints;
(c) specifying, electronically and in accordance with the inputted user specified constraints, document parameter problem variables by identifying document parameters that can be changed;
(d) specifying, electronically, document area value domains for each document area problem variable by identifying content pieces appropriate for the document areas having associated constraints;
(e) specifying, electronically, document parameter value domains for each document parameter problem variable by identifying valid ranges for each document parameter;
(f) specifying, electronically, a layout constraint which further constrains the document parameter value domains;
(g) specifying, electronically, content constraints which further constrains the document area value domains of the document areas having associated constraints;
(h) determining, electronically, a document layout based on the electronically specifying such that the user specified constraints are satisfied; and (i) generating, electronically, a document in accordance with the determined layout that satisfies the user specified constraints.
Other objects, advantages, and salient features of the invention will become apparent from the detailed description which, taken in conjunction with the drawings, disclose the preferred embodiments of the invention.
4a Description of the Drawings The preferred embodiment and other aspects of the invention will become apparent from the following detailed description when taken in conjunction with the accompanying drawings which are provided for the purpose of describing the invention and not for the limitation thereof, in which:
Figure 1 illustrates a document template which specifies that there are two areas that should be filled with content: areaA and areaB, and which also specifies that the positions and sizes of areaA and areaB can be changed.
Detailed Description of the Invention What is disclosed is a system and method for specifying a custom document as a constraint satisfaction problem (CSP) to create the specified document using existing constraint solving algorithms wherein the document, its content components, and its 4b layout requirements as elements of a constraint satisfaction problem which when solved, results in an automated document layout for the set of content cornponents.
This process enables an easier (i.e., automated) custom document creation process, while also providing a wider array of output documents than is possible today.
The document is expressed as a template made up of variables, values, and constraints. An instance of that template is then created, resulting in a set of content and a layout of that content, by using one of a set of well-known constraint satisfaction algorithms e.g., backtracking, forward checking; as taught in Nadel, Tree Search and Arc Consistency in Constraint Satisfaction Algorithms, Search in Artificial Intelligence, edited by L. Kanal and V. Kumar, Springer-Verlag, 1988, 287-342. The present invention described herein is the formulation of document creation as a constraint satisfaction problem, and the application of existing constraint satisfaction algorithms to automatically create the desired output document, the combination of which is heretofore unknown in the arts.
In particular, a document template is represented as a constraint satisfaction problem (CSP), and therefore contains a set of variables, a value domain for each variable, and a set of constraints on those variables and values.
In this invention, the areas of the document to be filled with content are modeled as problem variables, as are any parameters of the document that can be changed. As an example, consider the document template shown in Fig. 1. The template specifies that there are two areas that should be filled with coritent: areaA and areaB. The template also specifies that the positions and sizes of areaA and areaB can be changed.
Thus, the problem variables for this example are: areaA, areaB, areaA-topLeftX, areaA-topLeftY, areaB-topLeftX, areaB-topLeftY, areaA-width, areaA-heigh,t, areaB-width, areaB-height.
The constrairit satisfaction problem formulation further specifies that each problem variable has a value domain consisting of the possible values to assign to that variable. This invention teaches that for variables that are document areas to be filled with content (e.g. areaA and areaB of Fig. 1), the value domains are the content pieces that are applicable to each area. For variables that are document parameters, the value domains are discretized ranges for those parameters, so that each potential value for the parameter appears in the value domain. The initial value domain is be set up to be some default range e.g., [1..MAXIldTT]. For variables whose value domains are content pieces, the default domain is set up to be all possible content pieces in the associated content database, which is specified in the document template.
The constraints specify relationships between variables and/or values that must hold in order for the resulting document to be valid. Constraints may be unary (apply to one variable), binary (apply to two variables/values), and/or n-ary (apply to n values/variables), and in our invention are entered by the user as part of the document template. An example of a unary constraint in the document domain is: areaA
must contain an image of a castle. An example of a binary constraint is: areaA-topLeftY +
areaA-height < areaB-topLeftY. If we had another variable (areaC), an example of a 3-ary constraint is: areaA-width + areaB-width > areaC-width. In a variable data application of this invention (one of many possible applications), the constraints would also refer to customer attributes e.g., areaA must contain ari image that is appropriate for customerl.age.
Any one of the known existing constraint solving algorithms for discrete constraint satisfaction problems is then applied to create the final output document. To follow through our example with one such existing algorithm, we consider a simple backtracking algorithm. Our example problem variables and value domains are:
AreaA {skierl.jpg, skier2.jpg, golf.jpg, snorkel.jpg, snorkel.txt, ski.txt, golf.txt}
AreaB {skierl.jpg, skier2.jpg, golf.jpg, snorkel.jpg, snorkel.txt, ski.txt, golf.txt}
AreaA-topLeftX {0..500}
AreaA-topLeftY {0..750}
AreaB-topLeftX {0..500}
AreaB-topLeftY {0..500}
AreaA-width {1..500}
AreaA-height {1..750}
AreaB-width {1..500}
AreaB-height { 1..750}
The unary constraints for our example problem are:
Cl: areaA must contain an image of a skier C2: areaB must contain text about skiing.
We also have one binary constraint:
C3: areaA-topLeftY + areaA-height < areaB-topLeftY.
The constraint solver first achieves 'node-consistency', which runs the unary constraints Cl and C2 against each variable's value domain, eliminating any values that don't satisfy the unary constraints. After node consistency, our problem variables and value domains are as follows (note that the value domains for areaA and areaB now have only the content pieces that meet the unary constraints):
areaA {skierl jpg, skier2 jpg }
areaB {ski.txt}
areaA-topLeftX {0..500}
areaA-topLeftY {0..750}
areaB-topLeftX {0..500}
areaB-topLeftY { ..500}
areaA-width { 1..500}
areaA-height {1..750}
areaB-width { 1..500}
areaB-height (1.3501 The constraint solver then iteratively tries a value for each variable in succession, checking the binary (and any n-ary) constraints after each assignment, and backtracks to a different value if the assignment violates any constraints. Note that a constraint is considered to be trivially satisfied if any of its component values is not yet instantiated.
Thus it isn't until areaA-topLeftY, areaA-height, AND areaB-topLeftY all have values that there is a possibility that C3 is violated.
Thus, a backtracking algorithm would iteratively assign:
areaA = skierl .jpg areaB = ski.txt areaA-topLeftX = 0 areaA-topLeftY = 0 areaB-topLeftX = 0 areaB-topLeftY = 0 areaA-width = 1 areaA-height = 1 at which point when it checks constraint C3, it will find that areaA-topLeftY
(0) + areaA-height (1) is not less than areaB-topLeftY (0), and thus it will backtrack to choose the next possible value for areaA-height. Eventually it will backtrack to a point at which C3 is not violated, and thus will arrive at a valid solution. C)ne can furthermore envision many more constraints that can be added to the problem to ensure a feasible looking output document (e.g., minimum widths for the content areas, etc.). The novelty of the invention is in the modeling of the document template as a constraint satisfaction problem, so that the document creator can specify any set of variables/values/constraints, and then a constraint solving algorithm can automatically create the final output document.
A further extension of the herein taught method for representing a document template as a constraint satisfaction problem and the rnethod for creating the final document by applying a constraint solving algorithm is t:hat the model can be further extended to encompass more complicated documents by using the well-known dynamic constraint satisfaction model and solving algorithms as taught in Mittal and Falkenhainer Dvnamic Constraint Satisfaction Problems, Proceedings of AAAI 1990, pages 25-32. In dynamic constraint satisfaction, the set of variables, values, and constraints can change as the problem solving progresses. That is, given the cunent choice of values, other constraints might become active and/or certain variables and/or values might be added or deleted from the problem. In the context of automated document creation, this extension enables document content components to specify their own sets of constraints (e.g., "I'm an image, and my width cannot be less than 350 pixels", or "I'm an image of a cigarette advertisement, and I cannot be placed on the same page as any content from the American Heart Association"). Similarly, dynamic constraints can be added to the problem that specify the use of other problem variables (e.g., "if we choose content for areaA whose width > 300 pixels, then we must delete areaC from the problem").
These examples are meant to be illustrative and not comprehensive of all possible dynamic document constraints. In general, any constraint that involves add.ing/deleting document areas, or that is added/deleted as a consequence of content choices made during constraint solving is what we consider to be a part of the dynamic extension to our document constraint solving model.
We have furthermore implemented and herein describe our particular implementation (one of many possible implementations) of this dynamic document constraint solving model. We have combined the well-known backtracking algorithm with a linear constraint solver as taught in Badros G., Borning A., The Cassowary Linear Arithmetic Constraint Solving Algorithm: Interface and Implementation, University of Washington Technical Report, 98-06-04, 1998, to enable dynam.ic addition/deletion of constraints and problem variables during problem solving.
We model the document area variables (areaA, areaB) as variables for the backtracking algorithm, and further model the layout related variables (areaA-topLeftX, areaA-topLeftY, areaA-width, areaA-height, etc.) as sub-variables to the document area variables. As each top-level variable is instantiated with a value, we add its sub-variables to the linear constraint solver, and we also add any constraints associated with the chosen content value to the linear constraint solver. To continue our example, when we choose value skierl.jpg for areaA, skierl.jpg might have associated constraints that say it cannot be scaled, that its width and height must be its original width and height.
Thus, we add the following constraints to the linear constraint solver:
C4: areaA-width = 175 C5: areaA-height = 255 Now in our particular implementation, we call on the linear constraint solver to determine the validity of the chosen value given these new additional layout constraints. 'The linear constraint solver processes these new constraints to see if values can be found for all of the other sub-variables (i.e. areaB-topLeftX, areaB-topLeftY, areaB-width, areaB-height) given this and any other already existing layout constraints. If so, then we continue with our backtracking. If not, then we remove constraints C4 and C5 from the linear constraint solver, and backtrack to a different value for areaA. The solver continues in this way, trying candidate content, adding/removing constraints, and checking the active constraints until all document areas are filled with content and the resulting document satisfies all active constraints.
The present invention has many advantages, for iristance, the ability to specify what a document should look like but not have to specify exactly how such a layout should be accomplished relieves the document creator fror.n having to evaluate different potential layouts and how each might satisfy or not satisfy certain document requirements. Also, it does not require the document creator to have prior knowledge of the document content at the very beginning of the document creation process thereby enabling the creation of more dynamic output documents.
The present system and method also advantageously provides the ability to automate content selection, which is typically not part of the document layout process, i.e., content pieces are selected that satisfy the rest of the document constraints, thereby allowing automatic decisions to be made about which content to include in the document.
This is in contrast to the typical approach of forcing the document creator to select all included content before layout is begun. The present invention also advantageously enables one to define constraints on other aspects of the document such as, for example, the constraint of whatever goes in this area slaould be Tirnes-Roman font-type of size between 8 and 12 or line spacing constraints between differing types of text.
Furthermore, the extension of the representation to a dynamic constraint satisfaction model enables more complicated documents to be represented and automatically created.
It advantageously provides the capability to specify constraints on content items themselves such as, for example, the constraint that content should not be scaled more than 50% or that content cannot be on the same page as a certain advertisement.
While the invention is described with reference to a particular embodiment, this particular embodiment is intended to be illustrative, not limiting. Various modifications may be made without departing from the spirit and scope of the invention as defined in the amended claims. Modifications and alterations will occur to others upon reading and understanding this specification; therefore, it is intended that all such modifications and alterations are included insofar as they come within the scope of the appended claims or equivalents thereof.
said processor determining a document layout based on the processor specifying such that the user specified constraints are satisfied; and said processor generating a document in accordance with the determined layout that satisfies the user specified constraints.
In accordance with another aspect of the present invention, there is provided a method of constraint-based generation of documents comprising:
(a) electronically inputting user specified constraints;
(b) specifying, electronically and in accordance with inputted user specified constraints, document area problem variables by identifying a plurality of document areas which have associated constraints;
(c) specifying, electronically and in accordance with the inputted user specified constraints, document parameter problem variables by identifying document parameters that can be changed;
(d) specifying, electronically, document area value domains for each document area problem variable by identifying content pieces appropriate for the document areas having associated constraints;
(e) specifying, electronically, document parameter value domains for each document parameter problem variable by identifying valid ranges for each document parameter;
(f) specifying, electronically, a layout constraint which further constrains the document parameter value domains;
(g) specifying, electronically, content constraints which further constrains the document area value domains of the document areas having associated constraints;
(h) determining, electronically, a document layout based on the electronically specifying such that the user specified constraints are satisfied; and (i) generating, electronically, a document in accordance with the determined layout that satisfies the user specified constraints.
Other objects, advantages, and salient features of the invention will become apparent from the detailed description which, taken in conjunction with the drawings, disclose the preferred embodiments of the invention.
4a Description of the Drawings The preferred embodiment and other aspects of the invention will become apparent from the following detailed description when taken in conjunction with the accompanying drawings which are provided for the purpose of describing the invention and not for the limitation thereof, in which:
Figure 1 illustrates a document template which specifies that there are two areas that should be filled with content: areaA and areaB, and which also specifies that the positions and sizes of areaA and areaB can be changed.
Detailed Description of the Invention What is disclosed is a system and method for specifying a custom document as a constraint satisfaction problem (CSP) to create the specified document using existing constraint solving algorithms wherein the document, its content components, and its 4b layout requirements as elements of a constraint satisfaction problem which when solved, results in an automated document layout for the set of content cornponents.
This process enables an easier (i.e., automated) custom document creation process, while also providing a wider array of output documents than is possible today.
The document is expressed as a template made up of variables, values, and constraints. An instance of that template is then created, resulting in a set of content and a layout of that content, by using one of a set of well-known constraint satisfaction algorithms e.g., backtracking, forward checking; as taught in Nadel, Tree Search and Arc Consistency in Constraint Satisfaction Algorithms, Search in Artificial Intelligence, edited by L. Kanal and V. Kumar, Springer-Verlag, 1988, 287-342. The present invention described herein is the formulation of document creation as a constraint satisfaction problem, and the application of existing constraint satisfaction algorithms to automatically create the desired output document, the combination of which is heretofore unknown in the arts.
In particular, a document template is represented as a constraint satisfaction problem (CSP), and therefore contains a set of variables, a value domain for each variable, and a set of constraints on those variables and values.
In this invention, the areas of the document to be filled with content are modeled as problem variables, as are any parameters of the document that can be changed. As an example, consider the document template shown in Fig. 1. The template specifies that there are two areas that should be filled with coritent: areaA and areaB. The template also specifies that the positions and sizes of areaA and areaB can be changed.
Thus, the problem variables for this example are: areaA, areaB, areaA-topLeftX, areaA-topLeftY, areaB-topLeftX, areaB-topLeftY, areaA-width, areaA-heigh,t, areaB-width, areaB-height.
The constrairit satisfaction problem formulation further specifies that each problem variable has a value domain consisting of the possible values to assign to that variable. This invention teaches that for variables that are document areas to be filled with content (e.g. areaA and areaB of Fig. 1), the value domains are the content pieces that are applicable to each area. For variables that are document parameters, the value domains are discretized ranges for those parameters, so that each potential value for the parameter appears in the value domain. The initial value domain is be set up to be some default range e.g., [1..MAXIldTT]. For variables whose value domains are content pieces, the default domain is set up to be all possible content pieces in the associated content database, which is specified in the document template.
The constraints specify relationships between variables and/or values that must hold in order for the resulting document to be valid. Constraints may be unary (apply to one variable), binary (apply to two variables/values), and/or n-ary (apply to n values/variables), and in our invention are entered by the user as part of the document template. An example of a unary constraint in the document domain is: areaA
must contain an image of a castle. An example of a binary constraint is: areaA-topLeftY +
areaA-height < areaB-topLeftY. If we had another variable (areaC), an example of a 3-ary constraint is: areaA-width + areaB-width > areaC-width. In a variable data application of this invention (one of many possible applications), the constraints would also refer to customer attributes e.g., areaA must contain ari image that is appropriate for customerl.age.
Any one of the known existing constraint solving algorithms for discrete constraint satisfaction problems is then applied to create the final output document. To follow through our example with one such existing algorithm, we consider a simple backtracking algorithm. Our example problem variables and value domains are:
AreaA {skierl.jpg, skier2.jpg, golf.jpg, snorkel.jpg, snorkel.txt, ski.txt, golf.txt}
AreaB {skierl.jpg, skier2.jpg, golf.jpg, snorkel.jpg, snorkel.txt, ski.txt, golf.txt}
AreaA-topLeftX {0..500}
AreaA-topLeftY {0..750}
AreaB-topLeftX {0..500}
AreaB-topLeftY {0..500}
AreaA-width {1..500}
AreaA-height {1..750}
AreaB-width {1..500}
AreaB-height { 1..750}
The unary constraints for our example problem are:
Cl: areaA must contain an image of a skier C2: areaB must contain text about skiing.
We also have one binary constraint:
C3: areaA-topLeftY + areaA-height < areaB-topLeftY.
The constraint solver first achieves 'node-consistency', which runs the unary constraints Cl and C2 against each variable's value domain, eliminating any values that don't satisfy the unary constraints. After node consistency, our problem variables and value domains are as follows (note that the value domains for areaA and areaB now have only the content pieces that meet the unary constraints):
areaA {skierl jpg, skier2 jpg }
areaB {ski.txt}
areaA-topLeftX {0..500}
areaA-topLeftY {0..750}
areaB-topLeftX {0..500}
areaB-topLeftY { ..500}
areaA-width { 1..500}
areaA-height {1..750}
areaB-width { 1..500}
areaB-height (1.3501 The constraint solver then iteratively tries a value for each variable in succession, checking the binary (and any n-ary) constraints after each assignment, and backtracks to a different value if the assignment violates any constraints. Note that a constraint is considered to be trivially satisfied if any of its component values is not yet instantiated.
Thus it isn't until areaA-topLeftY, areaA-height, AND areaB-topLeftY all have values that there is a possibility that C3 is violated.
Thus, a backtracking algorithm would iteratively assign:
areaA = skierl .jpg areaB = ski.txt areaA-topLeftX = 0 areaA-topLeftY = 0 areaB-topLeftX = 0 areaB-topLeftY = 0 areaA-width = 1 areaA-height = 1 at which point when it checks constraint C3, it will find that areaA-topLeftY
(0) + areaA-height (1) is not less than areaB-topLeftY (0), and thus it will backtrack to choose the next possible value for areaA-height. Eventually it will backtrack to a point at which C3 is not violated, and thus will arrive at a valid solution. C)ne can furthermore envision many more constraints that can be added to the problem to ensure a feasible looking output document (e.g., minimum widths for the content areas, etc.). The novelty of the invention is in the modeling of the document template as a constraint satisfaction problem, so that the document creator can specify any set of variables/values/constraints, and then a constraint solving algorithm can automatically create the final output document.
A further extension of the herein taught method for representing a document template as a constraint satisfaction problem and the rnethod for creating the final document by applying a constraint solving algorithm is t:hat the model can be further extended to encompass more complicated documents by using the well-known dynamic constraint satisfaction model and solving algorithms as taught in Mittal and Falkenhainer Dvnamic Constraint Satisfaction Problems, Proceedings of AAAI 1990, pages 25-32. In dynamic constraint satisfaction, the set of variables, values, and constraints can change as the problem solving progresses. That is, given the cunent choice of values, other constraints might become active and/or certain variables and/or values might be added or deleted from the problem. In the context of automated document creation, this extension enables document content components to specify their own sets of constraints (e.g., "I'm an image, and my width cannot be less than 350 pixels", or "I'm an image of a cigarette advertisement, and I cannot be placed on the same page as any content from the American Heart Association"). Similarly, dynamic constraints can be added to the problem that specify the use of other problem variables (e.g., "if we choose content for areaA whose width > 300 pixels, then we must delete areaC from the problem").
These examples are meant to be illustrative and not comprehensive of all possible dynamic document constraints. In general, any constraint that involves add.ing/deleting document areas, or that is added/deleted as a consequence of content choices made during constraint solving is what we consider to be a part of the dynamic extension to our document constraint solving model.
We have furthermore implemented and herein describe our particular implementation (one of many possible implementations) of this dynamic document constraint solving model. We have combined the well-known backtracking algorithm with a linear constraint solver as taught in Badros G., Borning A., The Cassowary Linear Arithmetic Constraint Solving Algorithm: Interface and Implementation, University of Washington Technical Report, 98-06-04, 1998, to enable dynam.ic addition/deletion of constraints and problem variables during problem solving.
We model the document area variables (areaA, areaB) as variables for the backtracking algorithm, and further model the layout related variables (areaA-topLeftX, areaA-topLeftY, areaA-width, areaA-height, etc.) as sub-variables to the document area variables. As each top-level variable is instantiated with a value, we add its sub-variables to the linear constraint solver, and we also add any constraints associated with the chosen content value to the linear constraint solver. To continue our example, when we choose value skierl.jpg for areaA, skierl.jpg might have associated constraints that say it cannot be scaled, that its width and height must be its original width and height.
Thus, we add the following constraints to the linear constraint solver:
C4: areaA-width = 175 C5: areaA-height = 255 Now in our particular implementation, we call on the linear constraint solver to determine the validity of the chosen value given these new additional layout constraints. 'The linear constraint solver processes these new constraints to see if values can be found for all of the other sub-variables (i.e. areaB-topLeftX, areaB-topLeftY, areaB-width, areaB-height) given this and any other already existing layout constraints. If so, then we continue with our backtracking. If not, then we remove constraints C4 and C5 from the linear constraint solver, and backtrack to a different value for areaA. The solver continues in this way, trying candidate content, adding/removing constraints, and checking the active constraints until all document areas are filled with content and the resulting document satisfies all active constraints.
The present invention has many advantages, for iristance, the ability to specify what a document should look like but not have to specify exactly how such a layout should be accomplished relieves the document creator fror.n having to evaluate different potential layouts and how each might satisfy or not satisfy certain document requirements. Also, it does not require the document creator to have prior knowledge of the document content at the very beginning of the document creation process thereby enabling the creation of more dynamic output documents.
The present system and method also advantageously provides the ability to automate content selection, which is typically not part of the document layout process, i.e., content pieces are selected that satisfy the rest of the document constraints, thereby allowing automatic decisions to be made about which content to include in the document.
This is in contrast to the typical approach of forcing the document creator to select all included content before layout is begun. The present invention also advantageously enables one to define constraints on other aspects of the document such as, for example, the constraint of whatever goes in this area slaould be Tirnes-Roman font-type of size between 8 and 12 or line spacing constraints between differing types of text.
Furthermore, the extension of the representation to a dynamic constraint satisfaction model enables more complicated documents to be represented and automatically created.
It advantageously provides the capability to specify constraints on content items themselves such as, for example, the constraint that content should not be scaled more than 50% or that content cannot be on the same page as a certain advertisement.
While the invention is described with reference to a particular embodiment, this particular embodiment is intended to be illustrative, not limiting. Various modifications may be made without departing from the spirit and scope of the invention as defined in the amended claims. Modifications and alterations will occur to others upon reading and understanding this specification; therefore, it is intended that all such modifications and alterations are included insofar as they come within the scope of the appended claims or equivalents thereof.
Claims (2)
1. A system for constraint-based generation of documents comprising:
a processor; and an input device to input user specified constraints;
said processor specifying, in accordance with the inputted user specified constraints, document area problem variables by identifying a plurality of document areas which have associated constraints;
said processor specifying, in accordance with the inputted user specified constraints, document parameter problem variables by identifying document parameters that can be changed;
said processor specifying document area value domains for each document area problem variable by identifying content pieces appropriate for the document areas having associated constraints;
said processor specifying document parameter value domains for each document parameter problem variable by identifying valid ranges for each document parameter;
said processor specifying a layout constraint which further constrains the document parameter value domains;
said processor specifying content constraints which further constrain the document area value domains or the document areas having associated constraints;
said processor determining a document layout based on the processor specifying such that the user specified constraints are satisfied; and said processor generating a document in accordance with the determined layout that satisfies the user specified constraints.
a processor; and an input device to input user specified constraints;
said processor specifying, in accordance with the inputted user specified constraints, document area problem variables by identifying a plurality of document areas which have associated constraints;
said processor specifying, in accordance with the inputted user specified constraints, document parameter problem variables by identifying document parameters that can be changed;
said processor specifying document area value domains for each document area problem variable by identifying content pieces appropriate for the document areas having associated constraints;
said processor specifying document parameter value domains for each document parameter problem variable by identifying valid ranges for each document parameter;
said processor specifying a layout constraint which further constrains the document parameter value domains;
said processor specifying content constraints which further constrain the document area value domains or the document areas having associated constraints;
said processor determining a document layout based on the processor specifying such that the user specified constraints are satisfied; and said processor generating a document in accordance with the determined layout that satisfies the user specified constraints.
2. A method of constraint-based generation of documents comprising:
(a) electronically inputting user specified constraints;
(b) specifying, electronically and in accordance with inputted user specified constraints, document area problem variables by identifying a plurality of document areas which have associated constraints;
(c) specifying, electronically and in accordance with the inputted user specified constraints, document parameter problem variables by identifying document parameters that can be changed;
(d) specifying, electronically, document area value domains for each document area problem variable by identifying content pieces appropriate for the document areas having associated constraints;
(e) specifying, electronically, document parameter value domains for each document parameter problem variable by identifying valid ranges for each document parameter;
(f) specifying, electronically, a layout constraint which further constrains the document parameter value domains;
(g) specifying, electronically, content constraints which further constrains the document area value domains of the document areas having associated constraints;
(h) determining, electronically, a document layout based on the electronically specifying such that the user specified constraints are satisfied; and (i) generating, electronically, a document in accordance with the determined layout that satisfies the user specified constraints.
(a) electronically inputting user specified constraints;
(b) specifying, electronically and in accordance with inputted user specified constraints, document area problem variables by identifying a plurality of document areas which have associated constraints;
(c) specifying, electronically and in accordance with the inputted user specified constraints, document parameter problem variables by identifying document parameters that can be changed;
(d) specifying, electronically, document area value domains for each document area problem variable by identifying content pieces appropriate for the document areas having associated constraints;
(e) specifying, electronically, document parameter value domains for each document parameter problem variable by identifying valid ranges for each document parameter;
(f) specifying, electronically, a layout constraint which further constrains the document parameter value domains;
(g) specifying, electronically, content constraints which further constrains the document area value domains of the document areas having associated constraints;
(h) determining, electronically, a document layout based on the electronically specifying such that the user specified constraints are satisfied; and (i) generating, electronically, a document in accordance with the determined layout that satisfies the user specified constraints.
Applications Claiming Priority (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US10/202,183 | 2002-07-23 | ||
| US10/202,275 US7010746B2 (en) | 2002-07-23 | 2002-07-23 | System and method for constraint-based document generation |
| US10/202,275 | 2002-07-23 | ||
| US10/202,183 US7107525B2 (en) | 2002-07-23 | 2002-07-23 | Method for constraint-based document generation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2435731A1 CA2435731A1 (en) | 2004-01-23 |
| CA2435731C true CA2435731C (en) | 2008-06-17 |
Family
ID=30117848
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002435731A Expired - Lifetime CA2435731C (en) | 2002-07-23 | 2003-07-18 | System and method for constraint-based document generation |
Country Status (6)
| Country | Link |
|---|---|
| US (2) | US7107525B2 (en) |
| EP (1) | EP1387290B1 (en) |
| JP (1) | JP2004054955A (en) |
| BR (1) | BR0302455A (en) |
| CA (1) | CA2435731C (en) |
| MX (1) | MXPA03006530A (en) |
Families Citing this family (133)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6345104B1 (en) * | 1994-03-17 | 2002-02-05 | Digimarc Corporation | Digital watermarks and methods for security documents |
| US7406475B2 (en) * | 2001-01-09 | 2008-07-29 | British Telecommunications Public Limited Company | Software tool for heuristic search methods |
| US7243303B2 (en) * | 2002-07-23 | 2007-07-10 | Xerox Corporation | Constraint-optimization system and method for document component layout generation |
| US7107525B2 (en) * | 2002-07-23 | 2006-09-12 | Xerox Corporation | Method for constraint-based document generation |
| US20040019847A1 (en) * | 2002-07-23 | 2004-01-29 | Xerox Corporation | Case-based system and method for generating a custom document |
| US7487445B2 (en) | 2002-07-23 | 2009-02-03 | Xerox Corporation | Constraint-optimization system and method for document component layout generation |
| US7225401B2 (en) | 2002-07-23 | 2007-05-29 | Xerox Corporation | Case-based system and method for generating a custom document |
| US20040034613A1 (en) * | 2002-07-23 | 2004-02-19 | Xerox Corporation | System and method for dynamically generating a style sheet |
| US7246312B2 (en) | 2002-07-30 | 2007-07-17 | Xerox Corporation | System and method for fitness evaluation for optimization in document assembly |
| US7171617B2 (en) | 2002-07-30 | 2007-01-30 | Xerox Corporation | System and method for fitness evaluation for optimization in document assembly |
| JP4462819B2 (en) * | 2002-09-26 | 2010-05-12 | ソニー株式会社 | Information processing apparatus and method, recording medium, and program |
| US20060112333A1 (en) * | 2002-09-27 | 2006-05-25 | Brother Kogyo Kabushiki Kaisha | Text edition device and program |
| US20040123247A1 (en) * | 2002-12-20 | 2004-06-24 | Optimost Llc | Method and apparatus for dynamically altering electronic content |
| US20040122824A1 (en) * | 2002-12-23 | 2004-06-24 | Clearwater Scott H. | Apparatus and method for market-based document content selection |
| US20040122856A1 (en) * | 2002-12-23 | 2004-06-24 | Clearwater Scott H. | Apparatus and method for market-based document content and layout selection |
| US7272258B2 (en) * | 2003-01-29 | 2007-09-18 | Ricoh Co., Ltd. | Reformatting documents using document analysis information |
| US7707255B2 (en) | 2003-07-01 | 2010-04-27 | Microsoft Corporation | Automatic grouping of electronic mail |
| US7246311B2 (en) * | 2003-07-17 | 2007-07-17 | Microsoft Corporation | System and methods for facilitating adaptive grid-based document layout |
| US7428700B2 (en) * | 2003-07-28 | 2008-09-23 | Microsoft Corporation | Vision-based document segmentation |
| JP4089655B2 (en) * | 2003-09-16 | 2008-05-28 | セイコーエプソン株式会社 | Layout system, layout program, and layout method |
| EP1682161A4 (en) * | 2003-10-29 | 2011-12-07 | Gentis Inc | Polymerizable emulsions for tissue engineering |
| JP4095558B2 (en) * | 2004-01-30 | 2008-06-04 | キヤノン株式会社 | Document processing apparatus, document processing method, and computer program |
| JP4110105B2 (en) * | 2004-01-30 | 2008-07-02 | キヤノン株式会社 | Document processing apparatus, document processing method, and document processing program |
| JP4165888B2 (en) * | 2004-01-30 | 2008-10-15 | キヤノン株式会社 | Layout control method, layout control apparatus, and layout control program |
| US7856596B2 (en) * | 2004-02-17 | 2010-12-21 | Microsoft Corporation | Method and system for separation of content and layout definitions in a display description |
| GB2416613A (en) * | 2004-07-27 | 2006-02-01 | Hewlett Packard Development Co | Document creation |
| US8074169B2 (en) * | 2004-07-27 | 2011-12-06 | Hewlett-Packard Development Company, L.P. | Document creation system and related methods |
| JP4144883B2 (en) * | 2004-08-06 | 2008-09-03 | キヤノン株式会社 | Information processing apparatus, control method therefor, and program |
| JP4047308B2 (en) * | 2004-08-06 | 2008-02-13 | キヤノン株式会社 | Layout processing method, information processing apparatus, and computer program |
| US7703036B2 (en) | 2004-08-16 | 2010-04-20 | Microsoft Corporation | User interface for displaying selectable software functionality controls that are relevant to a selected object |
| US8255828B2 (en) | 2004-08-16 | 2012-08-28 | Microsoft Corporation | Command user interface for displaying selectable software functionality controls |
| US8146016B2 (en) | 2004-08-16 | 2012-03-27 | Microsoft Corporation | User interface for displaying a gallery of formatting options applicable to a selected object |
| US9015621B2 (en) | 2004-08-16 | 2015-04-21 | Microsoft Technology Licensing, Llc | Command user interface for displaying multiple sections of software functionality controls |
| US20060048053A1 (en) | 2004-08-30 | 2006-03-02 | Xerox Corporation | Individually personalized customized report document system |
| US20060048042A1 (en) | 2004-08-30 | 2006-03-02 | Xerox Corporation | Individually personalized customized report document system with user feedback |
| US8134575B2 (en) | 2004-09-30 | 2012-03-13 | Microsoft Corporation | Maintaining graphical presentations based on user customizations |
| US7348982B2 (en) * | 2004-09-30 | 2008-03-25 | Microsoft Corporation | Method, system, and computer-readable medium for creating and laying out a graphic within an application program |
| US8510657B2 (en) * | 2004-09-30 | 2013-08-13 | Microsoft Corporation | Editing the text of an arbitrary graphic via a hierarchical list |
| US20060112132A1 (en) * | 2004-10-04 | 2006-05-25 | Maguire Amy M | Methods, systems and computer readable media for providing customized works |
| EP1836584A4 (en) * | 2004-11-16 | 2009-05-06 | Zalag Corp | Display/layout methods and apparatuses including content items and display containers |
| US20060111971A1 (en) * | 2004-11-24 | 2006-05-25 | Microsoft Corporation | System and method for on-line and off-line advertising in content delivered to a display screen |
| US20060111970A1 (en) * | 2004-11-24 | 2006-05-25 | Microsoft Corporation | System and method for selling on-line and off-line advertising in content delivered to a display screen |
| US7310771B2 (en) * | 2004-12-20 | 2007-12-18 | Microsoft Corporation | Method and computer-readable medium for providing page and table formatting services |
| US7451140B2 (en) * | 2005-01-11 | 2008-11-11 | Xerox Corporation | System and method for proofing individual documents of variable information document runs using document quality measurements |
| US8245131B2 (en) * | 2005-02-10 | 2012-08-14 | Hewlett-Packard Development Company, L.P. | Constraining layout variations for accommodating variable content in electronic documents |
| US7743325B2 (en) * | 2005-03-15 | 2010-06-22 | Microsoft Corporation | Method and computer-readable medium for fitting text to shapes within a graphic |
| US20060212804A1 (en) * | 2005-03-15 | 2006-09-21 | Microsoft Corporation | Method and system for formatting web pages having constrained dynamic regions on content templates |
| US7750924B2 (en) * | 2005-03-15 | 2010-07-06 | Microsoft Corporation | Method and computer-readable medium for generating graphics having a finite number of dynamically sized and positioned shapes |
| US20060242568A1 (en) * | 2005-04-26 | 2006-10-26 | Xerox Corporation | Document image signature identification systems and methods |
| US20060248071A1 (en) * | 2005-04-28 | 2006-11-02 | Xerox Corporation | Automated document localization and layout method |
| GB2425634A (en) | 2005-04-30 | 2006-11-01 | Hewlett Packard Development Co | Variable data printing |
| US7434159B1 (en) | 2005-05-11 | 2008-10-07 | Hewlett-Packard Development Company, L.P. | Automatically layout of document objects using an approximate convex function model |
| US7487447B1 (en) * | 2005-05-25 | 2009-02-03 | Google Inc. | Web page zoom feature |
| US7644356B2 (en) * | 2005-06-10 | 2010-01-05 | Hewlett-Packard Development Company, L.P. | Constraint-based albuming of graphic elements |
| US7555711B2 (en) * | 2005-06-24 | 2009-06-30 | Hewlett-Packard Development Company, L.P. | Generating a text layout boundary from a text block in an electronic document |
| US20070006072A1 (en) * | 2005-06-29 | 2007-01-04 | Xerox Corporation | Constraint-optimization method for document layout using tradeoff generation |
| US7747944B2 (en) | 2005-06-30 | 2010-06-29 | Microsoft Corporation | Semantically applying style transformation to objects in a graphic |
| AU2006278225A1 (en) * | 2005-08-09 | 2007-02-15 | Compography, Inc. | Methods and apparatuses to assemble, extract and deploy content from electronic documents |
| US8627222B2 (en) | 2005-09-12 | 2014-01-07 | Microsoft Corporation | Expanded search and find user interface |
| US20070130509A1 (en) * | 2005-12-05 | 2007-06-07 | Xerox Corporation | Custom publication rendering method and system |
| US7761789B2 (en) | 2006-01-13 | 2010-07-20 | Ricoh Company, Ltd. | Methods for computing a navigation path |
| US20070174781A1 (en) * | 2006-01-25 | 2007-07-26 | Catalog Data Solutions | Parameter visualization |
| US8438486B2 (en) | 2006-02-09 | 2013-05-07 | Microsoft Corporation | Automatically converting text to business graphics |
| US7788579B2 (en) * | 2006-03-06 | 2010-08-31 | Ricoh Co., Ltd. | Automated document layout design |
| US7882058B1 (en) * | 2006-04-20 | 2011-02-01 | Xfi Corporation | Method and apparatus for business resource automation |
| US9727989B2 (en) | 2006-06-01 | 2017-08-08 | Microsoft Technology Licensing, Llc | Modifying and formatting a chart using pictorially provided chart elements |
| WO2008012475A2 (en) * | 2006-07-25 | 2008-01-31 | ANDROMAQUE PREPRESSE (Société à Responsabilité Limitée) | Method and system of production and/or automatic conversion from heterogeneous content of at least one page make-up for achieving the fastest read with maximum retention |
| US7743079B1 (en) | 2006-07-31 | 2010-06-22 | Microsoft Corporation | Managing data across a semantic data view and a presentation data view |
| US8006179B2 (en) * | 2006-07-31 | 2011-08-23 | Microsoft Corporation | Wrapping nodes in a drawing canvas |
| US7844897B1 (en) * | 2006-10-05 | 2010-11-30 | Adobe Systems Incorporated | Blog template generation |
| US9201854B1 (en) | 2006-10-25 | 2015-12-01 | Hewlett-Packard Development Company, L.P. | Methods and systems for creating, interacting with, and utilizing a superactive document |
| US8738456B2 (en) * | 2006-11-14 | 2014-05-27 | Xerox Corporation | Electronic shopper catalog |
| JP2008129702A (en) * | 2006-11-17 | 2008-06-05 | Canon Inc | Information processor, control method and control program |
| US20150074005A1 (en) * | 2006-12-12 | 2015-03-12 | William C. Brougher | Method and apparatus for facilitating patent searching |
| US20080215966A1 (en) * | 2007-03-01 | 2008-09-04 | Microsoft Corporation | Adaptive server-based layout of web documents |
| US8584042B2 (en) | 2007-03-21 | 2013-11-12 | Ricoh Co., Ltd. | Methods for scanning, printing, and copying multimedia thumbnails |
| US8583637B2 (en) * | 2007-03-21 | 2013-11-12 | Ricoh Co., Ltd. | Coarse-to-fine navigation through paginated documents retrieved by a text search engine |
| US20080235564A1 (en) * | 2007-03-21 | 2008-09-25 | Ricoh Co., Ltd. | Methods for converting electronic content descriptions |
| US8812969B2 (en) * | 2007-03-21 | 2014-08-19 | Ricoh Co., Ltd. | Methods for authoring and interacting with multimedia representations of documents |
| US8745075B2 (en) | 2007-03-26 | 2014-06-03 | Xerox Corporation | Notification method for a dynamic document system |
| AU2007201652B2 (en) * | 2007-04-13 | 2010-09-02 | Canon Kabushiki Kaisha | Laying out graphical elements on a page |
| US20080270397A1 (en) * | 2007-04-30 | 2008-10-30 | Buck Arlene J | Automated assembly of a complex document based on production constraints |
| US8479091B2 (en) * | 2007-04-30 | 2013-07-02 | Xerox Corporation | Automated assembly of a complex document based on production constraints |
| US7949948B2 (en) * | 2007-05-09 | 2011-05-24 | Microsoft Corporation | Constraint and rule-based page layout |
| US8762880B2 (en) | 2007-06-29 | 2014-06-24 | Microsoft Corporation | Exposing non-authoring features through document status information in an out-space user interface |
| US8484578B2 (en) | 2007-06-29 | 2013-07-09 | Microsoft Corporation | Communication between a document editor in-space user interface and a document editor out-space user interface |
| US20090094091A1 (en) * | 2007-10-05 | 2009-04-09 | Xerox Corporation | Service call data selection and delivery method and system |
| IL186924A0 (en) * | 2007-10-25 | 2008-02-09 | Deutsche Telekom Ag | A method of content adaptation for electronic displays |
| JP5252933B2 (en) * | 2008-01-24 | 2013-07-31 | キヤノン株式会社 | Document processing apparatus, document processing method, and program |
| US9588781B2 (en) | 2008-03-31 | 2017-03-07 | Microsoft Technology Licensing, Llc | Associating command surfaces with multiple active components |
| US20090254814A1 (en) * | 2008-04-08 | 2009-10-08 | Microsoft Corporation | Per-edge rules and constraints-based layout mechanism |
| US20090263173A1 (en) * | 2008-04-18 | 2009-10-22 | Xerox Corporation | Methods and systems for generating dynamic order documents |
| GB0808109D0 (en) * | 2008-05-02 | 2008-06-11 | Wave2 Media Solutions Ltd | Automatic document generator |
| CN101295290B (en) * | 2008-06-11 | 2011-11-09 | 北大方正集团有限公司 | Method for multi-row words layout in row |
| US9665850B2 (en) | 2008-06-20 | 2017-05-30 | Microsoft Technology Licensing, Llc | Synchronized conversation-centric message list and message reading pane |
| US8745478B2 (en) * | 2008-07-07 | 2014-06-03 | Xerox Corporation | System and method for generating inspiration boards |
| US8694893B2 (en) * | 2008-08-08 | 2014-04-08 | Oracle International Corporation | Interactive product configurator with persistent component association |
| US8806357B2 (en) * | 2008-08-29 | 2014-08-12 | Sap Ag | Plug-ins for editing templates in a business management system |
| US9122669B2 (en) * | 2008-08-29 | 2015-09-01 | Sap Se | Flat schema integrated document oriented templates |
| US20100057760A1 (en) * | 2008-08-29 | 2010-03-04 | Hilmar Demant | Generic data retrieval |
| US8209276B2 (en) * | 2008-10-27 | 2012-06-26 | Oracle International Corporation | Constraint based system with dynamic consistency checking |
| US8504501B2 (en) * | 2008-11-13 | 2013-08-06 | Oracle International Corporation | Dynamic constraint satisfaction problem solver |
| US8065255B2 (en) * | 2008-11-13 | 2011-11-22 | Oracle International Corporation | Management of sub-problems in a dynamic constraint satisfaction problem solver |
| US9443210B2 (en) * | 2008-11-24 | 2016-09-13 | Oracle International Corporation | Interactive product configurator with automatic selections |
| US8165980B2 (en) * | 2009-01-23 | 2012-04-24 | Oracle International Corporation | Dynamic constraint solver with cross problem constraints |
| US20100191688A1 (en) * | 2009-01-29 | 2010-07-29 | Oracle International Corporation | Dynamic constraint solver with resource sum constraints |
| US8386544B2 (en) * | 2009-02-05 | 2013-02-26 | Oracle International Corporation | Managing floating point variables in constraint satisfaction problems |
| US8126834B2 (en) * | 2009-04-21 | 2012-02-28 | Oracle International Corporation | Dynamic constraint satisfaction problem solver with hierarchical union constraints |
| US8229869B2 (en) * | 2009-04-22 | 2012-07-24 | Oracle International Corporation | Constraint processing with zero value handling |
| US8645302B2 (en) * | 2009-04-28 | 2014-02-04 | Oracle International Corporation | Dynamic constraint satisfaction problem solver with part-whole hierarchy constraints |
| US8229870B2 (en) * | 2009-04-28 | 2012-07-24 | Oracle International Corporation | Constraint based system with domain splitting |
| US8751425B2 (en) * | 2009-06-12 | 2014-06-10 | Oracle International Corporation | Constraint satisfaction problem solver with interactive conflict resolution |
| US8170970B2 (en) * | 2009-06-24 | 2012-05-01 | Oracle International Corporation | Constraint based system that identifies top constraint expressions |
| US8447716B2 (en) * | 2009-07-27 | 2013-05-21 | Oracle International Corporation | Dynamic constraint satisfaction problem solver with inferred problem association removal |
| US8301582B2 (en) * | 2009-10-15 | 2012-10-30 | Oracle International Corporation | Dynamic constraint satisfaction problem solver with sub-problem placeholder |
| US8799325B2 (en) | 2010-03-12 | 2014-08-05 | Microsoft Corporation | Reordering nodes in a hierarchical structure |
| US9823831B2 (en) * | 2010-04-07 | 2017-11-21 | Apple Inc. | Device, method, and graphical user interface for managing concurrently open software applications |
| US9058186B2 (en) | 2010-04-07 | 2015-06-16 | Apple Inc. | Device, method, and graphical user interface for managing concurrently open software applications |
| US9128733B2 (en) * | 2010-11-12 | 2015-09-08 | Microsoft Technology Licensing, Llc | Display and resolution of incompatible layout constraints |
| US8866842B2 (en) | 2011-05-23 | 2014-10-21 | Adobe Systems Incorporated | Adaptive content authoring |
| US20130127916A1 (en) * | 2011-05-23 | 2013-05-23 | Justin Van Slembrouk | Adaptive Content Display |
| US8307279B1 (en) | 2011-09-26 | 2012-11-06 | Google Inc. | Smooth zooming in web applications |
| US20140249882A1 (en) * | 2012-10-19 | 2014-09-04 | The Curators Of The University Of Missouri | System and Method of Stochastic Resource-Constrained Project Scheduling |
| US9477404B2 (en) | 2013-03-15 | 2016-10-25 | Apple Inc. | Device, method, and graphical user interface for managing concurrently open software applications |
| US10817662B2 (en) * | 2013-05-21 | 2020-10-27 | Kim Technologies Limited | Expert system for automation, data collection, validation and managed storage without programming and without deployment |
| US10073861B2 (en) * | 2015-09-03 | 2018-09-11 | Disney Enterprises, Inc. | Story albums |
| US10761714B2 (en) * | 2015-11-23 | 2020-09-01 | Google Llc | Recognizing gestures and updating display by coordinator |
| US9959257B2 (en) | 2016-01-08 | 2018-05-01 | Adobe Systems Incorporated | Populating visual designs with web content |
| EP3436933B1 (en) * | 2016-05-17 | 2019-08-07 | Google LLC | Systems and methods for automatic determination of layout constraints |
| JP6812170B2 (en) * | 2016-08-29 | 2021-01-13 | キヤノン株式会社 | Information processing device, its control method, and control program |
| US10733366B2 (en) | 2016-09-19 | 2020-08-04 | Kim Technologies Limited | Actively adapted knowledge base, content calibration, and content recognition |
| US11341193B2 (en) | 2020-06-29 | 2022-05-24 | Capital One Services, Llc | Methods and systems for template generation |
| CN114528821B (en) * | 2022-04-25 | 2022-09-06 | 中国科学技术大学 | Understanding-assisted dialog system manual evaluation method and device and storage medium |
Family Cites Families (57)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE3838740A1 (en) * | 1987-11-16 | 1989-06-01 | Canon Kk | Documentation processing system |
| US5224206A (en) | 1989-12-01 | 1993-06-29 | Digital Equipment Corporation | System and method for retrieving justifiably relevant cases from a case library |
| US5278946A (en) | 1989-12-04 | 1994-01-11 | Hitachi, Ltd. | Method of presenting multimedia data in a desired form by comparing and replacing a user template model with analogous portions of a system |
| US5181162A (en) | 1989-12-06 | 1993-01-19 | Eastman Kodak Company | Document management and production system |
| JPH03177964A (en) | 1989-12-07 | 1991-08-01 | Toshiba Corp | Document arranging device |
| US5228115A (en) * | 1990-03-29 | 1993-07-13 | International Business Machines Corporation | Hybrid backtrack/lookahead search technique for constraint-satisfaction problems |
| JPH0785239B2 (en) | 1990-09-07 | 1995-09-13 | 富士ゼロックス株式会社 | Electronic document processor |
| US5649216A (en) | 1991-05-17 | 1997-07-15 | Joseph S. Sieber | Method and apparatus for automated layout of text and graphic elements |
| US5634021A (en) | 1991-08-15 | 1997-05-27 | Borland International, Inc. | System and methods for generation of design images based on user design inputs |
| JP2579397B2 (en) * | 1991-12-18 | 1997-02-05 | インターナショナル・ビジネス・マシーンズ・コーポレイション | Method and apparatus for creating layout model of document image |
| US5434953A (en) | 1992-03-20 | 1995-07-18 | Xerox Corporation | Use of fast textured reduction for discrimination of document image components |
| US5855009A (en) * | 1992-07-31 | 1998-12-29 | Texas Instruments Incorporated | Concurrent design tradeoff analysis system and method |
| US5438512A (en) | 1993-10-22 | 1995-08-01 | Xerox Corporation | Method and apparatus for specifying layout processing of structured documents |
| US5669006A (en) * | 1995-02-23 | 1997-09-16 | International Business Machines Corporation | Method for automatically obtaining spatial layout for multimedia presentations |
| JPH09160821A (en) | 1995-12-01 | 1997-06-20 | Matsushita Electric Ind Co Ltd | Device for preparing hyper text document |
| JPH09212493A (en) | 1996-01-31 | 1997-08-15 | Fuji Xerox Co Ltd | Document processor |
| US6173286B1 (en) * | 1996-02-29 | 2001-01-09 | Nth Degree Software, Inc. | Computer-implemented optimization of publication layouts |
| US6081798A (en) | 1996-04-24 | 2000-06-27 | International Business Machines Corp. | Object oriented case-based reasoning framework mechanism |
| US5911146A (en) | 1996-05-03 | 1999-06-08 | Mitsubishi Electric Information Technology Center America, Inc. (Ita) | Apparatus and method for automatic yellow pages pagination and layout |
| US6405195B1 (en) | 1996-05-06 | 2002-06-11 | Spotfire Ab | System and method for collaborative hosted analysis of data bases via a network portal |
| JP3605941B2 (en) * | 1996-05-20 | 2004-12-22 | 富士ゼロックス株式会社 | Document structure creation device and document structure creation method |
| US6023714A (en) | 1997-04-24 | 2000-02-08 | Microsoft Corporation | Method and system for dynamically adapting the layout of a document to an output device |
| AUPO904597A0 (en) | 1997-09-08 | 1997-10-02 | Canon Information Systems Research Australia Pty Ltd | Method for non-linear document conversion and printing |
| US6134563A (en) | 1997-09-19 | 2000-10-17 | Modernsoft, Inc. | Creating and editing documents |
| US5943670A (en) | 1997-11-21 | 1999-08-24 | International Business Machines Corporation | System and method for categorizing objects in combined categories |
| US6021411A (en) | 1997-12-30 | 2000-02-01 | International Business Machines Corporation | Case-based reasoning system and method for scoring cases in a case database |
| US6571251B1 (en) | 1997-12-30 | 2003-05-27 | International Business Machines Corporation | Case-based reasoning system and method with a search engine that compares the input tokens with view tokens for matching cases within view |
| US6081816A (en) * | 1998-03-18 | 2000-06-27 | Microsoft Corporation | Method for placing text around polygons and other constraints |
| US6529934B1 (en) * | 1998-05-06 | 2003-03-04 | Kabushiki Kaisha Toshiba | Information processing system and method for same |
| US6668354B1 (en) | 1999-01-05 | 2003-12-23 | International Business Machines Corporation | Automatic display script and style sheet generation |
| WO2000055753A2 (en) * | 1999-03-09 | 2000-09-21 | State Of Oregon Acting By And Through The State Board Of Higher Education On Behalf Of The University Of Oregon | Satisfiability algorithms and finite quantification |
| US6415430B1 (en) * | 1999-07-01 | 2002-07-02 | Nec Usa, Inc. | Method and apparatus for SAT solver architecture with very low synthesis and layout overhead |
| US6667750B1 (en) * | 1999-07-30 | 2003-12-23 | Curl Corporation | Multiple pass layout of graphical objects with elastics |
| US6826727B1 (en) * | 1999-11-24 | 2004-11-30 | Bitstream Inc. | Apparatus, methods, programming for automatically laying out documents |
| JP2003529825A (en) | 2000-02-14 | 2003-10-07 | ジオフェニックス， インコーポレイテッド | Method and system for graphical programming |
| US6681380B1 (en) * | 2000-02-15 | 2004-01-20 | International Business Machines Corporation | Aggregating constraints and/or preferences using an inference engine and enhanced scripting language |
| US6675355B1 (en) * | 2000-03-16 | 2004-01-06 | Autodesk, Inc. | Redline extensible markup language (XML) schema |
| US20020040375A1 (en) | 2000-04-27 | 2002-04-04 | Simon Richard A. | Method of organizing digital images on a page |
| JP3956581B2 (en) | 2000-05-18 | 2007-08-08 | 株式会社日立製作所 | Inference system based on case similarity |
| US20010051962A1 (en) | 2000-06-08 | 2001-12-13 | Robert Plotkin | Presentation customization |
| US20020111969A1 (en) * | 2000-09-28 | 2002-08-15 | Halstead Robert H. | System and method for processing graphical objects for layout using an elastic difference operation |
| EP1346290A2 (en) * | 2000-09-29 | 2003-09-24 | Victor Hsieh | Online intelligent information comparison agent of multilingual electronic data sources over inter-connected computer networks |
| US7120868B2 (en) * | 2002-05-30 | 2006-10-10 | Microsoft Corp. | System and method for adaptive document layout via manifold content |
| US6959416B2 (en) | 2001-01-30 | 2005-10-25 | International Business Machines Corporation | Method, system, program, and data structures for managing structured documents in a database |
| US20040205609A1 (en) | 2001-06-28 | 2004-10-14 | Milton John R. | System and method for generating and formatting a publication |
| US20040205493A1 (en) * | 2001-08-08 | 2004-10-14 | Simpson Shell S. | Web based imaging application that creates customized content based on user selections |
| US20030163785A1 (en) | 2002-02-28 | 2003-08-28 | Hui Chao | Composing unique document layout for document differentiation |
| US20040015782A1 (en) * | 2002-07-17 | 2004-01-22 | Day Young Francis | Templating method for automated generation of print product catalogs |
| US7107525B2 (en) | 2002-07-23 | 2006-09-12 | Xerox Corporation | Method for constraint-based document generation |
| US20040205588A1 (en) | 2002-07-23 | 2004-10-14 | Xerox Corporation | System and method for dynamically generating a style sheet |
| US7243303B2 (en) | 2002-07-23 | 2007-07-10 | Xerox Corporation | Constraint-optimization system and method for document component layout generation |
| US7487445B2 (en) | 2002-07-23 | 2009-02-03 | Xerox Corporation | Constraint-optimization system and method for document component layout generation |
| US20040019847A1 (en) | 2002-07-23 | 2004-01-29 | Xerox Corporation | Case-based system and method for generating a custom document |
| US20040034613A1 (en) | 2002-07-23 | 2004-02-19 | Xerox Corporation | System and method for dynamically generating a style sheet |
| US7225401B2 (en) | 2002-07-23 | 2007-05-29 | Xerox Corporation | Case-based system and method for generating a custom document |
| US7246312B2 (en) | 2002-07-30 | 2007-07-17 | Xerox Corporation | System and method for fitness evaluation for optimization in document assembly |
| US7171617B2 (en) | 2002-07-30 | 2007-01-30 | Xerox Corporation | System and method for fitness evaluation for optimization in document assembly |
-
2002
- 2002-07-23 US US10/202,183 patent/US7107525B2/en not_active Expired - Lifetime
- 2002-07-23 US US10/202,275 patent/US7010746B2/en active Active
-
2003
- 2003-07-18 CA CA002435731A patent/CA2435731C/en not_active Expired - Lifetime
- 2003-07-18 JP JP2003276405A patent/JP2004054955A/en active Pending
- 2003-07-22 BR BR0302455-5A patent/BR0302455A/en not_active Application Discontinuation
- 2003-07-22 MX MXPA03006530A patent/MXPA03006530A/en active IP Right Grant
- 2003-07-23 EP EP03016826.4A patent/EP1387290B1/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| US20040205472A1 (en) | 2004-10-14 |
| EP1387290A2 (en) | 2004-02-04 |
| US7107525B2 (en) | 2006-09-12 |
| EP1387290A3 (en) | 2007-09-05 |
| MXPA03006530A (en) | 2004-12-07 |
| US7010746B2 (en) | 2006-03-07 |
| BR0302455A (en) | 2004-09-08 |
| EP1387290B1 (en) | 2018-10-03 |
| JP2004054955A (en) | 2004-02-19 |
| US20040019852A1 (en) | 2004-01-29 |
| CA2435731A1 (en) | 2004-01-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2435731C (en) | System and method for constraint-based document generation | |
| US11301541B2 (en) | System and method for generating questionnaires as part of building a website within a website building system | |
| US10360049B2 (en) | Extensible template pipeline for web applications | |
| US10445411B2 (en) | Document automation systems | |
| Kumar et al. | Bricolage: example-based retargeting for web design | |
| US8108395B2 (en) | Automatic arrangement of portlets on portal pages according to semantical and functional relationship | |
| US20040025109A1 (en) | System and method for fitness evaluation for optimization in document assembly | |
| EP3718027A2 (en) | System and method for the generation and editing of text content in website building systems | |
| KR101547496B1 (en) | Method and apparatus for reconstructing a web page | |
| Bonavero et al. | Reconciling user and designer preferences in adapting web pages for people with low vision | |
| KR19990027325A (en) | Apparatus for web document authoring and its operation method | |
| Stepanyan et al. | Blogs as objects of preservation: Advancing the discussion on significant properties | |
| Creff et al. | Model-based product line evolution: an incremental growing by extension | |
| CN109376328B (en) | Portal website creating system and method for private company, management terminal and management equipment | |
| Kluza et al. | From attribute relationship diagrams to process (BPMN) and decision (DMN) models | |
| CA3024078C (en) | Creation and update of hierarchical websites based on collected business knowledge | |
| Buttinger et al. | JobOlize Headhunting by Information Extraction in the Era of Web 2.0 | |
| KR100319776B1 (en) | Apparatus and method for software process modeling | |
| JP2008059276A (en) | Ontology generation device for sequence diagram, and its program and method | |
| Ehrensberger | Datamockups: design tool for content-powered mockups | |
| Perkins et al. | Today's style guide: trusted tool with added potential | |
| Nalepa et al. | Prototyping Structure of Rule Bases | |
| CN116341517A (en) | Method, equipment and storage medium for dividing literal works | |
| Kim et al. | Blogforever: D3. 1 preservation strategy report | |
| Maurya et al. | Creating websites in Hindi |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKEX | Expiry |
Effective date: 20230718 |