doc_id
stringlengths 7
11
| appl_id
stringlengths 8
8
| flag_patent
int64 0
1
| claim_one
stringlengths 12
21.5k
|
|---|---|---|---|
20070112807 | 11617943 | 0 | 1. A method for improving functionality of a binary representation of an XML-based content description, wherein a structure of any instance of an XML document corresponds to a tree-like data structure, the method comprising the steps of: providing that each tree node represents an element of the content description and has a structure which is defined in a schema; providing the tree nodes in the binary representation with tree branch codes; providing that the respective tree branch code has a schema branch code; and decoding, via a decoder, paths with new elements, which does not conform to a previous schema, by communicating to the decoder one of (a) the associated tree structure nodes beforehand, and (b) a completely new schema. |
20120079488 | 12924311 | 0 | 1. An apparatus comprising: an execution logic that includes circuitry to execute instructions; and an instruction execution scheduler logic coupled with the execution logic, the instruction execution scheduler logic to receive an execute at commit state update instruction, the instruction execution scheduler logic including: at commit state update logic to wait to schedule the execute at commit state update instruction for execution until the execute at commit state update instruction is a next instruction to commit. |
7747325 | 11239653 | 1 | 1. A method of modulating a patient'neurological disease state, the method comprising: sensing at least one neurological signal from the patient; processing the at least one neurological signal using a disease state processor to estimate the neurological disease state; generating a therapy output, wherein the generated therapy output is a function of the estimated neurological disease state; delivering the therapy output to the patient; and communicating the estimated neurological disease state to the patient using a patient interface module external to the patient's body. |
20100121474 | 12692000 | 0 | 1. A manufacturing process method, comprising the steps of: providing a computer system having a processor and memory and programmed with a simulation model of a manufacturing process, the simulation model when executed by the computer system predicting, in dependence upon a plurality of process input parameters, a value for a performance parameter of a product to be manufactured using the manufacturing process; providing to the computer system an actual value for the product performance parameter of a product actually fabricated during a particular run of the manufacturing process; the computer system estimating, in dependence upon the simulation model and further in dependence upon the actual value for the product performance parameter, values for a calculated subset of the process input parameters that actually existed for the particular run, the estimated values for the calculated subset of the process input parameters being usable for yield management. |
20120113868 | 13290736 | 0 | 1. A wireless communication system, comprising: a data store configured to store for each of a plurality of nodes, each node comprising a wireless communication system element, a node image data comprising metadata about or otherwise associated with the node, wherein the data store has the capability to create and support an organically changing schema, and provides a mechanism to propagate changes to the schema or data, but only as necessary; a processor configured to receive an indication of an objective and use node image data stored in the data store to identify programmatically from among the plurality of nodes a node to help achieve the objective and to determine the configuration of the node. |
9965043 | 15069135 | 1 | 1. A method for recommending one or more gestures to a user interacting with a computing device, the method comprising: receiving, by a gesture recommendation system, gesture data from one or more gesture detection sensors for each of the one or more gestures; determining, by the gesture recommendation system, a noise score, a proximity score, a shape score, and a strength score based on the gesture data; determining, by the gesture recommendation system, a cumulative score using the noise score, the proximity score, the shape score, and the strength score, wherein the proximity score is calculated based on a first score determined based on a body proximity range and a second score determined based on a phone proximity range, and wherein the first score is indicative of a first distance between body parts of the user associated with the one or more gestures from the body of the user and the second score is indicative of a second distance between the body parts from the computing device; and recommending, by the gesture recommendation system, suggestions as to at least of improving the one or more gestures and changing the one or more gestures based on the cumulative score. |
7664339 | 11120607 | 1 | 1. A method of processing an image for pattern recognition and three-dimensional scene resolution, comprising: receiving a first digitized image; creating a first discrete projective Fourier transform (DPFT) image in log-polar coordinates of the first digitized image using a fast Fourier transform (FFT); storing the first DPFT image in a memory; projectively transforming the log-polar coordinates of the DPFT image; and computing an inverse DPFT image of the projectively transformed log-polar coordinates of the DPFT image using a non-uniform FFT to produce a projective transformation of the first digitized image. |
9483256 | 14153324 | 1 | 1. A method for patching a virtualized application, comprising: storing a current version of a virtual application image that is segmented into blocks and captures setup-time changes and run-time changes made to a client computing device by the virtualized application at a first location; accessing a current mapping file from the first location for the current version of the virtual application image that is a separate file from the virtual application image and comprises a number of blocks in the virtual application image and a location of each block in the virtual application image; determining on the client computing device changes to a client virtual application image by comparing the current mapping file to a client mapping file, wherein the client mapping file comprises a number of blocks in the client virtual application image and a location of each block in the client virtual application image; obtaining essential blocks from the virtual application image from the first location when the client computing device is executing the virtualized application in a network mode, wherein the blocks that are marked as essential for execution are downloaded; obtaining the changes from the current version of the virtual application image at the first location; and updating a client version of the client virtual application image using the obtained changes and any portion of the client virtual application image that did not change. |
9690985 | 14074247 | 1 | 1. An apparatus for recognizing an object, the apparatus comprising: a processor configured to extract a foreground from a depth image comprising a depth associated with the object; determine whether a hole is present in the depth image, based on the foreground and a color image comprising a color associated with the object; generate, using the foreground and the hole, a feature vector comprising a plurality of features corresponding to the object, based on a result of the determining; and recognize the object by calculating a distance between the generated feature vector and a reference feature vector corresponding to a predetermined shape of the object. |
20140025923 | 13552491 | 0 | 1. A memory management system comprising: a table comprising a plurality of virtual memory addresses, wherein each virtual memory address corresponds to a physical memory address and to data that identifies a type of memory device corresponding to the physical memory address. |
20030195395 | 10394301 | 0 | 1. A method for comparing multiple factors using multidimensional scaling analysis, comprising: generating at least one set of observable samples, where each observable sample in the set is generated by a different algorithm combining a number of factors; for each set, collecting data on observable relative differences between samples in the set; performing multidimensional statistical analysis on the collected data; and displaying results of the statistical analysis as plots. |
20130061026 | 13225504 | 0 | 1. A computer system processing business transactions in parallel, the system comprising: a memory to store computer executable instructions; and a processor coupled to said memory and operable to execute said instructions to generate a data structure to receive and store at least one operation attribute selected for parallelization criteria, an operation manager to receive a plurality of operations and to compute a plurality of parallelization values based on said at least one operation attribute, wherein at least one parallelization value of said plurality of parallelization values corresponds to at least one operation of said plurality of operations, an execution process comprising a plurality of process threads, wherein the execution process executes in parallel a plurality of portions of said operations utilizing separate process threads of said plurality of process threads, and at least one consolidating document aggregating results of said execution in parallel of said plurality of portions. |
20100198868 | 12758070 | 0 | 1. A system for querying hierarchical data, the system comprising: a query component for receiving a query of a database query language comprising query input relevant to the hierarchical data, the query input expressly including rowset structure information; and a hierarchical data processor for receiving the hierarchical data and for receiving the generated query from the query provider, and for processing the received query to extract the rowset structure information relevant to the hierarchical data, and for generating rowset data corresponding to the hierarchical data based on said rowset structure information. |
20070006144 | 11450143 | 0 | 1. A computer readable medium, comprising executable instructions to: allow the designation of a connector component provided within a Graphical User Interface (GUI); support the selection of a graphic component within the GUI; associate the connector component with the graphic component; associate the connector component with a data source; and generate an interactive control panel incorporating the connector component and the graphic component, wherein the interactive control panel presents data from the data source. |
8856449 | 13131832 | 1 | 1. A method comprising: storing, in a query store, a query and a result relating to said query derived from a primary store; and storing an indication that data of said primary store has changed in a differential store, wherein the differential store is configured to store changes to contents of the primary store. |
20080091639 | 11818921 | 0 | 1. A method for associating a user of an electronic system with a demographic, comprising: accessing a data characteristic of a user of an electronic system; comparing the data characteristic of the user to a wide population probability distribution reference indicative of a demographic associated with the data characteristic; and determining a probability that the user is of the demographic based on the comparing. |
20160357779 | 14730434 | 0 | 1. A method for use in a database cluster, wherein the database cluster comprises a plurality of nodes, the method comprising: receiving a first transaction at a first node of the database cluster; generating a page pre-fetch request corresponding to the first transaction whilst executing the first transaction at the first node, wherein the page pre-fetch request is indicative of at least one database page that is referenced by the first transaction; adding the page pre-fetch request to a replication write-set of a second transaction at the first node; and communicating the replication write-set of the second transaction, along with the page pre-fetch request, to a second node of the database cluster. |
9436796 | 14620043 | 1 | 1. A method for presenting synchronous cell connectivity in a semiconductor chip design, the method comprising: receiving, at a microprocessor, a semiconductor chip design that comprises a plurality of objects therein, the objects including at least one of blocks, modules, macros, and cells; bypassing, with the microprocessor, combinational logic of the objects in the semiconductor chip design to obtain a representation of the semiconductor chip design that includes connectivity of synchronous cells and ports thereof; and providing, with the microprocessor, a presentation of the semiconductor chip design based on the representation of the semiconductor chip design with the bypassed combinational logic of the objects. |
8402365 | 11211744 | 1 | 1. An information processing apparatus comprising: an input unit configured to input, by a user, an annotation of at least one of an underline, a box, a character, a character string, a symbol, and a symbol string in a position on a document to be annotated by the user that identifies coverage of a certain portion of the document; a display configured to display both the document and the user inputted annotation concurrently on the document; a first memory to store a plurality of patterns each expressed in at least one of a character, a character string and a symbol, and for each a semantic class representing a type or meaning of information matching; a second memory to store intention estimation knowledge information for estimating an intention of the user organized by type of annotation and related semantic class of information; an annotation recognition unit configured to recognize a type of annotation input by the user and a coverage of the annotation in the displayed document; a semantic class analyzer to provide a semantic class for information matching a pattern in the coverage of the displayed document identified by the user-inputted annotation; an intention estimation unit configured to estimate an intention of the user based on the intention estimation knowledge information determined by the semantic class provided by the semantic class analyzer and the type of recognized annotation, wherein the intention of the user corresponds to an action the user intends to perform; an action selection unit configured to select the action intended by the user based on the intention estimated by the intention estimation unit; an execution unit configured to execute the action selected by the action selection unit by extracting at least one information item from the displayed document and creating an output including the one information item; and a display unit configured to display a view of the output created by the execution unit. |
20090077140 | 11856688 | 0 | 1. A method for retrieving data from a storage system having a plurality of storage pools, the method comprising: processing configurable data retrieval instructions to determine an order for retrieving target data from among a plurality of storage pools from which target data is to be retrieved, in response to a data restore request; and retrieving the target data from a target storage pool to satisfy the restore request, wherein the configurable data retrieval instructions are managed by a source external to the storage system with administrative authority to change the configurable data retrieval instructions to optimize data restoration from the storage system. |
9817956 | 14568956 | 1 | 1. A method comprising: sensing, by the processor, a target of at least one user interacting with a touchscreen of a mobile device; receiving, by a processor via the touchscreen, interaction data of the target to authorize the user for executing a function with the mobile device; extracting, by the processor, key frames from the received interaction data; determining, by the processor, feature data of the target from the extracted key frames; determining, by the processor, the target from the feature data; comparing, by the processor, the feature data of the determined target with pre-stored user information; identifying upon the comparison, by the processor, the user based on a match between the feature data and at least a portion of the pre-stored user information; authorizing, by the processor, the user for the function if the user is identified based on the match; and blocking, by the processor, the user from executing the function if there is no match between the feature data and at least a portion of the pre-stored user information. |
7512489 | 10771743 | 1 | 1. A computer-implemented route search method for a navigation device, wherein the navigation device includes a storage device which stores map data including link data of respective links constituting roads on a map, and statistical data including travel time or moving speeds of the respective links determined by statistical values of traffic information collected in the past, said statistical data being classified according to differing predetermined environmental conditions existing during collection of the traffic information, and the route search method comprises: setting step which sets a departure position, a destination, and environmental conditions for searching; and recommended route searching step which searches a recommended route from the departure position to the destination, by using the map data stored in the storage device and statistical data corresponding to the environmental conditions set in the setting step out of the statistical data stored in the storage device; wherein, in the route searching step, the statistical data corresponding to the environmental condition of respective candidate links constituting a recommended route, is used. |
20100118036 | 12612709 | 0 | 1. An animation authoring apparatus comprising: a storyboard editor that comprises a storyboard editing display to interact with a user, to edit a storyboard, and to store the edited storyboard; a parser to parse syntax of the edited storyboard; and a rendering engine to convert the edited storyboard into a graphic animation based on the parsed syntax of the edited storyboard. |
8768680 | 13006730 | 1 | 1. A simulator of a multi-core system employing reconfigurable processor cores, comprising: a data structure stored in a memory of the simulator; a structure builder configured to receive a structure definition file defining arrangement information of components of a multi-core system to be simulated, select at least a portion of the components described in the structure definition file from a component library based on the arrangement information of the components in the multi-core system, and fill the data structure that is stored in the simulator in advance of the receiving of the structure definition file, with the selected components to generate a structure model of the multi-core system, wherein the data structure stored in advance includes a nodal structure comprising a plurality of nodes that are interconnected, and the structure definition file provides data about each of the selected components that populate the nodes of the nodal structure to generate the structure model; and a simulation engine to execute an application program according to the structure model and output a result. |
8538953 | 13422252 | 1 | 1. A method for processing a multi-way join query, comprising: (a) with respect to a join graph where the respective source streams are denoted by a node and a join predicate is denoted by an edge for the multi-way join query, generating a query walk that is a sequence of nodes and edges in the join graph such that every edge in the join graph is visited at least once in a continuous walk of the join graph starting from a specific node; (b) based on the query walk, generating matrix based synopses for the nodes, where the matrix based synopses include a window synopsis that manages the number of tuples allocated to entries, a window index synopsis that manages a list of addresses of the tuples assigned to the entry, a batch synopsis that is a batch of the window synopsis, and a batch index synopsis that is a batch of the window index synopsis; (c) when a hash function is given to a join attribute domain of the query walk, if the source stream is input, hashing the tuple of the source stream by the hash function to fill the window synopsis, the window index synopsis, the batch synopsis, and the batch index synopsis; (d) when the query equation is defined by the matrix multiplication operation of the window synopses corresponding to the nodes of the query walk, and the batched query equation is defined by the query equation in which a window synopsis corresponding to a specific stream is replaced with a batch synopsis corresponding to the specific stream in the query equation, evaluating the batched query equation to generate a result vector; (e) based on the result vector, generating the result tuple for the multi-way join query from the batch index synopsis and the window index synopsis; (e1) under a join predicate where two source streams are joined with a certain join attribute, when tuples of two streams having the same hash value of the hash function are defined as buddy tuples and when the sequence is defined as a complete connecting sequence if a join graph of a multi-way join query that joins n source streams and the query walk are given and all tuples in a sequence having a distance of n, which consists of tuples of the source streams are buddy tuples, performing backward evaluation using the result vector of the batched query equation and an intermediate result vector to refine the intermediate result vector so as to remove an entry that cannot be a candidate for any of complete connecting sequence from the intermediate result vector; and (e2) based on the refined result vector, generating a result index vector having an address of the result tuples as an entry from the batch index synopsis and the window index synopsis. |
9430369 | 14285838 | 1 | 1. An apparatus, comprising: an execution unit; a fetch unit configured to receive a multi-part instruction, wherein the multi-part instruction includes a plurality of fields; and a plurality of address generator units; wherein a first address generator unit of the plurality of address generator units is configured to perform a first arithmetic operation for a first thread of sub-instructions dependent upon a first field of the plurality of fields and store a result of the first arithmetic operation in a register; wherein a second address generator unit is configured to generate at least one address of a plurality of addresses, wherein each address of the plurality of addresses is dependent upon a respective field of the plurality of fields, wherein the apparatus is configured to use the at least one address to access one or more input operands for the execution unit for a second thread of sub-instructions; and wherein the apparatus is configured to use the result of the first arithmetic operation stored in the register to access one or more input operands for the execution unit for a sub-instruction in the first thread of sub-instructions in a subsequent multi-part instruction. |
20160147656 | 14861025 | 0 | 1. A cache controller of a shared cache memory system comprising a plurality of cache lines, the cache controller comprising a cache allocation circuit comprising: a minimum mapping bitmask for mapping a Quality of Service (QoS) class of a plurality of QoS classes to a minimum partition of the plurality of cache lines; a maximum mapping bitmask for mapping the QoS class of the plurality of QoS classes to a maximum partition of the plurality of cache lines; and the cache allocation circuit configured to: receive a memory access request comprising a QoS identifier (QoSID) corresponding to the QoS class of the plurality of QoS classes; determine whether the memory access request corresponds to a cache line of the plurality of cache lines; and responsive to determining that the memory access request does not correspond to the cache line of the plurality of cache lines: select, as a target partition, one of the minimum partition mapped to the QoS class corresponding to the QoSID by the minimum mapping bitmask and the maximum partition mapped to the QoS class corresponding to the QoSID by the maximum mapping bitmask; and allocate a cache line within the target partition for a cache fill operation. |
8032826 | 12035285 | 1 | 1. A method of mapping and retrieving Extensible Markup Language (XML) code, the method comprising: formatting an XML document to remove redundant whitespaces, wherein whitespaces comprise new line characters; padding each line of code in the XML document with unexecutable code to bring a total size of each line of code to a predetermined size; creating, after said padding, a node tree for the XML document, wherein each line of code in the XML document is represented by a node in the node tree; assigning breadth-first order node identifiers to each node in the node tree; mapping the breadth-first order node identifiers to corresponding depth-first node identifiers; based on the corresponding depth-first node identifiers, determining a node level of a particular node in the node tree; utilizing the node level and depth-first node identifier of the particular node to determine a starting byte/character position for the particular node in the node tree, wherein the starting byte/character position describes a start position in the XML document at which the particular node starts; utilizing the node level and depth-first node identifier of the particular node to determine an ending byte/character position for the particular node in the node tree, wherein the ending byte/character position describes an end position in the XML document at which the particular node ends; retrieving the particular line of code that is associated with the particular node in accordance with the starting byte/character position and the ending byte position; and removing the unexecutable code from the particular line of code that is associated with the particular node. |
20110087976 | 12964973 | 0 | 1. A computer-implemented method, comprising: receiving, while a current view of an application's user interface is displayed, a first user input requesting that a history view of the application's user interface be displayed; displaying the history view of the application's user interface, the history view including a plurality of visual representations of the application's user interface, each visual representation representing the application's user interface as the user interface appeared at a respective time in the past; and receiving, while the history view is displayed, first user input selecting a first visual representation from the plurality of visual representations, and displaying the first visual representation in response to the selection. |
7590638 | 10603037 | 1 | 1. A method for improving data processing in connection with a database having restrictions therein, said method comprising: defining a dimension comprising a plurality of attributes; assigning each attribute to a respective column of said database having restrictions therein; defining relationships between said attributes of the defined dimension, said defined relationships not being subject to said restrictions of said database, said defined relationships establishing a first hierarchy of the attributes with respect to the defined dimension; defining new relationships between said attributes of the defined dimension, said new defined relationships establishing a second hierarchy of the attributes with respect to the defined dimension: said new relationships not being subject to said restrictions of the database; and said new relationships of the second hierarchy modifying at least one relationship of the first hierarchy between said attributes; and accessing said database via a query that employs at least one of the first hierarchy and the second hierarchy of said dimension without modifying the dimension, and displaying a result corresponding to the query to a user, wherein the first hierarchy and the second hierarchy share at least one common attribute from the defined dimension, the first hierarchy has at least one attribute from the defined dimension not present in the second hierarchy, and the second hierarchy has at least one attribute from the defined dimension not present in the first hierarchy. |
20040015973 | 10160280 | 0 | 1. A method for scheduling software task execution, the method comprising the steps of: accepting at least one high priority software task that has a specified start time; accepting at least one lower priority software task; determining a time remaining until the specified start time for the high priority software task; determining if the lower priority software task can complete execution within the time remaining that was determined; executing the lower priority software task only if it was determined to be able to complete execution within the time remaining; and executing the high priority software task at or very near the specified start time. |
20150105880 | 14513847 | 0 | 1. A method comprising: receiving, by a first computer system, a first signal from a first appliance, wherein the first signal is indicative of a use of a particular consumable good; updating in a memory, by the first computer system, a current memorized state of at least one processing event, the current memorized state being based on i) the receiving of the first signal from the first appliance and ii) a previous memorized state, such that the current memorized state correlates with an estimate of the amount currently having been consumed of the consumable good; generating, by the first computer system, a first indication that the consumable good is to be reordered, based on the current memorized state in relation to a first predetermined criterion; and transmitting, by the first computer system, a reorder message to a second computer system, wherein the transmitted reorder message is based on the generated first indication, and wherein the second computer system is for processing messages representative of reorders of the consumable good. |
20130023283 | 13455848 | 0 | 1. A system for wireless location estimation of a mobile node using radio transceivers with polarization diversity, said system comprising: a plurality of fixed transmission modules at pre-defined fixed reference nodes distributed over a predetermined area adapted to transmit fixed reference signals; mobile node transmission module at the mobile node adapted to transmit mobile reference signals with respect to the mobile node and the plurality of pre-defined fixed reference nodes; horizontal polarization module adapted to horizontally polarize the transmitted mobile reference signals; vertical polarization module adapted to vertically polarize the transmitted mobile reference signals; receiver module adapted to receive the horizontally polarized signals and vertically polarized signals; measurement module adapted to measure signal strength of the received signals; derivation module adapted to derive range of the received signals; profile creation module adapted to create a profile of said derived range with reference to said measured signal strength; and trilateration module adapted to employ a trilateration algorithm to determine localization of said node using said created profile, thereby provide the location estimation of said mobile node. |
20040024788 | 10212441 | 0 | 1. A web-based maintenance system, comprising: a) a database containing information relevant to plant maintenance; b) a software application which is configured to access the information from the database to create pages which are viewable in a web browser; and c) a plurality of selectively viewable pages created by the software application displaying information from said database relevant to plant maintenance, wherein each page created by the software application contains links to other pages that also display information relevant to plant maintenance. |
9155894 | 14575440 | 1 | 1. A method, comprising: modulating autonomic tone, including delivering neural stimulation for an autonomic modulation therapy (AMT) according to a programmed schedule; detecting a swallow event; and responding to the detected swallow event by overriding the programmed schedule. |
20060248104 | 11360456 | 0 | 1. A computer-implemented method for maintaining isolated data in an application comprising: receiving data; receiving a request to perform a control operation with respect to the data; performing the control operation; and updating status information. |
20110302133 | 12885266 | 0 | 1. A method of sharing information between tenants in a multi-tenant database, the method comprising: receiving information on a connection between a first tenant of a multi-tenant database and a second tenant, wherein the connection comprises information on a scope of data from the first tenant shared with the second tenant; allowing data for a record of the first tenant to be accessible to the second tenant in accordance with the connection; receiving information on a file related to the record of the first tenant; and allowing data from the file to be accessible to the second tenant in accordance with the connection. |
7590935 | 11177077 | 1 | 1. A computer implemented method for dynamic generation of WSDL documents based on database metadata, the method comprising: resolving database endpoint metadata by querying based on parameters about a request; collecting, from the database endpoint metadata, a list of entry points into the database that have been mapped; creating a first collection of unique XML schema namespaces, with one entry corresponding to each unique XML schema namespace for any arbitrary user-defined XML schema definitions required by a parameter to a database entry point; creating a second collection of unique XML schema namespaces, with one entry corresponding to each unique XML schema namespace for a database entry point; emitting wrapper elements for a WSDL document; emitting arbitrary user-defined XML Schema definitions required by parameters to the database entry points, wherein all duplicated user-defined types in a single XML schema namespace are represented by a single user-defined type; emitting, for each database entry point in the collection, the XML schema definition for the entry point; emitting WSDL document definitions for messages, port types, and bindings for each entry point; and emitting service entry definitions for the endpoint; wherein the completion of all emitting activities generates a WSDL document for said database entry points. |
20130036081 | 13559099 | 0 | 1. An information processing device comprising: a collection unit configured to collect meta feedback that is feedback on a combination including a content, a user, and feedback on the content of the user; and a prediction unit configured to obtain a predicted acceptance degree that is a prediction value of a degree to which an active user that is a target user accepts a combination including at least one of the content, the user, and the feedback, based on the collected meta feedback. |
9935854 | 14494423 | 1 | 1. A computer-implemented method for infrastructure performance monitoring, the infrastructure comprising physical and virtual components, the method comprising: monitoring application performance over the infrastructure by communication exchange with the physical and virtual components, including tapping traffic data using one or more virtual network traffic taps, duplicating, using the one or more virtual network traffic taps, packets of the traffic data, forwarding, via a virtual network packet broker, duplicated packets to one or more monitoring tools, grouping the traffic data based at least on virtual entities in the infrastructure, including correlating the duplicated packets to associate the packets with individual packet flows, and updating performance counters based on statistics collected from the virtual and physical components using correlated, duplicated packets; identifying degradation in the application performance due to one or more of the virtual and physical infrastructure components and results of determined correlations between the physical and virtual components of the infrastructure, including directing duplicated packets to one or more analysis tools and using the one or more analysis tools to analyze the grouped traffic data using correlated, duplicated packets to indicate performance according to a virtual infrastructure of which they are part; and correlating the degradation to the one or more virtual and physical infrastructure components. |
20140316536 | 14254703 | 0 | 1. A DNC operation system that connects a host apparatus and a numerical controller via a communication line capable of bidirectional communication and successively transmits, to the numerical controller, NC data stored in a storage device in the host apparatus in order to perform a DNC operation, with the numerical controller being configured to perform operation using the transmitted NC data, wherein the numerical controller has: means for determining whether the NC data transmitted from the host apparatus includes any of a sub program, a repeat instruction and a branch instruction; and means for writing, in a storage device in the numerical controller, search information for searching the NC data stored in the storage device in the host apparatus when the NC data includes any of the sub program, the repeat instruction and the branch instruction, wherein the host apparatus has: means for reading the written search information; means for searching the NC data stored in the storage device in the host apparatus on the basis of the read search information; and means for transmitting the searched NC data to the numerical controller, and wherein the numerical controller determines whether the NC data received after the search information is written is the NC data that has been searched by the host apparatus, and performs the operation on the basis of the received NC data. |
20130091337 | 13269626 | 0 | 1. A system comprising: at least one processor of a computing device; a memory of the computing device; and at least one module loaded into the memory causing the at least one processor to: in response to receiving a request for a heap snapshot, provide memory allocation statistics of a native language program by: receiving information mapping a relative virtual address of an instruction in a binary of the native language program to a user type, the instruction when executed requesting a memory allocation; mapping a virtual memory address of the instruction executing in a process to an address of an instance of the memory allocation requested by the instruction; matching the virtual memory address of the instruction to a corresponding relative virtual address of the instruction; assigning the user type mapped to the corresponding relative virtual address to the virtual memory address of the instruction; and aggregating user type instance counts and sizes, |
20030210248 | 10140263 | 0 | 1. A method comprising: allocating a memory region for sharing between a CPU and a graphics processor; assigning said shared memory region a caching attribute favorable to an operating efficiency of said CPU; performing a transition from a first mode wherein said CPU is using said memory region to a second mode wherein said graphics processor is using said memory region; and during said transition from said first mode to said second mode, changing said caching attribute to one favorable to an operating efficiency of said graphics processor. |
8022958 | 11696665 | 1 | 1. A method comprising: storing, by a graphics processing unit (GPU) driver executed by a central processing unit, graphics processing objects in a memory module, wherein storing the graphics processing objects comprises storing a subset of the graphics processing objects as an array in the memory module, wherein the array corresponds to a particular type of graphics processing information, wherein each of the graphics processing objects in the subset corresponds to the particular type of graphics processing information, and wherein a GPU corresponding to the GPU driver is communicatively coupled to the memory module; identifying, by the GPU driver after storing the graphics processing objects in the memory module, a set of the graphics processing objects to be used by the GPU to render a batch of graphics primitives, wherein at least some of the batch of graphics primitives correspond to the particular type of graphics processing information; formulating, by the GPU driver, a batch command to render the batch of graphics primitives with the GPU, wherein the batch command includes a base address that identifies a memory location of the array in the memory module and a set of indexes that indicate locations in the array of the subset of graphics processing objects in the set that are to be used by the GPU to render the batch of graphics primitives, wherein the set of indexes identify the graphics processing objects of the particular type corresponding to the at least some of the batch of graphics primitives; and issuing, by the GPU driver, the batch command to the GPU without passing the graphics processing objects, which were stored to the memory module, to the GPU, wherein the batch command is formulated to cause the GPU to retrieve the set of graphics processing objects from the memory module, to retrieve the subset of graphics processing objects in the set of graphics processing objects from the locations in the array specified by the set of indexes, and to use the set of graphics processing objects to render the batch of graphics primitives in order to generate displayable graphics information. |
20110307874 | 12815801 | 0 | 1. At a computer system including one or more processors and system memory, a method for converting a portion of a spreadsheet into a compilable function, the method comprising: an act of selecting one or more results cells in a page of a spreadsheet, the one or more results cells storing a corresponding one or more values representing the results of executing a plurality of formulas within the spreadsheet; an act of identifying values in a plurality of other cells related to the one or more results cells, the value in each of the plurality of other cells corresponding to execution of a combination of one or more of the plurality of formulas; an act of identifying additional data in further cells related to the values in the plurality of other cells, the additional data describing the values on the plurality of other cells; an act of using the identified additional data to generate local variables for use in a programming language, the local variables corresponding to the values in the plurality of other cells; and an act of generating a semantic tree representing a function from the plurality of formulas and the generated local variables, the semantic tree compilable into executable code configured to calculate the one or more values representing the results. |
20040086183 | 10263664 | 0 | 1. A method of processing data representing pixel colour, the data for each pixel being arranged as a luminance component and colour difference components, wherein the method comprises: dividing the data into first and second data portions, the first data portion comprising the luminance components and the second data portion comprising the colour difference components; deriving first and second instructions from a combined instruction word; processing the first and second date portions in parallel using first and second parallel processors within a processor architecture, the first and second parallel processors operating according to the first and second instructions, respectively; and combining the processed first and second data portions to provide processed pixel colour data. |
20110225360 | 12779709 | 0 | 1. A dispersed storage managing unit for use within a dispersed storage network, comprising: an interface; and a processing module operable to: determine a state of a dispersed storage unit supporting a vault associated with at least one user of the dispersed storage network, the vault including data objects at least partially stored within the dispersed storage unit, one of the data objects being segmented into data segments and one of the data segments being sliced into data slices, a number of the data slices within one of the data segments indicating a number of pillars of the vault, the dispersed storage unit storing no more than one of the pillars of the vault; and provision storage within the dispersed storage unit based on the state thereof via the interface. |
8132121 | 12057086 | 1 | 1. A text visualization method comprising: receiving vectors that characterize conceptual content of a plurality of text documents, each document being represented by a vector of arbitrary length; and displaying a multi-dimensional representation of the document collection that conveys information about topics and subtopics described by the plurality of text documents, each document being represented by a multi-dimensional glyph, the displaying including sorting the glyphs into groups and arranging the groups into clusters, and deriving centroids of clusters and down-projecting the centroids, such that clusters containing documents that are conceptually similar are located together in near proximity. |
20130121448 | 13742270 | 0 | 1. A method of generating channel estimates for a received signal that is hard-limited based on phase samples of the received signal, said method comprising: computing expected amplitude values for the received signal based on the phase samples; and computing revised channel estimates based on the expected amplitude values and the phase samples. |
20140282133 | 14155131 | 0 | 1. A method of operating a data processing system comprising a control screen to provide control of a program, said method comprising: providing a first program graphical user interface (GUI) comprising a first GUI description and a first method for operating on data input to or data output from that said first program GUI; providing a second program GUI comprising a second GUI description and a second method for operating on data input to or data output from that said second program GUI; providing a runtime library having said first and second methods; and causing said data processing system to combine said first GUI description and said second GUI description to provide a compound GUI without recompiling said runtime library. |
8200538 | 11214326 | 1 | 1. A method comprising: capturing via a wireless communication device and in response to actions of a user, a digital image of a three-dimensional product having visually recognizable packaging; displaying the digital image of the three-dimensional product to the user on a display device of the wireless communication device; interacting with the user to select the digital image; displaying an object class menu on the display device of the wireless communication device, the object class menu having a plurality of object classes including a person class, a product class and an event class; interacting with the user via the wireless communication device to select the product class from the object class menu, the product class indicating that the digital image includes a product; transmitting the digital image from the wireless communication device to a server system; recognizing the three-dimensional product in the digital image via the server system, based on the recognition of the visually recognizable packaging and not based on the recognition of an optical code; displaying a task menu on the display device of the wireless communication device, the task menu including a plurality of tasks that are based on the selection of the product class; performing at least one task of the plurality of tasks selected in response to interaction of the user with the task menu of the wireless communication device, the at least one task including: retrieving product information relating to the three-dimensional product; retrieving purchase information relating to the three-dimensional product; retrieving product delivery information relating to the three-dimensional product; displaying the product information, the purchase information, and the product delivery information on the wireless communication device; and facilitating the purchase of the three-dimensional product via the wireless communication device. |
9032413 | 13224168 | 1 | 1. A method of controlling resource consumption by a background component that consumes resources when executed, the method comprising: detecting an occurrence of a trigger; identifying a brokered event associated with the trigger based upon a data structure comprising one or more entries corresponding to one or more registered triggers; determining whether one or more conditions specified for the brokered event are satisfied; responsive to determining that the one or more conditions are satisfied, determining whether one or more broker limitations applicable to the brokered event are satisfied; responsive to determining that the one or more broker limitations are satisfied, signaling the brokered event, where the background component is executed responsive to the signaling. |
9619734 | 14837628 | 1 | 1. A land classification system operable for analysis of very high resolution (VHR) remotely-sensed multispectral Earth imagery, comprising: an image store containing image data corresponding to VHR remotely-sensed multispectral Earth images; at least one feature extraction module in operative communication with the image store, the feature extraction module being operable to produce feature data regarding at least a portion of image data; a feature stack comprising the image data and the feature data; a client interface operable to receive training data regarding one or more pixels of the image data from a user regarding a land class to which the one or more pixels belong, wherein the land class is selected from a plurality of pixel-level land classes; a classification compute module operable to generate a classification model at least in part based on a portion of the feature stack corresponding to the one or more pixels and the training data, wherein the classification model relates to classification of pixels of image data into one of the plurality of pixel-level land classes, wherein the classification compute module is operable to apply the classification model to the image data to classify each pixel of the image data into a respective one of the plurality of pixel-level land classes based on an analysis of the feature stack in relation to the classification model; and a post classification analysis module operable to reclassify at least one pixel of the image data, that has been classified by the classification compute module into a first pixel-level land class of the plurality of pixel-level land classes, into a second pixel-level land class of the plurality of pixel-level land classes different than the first pixel-level land class based on at least one post classification rule, wherein the post classification rule is not the same as the classification model and utilizes classification information regarding at least one other pixel to reclassify the at least one pixel from the first pixel-level land class into the second pixel-level land class. |
8224861 | 12453907 | 1 | 1. A coupled node tree splitting method, which is executed by a computer, for splitting a coupled node tree being used in a bit string search and having a root node as a starting point of the tree and node pairs which are configurational elements of the tree and which are two nodes, a primary node and a secondary node, arranged in adjacent areas of storage, wherein the nodes have an area that holds a node type, which indicates whether the node is a branch node or a leaf node, and the branch node having, in addition to the node type, an area that holds a discrimination bit position of a search key with which a bit string search is performed and an area holding position information that indicates a position of a primary node of a node pair that is a link target, but not having an area holding an index key composed of a bit string that is an object of searches, and the leaf node having, in addition to the node type, an area holding the index key composed of a bit string that is the object of searches but not having an area that holds a discrimination bit position of the search key nor an area holding the position information that indicates the position of a primary node of a node pair that is a link target, the method comprising: a step of obtaining a split key that establishes an index key that splits a processing source coupled node tree that is to be split; a processing source minimum value or maximum value obtaining step that determines a minimum value or a maximum value of the index keys of the processing source coupled node tree, by performing sub-steps of a search-start-node read-out sub-step obtaining position information indicating a position of the root node of the processing source coupled node tree as a searching start node and reading out the searching start node by means of the position information indicating the position of the searching start node, a node type determination sub-step reading out the node type from the area that holds the node type of the node and determining whether the node type indicates a leaf node or a branch node, an index key read-out sub-step reading out the index key from the area in the leaf node holding the index key, a link sub-step reading out the position information indicating the position of a primary node of a node pair that is a link target from the area holding the position information indicating the position of the primary node of a node pair that is a link target, and reading out as a link target node only the primary nodes stored in the area indicated by the position information indicating the primary node of the node pair of the link target that is read out, or reading out as the link target node only the secondary nodes stored in the area the position whereof obtained by a calculation based on the position information indicating the primary node of the node pair of the link target that is read out, and wherein making, by the node type determination sub-step, a determination of the node type of the searching start node read out by the search-start-node read-out sub-step, and if the node type indicates a leaf node, reading out, by the index key read-out sub-step, the index key from the leaf node, and if the node type indicates a branch node, processes of reading out reading out the link target node by the link sub-step and the determination of the node type, by the node type determination sub-step, of the link target node read out are repeated, until the node type indicates a leaf node, and reading out, by the index key read-out sub-step, the index key from the leaf node, and obtaining an index key stored in the leaf node read out in the index key read out sub-step as a search result key, which is a minimum or maximum value of the index keys of the processing source coupled node tree; a comparing step of comparing the split key with either the minimum value or the maximum value and, if the minimum value is larger than the split key or if the maximum value is smaller than the split key, ending processing; a generating step of, if the result of the comparison is that the minimum value is not larger than the split key or the maximum value is not smaller than the split key, inserting the minimum value or maximum value index key, so as to generate a new processing target coupled node tree; a deleting step of deleting the minimum value or maximum value index key from the processing source coupled node tree; and wherein by making the processing source coupled node tree from which has been deleted the minimum value or maximum value index key into a new processing source coupled node tree, the processing source minimum value or maximum value obtaining step, the comparing step, the generating step, and the deleting step are repeated until the minimum value or maximum value obtained by the processing source minimum value or maximum value obtaining step becomes larger than or smaller than the split key respectively. |
20040236792 | 10879331 | 0 | 1. An information management method comprising steps of: assigning a first user a unique user identifier; storing information related to the first user in a remote database operatively coupled to a remote device; and enabling a second user to access the remote database over a wireless network using a second device to retrieve the information related to the first user by retrieving the unique user identifier. |
20100058350 | 12203329 | 0 | 1. A system for dynamically shifting compute workloads among data center sites based on real-time energy costs, comprising: a) an evaluator to determine potential energy consumption for a compute task; b) criteria to determine which of the data center sites provides the most favorable real-time energy costs; and c) a workload dispatcher to forward the compute task to a given data center site based upon the determination of the most favorable real-time energy costs. |
9973287 | 15218886 | 1 | 1. A clock generation circuit, comprising: a random number generator configured to generate random numbers according to a first probability distribution; a filter configured to output random numbers according to a second probability distribution, based on the random numbers according to the first probability distribution input thereto; and a variable delay circuit configured to modulate a clock signal input thereto by delaying edges of the clock signal by amounts corresponding to values of the random numbers according to the second probability distribution, wherein probability of a smallest number according to the second probability distribution is smaller than probability of the smallest number according to the first probability distribution, and probability of a largest number according to the second probability distribution is smaller than probability of the largest number according to the first probability distribution. |
20070124427 | 11517663 | 0 | 1. A portable status sentry comprising: a portable memory device; an interface adapted for connecting the portable memory device to a computing device; and auto-run instructions, wherein the auto-run instructions are executed by the computing device when the portable memory device is installed in the computing device, wherein the auto-run instructions comprise status instructions, and wherein upon execution of the status instructions the computing device is adapted for: accessing a query network; acquiring status data from a status file accessible to the query network and associated with a monitored device; and processing the status data to produce a status measure relating to a status of the monitored device. |
7623785 | 11617244 | 1 | 1. A method for DWDM network planning, the method comprising: determining a highest aggregate demand from among a set of demands associated with a region of interest; determining a total number of lightpaths at discrete line granularities beginning with the highest aggregate demand; determining a DWDM network topology comprised of a plurality of nodes and one or more wavelengths extending between the nodes based on the total number of lightpaths at discrete line granularities; routing lightpaths along the wavelengths extending between the plurality of nodes based at least on predetermined decision criteria; routing demands onto tributaries extending along the lightpaths based at least on predetermined guidelines; determining node-related hardware parameters based at least on a predetermined routine; calculating a cost associated with the node-related hardware parameters; and outputting the node-related hardware parameters and the associated cost. |
20070208734 | 11680548 | 0 | 1. A method of improving link scores in a secure search system, comprising: receiving a query from a user of the secure search system; running the query against a plurality of secure data sources and obtaining search results for the query; populating a table with the search results, the populating excluding search results mapped to same host links; and calculating a link score for each search result and sorting the scored search results in the populated table by link score; and returning the sorted search results to the user in response to the query. |
20070006190 | 11518573 | 0 | 1. A method for dynamically integrating a business logic rule into an application, the method comprising the steps of: stating the business logic rule as an expression in a functional language that utilizes defined operators, functions and keywords, and parameters that correspond to lookup fields in an associated database; parsing the expression to produce an executable routine; and providing the executable routine to the application. |
20090092139 | 12287209 | 0 | 1. A method for communications network based passive delivery of time sensitive scheduling data to an entity, the method comprising: aggregating time sensitive scheduling data from multiple originating organizations, affiliated groups of individuals, and individuals that create specific time sensitive scheduling data streams; sending via a passive delivery communications network specific time sensitive scheduling data from originating organizations, affiliated groups of individuals, and individuals; transmitting via the passive delivery communications network the specific time sensitive scheduling data streams aggregated from multiple originating organizations, affiliated groups of individuals, and individuals to an entity based on desirability and relevancy of high utility time sensitive scheduling data; receiving via the passive delivery communications network specific time sensitive scheduling data from originating organizations, affiliated groups of individuals, and individuals; and accommodating passive delivery of time sensitive scheduling data to the entity based upon derived interests of the entity via a time sensitive scheduling data receiving device. |
9794199 | 15166479 | 1 | 1. A computer-implemented method of operating a chatbot to engage in an automated conversation with a correspondent, the method comprising: providing a chatbot having a conversation data structure comprising a plurality of conversation paths, each conversation path in the plurality of conversation paths comprising a plurality of nodes, each node having coded instructions that are processed to instruct an interpretation engine to perform an operation as part of the conversation path; receiving an input message from the correspondent; based on the received input message, building a profile having plural profile variables for the correspondent representing characteristics of the correspondent; and during the conversation, or a future conversation with the correspondent, selecting a node of a conversation path in the plurality of conversation paths in the conversation data structure for processing based on the one or more profile variables of the profile for the correspondent, and processing, by the interpretation engine, the selected node to follow a conversation path corresponding to the selected node based on the node's coded instructions. |
20110081002 | 12947643 | 0 | 1. A method for four-dimensional (4D) intensity modulated radiation therapy (IMRT) planning for motion compensated treatments, comprising: creating a deliverable IMRT treatment plan for a tumor in irregular periodic motion, said irregular period of motion comprising a plurality of phases, said treatment plan comprising treatment plans for each of said plurality of phases, each said treatment plan being delivered using a multi-leaf collimator, leaf positions of said multi-leaf collimator being adapted separately for each respective phase and for each of a plurality of beam positions, the beam being collimated by said multi-leaf collimator. |
7576278 | 10980294 | 1 | 1. A song search system that searches for desired song data from among a plurality of song data stored in a song database, the song search system comprising: a song-data-input means of inputting said song data; a characteristic-data-extraction means of extracting physical characteristic data by performing a Fast Fourier Transform on a set frame length and by calculating the power spectrum from song data input by said song-data-input means; an impression-data-conversion means of converting the physical characteristic data extracted by said characteristic-data-extraction means into impression data determined by human emotion; a memory-control means of storing impression data converted by said impression-data-conversion means in a song database together with song data input by said song-data-input means; a keyword set means of setting song data to correspond to one or more keywords; a song-mapping-display means of displaying a song map comprised of neurons each representing song data; a keyword-display means of displaying the one or more keywords corresponding to particular song data when the neuron representing the particular song data displayed on said song-mapping-display means is clicked on; an impression-data-input means of inputting impression data as search conditions; a song search means of searching said song database based on impression data input from said impression-data-input means and the one or more keywords; and a song-data-output means of outputting song data found by said song search means, wherein said impression-data-conversion means uses a pre-learned hierarchical-type neural network to convert characteristic data extracted by said characteristic-data-extraction means to impression data determined according to human emotion. |
20180103106 | 15839814 | 0 | 1. A computing device comprising: an interface configured to interface and communicate with a dispersed or distributed storage network (DSN); memory that stores operational instructions; and processing circuitry operably coupled to the interface and to the memory, wherein the processing circuitry is configured to execute the operational instructions to: identify one or more slice errors associated with first one or more storage units (SUs) of a first storage set that distributedly store a set of encoded data slices (EDSs) associated with a data object and second one or more SUs of a second storage set, wherein the data object is segmented into a plurality of data segments, wherein a data segment of the plurality of data segments is dispersed error encoded in accordance with dispersed error encoding parameters to produce the set of EDSs, wherein a decode threshold number of EDSs are needed to recover the data segment; determine one or more usage priority levels of at least one of the first one or more SUs of the first storage set or the second one or more SUs of the second storage set based on the one or more slice errors that are detected, wherein at least one of the second one or more SUs of the second storage set also stores at least one EDS of the set of EDSs; produce a selected storage set from the first one or more SUs of the first storage set and the second one or more SUs of the second storage set based on a more favorable usage priority level of the one or more usage priority levels of the at least one of the first one or more SUs of the first storage set or the second one or more SUs of the second storage set; and facilitate execution of data access to at least the decode threshold number of EDSs based on the selected storage set. |
20120054019 | 13221851 | 0 | 1. A computer-implemented method of attributing a plurality of conversion events to a plurality of media events, the method comprising: determining a first demographic and psychographic profile for each of a plurality of media events; determining a second demographic and psychographic profile for each of a plurality of customers corresponding to the plurality of conversion events; comparing the first demographic and psychographic profiles with the second demographic and psychographic profiles to determine a most likely media channel and media event that generated each of the conversion events. |
20020103747 | 09772427 | 0 | 1. A computer-implemented method for managing risk related to financial transactions involving a politically identified person, the method comprising: receiving information relating to political exposure associated with a person involved in a financial transaction; structuring the information received according to political exposure risk quotient criteria; and calculating a risk quotient using the structured information. |
9235321 | 13677256 | 1 | 1. A computer-implemented method comprising: displaying a first content item on a screen of a computing device, the first content item occupying the entire screen and comprising an icon representing a second content item; and in response to a first user input comprising a swiping gesture input on the displayed icon representing the second content, displaying a first animation sequence depicting the icon opening up by unfolding the icon at a speed that is directly based on a speed of the swiping gesture to reveal the second content item, wherein the unfolding gradually unfolds the icon similar to how a piece of folded paper unfolds such that the first content item on an outside of the icon appears to lift up and rotate around a crease and gradually disappear out of sight while gradually revealing the second content item initially beneath and hidden by the first content item, the second content item eventually replacing the first content item and occupying the entire screen. |
20130290367 | 13456064 | 0 | 1. A non-transitory computer-readable medium storing instructions for executing a stream data processing method that receives stream data input information as primary information and generates secondary information by acquiring primary information within a predetermined period from among the received primary information, the instructions comprising: managing a plurality of target functions, each of the plurality of target functions relating a first type of processing function from a plurality of first type of processing functions to a second type of processing function from a plurality of second type of processing functions; selecting a target function from the plurality of target functions based on a query; and executing the first type of processing function and the second type of processing function on the acquired primary information to generate the secondary information, based on the selected target function. |
20060082571 | 11111168 | 0 | 1. A method, comprising: receiving an indication of graphical input data; simplifying one or more segments of the graphical input data; grouping the simplified segments of the graphical input data to form one or more spine lines; creating one or more framework objects for one or more portions of the spine lines; identifying joins between the one or more framework objects; and grouping the one or more portions of the spine lines into recognizable structures. |
9857936 | 15243857 | 1 | 1. A system for sharing a physical display screen among a plurality of applications on a mobile platform, comprising: a processor; and memory, the memory storing instructions that, when executed by the processor, cause the processor to: host a plurality of running applications on the mobile platform; receive in a first application of the plurality of running applications, information associated with an application feature for a second application of the plurality of running applications; determine a portion of a background of the first application that overlays a location of the application feature for the second application and render transparent the determined portion of the background of the first application to allow the application feature for the second application to show through via the physical display screen; launch a third application; and adjust a size of the application feature of the third application such that the application feature of the third application does not overlay a location of the application feature for the second application; render transparent an application feature of the first application until an event is registered for the first application; and responsive to the event, render non-transparent the application feature of the first application for a determinant period of time. |
9055124 | 13527450 | 1 | 1. A system for caching network resources, the system comprising: one or more processors; a computer-readable memory; and a module residing in the computer-readable memory and executed by the one or more processors, the module, when executed, configured to: service a request for a network resource, wherein servicing the request comprises retrieving a responsive copy of the network resource from a content provider; determine, based at least in part on a plurality of previously serviced requests for the network resource, whether the network resource is cacheable, wherein the plurality of previously serviced requests are originally obtained from a plurality of client devices, and wherein determining whether a network resource is cacheable comprises computing a checksum for at least two responsive copies and determining whether the computed checksums are equivalent; retrieve a copy of the network resource from a content provider independent of the system, wherein data associated with the copy does not indicate that the copy is cacheable; modify the data associated with the copy to indicate that the copy is cacheable; cache the copy in a shared cache; and respond to requests for information regarding the cached copy. |
9898397 | 15079092 | 1 | 1. A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to perform a method comprising: detecting a request for status information relating to a particular deployment pattern; querying, in response to the request for status information, a deployment pattern registry for deployment configuration information about the particular deployment pattern; testing deployment capabilities for the particular deployment pattern by: verifying that installation files for the particular deployment pattern are accessible; identifying one or more candidate deployment components for a hypothetical deployment of the particular deployment pattern; installing, on the one or more candidate deployment components, a virtual machine that is configured to test computing resources of the one or more candidate deployment components; and receiving test results regarding the computing resources of the one or more candidate deployment components; and generating a notification in response to detecting a failure in the test results. |
20110282997 | 13078899 | 0 | 1. A method in a proxy server for responding to resource unavailable errors, comprising: receiving, from a client device, a request for a network resource hosted at an origin server for a domain, wherein the request is received at the proxy server as a result of a DNS (Domain Name System) request for the domain resolving to the proxy server, and wherein the origin server is one of a plurality of origin servers that belong to different domains that resolve to the proxy server and are owned by different entities; requesting the network resource from the origin server; receiving a response from the origin server that indicates that the network resource is unavailable; and transmitting a custom error page to the client device that indicates that the requested resource is unavailable. |
20100332806 | 12495025 | 0 | 1. A unified microprocessor pick queue comprising: control circuitry; and an array configured to dynamically allocate an entry of a plurality of entries for an instruction, wherein each entry of said entries comprises for a given instruction a separate dependency bit for each other instruction in the array, wherein each dependency bit indicates whether the given instruction depends on a result of a corresponding other instruction; wherein during each pipe stage prior to resolving a speculative load instruction, the circuitry is configured to: determine whether each entry of the plurality of entries corresponds to an instruction dependent upon the load instruction, based at least in part on said separate dependency bits and a dependency vector corresponding to the load instruction; and update the dependency vector. |
9305065 | 13457361 | 1 | 1. A method comprising: receiving a query statement specifying a count distinct; generating a data flow graph comprising a plurality of nodes for executing the query, the nodes providing for a plurality of aggregation operations generating join attributes for the plurality of aggregation operations, sorting each result of the plurality of aggregation operations on the join attributes, and calculating a count distinct of a plurality of intermediate result from the plurality of aggregation operations based on key figures of the aggregation operations, by vertically appending columns of count distinct results with intermediate results from at least one of the aggregation operations; wherein the vertically appending operation takes a first input table comprising a plurality of columns including a count distinct result and a second input table comprising a plurality of columns from the intermediate results from the at least one of the aggregation operations, wherein the first and second input table have no common columns, and generates a result table comprising all of the columns from the first table and second table; calculating two or more count distinct key figures-in parallel; and wherein each of the one or more aggregation operations provides a view across two or more attributes with each attribute being sorted in a separate column; and initiating executing of the query using the data flow graph. |
20060277162 | 11143137 | 0 | 1. A signal bearing medium tangibly embodying a program of machine-readable instructions executable by a digital processing apparatus to perform operations to condense reported log data, the operations comprising: an operation to receive a query expression; an operation to read a log record from a file; an operation to parse the log record into entries; an operation to apply the query expression to each entry; and an operation to generate a condensed log record comprising entries that satisfy the query expression. |
20130332475 | 13491612 | 0 | 1. A computer-implemented method for transforming data, the computer-implemented method comprising performing computer-implemented operations for: obtaining, at a computing device, data comprising a plurality of data elements; analyzing the data to identify relationships between the plurality of data elements; determining a world defining a visualization model to apply to the plurality of data elements based, at least partially, upon the relationships; obtaining rules for applying the data to the world; and applying the rules to the data to generate output comprising the at least one of the plurality of data elements arranged according to the world. |
20150170398 | 13466612 | 0 | 1. A method for simplifying a texture of a three-dimensional model, comprising: (a) simplifying, with one or more computing devices, a first three-dimensional model to determine a second three-dimensional model, the first three-dimensional model having a higher resolution than the second three-dimensional model, the first three-dimensional model having a first texture atlas associated therewith that corresponds to a mapping of color onto at least a portion of a three-dimensional surface of the first three-dimensional model; (b) allocating, with the one or more computing devices, a second texture atlas for the second three-dimensional model; and (c) filling in, with the one or more computing devices, the second texture atlas for the second three-dimensional model such that the second texture atlas corresponds to a mapping of color onto at least a portion of a three-dimensional surf ace of the second three-dimensional model, wherein the filling in the second texture atlas (c) comprises: (d) determining, with the one or more computing devices, a location on the second three-dimensional model corresponding to a pixel in the second texture atlas for the second three-dimensional model; (e) determining, with the one or more computing devices, a ray extending from the location on the second three-dimensional model determined in (d) to a corresponding location on the first three-dimensional model; (f) determining with the one or more computing devices, an intersection of the ray and the first three-dimensional model; (g) determining, with the one or mere computing devices, a color value texture mapped to the first three-dimensional model at the intersection determined in (f) based on the first texture atlas; and (h) setting, with the one or more computing devices, the color value determined in (g) to the pixel in the second texture atlas for the second three-dimensional model. |
4853872 | 06782901 | 1 | 1. A method for executing a program in a computer system including a plurality of computers which operate under different loads at different times, said computers being capable of executing a plurality of first common object codes, and at least a first one of said computers being capable of executing second object codes which are unexecutable in at least one of the other computers, wherein the method comprises the steps of: (a) compiling, by means of one of the computers, a source program into an object program comprised of: (i) a first object program section comprised of said first common object codes and corresponding to a section of the source program which is not executable by said second object codes in said first one of said computers; (ii) at least one group of second object program sections respectively to be executed by respective computers and corresponding to a same section of said source program which is executable by said second object codes by said first one of said computers, one of said second object program sections to be executed by said first computer including said second object codes for said first one of said computers; (iii) at least one third object program section which is comprised of said first object codes, and detects, at an execution of said object program by the computer system, which one of said computers is selected so as to execute said object program and selects one of said second object program sections corresponding to said detected computer; (b) selecting, one of said computers which is to execute the object program, by means of execution of a scheduling program preloaded in a predetermined one of said computers; and (c) executing said object program by said selected computer, whereby said first and third object program sections and one of said second object program sections corresponding to said selected computer are executed; wherein said selection of said selected computer for executing said object program is effected such that one of said computers which has a load lower than any other of said computers in the system is selected. |
20140067768 | 14014296 | 0 | 1. An apparatus, comprising: a processor adapted to execute executable instructions; a data entity establisher instantiated on said processor, said data entity establisher comprising executable instructions adapted for establishing a data entity comprising at least one of a group consisting of an augmented reality entity and a virtual reality entity; a state establisher instantiated on said processor, said state establisher comprising executable instructions adapted for establishing a state for said data entity, said state comprising: a state time; a plurality of state properties at least substantially corresponding to properties of said data entity substantially at said state time, said plurality of state properties comprising a state spatial arrangement of said data entity; a data store in communication with said processor; a storer instantiated on said processor, said storer comprising executable instructions adapted for storing in said data store said data entity and said state so as to enable output of said data entity to at least one of an augmented reality environment and a virtual reality environment with said data entity exhibiting at least one of said plurality of state properties as at said state time, said output of said data entity being at an output time substantially different from said state time. |
9947043 | 12501978 | 1 | 1. A method comprising: creating, by a processing device, a graphical user interface (GUI) to present a questionnaire comprising a set of questions and a user interface, wherein the user interface provides an input interface for a user to input one or more answers for the set of questions; displaying a first question in the set of questions via the GUI; receiving, by the processing device, a first response to the first question via the user interface; generating, by a rule engine of the processing device, a logic tree comprising nodes and branches, each of the nodes representing a question in the set of questions and each of the branches representing a response to a question in the set of questions; storing, by the rule engine, the logic tree in a working memory of the rule engine; identifying a node of the nodes in the logic tree correlating to the first response, the node comprising a follow-up question; removing a portion of the logic tree stored in the working memory corresponding to a second node in the logic tree connected to a branch of the branches representing a second response that is not received via the GUI, wherein the removing the portion of the logic tree from the working memory increases available memory space of the working memory; modifying, by the processing device, the GUI to present the follow-up question within the questionnaire; modifying, by the processing device, the user interface to receive an answer from the user in view of the follow-up question; and displaying the GUI and the user interface, as modified, via a display device. |
7725376 | 11190638 | 1 | 1. An apparatus comprising: a processor configured to define a plurality of independent component markets for a good, wherein for each of the component markets, the processor being configured to define the component market includes being configured to: determine a price sensitivity probability distribution of a price per unit of the good, the price sensitivity probability distribution assigning a respective probability to each of a plurality of different predetermined prices per unit of the good, the price sensitivity probability distribution reflecting an uncertainty in the price per unit of the good, and determine a market potential probability distribution of a number of units of the good in the component market, the market potential probability distribution assigning a respective probability to each of a plurality of different numbers of units of the good, the market potential probability distribution reflecting an uncertainty in the number of units of the good in the component market, wherein the processor is also configured to generate a model of at least one of demand or supply for the good in an aggregate market formed of the component markets, the processor being configured to generate the model of at least one of demand or supply for the good in the aggregate market from the price sensitivity probability distributions and market potential probability distributions of the component markets, wherein a model of demand reflects a dependence between a quantity of the good demanded by consumers and a price per unit of the good in the aggregate market, and a model of supply reflects a dependence between a quantity of the good supplied to consumers and a price per unit of the good in the aggregate market. |
8532196 | 12883816 | 1 | 1. A decoding device comprising: a storage section which stores control information, the control information showing a progress state of process stages for a decoding process as to a plurality of processing data included in coded data; a control section which allocates process stages corresponding to executable processing data which is executable in parallel, to at least one processor on the basis of the control information, a dependence relation between the processing data in the decoding process, and a dependence relation between the process stages; and a decoding processing section which parallelly executes allocated process stages corresponding to the executable processing data, wherein: the decoding processing section comprises a syntax analysis, an entropy decoding process, an inverted quantization process, an inverted DCT process, a motion vector prediction process, a filter boundary intensity determination process, a motion compensated/weighed prediction process, an in-screen prediction process, a deblocking-filter process, and an output determination process; the syntax analysis is included in a first stage; the entropy decoding process is included in a second stage; the inverted quantization process is included in the second stage or a third stage; the inverted DCT process is included in the second stage or the third stage; the motion vector prediction process is included in the third stage; the filter boundary intensity determination process is included in the third stage or a fifth stage; the motion compensated/weighed prediction process and the in-screen prediction process are included in a fourth stage; the deblocking-filter process is included in the fifth stage; the output determination process is included in a sixth stage; the first stage executes processes in series; the second stage can parallelly execute in a unit of slice, the second stage being synchronized with the first stage in a unit of slice and the third stage in a unit of macroblock; the third stage is synchronized with the fourth stage in a unit of macroblock; the fourth stage is synchronized with the fifth stage in a unit of macroblock; and the fifth stage is synchronized with the sixth stage in a unit of slice. |
20090083522 | 12209561 | 0 | 1. A system comprising: a Reduced Instruction Set Computer (RISC) processor adapted to, responsive to a received request to process a Boolean operation, execute a single processor data access instruction addressed to a region of a memory-mapped register corresponding to said Boolean operation. |
9569476 | 13855364 | 1 | 1. A method for routing data to storage comprising: receiving a request from a user to store a file; determining implicit metadata from explicit metadata received with the request, the implicit metadata including data type, data size, confidentiality type, legal type, location type, access type, user type and device type; accessing a registry of storage resources; determining a storage resource based on the explicit metadata, the implicit metadata, and the registry of storage resources, wherein the registry of storage resources includes information describing characteristics of available storage resources and the determining comprises comparing the implicit metadata and the explicit metadata to the characteristics of the available storage resources, wherein the characteristics of the available storage resources are regularly updated, and wherein the explicit metadata comprises information provided by the file to be stored and information provided by the user in the request; routing data of the file to the determined storage resource; re-determining whether the determined storage resource is suitable to store the data of the file based on the implicit metadata; and dynamically provisioning an additional storage resource to store the data of the file based on the implicit metadata when the determining or re-determining determines that the determined storage resource is not suitable wherein the determining implicit metadata and the determining the storage resource are performed by a computing device comprising at least one processor. |
10067832 | 15283241 | 1 | 1. A method of accessing data in a dispersed storage network, the dispersed storage network including a plurality of dispersed storage units, the method comprising: dispersed storage error encoding a data segment to produce a set of encoded data slices; sending a first slice write request for receipt by a first dispersed storage unit of the plurality of dispersed storage units, the first slice write request including a first slice name corresponding to the first dispersed storage unit and a first data slice of the set of encoded data slices, wherein the first data slice includes a first information dispersed algorithm index of the first dispersed storage unit; and sending a second slice write request for receipt by a third dispersed storage unit of the plurality of dispersed storage units when a second dispersed storage unit of the plurality of dispersed storage units is unavailable, the second slice write request including a second slice name corresponding to the third dispersed storage unit and a second data slice of the set of encoded data slices, wherein the second data slice includes a second information dispersed algorithm index of the second dispersed storage unit. |
9972309 | 15229368 | 1 | 1. A method comprising: identifying, via a processor configured to perform speech analysis, an identity of a user based on characteristics of received speech during a dialog between the user and a dialog system, to yield a user identification; generating a personalized natural language generation model based on a stylistic analysis on a literary narrative and the user identification, wherein the stylistic analysis identifies connections between two or more of a personality independent quotation lattice, personality independent attributes, personality dependent attributes, and speakers within the literary narrative; and applying the personalized natural language generation model while performing, as part of the dialog, one of automatic speech recognition or natural language generation. |
8356030 | 13163623 | 1 | 1. A method of constructing a domain-specific sentiment classifier for classifying sentiment expressed by documents in a specified domain, comprising: scoring sentiments expressed by one or more domain-specific documents, the scoring comprising: determining that one or more of the domain-specific documents include an n-gram, calculating a score for the n-gram included in the one or more domain-specific documents, and calculating a sentiment score for the one or more domain-specific documents based on the score for the n-gram included in the documents; creating a domain-specific sentiment lexicon based at least in part on said scoring sentiments expressed by one or more domain-specific documents; generating the domain-specific sentiment classifier based on the domain-specific sentiment lexicon; and storing the domain-specific sentiment classifier. |
8582774 | 10506851 | 1 | 1. A method for operating an electronic system to secure a multi-round cryptographic calculation procedure wherein each round is performed using a round-operation that uses a secret key and an encryption function f or a replacement thereof, the method comprising operating the electronic system to: determine a sequence of round-operations selected from a set of round-operations including round-operations performing a function p selected from the set of functions f, a masking operation followed by f, and f followed by an unmasking operation, and defined by whether each input of the round-operation has an input-type of masked or unmasked, respectively, and at least one output having an output-type of masked or unmasked depending on the input-types for the inputs, respectively, and the function p; wherein the sequence of round-operations is selected such that for two sequential rounds i and i+1, each output from round i serves as an input to round i+1 and the output-type for each output from round i matches the input-type for the corresponding input to round i+1; and execute the determined sequence of rounds. |
10013673 | 15155164 | 1 | 1. A computer implemented method for maintaining a custodian directory, the method comprising: extracting, by a processor, identity information from a document, the identity information including a custodian identity attribute; determining that the identity information is associated with a first custodian; determining whether the first custodian is in a custodian directory by searching for the custodian identity attribute in the custodian directory; creating, in response to determining that the first custodian is not in the custodian directory, a new entry for the first custodian in the custodian directory, the new entry including the identity information; updating, in response to determining that the first custodian is in the custodian directory, an entry for the first custodian in the custodian directory using the extracted identity information; and carrying out a cleanup of the custodian directory by: identifying two or more entries in the custodian directory that have at least one matching custodian identity attribute; determining a weighting factor for each field in the custodian directory, wherein the weighting factor for each respective field is based on a likelihood that the custodian identity attribute for the respective field is unique to a single custodian; generating a relationship score for the two or more entries by comparing the identity information in the two or more entries and using the weighting factors, the relationship score being a numeric score that indicates a level of similarity between the two or more entries; determining that the relationship score exceeds a confidence threshold; determining, based on the relationship score exceeding the confidence threshold, that all of the two or more entries in the custodian directory relate to a particular custodian; and merging, in response to determining that all of the two or more entries relate to the particular custodian, the two or more entries in the custodian directory. |
20040003355 | 10166924 | 0 | 1. A method for implementing a configurable state machine, comprising the steps of: determining a state machine diagram for a desired state machine; allocating a RAM variable for an input word; assigning transition condition bits in said input word; implementing an input word processing function; allocating a state machine workspace structure in RAM; configuring said state machine by creating a list of states and corresponding constant values and allocating and populating a state machine configuration structure; calling, at initialization, a configurable state machine initialization function passing an address of said state machine configuration; and calling periodically a configurable state machine processing function passing said address of said state machine configuration. |
8195641 | 12106349 | 1 | 1. A method for authoring an updated database query by a user modifying a view of the results of a database query, the method comprising: generating the view of the results of the database query; providing a user interface for the user to modify the view of the results of the database query to define results of the updated database query, wherein modifying the view of the results of the database query comprises modifying an order of one or more fields shown in the view by dragging the one or more fields to indicate the order, adding a field from a table in the database to the view by dragging the field from the table to the view, filtering the view by indicating at least one field for filtering a plurality of records of the view, and further comprises adding one or more fields in a second table to the view; in response to modifying the view of the results of the database query and adding one or more fields in the second table to the view, generating a query definition based on a modification of the view of the results, wherein the query definition reflects a database join operation for adding the one or more fields in the second table; and running the generated query definition on a database to perform the updated database query. |
8056009 | 09873163 | 1 | 1. In a machine vision system having a plurality of distinct and separate vision processors (VPs), each VP being on a respective VP computing platform, and at least one distinct and separate machine vision user interface (UI), the at least one distinct and separate machine vision UI being on a respective distinct and separate machine vision UI computing platform, a method for instructing a machine vision UI in communication with a first distinct and separate VP to establish communication with a second distinct and separate VP, the method comprising: providing a first distinct and separate VP with a link function, the first distinct and separate VP being on a first respective distinct and separate VP computing platform connected to a network, the link function being a control function executable by the first distinct and separate VP, the link function being both for enabling a user to configure any second distinct and separate VP connected to the network using the at least one distinct and separate machine vision UI on a respective distinct and separate machine vision UI computing platform connected to the network, and for establishing communication via the network between the any second distinct and separate VP of the plurality of VPs and the at least one distinct and separate machine vision UI on the respective distinct and separate machine vision UI computing platform, the any second distinct and separate VP being on a second respective distinct and separate VP computing platform, the communication via the network established by the link function enabling a continually updated image display on the at least one distinct and separate machine vision UI representing a current state of the any second distinct and separate VP connected to the network; executing the link function so as to issue instructions via the network from the first distinct and separate VP to the distinct and separate machine vision UI to establish communication via the network with the any second distinct and separate VP; and performing at least part of a machine vision task configured by the at least one distinct and separate machine vision UI, using at least one of the first distinct and separate VP and the any second distinct and separate VP, in accordance with the instructions issued by the first distinct and separate VP upon execution of the link function. |
8600165 | 12704792 | 1 | 1. A method for mark recognition in an image of an original document, comprising: a) receiving an image of an original document in which at least one designated field is provided for accepting a mark applied by a user; b) extracting a region of interest from the image which includes pixels, at least some of the pixels corresponding to the designated field; c) determining a center of gravity of the region of interest based on a distribution of black pixels in the region of interest; d) for each of a plurality of iterations: i) partitioning the region of interest into sub-regions of interest, based on the determined center of gravity, where at a subsequent one of the iterations, sub-regions generated at an immediately prior iteration serve as respective regions of interest; ii) for each of a plurality of the sub-regions of interest, extracting data from the sub-region of interest based on a distribution of black pixels in the sub-region of interest; e) generating a representation of the extracted region of interest based on the data extracted from the plurality of sub-regions of interest for at least one of the iterations; and f) based on the representation, assigning a mark recognition state to the region of interest. |
20140282605 | 14224523 | 0 | 1. A computer-implemented method for qualified checkpointing of a data flow model having a plurality of data flow operators and a plurality of links connecting the data flow operators, the method comprising: selecting a link of the plurality of links of the data flow model, based on a set of checkpoint criteria; generating a checkpoint for the selected link and by operation of one or more computer processors, wherein the checkpoint is selected from a plurality of different checkpoint types, wherein the generated checkpoint is assigned to the selected link; and executing the data flow model, wherein at least one link of the plurality of links of the data flow model has no assigned checkpoint. |
8280706 | 12869934 | 1 | 1. A simulator that simulates behaviors of a plurality of agents existing in a virtual space by distributed processing that uses a plurality of calculators communicable with one another, wherein at least two of the calculators are accessible to a space allocation storage that stores, as space allocation information, a division range of each of divided spaces in the virtual space, and a calculator to which processing related to an agent existing in each of the divided spaces is allocated, at least two of the calculators comprising: an allocation change candidate space extracting part that refers to the space allocation storage so as to extract, as an allocation change candidate space, a divided space to be a candidate for an allocation change from among divided spaces whose one or more adjacent spaces are allocated to another of the calculators; a communication amount estimating part that calculates an amount of communication or an amount of change in communication to be generated between the calculator targeted for the allocation and another of the calculators when the allocation change candidate space is allocated to a calculator targeted for the allocation, based on the number of agents existing in the allocation change candidate space and an adjacent divided space thereof; and a space allocation change judging part that determines whether or not to allocate the allocation change candidate space to the calculator targeted for the allocation, based on the amount of communication or the amount of change in communication calculated in the communication amount estimating part. |
20100331029 | 12626454 | 0 | 1. A method, comprising: identifying one or more associated transceivers; determining respective properties of the associated transceivers; and generating one or more configuration parameters to be utilized by respective associated transceivers in connection with management of events associated with the respective associated transceivers based on notifications provided between associated transceivers. |
20120259898 | 13080603 | 0 | 1. In a situation wherein at least one client has client processes to be implemented by at least one business process provider, each client process including documents to be processed and each client process defined by a client format in which the client receives data processed from the documents, each client format defined by client format fields, a method for facilitating the client processes, the method comprising a computer system performing the steps of: analyzing the client format fields instantiated in the documents; and automatically grouping the client processes into process platforms based on analysis of the instantiated client format fields. |
Subsets and Splits