Patent Grant
10387815
The present invention relates generally to computer automated activity based budget modeling, forecasting and cost accounting, and more particularly, but not exclusively to improving performance for generating report information.
Businesses that strive to remain viable and successful in today's competitive commercial environment are required to adopt accurate and responsive budgeting practices. To improve efficiency, businesses use financial models that apply modern budgeting, forecasting and cost accounting techniques. For some accounting techniques, the complexity of the financial allocation model may increase as the number of tracked activities and elements increases. Therefore, for larger enterprises, sophisticated computer programs and computers are often required to assist in generating useful and relevant budgets based on financial allocation models.
In some cases, the large number of items and entities required for financial modeling can make development of modeling applications difficult. Historically, the size and complexity of these financial allocation models have made it difficult to accurately ascertain a total cost of ownership for an offering such as a product and/or service. Further, the size and complexity of modern financial allocation models can make it difficult to generate reporting information based on the model. Thus, it is with respect to these considerations and others that the invention has been made.
Non-limiting and non-exhaustive embodiments of the present invention are described with reference to the following drawings. In the drawings, like reference numerals refer to like parts throughout the various figures unless otherwise specified. For a better understanding of the present invention, reference will be made to the following Description of the Various Embodiments, which is to be read in association with the accompanying drawings, wherein:
The present innovations now will be described more fully hereinafter with reference to the accompanying drawings, which form a part hereof, and which show, by way of illustration, specific embodiments by which the invention may be practiced. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. Among other things, the present invention may be embodied as methods or devices. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. The following detailed description is, therefore, not to be taken in a limiting sense.
Throughout the specification and claims, the following terms take the meanings explicitly associated herein, unless the context clearly dictates otherwise. The phrase “In one of the embodiments” or “in at least one of the various embodiments” as used herein does not necessarily refer to the same embodiment, though it may. Furthermore, the phrase “in another embodiment” as used herein does not necessarily refer to a different embodiment, although it may. Thus, as described below, various embodiments of the invention may be readily combined, without departing from the scope or spirit of the invention.
In addition, as used herein, the term “or” is an inclusive “or” operator, and is equivalent to the term “and/or,” unless the context clearly dictates otherwise. The term “based on” is not exclusive and allows for being based on additional factors not described, unless the context clearly dictates otherwise. In addition, throughout the specification, the meaning of “a,” “an,” and “the” include plural references. The meaning of “in” includes “in” and “on.”
As used herein, the terms “Financial allocation model,” “data model”, and “cost model” refers to a graph based representation of a system of resource allocation rules and/or financial allocation rules that may be used for costing actual expenditures (for management accounting),budgeting future expenditures, or modeling any type of quantitative resource (e.g., energy, power consumption, money, utilities, or the like). Nodes in the model may represent classes of items that may be associated with costs, expenses, resource generation, resource consumption, or the like. The edges of the graph may represent how the resources, such as, costs and/or expenses may be allocated between the nodes. A data model may be represented using a visual rendering of a graph showing the nodes and the edges connecting the nodes.
As used herein, the terms “cost line item,” or “line item” refer to a single line item in a data model and/or a budget (or finance allocation model) and its associated cost/expense in terms of resources. For example, the costs associated with a particular computer that is an email server may be a single item having a particular cost (e.g., the email server may correspond to a cost line item).
As used herein, the terms “category,” or “data object” refer to a set and/or class of cost line items that may be grouped together. Also, dataset information in fields of a dataset template may be mapped to one or more categories in a category template. For example, a collection of computers performing services such as email, web serving, enterprise resource planning, may represent separate cost line items and they may be grouped into the Servers category and/or data object.
As used herein, the terms “allocation rules,” “entity propagation rules,” or “propagation rules” refer to rules in the financial data model that determine how the costs/expenses (e.g., resources) from a category are apportioned between/among other categories. Also, such rules may be assigned to individual cost line items. For example, if an email server cost line item has a value of $1000, an allocation or entity propagation rule may be defined such that 50% of the expense may be allocated to the Marketing department and 50% may be allocated to the Engineering department. Also, allocation rules may be applied at the category as well as the cost line item level.
As used herein, the term “assignment ratios,” refers to the distribution ratio of resources, such as, costs that are allocated from a source object in a data model to a target object in the data model. The assignment ratios describe how resources flow from cost line items in the source object to cost line items in the target object. For example, if a model has a Server object allocating $1000 to a Department object, the assignment ratios describe how the $1000 is allocated from the cost line items (particular servers) in the Server object to the cost line items in the Department object (particular departments). Accordingly, for example, if the Servers object (the source object) includes a cost line item for an Email Server that allocates $800 to the Engineering Department and $200 to the Marketing Department, the assignment ratio for Email Server to Engineering Department may be 0.8 ($800/$1000) and the assignment ratio for Email Server to Marketing Department may by 0.2 $200/$1000). Assignment ratios may be explicitly defined by allocation rules. Or they may be derived based on the amount resources/costs that may be allocated from the source object cost line items to the target object cost line items.
As used herein, the terms “business system” and/or “generated business system,” refers to a system that has been generated using the budget and forecasting platform. Various embodiments disclosed herein may be related to financial applications. But, one of ordinary skill in the art will appreciate that generated business systems are not limited to financial applications.
As used herein, the term “dataset” refers to a collection of data, usually presented in tabular form. Each column may represent a particular variable. Each row may represent a given member of the dataset. Also, it may list values for fields for each of the variables, such as name, location, cost, owner, manufacturer, serial number, or the like. Non-tabular datasets can also take the form of marked up strings of characters, such as an XML file.
As used herein, the term “total cost value” refers to a value that is determined for providing at least one offering. A model for determining the total cost value (in terms of resources) of at least one offering is based at least on an allocation of cost data to at least one category in a category template in a cost model.
As used herein, the term “target object,” or “target data object” refers to an object in a data model that may be allocated resource values (e.g., costs/expenses) from one or more other objects (source objects). In at least one of the various embodiments, target objects may be used to represent one or more categories in a data model.
As used herein, the term “source object,” or “source data object” refers to an object in a data model that may be providing resource values (e.g., costs/expenses) that may be allocated to one or more other objects (target objects). In at least one of the various embodiments, source objects may be used to represent one or more categories in a data model.
As used herein the term “key feature” refers to a feature of a category or data object that is used by allocation rules to determine how resources are allocated. Data objects may have many features, however, in most cases only one or a few features are used in allocation rules allocate resources to and/or from a data object. These few features are key features.
As used herein the term “grouped object” refers to an object in the data model that contains line items that correspond to distinct key feature values from the line items in a corresponding data object. When more than line item in the data object have the same values for the key features, those line item may be collapsed into a single line item of the grouped object that corresponds to the data objects.
As used herein the term “data object line item” refers to line items of a data object.
As used herein the term “grouped object line item” refers to line item of a grouped object.
The following briefly describes the embodiments of the invention in order to provide a basic understanding of some aspects of the invention. This brief description is not intended as an extensive overview. It is not intended to identify key or critical elements, or to delineate or otherwise narrow the scope. Its purpose is merely to present some concepts in a simplified form as a prelude to the more detailed description that is presented later.
Briefly stated, various embodiments are directed towards continuously variable resolution of resource allocation that include allocating resources in a business system. In at least one of the various embodiments, a data model that includes a plurality data objects may be generated, such that each data object includes a plurality of data object line items.
In at least one of the various embodiments, a plurality of allocation rules that allocate resources between the two or more of the plurality of data objects may be generated.
In at least one of the various embodiments, the plurality of allocation rules may be employed to identify one or more key features of one or more data objects of the plurality of data objects, such that the one or more key features are used by the allocation rules to allocate resources.
In at least one of the various embodiments, if one or more key features may be identified, one or more grouped objects that separately correspond to one of the one or more data objects that include one or more of the one or more key features may be generated. Also, in at least one of the various embodiments, one or more grouped object line items may be generated for each of the one or more grouped objects based on each distinct value of the one or more key features, such that the data object line items are collapsed into the one or more grouped object line items based on the distinct value of the one or more key features.
In at least one of the various embodiments, one or more assignment ratio tables may be generated based on the allocation rules, such that rows in the one or more assignment ratio tables provide allocations using the grouped object line items. In at least one of the various embodiments, generating the one or more assignment ratio tables, may include employing the one or more grouped object line items to generate one or more rows in the assignment ratio tables, such that, the one or more rows represent the allocation of resources for one or more data objects.
In at least one of the various embodiments, if a query may be provided, at least a portion of the plurality of data objects may be traversed based on the query. And, if a grouped object may be encountered during this traversal, at least a portion of results for the query may be generated using one or more of the grouped object's line items.
In at least one of the various embodiments, one or more values from individual data object line items may be stored in a grouped object line item, such that the one or more values enable the corresponding individual data object line item to be resolved from the grouped object line item.
In at least one of the various embodiments, if a query references one or more features that may be absent from a grouped object, accessing the one or more features directly from a data object that corresponds to the grouped object. In at least one of the various embodiments, identifying one or more of the plurality of data objects that may be used to generate one or more of the grouped objects.
In at least one of the various embodiments, the one or more grouped objects may be updated based on modifications that may be made to one or more of the plurality of allocation rules, wherein the modifications include one or more of an increase in a number of key features, or a decrease in the number of key features.
Illustrated Operating Environment
Generally, client computers 102-104 may include virtually any portable computing device capable of receiving and sending a message over a network, such as network 111, wireless network 110, or the like. Client computers 102-104 may also be described generally as client computers that are configured to be portable. Thus, client computers 102-104 may include virtually any portable computing device capable of connecting to another computing device and receiving information. Such devices include portable devices such as, cellular telephones, smart phones, display pagers, radio frequency (RF) devices, infrared (IR) devices, Personal Digital Assistants (PDA's), handheld computers, laptop computers, wearable computers, tablet computers, integrated devices combining one or more of the preceding devices, or the like. As such, client computers 102-104 typically range widely in terms of capabilities and features. For example, a cell phone may have a numeric keypad and a few lines of monochrome Liquid Crystal Display (LCD) on which only text may be displayed. In another example, a web-enabled mobile device may have a touch sensitive screen, a stylus, and several lines of color LCD in which both text and graphics may be displayed.
Client computer 101 may include virtually any computing device capable of communicating over a network to send and receive information, including messaging, performing various online actions, or the like. The set of such devices may include devices that typically connect using a wired or wireless communications medium such as personal computers, tablet computers, multiprocessor systems, microprocessor-based or programmable consumer electronics, network Personal Computers (PCs), or the like. In at least one of the various embodiments, at least some of client computers 102-104 may operate over wired and/or wireless network. Today, many of these devices include a capability to access and/or otherwise communicate over a network such as network 111 and/or wireless network 110. Moreover, client computers 102-104 may access various computing applications, including a browser, or other web-based application.
In at least one of the various embodiments, one or more of client computers 101-104 may be configured to operate within a business or other entity to perform a variety of services for the business or other entity. For example, client computers 101-104 may be configured to operate as a web server, an accounting server, a production server, an email server, video game server, an inventory server, or the like. However, client computers 101-104 are not constrained to these services and may also be employed, for example, as an end-user computing node, in other embodiments. Further, it should be recognized that more or less client computers may be included within a system such as described herein, and embodiments are therefore not constrained by the number or type of client computers employed.
A web-enabled client computer may include a browser application that is configured to receive and to send web pages, web-based messages, or the like. The browser application may be configured to receive and display graphics, text, multimedia, or the like, employing virtually any web-based language, including a wireless application protocol messages (WAP), or the like. In at least one of the various embodiments, the browser application is enabled to employ Handheld Device Markup Language (HDML), Wireless Markup Language (WML), WMLScript, JavaScript, Standard Generalized Markup Language (SGML), HyperText Markup Language (HTML), eXtensible Markup Language (XML), HTML5, or the like, to display and send a message. In at least one of the various embodiments, a user of the client computer may employ the browser application to perform various actions over a network.
Client computers 101-104 also may include at least one other client application that is configured to receive and/or send data, including budgeting and forecasting information, between another computing device. Client applications may include a capability to provide requests and/or receive data relating to the cost models, budget reports, budget project information, allocation rules, or the like. The client application may provide data representing assignment and/or allocation changes, selecting templates, editing cost allocations between or among categories, generating and/or modifying allocation rules, or the like. In at least one of the various embodiments, client applications may receive and/or generate data related to budgeting and financial models and may generate tables and relationships between and among the data. In at least one of the various embodiments, client computers 101-104 may view and/or modify generated data models.
Wireless network 110 is configured to couple client computers 102-104 and its components with network 111. Wireless network 110 may include any of a variety of wireless sub-networks that may further overlay stand-alone ad-hoc networks, or the like, to provide an infrastructure-oriented connection for client computers 102-104. Such sub-networks may include mesh networks, Wireless LAN (WLAN) networks, cellular networks, or the like.
Wireless network 110 may further include an autonomous system of terminals, gateways, routers, or the like connected by wireless radio links, or the like. These connectors may be configured to move freely and randomly and organize themselves arbitrarily, such that the topology of wireless network 110 may change rapidly.
Wireless network 110 may further employ a plurality of access technologies including 2nd (2G), 3rd (3G), 4th (4G), 5th (5G) generation radio access for cellular systems, WLAN, Wireless Router (WR) mesh, or the like. Access technologies such as 2G, 3G, 4G, 5G, and future access networks may enable wide area coverage for mobile devices, such as client computers 102-104 with various degrees of mobility. For example, wireless network 110 may enable a radio connection through a radio network access such as Global System for Mobil communication (GSM), General Packet Radio Services (GPRS), Enhanced Data GSM Environment (EDGE), Wideband Code Division Multiple Access (WCDMA), High Speed Downlink Packet Access (HSDPA), Long Term Evolution (LTE), or the like. In essence, wireless network 110 may include virtually any wireless communication mechanism by which information may travel between client computers 102-104 and another computing device, network, or the like.
Network 111 is configured to couple network computers with other computing devices, including, CMP 107, client computer(s) 101, and through wireless network 110 to client computers 102-104. Network 111 is enabled to employ any form of computer readable media for communicating information from one electronic device to another. Also, network 111 can include the Internet in addition to local area networks (LANs), wide area networks (WANs), direct connections, such as through a universal serial bus (USB) port, other forms of computer-readable media, or any combination thereof. On an interconnected set of LANs, including those based on differing architectures and protocols, a router acts as a link between LANs, enabling messages to be sent from one to another. In addition, communication links within LANs typically include twisted wire pair or coaxial cable, while communication links between networks may utilize analog telephone lines, full or fractional dedicated digital lines including T1, T2, T3, and T4, Integrated Services Digital Networks (ISDNs), Digital Subscriber Lines (DSLs), wireless links including satellite links, or other communications links known to those skilled in the art. For example, various Internet Protocols (IP), Open Systems Interconnection (OSI) architectures, and/or other communication protocols, architectures, models, and/or standards, may also be employed within network 111 and wireless network 110. Furthermore, remote computers and other related electronic devices could be remotely connected to either LANs or WANs via a modem and temporary telephone link. In essence, network 111 includes any communication method by which information may travel between computing devices.
Additionally, communication media typically embodies computer-readable instructions, data structures, program modules, or other transport mechanism and includes any information delivery media. By way of example, communication media includes wired media such as twisted pair, coaxial cable, fiber optics, wave guides, and other wired media and wireless media such as acoustic, RF, infrared, and other wireless media. Such communication media is distinct from, however, processor-readable storage devices described in more detail below.
CMP 107 may include virtually any network computer usable to perform data processing operation that may be used for generating cost models, data models, allocation rules, cost allocations, total cost values for offerings, displays and/or reports thereof, such as network computer 300 of
Devices that may operate as CMP 107 include various network computers, including, but not limited to personal computers, desktop computers, multiprocessor systems, microprocessor-based or programmable consumer electronics, network PCs, server devices, tablet computers, network appliances, or the like. It should be noted that while CMP 107 is illustrated as a single network computer, the invention is not so limited. Thus, in another embodiment, CMP 107 may represent a plurality of network computers. For example, in at least one of the various embodiments, CMP 107 may be distributed over a plurality of network computers and/or implemented using cloud architecture.
Moreover, CMP 107 is not limited to a particular configuration. Rather, CMP 107 may operate using a controller/worker approach over a plurality of network computers, within a cluster, a peer-to-peer architecture, cloud-based architecture (e.g., virtual machines), and/or any of a variety of other architectures. Thus, CMP Server Computer 107 is not to be construed as being limited to a single environment, and other configurations, and architectures are also envisaged. CMP Server Computer 107 may employ processes and such as described below in conjunction with
Illustrative Client Computer
Client computer 200 may include processor 202 in communication with memory 204 via bus 228. Client computer 200 may also include power supply 230, network interface 232, audio interface 256, display 250, keypad 252, illuminator 254, video interface 242, input/output interface 238, haptic interface 264, global positioning systems (GPS) receiver 258, open air gesture interface 260, temperature interface 262, camera(s) 240, projector 246, pointing device interface 266, processor-readable stationary storage device 234, and processor-readable removable storage device 236. Client computer 200 may optionally communicate with a base station (not shown), or directly with another computer. And in one embodiment, although not shown, a gyroscope may be employed within client computer 200 to measuring and/or maintaining an orientation of client computer 200.
Power supply 230 may provide power to client computer 200. A rechargeable or non-rechargeable battery may be used to provide power. The power may also be provided by an external power source, such as an AC adapter or a powered docking cradle that supplements and/or recharges the battery.
Network interface 232 includes circuitry for coupling client computer 200 to one or more networks, and is constructed for use with one or more communication protocols and technologies including, but not limited to, protocols and technologies that implement any portion of the OSI model for mobile communication (GSM), CDMA, time division multiple access (TDMA), UDP, TCP/IP, SMS, MMS, GPRS, WAP, UWB, WiMax, SIP/RTP, GPRS, EDGE, WCDMA, LTE, UMTS, OFDM, CDMA2000, EV-DO, HSDPA, or any of a variety of other wireless communication protocols. Network interface 232 is sometimes known as a transceiver, transceiving device, or network interface card (NIC).
Audio interface 256 may be arranged to produce and receive audio signals such as the sound of a human voice. For example, audio interface 256 may be coupled to a speaker and microphone (not shown) to enable telecommunication with others and/or generate an audio acknowledgement for some action. A microphone in audio interface 256 can also be used for input to or control of client computer 200, e.g., using voice recognition, detecting touch based on sound, and the like.
Display 250 may be a liquid crystal display (LCD), gas plasma, electronic ink, light emitting diode (LED), Organic LED (OLED) or any other type of light reflective or light transmissive display that can be used with a computer. Display 250 may also include a touch interface 244 arranged to receive input from an object such as a stylus or a digit from a human hand, and may use resistive, capacitive, surface acoustic wave (SAW), infrared, radar, or other technologies to sense touch and/or gestures.
Projector 246 may be a remote handheld projector or an integrated projector that is capable of projecting an image on a remote wall or any other reflective object such as a remote screen.
Video interface 242 may be arranged to capture video images, such as a still photo, a video segment, an infrared video, or the like. For example, video interface 242 may be coupled to a digital video camera, a web-camera, or the like. Video interface 242 may comprise a lens, an image sensor, and other electronics. Image sensors may include a complementary metal-oxide-semiconductor (CMOS) integrated circuit, charge-coupled device (CCD), or any other integrated circuit for sensing light.
Keypad 252 may comprise any input device arranged to receive input from a user. For example, keypad 252 may include a push button numeric dial, or a keyboard. Keypad 252 may also include command buttons that are associated with selecting and sending images.
Illuminator 254 may provide a status indication and/or provide light. Illuminator 254 may remain active for specific periods of time or in response to events. For example, when illuminator 254 is active, it may backlight the buttons on keypad 252 and stay on while the client computer is powered. Also, illuminator 254 may backlight these buttons in various patterns when particular actions are performed, such as dialing another client computer. Illuminator 254 may also cause light sources positioned within a transparent or translucent case of the client computer to illuminate in response to actions.
Further, client computer 200 may also comprise hardware security module (HSM) 268 for providing additional tamper resistant safeguards for generating, storing and/or using security/cryptographic information such as, keys, digital certificates, passwords, passphrases, two-factor authentication information, or the like. In some embodiments, hardware security module may be employed to support one or more standard public key infrastructures (PKI), and may be employed to generate, manage, and/or store keys pairs, or the like. In some embodiments, HSM 268 may be arranged as a hardware card that may be added to a client computer.
Client computer 200 may also comprise input/output interface 238 for communicating with external peripheral devices or other computers such as other client computers and network computers. The peripheral devices may include an audio headset, display screen glasses, remote speaker system, remote speaker and microphone system, and the like. Input/output interface 238 can utilize one or more technologies, such as Universal Serial Bus (USB), Infrared, WiFi, WiMax, Bluetooth™, and the like.
Haptic interface 264 may be arranged to provide tactile feedback to a user of the client computer. For example, the haptic interface 264 may be employed to vibrate client computer 200 in a particular way when another user of a computer is calling. Open air gesture interface 260 may sense physical gestures of a user of client computer 200, for example, by using single or stereo video cameras, radar, a gyroscopic sensor inside a computer held or worn by the user, or the like. Camera 240 may be used to track physical eye movements of a user of client computer 200.
In at least one of the various embodiments, client computer 200 may also include sensors 262 for determining geolocation information (e.g., GPS), monitoring electrical power conditions (e.g., voltage sensors, current sensors, frequency sensors, and so on), monitoring weather (e.g., thermostats, barometers, anemometers, humidity detectors, precipitation scales, or the like), light monitoring, audio monitoring, motion sensors, or the like. Sensors 262 may be one or more hardware sensors that collect and/or measure data that is external to client computer 200
GPS transceiver 258 can determine the physical coordinates of client computer 200 on the surface of the Earth, which typically outputs a location as latitude and longitude values. GPS transceiver 258 can also employ other geo-positioning mechanisms, including, but not limited to, triangulation, assisted GPS (AGPS), Enhanced Observed Time Difference (E-OTD), Cell Identifier (CI), Service Area Identifier (SAI), Enhanced Timing Advance (ETA), Base Station Subsystem (BSS), or the like, to further determine the physical location of client computer 200 on the surface of the Earth. It is understood that under different conditions, GPS transceiver 258 can determine a physical location for client computer 200. In at least one embodiment, however, client computer 200 may, through other components, provide other information that may be employed to determine a physical location of the client computer, including for example, a Media Access Control (MAC) address, IP address, and the like.
Human interface components can be peripheral devices that are physically separate from client computer 200, allowing for remote input and/or output to client computer 200. For example, information routed as described here through human interface components such as display 250 or keyboard 252 can instead be routed through network interface 232 to appropriate human interface components located remotely. Examples of human interface peripheral components that may be remote include, but are not limited to, audio devices, pointing devices, keypads, displays, cameras, projectors, and the like. These peripheral components may communicate over a Pico Network such as Bluetooth™, Zigbee™ and the like. One non-limiting example of a client computer with such peripheral human interface components is a wearable computer, which might include a remote pico projector along with one or more cameras that remotely communicate with a separately located client computer to sense a user's gestures toward portions of an image projected by the pico projector onto a reflected surface such as a wall or the user's hand.
A client computer may include web browser application 226 that may be configured to receive and to send web pages, web-based messages, graphics, text, multimedia, and the like. The client computer's browser application may employ virtually any programming language, including a wireless application protocol messages (WAP), and the like. In at least one embodiment, the browser application is enabled to employ Handheld Device Markup Language (HDML), Wireless Markup Language (WML), WMLScript, JavaScript, Standard Generalized Markup Language (SGML), HyperText Markup Language (HTML), eXtensible Markup Language (XML), HTML5, and the like.
Memory 204 may include RAM, ROM, and/or other types of memory. Memory 204 illustrates an example of computer-readable storage media (devices) for storage of information such as computer-readable instructions, data structures, program modules or other data. Memory 204 may store BIOS 208 for controlling low-level operation of client computer 200. The memory may also store operating system 206 for controlling the operation of client computer 200. It will be appreciated that this component may include a general-purpose operating system such as a version of UNIX, or LINUX™, or a specialized client computer communication operating system such as Windows Phone™, or the Symbian® operating system. The operating system may include, or interface with a Java virtual machine module that enables control of hardware components and/or operating system operations via Java application programs.
Memory 204 may further include one or more data storage 210, which can be utilized by client computer 200 to store, among other things, applications 220 and/or other data. For example, data storage 210 may also be employed to store information that describes various capabilities of client computer 200. The information may then be provided to another device or computer based on any of a variety of events, including being sent as part of a header during a communication, sent upon request, or the like. Data storage 210 may also be employed to store social networking information including address books, buddy lists, aliases, user profile information, or the like. Data storage 210 may further include program code, data, algorithms, and the like, for use by a processor, such as processor 202 to execute and perform actions. In one embodiment, at least some of data storage 210 might also be stored on another component of client computer 200, including, but not limited to, non-transitory processor-readable removable storage device 236, processor-readable stationary storage device 234, or even external to the client computer.
Applications 220 may include computer executable instructions which, when executed by client computer 200, transmit, receive, and/or otherwise process instructions and data. Applications 220 may include, for example, cost modeling client application 222. In at least one of the various embodiments, cost modeling client application 222 may be used to exchange communications to and from cost modeling platform server computer 107, including, but not limited to, queries, searches, report information, visualization of models, API calls, or the like.
Other examples of application programs include calendars, search programs, email client applications, IM applications, SMS applications, Voice Over Internet Protocol (VOIP) applications, contact managers, task managers, transcoders, database programs, word processing programs, security applications, spreadsheet programs, games, search programs, and so forth.
Additionally, in one or more embodiments (not shown in the figures), client computer 200 may include an embedded logic hardware device instead of a CPU, such as, an Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), Programmable Array Logic (PAL), or the like, or combination thereof. The embedded logic hardware device may directly execute its embedded logic to perform actions. Also, in one or more embodiments (not shown in the figures), the network computer may include a hardware microcontroller instead of a CPU. In at least one embodiment, the microcontroller may directly execute its own embedded logic to perform actions and access its own internal memory and its own external Input and Output Interfaces (e.g., hardware pins and/or wireless transceivers) to perform actions, such as System On a Chip (SOC), or the like.
Illustrative Network Computer
As shown in the figure, network computer 300 includes a processor 302 in communication with a memory 304 via a bus 328. Network computer 300 also includes a power supply 330, network interface 332, audio interface 356, global positioning systems (GPS) receiver 362, display 350, keyboard 352, input/output interface 338, processor-readable stationary storage device 334, and processor-readable removable storage device 336. Power supply 330 provides power to network computer 300.
Network interface 332 includes circuitry for coupling network computer 300 to one or more networks, and is constructed for use with one or more communication protocols and technologies including, but not limited to, protocols and technologies that implement any portion of the Open Systems Interconnection model (OSI model), global system for mobile communication (GSM), code division multiple access (CDMA), time division multiple access (TDMA), user datagram protocol (UDP), transmission control protocol/Internet protocol (TCP/IP), Short Message Service (SMS), Multimedia Messaging Service (MMS), general packet radio service (GPRS), WAP, ultra wide band (UWB), IEEE 802.16 Worldwide Interoperability for Microwave Access (WiMax), Session Initiation Protocol/Real-time Transport Protocol (SIP/RTP), or any of a variety of other wired and wireless communication protocols. Network interface 332 is sometimes known as a transceiver, transceiving device, or network interface card (NIC). Network computer 300 may optionally communicate with a base station (not shown), or directly with another computer.
Audio interface 356 is arranged to produce and receive audio signals such as the sound of a human voice. For example, audio interface 356 may be coupled to a speaker and microphone (not shown) to enable telecommunication with others and/or generate an audio acknowledgement for some action. A microphone in audio interface 356 can also be used for input to or control of network computer 300, for example, using voice recognition.
Display 350 may be a liquid crystal display (LCD), gas plasma, electronic ink, light emitting diode (LED), Organic LED (OLED) or any other type of light reflective or light transmissive display that can be used with a computer. Display 350 may be a handheld projector or pico projector capable of projecting an image on a wall or other object.
Network computer 300 may also comprise input/output interface 338 for communicating with external devices or computers not shown in
GPS transceiver 362 can determine the physical coordinates of network computer 300 on the surface of the Earth, which typically outputs a location as latitude and longitude values. GPS transceiver 362 can also employ other geo-positioning mechanisms, including, but not limited to, triangulation, assisted GPS (AGPS), Enhanced Observed Time Difference (E-OTD), Cell Identifier (CI), Service Area Identifier (SAI), Enhanced Timing Advance (ETA), Base Station Subsystem (BSS), or the like, to further determine the physical location of network computer 300 on the surface of the Earth. It is understood that under different conditions, GPS transceiver 362 can determine a physical location for network computer 300.
Network computer 300 may also include sensors 364 for determining geolocation information (e.g., GPS), monitoring electrical power conditions (e.g., voltage sensors, current sensors, frequency sensors, and so on), monitoring weather (e.g., thermostats, barometers, anemometers, humidity detectors, precipitation scales, or the like), light monitoring, audio monitoring, motion sensors, or the like. Sensors 364 may be one or more hardware sensors that collect and/or measure data that is external to network computer 300
In at least one embodiment, however, network computer 300 may, through other components, provide other information that may be employed to determine a physical location of the client computer, including for example, a Media Access Control (MAC) address, IP address, and the like.
Human interface components can be physically separate from network computer 300, allowing for remote input and/or output to network computer 300. For example, information routed as described here through human interface components such as display 350 or keyboard 352 can instead be routed through the network interface 332 to appropriate human interface components located elsewhere on the network. Human interface components include any component that allows the computer to take input from, or send output to, a human user of a computer. Accordingly, pointing devices such as mice, styluses, track balls, or the like, may communicate through pointing device interface 358 to receive user input.
Memory 304 may include Random Access Memory (RAM), Read-Only Memory (ROM), and/or other types of memory. Memory 304 illustrates an example of computer-readable storage media (devices) for storage of information such as computer-readable instructions, data structures, program modules or other data. Memory 304 stores a basic input/output system (BIOS) 308 for controlling low-level operation of network computer 300. The memory also stores an operating system 306 for controlling the operation of network computer 300. It will be appreciated that this component may include a general-purpose operating system such as a version of UNIX, or LINUX™, or a specialized operating system such as Microsoft Corporation's Windows® operating system, or the Apple Corporation's IOS® operating system. The operating system may include, or interface with a Java virtual machine module that enables control of hardware components and/or operating system operations via Java application programs. Likewise, other runtime environments may be included.
Memory 304 may further include one or more data storage 310, which can be utilized by network computer 300 to store, among other things, applications 320 and/or other data. For example, data storage 310 may also be employed to store information that describes various capabilities of network computer 300. The information may then be provided to another device or computer based on any of a variety of events, including being sent as part of a header during a communication, sent upon request, or the like. Data storage 410 may also be employed to store social networking information including address books, buddy lists, aliases, user profile information, or the like. Data storage 310 may further include program code, data, algorithms, and the like, for use by a processor, such as processor 302 to execute and perform actions such as those actions described below. In one embodiment, at least some of data storage 310 might also be stored on another component of network computer 300, including, but not limited to, non-transitory media inside processor-readable removable storage device 336, processor-readable stationary storage device 334, or any other computer-readable storage device within network computer 300, or even external to network computer 300. Data storage 310 may include, for example, model data 312, one or more datasets 316, or the like.
Applications 320 may include computer executable instructions which, when executed by network computer 300, transmit, receive, and/or otherwise process messages (e.g., SMS, Multimedia Messaging Service (MMS), Instant Message (IM), email, and/or other messages), audio, video, and enable telecommunication with another user of another mobile computer. Other examples of application programs include calendars, search programs, email client applications, IM applications, SMS applications, Voice Over Internet Protocol (VOIP) applications, contact managers, task managers, transcoders, database programs, word processing programs, security applications, spreadsheet programs, games, search programs, and so forth. Applications 320 may include cost modeling application 322, web server application 326, other applications 328, or the like, that may perform actions further described below. In at least one of the various embodiments, one or more of the applications may be implemented as modules and/or components of another application. Further, in at least one of the various embodiments, applications may be implemented as operating system extensions, modules, plugins, or the like.
In at least one of the various embodiments, applications, such as, cost modeling application 322, web server application 326, other applications 328, or the like, may be arranged to employ geo-location information to select one or more localization features, such as, time zones, languages, currencies, calendar formatting, or the like. Localization features may be used in user-interfaces and well as internal processes and/or databases. In at least one of the various embodiments, geo-location information used for selecting localization information may be provided by GPS 362. Also, in some embodiments, geolocation information may include information providing using one or more geolocation protocol over the networks, such as, wireless network 108 and/or network 111.
Furthermore, in at least one of the various embodiments, cost modeling application 322 may be operative in a cloud-based computing environment. In at least one of the various embodiments, these applications, and others, that comprise the management platform may be executing within virtual machines and/or virtual servers that may be managed in a cloud-based based computing environment. In at least one of the various embodiments, in this context the applications may flow from one physical network computer within the cloud-based environment to another depending on performance and scaling considerations automatically managed by the cloud computing environment. Likewise, in at least one of the various embodiments, virtual machines and/or virtual servers dedicated to cost modeling application 322 may be provisioned and de-commissioned automatically.
Also, in at least one of the various embodiments, cost modeling application 322, or the like, may located in virtual servers running in a cloud-based computing environment rather than being tied to one or more specific physical network computers.
Further, network computer 300 may also comprise hardware security module (HSM) 360 for providing additional tamper resistant safeguards for generating, storing and/or using security/cryptographic information such as, keys, digital certificates, passwords, passphrases, two-factor authentication information, or the like. In some embodiments, hardware security module may be employ to support one or more standard public key infrastructures (PKI), and may be employed to generate, manage, and/or store keys pairs, or the like. In some embodiments, HSM 360 may be arranged as a hardware card that may be installed in a network computer.
Additionally, in one or more embodiments (not shown in the figures), network computer 300 may include an embedded logic hardware device instead of a CPU, such as, an Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), Programmable Array Logic (PAL), or the like, or combination thereof. The embedded logic hardware device may directly execute its embedded logic to perform actions. Also, in one or more embodiments (not shown in the figures), the network computer may include a hardware microcontroller instead of a CPU. In at least one embodiment, the microcontroller may directly execute its own embedded logic to perform actions and access its own internal memory and its own external Input and Output Interfaces (e.g., hardware pins and/or wireless transceivers) to perform actions, such as System On a Chip (SOC), or the like.
In at least one of the various embodiments, cost modeling application 322 may enable a user to generate budgets, allocation rules, data models, cost models, total cost values for offerings, reports, or the like. Also in at least one of the various embodiments, cost modeling application 322 may employ processes, or parts of processes, similar to those described below.
Illustrative Logical System Architecture
In at least one of the various embodiments, in model 400, labor 404 may be allocated 39% of costs, fixed assets 28% of costs, and the remaining 33% may be allocated to a mapping component In at least one of the various embodiments, based on a selected category template, the costs allocated to mapping component 406 may be allocated to the various cost categories that may make up the business system being modeled.
In at least one of the various embodiments, model 400 shows that 100% of costs flow to IT resource tower 410. From IT resource tower 410 costs flow to services 412. Thus, for this business system, model 400 shows that all the costs are allocated to producing the service offerings that the modeled business organization provides.
In at least one of the various embodiments, the cost modeling application may further enable users to gain additional understanding of how the costs from cost source 402 flow through the entire system. Model 400 shows that storage device 414 is responsible for 2.5% for the costs coming from cost source 402. And, that 100% of the costs of storage device 414 flows into the general category of for storage, shown by the allocation trace that shows of 100% of flowing from the storage device 414 to storage component 416. Likewise, model 400 shows that physical servers 420 are burdened by 100% of the costs of storage 416. And, since the business organization modeled by model 400 includes hypervisors that run on physical servers, the costs associate with hypervisor 418 flow from physical server 420. In at least one of the various embodiments, cost for the server category, servers 422 is constituted out of physical servers 420 and hypervisors 418, thus the costs for server 422 flow from those components. Further the applications 424 component of the model may be burdened with 100% of the costs associated with servers 422. Completing the loop, allocation rule 426 shows that service component 412 may be burdened with 100% of the costs associate with applications 424.
In at least one of the various embodiments, other types of raw datasets may be provided by other external data sources to budget and forecasting platform 107. For example, datasets that include information about physical IT assets, fixed assets, software licenses, employees, labor costs, insurance records, vendor costs, utility costs (electricity, water, sewer, broadband, natural gas, oil, or the like), consulting expenses, legal fees, or the like.
Allocation rules may be used to connect categories and/or objects of model 600. In at least one of the various embodiments, allocation rules may show how costs (money) flow between the categories. Resulting in a graph where the categories may be represented as nodes and the allocation rules may be represented as edges. In at least one of the various embodiments, generally a model may be represented by a directed acyclic graph but that is not a requirement for an operative model. In at least one of the various embodiments, a model graph may contain cycles that are resolved or estimated using mathematical techniques, including but not limited to Gaussian elimination, Cholesky decomposition or Newton's method.
In at least one of the various embodiments, allocation rule 606 represents a rule allocating 20% of the money in category GL 602 (source object) to Servers category 604 (target object). In this example, GL 602 includes a total of $20,000, thus 20% of $20,000 (e.g., $4,000) flows based on allocation rule 606 to Servers 604. Likewise, allocation rule 608 may allocate $2,000 from GL 602 to Storage 610. The other allocation rules in model 600 allocate 100% of the money to the next category: allocation rule 612 directs 100% of the money (e.g., $4,000) to flow to Support 614; allocation rule 618 directs 100% of the money in Support (e.g., $4,000) to flow to Business Units 620; and allocation rule 616 directs 100% of the money from Storage 610 to flow to Business Units 620.
In at least one of the various embodiments, money that flows into the category (object) may be allocated among the included cost line items. In at least one of the various embodiments, each category may have one or more rules that may describe the assignment ratios for how the money allocated to a category/object may be assigned to its cost line items. For the categories 604, 610, 614, and 620, allocation rules assign the money allocated to the category evenly among the cost line items comprising each category.
In at least one of the various embodiments, an assignment ratio may represent how the money in an actual budget may be assigned from source category/object cost line items to target category/object cost line items. In at least one of the various embodiments, allocation rules may be applied that distribute the money based on formulas that may be defined by the users or administrators who designed the model. In at least one of the various embodiments, the assignment ratios and allocations may be modified as part of the modeling process.
The model 600 is a simplified model useful for facilitating discussion and understanding of the embodiments, since allocation rules for models of large commercial entities can be numerous and complex. However, model 600 is at least sufficient to enable one of ordinary skill in the art to practice what is claimed herein.
In this example, data model 700 may be arranged to include GL object 702, data center object 704, servers object 706, and applications object 708. The objects in the data model represent how money from GL object 702 may be distributed through business system. Further, assignment ratio tables, such as, assignment ratio table 710, 712, and 714 may be defined to control of how money may be distributed from one model object to another, Assignment ratio tables may be arranged to include allocation rules describing how resources flow from one model object in a data model to another.
In this example, data model 700 includes an assignment ratio table (assignment ratio table 710) to allocate money from GL object 702 to data center object 704. Also, in this example, data model 700 includes an assignment ratio table (assignment ratio table 712) to allocate money from data center object 704 to servers object 706. And, in this example, data model 700 includes an assignment ratio table (assignment ratio table 714) to allocate money from servers object 706 to applications object 706.
In at least one of the various embodiments, the details of how costs may be allocated from one object in the model to another may be encapsulated in one or more allocation rules. In at least one of the various embodiments, allocation rules may generate one or more assignment ratio tables that describe how cost values flow between the modeled objects. For data model 700, allocation rules may be described and illustrated in the form of assignment ratio tables 710, 712, and 714. In some embodiments, the allocation rules may define how an assignment ratio table may be arranged.
In at least one of the various embodiments, an assignment ratio table may be arranged to include one or more columns of information, such as, source object line item 718, target object line item 720, assignment ratio 722, allocation value 724, source value 726, or the like. In this example, the entries in the source object line item column 718 correspond to the line items in GL object 702. Namely, A100 and A200 (e.g., representing account names from a chart-of-accounts). Also, the entries in target object line item column 720 correspond to the line items comprising data center object 704 (e.g., SEA for Seattle and CHI for Chicago). The next column, assignment ratio column 722, contains a value for computing how much money flows from the source object line item to the target object line item. In this example, an allocation rule corresponding to assignment ratio table 710 causes the money from A100 to be evenly divided between location SEA and location CHI. Likewise, 80% (0.8) of the money from A200 is allocated to location SEA and 20% (0.2) is allocated to location CHI. Column 724 in assignment ratio table 710 shows the amount of money that flows from the source object line item to the target item. And column 726 shows the amount of money that the source object line item starts with. For example, based on GL object 702, A100 starts with $200 and A200 starts with $120. Thus, since the assignment ratio for A200 is 80% to location SEA, the line item for SEA is allocated $96 (approximately 80% of $120) while location CHI is allocated $24 (approximately 20% or $120). Likewise, since, in this example, A100 is evenly split with allocation ratio 50% or 0.5 between location SEA and location CHI, each location is allocated $100. In at least one of the various embodiments, the values in data center object 704 reflect the application of the allocation rules corresponding to assignment ratio table 710. Similarly, the remaining objects in model 700 may be allocated costs based on their respective allocation rules and corresponding assignment ratio tables.
In at least one of the various embodiments, the underlying reason for employing a particular allocation rule may depend on the objects that are being modeled. For example, in model 700, account A100 is modeled as a line item in GL object 702 and it may represent the costs/money allocated to operating a Seattle based data center. And A200, also modeled as a line item in GL object 702, may represent the costs/money allocated to operating a Chicago based data center.
Likewise, in this example, referring to assignment ratio table 712, money is allocated from to the servers items. In this example, money allocated to the Seattle data center (SEA in data center object 704) is split between two servers, S1 and S2, while money allocated to the Chicago (CHI) data center is split between three servers (e.g., S3, S4, S5).
Finally, data model 700 models how money is allocated from servers object 706 to applications represented by application object 708. In this case, assignment ratio table 714 shows that the costs allocated to each server are evenly allocated to application W1 and application W2. For examples, the first line of assignment ratio table 714 shows that half of the costs of server S1 ($49) are allocated to application W1 with the other half of the costs of server S1 ($49) are allocated to application W2. Similarly, the costs associated with the other servers (S2-S5) are split between application W1 and W2.
Accordingly, in at least one of the various embodiments, data models, such as, data model 700 enable reports to be generated that answer various questions about how resources are allocated throughout the modeled business system. For example, data model 700 shows that the $320 that entered the system through GL object 702 is split evenly between applications W1 and W2.
Likewise, data model 700 easily answers questions, such as, how much money is allocated to each server located in Seattle? The answer of $98 for each server is readily derived from servers object 706. Generally, models such as data model may enable detailed reporting on how money (or other resources) flow between object that are adjacent in the data models. Reports such as tracing the costs from one object to another may be efficiently generated as long as there are no intervening objects in the model.
For example, using data model 700 it may be easy to report how resources are allocated between GL object 702 and data center object 704 since there are no intervening model objects in the data model. However, to generate report information that include traces costs through one or more intervening model objects may require significant computing resources.
An example of such a report based on data model 700 may be a report of how much of the money from a particular data center contributes to the money allocated to an application. In data model 700 to report on how much of the $160 allocated to application W1 (in application object 708) comes from the $196 allocated to Seattle (in data center object 704) requires a merging of the assignment ratio table 714 and assignment ratio table 712. For a trivial example such as data model 700 the merging is trivial since the size of the assignment ratio tables is small. However, in a production environment an assignment ratio table for servers may have tens of thousands of row. Likewise, an assignment ratio table for applications may have millions of rows. For example, a business system model that included 50,000 servers and 100 applications would require an assignment ratio table having 5,000,000 rows (the product of 50,000 and 100) to model the allocation of money from the servers to the applications. In contrast, the trivial example data model 700 has 2 applications and 5 server so assignment ratio table 714 only requires 10 rows (the product of 5 and 2). Vertically merging assignment ratio table 714 and assignment ratio table 716 for data model 700 would result in a combined table having 50 rows. In a production data model, such as, described above, merging an assignment ratio table having 5 million rows with one having 50,000 rows would results in a significantly larger assignment ratio table that would impact performance of the system.
One of ordinary skill in the art will appreciate that model objects and tables such as those described above may be arranged to have more or fewer features, columns, rows, or the like. Likewise, data models may be arranged in different geometries and have more (many more) or fewer model objects depending on the application and/or the business system being modeled. Also, data models may arranged to model the allocation of different resources, such as, financial resources (money), energy, water, power, or the like.
As described above, in at least one of the various embodiments, resources may be allocated between data objects using allocation rules. In
In at least one of the various embodiments, in this example, since data centers 802 and servers 804 are related by location, an allocation rule may be arranged to allocate resources based on the location of the servers. In such cases, the allocation rule may be arranged to allocate resources from data centers to servers based on their common location.
In at least one of the various embodiments, as described in
In this example, allocation rule 816 may be arranged to generate assignment ratio table 820. In this example, assignment ratio (AR) table 820 omits showing all of the columns shown in for other AR table (total cost, cost) though other embodiments may include them and other columns without departing from the scope of these innovation. AR table 820 is illustrated using this reduced format for brevity and clarity. Typical of other AR tables described herein, AR table 820 includes column 824 which holds the id/hostname of the servers, column 826 which holds the name/id of the data center (its location here doubles as its name), and column 828 that shows the assignment ratio for each line item. In this example, AR table 820 shows that 10% of the money from the Seattle data center is allocated to server S1. Likewise, AR table 820 shows that 20% of the money from the Tokyo data center is allocated to server S10000. In this example, using a simple allocation rule that allocates costs based on location, AR table 820 would include at least 10000 rows.
Also in this example, allocation rule 818 may be an allocation rule that allocates the costs of a server evenly to each application. This models the case here where each of the 100 applications represented by application object 806 are running on each server. Accordingly, for this case, the application of the allocation rule 818 may generate AR table 822. In this case, AR table 822 will have 1,000,000 rows, since each of the 100 applications is used by each of the 10,000 server line items—accordingly they contribute to the cost of each server.
In at least one of the various embodiments, data model 800 may be used for generating report information in response to queries, such as, how much of costs of the Seattle data center may be attribute to the server S1. Likewise, using data model 800 it may be elementary to compute how much of the costs of server S1 is attributed to application Appl, and so on. However, in at least one of the various embodiments, to compute how much of the resource/costs of an application come from a particular data center requires another AR table to be generated by vertically merging AR table 822 and AR table 820. In this example, such a merge operation will produce an AR table that has 1,000,000×10,000 rows (1.0×E10) where each row is generated in part by multiplying the assignment ratios of the corresponding applications and servers to compute a value for how much of the cost of an application should be attributed to a particular data center. Also, since the computational expense of such processing increases as the number of line items in a data object increases, data models with larger objects (not uncommon for moderate to large enterprises) increasing become prohibitively expense to work with.
In this example, for at least one of the various embodiments, line item table 902 represents the cost line items for a server object. Each server that may be being modeled may have a line item in the table. For example, line item table 902 represents a data structure that has 10,000 server records, one for each computer server in the modeled entity. Also, in this example, line item table 902 is arranged to store the hostname of each server in column 904; the location of each server is column 906; and a list of applications used by each server. One of ordinary skill in the art will appreciate that the line item tables may be arranged include an arbitrary number of columns depending on the information that may be available for modeling. For example, in some embodiments, a server line item table may include columns, for operating system, licensing, CPU type, number of CPU, amount of RAM, model number, or the like, or combination thereof. However, in this example for brevity and clarity line item table 902 is represented as having the three columns shown herein.
In at least one of the various embodiments, allocation rules may be analyzed to identify the values that are relevant for allocating resources. For example, allocation rule 816 as described in
Accordingly, in at least one of the various embodiments, grouped objects may be generated that collapse the line items to the minimum cardinality of rows based on the columns of the data object that are key features—the columns that are relevant to the allocation rules that are being used.
In at least one of the various embodiments, if the allocation rules associated with servers 902 allocate resources based on the location of the server (the key feature), a grouped server object, such as group server object 910 may be generated. In this example grouped server object 910 reduces the number of line items to the number of locations. In this example, (referring to
In at least one of the various embodiments, since grouped objects are arranged to include the pertinent columns for the operation of the allocation rules, the resources allocations made be made using grouped objects rather than the original data objects. This may result in the generation assignment ratio tables that are significantly smaller that if the entire data object is used. For example, assignment ratio table 820 that has 10,000 rows could be replaced by an assignment ratio table that has 100 rows.
In this example, grouped server object 910 may include three columns: column 912 that may include the hostnames (IDs) of the servers that are associated with a given location; column 914 that may hold the location value that is used for executing allocation rule 816; and column 910 that includes or references the applications for each server. Note, since column 912 and column 916 are multi-valued, they may include copies or references to other lists or tables, that include the multiple values. In at least one of the various embodiments, original data object may remain linked to the grouped object. Accordingly, the data object may be referenced if additional detail is needed.
Generalized Operations
At block 1004, in at least one of the various embodiments, process 1000 may determine some or all of the allocation rules that may be included in the data model. In at least one of the various embodiments, process 1000 may be arranged to automatically identify the allocation rules in the model for further processing. In at least one of the various embodiments, a user may be enabled to select one or more allocation rules and/or data object for further processing. As described above, the data model may be arranged to model how resources may be allocated within a business system. For example, the data model may be used to model how money flows through a business. The model may be arranged to be representative of how the resources are currently allocated with the business system or it may be designed for planning and/or forecasting of the use of resources. (e.g., budgeting).
At block 1006, in at least one of the various embodiments, one or more grouped objects may be generated based on the determined allocation rules. In at least one of the various embodiments, the determined allocation rules may be parsed to determine the key features for the data objects in the data model that drive the allocations. For example, allocation rule 816 allocates resources based on the location of the servers/data centers. Accordingly, in this example, location is a key feature.
At block 1008, in at least one of the various embodiments, resource may be allocated within the data model using the data objects, grouped object, and the allocation rules. Also, in at least one of the various embodiments, for each allocation rule that is applied an assignment ratio table may be generated.
At decision block 1010, in at least one of the various embodiments, optionally, if the key features and/or the allocation rules are modified, control may loop back to block 1004; otherwise, control may be returned to a calling process. In at least one of the various embodiments, updates made to allocation rules may change the key features for data objects in that model. Accordingly, the grouped objects and their associated assignment ratio tables may be update reflect the addition of key features or the removal of key features. Likewise, changes to the values of key features may occur that required the grouped object to be regenerated or otherwise updated. For example, if new line items are added to a data object, its corresponding grouped object (if any) may need to be updated based the key feature value changes. Next, control may be returned to a calling process.
At block 1104, in at least one of the various embodiments, the determined allocation rules may be analyzed to determine the data object features, if any that are relevant to the operation of the allocation rules. For example, as described above, for allocation rule 816, the controlling feature of the allocation rule is the location of servers and the data centers. Other allocation rules in other data model may have different features, such as, model of the server, server roles, (e.g., web server, database server, or the like) CPU type, or the like, or combination thereof.
In at least one of the various embodiments, an allocation rule may be arranged to have more than one key feature, such as, location and server role. Likewise, in at least one of the various embodiments, some allocation rules may be arranged to essential having no grouping feature, such as, rules that just split/share the resources evenly.
At block 1106, in at least one of the various embodiments, a grouped object may be generated by grouping/collapsing the cost line items in the data object based on the grouping features that were determined for its associated allocation rules.
In at least one of the various embodiments, a grouped object may be collapsed to the minimum number of rows that maintain the distinct values of the key features determined from its associated allocation rules. For example, in allocation rule 816 the key feature is location, thus the grouped object (e.g., grouped object 910) may be reduced to the number of distinct locations.
At block 1108, in at least one of the various embodiments, the grouped object may be employed to generate one or more assignment ratio tables based on its associated allocation rules. In at least one of the various embodiments, the allocation rules may be applied to the grouped object and one or more data objects. The grouped objects are arranged such that they include a reduced set of line items (less than their corresponding data object). Accordingly, assignment ratio tables that are generated during the application of the allocation rules may have significantly less rows to be computed.
Next, control may be returned to a calling process.
At block 1204, in at least one of the various embodiments, the cost modeling application may traverse the data model in response the query/request. In at least one of the various embodiments, the query may comprise a question about how many resources at one data object are allocated to/from another object. For example, referring to
At decision block 1206, in at least one of the various embodiments, if grouped object detail is needed, control may flow to block 1208; otherwise, control flow to decision block 1210. In at least one of the various embodiments, when a data model includes grouped objects, the assignment ratio tables used to answer the queries are generated using the grouped objects to reduce computation cost. However, in some cases, the query may be arranged such that it requires one or more grouped line items (collapsed rows) in the grouped object to be expanded to completely answer the query and/or produce the requested report information. For example, the query may include a filter clause that references one or more values of a data objects features that where not used in the allocation rules. Accordingly, such features, would not be directly represented/included in the assignment ration table that may be associated with the grouped object. Referring to
At decision block 1210, in at least one of the various embodiments, if the cost modeling application has completed generating the report information for answering the query/request, control may flow to block 1212; otherwise, control may loop back to block 1204. In at least one of the various embodiments, there may be multiple data object and/or grouped object that contribute to the report information that may be used to answer a query/report request. Accordingly, the cost modeling application will continue iterating of data object, grouped objects and their associated assignment ratio tables until the information gathering is finished.
At block 1212, in at least one of the various embodiments, a report may be generated based on the report information that may have been gathered. In at least one of the various embodiments, reports may be provided in various formats, such as, displayed using a graphical user interface, saved to a databases, printed, communicated to an external application or process for further processing, or the like, or combination thereof. Next, control may be returned to a calling process.
It will be understood that each block of the flowchart illustration, and combinations of blocks in the flowchart illustration, can be implemented by computer program instructions. These program instructions may be provided to a processor to produce a machine, such that the instructions, which execute on the processor, create means for implementing the actions specified in the flowchart block or blocks. The computer program instructions may be executed by a processor to cause a series of operational steps to be performed by the processor to produce a computer-implemented process such that the instructions, which execute on the processor to provide steps for implementing the actions specified in the flowchart block or blocks. The computer program instructions may also cause at least some of the operational steps shown in the blocks of the flowchart to be performed in parallel. These program instructions may be stored on some type of machine readable storage media, such as processor readable non-transitive storage media, or the like. Moreover, some of the steps may also be performed across more than one processor, such as might arise in a multi-processor computer system. In addition, one or more blocks or combinations of blocks in the flowchart illustration may also be performed concurrently with other blocks or combinations of blocks, or even in a different sequence than illustrated without departing from the scope or spirit of the invention.
Accordingly, blocks of the flowchart illustration support combinations of means for performing the specified actions, combinations of steps for performing the specified actions and program instruction means for performing the specified actions. It will also be understood that each block of the flowchart illustration, and combinations of blocks in the flowchart illustration, can be implemented by special purpose hardware-based systems, which perform the specified actions or steps, or combinations of special purpose hardware and computer instructions. The foregoing example should not be construed as limiting and/or exhaustive, but rather, an illustrative use case to show an implementation of at least one of the various embodiments of the invention.
Additionally, in one or more steps or blocks, may be implemented using embedded logic hardware, such as, an Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), Programmable Array Logic (PAL), or the like, or combination thereof, instead of a computer program. The embedded logic hardware may directly execute embedded logic to perform actions some or all of the actions in the one or more steps or blocks. Also, in one or more embodiments (not shown in the figures), some or all of the actions of one or more of the steps or blocks may be performed by a hardware microcontroller instead of a CPU. In at least one embodiment, the microcontroller may directly execute its own embedded logic to perform actions and access its own internal memory and its own external Input and Output Interfaces (e.g., hardware pins and/or wireless transceivers) to perform actions, such as System On a Chip (SOC), or the like.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4744026 | Vanderbei | May 1988 | A |
| 5249120 | Foley | Sep 1993 | A |
| 5615121 | Babayev et al. | Mar 1997 | A |
| 5619211 | Horkin et al. | Apr 1997 | A |
| 5721919 | Morel et al. | Feb 1998 | A |
| 5758327 | Gardner et al. | May 1998 | A |
| 5799286 | Morgan et al. | Aug 1998 | A |
| 5802508 | Morgenstern | Sep 1998 | A |
| 5903453 | Stoddard, II | May 1999 | A |
| 5970476 | Fahey | Oct 1999 | A |
| 5991741 | Speakman et al. | Nov 1999 | A |
| 6014640 | Bent | Jan 2000 | A |
| 6032123 | Jameson | Feb 2000 | A |
| 6047290 | Kennedy et al. | Apr 2000 | A |
| 6208993 | Shadmon | Mar 2001 | B1 |
| 6249769 | Ruffin et al. | Jun 2001 | B1 |
| 6253192 | Corlett et al. | Jun 2001 | B1 |
| 6308166 | Breuker et al. | Oct 2001 | B1 |
| 6321207 | Ye | Nov 2001 | B1 |
| 6330552 | Farrar et al. | Dec 2001 | B1 |
| 6424969 | Gruenwald | Jul 2002 | B1 |
| 6507825 | Suh | Jan 2003 | B2 |
| 6578005 | Lesaint et al. | Jun 2003 | B1 |
| 6594672 | Lampson et al. | Jul 2003 | B1 |
| 6647370 | Fu et al. | Nov 2003 | B1 |
| 6738736 | Bond | May 2004 | B1 |
| 6789252 | Burke et al. | Sep 2004 | B1 |
| 6832212 | Zenner et al. | Dec 2004 | B1 |
| 6839719 | Wallace | Jan 2005 | B2 |
| 6877034 | Machin et al. | Apr 2005 | B1 |
| 6882630 | Seaman | Apr 2005 | B1 |
| 6965867 | Jameson | Nov 2005 | B1 |
| 6983321 | Trinon et al. | Jan 2006 | B2 |
| 7050997 | Wood, Jr. | May 2006 | B1 |
| 7130822 | Their et al. | Oct 2006 | B1 |
| 7149700 | Munoz et al. | Dec 2006 | B1 |
| 7177850 | Argenton et al. | Feb 2007 | B2 |
| 7263527 | Malcolm | Aug 2007 | B1 |
| 7305491 | Miller et al. | Dec 2007 | B2 |
| 7308427 | Hood | Dec 2007 | B1 |
| 7321869 | Phibbs, Jr. | Jan 2008 | B1 |
| 7386535 | Kalucha et al. | Jun 2008 | B1 |
| 7418438 | Gould et al. | Jun 2008 | B2 |
| 7505888 | Legault et al. | Mar 2009 | B2 |
| 7590937 | Jacobus et al. | Sep 2009 | B2 |
| 7634431 | Stratton | Dec 2009 | B2 |
| 7653449 | Hunter et al. | Jan 2010 | B2 |
| 7664729 | Klein et al. | Feb 2010 | B2 |
| 7703003 | Payne et al. | Apr 2010 | B2 |
| 7725343 | Johanson et al. | May 2010 | B2 |
| 7742961 | Aaron et al. | Jun 2010 | B2 |
| 7752077 | Holden et al. | Jul 2010 | B2 |
| 7761548 | Snyder et al. | Jul 2010 | B2 |
| 7769654 | Hurewitz | Aug 2010 | B1 |
| 7774458 | Trinon et al. | Aug 2010 | B2 |
| 7783759 | Eilam et al. | Aug 2010 | B2 |
| 7801755 | Doherty et al. | Sep 2010 | B2 |
| 7805400 | Teh et al. | Sep 2010 | B2 |
| 7813948 | Ratzloff | Oct 2010 | B2 |
| 7852711 | Fitzgerald et al. | Dec 2010 | B1 |
| 7870051 | En et al. | Jan 2011 | B1 |
| 7877742 | Duale et al. | Jan 2011 | B2 |
| 7899235 | Williams et al. | Mar 2011 | B1 |
| 7917555 | Gottumukkala et al. | Mar 2011 | B2 |
| 7930396 | Trinon et al. | Apr 2011 | B2 |
| 7933861 | Zadorozhny | Apr 2011 | B2 |
| 7945489 | Weiss et al. | May 2011 | B2 |
| 7966235 | Capelli et al. | Jun 2011 | B1 |
| 7966266 | Delvat | Jun 2011 | B2 |
| 8010584 | Craver et al. | Aug 2011 | B1 |
| 8024241 | Bailey et al. | Sep 2011 | B2 |
| 8073724 | Harthcryde et al. | Dec 2011 | B2 |
| 8121959 | Delvat | Feb 2012 | B2 |
| 8175863 | Ostermeyer et al. | May 2012 | B1 |
| 8195524 | Sandholm et al. | Jun 2012 | B2 |
| 8195785 | Snyder et al. | Jun 2012 | B2 |
| 8200518 | Bailey et al. | Jun 2012 | B2 |
| 8200561 | Scott et al. | Jun 2012 | B1 |
| 8209218 | Basu et al. | Jun 2012 | B1 |
| 8214829 | Neogi et al. | Jul 2012 | B2 |
| 8260959 | Rudkin et al. | Sep 2012 | B2 |
| 8370243 | Cernyar | Feb 2013 | B1 |
| 8396775 | Mindlin | Mar 2013 | B1 |
| 8423428 | Grendel et al. | Apr 2013 | B2 |
| 8484355 | Lochhead et al. | Jul 2013 | B1 |
| 8533904 | Conrad | Sep 2013 | B2 |
| 8543438 | Fleiss | Sep 2013 | B1 |
| 8600830 | Hoffberg | Dec 2013 | B2 |
| 8601263 | Shankar et al. | Dec 2013 | B1 |
| 8606827 | Williamson | Dec 2013 | B2 |
| 8655714 | Weir et al. | Feb 2014 | B2 |
| 8667385 | Mui et al. | Mar 2014 | B1 |
| 8766981 | McLachlan et al. | Jul 2014 | B2 |
| 8768976 | McLachlan et al. | Jul 2014 | B2 |
| 8826230 | Michelsen | Aug 2014 | B1 |
| 8935301 | Chmiel et al. | Jan 2015 | B2 |
| 8937618 | Erez et al. | Jan 2015 | B2 |
| 8970476 | Chan | Mar 2015 | B2 |
| 8996552 | Mukes et al. | Mar 2015 | B2 |
| 9015692 | Clavel | Apr 2015 | B1 |
| 9020830 | Purpus et al. | Apr 2015 | B2 |
| 9104661 | Evans | Aug 2015 | B1 |
| 9213573 | French et al. | Dec 2015 | B2 |
| 9281012 | Hedges | Mar 2016 | B2 |
| 9384511 | Purpus | Jul 2016 | B1 |
| 9529863 | Gindin et al. | Dec 2016 | B1 |
| 9805311 | Mohler | Oct 2017 | B1 |
| 10152722 | Heath | Dec 2018 | B2 |
| 20020002557 | Straube et al. | Jan 2002 | A1 |
| 20020016752 | Suh | Feb 2002 | A1 |
| 20020056004 | Smith | May 2002 | A1 |
| 20020069102 | Vellante et al. | Jun 2002 | A1 |
| 20020082966 | O'Brien et al. | Jun 2002 | A1 |
| 20020087441 | Wagner, Jr. et al. | Jul 2002 | A1 |
| 20020107914 | Charisius et al. | Aug 2002 | A1 |
| 20020123945 | Booth et al. | Sep 2002 | A1 |
| 20020145040 | Grabski, III | Oct 2002 | A1 |
| 20020156710 | Ryder | Oct 2002 | A1 |
| 20020174006 | Rugge et al. | Nov 2002 | A1 |
| 20020174049 | Kitahara | Nov 2002 | A1 |
| 20020178198 | Steele | Nov 2002 | A1 |
| 20020194329 | Alling | Dec 2002 | A1 |
| 20030019350 | Khosia | Jan 2003 | A1 |
| 20030074269 | Viswanath | Apr 2003 | A1 |
| 20030083388 | L'Alloret | May 2003 | A1 |
| 20030083888 | Argenton et al. | May 2003 | A1 |
| 20030083912 | Covington et al. | May 2003 | A1 |
| 20030093310 | Macrae | May 2003 | A1 |
| 20030110113 | Martin | Jun 2003 | A1 |
| 20030139960 | Nishikawa et al. | Jul 2003 | A1 |
| 20030139986 | Roberts, Jr. | Jul 2003 | A1 |
| 20030158724 | Uchida | Aug 2003 | A1 |
| 20030158766 | Mital et al. | Aug 2003 | A1 |
| 20030172018 | Chen et al. | Sep 2003 | A1 |
| 20030172368 | Alumbaugh et al. | Sep 2003 | A1 |
| 20030195780 | Arora et al. | Oct 2003 | A1 |
| 20030208493 | Hall et al. | Nov 2003 | A1 |
| 20030217033 | Sandler et al. | Nov 2003 | A1 |
| 20030233301 | Chen et al. | Dec 2003 | A1 |
| 20030236721 | Plumer et al. | Dec 2003 | A1 |
| 20040030628 | Takamoto et al. | Feb 2004 | A1 |
| 20040039685 | Hambrecht et al. | Feb 2004 | A1 |
| 20040059611 | Kananghinis et al. | Mar 2004 | A1 |
| 20040059679 | Mizumachi et al. | Mar 2004 | A1 |
| 20040073477 | Heyns et al. | Apr 2004 | A1 |
| 20040093344 | Berger et al. | May 2004 | A1 |
| 20040111509 | Eilam et al. | Jun 2004 | A1 |
| 20040133676 | Sproule | Jul 2004 | A1 |
| 20040138942 | Pearson et al. | Jul 2004 | A1 |
| 20040186762 | Beaven et al. | Sep 2004 | A1 |
| 20040243438 | Mintz | Dec 2004 | A1 |
| 20040249737 | Tofte | Dec 2004 | A1 |
| 20050004856 | Brose et al. | Jan 2005 | A1 |
| 20050033631 | Wefers et al. | Feb 2005 | A1 |
| 20050038788 | Dettinger et al. | Feb 2005 | A1 |
| 20050044224 | Jun et al. | Feb 2005 | A1 |
| 20050060298 | Agapi et al. | Mar 2005 | A1 |
| 20050060317 | Lott et al. | Mar 2005 | A1 |
| 20050071285 | Laicher et al. | Mar 2005 | A1 |
| 20050091102 | Retsina | Apr 2005 | A1 |
| 20050120032 | Liebich et al. | Jun 2005 | A1 |
| 20050131870 | Krishnaswamy et al. | Jun 2005 | A1 |
| 20050131929 | Bailey | Jun 2005 | A1 |
| 20050144110 | Chen et al. | Jun 2005 | A1 |
| 20050171918 | Eden et al. | Aug 2005 | A1 |
| 20050235020 | Gabelmann et al. | Oct 2005 | A1 |
| 20050246482 | Gabelmann et al. | Nov 2005 | A1 |
| 20060010156 | Netz et al. | Jan 2006 | A1 |
| 20060010294 | Pasumansky et al. | Jan 2006 | A1 |
| 20060041458 | Ringrose et al. | Feb 2006 | A1 |
| 20060041501 | Tabata et al. | Feb 2006 | A1 |
| 20060059032 | Wong et al. | Mar 2006 | A1 |
| 20060074980 | Sarkar | Apr 2006 | A1 |
| 20060080264 | Zhang et al. | Apr 2006 | A1 |
| 20060085302 | Weiss et al. | Apr 2006 | A1 |
| 20060085465 | Nori et al. | Apr 2006 | A1 |
| 20060106658 | Johanson et al. | May 2006 | A1 |
| 20060116859 | Legault et al. | Jun 2006 | A1 |
| 20060116975 | Gould et al. | Jun 2006 | A1 |
| 20060126552 | Lee et al. | Jun 2006 | A1 |
| 20060136281 | Peters et al. | Jun 2006 | A1 |
| 20060143219 | Smith et al. | Jun 2006 | A1 |
| 20060161879 | Lubrecht et al. | Jul 2006 | A1 |
| 20060167703 | Yakov | Jul 2006 | A1 |
| 20060178960 | Lepman | Aug 2006 | A1 |
| 20060179012 | Jacobs | Aug 2006 | A1 |
| 20060190497 | Inturi et al. | Aug 2006 | A1 |
| 20060200400 | Hunter et al. | Sep 2006 | A1 |
| 20060200477 | Barrenechea | Sep 2006 | A1 |
| 20060212146 | Johnson et al. | Sep 2006 | A1 |
| 20060212334 | Jackson | Sep 2006 | A1 |
| 20060224740 | Sievers-Tostes | Oct 2006 | A1 |
| 20060224946 | Barrett et al. | Oct 2006 | A1 |
| 20060228654 | Sanjar et al. | Oct 2006 | A1 |
| 20060235785 | Chait et al. | Oct 2006 | A1 |
| 20060259468 | Brooks et al. | Nov 2006 | A1 |
| 20060277074 | Einav et al. | Dec 2006 | A1 |
| 20060282429 | Hernandez-Sherrington et al. | Dec 2006 | A1 |
| 20070038494 | Kreitzbert et al. | Feb 2007 | A1 |
| 20070088641 | Aaron et al. | Apr 2007 | A1 |
| 20070113289 | Blumenau | May 2007 | A1 |
| 20070118516 | Li et al. | May 2007 | A1 |
| 20070124162 | Mekyska | May 2007 | A1 |
| 20070129892 | Smartt et al. | Jun 2007 | A1 |
| 20070179975 | Teh et al. | Aug 2007 | A1 |
| 20070185785 | Carlson et al. | Aug 2007 | A1 |
| 20070198317 | Harthcrycle et al. | Aug 2007 | A1 |
| 20070198982 | Bolan et al. | Aug 2007 | A1 |
| 20070214413 | Boeckenhauer | Sep 2007 | A1 |
| 20070226064 | Yu et al. | Sep 2007 | A1 |
| 20070226090 | Stratton | Sep 2007 | A1 |
| 20070233439 | Carroll et al. | Oct 2007 | A1 |
| 20070260532 | Blake, III | Nov 2007 | A1 |
| 20070265896 | Smith | Nov 2007 | A1 |
| 20070271203 | Delvat | Nov 2007 | A1 |
| 20070276755 | Rapp | Nov 2007 | A1 |
| 20070282626 | Zhang et al. | Dec 2007 | A1 |
| 20080027957 | Bruckner et al. | Jan 2008 | A1 |
| 20080033774 | Kimbrel et al. | Feb 2008 | A1 |
| 20080059945 | Sauer et al. | Mar 2008 | A1 |
| 20080060058 | Shea et al. | Mar 2008 | A1 |
| 20080065435 | Ratzloff | Mar 2008 | A1 |
| 20080071844 | Gopal et al. | Mar 2008 | A1 |
| 20080082186 | Hood et al. | Apr 2008 | A1 |
| 20080082435 | O'Brien et al. | Apr 2008 | A1 |
| 20080120122 | Olenski et al. | May 2008 | A1 |
| 20080201269 | Hollins et al. | Aug 2008 | A1 |
| 20080201297 | Choi et al. | Aug 2008 | A1 |
| 20080208647 | Hawley et al. | Aug 2008 | A1 |
| 20080208667 | Lymbery et al. | Aug 2008 | A1 |
| 20080222638 | Beaty et al. | Sep 2008 | A1 |
| 20080239393 | Navon | Oct 2008 | A1 |
| 20080255912 | Christiansen et al. | Oct 2008 | A1 |
| 20080295096 | Beaty et al. | Nov 2008 | A1 |
| 20080312979 | Lee et al. | Dec 2008 | A1 |
| 20080319811 | Casey | Dec 2008 | A1 |
| 20090012986 | Arazi et al. | Jan 2009 | A1 |
| 20090013325 | Kobayashi et al. | Jan 2009 | A1 |
| 20090018880 | Bailey et al. | Jan 2009 | A1 |
| 20090063251 | Rangarajan et al. | Mar 2009 | A1 |
| 20090063540 | Mattox et al. | Mar 2009 | A1 |
| 20090100017 | Graves et al. | Apr 2009 | A1 |
| 20090100406 | Greenfield et al. | Apr 2009 | A1 |
| 20090144120 | Ramachandran | Jun 2009 | A1 |
| 20090150396 | Elisha et al. | Jun 2009 | A1 |
| 20090195350 | Tsern et al. | Jun 2009 | A1 |
| 20090199192 | Laithwaite et al. | Jun 2009 | A1 |
| 20090198535 | Brown et al. | Aug 2009 | A1 |
| 20090210275 | Andreev et al. | Aug 2009 | A1 |
| 20090216580 | Bailey et al. | Aug 2009 | A1 |
| 20090222742 | Pelton et al. | Sep 2009 | A1 |
| 20090234892 | Anglin et al. | Sep 2009 | A1 |
| 20090300173 | Bakman et al. | Dec 2009 | A1 |
| 20090319316 | Westerfeld et al. | Dec 2009 | A1 |
| 20100005014 | Castle et al. | Jan 2010 | A1 |
| 20100005173 | Baskaran et al. | Jan 2010 | A1 |
| 20100017344 | Hambrecht et al. | Jan 2010 | A1 |
| 20100042455 | Liu et al. | Feb 2010 | A1 |
| 20100049494 | Radibratovic et al. | Feb 2010 | A1 |
| 20100082380 | Merrifield, Jr. et al. | Apr 2010 | A1 |
| 20100094740 | Richter | Apr 2010 | A1 |
| 20100125473 | Tung et al. | May 2010 | A1 |
| 20100153282 | Graham | Jun 2010 | A1 |
| 20100161371 | Cantor et al. | Jun 2010 | A1 |
| 20100161634 | Caceres | Jun 2010 | A1 |
| 20100169477 | Stienhans et al. | Jul 2010 | A1 |
| 20100185557 | Hunter et al. | Jul 2010 | A1 |
| 20100198750 | Ron et al. | Aug 2010 | A1 |
| 20100211667 | O'Connell, Jr. | Aug 2010 | A1 |
| 20100250419 | Ariff et al. | Sep 2010 | A1 |
| 20100250421 | Ariff et al. | Sep 2010 | A1 |
| 20100250642 | Yellin et al. | Sep 2010 | A1 |
| 20100293163 | McLachlan et al. | Nov 2010 | A1 |
| 20100299233 | Licardi et al. | Nov 2010 | A1 |
| 20100306382 | Cardosa et al. | Dec 2010 | A1 |
| 20100323754 | Nakagawa | Dec 2010 | A1 |
| 20100325506 | Cai et al. | Dec 2010 | A1 |
| 20100325606 | Sundararajan | Dec 2010 | A1 |
| 20100332262 | Horvitz et al. | Dec 2010 | A1 |
| 20100333109 | Milnor | Dec 2010 | A1 |
| 20110016214 | Jackson | Jan 2011 | A1 |
| 20110016448 | Bauder et al. | Jan 2011 | A1 |
| 20110022861 | Agneeswaran et al. | Jan 2011 | A1 |
| 20110066472 | Scheider | Mar 2011 | A1 |
| 20110066628 | Jayaraman | Mar 2011 | A1 |
| 20110072340 | Miller | Mar 2011 | A1 |
| 20110106691 | Clark et al. | May 2011 | A1 |
| 20110107254 | Moroze | May 2011 | A1 |
| 20110167034 | Knight et al. | Jul 2011 | A1 |
| 20110196795 | Pointer | Aug 2011 | A1 |
| 20110238608 | Sathish | Aug 2011 | A1 |
| 20110225277 | Freimuth et al. | Sep 2011 | A1 |
| 20110295766 | Tompkins | Dec 2011 | A1 |
| 20110313947 | Grohovaz | Dec 2011 | A1 |
| 20120016811 | Jones | Jan 2012 | A1 |
| 20120023170 | Matignon et al. | Jan 2012 | A1 |
| 20120066020 | Moon et al. | Mar 2012 | A1 |
| 20120116990 | Huang | May 2012 | A1 |
| 20120131591 | Moorthi et al. | May 2012 | A1 |
| 20120150736 | Dickerson et al. | Jun 2012 | A1 |
| 20120185368 | Schloter et al. | Jul 2012 | A1 |
| 20120232947 | McLachlan | Sep 2012 | A1 |
| 20120233217 | Purpus et al. | Sep 2012 | A1 |
| 20120233547 | McLachlan | Sep 2012 | A1 |
| 20120239739 | Manglik et al. | Sep 2012 | A1 |
| 20120246046 | Hirsch | Sep 2012 | A1 |
| 20120272234 | Kaiser et al. | Oct 2012 | A1 |
| 20120330869 | Durham | Dec 2012 | A1 |
| 20130028537 | Miyake et al. | Jan 2013 | A1 |
| 20130041792 | King et al. | Feb 2013 | A1 |
| 20130041819 | Khasho | Feb 2013 | A1 |
| 20130060595 | Bailey | Mar 2013 | A1 |
| 20130066866 | Chan et al. | Mar 2013 | A1 |
| 20130091456 | Sherman et al. | Apr 2013 | A1 |
| 20130091465 | Kikin-Gil et al. | Apr 2013 | A1 |
| 20130103369 | Huynh et al. | Apr 2013 | A1 |
| 20130103654 | McLachlan et al. | Apr 2013 | A1 |
| 20130124454 | Bhide et al. | May 2013 | A1 |
| 20130124459 | Iwase et al. | May 2013 | A1 |
| 20130138470 | Goyal et al. | May 2013 | A1 |
| 20130173159 | Trum et al. | Jul 2013 | A1 |
| 20130179371 | Jain et al. | Jul 2013 | A1 |
| 20130201193 | McLachlan et al. | Aug 2013 | A1 |
| 20130227584 | Greene et al. | Aug 2013 | A1 |
| 20130268307 | Li et al. | Oct 2013 | A1 |
| 20130282537 | Snider | Oct 2013 | A1 |
| 20130290470 | CaraDonna et al. | Oct 2013 | A1 |
| 20130293551 | Erez et al. | Nov 2013 | A1 |
| 20130339274 | Willis et al. | Dec 2013 | A1 |
| 20130346390 | Jerzak et al. | Dec 2013 | A1 |
| 20140006085 | McLachlan et al. | Jan 2014 | A1 |
| 20140006222 | Hericks et al. | Jan 2014 | A1 |
| 20140067632 | Curtis | Mar 2014 | A1 |
| 20140075004 | Van Dusen et al. | Mar 2014 | A1 |
| 20140089509 | Akolkar et al. | Mar 2014 | A1 |
| 20140122374 | Hacigumus et al. | May 2014 | A1 |
| 20140129583 | Munkes et al. | May 2014 | A1 |
| 20140136295 | Wasser | May 2014 | A1 |
| 20140143175 | Greenshields et al. | May 2014 | A1 |
| 20140172918 | Kornmann et al. | Jun 2014 | A1 |
| 20140229212 | MacElheron et al. | Aug 2014 | A1 |
| 20140244364 | Evers | Aug 2014 | A1 |
| 20140252095 | Kikin | Sep 2014 | A1 |
| 20140257928 | Chen et al. | Sep 2014 | A1 |
| 20140278459 | Morris | Sep 2014 | A1 |
| 20140279121 | George et al. | Sep 2014 | A1 |
| 20140279201 | Iyoob et al. | Sep 2014 | A1 |
| 20140279676 | Schafer et al. | Sep 2014 | A1 |
| 20140279947 | Chachra et al. | Sep 2014 | A1 |
| 20140288987 | Liu | Sep 2014 | A1 |
| 20140310233 | Catalano et al. | Oct 2014 | A1 |
| 20140337007 | Waibel et al. | Nov 2014 | A1 |
| 20140351166 | Schlossberg | Nov 2014 | A1 |
| 20140365503 | Franceschini et al. | Dec 2014 | A1 |
| 20140365504 | Franceschini et al. | Dec 2014 | A1 |
| 20150006552 | Lord | Jan 2015 | A1 |
| 20150012328 | McLachlan et al. | Jan 2015 | A1 |
| 20150046363 | McNamara et al. | Feb 2015 | A1 |
| 20150066808 | Legare et al. | Mar 2015 | A1 |
| 20150074075 | Alexander | Mar 2015 | A1 |
| 20150088584 | Santiago, III et al. | Mar 2015 | A1 |
| 20150227991 | Yu | Aug 2015 | A1 |
| 20150294273 | Barraci et al. | Oct 2015 | A1 |
| 20150302303 | Hakim | Oct 2015 | A1 |
| 20150341230 | Dave et al. | Nov 2015 | A1 |
| 20150363725 | Anderson et al. | Dec 2015 | A1 |
| 20150379061 | Paraschivescu | Dec 2015 | A1 |
| 20160063577 | Yellin et al. | Mar 2016 | A1 |
| 20160098234 | Weaver et al. | Apr 2016 | A1 |
| 20170102246 | Yang | Mar 2017 | A1 |
| 20180068246 | Crivat et al. | Mar 2018 | A1 |
| Number | Date | Country |
|---|---|---|
| 2011134268 | Jul 2011 | JP |
| Entry |
|---|
| Microsoft Office Excel 2007 AIO Desk Reference for Dummies, ISBN 978-0-470-03738-6. |
| Cable et al, Project Portfolio Earned Value Management using Treemaps, archives-org, 2004 http://www.cs.umd.edu/hcil/treemap/PROJECT%20MANAGEMENT-ASPUBLISHED.pdf. |
| Visualization for Production Management Treemap and Fisheye Table Browser open-video organization webpages 2001 http://www.open-video.org/details.php?videoid=4547. |
| Official Communication for U.S. Appl. No. 13/452,628 dated Nov. 18, 2013. |
| Official Communication for U.S. Appl. No. 14/033,130 dated Dec. 16, 2013. |
| Official Communication for U.S. Appl. No. 13/324,253 dated Jan. 23, 2014. |
| Official Communication for U.S. Appl. No. 13/675,837 dated Jan. 31, 2014. |
| Official Communication for U.S. Appl. No. 13/917,503 dated Jan. 31, 2014. |
| Robinson Glen, Cloud Economics—Cost Optimization (selected slides), Amazon Web Services AWS, SlideShare, Feb. 28, 2012 http://www.slideshare.net/AmazonWebServices/whats-new-with-aws-london. |
| Skilton et al. Building Return on Investment from Cloud Computing, The open Group Whitepaper, mladina webpages, Apr. 2010 http://www.mladina.si/media/objave/dokumenti/2010/5/31/31_5_2010_open_group_building_return-on-investment-from-cloud-computing.pdf. |
| Ward Miles, Optimizing for Cost in the Cioud (selection): AWS Summit, Slideshare Apr. 2012 http://www.slideshare.net/AmazonWebServices/optimizing-your-infrastructure-costs-on-aws. |
| Amazon Reserved Instances, Amazon Web Services, archives org, Jan. 14, 2013 http://web.archive.org/web/2012011453849/http://aws.amazon.com/rds/reserved-instances/?. |
| Cost Optimisation with Amazon Web Services, extracted slides. Slideshare Jan. 30, 2012 http://www.slideshare.net/AmazonWebServices/cost-optimisation-with-amazon-web-services?from_search=1. |
| Deciding an Approach to the cloud AWS Reserved Instances Cloudyn webpages, Feb. 28, 2012 https://www.cloudyn.com/blog/deciding-an-approach-to-the-cloud-aws-reserved-aws. |
| Ganesan Harish. Auto Scaling using AWS, Amazon Web Services AWS (selected slides), Apr. 20, 2011 http://www.slideshare.net/harishganesan/auto-scaling-using-amazon-web-services-aws. |
| Office Communication for U.S. Appl. No. 13/415,797 dated Apr. 9, 2014. |
| Office Communication for U.S. Appl. No. 13/324,253 dated Apr. 9, 2014. |
| Office Communication for U.S. Appl. No. 13/324,253 dated Oct. 24, 2014. |
| Office Communication for U.S. Appl. No. 13/365,150 dated Dec. 3, 2014. |
| Office Communication for U.S. Appl. No. 13/452,628 dated Oct. 1, 2014. |
| Office Communication for U.S. Appl. No. 13/837,815 dated Apr. 7, 2014. |
| Office Communication for U.S. Appl. No. 13/675,837 dated Jan. 31, 2014. |
| Office Communication for U.S. Appl. No. 13/675,837 dated Apr. 2, 2014. |
| Office Communication for U.S. Appl. No. 13/917,503 dated Apr. 3, 2014. |
| Office Communication for U.S. Appl. No. 13/935,147 dated Apr. 11, 2014. |
| Office Communication for U.S. Appl. No. 13/935,147 dated Jun. 16, 2014. |
| Office Communication for U.S. Appl. No. 14/033,130 dated May 27, 2014. |
| Office Communication for U.S. Appl. No. 14/033,130 dated Aug. 5, 2014. |
| Office Communication for U.S. Appl. No. 14/180,308 dated Jan. 30, 2015. |
| Office Communication for U.S. Appl. No. 14/180,308 dated Apr. 8, 2014. |
| Office Communication for U.S. Appl. No. 13/452,628 dated Mar. 13, 2014. |
| SAS Activity-Based Management, 2010, Fact Sheet, 4 pages. |
| Office Communication for U.S. Appl. No. 14/180,308 dated Sep. 2, 2014. |
| Office Communication for U.S. Appl. No. 14/180,308 dated Apr. 17, 2015. |
| Extended European Search Report in EP Application No. 14159413.5 dated Jul. 4, 2014. |
| Office Communication for U.S. Appl. No. 13/415,797 dated Jan. 12, 2015. |
| Office Communication for U.S. Appl. No. 13/837,815 dated Sep. 25, 2014. |
| Office Communication for U.S. Appl. No. 13/324,253 dated Feb. 19, 2015. |
| Henriet et al. “Traffic-Based Cost Allocation in a Network.” The Rand Journal of Economics, 1996, pp. 332-345. |
| Rudnick et al., “Marginal Pricing and Supplement Cost Allocation in Transmission Open Access.” Power Systems, IEEE Transactions on 10.2, 1995, pp. 1125-1132. |
| Office Communication for U.S. Appl. No. 13/949,019 dated Feb. 10, 2015. |
| European Search Report for Application No. 12755613.2 dated Jan. 26 2015. |
| Office Communication for U.S. Appl. No. 13/452,628 dated Mar. 30, 2015. |
| Office Communication for U.S. Appl. No. 13/917,503 dated Apr. 16, 2015. |
| Office Communication for U.S. Appl. No. 13/675,837 dated Apr. 16, 2015. |
| Office Communication for U.S. Appl. No. 13/837,815 dated Apr. 27, 2015. |
| Office Communication for U.S. Appl. No. 13/452,628 dated Jun. 23, 2015. |
| Office Communication for U.S. Appl. No. 13/415,797 dated Jul. 23, 2015. |
| International Search Report and Written Opinion for PCT/US2015/015486 dated Jun. 29, 2015. |
| Office Communication for U.S. Appl. No. 13/935,147 dated Jul. 9, 2015. |
| Office Communication for U.S. Appl. No. 13/415,797 dated Oct. 19, 2015. |
| Office Communication for U.S. Appl. No. 13/837,815 dated Sep. 28, 2015. |
| “Activity Based Costing is the best allocation methodology,” APPTIO, Community for Technology Business Management, Mar. 16, 2010, 2 pages. |
| “Amazon Elastic Computer Cloud (Amazon EC2)”, archive.org, Oct. 21, 2011, 9 pages http://web.archive.org/web/20111029130914/http://aws.amazon.com/ec2/#pricing. |
| “Apptio Extends Leadership in Cloud Business Management with Launch of Apptio Cloud Express,” Apptio, Dec. 12, 2012, 2 pages http://www.apptio.com/news/apptio-extends-leadership-cloud-business-management-launch-apptio-cloud-express#. Ukm4r8X7Lco. |
| “Apptio Optimizes Enterprise IT Costs Utilizing Amazon Web Services Cloud Computing,” Apptio, Apr. 7, 2009, 2 pages http://www.apptio.com/news/apptio-optimizes-enterprise-it-costs-utilizing-amazon-web-services-cloud-computing#. Ukm5XsX7Lco. |
| “Automating Cost Transparency,” Apptio, 2008, 15 pages htto://www.cio.com/documents/whitepapers/AutomatedCostTransparency.pdf. |
| “Cloud Computing and Sustainability: The Environmental Benefits of Moving to the Cloud,” Accenture, archive.org, Aug. 31, 2011, 17 pages http://web.archive.org/web/20110813022626/http://www.accenture.com/SiteCollectionDocuments/PDF/Accenture_Sustainability_Cloud_Computing_TheEnvironmentalBenefitsofMovingtotheCloud.pdf. |
| “IT Cost Transparency and Apptio,” Dec. 4, 2008, 2 pages http://web.archive.org/web/20081204012158/http://www.apptio.com/solutions. |
| “Notice from the European Patent Office dated Oct. 1, 2007 concerning business methods,” Official Journal EPO, dated Nov. 2007, pp. 592-593. |
| “Program Evaluation and Review Technique,” Wikipedia, the free encyclopedia, accessed Mar. 13, 2012, 10 pages http://en.wikipedia.org/wiki/Program_Evaluation_and_Review_Technique—last modified Mar. 12, 2012. |
| “Project Management,” Wikipedia, the free encyclopedia, accessed Mar. 13, 2012 14 pages http://en.wikipedia.org/wiki/Project_management—last modified Mar. 7, 2012. |
| “Visualization for Production Management: Treemap and Fisheye Table Browser,” Open-Video Organization webpages, 2001, 2 pages http://www.open-video.org/details.php?videoid.4547. |
| Busch, J., “Six Strategies for IT Cost Allocation,” Spend Matters, Jan. 5, 2011, 3 pages http://spendmatters.com/2011/01/05/six-strategies-for-it-cost-allocation/. |
| Morgan, T. P., “Apptio puffs up freebie cost control freak for public clouds.” The Register, Dec. 12, 2012, 2 pages http://www.theregister.co.uk/2012/12/12/apptio_cloud_express. |
| Ricknäs, M., “Apptio unveils tool to keep track of cloud costs,” ComputerWorld, Dec. 12, 2012, 1 page http://www.computerworld.com/s/article/9234630/Apptio_unveils_tool_to_keep_track_of_cloud_costs. |
| Talbot, C., “Apptio Cloud Express Provides Free Usage Tracking Service.” talkincloud.com, Dec. 12, 2012, 4 pages http://talkincloud.com/cloud-computing-management/apptio-cloud-express-provides-free-usage-tracking-service. |
| Vizard, M., “Free Service from Apptio Tracks Cloud Service Provider Pricing,” IT Business Edge, Dec. 12, 2012, 6 pages http://www.itbusinessedge.com/blogs/it-unmasked/free-service-from-apptio-tracks-cloud-service-provider-pricing.html. |
| International Search Report and Written Opinion for International Patent Application No. PCT/US2010/035021 dated Jul. 14, 2010. |
| International Preliminary Report on Patentability for International Patent Application No. PCT/US2010/035021 dated Nov. 24, 2011. |
| International Search Report and Written Opinion for International Patent Application No. PCT/US2012/028353 dated Oct. 31, 2012. |
| International Preliminary Report on Patentability for International Patent Application No. PCT/US2012/028353 dated Sep. 19, 2013. |
| International Search Report and Written Opinion for International Patent Application No. PCT/US2012/028378 dated Sep. 12, 2012. |
| International Preliminary Report on Patentability for International Patent Application No. PCT/US2012/028378 dated Sep. 19, 2013. |
| Extended European Search Report in EP Application No. 13151967.0/1955, dated Apr. 19, 2013. |
| Official Communication for U.S. Appl. No. 12/467,120 dated Oct. 4, 2011. |
| Official Communication for U.S. Appl. No. 12/467,120 dated Jun. 20, 2012. |
| Official Communication for U.S. Appl. No. 12/467,120 dated Aug. 29, 2012. |
| Official Communication for U.S. Appl. No. 12/467,120 dated Oct. 23, 2013. |
| Official Communication for U.S. Appl. No. 12/467,120 dated Mar. 26, 2013. |
| Official Communication for U.S. Appl. No. 13/324,253 dated Sep. 25, 2012. |
| Official Communication for U.S. Appl. No. 13/324,253 dated Jan. 10, 2013. |
| Official Communication for U.S. Appl. No. 13/324,253 dated Mar. 19, 2013. |
| Official Communication for U.S. Appl. No. 13/324,253 dated Sep. 6, 2013. |
| Official Communication for U.S. Appl. No. 13/415,797 dated Oct. 3, 2013. |
| Official Communication for U.S. Appl. No. 13/452,628 dated Apr. 22, 2013. |
| Official Communication for U.S. Appl. No. 13/675,837 dated Oct. 10, 2013. |
| Official Communication for U.S. Appl. No. 13/837,815 dated Oct. 23, 2013. |
| Official Communication for U.S. Appl. No. 13/917,478 dated Nov. 7, 2013. |
| Official Communication for U.S. Appl. No. 13/917,503 dated Oct. 10, 2013. |
| Official Communication for U.S. Appl. No. 13/935,147 dated Oct. 22, 2013. |
| Office Communication for U.S. Appl. No. 13/649,019 dated Sep. 23, 2015. |
| Office Communication for U.S. Appl. No. 13/365,150 dated Sep. 24. 2015. |
| Office Communication for U.S. Appl. No. 14/033,130 dated Sep. 15, 2015. |
| Official Communication for U.S. Appl. No. 13/452,628 dated Jan. 12, 2016, 21 pages. |
| Official Communication for U.S. Appl. No. 13/649,019 dated Jan. 4, 2016, 8 pages. |
| European Examination Report for Applicant No. 14159413.5 dated Jul. 15, 2015, 9 pages. |
| Office Communication for U.S. Appl. No. 13/415,701 dated Oct. 27, 2015, 16 pages. |
| Office Communication for U.S. Appl. No. 14/846,349 dated Dec. 17, 2015, 23 pages. |
| Office Communication for U.S. Appl. No. 13/675,837 dated Oct. 26, 2015, 20 pages. |
| Office Communication for U.S. Appl. No. 13/917,503 dated Oct. 22, 2015, 19 pages. |
| Office Communication for U.S. Appl. No. 14/722,663 dated Dec. 1, 2015, 37 pages. |
| Chien-Liang Fok et al., “Rapid Development and Flexible Deployment of Adaptive Wireless Sensor Network Applications,” Proceedings of the 25th IEEE international Conference on Distributed Computing Systems, 2005, pp. 653-662 (10 pages). |
| Frans Flippo et al., “A Framework for Rapid Development of Multimodal Interfaces,” Proceedings of the 5th International Conference on Multimodal Interfaces, 2003, pp. 109-116 (8 pages). |
| David B. Stewart et al., “Rapid Development of Robotic Applications Using Component-Based Real-Time Software,” Intelligent Robots and Systems 1995, Human Robot interaction and Cooperative Robots Proceedings, 1995, IEEE International Conference on vol. 1, pp. 465-470 (6 pages). |
| Office Communication for U.S. Appl. No. 13/365,150 dated Dec. 7, 2015, 3 pages. |
| Official Communication for U.S. Appl. No. 13/935,147 dated Mar. 9, 2016, 10 pages. |
| Official Communication for U.S. Appl. No. 14/033,130 dated Feb. 18, 2016, 22 pages. |
| International Search Report and Written Opinion for PCT/US2015/048697 dated Mar. 31, 2016, 9 pages. |
| Office Communication for U.S. Appl. No. 13/365,150, dated Apr. 6, 2016, 11 pages. |
| Office Communication for U.S. Appl. No. 14/722,663, dated Mar. 31, 2016, 5 pages. |
| Van Diessen et al., “Component Business Model for Digital Repositories: A Framework for Analysis,” AAAI, 2008, 7 pages. |
| Melcher et al., “Visualization and Clustering of Business Process Collections Based on Process Metric Values,” IEEE Computer Society, 2008, 4 pages. |
| Lee et al., “Value-Centric, Model-Driven Business Transformation,” IEEE, 2008, 8 pages. |
| Lee et al., “Business Transformation Workbench: A Practitioner's Tool for Business Transformation,” IEEE International Conference on Services Computing, 2008, 8 pages. |
| Risch et al., “Interactive Information Visualization for Exploratory Intelligence Data Analysis,” IEEE Proceedings of VRAIS, 1996, 10 pages. |
| Office Communication for U.S. Appl. No. 13/415,797, dated Apr. 4, 2016, 24 pages. |
| Office Communication for U.S. Appl. No. 13/837,815, dated Apr. 13, 2016, 22 pages. |
| Official Communication for U.S. Appl. No. 13/415,797 dated Jan. 11, 2017. |
| Official Communication for U.S. Appl. No. 13/675,837 dated Jan. 11, 2017. |
| Official Communication for U.S. Appl. No. 13/917,503 dated Jan. 12, 2017. |
| Official Communication for U.S. Appl. No. 14/033,130 dated Jan. 11, 2017. |
| Official Communication for U.S. Appl. No. 14/867,552 dated Jan. 9, 2017. |
| Official Communication for U.S. Appl. No. 15/351,313 dated Jan. 12, 2017. |
| Official Communication for U.S. Appl. No. 13/837,815 dated Nov. 9, 2016, 11 pages. |
| Official Communication for U.S. Appl. No. 15/260,221 dated Dec. 20, 2016, 21 pages. |
| Official Communication for U.S. Appl. No. 15/271,013 dated Dec. 15, 2016, 50 pages. |
| Office Communication for U.S. Appl. No. 14/867,552, dated Apr. 25, 2016, 12 pages. |
| Office Communication for U.S. Appl. No. 14/033,130, dated Apr. 25, 2016, 4 pages. |
| Office Communication for U.S. Appl. No. 14/971,944, dated May 19, 2016, 17 pages. |
| Stephen Muller and Hasso Platner, “An IN-Depth Analysis of Data Aggregation Cost Factors in a Columnar In-Memory Database”, ACM DOLAP'12, Nov. 2, 2012, Maui, Hawaii, USA, pp. 65-72. |
| Official Communication for U.S. Appl. No. 13/365,150 dated Oct. 24, 2016, 19 pages. |
| Official Communication for U.S. Appl. No. 14/977,368 dated Jun. 7, 2016, 11 pages. |
| Official Communication for U.S. Appl. No. 13/837,815 dated Jun. 23, 2016, 3 pages. |
| Official Communication for U.S. Appl. No. 14/846,349 dated Jul. 1, 2016, 24 pages. |
| Official Communication for U.S. Appl. No. 14/981,747 dated Jul. 14, 2016, 29 pages. |
| Official Communication for U.S. Appl. No. 14/977,368 dated Oct. 19, 2016, 5 pages. |
| Official Communication for U.S. Appl. No. 13/452,628 dated Aug. 18, 2016, 22 pages. |
| Official Communication for U.S. Appl. No. 14/867,552 dated Oct. 3, 2016, 19 pages. |
| Official Communication for U.S. Appl. No. 14/180,308 dated Oct. 19, 2016, 22 pages. |
| Official Communication for U.S. Appl. No. 15/379,267 dated Mar. 10, 2017, 11 pages. |
| Official Communication for U.S. Appl. No. 13/415,797 dated Apr. 14, 2017, 3 pages. |
| Official Communication for U.S. Appl. No. 13/415,797 dated Jan. 11, 2017, 25 pages. |
| Official Communication for U.S. Appl. No. 13/675,837 dated Jan. 11, 2017, 29 pages. |
| Efficient frontier—Wikipedia, Efficient frontier, Wikipedia wehpages, Oct. 30, 2016, https://en.wikipedia.org/wiki/Efficient_frontier, 2 pages. |
| Official Communication for U.S. Appl. No. 13/917,503 dated Jan. 12, 2017, 27 pages. |
| Official Communication for U.S. Appl. No. 14/033,130 dated Jan. 11, 2017, 12 pages. |
| Official Communication for U.S. Appl. No. 14/867,552 dated Jan. 9, 2017, 3 pages. |
| Official Communication for U.S. Appl. No. 15/351,313 dated Jan. 12, 2017, 7 pages. |
| Official Communication for U.S. Appl. No. 13/837,815 dated Nov. 9, 2016. |
| Official Communication for U.S. Appl. No. 15/260,221 dated Dec. 20, 2016. |
| Official Communication for U.S. Appl. No. 15/271,013 dated Dec. 15, 2016. |
| Office Communication for U.S. Appl. No. 14/867,552, dated Apr. 25, 2016. |
| Office Communication for U.S. Appl. No. 14/033,130, dated Apr. 25, 2016. |
| Office Communication for U.S. Appl. No. 14/971,944, dated May 19, 2016. |
| Official Communication for U.S. Appl. No. 14/977,368 dated Jun. 7, 2016. |
| Official Communication for U.S. Appl. No. 13/837,815 dated Jun. 23, 2016. |
| Official Communication for U.S. Appl. No. 14/846,349 dated Jul. 1, 2016. |
| Official Communication for U.S. Appl. No. 14/981,747 dated Jul. 14, 2016. |
| Official Communication for U.S. Appl. No. 14/867,552 dated Oct. 3, 2016. |
| Official Communication for U.S. Appl. No. 14/180,308 dated Oct. 19, 2016. |
| Official Communication for U.S. Appl. No. 14/977,368 dated Oct. 19, 2016. |
| Official Communication for U.S. Appl. No. 13/365,150 dated Oct. 24, 2016. |
| Official Communication for U.S. Appl. No. 13/452,628 dated Aug. 18, 2016. |
| Official Communication for U.S. Appl. No. 14/180,308 dated Feb. 8, 2017, 3 pages. |
| Official Communication for U.S. Appl. No. 14/846,349 dated Mar. 1, 2017, 27 pages. |
| Official Communication for U.S. Appl. No. 13/935,147 dated Mar. 7, 2017, 12 pages. |
| Official Communication for U.S. Appl. No. 13/365,150 dated Mar. 15, 2017, 19 pages. |
| Official Communication for U.S. Appl. No. 13/452,628 dated Mar. 9, 2017, 24 pages. |
| Official Communication for U.S. Appl. No. 13/917,503 dated May 16, 2017. |
| Official Communication for U.S. Appl. No. 13/365,150 dated May 22, 2017. |
| Official Communication for U.S. Appl. No. 14/981,747 dated May 19, 2017. |
| Official Communication for U.S. Appl. No. 15/271,013 dated May 24, 2017. |
| Official Communication for U.S. Appl. No. 14/180,308 dated May 25, 2017. |
| Official Communication for U.S. Appl. No. 13/365,150 dated May 22, 2017, 3 pages. |
| Official Communication for U.S. Appl. No. 13/917,503 dated May 16, 2017, 29 pages. |
| Official Communication for U.S. Appl. No. 14/981,747 dated May 19, 2017, 43 pages. |
| Official Communication for U.S. Appl. No. 15/271,013 dated May 24, 2017, 37 pages. |
| Official Communication for U.S. Appl. No. 15/351,313 dated Jul. 18, 2017, 15 pages. |
| Official Communication for U.S. Appl. No. 15/260,221 dated Aug. 15, 2017, 21 pages. |
| Official Communication for U.S. Appl. No. 13/365,150 dated Aug. 23, 2017, 30 pages. |
| Official Communication for European Application No. 13151967.0 dated Aug. 18, 2017, 7 pages. |
| European Search Report for European Application No. 10775648.8 dated Mar. 10, 2017, 6 pages. |
| Official Communication for European Application No. 12755613.2 dated Aug. 17, 2017, 7 pages. |
| Official Communication for U.S. Appl. No. 14/033,130 dated Sep. 7, 2017, 3 pages. |
| Official Communication for U.S. Appl. No. 14/846,349 dated Sep. 8, 2017, 25 pages. |
| Official Communication for U.S. Appl. No. 13/452,628 dated Sep. 28, 2017, 26 pages. |
| Official Communication for U.S. Appl. No. 13/837,815 dated Sep. 28, 2017, 9 pages. |
| Official Communication for U.S. Appl. No. 13/415,797 dated Sep. 7, 2017, 26 pages. |
| Official Communication for U.S. Appl. No. 15/379,267 dated Jun. 30, 2017, 16 pages. |
| Official Communication for U.S. Appl. No. 14/867,552 dated Jun. 29, 2017, 31 pages. |
| Official Communication for U.S. Appl. No. 14/033,130 dated Jun. 29, 2017, 18 pages. |
| Official Communication for U.S. Appl. No. 13/837,815 dated Jun. 12, 2017, 12 pages. |
| Official Communication for U.S. Appl. No. 14/867,552 dated Nov. 29, 2017. |
| Official Communication for U.S. Appl. No. 14/981,747 dated Dec. 12, 2017. |
| Official Communication for U.S. Appl. No. 14/033,130 dated Dec. 20, 2017. |
| Official Communication for U.S. Appl. No. 14/180,308 dated Dec. 22, 2017. |
| Official Communication for U.S. Appl. No. 15/271,013 dated Dec. 27, 2017. |
| Official Communication for U.S. Appl. No. 15/260,221 dated Jan. 9, 2018. |
| Official Communication for U.S. Appl. No. 15/379,267 dated Jan. 2, 2018. |
| Official Communication for U.S. Appl. No. 15/351,313 dated Jan. 8, 2018. |
| Official Communication for U.S. Appl. No. 14/846,349 dated Jan. 18, 2018. |
| Official Communication for U.S. Appl. No. 13/935,147 dated Jan. 17, 2018. |
| Official Communication for U.S. Appl. No. 15/379,267 dated Oct. 6, 2017. |
| Official Communication for U.S. Appl. No. 15/859,008 dated Mar. 5, 2018. |
| Official Communication for U.S. Appl. No. 14/846,349 dated Nov. 20, 2017. |
| Official Communication for U.S. Appl. No. 13/917,503 dated Nov. 28, 2017. |
| Official Communication for U.S. Appl. No. 13/837,815 dated Jan. 26, 2018. |
| Official Communication for U.S. Appl. No. 13/935,147 dated Nov. 3, 2017. |
| Official Communication for U.S. Appl. No. 14/867,552 dated Feb. 13, 2018. |
| Official Communication for U.S. Appl. No. 14/867,552 dated Nov. 29, 2017, 12 pages. |
| Official Communication for U.S. Appl. No. 14/981,747 dated Dec. 12, 2017, 44 pages. |
| Official Communication for U.S. Appl. No. 14/033,130 dated Dec. 20, 2017, 12 pages. |
| Official Communication for U.S. Appl. No. 14/180,308 dated Dec. 22, 2017, 18 pages. |
| Official Communication for U.S. Appl. No. 15/271,013 dated Dec. 27, 2017, 35 pages. |
| Official Communication for U.S. Appl. No. 15/260,221 dated Jan. 9, 2018, 21 pages. |
| Official Communication for U.S. Appl. No. 15/379,267 dated Jan. 2, 2018, 15 pages. |
| Official Communication for U.S. Appl. No. 15/351,313 dated Jan. 8, 2018, 11 pages. |
| Official Communication for U.S. Appl. No. 14/846,349 dated Jan. 18, 2018, 29 pages. |
| Official Communication for U.S. Appl. No. 13/935,147 dated Nov. 3, 2017, 11 pages. |
| Official Communication for U.S. Appl. No. 15/379,267 dated Oct. 6, 2017, 3 pages. |
| Official Communication for U.S. Appl. No. 15/859,008 dated Mar. 5, 2018, 20 pages. |
| Official Communication for U.S. Appl. No. 14/846,349 dated Nov. 20, 2017, 3 pages. |
| Official Communication for U.S. Appl. No. 13/917,503 dated Nov. 28, 2017, 26 pages. |
| Official Communication for U.S. Appl. No. 13/837,815 dated Jan. 26, 2018, 12 pages. |
| Official Communication for U.S. Appl. No. 14/867,552 dated Feb. 13, 2018, 3 pages. |
| Official Communication for U.S. Appl. No. 13/935,147 dated Jan. 17, 2018, 3 pages. |
| Official Communication for U.S. Appl. No. 13/917,503 dated Jul. 19, 2018. |
| Official Communication for U.S. Appl. No. 14/846,349 dated Jul. 20, 2018. |
| Official Communication for U.S. Appl. No. 14/981,747 dated Jul. 5, 2018. |
| Official Communication for U.S. Appl. No. 15/271,013 dated Jul. 6, 2018. |
| Official Communication for U.S. Appl. No. 15/379,267 dated Jul. 19, 2018. |
| Official Communication for U.S. Appl. No. 13/917,503 dated May 10, 2018, pp. 1-38. |
| Official Communication for U.S. Appl. No. 13/837,815 dated Apr. 5, 2018, pp. 1-4. |
| Official Communication for U.S. Appl. No. 14/867,552 dated May 31, 2018, pp. 1-22. |
| Official Communication for U.S. Appl. No. 15/351,313 dated Jun. 4, 2018, pp. 1-9. |
| Official Communication for U.S. Appl. No. 15/858,945 dated Apr. 4, 2018, pp. 1-74. |
| Official Communication for U.S. Appl. No. 15/859,058 dated May 14, 2018, pp. 1-76. |
| Official Communication for U.S. Appl. No. 13/935,147 dated Apr. 5, 2018, pp. 1-14. |
| Official Communication for U.S. Appl. No. 13/935,147 dated Aug. 10, 2018, pp. 1-25. |
| Official Communication for U.S. Appl. No. 14/033,130 dated Aug. 9, 2018, pp. 1-47. |
| Official Communication for U.S. Appl. No. 15/858,945 dated Sep. 10, 2018, pp. 1-25. |
| Official Communication for U.S. Appl. No. 15/859,008 dated Jul. 31, 2018, pp. 1-28. |
| Official Communication for U.S. Appl. No. 14/180,308 dated Aug. 6, 2018, pp. 1-23. |
| Official Communication for U.S. Appl. No. 13/935,147 dated Aug. 10, 2018. |
| Official Communication for U.S. Appl. No. 14/033,130 dated Aug. 9, 2018. |
| Official Communication for U.S. Appl. No. 15/858,945 dated Sep. 10, 2018. |
| Official Communication for U.S. Appl. No. 15/859,008 dated Jul. 31, 2018. |
| Official Communication for U.S. Appl. No. 14/180,308 dated Aug. 6, 2018. |
| Official Communication for U.S. Appl. No. 13/917,503 dated Jul. 19, 2018, pp. 1-3. |
| Official Communication for U.S. Appl. No. 14/846,349 dated Jul. 20, 2018, pp. 1-40. |
| Official Communication for U.S. Appl. No. 14/981,747 dated Jul. 5, 2018, pp. 1-62. |
| Official Communication for U.S. Appl. No. 15/271,013 dated Jul. 6, 2018, pp. 1-49. |
| Official Communication for U.S. Appl. No. 15/379,267 dated Jul. 19, 2018, pp. 1-34. |
| Official Communication for U.S. Appl. No. 13/917,503 dated Apr. 1, 2019. |
| Official Communication for U.S. Appl. No. 13/935,147 dated Mar. 28, 2019. |
| Official Communication for U.S. Appl. No. 14/033,130 dated Apr. 10, 2019. |
| Official Communication for U.S. Appl. No. 14/180,308 dated Feb. 26, 2019. |
| Official Communication for U.S. Appl. No. 14/867,552 dated Feb. 11, 2019. |
| Official Communication for U.S. Appl. No. 14/981,747 dated Dec. 26, 2018. |
| Official Communication for U.S. Appl. No. 15/260,221 dated Jan. 8, 2019. |
| Official Communication for U.S. Appl. No. 15/271,013 dated Mar. 28, 2019. |
| Official Communication for U.S. Appl. No. 15/351,313 dated Apr. 1, 2019. |
| Official Communication for U.S. Appl. No. 15/585,945 dated Feb. 6, 2019. |
| Official Communication for U.S. Appl. No. 15/859,058 dated Mar. 25, 2019. |
| Official Communication for U.S. Appl. No. 14/033,130 dated Dec. 18, 2018. |
| Official Communication for U.S. Appl. No. 14/867,552 dated Nov. 21, 2018. |
| Official Communication for U.S. Appl. No. 15/260,221 dated Oct. 5, 2018. |
| Official Communication for U.S. Appl. No. 15/379,267 dated Oct. 18, 2018. |
| Official Communication for U.S. Appl. No. 15/271,013 dated Dec. 18, 2018. |
| Official Communication for U.S. Appl. No. 15/859,058 dated Dec. 5, 2018. |
| Official Communication for U.S. Appl. No. 15/859,008 dated Apr. 12, 2019. |
| Official Communication for U.S. Appl. No. 13/917,503 dated Apr. 1, 2019, pp. 1-34. |
| Official Communication for U.S. Appl. No. 13/935,147 dated Mar. 28, 2019, pp. 1-16. |
| Official Communication for U.S. Appl. No. 14/033,130 dated Apr. 10, 2019, pp. 1-9. |
| Official Communication for U.S. Appl. No. 14/180,308 dated Feb. 26, 2019, pp. 1-28. |
| Official Communication for U.S. Appl. No. 14/867,552 dated Feb. 11, 2019, pp. 1-8. |
| Official Communication for U.S. Appl. No. 14/981,747 dated Dec. 26, 2018, pp. 1-50. |
| Official Communication for U.S. Appl. No. 15/260,221 dated Jan. 8, 2019, pp. 1-19. |
| Official Communication for U.S. Appl. No. 15/271,013 dated Mar. 28, 2019, pp. 1-53. |
| Official Communication for U.S. Appl. No. 15/351,313 dated Apr. 1, 2019, pp. 1-31. |
| Official Communication for U.S. Appl. No. 15/585,945 dated Feb. 6, 2019, pp. 1-15. |
| Official Communication for U.S. Appl. No. 15/859,058 dated Mar. 25, 2019, pp. 1-24. |
| Official Communication for U.S. Appl. No. 14/033,130 dated Dec. 18, 2018, pp. 1-11. |
| Official Communication for U.S. Appl. No. 14/867,552 dated Nov. 21, 2018, pp. 1-37. |
| Official Communication for U.S. Appl. No. 15/260,221 dated Oct. 5, 2018, pp. 1-40. |
| Official Communication for U.S. Appl. No. 15/379,267 dated Oct. 18, 2018, pp. 1-9. |
| Official Communication for U.S. Appl. No. 15/271,013 dated Dec. 18, 2018, pp. 1-47. |
| Official Communication for U.S. Appl. No. 15/859,058 dated Dec. 5, 2018, pp. 1-20. |
| Official Communication for U.S. Appl. No. 15/859,008 dated Apr. 12, 2019, pp. 1-19. |
| Number | Date | Country | |
|---|---|---|---|
| 20170091689 A1 | Mar 2017 | US |
