Abstract: Burst throttling methods may be used manage computing resources of a data storage service. Tokens may represent I/O operations executed by a customer of the data storage service. A global token bucket may contain a set of tokens representing the overall I/O operation capacity of the data storage service. Additionally, a work token bucket may contain a set of tokens for a given logical volume maintained by the data storage service. When I/O requests are received the data storage service may dynamically determine an amount of tokens to be removed from the global token bucket and/or work token bucket for each received request. Furthermore, if there is sufficient capacity the data storage service may charge a reduced number of tokens to the work token bucket.

Abstract: A fluid dispersion assembly comprises a diffusion unit disposed in fluid communication with a fluid container, the assembly being powered by a compressed air source. The diffusion unit at least partially defines a diffusion chamber, and includes a diffusion assembly containing an atomizer assembly which, in combination with the diffusion chamber, generates a fluid dispersion from a mixture of compressed air and an operative fluid, for example, fragrant oils, essential oils, odor neutralizers, disinfectants such as triethylene glycol, air sanitizers, etc. The diffusion unit may include a suppressor assembly and/or a silencer assembly to reduce the amount of noise generated during operation. In one alternate embodiment, a modified diffusion chamber is provided which functions as a suppression chamber, thereby reducing the noise generated during operation of the assembly.

Abstract: An aircraft flooring system for an aircraft fuselage adapted to secure a payload component may include first and second seat tracks extending longitudinally with respect to the aircraft fuselage, the first and second seat tracks being spaced from one another; and an intercostal assembly extending between the first and second seat tracks. The intercostal assembly can include a first intercostal having a center member having a first end and a second end and a top flange including a mounting region between the first and second ends; and at least first and second tab members. The first tab member can be coupled to the top flange toward the first end of the center member and the second tab member can be coupled to the top flange toward the second end of the center member. The first and second tab members can extend beyond the first and second ends of the center member, respectively, and be configured to be coupled to the first and second seat tracks.

Abstract: A fluid dispersion assembly comprises a diffusion unit disposed in fluid communication with a fluid container, the assembly being powered by a compressed air source. The diffusion unit at least partially defines a diffusion chamber, and includes a diffusion assembly containing an atomizer assembly which, in combination with the diffusion chamber, generates a fluid dispersion from a mixture of compressed air and an operative fluid, for example, fragrant oils, essential oils, odor neutralizers, disinfectants such as triethylene glycol, air sanitizers, etc. The diffusion unit may include a suppressor assembly and/or a silencer assembly to reduce the amount of noise generated during operation. In one alternate embodiment, a modified diffusion chamber is provided which functions as a suppression chamber, thereby reducing the noise generated during operation of the assembly.

Abstract: Various technologies and techniques are disclosed that improve synchronization of data between varying types of devices and/or services. A full participant receives a request from another participant to perform a synchronization operation. The synchronization engine determines whether the device or service is a full, partial, or simple participant. The device or service is a simple participant if it has a data store for synchronized data and no knowledge store. The device or service is a partial participant if it has a data store for synchronized data and a knowledge store, but does not understand the knowledge. The device or service is a full participant type if it has a data store for synchronized data and a knowledge store and understands the knowledge. The synchronization engine performs the synchronization operation with the device or service using a set of logic that is appropriate for the type of device or service.

Abstract: A methodology of reducing process algebra to a language that facilitates modeling a business workflow process is provided. A process algebra is reduced to a model for business workflow processes. The model is then reduced to a scheduling programming language to allow users to create models of business process by selecting between features of the model and conventional modeling features. The scheduling programming language can be represented as a graphical user interface program that is convertible to a schedule language written in a programmable language. The present invention provides for explicitly representing parallelism within the business workflow process by separating interdependent transactions from independent transactions. The isolation of certain transactions are relaxed, such that users can define transactional boundaries in order to increase granularity of the transaction at an action level and provide visibility of transactions at intermediate steps.

Abstract: A methodology of employing a binding for interfacing a business workflow process executable program to a real world implementation. The binding can be reduced to a programming language. A preferable programming language is XML (Extensible Markup Language). Separation of the business workflow processes and the binding allow for the same business workflow process to be implemented across a variety of different technologies. The binding maps ports and messages to corresponding units of codes and invocations of a particular technology being utilized for the modeling of the business workflow process. The binding provides a user with the ability to structure schedule messages, define the relationship of schedule ports to units of code, define the relationship of schedule actions to invocations, control the flow of data between messages, provide details of schedule conditionals and specify the interaction of the schedule with specific technology behaviors.

Abstract: A methodology of reducing process algebra to a language that facilitates modeling a business workflow process is provided. A process algebra is reduced to a model for business workflow processes. The model is then reduced to a scheduling programming language to allow users to create models of business process by selecting between features of the model and conventional modeling features. The scheduling programming language can be represented as a graphical user interface program that is convertible to a schedule language written in a programmable language. The present invention provides for explicitly representing parallelism within the business workflow process by separating interdependent transactions from independent transactions. The isolation of certain transactions are relaxed, such that users can define transactional boundaries in order to increase granularity of the transaction at an action level and provide visibility of transactions at intermediate steps.

Abstract: A server adapted to provide client functionality may include an offsite centralized data center and a local client functionality component that may be stored in the offsite centralized data center. The offsite centralized data center may remotely host the local client functionality component such that information stored in the local client functionality component appears local to a client. The server may further include a client interface that receives local client information from the client. The local client information may be replicated by the client before being received by the client interface and remotely hosted by the offsite centralized data center.

Abstract: A method for controlling a message distribution process comprising a series of coordinated processes by monitoring the performance of each process, determining that a monitored process is not processing properly, and skipping the process not processing properly. Another method for controlling the load of message traffic by determining the performance of a message server and altering the flow of messages based upon the determined performance of the message server. Another method for routing messages by identifying the addresses of senders of received messages, assigning a portion of the addresses to a category, and routing messages from the identified addresses according to their assigned category.

Abstract: An error-handling framework is provided for business process transactions. The error-handling framework facilitates coordination of the invocation of exception and compensation handlers in response to errors. The error-handling framework includes support for custom ordering of compensation actions, data flow into and out of compensation actions, and management of the process state visible to compensation actions.

Abstract: Systems and methods for orchestrating synchronizations between different targets in a synchronization community. The order and nature of synchronizations may depend on multiple factors, including the initiator of the synchronization, the data being synchronized, and other characteristics of the synchronization participants and synchronization community.

Abstract: A graphical user interface (GUI) scheduler program is provided for modeling business workflow processes. The GUI scheduler program includes tools to allow a user to create a schedule for business workflow processes based on a set of rules defined by the GUI scheduler program. The rules facilitate deadlock not occurring within the schedule. The program provides tools for creating and defining message flows between entities. Additionally, the program provides tools that allow a user to define a binding between the schedule and components, such as COM components, script components, message queues and other workflow schedules. The scheduler program allows a user to define actions and group actions into transactions using simple GUI scheduling tools. The schedule can then be converted to executable code in a variety of forms such as XML, C, C+ and C++. The executable code can then be converted or interpreted for running the schedule.

Abstract: A business relationship is effectuated between a first party and a second party and is governed by an agreement between the first party and the second party. The first party creates a token that authorizes a delegate to request a transaction according to the agreement on behalf of the first party, specifies in the token at least one constraint on a transaction requested by the delegate on behalf of the first party, and provides the token to the delegate. The delegate sends to the second party the token and a transaction document requesting a transaction according to the agreement. The second party applies each constraint in the token against the transaction document to determine whether the transaction document satisfies each constraint. If so, the transaction document is accepted for fulfillment.

Abstract: The present invention extends to transforming business models. A business model representing a business layer of a business architecture is accessed. An indication that the business model is to be transformed is received. Transformations can include transforming the level of detail in a business model of transforming a business model representing one business layer into a business model representing another different business layer. Transform relationships that designate how business models are to be transformed are accessed. Business models are transformed in accordance with the transform relationships and transformed models are created. Accordingly, users are provided business context for completing tasks more efficiently without being overwhelmed by unneeded business details and without lacking all the relevant business details.

Abstract: The present invention extends to associating and visualizing schematized business networks. Users can visualize and navigate a business network without having got understand or create associations between structures of different business layers. Users can configure the level of detail by zooming in and zooming out of relevant portions of the business network such that the appropriate amount of detail for a given task is provided. Accordingly, users are provided business context for completing tasks more efficiently without being overwhelmed by unneeded business details and without lacking all the relevant business details.

Abstract: The present invention extends to comparing and contrasting models of business. Model processing modules implement formal operators that can be used to manipulate models of business. A compare operator can be used to compare similarly typed models of business. A contrast operator can be used to contrast differ types of business models. A constraint operator can be used to check business models for compliance with constraints. A refinement operator can be used to refine business models based on industry (or otherwise more) specific data. A compose operator can be used to compose new business models from portions of other business models.

Abstract: The present invention extends to comparing and contrasting models of business. Model processing modules implement formal operators that can be used to manipulate models of business. A compare operator can be used to compare similarly typed models of business. A contrast operator can be used to contrast differ types of business models. A constraint operator can be used to check business models for compliance with constraints. A refinement operator can be used to refine business models based on industry (or otherwise more) specific data. A compose operator can be used to compose new business models from portions of other business models.

Abstract: Various technologies and techniques are disclosed that improve synchronization of data between varying types of devices and/or services. A full participant receives a request from another participant to perform a synchronization operation. The synchronization engine determines whether the device or service is a full, partial, or simple participant. The device or service is a simple participant if it has a data store for synchronized data and no knowledge store. The device or service is a partial participant if it has a data store for synchronized data and a knowledge store, but does not understand the knowledge. The device or service is a full participant type if it has a data store for synchronized data and a knowledge store and understands the knowledge. The synchronization engine performs the synchronization operation with the device or service using a set of logic that is appropriate for the type of device or service.

Abstract: The present invention extends to efficient and flexible business modeling based upon structured business capabilities. A computer system receives a plurality of business modeling attributes representing different layers of a business. The computer system extracts business capability attributes from among the received plurality of business modeling attributes. The computer system accessing a structured data model that defines data formats for the extracted business capability attributes. The computer system formats the extracted business capability attributes in accordance with the data formats defined in the structured data model. The computer system models a business capability based upon the formatted business capability attributes. A structured data model can include a capability modeling schema having data format definitions that define how business capability attributes are to be represented.