doc_id
stringlengths 7
11
| appl_id
stringlengths 8
8
| flag_patent
int64 0
1
| claim_one
stringlengths 12
21.5k
|
|---|---|---|---|
20100109676 | 12594967 | 0 | 1. A method of testing an analog circuit, the method comprising selecting an initial set of test input vectors for the analog circuit under control of a test selection computer; selecting a set of faults comprising faults that each correspond to a respective node in the analog circuit and corresponding fault voltage value for that node under control of the test selection computer; computing, under control of the test selection computer, a measure of overlap between probability distributions of test output signal values for the analog circuit in response to the test input vectors in the presence and absence of each of the faults from said set of faults respectively, as a function of estimated statistical spread of component and/or process parameter values in the analog circuit; selecting test input vectors from the initial set of test input vectors for use in testing on the basis of whether the measure of overlap for at least one if the faults is below a threshold value in response to the selected test input vector under control of the test selection computer. |
20050267905 | 11196157 | 0 | 1. A computer-readable medium having stored thereon a first number J of data structures, the first number J corresponding to a division of a fixed word length W required by a language by a selected base B, each data structure having a second number of data fields K, the second number K corresponding to a third number L of different characters in the language raised to the power of the selected base B, each data field containing a bitmap of length N, where N is equal to a fourth number of regular expressions. |
7676478 | 11497782 | 1 | 1. A data warehousing method, comprising: executing software instructions on a computer system to store a plurality of transformation templates in a plurality of transformation libraries, each transformation template including metadata objects that describe how to transform extracted source data prior to loading the source data into a data warehouse within a data warehousing system; executing software instructions on the computer system to create a unique link that corresponds to a particular transformation template, wherein the link is unique to a particular data warehousing system housing one or more transformation libraries within one or more data warehouses; executing software instructions on the computer system to associate the unique link with the particular transformation template, such that the particular transformation template is identified by the unique link in each transformation library in the plurality of transformation libraries within a particular data warehouse; executing software instructions on the computer system to instantiate an instance of the particular transformation template into a data transformation process using the unique link associated with the particular transformation template, wherein the metadata objects of the particular transformation template are mapped into an instance of a transform using executable code segments; and executing software instructions on the computer system to execute the data transformation process to transform and load the extracted source data into the particular data warehouse using the particular transformation template. |
9134958 | 13657458 | 1 | 1. A method, comprising: obtaining a binary input vector; generating, by a binary/binary coded decimal (BCD) hardware converter, a plurality of BCD vectors based on the binary input vector by: partitioning the binary input vector into at least an initial segment and a final segment; generating an initial BCD vector from the initial segment of the binary input vector; and generating a plurality of final BCD vectors from the final segment of the binary input vector, wherein the plurality of BCD vectors comprises the initial BCD vector and the plurality of final BCD vectors; and calculating a BCD output vector based on the plurality of BCD vectors. |
7685155 | 10806526 | 1 | 1. A method implemented by a computing system having a processor coupled to a memory for generating an object schema used in mapping between a relational database and objects from an object oriented programming language comprising: receiving program code that describes one or more classes which define objects, wherein the objects are components from an object oriented programming language comprising data structures and functions operable on data; describing members of each class, wherein the members of each class comprise compound members, wherein the compound members comprise a second member and at least one of a plurality of attributes describing the members of each class, and wherein the compound members allow mapping of complex members as inline members of a given class, which allows inline mapping of arrays, structs and entity key members; specifying relationships between the one or more classes; receiving input from a developer through an interface component; generating an object schema using the input received from the interface component to be employed to facilitate mapping the objects described in the received program code to tables in a relational database, wherein data in the relational database describes the objects and the data in the relational database persists, the object schema comprising: a first data structure comprising a plurality of attributes describing the one or more classes which define the objects, the plurality of attributes describing the one or more classes comprising at least a persistence service class attribute designating a persistence service to use when persisting a particular class associated with the persistence service class attribute; a second data structure comprising the plurality of attributes describing the members of each class, the plurality of attributes describing the members of each class comprising at least a hidden attribute that defines if there is a hidden member in a corresponding class and manages the hidden member in a transparent fashion, a key generator attribute designating a user class that is to act as a custom key generator, and a key generator parameter attribute designating parameters to be passed to the custom key generator; a third data structure comprising a plurality of attributes describing the relationships between the one or more classes, the plurality of attributes describing the relationships between the one or more classes comprising at least a relationship name attribute identifying a unique name for a relationship, and a relationship type attribute identifying a type of predefined relationship; and wherein at least one of the members described in the second data structure contains an alias attribute to query a private member, the alias attribute pointing to a public member that is to be utilized in place of the associated private member in text of a query; providing a relational schema that provides details regarding the relational database and utilizes metadata associated with the database to generate an implementation neutral or an implementation specific format that represents the database structure; and providing a mapping schema that provides a mapping between the object schema and the relational schema. |
20020152006 | 09835323 | 0 | 1. A membrane for conducting an overall function of at least one of a sorting function, a filtering function and an absorbing function of at least one object having an attribute, comprising: a plurality of module units disposed adjacent each other; each module unit of the plurality of module units obtains information of an environment around the module unit; at least a portion of the plurality of module units each perform at least one function based on at least a first control method; and the first control method determines the function based on the information for each of the plurality of module units, wherein the at least a portion of the plurality of module units perform the at least one function to collectively perform the overall function of the membrane based on the attribute of the object. |
8731874 | 13057302 | 1 | 1. A three-dimensional CAD model creating apparatus comprising: a processor executing program modules for: creating, by a table creating program module, tabular data that describes change logic for each changed state, the change logic associating a changed state with a logic condition to be satisfied to shift to the changed state, the change logic including a conditional branch, the changed state being a shape and a structure of the three-dimensional CAD model after transformation of the three-dimensional CAD model; converting, by a data converting program module, each change logic set in the created tabular data into a description in a certain program language, and creating a model built-in program that includes each description in the certain program language; registering, by a model built-in program IO program module, the created model built-in program to the three-dimensional CAD model; and transforming, by a three-dimensional CAD software program module, the three-dimensional CAD model when receiving an operation for transforming the three-dimensional CAD model, based on the operation and change logic described in the registered model built-in program; and a memory for storing the model built-in program. |
8719819 | 11173326 | 1 | 1. A method comprising: managing, without direct intervention from an operating system (OS), a first user-level thread on a target instruction sequencer in response to executing a user-level monitoring instruction or a control transfer instruction on a source instruction sequencer of a processor, wherein the source instruction sequencer is under control of an application level program; and running a first user-level thread that contains one or more user-level instructions on the source instruction sequencer, wherein a user level control transfer instruction has: 1) a first field that makes reference to one or more instruction sequencers, 2) a second field for a scenario selected from a group of a first scenario to cause a sequencer whose identification is referenced in the first field to cause a set of sequencer-specific architectural states to be respectively initialized to a set of initial values, a second scenario to cause a thread executing on a sequencer whose identification is referenced in the first field to fork execution, and a third scenario to cause a sequencer whose identification is referenced in the first field to operate in a proxy execution mode, 3) a third field for a conditional parameter to condition execution of instructions that execute on a sequencer that executes a control transfer instruction, 4) a fourth field that defines a routing function to control whether a signal generated as a result of executing the user level control transfer instruction is sent as a broadcast, unicast, or multicast signal, 5) a fifth field for a scenario specific payload; and a user-level monitoring instruction includes: 1) a field that specifies an instruction sequencer, 2) a control message identifying a condition or anticipated event, and 3) a location of handler-code associated with the control message to perform a user-level thread operation. |
8959119 | 13595356 | 1 | 1. A database computer system comprising a context-based graph-relational intersect derived (CB-GRID) database, wherein the CB-GRID database associates a real entity graph node to a synthetic entity graph node, and wherein the CB-GRID database in the database computer system comprises: one or more processors, wherein said one or more processors implement the CB-GRID database; a real entity graph node, wherein the real entity graph node identifies a real entity, and wherein the real entity graph node comprises a pointer to a primary key in a first tuple that non-contextually describes the real entity; a primary relational database, wherein the primary relational database comprises the first tuple that non-contextually describes the real entity, and wherein the first tuple contains the primary key; a context relational database, wherein the context relational database comprises a second tuple that contains a foreign key that matches the primary key in the primary relational database, and wherein the second tuple dynamically describes a context of data in the first tuple; a contextual entity relational database, wherein the contextual entity relational database comprises a third tuple that contains data from the first tuple and the second tuple, and wherein the third tuple comprises a contextual tuple key; a synthetic entity graph node, wherein the synthetic entity graph node is linked to the contextual entity relational database by the contextual tuple key, wherein the synthetic entity graph node describes a synthetic entity that is described by data in the contextual entity relational database, and wherein the contextual entity relational database links the real entity graph node to the synthetic entity graph node, wherein the real entity is a physical machine, wherein the synthetic entity graph node describes a software-modeled machine that is operating outside of nominal parameters, and wherein the CB-GRID database in the database computer system further comprises: output data from a sensor on the physical machine stored in the first tuple; model type data describing a model type of the physical machine stored in the second tuple; and software-modeled machine descriptor data stored in the third tuple, wherein the contextual entity relational database links the physical machine to the software-modeled machine that is operating outside of the nominal parameters. |
6135646 | 08808050 | 1 | 1. A system for organizing digital information in a network that includes computational facilities comprising: digital objects, each of the digital objects comprising one or more sequences of structured data or sets of such sequences, each of the sequences or sets of sequences incorporating a work or a portion of a work or other digital information in which a party has rights or interests, or in which there is value, each of the sequences or sets of sequences being structured in a way that is interpretable by one or more of the computational facilities in the network, each of the digital objects including an identifier that uniquely identifies the digital object within the network and persists, with respect to the digital object, over a period of time that is at least as long as the existence of the digital object, an administrative mechanism that (a) is distributed among the computational facilities, (b) assures the uniqueness and persistence of the identifiers over a time period that is at least as long as the existence of the digital objects, and (c) distributes state information that includes the identifiers among computational facilities by an algorithmic process for managing the uniqueness and persistence of the identifiers, at least some of the digital objects including other structured data which is useful in processing the digital objects, including managing access to them, and a resolution mechanism that accepts unique identifiers as input and resolves each of the identifiers to state information that denotes a computational facility or other digital object that contains the digital object associated with the unique identifier. |
8116566 | 11846486 | 1 | 1. A method comprising: mapping, using a processor, each data set of a collection of data sets of labeled patterns to a point on a parameter space, the parameter space being one of a Grassman manifold, a Stiefel manifold, a Flag manifold, and a product of manifolds, each labeled pattern having a variation of state distinguishing the labeled pattern from other labeled patterns in the data set; mapping a data set of unlabeled patterns to a point on the parameter space, each unlabeled pattern having a variation of state distinguishing the unlabeled pattern from other unlabeled patterns in the data set; if a distance, computed on the parameter space, between the point mapped from the data set of unlabeled patterns and one of the points mapped from the data set of labeled patterns satisfies a distance criterion evaluated on the parameter space, attributing the label of the data set of the labeled pattern mapped to the point satisfying the distance criterion to the data set of unlabeled patterns. |
8782056 | 13470112 | 1 | 1. A method of facilitating information searching for a user of an electronic device, comprising: playing currently accessed multimedia data; placing metadata for the currently accessed multimedia data in a program wide memory window, wherein the metadata is received via a stream; keeping a set of most recently received pieces of metadata from the stream in a most recent memory window distinct from the program wide memory window; extracting keywords from the pieces of metadata stored in the program wide memory window and the most recent memory window; weighting the extracted keywords, wherein keywords contained both in the most recent memory window and the program wide memory window are given greater weight than keywords contained only in the program wide memory window; presenting the weighted extracted keywords to the user for selection, wherein keywords with greater weight are displayed more prominently than those keywords having lesser weight; receiving a selection of one or more keywords from the presented weighted extracted keywords; performing a search using a search query that is based on the selected one or more keywords; and causing search results from the search to be displayed to the user. |
20120254858 | 13432784 | 0 | 1. A method, comprising by a virtual area creation service: receiving information for creating a virtual area from a network service; providing an installation package for installing a virtual area based realtime communications client application; and sending information describing properties of the virtual area including a property value associating the network service with the virtual area to the virtual area based realtime communications client application installed on a client network node. |
9124497 | 12324572 | 1 | 1. A method comprising: maintaining, in a provisioning server, a plurality of network modules, wherein each network module in the plurality of modules is associated with a different type of name server and comprises instructions to generate a configuration file for the associated type of name server; identifying, by the provisioning server, an alteration to a connection of a plurality of network connections to a computer system coupled to the connection; identifying a network module from the plurality of network modules in view of a type of a name server in the connection affected by the alteration; and altering, by the provisioning server, a configuration file of each of a plurality of name servers utilizing the identified network module, wherein the identified network module comprises instructions to alter the corresponding configuration files of each of the plurality of name servers. |
8898145 | 13160982 | 1 | 1. A method for optimizing a query for execution against one or more relational databases, the method comprising: receiving a query submitted by a user, the query including a measure expression and a dimensional context within which the measure expression is to be evaluated; generating a first representation of the query, wherein the first representation of the query comprises a table sub-tree associated with the dimensional context and a scalar sub-tree associated with the measure expression; generating a second representation of the query based on the first representation of the query, the generating of the second representation of the query comprising: transforming the scalar sub-tree into at least a sparse logical operator, and creating an inner join logical operator that performs an inner join between at least a table returned by the sparse logical operator and a table returned by or derived from a table returned by a logical operator built from the table sub-tree; and providing the second representation of the query for application against the one or more relational databases; at least one of the receiving, generating and providing steps being performed by one or more processors. |
20080016313 | 11855633 | 0 | 1. A method for operating a multi processor system with shared memory and at least one hardware memory management unit, comprising the steps of: booting a first memory partitioning kernel in one processor; seizing control of said at least one hardware memory management unit by said memory partitioning kernel; partitioning available memory so as to allocate and isolate a specific region of memory for each respective processor; booting processes in said processors; and limiting memory access by each said processor to its respective said specific region of memory. |
8244278 | 13093277 | 1 | 1. A method, comprising: receiving a description of a route of interest to a user; in response to receiving the description, generating a prospective route based on the description; providing a graphical element corresponding to the prospective route to the user; and scheduling a traversal of the prospective route for a fitness activity in a user training database. |
20110078379 | 12959775 | 0 | 1. A storage control unit that, upon receipt of a write access request from an external unit, performs control of writing of data that is the subject of the write access request to a storage unit including a plurality of storage devices, the storage control unit comprising: a power supply unit that supplies power from a power source; a battery that stores power so that power can be supplied; a cache memory constituted by a volatile memory capable of storing data when supplied with power; a non-volatile memory capable of continuing to store data even without power supplied thereto, saving dirty data stored in said cache memory when failure of the power supply unit is detected; a request reception unit that receives the write access request when supplied with said power; a first data control unit that controls to store data that is the subject of said write access request in said cache memory as cache data; a determination unit that determines whether or not an amount of dirty data, of said cache data in said cache memory, that has not been reflected to said storage unit, exceeds a prescribed threshold value; a second data control unit that, if the determination is that said prescribed threshold value has been exceeded, controls to store at least a portion of said dirty data of said cache memory in said storage unit; a power source monitoring unit that detects a voltage abnormality of the power that is supplied from said power supply unit; a shared memory that stores configuration information and control information; a save storage unit that saves in said non-volatile memory the dirty data stored in said cache memory on receipt of supply of said power from said battery, if said voltage abnormality is detected by said power source monitoring unit, wherein when the save storage unit saves in said non-volatile memory the dirty data stored in said cache memory, the configuration information and the control information corresponding to the saved dirty data is also saved; and a power source supply control unit that maintains supply of power to said cache memory and said save storage unit using the power from said battery if said voltage abnormality is detected by said power source monitoring unit. |
20070226535 | 11639855 | 0 | 1. A system for maintaining metadata in an electronic storage network comprising: a plurality of networks having a storage operation capability and which include client applications, wherein at least one of the plurality of networks includes a storage management component and wherein the plurality of networks are electronically linked to each other; and a storage device associated with the storage manager for maintaining the metadata, wherein the plurality of networks and client applications generate metadata relating to the client applications and system operation, the storage management component collecting the metadata from the plurality of storage operation cells and storing the data on the storage device. |
8402532 | 11801714 | 1 | 1. A method for providing host control of partial trust accessibility comprising the steps of: providing a framework that allows one or more libraries to be identified as partial trust callers enabled to indicate that the one or more libraries could be called from partially trusted code, but not by default; and in response to a particular library of the one or more libraries identified as partial trust callers enabled being loaded in a process, notifying a hosting application so the hosting application can make a determination on whether to revoke partial trust accessibility rights that are granted based on the particular library being identified as partial trust callers enabled. |
8266670 | 10905118 | 1 | 1. A method comprising: receiving, by a computer based system for dynamically load balancing hardware data resources, a request for hardware data resource processing, wherein the processing is according to a characteristic of data to be processed and a characteristic of said hardware data resource; receiving, by said computer based system, data to be processed by said hardware data resources; identifying, by said computer based system, a category of said data; determining, by a computer based system, a business value of said data based on said category; assigning, by said computer based system, said data to at least one of a plurality of security domains, wherein each security domain respectively includes a different degree of security control; determining, by a computer based system, a subset of hardware data resources having capacity to process data; analyzing, by said computer system, health of said hardware data resources having capacity to process data, wherein said health is based on said hardware data resources comprising at least one of current security patches and virus protection; load balancing, by said computer system, the processing of said data among said hardware data resources having capacity to process data based on said business value, said health of said hardware data resource and said security domain assigned to said data, wherein said hardware data resources processes said data into processed data, wherein said load balancing is a process comprising a data processing request being spread throughout a network to combat individual hardware data resources from becoming overwhelmed by traffic; receiving, by said computer based system, processed data from said hardware data resource; applying, by said computer based system, a first level of encryption to said processed data in response to said business value being low; applying, by said computer based system, a second level of encryption to said processed data in response to said business value being medium; and applying, by said computer based system, a third level of encryption to said processed data in response to said business value being high. |
20120137110 | 13365376 | 0 | 1. A hardware device for concurrently processing a fixed set of predetermined tasks associated with an algorithm which includes a number of processes, some of the processes being dependent on binary decisions, the device comprising: a plurality of task units for processing data, making decisions and/or processing data and making decisions, including source task units and destination task units; a task interconnection logic means interconnecting the task units for communicating actions from a source task unit to a destination task unit; and each of the task units including: a processor for executing only a particular single task of the fixed set of predetermined tasks associated with the algorithm in response to a received request action; a status manager for handling the actions from the source task units and building the actions to be sent to the destination task units; and two configuration registers CONFIG.L and CONFIG.R which are respectively selected by a binary value of a bit L/R of a control/data register of an instance of the algorithm being considered, contents of the configuration registers being loaded at a beginning of the algorithm processing for defining a task to be activated, an action to be performed and an instance to be considered. |
20110282656 | 13104565 | 0 | 1. A method of operating a decoder comprising: obtaining a vector d comprising quantized MDCT domain coefficients of a time segment of an audio signal; deriving a processed vector {circumflex over (d)} by applying a post-filter directly on the vector d, the post-filter being configured to have a transfer function H which is a compressed version of an envelope of the vector d; deriving a signal waveform by performing an inverse MDCT transform on the processed vector {circumflex over (d)}. |
20040255049 | 10462215 | 0 | 1. In a communication system comprising two or more virtual private network (VPN) endpoints coupled together through a network, the network comprising a plurality of nodes interconnected through edges, a method for providing restoration for the network, the method comprising the steps of: determining a restoration topology for the network, wherein at least one of the VPN endpoints is adapted to communicate with multiple VPN endpoints through a single connection, and wherein the restoration topology comprises backup edges corresponding to primary edges in the network; and replacing a given primary edge with one or more of the backup edges if the given primary edge fails. |
8457408 | 12439531 | 1 | 1. A method of identifying one or more features represented in a plurality of sensor acquired data sets, the method comprising: determining a first probability of the identity of the one or more features from a first one of the data sets; determining a second probability of the identity of the one or more features from a second one of the data sets; fusing the determined first and second probabilities to provide a fused probability; after the fusing: determining p(n); fusing p(fused n-2 ) with p(n) to provide p(fused n-1 ), where p(n) is a probability of the one or more features being present in an n th one of the images, and p(fused n-2 ) and p(fused n-1 ) are (n−2) th and (n−1) th fused probabilities, respectively; and repeating the determining of p(n) and fusing p(fused n-2 ) with p(n) for m times, where m=n−2, and n is an integer greater than 2; and identifying the one or more features from the fused probability, wherein the identifying uses (fused n-1 ). |
8949340 | 12026286 | 1 | 1. A computer program product embodied on a non-transitory computer readable medium, comprising: computer code for identifying content from one or more of a plurality of data sources; computer code for transforming the content into one or more messages; computer code for delivering a first message of the one or more messages to a handset for presentation; computer code for managing a message flow based on user responses, the message flow determining a next message based on a user response to a previous message; computer code for receiving a delivery mode selection of at least two delivery modes, the at least two delivery modes including a first delivery mode in which at least a first portion of the content is to be delivered to a user and a second delivery mode in which at least a second portion of the content is to be delivered to the user, at least one of the two delivery modes including a short message service delivery mode involving a short message service; computer code for delivering the at least first portion of the content to the user utilizing the first delivery mode; computer code for delivering the at least second portion of the content to the user utilizing the second delivery mode; computer code for receiving a command sequence including a first constant portion and a second variable portion, utilizing the short message service; computer code for delivering a response to the command sequence utilizing the short message service, the response including response information identified as a function of both the first constant portion and second variable portion of the command sequence; computer code for delivering a content menu utilizing the short message service in the form of a menu short message service message including: a first menu selection option indicating a first menu short form command including a first one or more characters associated with a first content, a second menu selection option indicating a second menu short form command including a second one or more characters associated with a second content, and a third menu selection option indicating a third menu short form command including a third one or more characters associated with a third content; computer code for receiving the first menu short form command associated with the first content; computer code for receiving the second menu short form command associated with the second content; computer code for receiving the third menu short form command associated with the third content; computer code for, in response to the receipt of the first menu short form command associated with the first content, delivering the first content; computer code for, in response to the receipt of the second menu short form command associated with the second content, delivering the second content; and computer code for, in response to the receipt of the third menu short form command associated with the third content, delivering the third content. |
20140095462 | 13828640 | 0 | 1. A system, comprising: a memory storing a plurality of instructions; and one or more processors configured to access the memory, wherein the one or more processors are further configured to execute the plurality of instructions to at least: initialize a query engine with relational data from at least a first source; and enable the query engine to provide query results based at least in part on the relational data from at least the first source and streaming data from at least a second source. |
10108270 | 15109524 | 1 | 1. A method for recognizing a three dimensional, 3D, gesture, the method being performed in a device ( 20 ) having access to a database ( 52 ) of gesture images, the device communicating with a sensor ( 34 ) adapted to capture an image ( 33 ) of the 3D gesture, wherein the database ( 52 ) of gesture images comprises indexable features ( 54 ) of normalized gesture images, the indexable features comprising a position and an orientation for each pixel of edge images of the normalized gesture images, the method comprising: capturing ( 110 ) the image ( 33 ) of the 3D gesture via the sensor, normalizing ( 120 ) the captured image in accordance with the normalized gesture images of the database ( 52 ) to allow for a comparison, deriving ( 130 ) indexable features ( 36 ) from the normalized captured image ( 33 ), the indexable features ( 36 ) comprising a position and an orientation for each pixel of an edge image of the normalized captured image, comparing ( 140 ) the derived indexable features ( 36 ) with the indexable features ( 54 ) of the database using a similarity function, and determining ( 150 ) a gesture image in the database ( 52 ) matching the 3D gesture based on the comparison; wherein each entry in the database ( 52 ) of gesture images is tagged with associated 3D motion parameters comprising three orientation and three position parameters, the method further comprising: retrieving 3D motion parameters associated with the determined gesture image matching the 3D gesture from the database ( 52 ). |
9656054 | 14676037 | 1 | 1. An implantable electrode, comprising: a) a first portion of an insulator layer; b) an electrically conductive interconnect layer supported by the first portion of the insulator layer, the interconnect layer comprising an interconnect peripheral edge providing an interconnect width or diameter extending between spaced apart first and second interconnect edges; c) an electrically conductive plug layer supported directly on an upper interconnect surface of the interconnect layer, the plug layer comprising a plug peripheral edge providing a plug width or diameter extending between spaced apart first and second plug edges; d) a second portion of the insulator layer supported on the first portion of the insulator layer and contacting the plug; e) an electrically conductive electrode layer supported directly on an upper plug surface of the plug layer, the electrode layer comprising an electrode peripheral edge providing an electrode width or diameter extending between spaced apart first and second electrode edges; and f) an anchor layer that overlaps only parts of the electrode layer including at least one of the first and second electrode edges, wherein the anchor layer is physically and electrically isolated from the interconnect layer and the plug layer by the insulator layer. |
20050262194 | 11065693 | 0 | 1. A method, comprising: providing a module for a data integration function; providing a registry of services; providing an interface for the module; and identifying the module in the registry; wherein the module can be accessed as a service in a services oriented architecture; and wherein the service supports deployment of a graphical user interface that displays a data integration platform function. |
8767950 | 11960374 | 1 | 1. A method, comprising the following steps: i) receiving a dial plan; ii) parsing the dial plan into a plurality of expressions each including at least one expression element; iii) identifying a rule associated with each expression element of each of the plurality of expressions; iv) adding the identified rule associated with each expression element of each of the plurality of expressions to an array of a finite state machine; v) receiving an n-th digit input of a given dial string, where n=1 corresponds to an initial digit input of the given dial string; vi) determining, for each of those of the plurality of expressions that are available for consideration, a match status from among a plurality of possible match statuses by applying the rule associated with an n-th expression element of the respective expression to the n-th digit input; vii) selectively removing one or more of the plurality of expressions from availability for consideration based on the match status determined for the respective expression; viii) incrementing n; and ix) repeatedly performing steps v through viii until the determined match status of one of the plurality of expressions indicates a full match or none of the plurality of expressions is available for consideration. |
9471500 | 14251288 | 1 | 1. A method for generating and storing a data structure for maintaining a cache supporting compression and a cache-wide deduplication, comprising: generating data structures with fixed size memory regions configured to hold multiple signatures as keys, wherein the number of the fixed size memory regions is bounded; generating a first mapping from short-length signatures to a storage location and a quantized length measure on a cache storage device; retrieving metadata and cache page content using a single input/output operation; validating a correctness of a full value of one or more hash functions of uncompressed cache page content using the metadata; generating a second mapping from the short-length signatures to entries in the first mapping, wherein one or more pointers to the entries in the first mapping are stored in a non-transitory computer readable storage medium, wherein the first and second mappings are statically sized, relative to memory allocated and a number of contents, d-left hash tables with zero internal pointer overhead, wherein the statically sized d-left hash tables are never resized or reallocated; and verifying whether the cached page content corresponds to a full-length original logical block address (LBA) using the metadata. |
10083199 | 15162262 | 1 | 1. A method of migrating a plurality of data entries stored in a distributed data store from a source memory device of the distributed data store to a target memory device of the distributed data store while the distributed data store is receiving client data access requests, comprising: locking a data entry in the source memory device with a soft locking mechanism, where the locking is performed by an application executing on a computer system, wherein the soft locking mechanism comprises a migration thread associated with the application releasing the lock on the data entry when a client that is different from the application requests one of a non-transactional update to the data entry or a transaction on the data entry, and wherein the migration thread is at least partially configured to migrate a data entry from the source memory device to the target memory device in an atomic transaction; reading the data entry in the source memory device by the application; cloning the data entry in a shadow journal in the target memory device by the application; launching a plurality of alias redirection threads by the application, where each remaps one of a plurality of aliases of the data entry from referencing the location of the data entry in the source memory device to referencing the location of the data entry in the target memory device; and committing the data entry in the shadow journal to the target memory device by the application. |
20090307216 | 12539646 | 0 | 1. A method of delivering at least one webpage comprising: receiving search result content from a user-initiated search of web content; receiving a hierarchical data set of interests identified by a user; parsing the hierarchical data set; extracting one or more keyword attribute values from the hierarchical data set in response to the parsing and a pre-selected granularity value; applying extracted one or more keyword attribute values to the received search result content in order to filter the received search result content for delivery to the user; and delivering the at least one webpage that is personalized for the user according to the interests identified by the user. |
20130262419 | 13435636 | 0 | 1. In a computing environment, a method of resolving conflicting changes to structured data files, the method comprising: for a structured data file which has both a generic structure and dialects built on top of the generic structure, for which conflicting changes have been made, and where an original version of the structured data, a first version of the structured data and a second version of the structured data exist, determining a dialect of the structured data; and based on the determined dialect performing at least one of merge or diff operations on the original version of the structured text data, the first version of the structured text data and the second version of the structured text data. |
20040193790 | 10402628 | 0 | 1. An apparatus for capturing data on a debug bus comprising N registers connected in a ring, wherein data is clocked from one register to the next in the ring in only one direction, the apparatus comprising: a counter that increments by one each time data is clocked from one register to the next; logic for comparing a value of the counter with a preselected register address on each count of the counter; and logic for capturing data from the debug bus at an extraction point when the counter value is equal to the preselected register address. |
8086724 | 11813726 | 1 | 1. A method of configuration of a user part for a communication network having said user part and a system part wherein said system part provides a service being accessible by the user part, the method comprising the following steps being performed at the system part: providing a problem recognition procedure for recognizing a problem occurring when transmitting data traffic of the user part wherein said data is related to the provision of the service, generating for the problem a signature including rules which are to be matched for solving the problem, providing a monitoring system for monitoring data traffic of the user part wherein said data is related to the provision of the service, providing a signature based filtering procedure for filtering the monitored data traffic being comparable with the rules of the signature, performing an identification procedure for identifying the user part corresponding to the filtered data traffic, providing a solution feedback procedure for configuration of the user part: wherein said solution feedback procedure is based on the rules of the signature and provides said rules to the user part for configuration purpose, and wherein the signature based filtering procedure for filtering data traffic of the user part by means of comparing with the rules of the signature is performed in a real-time. |
8204923 | 11590938 | 1 | 1. A method for scaling values in a real-time computation system, the method comprising: receiving a first data comprising a first plurality of estimates of noise variance values; determining, by a scaling factor computation circuit, a first scaling factor based on a smallest one of the first plurality of estimates of noise variance values; receiving a second data after receiving the first data, wherein the second data comprises a second plurality of estimates of noise variance value; and performing in parallel: computing, by a computation circuit, output data based on the first scaling factor and the second data using a ratio of (i) the smallest one of the first plurality of estimates of noise variance values to (ii) one of the second plurality of estimates of noise variance values, wherein computing the output data comprises computing, in real time, parameters for the second data based on the first scaling factor associated with the first data, and determining a second scaling factor based on the second data. |
20050114307 | 10720252 | 0 | 1. A method using efficient heuristics in selecting a materialized view (MV) from multiple materialized views matching a query, said method comprising the steps of: (a) receiving a query, Q; (b) ordering materialized view candidates in a list based upon a descending order of reduction powers, wherein reduction power is a function of cardinalities of common tables between query, Q, and materialized view definition, V, and cardinality of M; and (c) matching a query with materialized views in said ordered list by identifying a materialized view candidate based on any of, or a combination of, the following heuristics: avoid choosing an MV which is locked by REFRESH process, choosing a matching that does not require regrouping, choosing a matching that does not require a rejoin, choosing a matching that does not have a residual join, choosing an MV with the largest reduction power, or an equivalent of the foregoing. |
9715837 | 13721685 | 1 | 1. A method of processing written words in a visual prosthesis comprising: providing a visual prosthesis including a camera, video processor, and implantable stimulation system configured to stimulate visual neurons; recording a visual scene with the camera and transferring data representing the visual scene to the video processor; converting the data to visual stimulation patterns; presenting the visual stimulation patterns including the visual scene to a user through the implantable stimulation system; scanning the data for patterns representing written characters; switching to a reading mode upon recognition by the video processer of patterns representing written characters, wherein said reading mode includes: converting the written characters to Braille characters; encoding the Braille characters into the visual stimulation patterns, creating altered stimulation patterns; and presenting the altered visual stimulation patterns including the Braille characters to a user through the implantable stimulation system; switching back to presenting the visual stimulation patterns including the visual scene through the implantable stimulation system, after presenting the altered visual stimulation patterns including the Braille characters. |
9672083 | 14413108 | 1 | 1. A method of operating a program code object in conjunction with an application context in an application server environment, the method comprising: identifying, in an application server environment, the application context for enabling a provisioning of a service to execute a specific type of work specified within a received work execution request, the application context not directly accessible by a program code object; identifying a set of entry points into the program code object, wherein each entry point in the set of entry points identifies a resource which is an access point where work enters the program code object; for each entry point in the set of entry points, determining whether the entry point is of an entry point type to handle the application context; responsive to identifying one or more entry points whose entry point type can handle the application context, associating with at least one entry point a tag identifier referencing the application context; and executing the program code object in the application server environment using the tag identifier to access the application context and complete work associated with the received work execution request. |
8049751 | 12465794 | 1 | 1. A system comprising: a capture module to drive a capture unit to capture three-dimensional (3D) data about a physical object; and a transfer module, coupled to a distributed network and integrated with the capture module, to allow substantially automated transfer of information derived from the 3D data from the capture module to a transaction platform coupled to a distributed network, wherein the capture module and transfer module are integrated to allow a user to initiate the capture from within the transfer module. |
20150026569 | 14333379 | 0 | 1. A method in an electronic device, the method comprising: determining one or more edit references with respect to one or more objects displayed on a display unit; detecting a motion input; and editing the one or more objects based on the one or more edit references and a characteristic of the motion input. |
8200799 | 12367690 | 1 | 1. An integrated circuit comprising: a plurality of computing nodes; a memory in at least one of the plurality of computing nodes, the plurality of computing nodes configured to make memory requests for access to the memory; an interconnection network operatively coupled to the plurality of computing nodes, the interconnection network providing interconnections among the plurality of computing nodes to route the memory requests; means for identifying a set of memory requests; means for determining when all of the memory requests in the set of memory requests have been performed, wherein the means for determining when all of the memory requests in the set of memory requests have been performed is a ports counter; and means for initiating execution of a task when all of the memory requests in the set of memory requests have been performed. |
8412503 | 12446163 | 1 | 1. A simulation system of cardiac function comprised of at least one computer to simulate a change in ventricular geometry by utilizing a cardiac structure model which represents a heart made of the myocardial tissue comprising both myocyte and connective tissue as continuum data of a composite material containing both matrix and reinforcement fiber, comprising: a material specification input part that inputs both connective tissue data representing mechanical property of the connective tissue within the myocardial tissue and myocyte data representing mechanical property of the myocyte within the myocardial tissue, and stores the connective tissue data and the myocite data into a memory; a geometry data input part that inputs geometry data of three-dimensional geometry of all or any part of the heart and stores the geometry data into the memory; a cardiac-structure-model construction part that generates, by a processor, the cardiac structure model that represents the three-dimensional geometry as an assembly of finite elements, sets a mechanical property and a direction of the reinforcement fiber with respect to at least one of the finite elements and sets a mechanical property of the matrix with respect to at least one of the finite elements, wherein the mechanical property represented by the myocyte data is set as a mechanical property of the matrix and the mechanical property represented by the connective tissue data is set as a mechanical property of the reinforcement fiber; and a simulation part that determines a boundary condition and calculates a change in geometry of the heart represented by the cardiac structure model under a pressure load according to the boundary condition. |
9081824 | 14096135 | 1 | 1. A computer-implemented method for identifying electronic content, the method comprising the following operations performed by at least one processor: identifying a plurality of electronic content items based on the content of an electronic communication; applying an upcoming event content selection rule based on the content of the electronic communication; adjusting a set of scores associated with the plurality of content items based on the application of the upcoming event content selection rule; further adjusting the set of scores based on application of a merchant content selection rule, wherein application of the merchant content selection rule comprises determining whether a particular merchant name specified by the merchant content selection rule is referenced in the electronic communication; and identifying, based on the further adjusted set of scores, an electronic content item from the plurality of electronic content items. |
9772751 | 12217029 | 1 | 1. A computer-implemented method, comprising: at a portable multifunction device with a touch screen display: displaying a first user interface without concurrently displaying a second user interface that is distinct from the first user interface; detecting a gesture on the touch screen display to select the second user interface; and in response to detecting the gesture, displaying an animation of a transition from display of the first user interface to display of the second user interface, the animation comprising sliding a first element of the second user interface onto the display from a first side of the display while simultaneously sliding a second element of the second user interface that contacts the first element horizontally across the top of the first element, wherein the first element of the second user interface is distinct from the second element of the second user interface. |
20170031700 | 14814095 | 0 | 1. A method, comprising: determining, by a processor, an amount of memory needed for handling requests from users of a physical telephone number mapping service provided by a communication network; searching, by the processor, a listing of different virtual machine flavors available for instantiation, each virtual machine flavor having a different respective memory capacity; determining, by the processor, whether there is a virtual machine flavor available for instantiation that has a memory capacity adequate to handle the requests; and responsive to determining that there is a virtual machine flavor available for instantiation that has the memory capacity adequate to handle the requests, initiating, by the processor, instantiation of the virtual machine flavor for handling the requests. |
20130262520 | 13434563 | 0 | 1. A computer implemented method for transparently interfacing an R client environment with a separate database engine environment, the method comprising: receiving, at a computer, an R language code fragment from the R client environment; interpreting the R language code fragment to identify a first group of R language constructs; determining the computation resource requirements of at least one R language constructs selected from among the first group of R language constructs; and mapping, to a remote execution engine, a first selected R language construct from among the first group of R language constructs in response to the determination of the computation resource requirements. |
8302097 | 11767891 | 1 | 1. A method for resource allocation of a plurality of tasks carrying penalties based on their completion time, the method comprising: identifying the plurality of tasks to be assigned to one or more resources, wherein each job of a plurality of jobs includes multiple tasks ordered by chain precedence, wherein the plurality of jobs include active jobs and queued jobs, and wherein the plurality of tasks are associated with the active jobs; and assigning resources including start times for the plurality of tasks, using a processor, such that expected penalties for completion times of the plurality of tasks are reduced, wherein assigning the start times for the plurality of tasks comprises: assigning a time period to an allocated think time partition in a time slot for each active job, wherein each time slot of a plurality of time slots comprises a plurality of allocated think time partitions corresponding to the active jobs; performing immediate assignments of resources for the plurality of jobs based on expected execution times of tasks by executing an initial algorithm to form a preliminary solution for scheduling the plurality of jobs; responsive to performing the immediate assignments, simulating random assignments for the plurality of jobs by executing a randomized algorithm to form a plurality of simulations for a duration of the time period assigned to the allocated think time partition to determine a probable best solution for scheduling the plurality of jobs, and wherein the probable best solution is calculated for each allocated think time partition; and executing one of the initial algorithm and the randomized algorithm to assign resources for the completion of the plurality of tasks based on whether the initial algorithm or the randomized algorithm produced a best solution. |
9336443 | 14296810 | 1 | 1. A computer-based method for organizing digital photos, comprising: (a) detecting and cropping out faces from a plurality of digital photos in a first group to generate isolated face images; (b) applying a face recognition algorithm to determine similarity of each of the isolated face images contained in the digital photos in the first group with a model face image set, wherein the model face image set includes at least one model face image contained in a digital photo in a second group; (c) displaying the isolated face images on a display screen in accordance with the determined similarity; (d) receiving a user input to select one of the isolated face images displayed on the display screen; (e) reclassifying the digital photo containing the selected one of the isolated face images into the second group instead of the first group; (f) modifying the model face image set by adding the selected one of the isolated face images; (g) renewing the determined similarity by applying the face recognition algorithm to determine similarity of each of the isolated face images contained in the digital photos in the first group with the modified model face image set; and (h) displaying the isolated face images on the display screen in accordance with the renewed determined similarity. |
20170060355 | 15232962 | 0 | 1. A method for displaying applications associated with content in a clipboard, the method comprising: receiving, by one or more computer processors, a selection of content to transfer to a clipboard, wherein the content is selected from a first application on a computing device; identifying, by one or more computer processors, one or more applications on one or more computing devices capable of processing the received selection; assigning, by one or more computer processors, the identified one or more applications to one or more categories; and displaying, by one or more computer processors, one or more user interface objects representative of the one or more applications with a respective assigned category. |
20130254029 | 13890194 | 0 | 1. A method for providing advertising in one or more search results, the method comprising: receiving at least one database on a computer system from at least one service provider via a network, the at least one database being one of a plurality of databases, each database in the plurality of databases comprising a plurality of items for recognition, each database in the plurality of databases being for a corresponding vertical application; processing the at least one database on the computer system based on the plurality of items for recognition; receiving on the computer system over the network a sound data input comprising a query for the processed at least one database; determining one or more search results in the processed at least one database using the computer system based on the query; identifying one or more advertisement results in an advertisement database based on at least one of the query and the determined one or more search results using the computer system, the advertisement database being communicatively coupled to the computer system; and transmitting the one or more search results and the one or more advertisement results from the computer system to a remote computer system. |
8380966 | 11560344 | 1 | 1. A method, comprising: writing a stuff instruction at a debugging process registry associated with a debugging process, wherein the debugging process registry is associated with a core processor of a multi-threaded processor, wherein the multi-threaded processor is configured to execute a plurality of interleaved threads on the core processor, wherein each of the plurality of interleaved threads is identified by a thread number, wherein each of the plurality of interleaved threads may be executed independently and debugged independently of others of the plurality of interleaved threads, and wherein a program counter is separately maintained for each of the plurality of interleaved threads; selecting a particular thread of the plurality of interleaved threads to execute the stuff instruction; for the particular thread, stopping a program counter at a current program counter value during execution of the stuff instruction; executing the stuff instruction at the particular thread of the multi-threaded processor during the debugging process; and issuing, from the core processor, a debugging process control resume command during execution of the stuff instruction. |
9064065 | 13838383 | 1 | 1. A method for coupling architectural and implementation/behavioral models of a computer-based system, the method comprising: creating, with a processor of a computer, a first bridge element to bridge between an architectural model of a computer-based system and an implementation/behavioral model of the computer-based system, wherein the first bridge element is associated with a first activation and access table describing, for each of one or more first active elements, first data to which that first active element has access and a first activation policy associated with that first active element; creating, with the processor of the computer, a second bridge element to bridge between the architectural model of a computer-based system and the implementation/behavioral model of the computer-based system, wherein the second bridge element is associated with a second activation and access table describing, for each of one or more second active elements, data to which that second active element has access and an activation policy associated with that second active element; to couple the architectural model and the implementation/behavioral model in a first manner, generating, with the processor of the computer, first code using the first bridge element, the one or more first active elements associated with the first bridge element, the first data to which each of the one or more first active elements have access, and the first activation policy associated with each of the one or more first active elements; and to couple the architectural model and the implementation/behavioral model in a second manner, generating, with the processor of the computer, second code using the second bridge element, the one or more second active elements associated with the second bridge element, the second data to which each of the one or more second active elements have access, and the second activation policy associated with each of the one or more second active elements. |
9558443 | 13957805 | 1 | 1. A system, comprising: a memory device maintaining deterministic neural data relating to a digital neuron, wherein the neuron has a plurality of operating modes, the plurality of operating modes include a stochastic mode and a deterministic mode, and the deterministic neural data includes a deterministic synaptic weight; and a logic circuit configured to: generate a pseudo-random value; retrieve the deterministic synaptic weight from the memory device; generate stochastic neural data based on a comparison between the deterministic synaptic weight and the pseudo-random value, wherein the stochastic neural data includes a stochastic synaptic weight, wherein the stochastic synaptic weight is a non-zero value if the deterministic synaptic weight is greater than or equal to the pseudo-random value, and wherein the stochastic synaptic weight is a zero value if the deterministic synaptic weight is less than the pseudo-random value; determine whether the neuron is operating in the deterministic mode or the stochastic mode; in response to determining the neuron is operating in the deterministic mode, process a neuronal state of the neuron based on the deterministic neural data; and in response to determining the neuron is operating in the stochastic mode, process the neuronal state of the neuron based on the stochastic neural data. |
8856759 | 12658017 | 1 | 1. A method of generating an executable computer program, the executable computer program including instructions for invoking decimal numeric computations during its execution on a computer system, the executable computer program generated by compilation of a computer program source file; the source file including: a) declarations of decimal numeric variables specifying declared attributes of each decimal numeric variable and, b) description of decimal arithmetic operations between first and second of the decimal numeric variables; the method comprising the steps of: A) reading, with a special compiler, the computer program source file; B) generating, by the special compiler, the executable computer program including executable instructions which perform a plurality of calls to a special decimal numeric subroutine stored in a memory associated with the computer system for performing decimal arithmetic operations; and C) storing within the executable computer program, an argument for each of the plurality of the calls to the special decimal numeric subroutine, each of the argument lists containing at least one argument that directly provides compiler generated comparative alignment information, the comparative alignment information determined by the special compiler at compile time based upon a comparison of the declared attributes of the first and second decimal numeric variables, for enabling the special decimal numeric subroutine to perform a decimal numeric operation upon the first and second decimal numeric variables utilizing said comparative alignment information to directly align at run time, the first decimal numeric variable with the second decimal variable for reducing time spent in performing the decimal numeric computations during execution of the executable program; wherein the compiler generated comparative alignment information is based upon a comparison of lengths of the first and second decimal numeric variables the comparative alignment information determined during compile time. |
20030065770 | 10224766 | 0 | 1. In a computer network having one or more servers connectable to one or more clients, a method of monitoring user interaction with a file downloaded from a server, comprising the steps of: using a client to specify an address of a resource located on a first server; downloading a file corresponding to the resource from the first server in response to specification of the address; using the client to measure the amount of time the user spends interacting with or displaying the file downloaded from the first server; using a server to acquire client identifying indicia from the client; and uploading the amount of time measured by the client to a server. |
9910943 | 14169418 | 1 | 1. A method comprising: correlating, by a computing system, transactions captured during simulation of a circuit design to distributed states for multiple components in the circuit design, wherein the distributed states for the multiple components correspond to operational states of the multiple components while the multiple components are functionally-interrelated during the simulation of the circuit design; identifying, by the computing system, at least a portion of the distributed states for the multiple components correspond to system level coverage events; and generating, by the computing system, a graphical presentation to illustrate the portion of the distributed states for the multiple components in the circuit design that correspond to system level coverage events. |
8306806 | 12326168 | 1 | 1. A system, comprising: a search engine component to retrieve one or more bilingual web pages, each bilingual web page including a plurality of terms that comprise a search term and one or more additional terms in a first language; a candidate selection component to form a plurality of candidate translation pairs by selecting one or more candidate translations for each of the plurality of terms and pairing one of the one or more candidate translations and one of the plurality of terms; a pattern extraction component to adaptively extract one or more translation layout patterns from the plurality of candidate translation pairs; a hidden conditional random field (HCRF) computation component to derive a term translation in a second language for the search term in the first language based on the one or more candidate translations using an HCRF model, the one or more translation layout patterns, and one or more features, the HCRF model including a hidden variable that represents the one or more a translation layout patterns; and a data storage component to store the term translation in a lexicon repository. |
20170147912 | 15338094 | 0 | 1. A non-transitory recording medium storing a computer readable program that causes a computer to execute: a) analyzing first page description language data that is unconverted data described in a first page description language to determine whether a repetitive pattern image portion is included in the first page description language data; b) separating the repetitive pattern image portion from the first page description language data when it is determined that the repetitive pattern image portion is included in the first page description language data; c) generating first partial data in a second page description language by using a unit image repetitive rendering command that is a rendering command to render the repetitive pattern image portion of the first page description language data by using a single image datum relating to a unit image; d) generating second partial data in the second page description language based on a portion other than the repetitive pattern image portion of the first page description language data; and e) generating converted. data that relates to the first page description language data and is second page description language data described in the second page description language based on the first partial data and the second partial data. |
10037210 | 15257833 | 1 | 1. A hardware processor comprising: a hardware decoder to decode a first instruction into a decoded first instruction, a second instruction into a decoded second instruction, and an add instruction into a decoded add instruction; and a hardware execution unit to: execute the decoded first instruction to multiply a first input operand and a second input operand and store a lower portion of a result, said first and second input operands being respective elements of a first input vector and a second input vector, execute the decoded second instruction to multiply the first input operand and the second input operand and store an upper portion of a result, said first and second input operands being the respective elements of the first input vector and the second input vector, and execute the decoded add instruction to add aligned elements of the upper portion and the lower portion with a previous, corresponding carry term from an input operand and store a result. |
8727893 | 14033280 | 1 | 1. Non-transitory computer-readable storage media encoded with a computer program including instructions executable by a processor to create an interactive mobile game, the game fully contained in a mobile embeddable unit, the embeddable unit expandable in response to a user interaction to provide the game, the game occupying at least 50 percent of the available area of a mobile display, provided that the game comprises a software module configured to transact in-game mobile micropayments; wherein the interactive mobile game is an action game, an adventure game, an arcade game, a board game, a brain game, a card game, a casino game, a dice game, a drawing game, an educational game, a music game, a puzzle game, a racing game, a role-playing game, a simulation, a social game, a sports game, a strategy game, a trivia game, a word game, or a combination thereof. |
20150040134 | 14287499 | 0 | 1. A method for execution by one or more processing modules of one or more computing devices of a dispersed storage and task (DST) network, the method comprises: receiving a task for execution by a plurality of distributed storage and task execution units; determining a priority level for the task; generating a plurality of coordinated partial task requests to the plurality of distributed storage and task execution units, wherein the plurality coordinated partial task requests indicate a plurality of coordinated partial tasks and the priority level; receiving a plurality of partial task results in response to performance of the plurality of coordinated partial tasks by the plurality of distributed storage and task execution units; and generating a task result for the task based on the plurality of partial task results. |
9088757 | 12731817 | 1 | 1. A method for presenting a program representation, comprising: sending, by a media controller to a server, at least one user-identifying criterion for use in identifying a plurality of identified users from a plurality of users, the plurality of identified users being a subset of the plurality of users; based on the user-identifying criterion, obtaining, by the media controller, program rating information derived from the plurality of identified users regarding a corresponding plurality of programs that are currently being accessed by the identified users; determining a social ranking of the plurality of programs based on the program rating information; and causing a display of a plurality of program representations to a viewer, each of the plurality of program representations comprising a non-textual image, wherein the plurality of program representations represent corresponding ones of the plurality of programs and a display of a plurality of user icons, each user icon identifying one user of the plurality of identified users, wherein each user icon is displayed in association with the program representation that corresponds to the program currently being accessed by the one user of the plurality of identified users, and wherein each program has a social rank and the program representation of the program is sized based on the social rank of the program with respect to the social rank of other programs represented by other displayed program presentations. |
9038178 | 13532385 | 1 | 1. A malware beaconing detection system, comprising: a processor configured to: identify a plurality of conversations between an internal device and one or more external destinations, wherein at least some of the plurality of conversations are determined from stored logs associated with communication between one or more internal devices associated with an enterprise network and the one or more external destinations, wherein identifying a first conversation of the plurality of conversations between a pair comprising the internal device and a first external destination of the one or more external destination comprises to: obtain a plurality of communication events among the stored logs that includes the pair comprising the internal device and the first external destination, wherein to obtain a communication event that includes the pair comprising the internal device and the first external destination includes to: identify traffic between a dynamically assigned Internal Protocol (IP) address and the first external destination; and determine that the dynamically assigned IP address maps to a statically assigned address associated with the internal device; and generate the first conversation between the pair comprising the internal device and the first external destination based at least in part on the plurality of communication events; extract feature sets based at least in part on the plurality of conversations; and determine that a conversation of the plurality of conversations is anomalous based at least in part on the extracted feature sets; and a memory coupled to the processor and configured to store the extracted feature sets. |
7904408 | 11803601 | 1 | 1. A computer based method for monitoring innovation activity, comprising: accumulating first metadata associated with a first plurality of intellectual knowledge files; extracting a first plurality of patterns from said first plurality of intellectual knowledge files; creating a first plurality of concept spaces, using rules-based processing, said first metadata, and said first patterns; grouping, using rules-based processing, said first metadata, and said first plurality of patterns, said first plurality of intellectual knowledge files into first respective concept spaces in said first plurality of concept spaces; and, generating a report, said report correlating said first plurality of intellectual knowledge files and said first respective concept spaces, wherein said steps of accumulating, extracting, creating, grouping, and generating are performed by a general-purpose computer specially programmed to perform said steps of accumulating, extracting, creating, grouping, and generating. |
20160078036 | 14640756 | 0 | 1. A method implemented by an information handling system that includes a memory and a processor, the method comprising: ingesting a first set of traditional sources that comprise a plurality of first terms; ingesting a second set of crowd-based sources that comprise a plurality of second terms and a plurality of crowd-based metadata; calculating one or more weightings pertaining to one or more of the first terms based on the crowd-based metadata; receiving a question that includes one or more question terms; and identifying an answer to the question based on one or more of the weightings corresponding to one or more of the first terms that are relevant to one or more of the question terms. |
8194191 | 12371416 | 1 | 1. A method of programming a remote control comprising: receiving a control command from the remote control at a television receiver; operating the television receiver in a programming mode upon receipt of the control command; outputting a signal from the television receiver that causes a video display device to provide programming information with text and images via a graphical programming interface after receipt of the control command at the television receiver; receiving an indication at the television receiver from the remote control that identifies a selected button for programming; outputting a signal from the television receiver that causes the display device to display the selected button on a remote control image via the graphical programming interface; determining whether the selected button is successfully programmed; and outputting a signal from the television receiver that causes the display device to indicate on the graphical programming interface whether the selected button is successfully programmed by correlating text that indicates successful programming of a remote control button with an image of the successfully programmed remote control button including displaying both the text and the image of the remote control button as the same color. |
10055223 | 15431698 | 1 | 1. A data processing method comprising: in a procurement application program, generating and causing displaying as part of a graphical user interface of a client computer, a user interface widget that is programmed to list a plurality of different project identifiers; receiving first input indicating a selection of a particular project identifier representing a project having a particular self-executing project table, managed using the procurement application program from among the plurality of different project identifiers; in response to the first input, retrieving from a database, the particular self-executing project table that corresponds to the particular project identifier, from among a plurality of digitally stored self-executing project tables, wherein the particular self-executing project table comprises: header data; a plurality of action identifiers of a plurality of different actions that are available in the procurement application program and that are associated with executing the particular self-executing project table; a plurality of different configuration parameter values for configuring the procurement application program to execute the project; and a plurality of dashboard data configuration values; based on retrieving the particular self-executing project table: automatically applying the plurality of different configuration parameter values to result in configuring the procurement application program to execute the project; automatically selecting and generating a list of the plurality of different actions that are available in the procurement application program and that are associated with executing the project, wherein one or more actions among the plurality of actions are different actions that are associated with achieving the same purpose for the selected project; sorting and displaying, in the graphical user interface, the selected actions based on one or more criteria from among success of previous actions in similar situations, actions specified by an administrator as preferred, and newly included actions in the procurement application; based on the plurality of dashboard data configuration values, automatically generating a data dashboard in the graphical user interface that displays then-current values of data variables that are maintained by the procurement application program and that are associated with executing the project; generating a trend view in the graphical user interface that indicates the number of times actions associated with the selected project are selected by users of the procurement application; asynchronously receiving second input selecting a particular action from among the different actions from the list; in response to the second input, executing the particular action with the procurement application program and updating the data dashboard in the graphical user interface based upon changes in the dashboard data configuration values that result from executing the particular action. |
20140122552 | 13660841 | 0 | 1. An apparatus comprising: a polynomial register having a plurality of bits, wherein the polynomial register is configured to store a user-defined polynomial; a first bus; a second bus; a transceiver that is coupled to the first bus, the second bus, and the polynomial register, wherein the transceiver includes: a pseudorandom bit sequence (PRBS) generator is configured to generate a scrambled signal from the user-defined polynomial; and a PRBS checker that is configured to generate a descrambled signal from a second signal using the user-defined polynomial. |
20040073125 | 10663920 | 0 | 1. A method for filtering an input signal, comprising: applying a portion of the input signal to a plurality of filters to produce a plurality of filtered signal portions of varying smoothness; comparing the plurality of filtered signal portions to the portion of the input signal to generate a plurality of deviations; comparing one or more of the plurality of deviations to a maximum deviation limitation to select one of the plurality of filtered signal portions, the selected one filtered signal portion having a deviation less than the maximum deviation limitation; and generating an output signal representative of a smoothed version of the input signal from a combination of a plurality of successive selected one filtered signal portions which substantially preserve morphology of the input signal. |
7774190 | 09989777 | 1 | 1. A method for performing a sleep operation in a system that includes a device under test and an emulator device, said method comprising: a) executing instructions on said device under test; b) emulating the functions of said device under test by operating said emulator device in lock-step fashion with said device under test; c) performing a sleep operation, comprising: c1) upon receiving a first signal from an operating program that indicates that a sleep function is to be performed, initiating said sleep function at said device under test; c2) in response to said initiating said sleep function, turning off one or more clock of said device under test; and c3) discontinuing execution of instructions that are performed in lock-step by said emulator device upon turning off said clock; d) when said sleep function has been completed by said device under test, turning on said clock and sending a second signal from said device under test to said emulator device; e) receiving said second signal at said emulator device; f) determining the number of clock signals received at said emulator device since said second signal was received; and g) resuming execution of said instructions that are performed in lock-step at said emulator device when said determined number of clock signals received at said emulator device since said second signal was received equals a predetermined value. |
9919420 | 13905229 | 1 | 1. A method involving a mobile robot that includes a user interface, the method comprising: determining an authorization level of an individual; electronically presenting information to the individual using the user interface based on the authorization level, wherein the information is indicative of a first task; receiving a selection of the first task at the user interface; autonomously performing at least a portion the first task using the mobile robot; and performing at least a portion of a second task using the mobile robot; and interrupting the performance of the at least the portion of the second task to electronically present the information and receive the selection of the first task. |
10115916 | 14684346 | 1 | 1. A method comprising: providing a synaptic device including a first structure for injecting both electrons and holes into a semiconductor layer and traps for trapping both electrons and holes; receiving an electrical signal at the synaptic device, thereby causing the first structure to inject one of electrons and holes into the semiconductor layer, and effecting net negative charge trapping or net positive charge trapping within the traps upon injection of the one of electrons and holes into the semiconductor layer, wherein the first structure includes a contact region adjoining the semiconductor layer and the semiconductor layer comprises an organic layer containing the traps, the contact region injecting one of the electrons and holes into the semiconductor layer. |
8028030 | 12125374 | 1 | 1. A computer-implemented method of supervising an electronic text message in an enterprise, said method comprising: storing, by a computer, organizational information, related to said enterprise; storing, by said computer, one or more communication screens that screen electronic text messages, each of said communication screens applying a set of rules to analyze said electronic text message, said set of rules being determined by said organizational information; wherein each of said rules of said set of rules comprises an entity identification, and any of a keyword and a pattern of text in said electronic text messages, and wherein a matched rule has a numerical value, within a fixed range, corresponding to a relative value of truth for said matched rule; identifying, by said computer, a source and a target of said electronic text message; invoking, by said computer, said one or more communication screens between said identified source and said identified target, each of said one or more invoked communication screens being determined by said organizational information for said identified source and said identified target, wherein said organizational information includes an identity of an employee and a workstation that said employee has access to, and any of a department in which said employee works, and special projects to which said employee is assigned that may have temporary communication restrictions that apply to said employee; analyzing, by said computer, said electronic text message by said set of rules corresponding to said invoked one or more communication screens to provide a supervisory score, wherein said analyzing further comprises: combining one or more matched rules to provide an evidence category, said evidence category having an evidence category score, corresponding to a highest numerical value of said one or more matched rules; and combining one or more evidence categories to provide one or more compliance classes, each of said one or more compliance classes having a supervisory score that is limited to a fixed numerical range, according to one of logical and arithmetic operations performed on said combining of one or more evidence category scores; and outputting, by said computer, said electronic text message, based on said supervisory score, to a supervisory file for review by a supervisor. |
20030046658 | 09847391 | 0 | 1. A method for operating a computer system comprising: receiving in the system a description of a finite state machine including a temporal logic condition; and generating code for emulating the described finite state machine. |
20140098743 | 13648158 | 0 | 1. A computer program embodied on a computer-readable storage medium, the computer program configured to cause at least one processor to: determine a peak in a first spectrum generated by a MUSIC algorithm for a first signal of interest (“SOI”) using a first noise subspace; and determine an estimated carrier frequency offset for the first SOI based on the determined peak in the first spectrum. |
10164985 | 15182624 | 1 | 1. A method comprising: (AA) monitoring input-user interactions of a user, that utilizes an electronic device to access a computerized service; (BB) analyzing said input-user interactions, and identifying a particular word that the user typed multiple times in a user-specific typing manner; subsequently, (CC) determining that a current user, that (i) fails to perform an authentication process for accessing said computerized service or (ii) requests to perform a reset process for a user-authentication factor of said computerized service, is a genuine user that is authorized to reset said user-authentication factor of said computerized service, by performing: (a) constructing a unique multiple-word phrase, which comprises (i) said particular word that was identified in step (BB), and also (ii) one or more other words; and presenting to the current user a fresh task that requires the current user to type said unique multiple-word phrase; (b) monitoring a fresh manner in which the current user types said unique multiple-word phrase; (c) determining whether or not fresh typing of said unique multiple-word phrase as monitored in step (b), exhibits during typing of said particular word the user-specific typing manner that was identified in step (BB) during repeated previous typing of said particular word; (d) if the determining of step (c) is positive, then determining that the current user is the genuine user that is authorized to reset said user-authentication factor of said service. |
8417758 | 12552180 | 1 | 1. A systolic array in an integrated circuit, comprising: boundary cells oriented along a main diagonal of the systolic array; internal cells disposed in a corner, wherein the systolic array is a triangular matrix; the boundary cells and the internal cells configurable for any of a plurality of modes including a triangularization mode, a back-substitution mode, and a multiplication mode; the boundary cells having first multipliers; the internal cells having second multipliers; and the first multipliers and the second multipliers for multiplication of a first matrix and a second matrix responsive to the multiplication mode being invoked. |
20140365216 | 14298690 | 0 | 1. A method for learning word pronunciations, comprising: at an electronic device with one or more processors and memory storing one or more programs for execution by the one or more processors: receiving a first speech input including at least one word; determining a first phonetic representation of the at least one word, the first phonetic representation comprising a first set of phonemes selected from a speech recognition phonetic alphabet; mapping the first set of phonemes to a second set of phonemes to generate a second phonetic representation, the second set of phonemes selected from a speech synthesis phonetic alphabet; and storing the second phonetic representation in association with a text string corresponding to the at least one word. |
9177022 | 13287717 | 1 | 1. A method for processing queries, comprising: receiving user input creating a pipeline configuration for executing a query from an input device; receiving a first query; obtaining a context and conditions of the first query; determining rules based on the context and the conditions of the first query by utilizing the pipeline configuration, wherein the rules are triggered in response to receiving the first query; applying the rules to the first query to determine additional queries to execute; executing the additional queries; receiving supplemental results from execution of each of the additional queries; receiving core results from execution of the first query; and mixing the received supplemental results with the core results to form mixed results. |
7624368 | 11267587 | 1 | 1. A method for optimizing a digital circuit design, the method comprising steps of: translating a first representation of the digital circuit design to a second representation of the digital circuit design, the second representation comprising a plurality of syntactic expressions that admit a representation of a higher-order function of base Boolean values; syntactically manipulating the plurality of syntactic expressions to form a third representation of the digital circuit design, wherein the manipulating step comprises reducing a number of nodes within the plurality of syntactic expressions. |
9922108 | 15398958 | 1 | 1. A system for assisting a user in performing transform of an origin data set into a target data set, the system comprising: one or more processors; and memory storing instructions that, when executed by the one or more processors, cause the system to: obtain the origin data set, the origin data set being organized in a tabular framework defined by an origin data schema; provide a graphical user interface displaying the origin data set; receive through the graphical user interface, at least one designation of a data object, the at least one designation of the data object mapping at least a portion of the origin data set to the data object; generate a data transform file based on the at least one designated data object, the data transform file generated in response to receiving the at least one designation of the data object; transform the origin data set into the target data set based on an execution of the data transform file, the target data set having an object-oriented based framework; compare the object-oriented based framework of the target data set to respective object-oriented based frameworks of a plurality of reference data sets; detect, based on the comparison, similarities between the object-oriented based framework of the target data set and the respective object-oriented based frameworks of the plurality of reference data sets; determine, based on the similarities, a respective similarity score for at least one of the plurality of reference data sets; select a comparable reference data set based on the at least one respective similarity score; obtain a data visualization template associated with the comparable reference data set; apply the visualization template to the target data set; and display, through the graphical user interface, the target data set based on the visualization template. |
20140215053 | 13755768 | 0 | 1. A method for managing an entity, said method comprising: establishing a framework for characterization of the entity, wherein the framework abstracts operation of the entity to a state machine, wherein each state in the state machine is characterized in terms of distributions of a performance metric associated with the entity; and implementing, by a processor, the framework for characterization of the entity to manage the entity. |
20160204923 | 14594295 | 0 | 1. A method for allocating compute nodes among cloud groups, the method comprising: creating policies for task-specific cloud groups for specifying conditions when a compute node will need to be borrowed by a task-specific cloud group as well as when said borrowed compute node is to be returned, wherein said borrowed compute node is a compute node assigned as a backup resource for one or more task-specific cloud groups, wherein each of said task-specific cloud groups comprises a plurality of compute nodes assigned to host a designated workload type; assigning priorities to said conditions in said policies for borrowing said compute node as well as to said task-specific cloud groups concerning borrowing said compute node; monitoring conditions of a cloud computing environment; allocating, by a processor, said borrowed compute node from a first task-specific cloud group to a second specific cloud group based on said priority assigned to said second task-specific cloud group, said priority assigned to a monitored condition of said second task-specific cloud group invoking said borrowing of said compute node and said monitored condition of said second task-specific cloud group satisfying a condition in said policy for said second task-specific cloud group as to when said borrowed compute node will need to be borrowed by said second task-specific cloud group; and migrating a workload to said borrowed compute node. |
20020174182 | 09858704 | 0 | 1. A computer implemented real time electronic service interaction management system comprising: a target interaction module for providing instructions to a touch point that presents information in accordance with an interaction motivation plan and receives a target interaction; a database module for storing information associated with the target interaction in response to the interaction motivation plan; and a testing module for providing inputs to the interaction motivation plan. |
20040236722 | 10441812 | 0 | 1. A method for estimating a cardinality of an expression, the method comprising: matching the expression with a stored expression; retrieving statistics associated with the stored expression; and estimating the cardinality of the expression based on the statistics. |
20130028511 | 13199303 | 0 | 1. A method of determining a saliency map for an image, said method comprising using a processing device for executing the steps of determining to which of at least two predetermined scene categories a scene depicted in the image belongs wherein each of the at least two predetermined scene categories is associated with a different predetermined set of weights, each predetermined set of weights comprising weights for colour dependent subbands, selecting the weight set associated with the determined scene category, splitting the image into colour dependent frequency subbands and orientation subbands by splitting the image into colour components and applying wavelet transformation to each colour component, determining early feature maps for the subbands by extracting visual features from the wavelet transforms by a center-surround mechanism based on a Difference of Gaussian, using the selected weight set for weighting the early feature maps and fusing the weighted feature maps. |
9811548 | 14398109 | 1 | 1. A method for representing a database in a computer readable medium, the method comprising: accessing a first table in the database, the first table having a plurality of rows of data, each row of data having one or more columns; storing a first representation of the first table in a volatile computer memory in a column-oriented format, the column-oriented format comprising at least one B-tree for at least one column, wherein the at least one B-tree is composed of at least one array and the at least one B-tree includes references to a plurality of arrays, each array of the plurality of arrays is comprised of data corresponding to rows of one column of the first table, wherein the storing further comprises reducing an amount of storage space required when storing the first representation of the first table to improve storage efficiency by storing data of a particular column corresponding to the rows in a packed format using a power of two amount of space to store each datum and adaptively increasing the power of two amount of space to store each datum in the particular column when a datum is to be written to the particular column that has a value that requires an increased amount of space for storage to reduce use of unnecessary storage space; and storing a second representation of the first table on a computer-readable medium, wherein the second representation is substantially identical to the first representation, without serialization of the first representation of the first table to an intermediate form, without deserialization from the intermediate form into the second representation, and without basic header information, metadata or other versioning information necessarily being identical. |
20020138531 | 09777622 | 0 | 1. A digital filter, comprising: a plurality of stages, wherein each of the plurality of stages comprises: a first adder configured to subtract an input from a first partial sum producing a sum, a multiplier configured to multiply the sum by a gain coefficient producing a product, and a second adder configured to sum the product with the input to produce a second partial sum. |
9430256 | 14094612 | 1 | 1. A cloud-connector subsystem that provides a stretch-redeploy operation for moving one or more virtual machines and virtual applications, which execute in a target cloud-computing facility, to a new target cloud-computing facility, where the one or more virtual applications resume executing, the cloud-connector subsystem comprising: a cloud-connector node associated with a source cloud-computing facility; a cloud-connector node associated with the target cloud-computing facility; and a cloud-connector node associated with the new target cloud-computing facility; and a cloud-connector server that includes one or more processors, one or more memories, one or more data-storage devices, and computer instructions that, when executed on the one or more processors, control the cloud-connector server to provide, in cooperation with the cloud-connector nodes, a stretch-redeploy operation that extends a first local virtual network within the source cloud-computing facility to the new target cloud-computing facility, forming a second extended local virtual network, by verifying the new target cloud-computing facility, creating a routed virtual application with a third local virtual network in the new target cloud-computing facility, launching execution of the routed virtual application within the new target cloud-computing facility, creating, from a first edge appliance within the source cloud-computing facility, a secure communications tunnel to a third edge appliance through which the third local virtual network in the routed virtual application is connected to a third virtual organization network, in turn connected to the external network, and executing a copy phase and a deployment phase; and moves the one or more virtual machines and virtual applications from executing on the target cloud-computing facility and communicating with other computational entities through the first local virtual network and a first extended local virtual network that extends the first local virtual network to the target cloud-computing facility using one or more network addresses to executing on the new target cloud-computing facility and communicating with other computational entities through the second extended local virtual network using the same one or more network addresses. |
20120110598 | 13346483 | 0 | 1. One or more computer storage media having stored thereon multiple instructions that, when executed by one or more processors, cause the one or more processors to: receive, as one or more parameters of an application programming interface method invoked by a client application, information describing a type registration regarding which an action is being requested by the client application; determine, based on the one or more parameters, one of multiple type extensions to which the action being requested corresponds; and send at least part of the information describing the type registration to the one of the multiple type extensions for the one of the multiple type extensions to perform the action being requested. |
20050086458 | 10851098 | 0 | 1. A reusable hardware intellectual property (IP) protocol method for a system-on-chip device, capable of describing a hardware behavior via a software function, the method comprising: (A) determining whether any parameters are needed, corresponding to a determination of whether the hardware IP needs any parameters; wherein if parameters are needed, proceeding to step (B), and if not, proceeding to step (C); (B) inputting at least one function parameter, corresponding to input at least one function parameter to the hardware IP; (C) calling the software function corresponding to input a request signal to the hardware IP; (D) waiting for a return value from the software function corresponding to input an acknowledge signal to the hardware IP; (E) sending back the return value from the software function corresponding to output the result data from the hardware IP; and (F) ending the software function corresponding to reset or boot the hardware IP. |
20070078848 | 11460807 | 0 | 1. A computer-implemented system that facilitates caching of local results for location-based queries, comprising: a cache with a plurality of bags stored therein, each respective bag stores results of a previous location-based query in a location-independent manner, each respective bag is associated with a key that relates to a search string of the previous location-based query; and a search component that receives a location-based query, removes location information from the query, and selects a subset of the plurality of bags in which a search string of the location-based query matches the key for the subset of bags. |
9588329 | 12439597 | 1 | 1. A method for scanning a sample using an electrically or electronically controllable microscope, comprising the steps of: performing a continuous scanning of the sample so as to repeatedly generate a plurality of images of the sample at a first resolution, each of the plurality of images corresponding to a different time, the microscope being controlled via a control computer during the scanning; analyzing the plurality of images using at least one second computer connected via a network, wherein the at least one second computer is configured to classify each of the plurality of images as one of interesting and non-interesting while the continuous scanning of the sample with the microscope continues; and automatically interrupting the continuous scanning of the sample based on the classifying of the images performed by the at least one second computer so as to capture a same region of the sample which was captured at the first resolution at a different time at a second resolution for a period of time sufficient to capture an event occurring in the region, the second resolution being higher than the first resolution and the continuous scanning being resumed after capturing the event. |
20020101451 | 09772493 | 0 | 1. A method of programming a programmable logic controller, said programmable logic controller including a plurality of inputs and a plurality of outputs, said programmable logic controller directing a process through output signals at said outputs in response to input signals at said inputs, comprising the steps of: displaying to a user on a monitor a graphical data entry user interface for a plurality of sequential steps, said graphical data entry user interface representing respective inputs to be monitored by said programmable logic controller at each of said sequential steps and respective outputs to be initiated by said programmable logic controller at respective ones of said sequential steps; receiving, via said graphical data entry user interface, an identification of at least one input selected by said user to be monitored for at least one of said sequential steps and an identification of at least one output selected by said user to be initiated for said at least one of said sequential steps; converting said identification of said at least one input selected by said user into an input control data table, said input control data table including a plurality of input control data elements, each of said input control data elements corresponding to a respective one of said plurality of sequential steps, a respective one of said input control data elements representing said at least one input selected by said user; and converting said identification of said at least one output selected by said user into an output data table, said output data table including a plurality of output data elements, each of said output data elements corresponding to a respective one of said plurality of sequential steps, a respective one of said output data elements representing said at least one output selected by said user. |
20150178191 | 14139957 | 0 | 1. A method of collaborative management in a non-volatile hierarchical storage system including multiple controllers, the method comprising: a first controller receiving health reports from at least second and third controllers of the storage system regarding health of multiple storage units of physical storage under control of the second and third controllers; the first controller maintaining a health database of information received in the health reports; in response to a health event and based on information in the health database, the first controller modifying logical-to-physical address mappings of one or more of multiple storage units under its control such that data having greater access heat is mapped to relatively healthier storage units and data having less access heat is mapped to relatively less healthy storage units; and thereafter, the first controller directing write requests to storage units under its control in accordance with the modified logical-to-physical address mappings. |
20130111273 | 13456028 | 0 | 1. A system for providing virtual machine diagnostic information, comprising: a computing or virtual execution environment which includes one or more computers, and a virtual machine, for use in executing one or more software applications; and a flight recorder that operates with the virtual machine to record, as input events, data regarding the operation of the virtual machine and the applications executing thereon, and provide the events as a coordinated ordered stream of data, for use in determining or analyzing virtual machine or application problems. |
9262380 | 13900040 | 1 | 1. A computer-implemented method, comprising: identifying one or more influences within a network, the identifying comprising: representing the network as a graph comprising a plurality of nodes, the graph being further represented by an adjacency matrix; multiplying a random probe vector v i by a resolvent function (A−zI) −1 , wherein A is the adjacency matrix, I is an identity matrix, and z is a selected scalar number using a result of the multiplying the random probe vector by the resolvent function as an approximation of a product of a matrix exponential and the random probe vector; computing, by a computer processor, a diagonal of the adjacency matrix based on the product of the matrix exponential and the random probe vector, wherein the computing comprises: initializing vectors Q, W, and D of length N to zero, wherein the vector D represents the diagonal; initializing the random probe vector v i ; computing the product of the matrix and the random probe vector; updating the vector Q by calculating Q=Q+v i .×Z, where Z is the product of the matrix and the random probe vector, wherein .x symbolizes element-wise multiplication; updating the vector W by calculating W=W+v i .×v i ; updating the vector D by calculating D=D+Q ./W, wherein ./ symbolizes element-wise division; and repeating the initializing the random probe vector, the computing the product, the updating the vector Q, the updating the vector W, and the updating the vector D until at least one of (a) the difference of a previously estimated diagonal and an estimated diagonal is smaller than a designated diagonal tolerance, and (b) a percentage of nodes with target centrality has converged; and calculating node centralities of the graph based on the computed diagonal of the adjacency matrix. |