Source: http://www.google.com/patents/US6983236?dq=5,742,768
Timestamp: 2014-03-12 18:45:57
Document Index: 357129736

Matched Legal Cases: ['Application No. 60', 'Application No. 60', 'Application No. 60', 'Application No. 60', 'Application No. 60', 'Application No. 60', 'Application No. 60', 'Application No. 60', 'Application No. 60', 'Application No. 60', 'Application No. 60']

Patent US6983236 - Method for system-constraint-based selection for design components - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsA method and system for engineering discovery. A block diagram of a system can be further refined by building a basic search query listing the functional requirements for block. The search query can be expanded by selecting one or more saved rules. A database can return components or subsystems that...http://www.google.com/patents/US6983236?utm_source=gb-gplus-sharePatent US6983236 - Method for system-constraint-based selection for design componentsAdvanced Patent SearchPublication numberUS6983236 B1Publication typeGrantApplication numberUS 09/689,178Publication dateJan 3, 2006Filing dateOct 11, 2000Priority dateOct 12, 1999Fee statusLapsedPublication number09689178, 689178, US 6983236 B1, US 6983236B1, US-B1-6983236, US6983236 B1, US6983236B1InventorsNeven Karlovac, Larry Yen, Gregg Fialcowitz, Narashimhan Kishore Mandeyam, Martin Shum, Ravi SajwanOriginal AssigneeAprisa, Inc.Export CitationBiBTeX, EndNote, RefManPatent Citations (13), Non-Patent Citations (6), Referenced by (13), Classifications (4), Legal Events (4) External Links: USPTO, USPTO Assignment, EspacenetMethod for system-constraint-based selection for design componentsUS 6983236 B1Abstract A method and system for engineering discovery. A block diagram of a system can be further refined by building a basic search query listing the functional requirements for block. The search query can be expanded by selecting one or more saved rules. A database can return components or subsystems that meet the criteria from the basic search query or the expanded search query. One or more candidates can be chosen from the answer set and assigned to the block. A system-constraint-based selection can compare combinations of the candidate components against a set of predefined criteria to indicate the components to be used for the system which meet those criteria. The design of the system can be accomplished by using generic descriptions rather than blocks.
U.S. Provisional Application No. 60/158,962, filed on Oct. 12, 1999, entitled �Method for Building an Accreted Database and User-Defined Database Rules�; U.S. Provisional Application No. 60/158,428, filed on Oct. 12, 1999, entitled �Application of Accretive Knowledge Base to Engineering Discovery�; U.S. Provisional Application No. 60/158,440, filed on Oct. 12, 1999, entitled �Creation of Objects from Rules�; U.S. Provisional Application No. 60/158,963, filed on Oct. 12, 1999, entitled �Generic Method and System for Modeling Objects�; U.S. Provisional Application No. 60/158,439, filed on Oct. 12, 1999, entitled �Rendering Object Hierarchy and Object Relationships into Block Diagrams�; U.S. Provisional Application No. 60/158,429, filed on Oct. 12, 1999, entitled �Retention of Search Engine Rules for Individual Users�; U.S. Provisional Application No. 60/158,431, filed on Oct. 12, 1999, entitled �Method and System for Establishing Relationships, Constraints, and Rules Among Objects�; U.S. Provisional Application No. 60/158,430, filed on Oct. 12, 1999, entitled �Method and Search Engine for the Extraction and Retrieval of Tiered, Logical and Relational Information from a Plurality of Sources�; U.S. Provisional Application No. 60/158,438, filed on Oct. 12, 1999, entitled �Method and Computer Program for Tokenizing Rules and Search Engine Queries�; U.S. Provisional Application No. 60/167,630, filed on Nov. 26, 1999, entitled �Tool for Discovery and Heuristic System Design�; and U.S. Provisional Application No. 60/239,617, filed on Oct. 11, 2000, entitled �CircuitNet: A Tool for Discovery and Heuristic System Design.� The contents of these provisional applications are incorporated herein by reference.
The high-tech research and development process is highly complex and consists of three logical phases �Discovery, Design and Implementation. The most crucial phase is the Discovery phase because it provides the foundation for a product's development and, if incomplete, may result in a product that is non-competitive or unprofitable, has a short life cycle or violates others' intellectual property. Rather than a linear process, the Discovery phase is an extensive, iterative and organic process, frequently requiring a collaborative, as opposed to an individual, effort. During the Discovery phase, engineers conceptualize an idea, break it down into manageable elements, identify a finite set of possible solutions for each element, test each solution against predefined performance criteria and finally select the optimal solution, while ensuring the interdependencies between each element remains intact. In one method too accomplish this, engineers: (1) create a block diagram of their concept; (2) research vast amounts of specialized information such as algorithms and standards from leading research institutions and industry forums; (3) verify the product concept against protected art to ensure uniqueness; (4) consider the optimal hardware architecture and components to implement the design; (5) investigate available firmware and software from third-party developers to determine �make or buy� decisions; and (6) repeat these steps for each block in their diagram, as many times as necessary to select the optimal component or subsystem for each block, while ensuring the interdependencies between each block remain intact.
Technology such as algorithms, electronic components and software code can typically be used in multiple applications, yet the few engineering-related databases available on the Internet today lack functionality necessary to enable engineers to search effectively. For example, most of the component databases have been structured according to part number, pricing information and other attributes targeted primarily for procurement �these characteristics are not very useful for engineers. As a result, engineers must still undertake time-consuming searches off-line to complete an effective Discovery process.
SUMMARY OF THE INVENTION This invention can be regarded as a computerized discovery tool for engineers. In one embodiment of the invention, a system design is composed of at least two generic descriptions. (The generic descriptions may be blocks of a block diagram.) A database of objects is queried to find potential components or subsystems for two of the generic descriptions. The combinations of the potential components or subsystems are tested against one or more predefined system constraints so that at least one solution set can be chosen. The solution set is the combinations of components or subsystems for the generic descriptions which best meets the predefined system constraints.
With the present invention's method, an engineer breaks the discovery process into iterative steps. The engineer chooses one of the blocks from the block diagram for current research (step 120). To retrieve all components which can be used to implement this block, the engineer constructs a search query which includes the necessary limitations. Suppose the engineer is designing a simple computer system made up of a CPU, a memory, and a clock. For various reasons, the engineer may determine that the CPU must operate at least at a speed of 400 megahertz. Because of business restrictions, the engineer may be prevented from utilizing any components manufactured by a certain corporation (�XYZ Corp.� for example). The CPU may need to be PC compatible and have an operating voltage of between 2.2 and 3.3 volts. From these limitations, the engineer can build a series of search query rules, such as:
Manufacturer != �XYZ�
Compatibility = �PC�
Rule 1: Voltage BETWEEN (2.2, 3.3) Rule 2: Manufacturer=�Intel� Rule 3: Manufacturer!=�XYZ� Rule 4: Compatibility=�PC� Rule 5: Availability=�Immediate� With these rules saved, to building the previous search request because simpler. Now the search request is:
User Interface 250 Discovery tool 200 includes a user interface 250 on a user's computer, which allows the user to interact with the functionality of the discovery tool 200. The user interface 250 allows the user to search for various components and designs, to build interpretive rules, and to validate a design through the compatibility checking function. The user interface 250 can be substantiated as set of Active Server Pages (�ASPs�), HTML pages and graphics that access the various C++ objects of the rest of the system.
The Data Exchange module 210 loads data into the databases. The data exchange 210 includes two parts�the Input Data Processor and the Rules Exchange. The input data processor is a software utility that imports component specifications into the search database 215, based on initial directives and interpretive rules in the rules database 220. The input data processor is a client/server program, written in Visual Basic and VC++, that runs as an independent utility used by a system administrator. The rules exchange is a set of VC++ routines that are built to interact with specific third-party software systems. It runs both as a stand-alone utility and as an interface initiated from the user environment.
It recognizes multiple �levels� of attributes, like a table for a given attribute, as sub-=attributes of a product.
i) If matched link is on visited list, continue on next match ii) Add matched link to visited list iii) Concatentate directory onto current path iv) If rule is terminal, and modification time of the linked document is not equal to the existing local copy of that document, retrieve it preserving modification time, and save it under path v) If rule is nonterminal, the link matches base URL of current resource, the content type is HTML, and depth is not greater than the site's limit, then add job with new url/path, and depth+1 5) Go to step 3 Transaction Engine 205 The Transaction Engine 205 is a common platform for the transfer of these types of transactions, operating securely and with speed. It is built as a set of VC++ objects running on an NT server, with Microsoft's Site Server Commerce Edition (�SSCE�) and Microsoft's transaction management platform. SSCE is integrated into the discovery tool environment to handle data and sales transactions through the SSCE Commerce Interchange Pipeline (�CIP�). Specific transaction classes provide interaction with partners and vendors for data updates.
Referring to FIG. 2, the interconnections of the discovery tool 200 can be described by walking through an example of a user executing a search request. First, the user creates the search query. The query can be modified by: (1) filters, such as �not including�; (2) references to specific constraints to attributes of specific objects (such as �SLIC package-width not>5 mm�); (3) references to already existing user rules; or (4) processing options (such as �apply rules on request�).
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS5295261 *Jul 27, 1990Mar 15, 1994Pacific Bell CorporationHybrid database structure linking navigational fields having a hierarchial database structure to informational fields having a relational database structureUS5555345 *Mar 3, 1992Sep 10, 1996Atr Interpreting Telephony Research LaboratoriesLearning method of neural networkUS5808613 *May 28, 1996Sep 15, 1998Silicon Graphics, Inc.Network navigator with enhanced navigational abilitiesUS5889951 *May 13, 1996Mar 30, 1999Viewpoint CorporationSystems, methods, and computer program products for accessing, leasing, relocating, constructing and modifying internet sites within a multi-dimensional virtual reality environmentUS5923330 *Aug 12, 1996Jul 13, 1999Ncr CorporationSystem and method for navigation and interaction in structured information spacesUS5935210 *Nov 27, 1996Aug 10, 1999Microsoft CorporationMapping the structure of a collection of computer resourcesUS5987469 *May 13, 1997Nov 16, 1999Micro Logic Corp.Method and apparatus for graphically representing information stored in electronic mediaUS6005504 *Jan 20, 1998Dec 21, 1999Sony CorporationPosition information encoding apparatus and method thereof, position information decoding apparatus and method thereof, and map information processing apparatus and method thereofUS6035330 *Mar 29, 1996Mar 7, 2000British TelecommunicationsWorld wide web navigational mapping system and methodUS6069632 *Jul 3, 1997May 30, 2000International Business Machines CorporationPassageway properties: customizable protocols for entry and exit of placesUS6070176 *Jan 30, 1997May 30, 2000Intel CorporationMethod and apparatus for graphically representing portions of the world wide webUS6073115 *Oct 7, 1997Jun 6, 2000Marshall; Paul StevenVirtual reality generator for displaying abstract informationUS6144962 *Apr 11, 1997Nov 7, 2000Mercury Interactive CorporationVisualization of web sites and hierarchical data structures* Cited by examinerNon-Patent CitationsReference1Ben Schneiderman, Treemaps for space-constrained visualization of hierarchies, Human-Computer Interaction Lab, University of Maryland, Dec. 26, 1998, updated Apr. 17, 2000.2 *Ben Schneiderman, Treemaps for Space-Constrained Visualization of Hierarchies, Human-Computer Interaction Laboratory, University of Maryland, Dec. 26, 1998, updated Apr. 17, 2000.3Keith Andrews, Josef Wolte, and Michael Pichler, Information Pyramids(TM): A New Approach to Visualising Large Hierarchies, Late Breaking Hot Topics Proc., IEEE Visualization '97, Phoenix, AZ, Oct. 1997, pp. 49-52.4 *Keith Andrews, Josef Wolte, and Michael Pichler, Information Pyramids: A New Approach to Visualisingt Large Hierarchies, Late Breaking Hot Topics Proceedings IEEE Visualization '97, Phoenix, Arizona, Oct. 1997, pp. 49-52.5 *Mark Bruis, Kees Huizing, and Jake J. Van Wijk, Squarified Treemaps, Eindhoven University of Technology, Department of Mathematics and Computer Sciences, The Netherlands.6Mark Bruls, Kees Huizing, and Jarke J. van Wijk, Squarified Treemaps, Eindhoven University of Technology, Dept. of Mathematics and Computer Sciences, The Netherlands.* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS7082470 *Jun 28, 2000Jul 25, 2006Joel LesserSemi-automated linking and hosting methodUS7349838 *Jun 30, 2004Mar 25, 2008Summers Gary JManagement training simulation method and systemUS7720931 *Oct 13, 2006May 18, 2010International Business Machines CorporationSystem and method of remotely managing and loading artifactsUS7739260Dec 28, 2006Jun 15, 2010Scientific Components CorporationDatabase search system using interpolated data with defined resolutionUS7761442Mar 29, 2007Jul 20, 2010Scientific Components CorporationDatabase search system for high frequency electronic componentsUS7761559Oct 13, 2006Jul 20, 2010International Business Machines CorporationSystem and method of remotely managing and loading artifactsUS7853671Jul 31, 2006Dec 14, 2010At&T Intellectual Property I, L.P.System and method for performing a comprehensive comparison of system designsUS7886042 *Dec 19, 2006Feb 8, 2011Yahoo! Inc.Dynamically constrained, forward scheduling over uncertain workloadsUS8332789May 10, 2011Dec 11, 2012National Semiconductor CorporationPower supply optimization for electrical circuits designed over the internetUS8396695 *May 6, 2010Mar 12, 2013Honeywell International Inc.Reference model for production plants and related system and methodUS8417502Jun 11, 2010Apr 9, 2013Scientific Components CorporationMixer harmonics calculatorUS20080221834 *Mar 9, 2007Sep 11, 2008General Electric CompanyMethod and system for enhanced fault detection workflowUS20110276160 *May 6, 2010Nov 10, 2011Honeywell International Inc.Reference model for production plants and related system and method* Cited by examinerClassifications U.S. Classification703/22International ClassificationG06F9/45Cooperative ClassificationG06Q30/0603European ClassificationG06Q30/0603Legal EventsDateCodeEventDescriptionFeb 23, 2010FPExpired due to failure to pay maintenance feeEffective date: 20100103Jan 3, 2010LAPSLapse for failure to pay maintenance feesJul 13, 2009REMIMaintenance fee reminder mailedDec 21, 2004ASAssignmentOwner name: APRISA, INC., CALIFORNIAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:YEN, LARRY;FIALCOWITZ, GREGG;KARLOVAC, NEVEN;AND OTHERS;REEL/FRAME:015482/0892;SIGNING DATES FROM 20010122 TO 20010124RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google