Abstract: A service computing device is provided for efficiently authenticating, verifying, and distributing subtasks or microtasks in a peer-to-peer network or distributed network. Also provided are computing devices with varying capabilities with respect to the performance of such tasks, such that enhancing efficiency in the authentication, verification, and/or distribution may enhance device efficiency and/or overall network efficiency. Processors or processor elements many be configured with differing capabilities to perform various types of the subtasks or microtasks such that proper distribution of such subtasks and microtasks may be required for completion of a complex task with enhanced efficiency. Probabilistic authentication or classification-based verification may be employed by the service computing device in performing its functions.

Abstract: Multiple digital assistants are employed to process requests within a computing environment. An initial request (e.g., voice command) may be received by a first DA. If it is determined that the first DA can handle the request based on one or more terms of the request, a communications session between a user and the first DA is established to handle the request. If it is determined that the first DA is incapable of handling the request, a second DA configured to handle the request is determined.

Abstract: A method and apparatus for engaging, on behalf of a client computing device, one or more remote computing devices to perform a client directed task for a fee. The method comprising the steps of: receiving, from a client computing device, data indicative of a task to be performed; reviewing capabilities of the remote computing devices; selecting one or more suitable remote computing devices for performing at least a first subtask; negotiating, and reaching agreement, with selected remote computing devices on terms for performing the first subtask; verifying receipt of payment from a client, being associated with the client computing device; dispatching the first subtask; receiving a first result, from respective remote computing device; and providing payment to a remote provider, being associated with the remote computer device.

Abstract: Multiple digital assistants are employed to process requests within a computing environment. An initial request (e.g., voice command) may be received by a first DA. If it is determined that the first DA can handle the request based on one or more terms of the request, a communications session between a user and the first DA is established to handle the request. If it is determined that the first DA is incapable of handling the request, a second DA configured to handle the request is determined.

Abstract: An apparatus includes a frame having an inner cavity, and a first substrate disposed at a backing panel of the inner cavity of the frame. The first substrate includes an array of light generating sources. The apparatus further includes a second substrate overlaying the first substrate. The second substrate is translucent, and the second substrate is a material to which a tiling adhesive adheres.

Abstract: Techniques are described for cooperative delegation of request processing by digital assistants (DAs) in a computing environment. An initial request (e.g., voice command) may be received by a first DA, and a communication session may be initiated during which the first DA handles the initial request and/or subsequent requests. On receiving a request that it is unable to handle, the first DA may transfer control of the session to a second DA. The second DA may handle the request and/or subsequent requests before passing control of the session back to the first DA or to another appropriate DA. Each handling DA may provide output (e.g., voice output or otherwise) associated with their handling of the various requests during the session. In some instances, transfer of control among DAs may be mediated by a broker based on information describing the different capabilities of various DAs.

Abstract: A turbine blade has a body enclosing a labyrinth of internal channels for circulation of coolant received through an inlet integrally formed in terminal portion of blade root. The labyrinth includes; inlet arranged on an axially upstream face of terminal portion leading to an upstream duct portion having first section adjacent the inlet and a second section axially downstream of first, second section having reduced cross section compared to first section. Leading edge passage intersects first section and extends through blade body towards the tip. Main blade passage intersects second section. Trailing edge passage intersects downstream duct portion which is in axial alignment with but separate from second section and channel connects second section with the downstream duct portion. Channel has reduced cross section compared to second section and downstream duct portion. The inlet has an inverted keyhole shape with cross section extends through upstream duct portion first section.

Abstract: An apparatus includes a frame having an inner cavity, and a first substrate disposed at a backing panel of the inner cavity of the frame. The first substrate includes an array of light generating sources. The apparatus further includes a second substrate overlaying the first substrate. The second substrate is translucent, and the second substrate is a material to which a tiling adhesive adheres.

Abstract: A method and apparatus for engaging, on behalf of a client computing device, one or more remote computing devices to perform a client directed task for a fee. The method comprising the steps of: receiving, from a client computing device, data indicative of a task to be performed; reviewing capabilities of the remote computing devices; selecting one or more suitable remote computing devices for performing at least a first subtask; negotiating, and reaching agreement, with selected remote computing devices on terms for performing the first subtask; verifying receipt of payment from a client, being associated with the client computing device; dispatching the first subtask; receiving a first result, from respective remote computing device; and providing payment to a remote provider, being associated with the remote computer device.

Abstract: The states associated with a programmable state machine are reordered to compress the storage of transitions which define the state machine. To reorder the states, a score is computed and assigned to each of the states. Next, the states are sorted according to their computed scores. In some embodiments, to compute the score for each current state based on the received input symbol, the number of times that the input symbol causes transition to similar states is added. The sum of the scores in each row of the table is representative of the score for the associated current state associated with that row. The states are sorted according to their score and a new state transition table is generated in accordance with the reordered states.

Abstract: A multicore network security system includes scheduler modules, one or more security modules and post-processing modules. Each security module may be a processing core or itself a network security system. A scheduler module routes input data to the security modules, which perform network security functions, then routes processed data to one or more post-processing modules. The post-processing modules post-process this processed data and route it back to scheduler modules. If further processing is required, the processed data is routed to the security modules; otherwise the processed data is output from the scheduler modules. Each processing core may operate independently from other processing cores, enabling parallel and simultaneous execution of network security functions.

Abstract: A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.

Abstract: A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.

Abstract: A programmable finite state machine (FSM) includes, in part, a first address calculation logic block, a first lookup table, a second address calculation logic block, and a second lookup table. The first address calculation logic block generates an address for the first lookup table based on the received input symbol and the current state. The data stored in first look-up table at the generated address is used by the second address calculation logic block to compute an address for the second lookup table. Data stored in the second lookup table is the next state to which the FSM transitions. The programmable FSMs uses redundant information of the transition table to compress these transitions and thus requires a smaller memory while maintaining a high data throughput. The data in the first and second lookup tables are coded and supplied by a compiler. The FSM operation may optionally be pipelined.

Abstract: A programmable finite state machine (FSM) includes, in part, first and second memories, and a selection circuit coupled to each of the memories. Upon receiving a (k+m)-bit word representative of the k-bit input symbol and the m-bit current state, the first memory supplies one ore more matching transition rules stored therein. The selection circuit selects the most specific of the supplied rules. The transition rules are stored in the first memory in a ranking order of generality. The second memory receives the selected transition rule and supplies the next state of the FSM. The first memory may be a ternary content addressable memory and the second memory may be a static random access memory. The contents of both the content addressable memory and the static random memory is determined by an algorithm which minimizes the number of terms required to represent the next-state transition functions.

Abstract: An embedded real-time operating system model which uses flight software to verify commands, fault annunciations, and telemetry acquisition is provided. The system includes or provides an avionics emulator, emulation of craft avionics and other components, complying command data or mission simulation software, and a portable computer for the cargo PC in a system to allow analysis of a payload and its interaction without access to actual flight computers of the craft.

Abstract: The invention provides isolated nucleic acid compounds encoding a multiple drug resistance protein of Aspergillus fumigatus. Vectors and transformed host cells comprising the multiple drug resistance-encoding DNA of Aspergillus fumigatus AfuMDR1 are also provided. The invention further provides assays which utilize these transformed host cells.