Abstract: Techniques for a mixed audio conference are described. An apparatus may comprise an audio video multipoint control unit to mix call information from multiple call connections established over a packet-switched network for a conference call. The apparatus may comprise a telephony gateway communicatively coupled to the audio video multipoint control unit. The telephony gateway may establish a bridge connection with a conference bridge servicing a call connection over a circuit-switched network, the telephony gateway to translate call information from the call connection for use by the audio video multipoint control unit. Other embodiments are described and claimed.

Abstract: Techniques for a mixed audio conference are described. An apparatus may comprise an audio video multipoint control unit to mix call information from multiple call connections established over a packet-switched network for a conference call. The apparatus may comprise a telephony gateway communicatively coupled to the audio video multipoint control unit. The telephony gateway may establish a bridge connection with a conference bridge servicing a call connection over a circuit-switched network, the telephony gateway to translate call information from the call connection for use by the audio video multipoint control unit. Other embodiments are described and claimed.

Abstract: Techniques for a mixed audio conference are described. An apparatus may comprise an audio video multipoint control unit to mix call information from multiple call connections established over a packet-switched network for a conference call. The apparatus may comprise a telephony gateway communicatively coupled to the audio video multipoint control unit. The telephony gateway may establish a bridge connection with a conference bridge servicing a call connection over a circuit-switched network, the telephony gateway to translate call information from the call connection for use by the audio video multipoint control unit. Other embodiments are described and claimed.

Abstract: A geocoding architecture that generates and associates one or more tile documents with geocoded tiles. When connected entities are defined, the connected entity attributes are collected in a single tile document so that tile-document terms are attributes of all connected entities. These terms later serve as keys that enable search for tiles relevant for a given query. Entity documents are created that are an aggregation of entity attributes. Like the entity document, the tile document serves as an aggregator for all the geospatial entities within a pre-determined surface area. Search is then performed on the content of tile and entity documents.

Abstract: A platform for manipulating data associated with defining, deploying, and administering distributed server systems utilizes a structured data model with a flexible replication mechanism, a set of schemas, and an object model to manipulate system topology, configuration (settings), and policies. A scoping mechanism for characteristics of the settings, policies, and resolution is provided in addition to the data model along with an authorization mechanism for single and multi-tenant environments.

Abstract: An XLANG/s compiler detects convoy scenarios during compilation and generates runtime directives to correctly correlate incoming messages with business process instances. A convoy scenario, present in event driven processes, is defined by a correlation set initialized during a receive operation which is provided to a subsequent receive operation. The compiler detects those convoy scenarios by analyzing the control and dataflow of a XLANG/s program. Three convoy patterns are distinguished: (1) activation convoys, (2) uniform sequential convoys, and (3) non-uniform sequential convoys. XLANG/s allows declarative descriptions of convoy scenarios without requiring an understanding of the low-level details supporting their correct execution. Convoy scenarios are processed by statically analyzing a written workflow application to deduce the nature and type of convoy scenarios used by the application. Information is extracted at compile time to support the runtime infrastructure.

Abstract: A system and method of processing a message in an asynchronous architecture is provided. In the method, a determination is made that a response to a message sent by an instance of software code is to be received, where the response indicates whether the message succeeded or failed. Another determination is made as to whether the response has been received. If the response has not been received, the instance of the software code is stored in memory, thereby suspending the instance. The response is received, the instance resumed and the response is processed.

Abstract: Techniques for throttling of rogue entities to push notification servers are described. An apparatus may comprise a processor and a memory communicatively coupled to the processor. The memory may store an application, the application maintaining a monitored domain table, the application maintaining an offending domain table, the application operative to receive an incoming request from a client in a domain, to detect harmful activity based on the request, and to respond to the harmful activity based on one or both of the monitored domain table and the offending domain table. Other embodiments are described and claimed.

Abstract: A XLANG/s compilation method is provided that uses data flow analysis of a program's flow graph to determine lifetimes of a data object. A flowgraph is created according to abstract computer instructions. A depth-first order is assigned to basic blocks and a dominance relationship between the basic blocks is determined. A determination is made as to whether any loops are present within the flowgraph and, if so, the loops are identified. A creation point, destruction point and lock point for the data object is determined. Instructions are inserted into the computer code to create the at least one data object at the creation point, to destroy the data object at the destruction point and to lock the data object at the lock point.

Abstract: A platform for manipulating data associated with defining, deploying, and administering distributed server systems utilizes a structured data model with a flexible replication mechanism, a set of schemas, and an object model to manipulate system topology, configuration (settings), and policies. A scoping mechanism for characteristics of the settings, policies, and resolution is provided in addition to the data model along with an authorization mechanism for single and multi-tenant environments.

Abstract: Large messages in the form of hierarchically structured documents are processed in a streaming fashion using the ultimate consumer read requests as the driving force for the processing. The messages are partitioned into fixed length segments. The segments are processed in pipeline fashion. This processing chain includes simulating random access of hierarchical documents using stream transformations, mapping streams to a transport's native capabilities, composing streams into chains and using pipeline processing on the chains, staging fragments into a database and routing messages when complete messages have been formed, and providing tools to allow the end user to inspect partial messages.

Abstract: A method for executing a schedule in a workflow application is provided. The method includes selectively storing a schedule state to a storage medium based on a latency attribute associated with the schedule. Also provided is a method of executing a workflow application comprising long running transactions. This method includes selectively storing a schedule state to a storage medium based on a latency attribute associated with the schedule, and selectively compensating certain actions within the schedule according to a compensation parameter associated with an action, based on failure or abortion of another action within the schedule. In addition, there is provided a method of executing a schedule comprising selectively compensating certain actions or transactions within the schedule according to a compensation parameter associated with an action or transaction, based on failure or abortion of another action or transaction within the schedule.

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: Techniques for a mixed audio conference are described. An apparatus may comprise an audio video multipoint control unit to mix call information from multiple call connections established over a packet-switched network for a conference call. The apparatus may comprise a telephony gateway communicatively coupled to the audio video multipoint control unit. The telephony gateway may establish a bridge connection with a conference bridge servicing a call connection over a circuit-switched network, the telephony gateway to translate call information from the call connection for use by the audio video multipoint control unit. Other embodiments are described and claimed.

Abstract: An XLANG/s compiler detects convoy scenarios during compilation and generates runtime directives to correctly correlate incoming messages with business process instances. A convoy scenario, present in event driven processes, is defined by a correlation set initialized during a receive operation which is provided to a subsequent receive operation. The compiler detects those convoy scenarios by analyzing the control and dataflow of a XLANG/s program. Three convoy patterns are distinguished: (1) activation convoys, (2) uniform sequential convoys, and (3) non-uniform sequential convoys. XLANG/s allows declarative descriptions of convoy scenarios without requiring an understanding of the low-level details supporting their correct execution. Convoy scenarios are processed by statically analyzing a written workflow application to deduce the nature and type of convoy scenarios used by the application. Information is extracted at compile time to support the runtime infrastructure.

Abstract: An XLANG/s compiler detects convoy scenarios during compilation and generates runtime directives to correctly correlate incoming messages with business process instances. A convoy scenario, present in event driven processes, is defined by a correlation set initialized during a receive operation which is provided to a subsequent receive operation. The compiler detects those convoy scenarios by analyzing the control and dataflow of a XLANG/s program. Three convoy patterns are distinguished: (1) activation convoys, (2) uniform sequential convoys, and (3) non-uniform sequential convoys. XLANG/s allows declarative descriptions of convoy scenarios without requiring an understanding of the low-level details supporting their correct execution. Convoy scenarios are processed by statically analyzing a written workflow application to deduce the nature and type of convoy scenarios used by the application. Information is extracted at compile time to support the runtime infrastructure.

Abstract: A XLANG/s compiler recognizes a statement in XLANG/s code to make an assumption as to the success or failure of a specified transaction. The assignment states of variables are tracked and changes to such states are recorded. While processing XLANG/s code, the compiler determines whether the assignment state of a particular correlation, operation or the like is correct for the transaction being performed. If not, the compiler may generate an error message. Moreover, by using declarative assumptions such as if(succeeded(T)) or if(!succeeded(T)), definite-assignment analysis of shared state variables may cross transactional boundaries.

Abstract: A XLANG/s compilation method is provided that uses data flow analysis of a program's flow graph to determine lifetimes of a data object. A flowgraph is created according to abstract computer instructions. A depth-first order is assigned to basic blocks and a dominance relationship between the basic blocks is determined. A determination is made as to whether any loops are present within the flowgraph and, if so, the loops are identified. A creation point, destruction point and lock point for the data object is determined. Instructions are inserted into the computer code to create the at least one data object at the creation point, to destroy the data object at the destruction point and to lock the data object at the lock point.

Abstract: A XLANG/s compilation method is provided that uses data flow analysis of a program's flow graph to determine lifetimes of a data object. A flowgraph is created according to abstract computer instructions. A depth-first order is assigned to basic blocks and a dominance relationship between the basic blocks is determined. A determination is made as to whether any loops are present within the flowgraph and, if so, the loops are identified. A creation point, destruction point and lock point for the data object is determined. Instructions are inserted into the computer code to create the at least one data object at the creation point, to destroy the data object at the destruction point and to lock the data object at the lock point.

Abstract: Large messages in the form of hierarchically structured documents are processed in a streaming fashion using the ultimate consumer read requests as the driving force for the processing. The messages are partitioned into fixed length segments. The segments are processed in pipeline fashion. This processing chain includes simulating random access of hierarchical documents using stream transformations, mapping streams to a transport's native capabilities, composing streams into chains and using pipeline processing on the chains, staging fragments into a database and routing messages when complete messages have been formed, and providing tools to allow the end user to inspect partial messages.