Source: http://www.google.com/patents/US20040183837?dq=7800613
Timestamp: 2016-05-02 13:17:23
Document Index: 261733133

Matched Legal Cases: ['arts 308', 'arts 401', 'arts 401', 'art 1001', 'art 1002', 'art 1003', 'art 1101', 'art 1102', 'art 1201', 'art 1201', 'art 1201']

Patent US20040183837 - Document management method and apparatus - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsA document management method and apparatus include and realize a process of generating a task information package datum as a set of data in order to manage information of referred documents and created documents in compiling a new document necessary for carrying out a task, a data base to store the task...http://www.google.com/patents/US20040183837?utm_source=gb-gplus-sharePatent US20040183837 - Document management method and apparatusAdvanced Patent SearchPublication numberUS20040183837 A1Publication typeApplicationApplication numberUS 10/763,661Publication dateSep 23, 2004Filing dateJan 23, 2004Priority dateMar 17, 2003Publication number10763661, 763661, US 2004/0183837 A1, US 2004/183837 A1, US 20040183837 A1, US 20040183837A1, US 2004183837 A1, US 2004183837A1, US-A1-20040183837, US-A1-2004183837, US2004/0183837A1, US2004/183837A1, US20040183837 A1, US20040183837A1, US2004183837 A1, US2004183837A1InventorsNorito Watanabe, Ichiro Harashima, Hisanori Nonaka, Shunsuke MinamiOriginal AssigneeHitachi, Ltd.Export CitationBiBTeX, EndNote, RefManPatent Citations (3), Referenced by (31), Classifications (7), Legal Events (1) External Links: USPTO, USPTO Assignment, EspacenetDocument management method and apparatus
DETAILED DISCRIPTION OF THE INVENTION [0023] To begin with, we will discuss an embodiment with regard to the present invention. [0024] [0024]FIG. 1 shows a diagram that shows the system construction in the present invention. [0025] A user directs an instruction, being input to an instruction input device (which is not shown in FIG. 1), to a task information package generator 102 that makes a pack of the information of documents referred in compiling the document which is currently under compilation and the information of the resultantly compiled present document 101 when the user is engaged in a document task. The task information package generator 102 stores the instructed information as one data set of task information package datum 103 in a task package data base 104. It is meant “task” is, for example, writing patent specifications, compiling design documents and CAD drawings, analytical studies, etc. As carrying out package generation for every task, plural task information package data 103 are stored in task information package data base 104. The substantial information of the documents which are the resultant ones after carrying out the task can be separately stored in a document managing data base (then linking information is stored in the task information packaging data 103). The document may store the address information to assess Web page in an internet. [0026] After carrying out the task, the user accesses the relevant information presentation processor 105 in order to visualize a linkage of a group of documents in a graphical chart. In such access, the relevant information presentation processor 105 retrieves the information stored in the task information package data base 104 and presents a graphical chart on the display 106. In this graphical chart, the documents are presented by document icons and the reference of documents and the creation of documents are presented in arrow icons 108. [0027] The window of graphic registration presentation 210 shown in FIG. 2 is an example used for a graphic registration presentation associated with the task information package datum 103. The registered graphic registration presentation 210 has a reference document field 201 to which the documents referred to the task are input and displayed, a complied document field 202 to which the compiled document is input and displayed and a comment field 203 to which the comment with regard to the task is input and displayed. The input has been done through “drag and drop” of file, “copy and paste” and selection from file browsers. [0028] [0028]FIG. 2 is an example for a task for writing patent specifications. The reference document field shows “patent search report” 204. The documents compiled in reference to this report are “patent specification” and “request letter for filing” 205 in the complied document field 202. The comment field 203 shows the sentences of comments therein. [0029] After inputting all above information, the task information package generator 102 operates and the resultant packed data are stored in a task package data base 104 by accessing the icon of register 206. [0030] [0030]FIG. 3 shows a data process of the consolidated system operation, where two tasks, such as writing patent specifications denoted as 301 (called “a patent specification writing task”, hereinafter) and reviewing patent specification for amendment denoted as 302 (called “patent specification reviewing task”, hereinafter), are shown in a linkage. [0031] In the patent specification writing task 301, patent specification 304 and request letter for filing 305 are made with referring to patent search reports in the document creator 303. At the termination of this task, the user activates the task information package generator 306 and accesses to the registered graphic registration presentation 210 as shown in FIG. 2. The user drags and drops the reference documents and compiled documents into the reference document window and the compiled document window, respectively and writes his or her comments in the comment window. The task information package generator 306 dumps and stores the task information package datum 103 into the task information package data base 104 by clicking the registration icon 206. The user may directly store the texts of the compiled documents into the document data base 307, however by accessing the register icon 206 on the registered graphic registration presentation 210 he or she may store these texts into the document data base 307 through the task information package data generator 306 such that these texts are stored in the task information package data base 104 as well as transferred to the document data base 307 and stored therein. [0032] After filing patent specifications to Patent Office, it sometimes happens that the applied patents need to be reviewed for the patentability, meritoriousness, etc. The patent specification reviewing task 302 can be associated in such review. The patent evaluator 310 is carried out with referring to the prior arts 308 that are the objects to be studied and the prior revisions of patent specifications 309 (same as the patent specifications 304). After such patent evaluation, the new revision of patent specification 311 is resultantly compiled and stored in the document data base 307. The user can access the task information package generator 321 (same as 306) and input the task information through the graphic registration presentation 210. In the operation, the reference documents are the “prior arts” 308 and “patent specifications” 309 and compiled document is “new revision of patent specification” 311. The user can input the necessary comments and record them. By accessing the register icon 206, the user can store the task information package into the task information package data base 104. [0033] After operating these plural tasks in a multi-task operation capability of the computer system, the user access relevant information presentation processor 105. By this access, the relational linkage in the original sources in document referencing and the original sources in document compilation can be obtained by retrieving the related data from the task information package data base 104 and present on the graphic chart display 320. The “patent specification” icon 316 is generated in the patent specification writing task 301 and the data file of “patent specifications” are treated as members of task information package generated in the patent specification reviewing task 302. By this membership property, it can be shown that the icon 314 of “patent search report”, the icon 316 of “patent specification” and the icon 317 of “new revision of patent specification” are all in a systematic linkage. [0034] The operation of the relevant information presentation processor 105 ends up with the graphical chart presentation 320 in the following order of operation. To begin with, the user reads out all task information package datum 103 from the task information data base 104 and retrieve the documents registered in the reference and compilation files. By reading the date of document creation, the icons 313 to 317 corresponding to the order of creation are placed from the left to right and the upper to the lower. After this operation, by using the task information package datum 103, the user connects the icon corresponding to the reference documents to the icon corresponding to the created documents with arrows. If the icons overlap with the arrows, it is possible to rearrange the position of icons in such a way that the overlaps are in the minimum. By using this relevant information presentation processor, it is possible to create a graphic chart presentation of the reference and relevant information. [0035] Besides ordering the icons of the documents in document compilation date, it is possible to create a nesting of relations in compilation and reference by which a priority order of compilation can be obtained. The icons of the documents can be placed in the order in such a priority order. The priority order of compilation is the information that describes the reference of task information package datum and the relational linkage of document compilation so that the generation of sequential tasks is specified. Since no closed loops are created in the reference nesting, the relational linkage is uniquely created. [0036] There is another method of graphical chart presentation that does not use the information of order of compilation, wherein one of the re-arrangements of icons is carried out in such a way that icons corresponding to documents do not overlap and the lengths of the arrows indicating the relational linkages are kept as homogenous as possible. Then the relationship among the documents can be analyzed by applying a spring model. [0037] The document data, which is the conclusive results of the tasks, are stored in the document data base 307 as shown in FIG. 4. The prior arts 401, patent search reports 402 and request letters for filing 403, patent specifications 404 and new revisions of patent specifications 405 are all stored therein in a computer accessible form. [0038] The relational linkage of these documents is obtained by nesting the information in the task information package datum stored in the task information package data base 104. FIG. 5 shows the nesting with regard to the task information package datum 501 for patent searching task, the task information package datum 502 for patent specification writing and the task information package datum 503 of patent specification reviewing that have relational linkages with the document data 401 to 405 stored in the document data base 307. FIG. 5 shows the status that the document data of the patent search reports 402 are under compilation with referring the document data of the prior arts 401. The graphical chart presentation 320 in FIG. 3 shows the visual presentation of these relational linkages. [0039] There are several methods for the visualization of the relation between the tasks and the documents such as a graphical chart presentation as shown in FIG. 6 besides the presentation of the linkage in arrows as shown in FIG. 3. FIG. 6A shows the relational linkages of the icons 601 to 605 of the documents are presented in the arrows 606 to 609 that differ in colors, kinds and thickness of lines on the basis of the variation of the tasks. By such differences of lines, the kind of tasks can be easily clarified. Since the difference of the arrows is specified in the difference of the tasks, it is possible to make it clear that there is difference of the tasks even though the document is complied from the same reference document if the task is different. FIG. 6B shows another method for the visualization of the relation between the tasks and the documents, where the comment information stored in the task information package datum is inserted and shown as icons 610 to 612 in between the icons of documents. By using this presentation, it is possible to show the time-sequential comment information generated and the time-sequential background knowledge and the finding obtained in the process of the document compilation. The presentation of the comment information as shown in FIG. 6B can be applied to the FIG. 6A in a way such that the comment information is revealed by directing the arrows 606 to 609 using the selecting means such as cursors. The operation is carried out in the following steps. The user selects one of the arrows 606 to 609 using selecting a cursor or an alternative. Then the user accesses the relevant information processor presentation 105 and directs the presentation of the comment information therein and the relevant information processor presentation 105 retrieves the task information package datum corresponding to the arrow. Consequently, the relevant information processor presentation 105 presents the comment information stored in the corresponding task information package datum. There is another method for such presentation of the comment information where the user is not necessary to explicitly direct the presentation of the comment information. It is possible for the user to only place the cursor close to the one of the arrows 606 to 609, and then relevant information processor presentation 105 starts to retrieve the corresponding comment information and shows a presentation such that the corresponding comment information pops up near by the selected arrow. Since the cursor shifting, selection of icons by arrow and pop up presentation of comments are general presentation function of GUI, the details will not be explained. [0040] [0040]FIG. 7 shows another example of task information package datum. [0041] In this example, index information 701 is added to the task information package datum as explained in the first embodiment. For the index information, “writer”, “compiling date”, “task subject”, “task process”, are used. This group information is stored in accessible form in the present relational data base. [0042] The user who stores the task information package datum in the task information package data base can directly input the information into the index column every time when he or she updates the recorded information. Alternative operation method can be automatically or semi-automatically done by the index generator 806 as shown in FIG. 8. The detail operation is explained as follows. [0043] The writer in the index information 701 can be obtained from the name of computer user who operates the present document management system and therefore the generation of writer's name can be automatically or semi-automatically done. And the compiling date in the index information 701 is obtained by the generic information of the present user of the computer. [0044] The task subject in the index information 701 is explicitly presented from the candidates of the remarkable words extracted from the input documents. For this purpose, the task information package generator hands over the input documents to the index generator 806. The index generator 806 applies morphological analysis to the document by words and terminology registered in a professional word dictionary 807 and extracts the resultant words. The morphological analysis is realized by the general used application as follows. The sentences in the input documents are decomposed into a part of speech. The index generator 806 selects the technical terms which are same as the terms registered in the professional word dictionary 807. These selected technical terms are a set of terms representing the remarks to specify the property of the document. On the basis of this information, the frequency of the fact that the technical terms come out in the subjective document is counted. The task information package generator 805 collects sets of technical terms and their frequency for each subjective document. By using this information, the task information package generator 805 presents the technical terms commonly used for all documents in the order of frequency. The user can select the candidates for the technical terms which are most preferable for the index information of the task information package generator. By this process, the most preferable index can be made for the task information package datum with a little burden to the users. [0045] The professional word dictionary 807 can be configured in a system of a data base by constructing hierarchy of words. By implementing the relational access in the intra-hierarch, it is possible to manage the broader terms and narrow terms and retrieve the words in this management concept. It is possible to automatically judge the correspondence of each candidate of the index to the remarks of the index. In other words, the user can select correct index data 701 against the remarks such as “task subject” and “task process”. FIG. 8 shows an example such that since the index candidate 37 compile” extracted from the document is a narrow term of “task subject” in the professional word dictionary 807, “compile” index is set for “task subject” index remarks in the task information package datum 103. The user can select broader terms against the subjective term which has been extracted from the index information. For this case, the user can easily select the appropriate term by using presented terms on the basis of only the subjective terms and the broader terms. In the example shown in FIG. 8, the user can obtain the presentation of “compile operation” which is a broader term and select it to operate. [0046] If the system has a project management system or project management data base 801, the task information package generator 805 accesses the present status information stored in the task progress project management system or project management data base 801 and the retrieved information is set in the task process index. It is possible to exploit the present general relational data base management system for the project management system. In the project management system, the term of operation (days), starting time and ending time are managed by the project management data base 801. The user can comprehend which project his or her present document compiling task is related to and can set these documents to the corresponding task process index. [0047] The texts of the document A 802, the document B 803 and the document C 804 show the word “compile” is commonly used thereover as seen in FIG. 8. The task subject is set to be “compile” for the index information in the task information package datum. The user comprehends that the project B is presently carried on by referring the task information package data base 801 through the task information package generator 805 and sets “project B” in the task process in the information package datum 108. [0048] We will explain an example to use index information 701 in the presentation for a graphical chart in the following. [0049] [0049]FIG. 9 shows an example wherein four task information package datum 901 to 904 are stored in task information package data base 307. The task information package datum 901 refers to the document A, complies document B and has a comment “A is an effective prior art”. The index of this task information package datum has the index “document compilation” and “patent specification writing task”. In the task information package datum 902, the task information package datum refers to the documents A, B and G, compiles the document E and has the index “document compilation” and “patent specification reviewing task”. The task information package datum 903 and another datum 904 have similar form as shown in FIG. 9. The actual texts of the documents referred in the task information package data are stored as the documents A to H in the document data base 307. [0050] The relevant information presentation processor 105 provides the graphical chart presentation as shown in FIG. 10. The arrangement of the icons of the documents is done in a process as explained for the relevant information presentation processor 105 shown in FIG. 3. FIG. 10A shows a graphic chart 1001 which is compiled in a view of “patent specification writing”. For this operation, the user retrieves all “patent specification writing” set in the index of the task information package data and present as the relational linkage among the retrieved task information package data. It is seen the documents B and D are compiled from the document A and the document C is compiled from the document D. As a similar presentation, the graphic chart 1002 in FIG. 10B shows the relational linkage of the patent specification reviewing and the graphic chart 1003 in FIG. 10C shows that of the document compiling. By this system configuration, the nesting of all categories of the relational linkages is not presented but done in confined categories that are interesting to the user. [0051] [0051]FIG. 11 shows variations of arrow indicator in different colors, different kinds and different thickness of lines as shown in the graphical chart 1101. It is possible not to present only the relational linkage among the documents but the classification of such relational linkage between documents. As shown in the graphical chart 1102, the pop up window 1104 comes out to present the background knowledge and the finding by directing the cursor 1103 to the arrows. [0052] Another example of application of the present invention is explained as follows, wherein the graphical presentation for designing task which uses computer simulation technology is carried out. It is necessary to search the various parameters and determine in a manner of trial and error in the process of on-CAD designing task. The present invention provides the graphical chart presentation of the background knowledge and the finding obtained in the design process for the optimization, [0053] The graphical chart 1201 shown in FIG. 12 is such an example. The document icons A to E show analysis results for a trial. For every analysis of the design simulation, the user records a reference analysis result, the input parameters for the latest program for analysis and the analysis result and the comments in the task information package datum. After completing several trials of design, the design task has been completed. The design process is presented in a graphical chart 1201 by using the relevant information processor presentation 105. The graphical chart does not present only the relational linkage of the documents (which are the results of the analysis) but the time-series order of the documents. Therefore the process of the trial for the analysis is clearly presented. In the graphical chart 1201, a new window 1202 shows the input parameter set used for the current analysis, the results of the analysis and the comments obtained in carrying out the task by directing the icon D with a cursor. It is also possible to start a new analysis while a past document is being selected for access. In this operation, an icon of a new document (which is an analysis result) is generated from the document (which is a past analysis result) as a reference information. The input parameter set of the document which is selected as the reference is used for the new analysis. The new document data (which is the new analysis result), the reference and document compilation relation are stored in a new document icon in which the input parameter set is updated with that used for the analysis. [0054] The systems shown in FIG. 1, FIG. 3 and FIG. 8 are constructed by the general computer hardware system and the computer software cooperating therewith. It is possible to construct the present invention in a dedicated system such as foreground graphical control and background computation for the simulation computation or the data transfer operation among plural data bases. [0055] In constructing the system for the present invention, the computer software program stored in a CD-ROM or a portable HDD is dumped into the system memories or the system hard disk of the computer system controlled by the central process unit. When the software program is distributed by a communication channel such as an internet, the program is once received in the file server and dumped to the system disk of the computer system that operates for the document management regarding the present invention. For the purpose of operating the present document management, personal computers, office computers and work stations can be used. [0056] In the above embodiment and examples, the system regarding the present invention can store all compiled documents in packages for every task, wherein the documents are used for the document management and the document retrieval and allows the user to easily comprehend the background knowledge and the finding by graphically presenting the relational linkage among the documents retrieved from a group of packages stored in the data base. There is a file system that has a hierarchy structure to manage a huge amount of documents. However the strict hierarchy needs restoring all these documents after when the storing system or rule of the documents has been changed. Since each document is kept in an independent file, it is not possible to comprehend the relational linkage among the documents. There is a solution to define a linkage of the relevant documents to each of the tasks. However the solution provides a linkage particular to the task and does not support the user to comprehend a group of documents created for plural tasks. In addition, it is difficult to comprehend the background knowledge and the finding both obtained during carrying out the tasks. And the difficulty still remains after completing all relevant tasks and projects. The present invention has an advantage to solve these problems by such a system that comprises the task information package generator to manage the task information package datum of the referred documents and the created documents in the compilation of the documents, the task information package data base to store the task information package datum and relevant information presentation processor that processes the presentation of the relational linkage such as reference to, compilation from and revision of other documents with regard to a specified document recorded in the task information package datum. The task information package generator has a function to register the comment information such as the knowledge and the finding obtained in carrying out in addition to the information of the referred documents and the compiled documents. The function to register the comment information can be implemented in another functional block independent from the task information package generator. [0057] In this system, it is possible to make a consolidated relational linkage for each of the tasks with retrieving all document information over the task information package data base. Since it is possible to refer to a file for the purpose of plural tasks, it is not necessary to explicitly create an file on a basis of directory system and therefore the users are not necessary to be aware of or careful to the storage directory of the file. It is possible to retrieve the information of which referenced document was used for a specific document and therefore possible to obtain the background knowledge and the finding at the time of creating the document. By tracing up the comment information, it is possible to comprehend the background knowledge and the finding regarding the document. It supports to clarify the relational linkage of the documents that have been created and referred to in the compilation of the document. The present system has no such hierarchy used for the conventional file management system and therefore it is not necessary to restore all documents after when the storing system or rule of the documents has been changed. It is possible to systematically comprehend the background knowledge and the finding after the completion of the tasks since the present system presents the creation process of the documents. Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5905980 *Sep 18, 1997May 18, 1999Fuji Xerox Co., Ltd.Document processing apparatus, word extracting apparatus, word extracting method and storage medium for storing word extracting programUS6865713 *Aug 7, 1998Mar 8, 2005International Business Machines CorporationApparatus, program product and method of annotating a hypertext document with commentsUS20040167921 *Dec 17, 2003Aug 26, 2004Verdasys, Inc.Identifying history of modification within large collections of unstructured data* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS7383500 *Apr 30, 2004Jun 3, 2008Microsoft CorporationMethods and systems for building packages that contain pre-paginated documentsUS7673235Mar 2, 2010Microsoft CorporationMethod and apparatus for utilizing an object model to manage document parts for use in an electronic documentUS7752235Jan 25, 2006Jul 6, 2010Microsoft CorporationMethod and apparatus for maintaining relationships between parts in a packageUS7752632Jul 6, 2010Microsoft CorporationMethod and system for exposing nested data in a computer-generated document in a transparent mannerUS7755786Jul 13, 2010Microsoft CorporationSystems and methods for support of various processing capabilitiesUS7770180Aug 3, 2010Microsoft CorporationExposing embedded data in a computer-generated documentUS7836094Jan 25, 2006Nov 16, 2010Microsoft CorporationMethod and apparatus for maintaining relationships between parts in a packageUS8024648Sep 20, 2011Microsoft CorporationPlanar mapping of graphical elementsUS8024653 *Sep 20, 2011Make Sence, Inc.Techniques for creating computer generated notesUS8108389Jan 31, 2012Make Sence, Inc.Techniques for knowledge discovery by constructing knowledge correlations using concepts or termsUS8122350Mar 21, 2008Feb 21, 2012Microsoft CorporationPackages that contain pre-paginated documentsUS8126890Dec 21, 2005Feb 28, 2012Make Sence, Inc.Techniques for knowledge discovery by constructing knowledge correlations using concepts or termsUS8140559Jun 27, 2006Mar 20, 2012Make Sence, Inc.Knowledge correlation search engineUS8166386 *Apr 24, 2012Chung-Yuh ChangMethod and system for producing patent specificationUS8243317Aug 14, 2012Microsoft CorporationHierarchical arrangement for spooling job dataUS8363232Sep 10, 2004Jan 29, 2013Microsoft CorporationStrategies for simultaneous peripheral operations on-line using hierarchically structured job informationUS8392417May 22, 2007Mar 5, 2013David P. GoldSystem and method for organizing, processing and presenting informationUS8639723Mar 11, 2009Jan 28, 2014Microsoft CorporationSpooling strategies using structured job informationUS8661332Apr 30, 2004Feb 25, 2014Microsoft CorporationMethod and apparatus for document processingUS8898134Feb 21, 2012Nov 25, 2014Make Sence, Inc.Method for ranking resources using node poolUS9213689Sep 6, 2011Dec 15, 2015Make Sence, Inc.Techniques for creating computer generated notesUS9311601Dec 14, 2011Apr 12, 2016Make Sence, Inc.Techniques for knowledge discovery by constructing knowledge correlations using concepts or termsUS20050273701 *Apr 30, 2004Dec 8, 2005Emerson Daniel FDocument mark up methods and systemsUS20060167931 *Dec 21, 2005Jul 27, 2006Make Sense, Inc.Techniques for knowledge discovery by constructing knowledge correlations using concepts or termsUS20060190815 *Apr 5, 2006Aug 24, 2006Microsoft CorporationStructuring data for word processing documentsUS20060253431 *Nov 14, 2005Nov 9, 2006Sense, Inc.Techniques for knowledge discovery by constructing knowledge correlations using termsUS20070061742 *Aug 26, 2005Mar 15, 2007Brooks Geoffrey SMethod, system, and program product for graphical authoringUS20080021701 *Jun 12, 2007Jan 24, 2008Mark BobickTechniques for Creating Computer Generated NotesUS20080313528 *Mar 9, 2008Dec 18, 2008Chung-Yuh ChangMethod and system for producing patent specificationUS20090177668 *Jan 8, 2008Jul 9, 2009International Business Machines CorporationTerm-Driven Records File Plan and Thesaurus DesignUS20130346900 *Jun 21, 2012Dec 26, 2013Justin Frank MatejkaSystems and methods for visualizing relationships between publications* Cited by examinerClassifications U.S. Classification715/853, 707/E17.008International ClassificationG09G5/00, G06F17/21, G06F17/30Cooperative ClassificationG06F17/30011European ClassificationG06F17/30DLegal EventsDateCodeEventDescriptionJan 23, 2004ASAssignmentOwner name: HITACHI, LTD., JAPANFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:WATANABE, NORITO;HARASHIMA, ICHIRO;NONAKA, HISANORI;AND OTHERS;REEL/FRAME:014935/0127;SIGNING DATES FROM 20031212 TO 20031224RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services