doc_id
stringlengths 7
11
| appl_id
stringlengths 8
8
| flag_patent
int64 0
1
| claim_one
stringlengths 12
21.5k
|
|---|---|---|---|
9910868 | 14568386 | 1 | 1. A method comprising, by a computer system: selecting a plurality of indexes of a database table; receiving an indication of a set of index pairs in the plurality of indexes that are deemed to at least partially overlap; determining a degree of overlap between the indexes of each index pair of the set of index pairs; determining a suggested merge relationship between the indexes of each of the index pairs, wherein the suggested merge relationship is variable based, at least in part, on the degree of overlap, wherein, for at least one index pair of the set of index pairs, the indexes of the at least one index pair include some but not all of the same columns; generating an index model comprising interconnected index objects, the interconnected index objects representing the indexes of the index pairs, wherein interconnections between the interconnected index objects reflect the suggested merge relationship between the indexes of each index pair; outputting a graphical representation of the index model; allowing a user to graphically select index pairs to merge in a system-determined order, wherein the system-determined order is based, at least in part, on a type of each of the suggested merge relationships; merging the at least one index pair responsive to user authorization, the at least one index pair comprising a surviving index and a non-surviving index, the merging comprising adding, to the surviving index, columns of the non-surviving index that are missing from the surviving index; automatically updating the index model to reflect the merged at least one index pair; and automatically outputting an updated graphical representation of the automatically updated index model. |
20160224666 | 14611085 | 0 | 1. A search engine computing device comprising: one or more communication connections; one or more processors; and memory communicatively coupled to the one or more communication connections and the one or more processors, the memory storing a ranking algorithm and instructions that, when executed, configure the one or more processors to perform operations comprising: receiving a search query from a client device via the one or more communication connections; obtaining search results responsive to the search query based at least in part on the ranking algorithm, the search results including multiple entries; detecting potential bias in at least one entry of the multiple entries based at least in part on an authoritativeness of a caption of the at least one entry; modifying the search results to generate modified search results that at least partially compensate for the potential bias in the at least one entry; and outputting the modified search results via the one or more communication connections for presentation at the client device. |
7860883 | 11456194 | 1 | 1. A method for transferring data objects between federated entities in a federated computational environment, the computer-implemented method comprising: receiving a data object retrieval request from a first federated entity at a second federated entity, wherein the second federated entity issues artifacts for the first federated entity in accordance with a trust relationship between the second federated entity and the first federated entity, wherein services of the second federated entity are provided by a set of data processing systems within a distributed data processing system, and wherein each data processing system in the set of data processing systems generates artifacts; extracting an artifact from the data object retrieval request by a first data processing system in the set of data processing systems, wherein the artifact references a data object that is stored by the second federated entity; employing the artifact to retrieve the data object by searching among the set of data processing systems to locate a data processing system in the set that stores the data object, wherein the searching comprises: receiving a retrieval request from the first data processing system at a second data processing system, wherein the retrieval request contains the artifact; searching a local datastore of the second data processing system using the artifact; in response to a determination that the data object is stored within a local datastore of the second data processing system, sending a retrieval response from the second data processing system to the first data processing system, wherein the retrieval response contains the data object; and deleting the data object from a local datastore of the second data processing system; and returning a data object retrieval response from the first data processing system to the first federated entity. |
9824175 | 14806745 | 1 | 1. A method for automatically verifying validity of application of a refinement rule, the method comprising: using a processor, calculating a set of currently calculated values, each currently calculated value characterizing an element in a hierarchy of elements after a modification of a hardware emulation code, wherein an element at each level of the hierarchy is more broadly applicable than an element at a lower level, and storing the currently calculated values in a storage device, at least one of the elements including one or more unnamed entities; using the processor, comparing a currently calculated value of the set for a first element at a highest level of the hierarchy with a previously calculated value that is stored in the storage device and that characterized the first element at a previous time when a refinement rule that specifies an unnamed entity of said one or more unnamed entities that is excluded from test coverage was defined; determining that application of the refinement rule remains valid if the currently calculated value that characterizes the first element is the same as the previously calculated value that characterized the first element at the previous time; and if the currently calculated value that characterizes the first element is different from the previously calculated value that characterized the first element at the previous time: using the processor, comparing each currently calculated value that characterizes a lower level element at a lower level of the hierarchy with a corresponding previously calculated value that is stored in the storage device and that characterized that lower level element at the previous time to identify a change in an element of the lower level elements; and using the processor, determining whether the identified change, invalidates application of the refinement rule to that unnamed entity. |
9122800 | 14292473 | 1 | 1. A method of non-intrusively measuring a memory profile of a thread under test, the method comprising: executing a detection thread in parallel with the thread under test, the thread under test executed on a first core of a multi-core processor and the detection thread executed on a second core of the multi-core processor; generating a pattern of cache miss memory reads on the detection thread in order to access a memory shared by the first core and the second core; periodically obtaining read times in the detection thread indicating the amount of time taken to complete the cache miss memory reads generated on the detection thread; determining the memory profile of the thread under test based on the obtained read times of the detection thread; obtaining at least a second memory profile from at least a second thread; and with the memory profiles of the thread under test and the at least a second thread, determining how any two threads can be paired based on their memory access profiles; wherein pairing of the any two threads, comprises one of: pairing a memory intensive thread with another memory intensive thread, both having non-overlapping memory access profiles; pairing a memory intensive thread with a computational intensive thread; and pairing a memory intensive thread with an input/output intensive thread. |
20120066195 | 12882974 | 0 | 1. A method comprising: by one or more computing devices, selecting from a set of query-suggestion pairs a first query, wherein: each query-suggestion pair from the set of query-suggestion pairs comprises a query and a suggestion; and the first query is the query of at least one query-suggestion pair from the set of query-suggestion pairs; selecting from the set of query-suggestion pairs a subset of query-suggestion pairs, wherein: the subset of query-suggestion pairs comprises one or more distinct query-suggestion pairs from the set of query-suggestion pairs; and the first query is the query of each query-suggestion pair from the subset of query-suggestion pairs; computing a Log Likelihood Ratio (LLR) value for each query-suggestion pair from the subset of query-suggestion pairs; ranking the subset of query-suggestion pairs according to their respective LLR values; removing from the subset of query-suggestion pairs all query-suggestion pairs whose LLR values are below a predetermined LLR threshold; computing a Pointwise Mutual Information (PMI) value for each remaining query suggestion pair from the subset of query-suggestion pairs; removing from the subset of query-suggestion pairs all query-suggestion pairs whose PMI values are below a predetermine PMI threshold; and constructing a ranked set of suggestions for the first query, wherein the ranked set of suggestions comprises one or more suggestions of the remaining query-suggestion pairs from the subset of query-suggestion pairs. |
20130096907 | 13272615 | 0 | 1. A computer program product for facilitating processing within an emulated computing environment, said computer program product comprising: a computer readable storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising: identifying, by a processor that is based on one system architecture, one or more system-provided routines referenced within an application written for another system architecture different from the one system architecture, the application to be emulated by the processor, and wherein the identifying identifies one or more defined routine names or one or more defined routine signatures; and based on identifying a system-provided routine, providing native code for the system-provided routine instead of emulated code for the system-provided routine. |
20110119422 | 12947067 | 0 | 1. A scheduling method for a data processing system comprising at least one physical CPU, and one or more virtual machines each assigned to one or more virtual CPUs, the method comprising: a first scheduling step in which one of said virtual machines is elected to run on said physical CPU; and a second scheduling step in which at least one of the virtual CPUs assigned to the elected virtual machine is elected to run on said physical CPU. |
7577759 | 11069153 | 1 | 1. A method for transferring data content between one or more input streams and one or more output streams controlled by an application running on a host system, said method comprising the steps of: providing an operating system kernel-level transfer service which is adapted to perform application-specific processing of data content and which attends to transfer of content from at least one input stream to at least one output stream; and performing, with the operating system kernel-level transfer service, an operation for collection of at least one input stream and at least one output stream via: performing application-specific processing, wherein said application-specific processing comprises modifying the data content via modifying a packet payload; and attending to the transfer of content from at least one input stream to at least one output stream; wherein the at least one input stream and the at least one output stream are external to the application; wherein said operating system kernel-level transfer service is provided in response to a request for an operating system kernel level offloading of a content transfer and the request indicates a set of input and output streams, a pre-registered procedure to be invoked for each input stream, a set of application-specific processing parameters to each input stream, a type of transfer termination, content caching requirements, and whether interaction is synchronous or asynchronous. |
5553234 | 08311035 | 1 | 1. A method for incorporating an external predefined procedure into an existing unit of work, said existing unit of work being part of a client application process, said method comprising the steps of: (a) creating, in a database environment, a "logical representation" of said client application process, that is connected to said client application process; (b) disconnecting said "logical representation" from said client application process; (c) connecting said "logical representation" to a procedure operating environment to execute external programs; (d) executing said external predefined procedure in said procedure operating environment; (e) disconnecting said "logical representation" from said procedure operating environment; and (f) reconnecting said "logical representation" to said client application process, to incorporate the external predefined procedure into the existing unit of work. |
10027578 | 15095946 | 1 | 1. A computer system for facilitating routable prefix queries, the system comprising: a processor; and a storage device storing instructions that when executed by the processor cause the processor to perform a method, the method comprising: generating, by a client computing device, a query for one or more indices based on a name for an interest, wherein a name is a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level, wherein an index indicates a number of the contiguous name components beginning from the most general level that represent a routable prefix needed to route the interest to a content producing device that can satisfy the interest; and in response to the query, receiving the one or more indices, which allows the client computing device to determine a remaining number of name components of the interest name which can be encrypted, thereby facilitating protection of private communication in a content centric network, wherein the method further comprises: generating a first interest with a name that includes a first routable prefix that corresponds to a received index, wherein the first routable prefix is in cleartext; and encrypting a remaining suffix which comprises name components of the name immediately following the first routable prefix. |
9069815 | 10700576 | 1 | 1. A computer program product for avoiding structured database queries directed to a database management system (DBMS) by an application program, the computer program product comprising: a non-transitory tangible computer-readable medium; a code generator module, wherein the code generator module: is stored on the medium, and is operative to automatically modify a source code of the application program before application program run time, wherein said modifying comprises: inserting start-up code in the source code; and inserting trap code in the source code to avoid at least one structured database query; and an establishment module, wherein the establishment module: is stored on the medium, is executed after the code generator module and before the application program run time, is in communication with the DBMS containing identified data that is at least partially responsive to the at least one structured database query, and that is static over a period, and is operative to execute the start-up code to establish at least a subset of the identified data in a local main memory before the application program run time, by retrieving the identified data from the DBMS and storing the identified data in the local main memory, and where the local main memory is characterized by an access latency less than the latency associated with retrieving the identified data using the structured database query, and where the access latency is defined with respect to the application program; and wherein the trap code: is stored on the medium; is executed at the application program run time; and is operative to avoid executing the at least one structured database query when at least a portion of the response to the structured database query corresponds to at least a portion of the identified data stored in the local main memory; and is operative to provide the response to the avoided structured database query at least in part using the identified data stored in the local main memory without executing the structured database query. |
8804177 | 13712743 | 1 | 1. A system comprising: a control system operable to receive a print workflow for a print job, wherein the print workflow comprises steps identifying print shop activities to perform for the print job; and the control system is further operable to determine whether the print workflow comprises a branching print workflow, to segment the print workflow into a plurality of linear sequences of steps, to determine a number of times a step is present in each of the linear sequences of steps, and to determine that the print workflow is valid if the number of times is equal or greater than a minimum number of times the step may be present in a print workflow as defined by workflow rules. |
7743392 | 11318382 | 1 | 1. A system for parallel asynchronous command execution, comprising: a processor; system memory; and a first computer system for directing one or more calls to invoke a plurality of remote procedures that are to be concurrently processed in parallel in a second computer system, the first computer and second computer communicating via a non-persistent connection, such that the remote procedures are executed without persistent handshaking between the first computer system and the second computer system, and wherein the first computer system, upon completion of at least one of the plurality of remote procedures, receives an event trigger generated by and transmitted from the second computer system, wherein the event trigger includes the remote procedure results for at least one of the plurality of remote procedures. |
20130103692 | 13281250 | 0 | 1. A computer-implemented method of predicting a target user's response to an item comprising: accessing a computer-implemented contacts service to identify at least one second user associated with the target user by the contacts service; eliciting from the second user a predicted response of the target user to the item; storing at a data structure, a second user weight for the second user; at a processor, calculating a prediction of the target user's response to the item by using the predicted response and taking into account the second user weight. |
9690540 | 14495595 | 1 | 1. A computing system comprising: a network interface; at least one processor; a tangible, non-transitory computer-readable media; and program instructions stored on the non-transitory computer-readable media that are executable by the at least one processor to cause the computing system to perform a method comprising: receiving, via the network interface over a wide area network, an identifier of a media playback system that comprises a playback device that is distinct from the computing system; linking the identifier with a first social-media account of a social-media network such that the media playback system is associated with the first social-media account; receiving, via the network interface over the wide area network from a first computing device affiliated with the first social media account, an indication of an upcoming social-media event corresponding to the first social-media account, wherein the upcoming social-media event corresponds to a particular time of an event, and wherein the indication of the upcoming social-media event comprises data indicative of one or more second social-media accounts, wherein the first computing device is distinct from the computing system and the playback device; based at least on linking the identifier with the first social-media account and the indication of the upcoming social-media event, generating a social-media playback queue that is stored on the computing system; establishing access permissions to the social-media playback queue, wherein the access permissions indicate that the one or more second social-media accounts (a) are within a social-media network of the first social-media account and (b) have received an invite to the upcoming social-media event prior to the particular time of the social-media event; before the upcoming social-media event corresponding to the particular time, receiving, via the network interface over the wide area network from a second computing device affiliated with a given second social-media account of the one or more second social-media accounts, (i) an indication of a given media item to add to the social-media playback queue, and (ii) an indication of a source of the given media item at a streaming media service, wherein the second computing device is distinct from the computing system and the playback device; causing the given media item to be added to the social-media playback queue such that the social-media playback queue comprises one or more particular media items including the given media item; and at the particular time of the social-media event, causing, via the wide area network, the one or more particular media items of the social-media playback queue to be queued on the playback device of the media playback system for playback via the playback device during the social-media event. |
20060130008 | 11009674 | 0 | 1. An element-kind model-to-model transformation comprising: a plurality of transform elements defining a traversal of a source model; and, an element-kind mapping comprising a set of associations between element-kinds for said source model and corresponding transformation rules to produce target objects in a target model. |
8072630 | 11382531 | 1 | 1. A method for job control and synchronization among a plurality of processes operable in a printer controller, the method comprising: creating, in a first process of the plurality of processes operating within the print controller, a first job control header including synchronization information associated with a portion of print data; transmitting the first job control header and the associated portion of the print data from the first process to a second process of the plurality of processes operating within the print controller; creating in the second process, a second job control header including synchronization information associated with the portion of print data; transmitting the second job control header devoid of print data from the second process to the first process; and synchronizing processing of the portion of the print data between the first process and the second process based on detection and signaling of an event indicated in the synchronization information of the first job control header. |
8902971 | 13772230 | 1 | 1. A method of providing video data, comprising: encoding a subject video stream by a feature-based compression process that utilizes feature models from a global feature model library, said encoding implicitly using the feature models to indicate macroblocks in the subject video to encode by forming tracks using location information from one or more of the feature models in multiple reference frames, the tracks indicating respective locations of macroblocks in a current frame of the subject video stream being encoded, and explicitly using pixels of the feature models to improve prediction of said macroblocks relative to a first prediction of said macroblocks, where the encoding results in an encoded video data, where the use of feature models to indicate macroblocks in the subject video avoids the need to segment features from non-features during the feature-based compression process of the subject video, and wherein the feature-based compression process applies feature-based prediction across multiple different video sources based on the feature models, the multiple different video sources being at least the subject video stream and one or more input videos used to generate the global feature model library; transmitting the encoded video data to a requesting device upon command, said feature models from the global feature model library being made accessible to the requesting device and enabling decoding of the encoded video data at the requesting device; wherein the global feature model library is formed by: receiving the one or more input videos, each input video being different from the subject video stream; for each of the input videos, generating feature information and a respective feature model; and storing in a data storage device or on cloud storage the feature models generated from the input videos, the data store or cloud storage providing pertinent feature models to the feature-based compression process and the requesting device. |
20020188639 | 09870649 | 0 | 1. A method of processing a multiplication operation instruction, comprising: fetching and decoding a multiplication operation instruction; executing the multiplication operation instruction on a multiplication source operand to generate a square of the multiplication source operand, the multiplication source operand contained in a multiplication operand source register specified in the multiplication operation instruction; and storing a result output in a target accumulator specified in the multiplication operation instruction; wherein the multiplication source operand is transferred directly from the multiplication operand source register to a multiplication execution unit for immediate generation of the square output for the multiplication source operand. |
20050187951 | 11019130 | 0 | 1. A method for mapping input listings to consolidated listings the method comprising the computer-implemented steps of: establishing a group of input listings from a plurality of input listings by grouping input listings that have in common one or more attribute values; determining, for the group of input listings, a corresponding consolidated listing based on attribute values associated with the input listings in said group and attribute values associated with consolidated listings; and mapping each input listing in the group of input listings to the consolidated listing. |
20130291123 | 13538782 | 0 | 1. A computer-implemented method for managing privacy rights of a user related to the delivery of content, the method comprising: providing a global privacy management interface that: presents a selection tool for enabling a user to review privacy options and interests, the privacy options and interests including controls for presenting a list of identifiers that are associated with the user and interests associated with those identifiers, each identifier associated with a requesting source having been used by the user to access content; and enables de-selection of individual interests on a per-identifier or global basis; and determining, in a server system, content to deliver to the user in view of the privacy selections. |
20060277458 | 10893731 | 0 | 1. A deserialization method comprising: parsing a message; the message comprising a serialized object comprising: a data structure (“datastruct”) element representative of a data structure of a first object, the datastruct element having a pair of datastruct tags, wherein the datastruct tags identify the datastruct element; contents of the datastruct between the datastruct tags, the contents comprising one or more data parameter elements representative of one or more data parameters of the object's data structure, each parameter element having a pair of parameter tags associated therewith, wherein each pair of parameter tags identifies a parameter element with which the pair of tags is associated, each parameter element having associated data between the parameter tags. |
7536539 | 10912505 | 1 | 1. A computer implemented method in a data processing system for discovering hardware nodes having a hierarchical organization, through a deferred hardware discovery process operational in a user space, a kernel or both, the computer implemented method comprising: identifying and discovering only a minimum subset of hardware nodes in a file or by their connection to an input/output bridge, wherein the minimum subset of hardware nodes is a least selection of known hardware nodes necessary for an operating system to load and take control of the data processing system including at least one of the input/output bridge, a small computer system interface adapter, a hard disc drive, and a network adapter, and wherein the operating system supports parallel threads; responsive to discovering only the minimum subset of hardware nodes, suspending further discovery of undiscovered hardware nodes until creation of an operational user space environment in the operating system; initializing the minimum subset of the hardware nodes in the data processing system prior to loading the operating system; responsive to loading the operating system, creating the operational user space environment and conducting the further discovery of the undiscovered hardware nodes; generating, an initial thread for each known hardware node to form a set of initial threads, wherein the set of initial threads searches for the undiscovered hardware nodes only on a level below the each known hardware nodes, and wherein the set of initial threads allows for parallel discovery and initiation of hardware components connected to the undiscovered hardware nodes; responsive to discovery of each of the undiscovered hardware nodes, initializing, assigning resources to, and establishing addressing for the each of the undiscovered hardware nodes; creating an additional thread for the each of the undiscovered hardware nodes discovered to form a set of threads, wherein each thread in the set of threads searches for additional undiscovered hardware nodes only on a level below the each of the undiscovered hardware nodes, wherein the set of threads allows for parallel discovery and initiation of hardware components connected to the additional undiscovered hardware nodes; responsive to locating all application required hardware connected to the undiscovered hardware nodes and to the additional undiscovered hardware nodes, starting the application; and responsive to failing to locate all application required hardware, indicating an error. |
8553939 | 13408775 | 1 | 1. A method of computer modeling a human subject, the method comprising: receiving from a source a depth image of a scene including the human subject, the depth image including a depth for each of a plurality of pixels; identifying pixels of the depth image that belong to the human subject; and deriving from the identified pixels of the depth image one or more machine readable data structures representing the human subject as a body model including a plurality of shapes. |
20070033631 | 11542419 | 0 | 1. Apparatus for providing multiple session-based services at a terminal, comprising: a memory configured to support a plurality of software layers including a service layer communicating with terminal resources via a root layer disposed therebetween; and a processor, for executing instructions associated with a plurality of service layer applications, a root layer application and a control mechanism; each of said service layer applications communicating with terminal resources to provide thereby a respective user interface; said control mechanism selectively causing at least one of said service layer applications to enter an active state, the user interface associated with a service layer application being adapted in response to the service layer application entering the active state. |
20150149579 | 14607567 | 0 | 1. A method of collecting information regarding an event in a computer system that comprises a plurality of client application caches that each temporarily store information associated with one of a plurality of client applications, comprising storing at one or more of the plurality of client application caches a set of rules, each rule to trigger the event in another one of the plurality of client application caches in response to receipt of a message from a client application associated with the respective client application cache; and for each rule that matches a first received message at a first client application cache, generating another message directed to another specified client application cache that directs the other specified client application cache to collect and cache specified information from a server associated with the other specified client application cache. |
20120047117 | 12973811 | 0 | 1. A computer implemented method for maintaining immediate materialized outerjoin views, comprising: creating, using a computing device, a before image of a base table of a database; executing, by the computing device, an update statement on the base table; creating, by the computing device, an after image of the base table, wherein the after image indicates updated rows of the base table; computing, by the computing device, a delta of the base table, wherein the computing comprises comparing the before image to the after image; computing, by the computing device, a view delta of a previously defined immediate materialized view (iMV) based on the computed delta of the base table; and updating, by the computing device, the iMV using the computed delta of the iMV to reflect changes in the delta of the base table. |
20060139372 | 11025452 | 0 | 1. In a graphical programming environment, a method comprising: providing a graphic block for rendering parameterized graphic annotations; and rendering a parameterized graphic annotation. |
9613095 | 14683004 | 1 | 1. A system of one or more computing devices, the system comprising: a user interface presented to a first application developer; a data store configured to store information identifying a plurality of functions and corresponding unique identifiers, wherein each of the plurality of functions corresponds to external functionality available from third party applications; an application functionality management module, implemented by a first one or more processors, configured to receive a selection from the first application developer of a first function of the plurality of functions to supplement functionality of a first application under development by the first application developer; and a code generation module, implemented by a second one or more processors, configured to provide a software development kit (SDK) library to the first application developer for incorporation into at least a first screen of the first application, wherein the first screen includes a first user interface element associated with a first entity, and wherein the SDK library includes instructions for: in response to user selection of the first user interface element, preparing a query wrapper including (i) the corresponding unique identifier of the first function and (ii) an identifier of the first entity; transmitting the query wrapper to a search system; receiving a result set from the search system, wherein the result set includes a plurality of items, and wherein a first item of the plurality of items includes (i) an identifier of a target application and (ii) an access mechanism for a specified screen of the target application; displaying the plurality of items; and in response to user selection of the first item, actuating the access mechanism to open the target application to the specified statc screen. |
4433258 | 06245163 | 1 | 1. A logic circuit comprising a plurality of basic circuits each including at least one single-collector driver transistor provided with a clamping Schottky diode, the emitter of said driver transistor being grounded, the base of said driver transistor being used as an input terminal and the collector thereof being used as an output terminal for said basic circuit, each of said basic circuits further including a constant current load transistor coupled to said output terminal of each said basic circuit, wherein the output terminal of a preceding stage basic circuit is coupled directly to the input terminal of the subsequent stage basic circuit, said logic circuit further comprising means for adjusting the amplitude of said constant current provided by each of said constant current load transistors to operate the driver transistor of the subsequent stage, with said clamping Schottky diode forward biased, in a shallow saturation mode when said subsequent stage driver transistor is in an ON state. |
20120010844 | 12803991 | 0 | 1. A sensor module for detecting data representing fluid; said sensor module including: a first sensor; a second sensor; and a sensor module processor; wherein said second sensor is vertically offset from said first sensor; wherein said sensor module processor is electrically connected to said first sensor; wherein said sensor module microprocessor is electrically connected to said second sensor; wherein said first sensor, said second sensor, and said sensor module processor cooperatively resolve nonlinear fluid phenomena. |
20070130097 | 11292182 | 0 | 1. A method of predicting a user activity level associated with an application executing on a computing system in a multi-user computing environment, comprising: defining a user activity metric (UAM) as a variable, said UAM capable of being assigned a plurality of activity levels, wherein each activity level of said plurality of activity levels is a measured number of transactions performed by a plurality of users utilizing said application during a time period of a plurality of time periods, or a measured number of said users utilizing said application during said time period; defining a plurality of factors associated with said plurality of activity levels, said plurality of factors including a calendar type factor, said calendar type factor capable of being assigned a plurality of values of a cyclic time scale, wherein each value of said plurality of values represents an amount of time elapsed from a specified event; assigning said plurality of activity levels to said UAM; assigning said plurality of values to said calendar type factor of said plurality of factors, said plurality of values associated with said plurality of activity levels in a one-to-one correspondence, and with said plurality of time periods in a one-to-one correspondence; adjusting, subsequent to said assigning said plurality of values to said calendar type factor, said plurality of values to a plurality of adjusted values, said plurality of adjusted values including a pre-defined base value and one or more other adjusted values, wherein an adjusted value of said one or more other adjusted values represents a distance to said pre-defined base value, and wherein said adjusting includes facilitating a representation of a linear dependency between said plurality of adjusted values and said plurality of activity levels; calculating a plurality of coefficients of correlation, said calculating said plurality of coefficients of correlation including calculating a first coefficient of correlation between said plurality of adjusted values and said plurality of activity levels; determining that an absolute value of said first coefficient of correlation is less than a pre-defined threshold value; excluding, in response to said determining, said calendar type factor from said plurality of factors, said excluding including forming a subset of said plurality of factors, said subset including one or more factors, wherein an absolute value of a second coefficient of correlation between a set of values assigned to any factor of said one or more factors and said plurality of activity levels is greater than or equal to said pre-defined threshold value; and generating a regression model to predict an activity level, said regression model based on said plurality of activity levels and said subset. |
5485373 | 08036785 | 1 | 1. A method for establishing a collating order between a first text string and a second text string, the first text string and the second text string consisting of characters belonging to a language which has a predefined character precedence, the method being operable in a computer system having a processor and a memory connected to the processor and containing locations for storing information including the first text string and the second text string and comprising the steps of: (a) defining at least one ordering value for each character based on the predefined character precedence the language; (b) storing ordering values for all characters in the memory; (c) retrieving from the memory pairs of characters including a first character from the first text string and a second character from the second text string; (d) retrieving an ordering value for the first character and an ordering value for the second character; (e) performing a comparison of the retrieved ordering values of the characters to determine a difference between the first and the second text string; and (f) computing a minimum trailing match length value for each position in the second text string. |
20040233624 | 10785717 | 0 | 1. A modular computer user interface system comprising: a) a processor, b) a platform including a keyboard mounted thereon, said processor electrically connected to and responsive of data communication from said keyboard, c) at least one auxiliary module secured to said platform in segregated relation to said keyboard, and d) an interface assembly at least partially connected to said platform and structured to operatively interconnect said auxiliary module and said processor. |
20070250494 | 11468856 | 0 | 1. A method for multilingual data querying, comprising: receiving a request for a query, the query including a base word in a source language used for a search of a database in a target language; applying the request to factors; selecting components based on the factors; and performing the query based on the selecting. |
9558043 | 13750835 | 1 | 1. A method, comprising: receiving, by a server, data from a network element; determining, by a data control task having a plurality of candidate data processing tasks associated therewith, a particular candidate data processing task of the plurality of candidate processing tasks for the received data based upon a first similarity metric representative of a measure of similarity between the received data and data currently associated with the particular candidate data processing task, wherein determining the particular candidate data processing task includes determining whether the first similarity metric is within a predetermined threshold; and sending the received data to the particular candidate data processing task, wherein the particular candidate data processing task is configured to determine whether the received data is suitable for the particular candidate data processing task based upon a second similarity metric between the received data and data currently associated with the particular candidate data processing task, wherein the second similarity metric is representative of a greater level of similarity analysis than the first similarity metric. |
8688727 | 13094794 | 1 | 1. A method implemented by data processing apparatus, the method comprising: obtaining a search query; selecting one or more candidate refinement queries, wherein selecting one or more candidate refinement queries comprises: selecting one or more terms from training data as candidate refinement queries, wherein a respective right context of each of the selected terms in the training data includes at least one word in a right context of the search query, and wherein a respective left context of each of the selected terms in the training data includes at least one word in a left context of the search query; determining one or more categories for the search query; determining one or more categories for each of the candidate refinement queries; determining a respective first score for each of the candidate refinement queries, wherein determining the respective first score for the candidate refinement query comprises adjusting the respective first score for the candidate refinement query based on a number of categories shared between the candidate refinement query and the search query; and identifying as query refinements for the search query one or more of the candidate refinement queries based on the first scores. |
7743061 | 10706352 | 1 | 1. A method for evaluating the text content of a document database with respect to a document population, comprising the steps of: (a) providing a computer system having a user interface with a display; (b) gathering documents from said database into said system; (c) normalizing said gathered documents; (d) fingerprinting said gathered documents; (e) determining a text criteria with respect to said document population; (f) forming a net comprising at least two nodes associated by at least one interaction and displayable at said display as two or more spaced apart nodes connected by an interaction; (g) loading said text criteria into at least one of said nodes; (h) for each document of said database, calculating its geometric relative distance from a said node to derive one or more node attractors; (i) displaying said net at said display in combination with one or more document symbols each representing a said document located in correspondence with said calculated relative distance; (j) visually examining the display of said net and document symbols; and (k) determining from said document symbol locations at said display those documents, if any, which are more likely to correspond with said text criteria. |
10152591 | 15230315 | 1 | 1. A system, comprising: a non-transitory memory; and one or more hardware processors coupled to the non-transitory memory and configured to read instructions from the non-transitory memory to cause the system to perform operations comprising: obtaining an application infected with a malicious code; executing the application to log system calls associated with executing the application, wherein the logged system calls comprise system call parameters and time stamps corresponding to the system calls; extracting, from the logged system calls, a first portion of the logged system calls corresponding to the malicious code based on the system call parameters and the time stamps; decompiling the first portion of the logged system calls to generate a first programming source code corresponding to the malicious code; analyzing the first programming source code to determine a first result associated with executing the malicious code; mutating the first programming source code to create a second programming source code that is a variant of the malicious code; and executing the second programming source code to determine a second result from executing the second programming source code corresponds to the first result associated with executing the malicious code. |
9846608 | 14835474 | 1 | 1. A method, comprising: performing operations as follows on a processor of an application analysis computer: receiving reports from user terminals containing identifiers for operational states of an application being processed by the user terminals and containing state performance metrics, each of the state performance metrics indicating a measurement of performance for a corresponding identified one of the operational states of the application being processed by one of the user terminals; for each of the operational states of the application identified in the reports, generating a rule for acceptable performance of the operational state of the application based on the state performance metrics of the operational state reported by the user terminals; storing in a repository the rules associated with identifiers for corresponding ones of the operational states of the application; determining when one of the state performance metrics reported by one of the user terminals violates one of the rules in the repository for acceptable operational state performance for the corresponding one of the operational states of the application; and communicating a response message to the one of the user terminals responsive to the determination that the one of the state performance metrics violates one of the rules in the repository, wherein the communication of the response message comprises communicating to the one of the user terminals a remedial action message containing a defined value for the application to use as an acceptable response to an application programming interface (API) call to a resource of the one of the user terminal when the resource is not available to provide a response to the API call. |
9136842 | 13913096 | 1 | 1. A system comprising: a first integrated circuit; and a second integrated circuit communicatively coupled to the first integrated circuit, wherein the second integrated circuit comprises: a primary circuitry; and an embedded programmable logic, wherein the embedded programmable logic is embedded in an interposer configured to facilitate communication between the first integrated circuit and the second integrated circuit, embedded in the second integrated circuit, or embedded in both the interposer and the second integrated circuit; wherein the first integrated circuit and the second integrated circuit are configured to complement the operation of the other, and wherein the first integrated circuit is configured to adjust the functionality of the primary circuitry of the second integrated circuit by programming the embedded programmable logic. |
9495557 | 14030519 | 1 | 1. A system comprising: a server system comprising one or more processors; a database system implemented using the server system, the database system configurable to cause: maintaining at least one database storing a plurality of articles of a knowledgebase and storing at least one object identifying a plurality of article categories, each article of the articles being associated with at least one corresponding article category according to content of the article, each article category being associated with at least one of a plurality of viewing permissions, the viewing permissions configurable to grant or deny user access to the articles; processing a request from a user to access a first article, the first article associated with a first article category and with a second article category, the second article category being identified as a subcategory of the first article category, the first article category associated with a first set of viewing permissions providing more expansive access than a second set of viewing permissions associated with the second article category; identifying, using the database system, a first permission of a first permission set associated with the user, the identified first permission having been assigned to the user based on a work role of the user within an organizational hierarchy, the work role being based on a plurality of data category visibility settings; identifying, using the database system, a second permission of a second permission set associated with the user, the second permission set being different from the first permission set, the identified second permission having been assigned to the user based on a team of which the user is a member, the team being a group of users working on a shared project; determining, using the database system, that the identified first permission comprises a viewing permission different from the identified second permission; responsive to determining that the identified first permission comprises the different viewing permission, generating or updating, using the database system, a data category tree based at least on the identified first permission and the identified second permission, the data category tree being a first union of data representing a combination of viewing permissions for the user, the combination of viewing permissions providing access to the first article responsive to a single traversal by the database system of the data category tree; creating a second union of data through a combination of two or more of the data category visibility settings; determining a plurality of most inclusive data categories; creating a third union of data through a combination of two or more of the most inclusive data categories; determining, using the data category tree, that the user has access to the first article based on the identified first permission or the identified second permission being indicated by the first article category or the second article category, the second article category comprising one of: a geographic location related to the first article or a product related to the first article; and responsive to the determining that the user has access to the first article, granting access to the user to view the first article and displaying information identifying the combination of the most inclusive data categories on a user device. |
5398196 | 08099368 | 1 | 1. A computer system configured to monitor the execution of a target program intended to run on a target computer, said target computer having an instruction set, said computer system comprising: a processing unit; instruction emulation means for operating said processing unit to emulate instructions in said target program corresponding to said instruction set as if said instructions were running on said target computer; monitor means, coupled to said instruction emulation means, for emulating execution of said target program as if said target program were running on said target computer and for monitoring said emulated target program execution to detect a predetermined behavior by said target program; and means, coupled to said monitor means, for logging said predetermined behavior when detected. |
9465614 | 14195657 | 1 | 1. An integrated circuit comprising: a set of data processing units including a first data processing unit and at least one second data processing unit operable at variable frequencies; an instruction scheduler adapted to: evaluate a received plurality of instructions to detect data dependencies between individual instructions in the received plurality of instructions; generate, in response to the data dependencies, a control signal that indicates whether data dependency was identified between a set of instructions of the plurality of received instructions; assign the set of instructions to the first data processing unit and the at least one second data processing unit for parallel execution in response to the control signal indicating a lack of data dependency between the set of instructions; and monitor, for instructions received over a period of time, data dependencies indicated by the control signal to determine a level of data dependencies over the period of time; and wherein the integrated circuit is operable in a first power mode and a second power mode, the second power mode being a reduced power mode compared to the first power mode, and is adapted to adjust an operating frequency of the first data processing unit and the at least one second data processing unit in the second power mode as a function of the level of data dependencies. |
8107303 | 12416329 | 1 | 1. A semiconductor device comprising: a first control circuit; a second control circuit; a transistor, the transistor being a p-type transistor, a gate of the transistor being electrically connected to the first control circuit through a first word line, and one of a source and a drain of the transistor being electrically connected to the second control circuit through a bit line, and a memory element, a first terminal of the memory element being electrically connected to the other of the source and the drain of the transistor, and a second terminal of the memory element being electrically connected to the first control circuit through a second word line, wherein: the first control circuit is configured to supply a first potential to the gate of the transistor through the first word line, the second control circuit is configured to supply a second potential to the one of the source and the drain of the transistor through the bit line, the first control circuit is configured to supply a third potential to the second terminal of the memory element through the second word line, the third potential at a time of data writing is negative potential, and a potential difference between the second potential and the third potential at the time of data writing is larger than a withstand voltage of the transistor. |
8732830 | 12473591 | 1 | 1. A method comprising: receiving a script for execution within a scripting host of an application executing on a processor of a computing device; identifying, by the scripting host, a function called within the script and a context from which the identified function is called; retrieving by the scripting host, from a memory, a security setting representation of the identified function based at least in part on the context from which the identified function is called; and the scripting host, based on the security setting representation indicating that the identified function is not allowed in the context from which the identified function is called, preventing execution of the identified function in the context from which the identified function was called. |
20030115423 | 10361542 | 0 | 1. A multiprocessor computer system comprising: a plurality of cache memories to store a plurality of cache lines and state information for each one of the cache lines, the state information comprising data representing a first state selected from the group consisting of a Shared-Update state, a Shared-Respond state and an Exclusive-Respond state; a plurality of processors, at least one cache memory associated with each one of the plurality of processors; a system memory shared by the plurality of processors; and at least one bus interconnecting the system memory with the plurality of cache memories and the plurality of processors. |
20110289345 | 12781875 | 0 | 1. A method for transmitting an updated state of a primary computer system to a backup computer system through an intermediary computer system, wherein the backup computer system is networked to the intermediary computer system through a low bandwidth connection that does not support timely transmission of modified states of the primary computer system received by the intermediary computer system at checkpoints, the method comprising: periodically receiving, at the intermediary computer system, checkpoint information packets from the primary computer system through a high bandwidth connection, wherein each checkpoint information packet comprises updated data corresponding to memory pages of the primary computer system that have been modified since a previously received checkpoint information packet; continuously determining whether each copy of memory pages of the primary computer system stored at the intermediary computer system is a copy of a memory page that has been least recently updated by the primary computer system and has not been transmitted to the backup computer system; and transmitting updated data in each copy of each memory page determined to be a least recently updated memory page to the backup computer system through the low bandwidth connection. |
9374543 | 14694024 | 1 | 1. A system for acquiring a digital image from a camera generating sensor data, the system comprising: a discrete application receiving a first and a second request for images from the camera, said discrete application generating respectively a first and a second preprocessing instruction; and an interface adapted to receive preprocessing instructions from said discrete application, said interface including a plurality of preprocessing modules, each module performing a respective preprocessing function on said sensor data, said interface being adapted to activate a first subset of modules in response to said first preprocessing instruction to generate a first preprocessed image, and to activate a second subset of modules in response to said second preprocessing instruction to generate a second preprocessed image, wherein the order of the preprocessing functions performed by the first and second subsets of modules is selectively controlled by the first and second preprocessing instructions, respectively. |
20060179237 | 11054173 | 0 | 1. A method for preforming data prefetch in a multiprocessor system, wherein said multiprocessor system includes a plurality of processors, each having a cache memory, said method comprising: issuing a plurality of prefetch requests by a requesting processor; in response to said plurality of prefetch requests miss in cache memory of said requesting processor, merging said plurality of prefetch requests into a combined prefetch request; sending said combined prefetch request to cache memories of all non-requesting processors; and in response to a combined clean response from cache memories of all non-requesting processors, obtaining data for said combined prefetch request from a system memory. |
20020147599 | 09826662 | 0 | 1. A method of developing a domain-specific analytic application having at least one predefined data mining model, the method comprising the steps of: identifying a business problem to be solved; selecting a data mining algorithm appropriate for solving the business problem; defining data schema for use as inputs and outputs to and from the mining algorithm, the data schema including input data schema and output data schema; and defining a data mining model dependent upon the data schema, defining a data mining model resulting in the creation of a predefined data mining model; whereby a domain-specific analytic application is developed, the analytic application having at least one predefined data mining model. |
20090031085 | 11828439 | 0 | 1. A computer implemented method for maintaining cache coherency in a multi-node system, the computer implemented method comprising: responsive to receiving a request at a multi-node bridge of a local node, performing a look-up of a directory in the local node if the request is a system request; if an entry in the directory of the local node indicates that data specified in the request has a local owner or the request has a local destination, forwarding the request to the local node; determining, at the local node, whether the request is a local request or a system request; responsive to the local node determining that the request is a local request, performing a look-up of the directory in the local node; if the entry in the directory of the local node indicates that data specified in the request has a local owner and the request has a local destination, resolving coherency of the data on the local node and performing a transfer of the data specified in the request if a data transfer is required; and if the entry in the directory of the local node indicates that data specified in the request does not have a local owner or the request does not have a local destination, forwarding the request to all remote nodes in the multi-node system. |
8689195 | 12131972 | 1 | 1. A machine-implemented method for enforcing the use of designated initializers in structured data type initializations, comprising: determining whether a structured data type requires a designated initializer; said determining being performing by either: evaluating a structured data type definition for the presence of a syntax specifying that said structured data type requires designated initialization; or accessing an information resource comprising an indication whether said structured data type requires designated initialization; parsing an initialization of a structured variable declared to use said structured data type to determine whether said initialization employs an improper initializer that is inconsistent with said structured data type; and performing a diagnostic action if said initialization comprises an improper initializer. |
9477564 | 14310835 | 1 | 1. A multi-node platform controller hub (MN-PCH), comprising: a plurality of node interfaces, configured to facilitate communication with a plurality of nodes on a compute platform; an internal interconnect; an interface, coupled to the internal interconnect and configured to be coupled to a storage device on the compute platform containing firmware for each of the plurality of nodes and firmware used by embedded components in the MN-PCH; a plurality of sets of high-speed Input-Output (IO) controllers, coupled to the internal interconnect, each configurable to be dedicated for use by a respective node; a plurality of sets of legacy IO facilities coupled to the internal interconnect, each of the sets of legacy IO facilities configurable to be dedicated for used by a respective node; and a manageability engine, shared across the plurality of nodes. |
7912990 | 11719372 | 1 | 1. A method for safe or reliable parameterization in accordance with IEC 61508 SIL 3 or EN 954-1 Category 4 of an electronic appliance, the method comprising: acquiring parameter values which are intended for parameterization and having been selected or entered via a user interface of an electronic control device; subsequently transmitting the selected or entered parameter values to the electronic appliance; keeping the selected or entered parameter values in at least one memory, which can be accessed by the control device; and reading back the selected or entered parameter values at least once from the at least one memory for verification of the safe parameterization; wherein conversion of a parameter set of parameter values to be transferred from the representation in a memory to a bit-by-bit successive representation of the parameter values, as required for transmission of the parameter set, in a sequence of bytes, comprises conversion using at least two different methods and checking that the resultant byte sequences and their checksums are the same. |
20080228680 | 12048045 | 0 | 1. A modeling system that comprises: a memory; and a processor coupled to the memory and configured to execute software stored in said memory, wherein said software configures the processor to: create a pool of neural networks trained on a portion of a data set; for each of various coefficient settings for a multi-objective function: apply selective evolution subject to the multi-objective function with that coefficient setting to obtain a corresponding group of neural network ensembles; and select a local ensemble from each said group of neural network ensembles, wherein the selection is based on data not included in said portion of the data set; combine a plurality of the local ensembles to form a global ensemble; and provide a perceptible output based at least in part on a prediction by the global ensemble. |
20030236808 | 10175594 | 0 | 1. A method for split processing input data having first and second half data into first and second split transformed data, a whole transform defining first and second radix-2 transforms, the whole transform defining first and second radix-2 transforms, the whole transform and the first and second radix-2 transforms are discrete cosine transforms, the method comprising the steps of, whole transforming the input data into merged transformed data, the merged transformed data equaling the whole transform of the input data, and split combinational processing the merged transformed data into first and second split transformed data, the first and second split transformed data respectively equaling the first and second radix-2 transforms of the first and second half data. |
8285707 | 11557601 | 1 | 1. A method of searching a database, comprising: choosing a plurality of queries being executed on a database table; creating a data set that is smaller-than the database table and satisfies the plurality of executed queries; choosing a target query, other than one of the executed plurality of queries, that is satisfied by the data set; and executing the target query on the data set, wherein the executing is performed on a computer. |
20150082101 | 14395755 | 0 | 1. A fault-tolerant FPGA computation cell, comprising: an original function/error detection code storage unit for storing an original function, or storing a error detection code-1 corresponding to the original function, and for outputting an original function output required to route the original function or a error detection code-1 required to detect an error in the original function when the original function is input; a spare function/error detection code storage unit for storing an spare function or storing a error detection code-2 corresponding to the spare function, and outputting a spare function output required to route the spare function or a error detection code-2 required to detect an error in the spare function when the spare function is input; a totally self checker for receiving the original function output, the error detection code-1, the spare function output, and the error detection code-2, determining whether a fault has occurred in the original function or the spare function, and then outputting a faulty signal_original and a faulty signal_spare; a function router/permanent error indicator for performing an operation on the original function output, the spare function output, the faulty signal_original, the faulty signal_spare, and a stem function input from a stem cell, and then outputting a function routing signal or a permanent error flag signal; and a free router for routing the permanent error flag signal. |
20060090160 | 10973109 | 0 | 1. A method for managing productivity, comprising: establishing a planned execution time for performing a task, the task being assigned a unique identifier; comparing the planned execution time with an actual execution time for performing the task, the actual execution time extracted from a task dispatch system via the unique identifier; calculating an efficiency rating based upon the comparing; and associating the efficiency rating with at least one of: an individual performing the task; a supervisor of an individual performing the task; a group of individuals associated with an individual performing the task; and an organization associated with an individual performing the task. |
9958842 | 14419830 | 1 | 1. A system for configuring an intelligent electronic device, the system comprising a processor: and a configurator for obtaining a target configuration for the intelligent electronic device by processing a baseline configuration of the intelligent electronic device and a delta configuration thereof; wherein the delta configuration is responsive to a target operation of the intelligent electronic device, the target operation being selected from the group consisting of a substation protection operation and a substation control operation; wherein the target operation of the intelligent electronic device depends on the target configuration; wherein the baseline configuration is defined by default parametric values of the intelligent electronic device and the delta configuration is defined by delta parametric values; wherein the delta parametric values are differences between the default parametric values of the intelligent electronic device and respective target parametric values of the target operation; wherein the baseline configuration and the delta configuration each comprises one or more function blocks, wherein the one or more function blocks of the baseline configuration comprise the default parametric values of the baseline configuration, and wherein the one or more function blocks of the delta configuration comprise the delta parametric values of the delta configuration; wherein the one or more function blocks of the baseline configuration and the one or more function blocks of the delta configuration are modeled as object oriented objects; wherein the default parametric values of the baseline configuration and the delta parametric values of the delta configuration are processed for obtaining the target parametric values of the target configuration by performing one or more of: merging at least one function block of the baseline configuration with at least one function block of the delta configuration, modifying the default parametric values of the at least one function block of the baseline configuration responsive to the delta parametric values of the at least one function block of the delta configuration, and replacing the at least one function block of the baseline configuration with the at least one function block of the delta configuration; and wherein said configurator is operably coupled to the intelligent electronic device and configures the intelligent electronic device with the target configuration. |
10119927 | 13997123 | 1 | 1. A method of assessing concentration of at least one analyte ion in a liquid, the method including: contacting the liquid with a plurality of electrodes, each of which is configured to generate a signal in response to sensing a selected ion in the liquid; receiving the signal from each of the electrodes; processing the signal from each of the electrodes using a neural network algorithm residing on a processor that has been trained to calculate ion interference between the selected ion and other ions in the liquid sensed at one of the electrodes and electrode interference between ones of the electrodes sensing a same selected ion based on a result of a comparison of training data indicative of a known ionic concentration applied to the neural network algorithm and the known ionic concentration; processing data of the signal from one or more of the electrodes with a genetic Independent Component Analysis (geneticICA) algorithm into Independent Components (ICs) and providing the ICs as input data for the neural network algorithm, wherein the geneticICA algorithm is based on a genetic algorithm using a number of random points in a Probability Distribution Function (PDF) of the data; compensating said ion interference and for said electrode interference; and assessing the concentration of the at least analyte ion in the liquid on the basis of a compensated output from the neural network algorithm. |
5539427 | 08187803 | 1 | 1. A method for indexing at least one segment of at least one stored document, said method comprising the steps of: displaying a first document on a display; selecting a first segment from said displayed first document using a selecting device, said first segment having first coordinates and bounds; selecting a first index from storage; storing said first coordinates and bounds of said first segment in said first index; retrieving said first index, said first index containing said coordinates and bounds of said first segment; and displaying said first segment as an indexing entry within said first index by using said coordinates and bounds of said first segment to retrieve said first segment from said first document. |
8834163 | 13306914 | 1 | 1. A method for providing a computerized interactive simulation to a user at a simulation station communicating over a network, said method comprising: providing a computerized simulation of operation of the vehicle in a simulated environment; providing a computerized simulation of a weapon operating in the simulated environment; making a determination in said computerized simulation of an engagement of the weapon with the vehicle in the simulated environment; responsive to the determination of the engagement of the weapon, performing a computerized interaction modeling of the weapon with a model of the vehicle; determining as a result of said modeling interaction a damage model of the vehicle; simulating operation of said vehicle based on said damage model, wherein the computerized simulation of the vehicle includes storing physics data on a computer accessible memory coupled with a physics engine associated with the simulation station, said physics data defining physics parameters of a plurality of virtual objects in the simulated environment, and determining a position of the vehicle in said simulated environment with said physics engine based on the physics data, wherein the model of the vehicle further includes data defining a plurality of constituent parts of the vehicle, and the computerized interaction modeling includes a determination of the damage model includes determining for each part a damage data value, wherein the computerized simulation of the weapon is a simulation of a directed energy weapon, and the computerized interaction modeling includes determining a temperature of any part of the model that is exposed in the simulation to a directed energy beam hit the directed energy weapon, said temperature being determined using the physics engine of the simulation station or another physics engine by providing said physics engine with data corresponding to a mechanical analogue of the directed energy beam hit. |
8868749 | 13008071 | 1 | 1. A method for optimizing workload placement in a networked cloud computing environment, comprising: identifying a workload on an initial platform in the networked cloud computing environment, the networked cloud computing environment comprising at least one cloud network; applying a workload placement technique to identify an optimal platform from multiple different platforms in the at least one cloud network for handling the workload, the workload placement technique comprising an implementation of a plurality of the following: a shadow placement technique, a simultaneous placement technique, and a single platform placement technique, wherein the shadow placement technique comprises a placement of the workload on multiple platforms, wherein the simultaneous placement technique comprises a placement of an entirety of the workload on one platform of the multiple different platforms substantially contemporaneously with simulations of the entirety of the workload on platforms of the multiple different platforms other than the one platform in the at least one cloud network, and wherein the single platform placement technique comprises a placement of the workload on a first single platform of the multiple different platforms in the at least one cloud network in a first time interval and a migration of the workload directly from the first single platform to a second single platform of the multiple different platforms in the at least one cloud network in a second time interval; applying a workload timing method to determine an optimal time to place the workload on the optimal platform in the at least one cloud network, the workload timing method comprising monitoring for a performance bottleneck on the initial platform, wherein the optimal time comprises a time at which an occurrence of the performance bottleneck is detected by the monitoring; and placing the workload on the optimal platform in the at least one cloud network at the optimal time. |
9600591 | 13998070 | 1 | 1. A method for searching for a Uniform Resource Locator (URL) address in a URL search apparatus that maintains a URL list, the method comprising: receiving, at the URL search apparatus, a connection request containing URL address information from a user over a communication network; identifying a first table generated according to characters constituting URL address information in the URL list and a second table generated according to lengths of character strings serving as URL address information in the URL list; and performing a URL search by checking whether the URL address information contained in the connection request is present in the URL list on the basis of the first table and the second table, wherein the first table is used for determining whether the URL address information comprises the characters, and the second table is used for identifying the lengths of the character strings based on a position of a last character of the character strings. |
20130167238 | 13336891 | 0 | 1. A method comprising: identifying a set of known vulnerabilities and a set of new vulnerabilities in an asset; selecting one or more scripts comprising checks for vulnerabilities included in a union of the set of known vulnerabilities and the set of new vulnerabilities; and using the selected scripts to scan the asset. |
8719091 | 12287645 | 1 | 1. A method comprising: receiving, by a processor, a communication being transmitted to a receiving device, the communication including a first content; determining, by the processor, that a tag can be inserted within the communication, wherein the tag is an advertisement comprising a selectable link to content different than the first content with a short description of the selectable link; checking an available inventory of tags for a tag relevant to the first communication; upon a determination that there is no tag relevant to the communication within the available inventory of tags, creating, by the processor, a new tag relevant to the communication, wherein the new tag is different than the tags in the available inventory of tags and the new tag is created by: analyzing at least one of the first content, profile data about a receiving user of the communication and profile data about a sending user of the communication to determine a search topic; searching on at least one web site that has a commercial relationship with an operator managing communications to the receiving device, for content based upon the search topic, the search resulting in at least one search result; selecting one of the resulting search results; and creating both a link to the selected search result and a description of the selected search result to comprise the new tag; inserting, by the processor, the new tag into the communication; and transmitting, by the processor, the communication including the new tag inserted into the communication to the receiving device. |
20110119000 | 12713007 | 0 | 1. A method for configuring a plurality of devices according to a plurality of measurement configurations for performing a plurality of tests on a device under test (DUT), the method comprising: creating a list of measurement configurations in a computer memory, wherein the list of measurement configurations comprises a plurality of parameters for configuring operation of the plurality of devices, wherein the list of measurement configurations further comprises synchronization instructions for enabling configuration changes for the plurality of devices to occur at the same time; providing information regarding the list of measurement configurations to the plurality of devices, wherein the information is usable by the plurality of devices to perform the plurality of tests on the DUT, wherein said performing the plurality of tests on the DUT comprises each of the plurality of devices configuring itself according to the list of measurement configurations based on the information, wherein said configuring enables the plurality of devices to perform the plurality of tests on the DUT in a deterministic and synchronized manner. |
20050022000 | 10819233 | 0 | 1. An illegal communication detector that is mounted in a communication path between specific devices and a protection-targeted device to monitor contents of communications delivered to the protection-targeted device, the illegal communication detector comprising: a recorder that records at least part of information transmitted from the specific devices to the protection-targeted device; a detector that regards one of the specific devices as a device of interest and detects, when at least part of the recorded information transmitted from the device of interest complies with a predetermined illegal communication standard rule, that the contents of communication are derived from an illegal communication. |
8707108 | 13355359 | 1 | 1. A computer-implemented method for identifying potential failures to deallocate memory by a target program, the method comprising: receiving, from at least one user computing device, memory information corresponding to memory use of a target program; generating, based on the received memory information, a weighted object graph, wherein the weighted object graph corresponds to a representation of a plurality of objects identified based on the received memory information, and wherein each object within the weighted object graph is weighted according to the portion of the received memory information which corresponds to the object; determining one or more patterns within the weighted object graph, each pattern corresponding to a collection of one or more objects within the weighted object graph; for each determined pattern, determining a frequency of the pattern within the weighted object graph; and ranking the determined one or more patterns based at least in part on the frequency of the pattern within the weighted object graph, wherein the rank of each pattern corresponds to a likelihood that the pattern is indicative of a failure to deallocate memory within the target program. |
20120109631 | 12916892 | 0 | 1. A method executed at least in part by a computing device for translating content feed data, the method comprising: receiving a formatted content having an activity event; receiving a language specific request; determining a preferred language associated with a client; translating portions of the formatted content to a language specific string by matching the activity event to an activity template from an activity template lookup table; transmitting the translated language specific string to the client. |
8024718 | 11284338 | 1 | 1. A method of optimizing address expressions within source-level code, wherein the source-level code describes the functionality of an application to be executed on a digital device, the method comprising: inputting a first source-level code that describes the functionality of the application, the first source-level code comprising address computation code and a plurality of arrays with address expressions in at least one programming loop construct, wherein the address computation code or one of the address expressions has nonlinear operations; and transforming the first source-level code into a second source-level code that describes substantially the same functionality as the first source-level code, wherein the second source-level code has fewer nonlinear operations to be executed than the first source-level code, and wherein the second source level code has the same number of loop constructs as the first source-level code, wherein the digital device comprises at least one programmable instruction set processor and wherein transforming the first source-level code into a second source-level code comprises: executing a first code transformation comprising algebraic code transformations and common subexpression elimination code transformations, after executing the first code transformation, executing a second code transformation comprising code hoisting, and after executing the second code transformation, executing a third code transformation comprising induction analysis. |
9208059 | 14028775 | 1 | 1. A method of debugging a data flow associated with an extract, transform and load (ETL) process, the method comprising: providing a user with a graphical representation of an ETL job, said graphical representation comprising individualized representations of one or more data sources, data destinations, and transform operations on data flowing from a data source to a data destination; receiving a user selection of a subset of said transform operations; providing the user with a selection menu for selecting one or more boundary conditions of the selected subset of transform operations, the boundary conditions comprising a set of replacement options for replacing the data source in the debug process, the replacement options comprising a source for generating random data for the selected transform operation and a source data file pointing to a defined location; and generating an execution script based on the received subset and the boundary conditions. |
8392676 | 12836186 | 1 | 1. A management method for managing a storage apparatus, wherein the storage apparatus manages, as different types of storage tiers, each of storage areas provided by multiple types of storage devices with different levels of performance, constitutes a pool from the different types of storage tiers, provides a virtual volume to a host system, dynamically allocates a storage area of specified size on a page basis from the pool to the virtual volume in response to a write request from the host system to the virtual volume, and regularly or irregularly switches a storage tier, from which a page is allocated, to another type of storage tier, depending on the number of accesses per unit time to the page allocated to the virtual volume, and wherein the management method comprises: a first step of detecting, as a high-load storage tier, a storage tier whose number of accesses per unit time has reached a performance threshold and whose used capacity has not reached a capacity threshold; a second step of detecting a virtual volume to which a page is allocated from a pool constituted from the high-load storage tier, selecting a virtual volume that is a migration candidate whose data is to be migrated, from among the detected virtual volume, and selecting, as a migration source pool, a pool from which a page is allocated to the virtual volume; a third step of selecting, as a migration destination pool, a pool whose at least one constituting storage tier has the number of accesses per unit time not reaching the performance threshold, and which is different from the migration source pool; a fourth step of deciding a migration candidate pair by combining the selected migration-candidate virtual volume and the selected migration destination pool; a fifth step of calculating, for each the migration candidate pair, response performance of an entire system before and after migration when data written to the migration-candidate virtual volume is to be migrated to the migration destination pool; a sixth step of deciding a migration candidate pair which is a migration object, based on the response performance of the entire system before and after the migration; and a seventh step of controlling the storage apparatus so that data of the migration-candidate virtual volume constituting the decided migration candidate pair will be migrated to the migration destination pool constituting the migration candidate pair. |
8655801 | 12084150 | 1 | 1. An apparatus for asynchronous adaptive, and parallel processing of at least one input data stream, comprising: a plurality of computational cores, a first input interface, operatively connected to each of said plurality of computational cores, configured for allowing said plurality of computational cores for simultaneously receiving said at least one input data stream; and each of said plurality of computational cores comprising properties having at least some statistical independency from other of said computational cores, said properties being set independently of each other of said computational cores, each core being able to independently produce an output indicating recognition of at least one previously learned signal responsive of at least one input data stream to said plurality of computational cores, wherein the plurality of computational cores are randomly pre-programmed over a statistical distribution a-priori to receiving said at least one input data stream to perform a unique and unchanged statistical function on said at least one input data stream to produce a corresponding plurality of unique outputs for said at least one input data stream, thereby ensuring that the at least one input data stream is simultaneously processed by the plurality of computational cores according to a large number of diverse patterns, and at least one decision unit for receiving said output from each of said computational cores and making an identification of said at least one input data stream based on each of said independently produced computational core outputs. |
20130335209 | 13803778 | 0 | 1. A computer-readable medium having instructions stored thereon that, when executed by a processor, cause the processor to convert an input into one or more haptic effects, the converting comprising: receiving the input; segmenting the input into a plurality of waveforms, wherein each waveform comprises at least a portion of the input; combining each waveform with an envelope to generate a grain, wherein a plurality of grains is generated, and wherein each grain comprises an amplitude parameter, a waveform parameter, an envelope parameter, and a duration parameter; combining the plurality of grains to generate a cloud, wherein the cloud comprises a representation of the plurality of grains; and generating the one or more haptic effects based on the cloud. |
20140075409 | 14024206 | 0 | 1. A method for the computer-aided generation of at least one part of an executable control program for controlling a control system having at least one electronic processor unit, the method comprising: describing a functionality of the control program at least partially in at least one graphical model; dividing the graphical model in hierarchical levels into submodels, a submodel of a hierarchical level being configured to be divided nested into submodels of a lower hierarchical level; providing present values (x) for options (X) for the compiling of the graphical model to program code; generating program code computer-aided with consideration of the values (x) of the options (X) from the model; and co-compiling the program code to the executable control program, wherein a value (x j ) for an option (X) for the compiling of the graphical model for at least two nested submodels of different hierarchical levels are preset, and the values (x j ) for the options (X) are taken into account in the computer-aided generation of program code for each submodel, and wherein an option (X) of the submodel, said option not provided with a value (x j ), at the lower hierarchical level assumes the value (x j ) of the corresponding option (X) of the submodel at the higher hierarchical level. |
8688443 | 12645589 | 1 | 1. A method comprising: producing a lattice of object hypotheses based at least in part on a plurality of reference objects identified in an image corresponding to a geographic location, wherein each of the plurality of reference objects is related to a physical object at the geographic location; receiving input speech information that includes a request for information associated with at least a first reference object of the plurality of reference objects; producing a lattice of speech hypotheses based on at least a first possible description included in the speech information; producing a lattice of scored semantic hypotheses based on at least the lattice of object hypotheses and the lattice of speech hypotheses; determining that a single semantic interpretation score of the lattice of scored semantic hypotheses exceeds a predetermined value; and providing requested information associated with the at least the first reference object of the plurality of reference objects. |
8395113 | 13319395 | 1 | 1. A method of tandem mass spectrometry (MS/MS) for use in a mass spectrometer characterized by the steps: (a) providing a sample of precursor ions comprising a plurality of ion types, each ion type comprising a respective mass or range of masses; (b) generating a mass spectrum of the precursor ions using the mass spectrometer so as to determine a respective mass value or mass value range for each of the precursor ion types; (c) estimating an elemental composition for each of the precursor ion types based on the mass value or mass value range determined for each respective ion type; (d) generating a sample of fragment ions comprising plurality of fragment ion types by fragmenting the plurality of precursor ion types within the mass spectrometer; (e) generating a mass spectrum of the fragment ion types so as to determine a respective mass value or mass value range for each respective fragment ion type; (f) estimating an elemental composition for each of the fragment ion types based on the mass value or mass value range determined for each respective fragment ion type; and (g) calculating a set of probability values for each precursor ion type, each probability value representing a probability that a respective fragment ion type or a respective pair of fragment ion types was derived from the precursor ion type. |
20060150018 | 11285627 | 0 | 1. A method to diagnose a failing system element causing a symptom in a system-under-test, said method comprising the steps of: a. defining a diagnostic symptom tree comprising a plurality of symptom roots and a dependent plurality of lower nodes, the plurality of lower nodes comprising a plurality of function nodes depending from the symptom roots, a plurality of sub-function nodes depending from the function nodes, a plurality of element nodes depending from the function or sub-function nodes, and a plurality of penultimate failure mode leaves depending from the element nodes; b. associating test information with each of the function and sub-function nodes and the failure mode leaves; c. selecting one of the plurality of symptom roots responsive to identifying a symptom; d. performing the test information associated with the selected symptom root, thereby generating a symptom root test result; e. responsive to a positive symptom root test result: e1. performing the associated test information of each of the symptom tree depending nodes and failure mode leaves responsive to each positive test result; and e2. identifying a function or sub-function or element node associated to a lowest symptom tree node or failure mode leaf for which a test is positive; and f. if no test result is positive, advising that no failing function or sub-function or element is found. |
7813903 | 11104607 | 1 | 1. A particle simulation method, comprising: simulating, in a computer, dynamic motion of particles and allowing particle states of the particles to be invalid; and adjusting the particle states of the particles toward valid state, wherein the particles when linked together comprise primitives comprising spheres, edges, triangles and surfaces. |
8417533 | 10255901 | 1 | 1. A method for managing the process of dispatching firefighters in response to calls for assistance, comprising the steps of: providing instructions to a dispatcher on a medium readable by the dispatcher, said instructions adapted for use by the dispatcher in receiving a call from a caller for firefighter assistance regarding an incident, wherein said instructions comprise a logical tree comprising pre-scripted inquiries, and wherein said logical tree is traversable using caller responses to said pre-scripted inquiries; automatically assigning by a processor a determinate value to said incident by traversing said logical tree, wherein assigning said determine value comprises, automatically determining by the processor a type of said incident by traversing a first branch of said logical tree, automatically determining by the processor a criticality of said incident by traversing one of a plurality of second branches of said logical tree, wherein said second branch is selected based on said incident type, wherein said traversing of said first branch provides for automatically determining if the caller is in danger and, upon determining that the caller is in danger, traversing to a critical caller branch of said logical tree, wherein the critical caller branch comprises, pre-scripted instructions directing the dispatcher to, inquire if the caller is entrapped, inquire as to the location of the caller, instruct the caller to safety if safe to do so, and resume traversing said logical tree; and directing a dispatch of firefighter assistance based on said determine value. |
7830387 | 11557301 | 1 | 1. A computer implemented system comprising the following computer executable components: a graphical processing unit that is divisible to a plurality of processing resources, each resource is associated with a node and is controllable independent of other resources, wherein the nodes comprise multiple engines that are assigned execution threads and allocated dynamic memory access (DMA) buffers; a scheduler, for each node, that schedules operations for the multiple engines, wherein the scheduler employs synchronization primitives shared among the plurality of processing resources to process ordering interactions therebetween; and a tracking component determines when operations on a specified DMA buffer require synchronization, wherein if synchronization is required and the specified DMA buffer is busy, the operations are blocked until the specified DMA buffer is available, and if synchronization is not required and the specified DMA buffer is busy, the operations are allowed on the specified DMA buffer. |
7676541 | 10158419 | 1 | 1. A computing system comprising a processor and memory that stores a first node module in which agent programs can execute, the first node module comprising: (a) a peer discovery module that receives a window from a discovery system in order to detect a second node module within a distributed computing architecture, wherein 1. the window comprises a list of other node modules within the distributed computing architecture, 2. the list comprises the second node module, 3. the window contains a subset of all node addresses in an unbounded computing space, 4. the window overlaps with at least another window so that the first node module is able to interact with any node module of the unbounded computing space, and 5. the window is configured based on a first parameter “N” corresponding to a number of neighboring node modules that have a higher IP address than an IP address of the first node module and a second parameter “M” corresponding to a number of preceding neighboring node modules that have a lower IP address than the IP address of the first node module; and (b) a peer interaction module though which the first node module communicates with the second node module in accordance with the window, wherein the window comprises an identifying attribute of the second node module, and wherein the first node module is configured to introduce an agent program that can be sent to the second node module, though the peer interaction module, and wherein the agent program executes in the second node module, wherein the discovery system provides the window and determines the first and second parameters “N” and “M” such that the first node module is able to interact only with node modules contained in the window provided by the discovery system. |
7685159 | 11043790 | 1 | 1. A computer implemented method, comprising: providing a computing system comprising a content framework system, wherein said content framework comprises a content infrastructure, a content flow management system, an access and security system, a registry tool, a content manipulation system, a joint development system, a community system, an association system, and a user interface system, wherein each of said content infrastructure, said content flow management system, said access and security system, said registry tool, said content manipulation system, said joint development system, said community system, said association system, and said user interface system are separate and independent from each other, wherein the content infrastructure comprises independent content management systems, wherein the content infrastructure comprises a plurality of server computers, wherein each of said independent content management systems is located in a separate and independent associated server computer of said plurality of server computers, wherein each of said independent content flow management systems, said access and security system, said content manipulation system, said joint development system, said association system, and said community system comprises a portion located in an different associated server computer of said plurality of server computers, wherein said association system comprises association tools, wherein each said associated server computer of said plurality of server computers comprises an association creation tool of said association tools, wherein each of said independent content management systems comprises content, wherein said independent content management systems consist of a shared source system, a distribution system, a management system, and a remote services system, wherein said shared source system consists of a source database consisting of source code, wherein said distribution system consists of a binaries database consisting of user generated executable code and binaries metadata, wherein said management system consists of a content database consisting of an HTML object, an XML object, a SGML object, a word processing object, a JPG object, and a PDF object, and wherein said remote services system consists of a services database consisting of shared routines used by a plurality of software applications; controlling, by a computer processor of said computing system, a flow of said content between each independent content management system of said independent content management systems, wherein said computer processor executes said content flow management system to perform said controlling; allowing, by said content manipulation system, teams within an organization to create, modify, and promote different types of content within said independent content management systems, wherein said teams consist of technical teams, business process teams, supply chain teams, manufacturing line teams, marketing teams and, management teams; allowing, by said community system, said teams to collaborate and add value to said content; allowing, by said joint development system, said teams to leverage knowledge and technology regarding said content, wherein said joint development system comprises a shared source tool; providing access, by said community system, to said shared source tool; locating, accessing, and modifying, by said shared source tool, said source code and said user generated executable code; generating by a first association creation tool of said association creation tools, a first set of associations metadata linking said content within said independent content management systems together, wherein said associations metadata comprises a map of said content; generating by said registry tool, a first registry defining said first set of associations metadata; receiving, by said first association creation tool from a user, a command for updating at least one portion of associations metadata of said first set; updating, by said first association creation tool in response to said command, said at least one portion of associations metadata of said first set; visually displaying on a display apparatus of said content framework system, by a user interface system within said content framework system, said content and said first set of associations metadata, wherein said display apparatus consists of a computer screen; generating by said registry tool, a second registry defining said first set of associations metadata comprising said at least one portion of associations metadata that has been updated; allowing, by said content flow management system, said teams within said organization to submit a program/component/library to a project for storage; allowing, by a joint development infrastructure within said content framework system, said teams to leverage knowledge and technology associated with said content; allowing, by a community infrastructure within said content framework system, said teams to collaborate and add value to said content; controlling by said access and security system, access to said content, wherein said access and security system comprises an access and security tool and a control tool, wherein said control tool is used by a governance party controlling specific parties that access or manipulate said content, and wherein said access and security tool comprises tools allowing administrators to control users who may access or manipulate said content; and defining, by said access and security system, users for said shared source tool. |
20140006025 | 13538581 | 0 | 1. A computer system for providing audio-activated resource access for user devices, the computer system comprising: a processor; and a memory coupled to the processor, the memory storing instructions to cause the processor to perform operations comprising: capturing audio at a user device; transmitting an identifier of a speaker of the captured audio identified by a speaker recognition system to a server system to determine a corresponding speaker entry; and receiving a resource corresponding to the speaker entry. |
9280513 | 13633848 | 1 | 1. A method comprising: determining whether a default matrix processor-to-processor routing algorithm would deliver an inter-processor message from a first matrix processor to a second matrix processor in a chip comprising a microprocessor matrix of mesh-interconnected matrix processors, wherein the message routed according to the default matrix processor-to-processor routing algorithm would be routed from the first matrix processor by a data switch in each matrix processor along a default message path originating at the first matrix processor; in response to determining whether the default matrix processor-to-processor routing algorithm would deliver the message from the first matrix processor to the second matrix processor, when the default processor-to-processor routing algorithm would not deliver the message from the first matrix processor to the second processor, determining whether designating a third matrix processor as a proxy for the message would cause the message to be delivered to the second matrix processor using the default matrix processor-to-processor routing algorithm from the first matrix processor to the third matrix processor and subsequently from the third matrix processor to the second matrix processor, wherein the third matrix processor is not in the default message path; in response to determining whether designating the third matrix processor as a proxy for the message would cause the message to be delivered to the second matrix processor, designating the third matrix processor as a proxy for the message when designating the third matrix processor as a proxy for the message would cause the message to be delivered to the second matrix processor; and determining whether the default processor-to-processor routing algorithm would deliver the inter-processor message from the first matrix processor to the second matrix processor upon each hard reset of the microprocessor matrix. |
8489800 | 12966805 | 1 | 1. In a computing system comprised of a processor and virtualization software including a guest operating system (OS) that utilizes a guest domain access control register (DACR) containing domain access information and guest page tables including first level page tables (L1 page tables) and second level page tables (L2 page tables), which guest page tables contain (a) domain identifiers used to obtain domain access information from the guest DACR and (b) access permission information, wherein the domain access information and the access permission information are combined to provide an effective guest access permission; the virtualization software providing a shadow page table, wherein: (a) domain identifiers in the shadow page table are used to identify domain access information in the processor DACR that are mapped from the domain access information in the guest DACR; and (b) access permissions in the shadow page table that are mapped from the effective access permission information in the guest page tables and guest DACR; a memory management unit (MMU) in the processor traverses the shadow page table, accesses the processor DACR, and combines the mapped domain access information in the processor with the mapped access permission in the shadow page table to reflect the guest intended effective access permissions while isolating the guest from the virtualization software; the shadow page table comprises a shadow privilege page table that is traversed by the MMU when the guest operates in privileged mode and a shadow user page table that is traversed by the MMU when the guest operates in user mode; wherein: the shadow page table comprises shadow L1 page tables and shadow L2 page tables; and each L2 page table is identified by the following tuple: guest L1 descriptor value*{User, Privileged}*{Client, Manager} wherein: (a) the guest L1 descriptor value identifies a guest section the shadow L2 page table may back (referred to as L2-guest-L1); (b) {User, Privileged} (referred to as L2-us-pr) indicates whether the shadow L2 descriptor may be referenced by a shadow L1 descriptor used when the guest is executing in user mode or a shadow L1 descriptor used when the guest is executing in privileged mode; and (c) {Client, Manager} (referred to as L2-dom) matches the domain access value implied by any referencing shadow L1 descriptor in the current shadow page table with the current guest DACR a method for providing shadow page tables and processor DACR settings that virtualize processor memory protection, which method comprises: the virtualization software maintaining: two shadow L2 page tables for each section of guest address space covered by a shadow L1 descriptor, wherein one shadow L2 page table is used when the domain access value for the section in the guest DACR is Client access, and the other shadow L2 page table is used when the domain access value for the section in the guest DACR is Manager access; and a mapping (referred to as φ) from guest domain identifier to a set of shadow L2 page tables that back guest L1 sections marked with the domain identifier; and, with each such shadow L2 page table, a set of back-pointers to “potentially referencing” shadow L1 descriptors, where potentially referencing shadow L1 descriptors include: (a) shadow L1 descriptors that in the current state reference the shadow L2 page table; and (b) valid shadow L1 descriptors corresponding to guest L1 descriptors with value L2-guest-L1 and where the privilege level of the shadow L1 page table matches L2-us-pr. |
20020169938 | 10017488 | 0 | 1. A method of performing remote address translation in a multiprocessor system, comprising: determining a virtual address at a local node; accessing a local connection table at the local node to produce a system node identifier for a remote node; communicating the virtual address to the remote node; and translating the virtual address to a physical address at the remote node. |
7630972 | 11651102 | 1 | 1. A method for searching data using a network device in communication with a client device, comprising: receiving, from the client device, one or more search terms; determining at least one concept based on an analysis of the one or more search terms; identifying one or more concept-specific data sources over which to perform searches based on the at least one concept; performing a search over each of the one or more concept-specific data sources based at least on the search term to generate a plurality of clusters, search results from each concept-specific data source comprising a different cluster in the plurality of clusters; determining a relevance score for each result within each cluster based on user specific contextual data for a user of the client device; for each cluster in the plurality of clusters, employing at least the relevance scores of each result within the respective cluster to determine a respective cluster score; generating an ordered listing of each of the plurality of clusters based on the respective cluster scores; and displaying at the client device at least a portion of the ordered plurality of clusters. |
20080181322 | 12022307 | 0 | 1. A system for equalizing multiple input-multiple output (MIMO) channels, comprising: a MIMO equalizer that receives a channel output vector input, divides the input into two vectors, a first vector that remains a complex number and a second vector that contains only real numbers, separates the second vector into its real and imaginary components, and regroups the first and second vectors to generate a hybrid channel output vector containing both real and complex coefficients. |
20150356302 | 14763172 | 0 | 1. A system comprising: a browser layout engine to load a web application; a scanner to simulate user actions on user interface elements of the web application; a document analyzer to traverse a structure of the web application based on rules and update the rules used to transform complex Document Object Model of the web application into a set of actionable tokens; and a visualization module to present a part of the web application with one or more user interface elements of the part highlighted based on the updated rules. |
20170242409 | 15133502 | 0 | 1. A method for configuring a test device set up for testing an electronic control unit via a configuration system, the method comprising: executing a software model of a technical system in the test device, the software model communicating via an input/output interface of the test device with a device connected to the test device, the configuration system having a first configuration element of a first element type and a second configuration element of a second element type, assigning properties of the test device to the configuration elements, a communication between the connected device and the software model being configured with the properties; sorting the properties in the configuration system, the sorting being switchable between sorting types, the sorting types including a union set sort, an intersection sort, and a condensing sort; and sorting the properties of the union set sort such that the properties assigned to the first configuration element form a joined set that contains only the properties assigned to the first configuration element, and the properties assigned to the second element form a joined set that contains only the properties assigned to the second configuration element, wherein the intersection sort sorts the properties such that a joined set of the properties is formed whose assigned configuration elements are of the same element type, and wherein the condensing sort occurs such that a joined set is formed of the properties that are included in both the first and second configuration elements. |
20040003023 | 10183443 | 0 | 1. A method of selecting a processor of a computer system on which to launch a processing thread comprising the following steps: comparing a processor load with a volunteer load of a volunteer information; and if the processor load is lower than the volunteer load, updating the volunteer information with the compared processor information and if the compared processor is the current volunteer and the compared processor load is higher than the volunteer load, updating the volunteer information with the compared processor information. |
8704071 | 13270972 | 1 | 1. A method for generating musical tones, the method comprising the acts of: generating a plurality of raw data sequences using at least one recursive system implemented by a computing system; and converting, using the computing system, the plurality of raw data sequences into a plurality of sequences of musical tones that follow a set of aesthetic music principles, wherein the act of converting comprises at least one of a and b: a) mapping, using the computing system, the plurality of raw data sequences into a plurality of potential sequences of musical tones, and selecting, using the computing system, sequences of musical tones that follow the set of aesthetic music principles from the plurality of potential sequences of musical tones; b) mapping, according to the set of aesthetic music principles, the plurality of raw data sequences into the plurality of sequences of musical tones, at least one of the aesthetic musical principles including a requirement specifying a characteristic other than (1) pitch duration or (2) a scale or set of scales to which to map. |
20100138420 | 12629483 | 0 | 1. A method including: receiving a specification of multiple contexts that are related according to a hierarchy; determining relationships among three or more metadata objects; grouping at least some of the metadata objects into one or more respective groups, each of at least some of the groups being based on a selected one of the contexts and being represented by a node in a diagram; determining relationships among the nodes based on the relationships among the metadata objects in the groups represented by the nodes; and generating a visual representation of the diagram including the nodes and the relationships among the nodes. |
20140201441 | 13742875 | 0 | 1. A method comprising: performing a copy-on-write in response to a write error from a first system, where the copy-on-write copies to a second system. |
9953106 | 14488535 | 1 | 1. A computer-implemented method of dynamically generating traversal code for a graph analytics environment, the method comprising: in one or more processing systems, identifying a query expression from a relational analytics environment, wherein the query expression is written in a first language for a relational database; generating the traversal code for the graph analytics environment based on the query expression, wherein the traversal code is written in a second language; executing the traversal code in the graph analytics environment on a graphical database; and communicating results of the traversal code to the relational analytics environment, wherein communicating the results of the traversal code to the relational analytics environment comprises communicating the results of the traversal code to the relational analytics environment to update a relational database in the relational analytics environment. |