The present disclosure relates to the field of computers, and specifically to the use of computers in allocating resources. Still more particularly, the present disclosure relates to the use of computers to allocate resources to multiple business entities.
A processor-implemented method, system and/or computer program product allocates multiple resources from multiple organizations. A series of requests for multiple resources from multiple organizations is received. The multiple resources are required to accomplish a specific task, and each of the multiple resources is assigned a probability of consumption. Probabilities of availability of the multiple resources are then determined and transmitted to the organizations.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including, but not limited to, wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
With reference now to the figures, and in particular to
Computer 102 includes a processor 104 that is coupled to a system bus 106. Processor 104 may utilize one or more processors, each of which has one or more processor cores. A video adapter 108, which drives/supports a display 110, is also coupled to system bus 106. In one embodiment, a switch 107 couples the video adapter 108 to the system bus 106. Alternatively, the switch 107 may couple the video adapter 108 to the display 110. In either embodiment, the switch 107 is a switch, which may be mechanical, that allows the display 110 to be coupled to the system bus 106, and thus to be functional only upon execution of instructions (e.g., resource allocating logic—RAL 148 described below) that support the processes described herein.
System bus 106 is coupled via a bus bridge 112 to an input/output (I/O) bus 114. An I/O interface 116 is coupled to I/O bus 114. I/O interface 116 affords communication with various I/O devices, including a keyboard 118, a mouse 120, a media tray 122 (which may include storage devices such as CD-ROM drives, multi-media interfaces, etc.), a printer 124, and (if a VHDL chip 137 is not utilized in a manner described below), external USB port(s) 126. While the format of the ports connected to I/O interface 116 may be any known to those skilled in the art of computer architecture, in one embodiment some or all of these ports are universal serial bus (USB) ports.
As depicted, computer 102 is able to communicate with a software deploying server 150 using a network interface 130. Network 128 may be an external network such as the Internet, or an internal network such as an Ethernet or a virtual private network (VPN).
A hard drive interface 132 is also coupled to system bus 106. Hard drive interface 132 interfaces with a hard drive 134. In one embodiment, hard drive 134 populates a system memory 136, which is also coupled to system bus 106. System memory is defined as a lowest level of volatile memory in computer 102. This volatile memory includes additional higher levels of volatile memory (not shown), including, but not limited to, cache memory, registers and buffers. Data that populates system memory 136 includes computer 102's operating system (OS) 138 and application programs 144.
OS 138 includes a shell 140, for providing transparent user access to resources such as application programs 144. Generally, shell 140 is a program that provides an interpreter and an interface between the user and the operating system. More specifically, shell 140 executes commands that are entered into a command line user interface or from a file. Thus, shell 140, also called a command processor, is generally the highest level of the operating system software hierarchy and serves as a command interpreter. The shell provides a system prompt, interprets commands entered by keyboard, mouse, or other user input media, and sends the interpreted command(s) to the appropriate lower levels of the operating system (e.g., a kernel 142) for processing. Note that while shell 140 is a text-based, line-oriented user interface, the present invention will equally well support other user interface modes, such as graphical, voice, gestural, etc.
As depicted, OS 138 also includes kernel 142, which includes lower levels of functionality for OS 138, including providing essential services required by other parts of OS 138 and application programs 144, including memory management, process and task management, disk management, and mouse and keyboard management.
Application programs 144 include a renderer, shown in exemplary manner as a browser 146. Browser 146 includes program modules and instructions enabling a world wide web (WWW) client (i.e., computer 102) to send and receive network messages to the Internet using hypertext transfer protocol (HTTP) messaging, thus enabling communication with software deploying server 150 and other described computer systems.
Application programs 144 in computer 102's system memory (as well as software deploying server 150's system memory) also include a resource allocating logic (RAL) 148. RAL 148 includes code for implementing the processes described below, including those described in
Also stored in system memory 136 is a VHDL (VHSIC hardware description language) program 139. VHDL is an exemplary design-entry language for field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), and other similar electronic devices. In one embodiment, execution of instructions from RAL 148 causes VHDL program 139 to configure VHDL chip 137, which may be an FPGA, ASIC, etc.
In another embodiment of the present invention, execution of instructions from RAL 148 results in a utilization of VHDL program 139 to program a VHDL emulation chip 151. VHDL emulation chip 151 may incorporate a similar architecture as described above for VHDL chip 137. Once RAL 148 and VHDL program 139 program VHDL emulation chip 151, VHDL emulation chip 151 performs, as hardware, some or all functions described by one or more executions of some or all of the instructions found in RAL 148. That is, the VHDL emulation chip 151 is a hardware emulation of some or all of the software instructions found in RAL 148. In one embodiment, VHDL emulation chip 151 is a programmable read only memory (PROM) that, once burned in accordance with instructions from RAL 148 and VHDL program 139, is permanently transformed into a new circuitry that performs the functions needed to perform the process described below in
The hardware elements depicted in computer 102 are not intended to be exhaustive, but rather are representative to highlight essential components required by the present invention. For instance, computer 102 may include alternate memory storage devices such as magnetic cassettes, digital versatile disks (DVDs), Bernoulli cartridges, and the like. These and other variations are intended to be within the spirit and scope of the present invention.
Referring now to
With reference now to
As depicted in block 306, a resource type is defined for each of the multiple resources to create multiple resource type requests. Thus, each time an organization/enterprise requests a resource, these requests will be in resource-specific formats. Thus, if the request is for personnel, then the request will contain a flag or similar indicator letting the resource allocating system know that personnel, not hardware or other resources, are needed. Similarly, if the organization requests material such as tissue for medical research, then the resource allocating system will detect a tag in the request so indicating. As depicted in block 308, by matching these tags/flags/indicators from the resource request, the resource request can be matched to a specific analytic engine. Analytic engines are logic that match requests to specific resources based on the resource availability, any constraints on the resources (i.e., does the requesting organization have the proper environment to support the resource, such as hardware to run certain types of software, storage facilities to store tissue samples, funds to pay personnel, etc.), whether the organization has used the requested resource in the past (thus indicating that the request is “serious” rather than speculative), etc. In one embodiment, each different analytic engine uses a different analytic technique to produce one or more solution sets for locating and apportioning resources needed to satisfy a best solution to each of the multiple resource type requests. A best solution is a solution that is deemed to comply with predefined parameters (i.e., rules for the organization, legal requirements, etc.) and constraints (described herein) for that resource and the requesting organization.
As described in block 310, a unique thread for each solution set for each of the multiple resource type requests is generated and labeled. This thread is a software thread that is executed by allocation logic (e.g., allocation logic 208) within the resource allocating system. By creating a unique thread for each of the solution sets created by the analytic engines, the system allows solutions to be spawned off during the middle of optimization of the overall solution set, thus permitting fine granularity for updating/improving the solutions. As depicted in query block 312, a determination is made as to whether the best solution (i.e., allocating the proper resource in response to the resource request from the enterprise/organization) has been found by a specific analytic engine. If not then there are two options. As described in block 314, one option is to locate additional resources for use by the specific analytic engine. In this option, the assumption is made that the analytic engine used to match the request with the optimal resource is the right engine, but it simply has not been afforded access to the right resources. As described in block 316, another option is to transmit the resource type request to another analytic engine. In this option, the assumption is that the logic within the first analytic engine simply does not have the ability to match the request with the proper resource, and thus another analytic engine is needed. In one embodiment, the optimal analytic engine is matched (determined) based on a probability of the task being performed. Thus, one analytic engine may have access to a large array of resources, since those resources have dealt with that analytic engine in the past, and know that there is a high probability that the resources will ultimately be allocated to the requesting organization. For example, assume that the organization includes a Nobel laureate, who always gets whatever she wants from the organization and resource community. Requests from this organization would be directed to a “high probability” analytic engine, which would have access to many resources. However, a resource request from a lower-tier requester, such as one who has a history of not receiving applied-for grants, or simply has no history at all, would be directed to send her requests to a “low probability” analytic engine, which would have access to fewer resources (or to higher-priced resources).
As described in block 318, once the best solution to the resource request is found, the threads for the best solutions to the multiple resource type requests are reassembled into a synthetic event. This synthetic event, which is an emulation of the task and the task's completion using the allocated resources, matches a description of the task to which the resources will be allocated, and maintains a probabilistic, time period sensitive inventory of resources, requests, and demand likelihood of fulfilling the multiple resource type requests. Thus, the synthetic event describes which resources will be allocated, when they will be allocated, and the likelihood that they in fact will be allocated to the specific task/organization. A resource type is defined for each of the multiple resources to create multiple resource type notifications (block 320). Thus, each resource type has a unique notification type (marked by tags/flags). As each of the multiple resources has now been assigned a probability of consumption, these probabilities are then transmitted as part of the unique notification types to the multiple organizations that have requested the resources (block 322). It is then incumbent on the requester to accept whatever probability of availability has been assigned for a specific set of resources. If the requester accepts this probability of availability, then the resource set is allocated to (i.e., reserved for and/or transmitted to) the requester (block 324). The process ends at terminator block 326.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of various embodiments of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.
Note further that any methods described in the present disclosure may be implemented through the use of a VHDL (VHSIC Hardware Description Language) program and a VHDL chip. VHDL is an exemplary design-entry language for Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), and other similar electronic devices. Thus, any software-implemented method described herein may be emulated by a hardware-based VHDL program, which is then applied to a VHDL chip, such as a FPGA.
Having thus described embodiments of the invention of the present application in detail and by reference to illustrative embodiments thereof, it will be apparent that modifications and variations are possible without departing from the scope of the invention defined in the appended claims.
The present application is a continuation of U.S. patent application Ser. No. 12/795,847, filed on Jun. 8, 2010, and entitled, “Probabilistic Optimization of Resource Discovery, Reservation and Assignment,” which is incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
2671443 | Holland | Mar 1954 | A |
3711152 | Sirpak et al. | Jan 1973 | A |
4803625 | Fu et al. | Feb 1989 | A |
4883063 | Bernard et al. | Nov 1989 | A |
4890227 | Watanabe et al. | Dec 1989 | A |
5024225 | Fang | Jun 1991 | A |
5070453 | Duffany | Dec 1991 | A |
5111391 | Fields et al. | May 1992 | A |
5128871 | Schmitz | Jul 1992 | A |
5148365 | Dembo | Sep 1992 | A |
5167230 | Chance | Dec 1992 | A |
5216593 | Dietrich et al. | Jun 1993 | A |
5590648 | Mitchell et al. | Jan 1997 | A |
5601435 | Quy | Feb 1997 | A |
5764740 | Holender | Jun 1998 | A |
5838918 | Prager et al. | Nov 1998 | A |
5880598 | Duong | Mar 1999 | A |
6021403 | Horvitz et al. | Feb 2000 | A |
6049776 | Donnelly et al. | Apr 2000 | A |
6076166 | Moshfeghi et al. | Jun 2000 | A |
6102856 | Groff et al. | Aug 2000 | A |
6144837 | Quy | Nov 2000 | A |
6164975 | Weingarden et al. | Dec 2000 | A |
6212524 | Weissman et al. | Apr 2001 | B1 |
6272483 | Joslin et al. | Aug 2001 | B1 |
6289340 | Puram et al. | Sep 2001 | B1 |
6321207 | Ye | Nov 2001 | B1 |
6381577 | Brown | Apr 2002 | B1 |
6449641 | Moiin et al. | Sep 2002 | B1 |
6466232 | Newell et al. | Oct 2002 | B1 |
6484155 | Kiss et al. | Nov 2002 | B1 |
6578068 | Bowman-Amuah | Jun 2003 | B1 |
6604160 | Le et al. | Aug 2003 | B1 |
6647374 | Kansal | Nov 2003 | B2 |
6675159 | Lin et al. | Jan 2004 | B1 |
6885936 | Yashio et al. | Apr 2005 | B2 |
6889137 | Rychlak | May 2005 | B1 |
6905816 | Jacobs et al. | Jun 2005 | B2 |
6937147 | Dilbeck et al. | Aug 2005 | B2 |
6954736 | Menninger et al. | Oct 2005 | B2 |
7149533 | Laird et al. | Dec 2006 | B2 |
7181428 | Lawrence | Feb 2007 | B2 |
7213009 | Pestotnik | May 2007 | B2 |
7221928 | Laird et al. | May 2007 | B2 |
7243024 | Endicott | Jul 2007 | B2 |
7295925 | Breed et al. | Nov 2007 | B2 |
7319386 | Collins et al. | Jan 2008 | B2 |
7343316 | Goto et al. | Mar 2008 | B2 |
7400257 | Rivas | Jul 2008 | B2 |
7403922 | Lewis et al. | Jul 2008 | B1 |
7457764 | Bullock et al. | Nov 2008 | B1 |
7460019 | Henderson | Dec 2008 | B2 |
7464147 | Fakhouri et al. | Dec 2008 | B1 |
7516142 | Friedlander et al. | Apr 2009 | B2 |
7523118 | Friedlander et al. | Apr 2009 | B2 |
7539533 | Tran | May 2009 | B2 |
7539623 | Wyatt | May 2009 | B1 |
7542878 | Nanikashvili | Jun 2009 | B2 |
7558745 | Cullen et al. | Jul 2009 | B2 |
7584160 | Friedlander et al. | Sep 2009 | B2 |
7630948 | Friedlander et al. | Dec 2009 | B2 |
7630986 | Herz et al. | Dec 2009 | B1 |
7647288 | Friedlander et al. | Jan 2010 | B2 |
7693736 | Chu et al. | Apr 2010 | B1 |
7702605 | Friedlander et al. | Apr 2010 | B2 |
7739606 | Sawada et al. | Jun 2010 | B2 |
7752154 | Friedlander et al. | Jul 2010 | B2 |
7801885 | Verma | Sep 2010 | B1 |
7930262 | Friedlander et al. | Apr 2011 | B2 |
7933228 | Coley | Apr 2011 | B2 |
7935076 | Estes et al. | May 2011 | B2 |
7937214 | Kaneda et al. | May 2011 | B2 |
8001008 | Engle | Aug 2011 | B2 |
8010516 | Ishii et al. | Aug 2011 | B2 |
8045455 | Agronow et al. | Oct 2011 | B1 |
8055603 | Angell et al. | Nov 2011 | B2 |
8204779 | Hughes et al. | Jun 2012 | B1 |
8207859 | Enegren et al. | Jun 2012 | B2 |
8207860 | Enegren et al. | Jun 2012 | B2 |
8370350 | Friedlander et al. | Feb 2013 | B2 |
8429182 | Brackett et al. | Apr 2013 | B2 |
20010034362 | Ross et al. | Oct 2001 | A1 |
20010039373 | Cunningham et al. | Nov 2001 | A1 |
20010051765 | Walker et al. | Dec 2001 | A1 |
20020019764 | Mascarenhas | Feb 2002 | A1 |
20020035572 | Takatori et al. | Mar 2002 | A1 |
20020052756 | Lomangino | May 2002 | A1 |
20020059201 | Work | May 2002 | A1 |
20020107824 | Ahmed et al. | Aug 2002 | A1 |
20020111922 | Young et al. | Aug 2002 | A1 |
20020115447 | Martin et al. | Aug 2002 | A1 |
20020182573 | Watson | Dec 2002 | A1 |
20030033180 | Shekar et al. | Feb 2003 | A1 |
20030065544 | Elzinga et al. | Apr 2003 | A1 |
20030088491 | Liu et al. | May 2003 | A1 |
20030092976 | Murase et al. | May 2003 | A1 |
20030097291 | Freedman | May 2003 | A1 |
20030140063 | Pizzorno et al. | Jul 2003 | A1 |
20030177038 | Rao | Sep 2003 | A1 |
20030220830 | Myr | Nov 2003 | A1 |
20030220860 | Heytens et al. | Nov 2003 | A1 |
20040006694 | Heelan et al. | Jan 2004 | A1 |
20040122787 | Avinash et al. | Jun 2004 | A1 |
20040155772 | Medema et al. | Aug 2004 | A1 |
20040155815 | Muncaster et al. | Aug 2004 | A1 |
20040199056 | Husemann et al. | Oct 2004 | A1 |
20040243422 | Weber et al. | Dec 2004 | A1 |
20040267595 | Woodings et al. | Dec 2004 | A1 |
20050004823 | Hnatio | Jan 2005 | A1 |
20050004828 | DeSilva et al. | Jan 2005 | A1 |
20050037730 | Montague | Feb 2005 | A1 |
20050038608 | Chandra et al. | Feb 2005 | A1 |
20050080806 | Doganata et al. | Apr 2005 | A1 |
20050085257 | Laird et al. | Apr 2005 | A1 |
20050101873 | Misczynski et al. | May 2005 | A1 |
20050144062 | Mittal et al. | Jun 2005 | A1 |
20050149466 | Hale et al. | Jul 2005 | A1 |
20050165594 | Chandra et al. | Jul 2005 | A1 |
20050198486 | Desmond et al. | Sep 2005 | A1 |
20050222989 | Haveliwala et al. | Oct 2005 | A1 |
20050240668 | Rolia et al. | Oct 2005 | A1 |
20060010090 | Brockway et al. | Jan 2006 | A1 |
20060023848 | Mohler et al. | Feb 2006 | A1 |
20060031110 | Benbassat et al. | Feb 2006 | A1 |
20060036560 | Fogel | Feb 2006 | A1 |
20060069514 | Chow et al. | Mar 2006 | A1 |
20060105830 | Nemitz et al. | May 2006 | A1 |
20060118541 | Ellis et al. | Jun 2006 | A1 |
20060155627 | Horowitz | Jul 2006 | A1 |
20060184412 | Kagan et al. | Aug 2006 | A1 |
20060194186 | Nanda | Aug 2006 | A1 |
20060200435 | Flinn et al. | Sep 2006 | A1 |
20060206724 | Schaufele et al. | Sep 2006 | A1 |
20060208169 | Breed et al. | Sep 2006 | A1 |
20060218010 | Michon et al. | Sep 2006 | A1 |
20060226991 | Rivas | Oct 2006 | A1 |
20060294085 | Rose et al. | Dec 2006 | A1 |
20070073654 | Chow et al. | Mar 2007 | A1 |
20070073754 | Friedlander et al. | Mar 2007 | A1 |
20070073799 | Adjali et al. | Mar 2007 | A1 |
20070112261 | Enegren et al. | May 2007 | A1 |
20070112735 | Holloway et al. | May 2007 | A1 |
20070124058 | Kitagawa et al. | May 2007 | A1 |
20070150325 | Bjornson | Jun 2007 | A1 |
20070168307 | Floudas et al. | Jul 2007 | A1 |
20070174090 | Friedlander et al. | Jul 2007 | A1 |
20070174091 | Friedlander et al. | Jul 2007 | A1 |
20070174101 | Li et al. | Jul 2007 | A1 |
20070179356 | Wessel | Aug 2007 | A1 |
20070185737 | Friedlander et al. | Aug 2007 | A1 |
20070203872 | Flinn et al. | Aug 2007 | A1 |
20070244701 | Erlanger et al. | Oct 2007 | A1 |
20070274337 | Purpura | Nov 2007 | A1 |
20080015422 | Wessel | Jan 2008 | A1 |
20080015871 | Eder | Jan 2008 | A1 |
20080028409 | Cherkasova et al. | Jan 2008 | A1 |
20080065576 | Friedlander et al. | Mar 2008 | A1 |
20080077463 | Friedlander et al. | Mar 2008 | A1 |
20080082356 | Friedlander et al. | Apr 2008 | A1 |
20080082374 | Kennis et al. | Apr 2008 | A1 |
20080147694 | Ernest et al. | Jun 2008 | A1 |
20080155104 | Quinn et al. | Jun 2008 | A1 |
20080167929 | Cao et al. | Jul 2008 | A1 |
20080172352 | Friedlander et al. | Jul 2008 | A1 |
20080177687 | Friedlander et al. | Jul 2008 | A1 |
20080177688 | Friedlander et al. | Jul 2008 | A1 |
20080189402 | Betzler et al. | Aug 2008 | A1 |
20080208801 | Friedlander et al. | Aug 2008 | A1 |
20080208813 | Friedlander et al. | Aug 2008 | A1 |
20080208814 | Friedlander et al. | Aug 2008 | A1 |
20080208832 | Friedlander et al. | Aug 2008 | A1 |
20080208838 | Friedlander et al. | Aug 2008 | A1 |
20080208875 | Friedlander et al. | Aug 2008 | A1 |
20080208901 | Friedlander et al. | Aug 2008 | A1 |
20080208902 | Friedlander et al. | Aug 2008 | A1 |
20080208903 | Friedlander et al. | Aug 2008 | A1 |
20080208904 | Friedlander et al. | Aug 2008 | A1 |
20080209493 | Choi et al. | Aug 2008 | A1 |
20080221419 | Furman | Sep 2008 | A1 |
20080242509 | Menektchiev et al. | Oct 2008 | A1 |
20080246629 | Tsui et al. | Oct 2008 | A1 |
20080275321 | Furman | Nov 2008 | A1 |
20080281974 | Slothouber et al. | Nov 2008 | A1 |
20080288862 | Smetters et al. | Nov 2008 | A1 |
20080294459 | Angell et al. | Nov 2008 | A1 |
20080294692 | Angell et al. | Nov 2008 | A1 |
20090024553 | Angell et al. | Jan 2009 | A1 |
20090069787 | Estes et al. | Mar 2009 | A1 |
20090089149 | Lerner et al. | Apr 2009 | A1 |
20090106179 | Friedlander et al. | Apr 2009 | A1 |
20090112670 | Black et al. | Apr 2009 | A1 |
20090138300 | Kagan et al. | May 2009 | A1 |
20090140923 | Graves et al. | Jun 2009 | A1 |
20090198696 | Banks | Aug 2009 | A1 |
20090198733 | Gounares et al. | Aug 2009 | A1 |
20090267774 | Enegren et al. | Oct 2009 | A1 |
20090267775 | Enegren et al. | Oct 2009 | A1 |
20090270705 | Enegren et al. | Oct 2009 | A1 |
20090287503 | Angell et al. | Nov 2009 | A1 |
20090287674 | Bouillet et al. | Nov 2009 | A1 |
20090287683 | Bennett | Nov 2009 | A1 |
20090299766 | Friedlander et al. | Dec 2009 | A1 |
20090299928 | Kongtcheu | Dec 2009 | A1 |
20100010832 | Boute et al. | Jan 2010 | A1 |
20100042456 | Stinchcombe et al. | Feb 2010 | A1 |
20100056643 | Bachynsky et al. | Mar 2010 | A1 |
20100057655 | Jacobson et al. | Mar 2010 | A1 |
20100063877 | Soroca et al. | Mar 2010 | A1 |
20100077438 | Ansari | Mar 2010 | A1 |
20100131028 | Hsu et al. | May 2010 | A1 |
20100191516 | Benish et al. | Jul 2010 | A1 |
20100223581 | Manolescu et al. | Sep 2010 | A1 |
20100228715 | Lawrence | Sep 2010 | A1 |
20110054968 | Galaviz | Mar 2011 | A1 |
20110093287 | Dicks et al. | Apr 2011 | A1 |
20110190579 | Ziarno et al. | Aug 2011 | A1 |
20110246055 | Huck et al. | Oct 2011 | A1 |
20110251790 | Liotopoulos et al. | Oct 2011 | A1 |
20110275480 | Champsaur | Nov 2011 | A1 |
20110275907 | Inciardi et al. | Nov 2011 | A1 |
20110301967 | Friedlander et al. | Dec 2011 | A1 |
20120035971 | Friedlander et al. | Feb 2012 | A1 |
20120059227 | Friedlander et al. | Mar 2012 | A1 |
20120059815 | Friedlander et al. | Mar 2012 | A1 |
20120072460 | Friedlander et al. | Mar 2012 | A1 |
20120096032 | Brackett et al. | Apr 2012 | A1 |
20120108984 | Bennett et al. | May 2012 | A1 |
20120245479 | Ganesh et al. | Sep 2012 | A1 |
20130096966 | Barnes, Jr. | Apr 2013 | A1 |
20130109997 | Linke et al. | May 2013 | A1 |
Entry |
---|
U.S. Appl. No. 13/253,431—Non-Final Office Action Mailed Sep. 11, 2013. |
NIH Article, “Agepage—Hyperthermia: Too Hot for Your Health”, National Institute on Aging, National Institutes of Health, Jul. 2010, pp. 1-4. |
T. Vercauteren et al., “Hierarchical Forecasting of Web Server Workload Using Sequential Monte Carlo Training”, IEEE Transactions on Signal Processing, vol. 55, No. 4, pp. 1286-1297, Apr. 2007. (Abstract). |
P. Palazzari et al., “Synthesis of Pipelined Systems for the Contemporaneous Execution of Periodic and Aperiodic Tasks With Hard Real-Time Constraints”, 18th International Parallel and Distributed Processing Symposium, 121. IEEE Comput. Soc, Los Alamitos, CA, USA, 2004, pp. LVI-289. (Abstract). |
RL Dillon et al., “Optimal Use of Budget Reserves to Minimize Technical and Management Failure Risks During Complex Project Development”, IEEE Transactions on Engineering Management, vol. 52, No. 3, pp. 382-395, Aug. 2005. (Abstract). |
K. Vanthournout et al., “A Taxonomy for Resource Discovery”, Pers Ubiquit Comput 9, pp. 81-89, 2005. |
C. Srisuwanrat et al., “Optimal Scheduling of Probabilistic Repetitive Projects Using Completed Unit and Genetic Algorithms”, Proceedings of the 2007 Winter Simulation Conference, pp. 2151-2158, 2007. |
S. Bharathi et al., “Scheduling Data-Intensive Workflows on Storage Constrained Resources”, Works 09, Portland, or, pp. 1-10 Nov. 15, 2009. |
J. Redondo et al., “Solving the Multiple Competitive Facilities Location and Design Problem on the Plane”, Massachusetts Institute of Technology, Evolutionary Computation, vol. 17, No. 1, pp. 21-53, 2009. |
H. Van et al., “Autonomic Virtual Resource Management for Service Hosting Platforms”, Cloud'09, pp. 1-8 , May 23, 2009. |
U.S. Appl. No. 12/851,995—Non-Final Office Action Mailed Apr. 25, 2012. |
U.S. Appl. No. 12/875,261—Non-Final Office Action Mailed Feb. 14, 2012. |
U.S. Appl. No. 12/884,665—Non-Final Office Action Mailed Apr. 11, 2012. |
U.S. Appl. No. 13/253,431—Non-Final Office Action Mailed Nov. 10, 2011. |
U.S. Appl. No. 12/903,376—Non-Final Office Action Mailed Jul. 30, 2012. |
U.S. Appl. No. 12/875,261—Notice of Allowance Mailed Sep. 27, 2012. |
Phillip E. Hayes et al., “Picking Up the Pieces: Utilizing Disaster Recovery Project Management to Improve Readiness and Response Time,” IEEE Industry Applications Magazine, Nov./Dec. 2002, pp. 1-10 (Abstract). |
Kun Wang et al., “A Mathematical Approach to Disaster Recovery Planning,” Proceedings of the First International Conference on Semantics, Knowledge, and Grid, 2005, pp. 1-3 (Abstract). |
E. A. Silver, “An Overview of Heuristic Solution Methods,” the Journal of the Operational Research Society, vol. 55, No. 9, Sep. 2004, pp. 936-956 (Abstract). |
Smith et al., “Collaborative Approaches to Research,” HEFCE Fundamental Review of Research Policy and Planning, Final Report, Apr. 2000, pp. 1-117. |
William E. Souder, “Analytical Effectiveness of Mathematical Models for R&D Project Selection,” Management Science, vol. 19, No. 8, Application Seires, Apr. 1973, pp. 907-923 (Abstract). |
J. Altmann et al., “Cooperative Software Development: Concepts, Model and Tools,” Technology of Object-Oriented Languages and Systems, 1999, pp. 1-14. |
Shou-Qi Cao et al., “Research on Resource Scheduling for Development Process of Complicated Product,” Computer Supported Cooperative Work in Design, 2005. Proceedings of the Ninth International Conference on, vol. 1, pp. 229-233 (Abstract). |
Ming Chen et al., “Research on Organization Method of Development Activities for Complicated Product,” Computer Supported Cooperative Work in Design, 2005. Proceedings of the Ninth International Conference on, vol. 1, pp. 234-239 (Abstract). |
Luckham et al., “Event Processing Glossary,” Jul. 2008, pp. 1-19. complexevents.com. |
Dept of Health and Human Services Agency for Healthcare Research and Quality, “AHRQ Quality Indicators—Patient Safety Indicators—Technical Specifications,” 2012, pp. 1-149. qualityindicators.ahrq.gov. |
Wong et al., “Rule-Based Anomaly Pattern Detection for Detecting Disease Outbreaks,” AAAI-02 Proceedings, 2002, pp. 1-7. |
Grzymala-Busse, “Knowledge Acquisition Under Uncertainty—A Rough Set Approach,” Journal of Intelligent and Robotic Systems, 1988, vol. 1, Issue 1, pp. 3-16 (Abstract). |
Schadow et al., “Discussion Paper: Privacy-Preserving Distributed Queries for a Clinical Case Research Network,” IEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, 2002 (Abstract). |
U.S. Appl. No. 12/884,665—Final Office Action Mailed Oct. 18, 2012. |
U.S. Appl. No. 12/903,376—Notice of Allowance Mailed Dec. 19, 2012. |
U.S. Appl. No. 12/851,995—Final Office Action Mailed Nov. 8, 2012. |
U.S. Appl. No. 13/253,431—Non-Final Office Action Mailed Jan. 3, 2013. |
U.S. Appl. No. 12/851,995—Examiner's Answer Mailed May 10, 2013. |
U.S. Appl. No. 12/851,995—Supplemental Examiner's Answer Mailed May 22, 2013. |
U.S. Appl. No. 12/884,665—Examiner's Answer Mailed May 16, 2013. |
U.S. Appl. No. 13/253,431—Final Office Action Mailed May 21, 2013. |
U.S. Appl. No. 12/795,847—Non-Final Office Action Mailed Nov. 26, 2012. |
U.S. Appl. No. 12/795,847—Notice of Allowance Mailed Jun. 5, 2013. |
U.S. Appl. No. 13/253,431—Notice of Allowance mailed Oct. 22, 2014. |
Bashur et al., “TeleMedicine: A New Health Care Delivery System”, Annual Reviews Public Health 21 (2000): pp. 613-637, 2000. |
Blumrosen et al., “New Wearable Body Sensor for Continuous Diagnosis of Internal Tissue Bleeding”, in Proceedings of the 2009 Sixth International Workshop on Wearable and Implantable Body Sensor Networks, 5 pages, 2009. |
Gao et al., “Vital Signs Monitoring and Patient Tracking Over a Wireless Network”, in Proceedings of the 27th Annual International Conference of the IEEE EMBS, Shanghai, Sep. 2005, 4 pages. |
Hong et al., “A Wireless 3-Channel ECG Transmission System Using PDA Phone”, 2007 International Conference on Convergence Information Technology, IEEE Computer Society, pp. 462-465, 2007. |
Milenkovic et al., “Wireless Sensor Networks for Personal Health Monitoring: Issues and an Implementation”, Computer Communications 29 (2006): pp. 2521-2533, 2006. |
Morton et al., “Importance of Emergency Identification Schemes”, Emergency Medicine Journal 2002; 19: pp. 584-586, 2002. |
Shin et al., “Ubiquitous House and Unconstrained Monitoring Devices for Home Healthcare System”, in Proceedings of the 6th International Special Topic Conference on ITAB, 2007, Tokyo, pp. 201-204. |
U.S. Appl. No. 13/253,431—Non-Final Office Action Mailed Mar. 31, 2014. |
Mordecai, M. “Physiological Stats Monitoring for Firefighters: Watching Out for Overexertion Before It's Too Late”, firerescue1.com, Jun. 18, 2008, pp. 1-4. |
Number | Date | Country | |
---|---|---|---|
20130346996 A1 | Dec 2013 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12795847 | Jun 2010 | US |
Child | 14011806 | US |