Datasets:

patent

/

AIPD_hardware_claim_one

like 0

8001068

11422195

1. A method for calibrating the relationship between management-inherent complexity metrics deriving from the management structure of a system and human-perceived complexity of information technology management, said method comprising: obtaining a set of management-inherent complexity metrics from quantified results of a complexity analysis, the complexity analysis quantifying a complexity of a configuration procedure between the system and an administrator of the system; obtaining a set of human-perceived complexity metrics from user studies from the administrator of the system; constructing a control model on a first processor, said control model identifying a set of dominant indicators selected from said set of management-inherent complexity metrics; establishing a value model on a second processor, said value model mapping from said set of dominant indicators selected from said set of management-inherent complexity metrics to said set of human-perceived complexity metrics.

8645825

13222783

1. A method comprising: receiving, by a computing device, an n-gram of characters; identifying, in a local cache of the computing device, cached autocomplete suggestions for the n-gram; requesting, at a first time and over a network, additional autocomplete suggestions for the n-gram; preventing, by the computing device, presentation of the cached autocomplete suggestions until a presentation event occurs, wherein the presentation event comprises (i) receiving the requested additional autocomplete suggestions by the computing device or (ii) the end of a predetermined period after the first time; determining that the presentation event has occurred; and in response to determining that the presentation event has occurred, presenting one or more of the cached autocomplete suggestions or the additional autocomplete suggestions.

8782242

13273064

1. A system for associating a virtual machine (VM) with a computing resource, the system comprising: a memory for storing a placement rule indicating one of the following: that a first virtual machine (VM) is to be co-located with a second VM during execution of the first and a second VM, or that the first VM is to be separated from the second VM during execution of the first and second VMs, wherein the first VM is associated with a first computing resource container; and a processor coupled to the memory and programmed to: when the first VM is to be co-located with the second VM, associate the second VM with the first computing resource container and provide the placement rule to the first computing resource container, wherein the first computing resource enforces the placement rule; and when the first VM is to be separated from the second VM and no second computing resource container is available, associate the second VM with the first computing resource container and provide the placement rule to the first computing resource container, wherein the first computing resource container enforces the placement rule.

20110054881

12611051

1. computer-implemented method, comprising: receiving, by a computing device, a string array of numeric data in a local language, wherein the numeric data used in dynamic calculations performed by an application of the computing device; converting, by the computing device, characters of the string array of numeric data from local language characters to corresponding English digits in an American Standard Code for Information Interchange (ASCII) format by utilizing a number conversion matrix; and providing, by the computing device, the English digits in the ASCII format to a processing function of the application for use with the dynamic calculations of the application.

20090100069

12104289

1. A node in a distributed indexing network in which each node has an address in an index address space and in a separate network address space, said node comprising: machine readable memory for storing program instructions and data structures; one or more processors for executing program instructions stored in said memory; program instructions stored in said memory for: associating a subset of the index address space with the node; maintaining a contact list, which stores the index space and network address for each of a plurality of contacts, each of which is another node in said indexing network; treating a minority of said contact list as direct contacts and the rest of said contacts as indirect contacts; attempting to communicate with each direct contact with a minimum frequency, to determine whether or not that direct contact is still a member of the network; and responding to a determination that a given direct contact is no longer functioning as a member of the network by finding a new direct contact to replace that given contact and replacing the replaced direct contact in the node's contact list with the index and network address of the replacement contact; wherein the node responds to a search request for a given index address that does not fall in the subset of the index address space associated with the node by using, as the next node to send such a search request to, the address on its contact list that is closest to the given address, whether that address is a direct or indirect address.

7581142

11616086

1. A method comprising: executing multiple application modules which access memory in a single memory address space; prior to a memory access to an application state by an application module, detecting whether the state of the application module is corrupted; when the state of the application module is corrupted, micro-rebooting the application module; and when the state of the application module is not corrupted, permitting the application module to access the at least one block of memory allocated to the application module up to completion of a current execution of the application module, recalculating the MIC for the at least one block of memory allocated to the application module immediately after the execution of the application module, and replacing the stored MIC for the at least one block of memory allocated to the application module with the recalculated MIC for the at least one block of memory allocated to the application module; wherein each of the application modules is allocated at least one block of memory in said single data memory space, and said step of detecting whether a state of the application module is corrupted comprises: calculating a memory integrity code (MIC) for the at least one block of memory allocated to the application module as a function of content stored in the at least one block of memory allocated to the application module; comparing the calculated MIC with a stored MIC for the at least one block of memory allocated to the application module; when the calculated MIC is identical to the stored MIC for the at least one block of memory allocated to the application module, determining that the state of the application module is not corrupted; and when the calculated MIC is not identical to the stored MIC for the at least one block of memory allocated to the application module, determining that the state of the application module is corrupted.

6129681

08934595

1. An apparatus for analyzing information relating to physiological and psychological conditions comprising a neural network receiving a physiological fluctuation signal as an input and estimating psychological conditions based on frequency variations of the physiological fluctuation signal.

8321467

11609172

1. A computer readable medium having stored thereon a plurality of instructions, the plurality of instructions including instructions which, when executed by a computer, cause the computer to perform steps of a method for enabling a databinding framework for communicating between an application and a database, said method comprising the steps of: generating a code of databinding files to bind data of the database to a program of the application wherein said code identifies tables to persist the data in the database, wherein said code generates a table of metadata from the identified tables, wherein said code generates stored procedures from the metadata table, generates value objects (VO) from the metadata table and generates at least one XML binding definition from the metadata table; and integrating the generated code of the stored procedures to the VOs via the XML binding definitions into the application when the application is run.

20110004931

12829120

1. A computer configured for a connection to a network of computers including the Internet, comprising: a microprocessor including a master controlling device that is configured using hardware and firmware, at least four other microprocessors; and the master controlling device of the computer being further configured to allow a user of the computer to control the microprocessors; an internal hardware firewall that is located between a protected portion of the computer and an unprotected portion of the computer; said protected portion of the computer including at least said microprocessor including a master controlling device, said unprotected portion of the computer including said at least four other the microprocessors, said at least four other unprotected microprocessors being separate from and located outside of said internal hardware firewall; said hardware firewall is used to make said protected portion of the computer inaccessible by a network including the Internet when the computer is connected to the network including the Internet; and said hardware firewall permitting access by the network including the Internet to said unprotected portion of the computer including said at least four other microprocessors for an operation with another computer in the network including the Internet when the computer is connected to the network including the Internet.

20150370858

14409599

1. A method for providing an output data stream in a network system, the method comprising: receiving a request for a desired output data stream; identifying at least one input data stream on the basis of the desired output data stream; identifying at least one relationship between the at least one identified input data stream and the desired output data stream; determining at least one operator on a basis of the at least one identified relationship; creating a query for generating an output data stream corresponding to the desired output data stream by applying the at least one operator to the at least one identified input data stream; the at least one input data stream being identified by referring to a stored mapping between a data information included in the received request and at least one type of data included in a stored data schema, the data schema associating each type of data with at least one input data stream; and the at least one relationship being identified by referring to the stored mapping.

9992280

15587898

1. A computer-implemented method for managing migration of an application, the method comprising: establishing a source dataset having a set of source features of a source which includes the application; determining for the application, by an evaluation of the source dataset and a set of legacy features using a support vector machine, a first set of migration plans, wherein determining the first set of migration plans includes: identifying a group of the set of legacy features meeting a similarity threshold to the source dataset; identifying a portion of the set of legacy features meeting a cost measure threshold of the source dataset; and identifying a migration plan having a set of stability scores of a set of probabilistic extrapolations of the application to the target within a stability threshold; and migrating, based on the first set of migration plans, the application from the source to a target.

20150286820

14247400

1. A method of determining an execution state of a software application or process in a mobile device, the method comprising: monitoring in a processor of the mobile device an activity of the software application or process to collect behavior information; generating a behavior vector based on the collected behavior information; and determining the execution state of the software application or process by applying a classifier model to the behavior vector.

8508406

12933279

1. Method of estimating a position of a satellite receiver, comprising: computing a weight matrix; and computing, by a programmed processor, an estimated position of the satellite receiver based on the weight matrix; characterized in that computing the weight matrix includes: computing quantities indicative of degradations experienced by satellite signals and due to multipath interference; computing the weight matrix based on the computed quantities; and wherein computing the weight matrix includes: classifying received signals into elevation classes based on elevations of the satellites that have emitted the signals; for each elevation class, classifying the signals belonging to the elevation class into degradation classes based on the corresponding degradations, each degradation class having a corresponding cardinality defined by the number of signals with degradations falling within the degradation class; for each elevation class, identifying different distribution functions which globally fit the distribution of the corresponding numbers of signal with degradations falling within the corresponding degradation classes; for each elevation class, associating each degradation class with one of the corresponding distribution functions that satisfies a given criterion in relation to the number of signals with degradations falling within the corresponding degradation class; and computing the weight matrix based on quantities related to parameters of the distribution functions associated with the degradation classes.

20140164292

14183019

1. A method comprising: identifying one or more jobs and one or more job executors; identifying one or more needs for the one or more job executors based at least upon respective outcomes of the one or more jobs; scoring one or more offerings for the one or more needs against the one or more jobs and respective outcomes; scoring a solution for the one or more offerings based on the one or more jobs and respective outcomes; calculating one or more costs for the solution; determining, using the one or more costs, if the solution can be delivered to create an investment rate of return (IRR) for the solution.

20130132418

13300431

1. A method for discovering a keyword query corresponding to an input collection of documents taken from a candidate pool, the method comprising: (a) initializing a working set to be an input set; (b) processing the working set until no documents remain in the working set, wherein said processing comprises: selecting a document from the working set and extracting a list of snippets in the selected document; for each snippet, executing a set of proximity queries based on selected terms in that snippet, and finding all possible proximity queries that return less than N query results from the candidate pool; selecting a query from said proximity queries, based on: a first criterion for the selected query returning the greatest number of working set documents, and a second criterion for the selected query returning the smallest number of documents not in the working set; and removing, from the working set, documents returned by the selected query; and (c) returning, as the discovered query, the disjunction of selected queries.

6119129

09107048

1. A multi-threaded journaling method of logging transactions in a configuration database, the method comprising: receiving a database transaction directed to the configuration database, the database transaction having one or more specific updates effecting the configuration database; inserting an initial entry corresponding to the database transaction into a journal file, the initial entry including a transaction identifier; inserting one or more subsequent entries into the journal file corresponding to the one or more specific updates to the configuration database associated with the transaction, the subsequent entry containing the transaction identifier and data relating to the specific update; determining whether each one of the one or more specific updates to the configuration database is successfully completed; and inserting a final entry into the journal file according to the determination of whether each one of the one or more specific updates is successfully completed.

7543278

10966855

1. A computer-implemented method comprising: within an automated user interface test environment, a testing program that emulates keyboard and mouse data invoking a request for choosing a user interface element that is to be made visible; the testing program determining at least one parent element of the user interface element; the testing program performing a make child visible action for the at least one parent element of the user interface element; and the testing program ensuring that the user interface element is selectable; wherein the testing program performing a make child visible action comprises: a) if the parent element is scrollable, then a scrolling component of the testing program scrolling the parent element in a move direction until a bounding rectangle of the parent element and a bounding rectangle of the user interface element overlap, wherein there are N child elements of the parent element, and wherein the scrolling the parent element comprises: searching for a visible child element of the N child elements by recursively checking for visibility of each nth child element of the N child elements, initially n=N/2 or n=N/3, and at each successive recursion level n=n/2; once the visible child element is found, finding a first visible child element of the N child elements using a binary search; and determining, based on a location of the first visible child element and a location of the user interface element, the move direction for scrolling the parent element; b) if the parent element is expandable, then an expanding component of the testing program expanding the parent element; c) if the parent is not at top of the user interface element hierarchy, then a component of the testing program moving up one level of the hierarchy such that a grandparent of the user interface element is the new parent element and the parent element of the user interface element is the new user interface element.

20040010665

10345873

1. A method of limiting central data store access during a workflow, comprising the steps of: (a) performing a function in a step of a workflow; and (b) determining whether to update a first data store with information related to said workflow after performing said step (a).

9767158

14079862

1. A method for a server computer system comprising: identifying, by a processing device in a content sharing platform, a bucket comprising a plurality of content items associated with a group of users of the content sharing platform that have similar interests; associating a bucketing token pertaining to the bucket with each of the plurality of content items, the bucketing token comprising a unique identifier that identifies the plurality of content items as being associated with the group of users of the content sharing platform that have similar interests; receiving a request for the bucketing token from a ranking service; and providing the bucketing token to the ranking service, the ranking service to use the bucketing token to determine, with respect to a first user of a social network platform, a ranking score for a content item of the plurality of associated content items in view of one or more interests of the first user of the social network platform that is separate from the content sharing platform.

8566280

13149374

1. A system for replication in a grid based environment, comprising: a processor; storage coupled to the processor, wherein the storage stores computer program instructions, and wherein the computer program instructions, when executed by the processor, performs operations, the operations comprising: creating a grid command structure; and at an authorized node in a grid of nodes, inserting a Data Definition Language (DDL) operation into the grid command structure; in response to determining that the DDL operation is for creating a table and that auto-registration is enabled for the table, posting a create replicate grid message in the grid command structure with a replicate name to be created, a database, an owner, and the table; activating full row logging for the table; and propagating the DDL operation from the authorized node to one or more other nodes in the grid of nodes at the end of a transaction that inserted the DDL operation into the grid command structure.

20060020875

10896268

1. A method for decoding a data symbol sequence previously encoded using one or more unique code word polynomials, wherein the encoding process uses at least one unique code word polynomial more than once, the method comprising the steps of: computing a set of unique branch metrics based on the data symbol sequence using the unique code word polynomials, wherein the number of branch metrics computed is 2 d-1 , where d is the number of unique code word polynomials; storing the computed set of unique branch metrics; calculating path metrics and decision bits based on the stored set of unique branch metrics and path metrics of previous feeding state; and generating a decoded data symbol sequence based on the computed decision bits.

8352593

12764865

1. A method for providing autonomic policy management of a networked system, comprising: identifying behavior goals associated with the networked system; expressing goals as thresholds on values of a set of observables representing properties of a managed system or as thresholds on values of a set of resources used to service requests from applications; identifying workload characteristics of the networked system; determining resource utilization of the networked system; determining whether the identified behavior goals are being met based on the identified workload characteristics and determined resource utilization; and autonomically adjust the identified workload characteristics and determined resource utilization in response to a determination that the identified behavior goals are not being met, whereby, the autonomic adjustment provides for dynamically adjusting the identified workload characteristics and the determined resource utilization to a level in which the identified behavior goals are being met.

7711687

10807388

1. A computer implemented method for creating, formatting or editing a database for representing a three dimensional physical environment where a wireless communications network will be deployed, comprising the steps of: accepting at least one raster image representing a physical environment in which an in-building or campus communications network is or will be deployed; verifying the sufficiency of said at least one raster image to provide a useful definition of said three dimensional physical environment, said verifying step producing a verified set of data defining said three dimensional physical environment, wherein said verifying the sufficiency step includes scaling said at least one raster image; notifying a user of results of said verification of sufficiency; using the resulting verified set of data to generate at least one formatted drawing or a set of formatted data which includes at least one or more objects for use in and being transportable to a communications engineering or network management application; and rendering a three dimensional view representative of said physical environment using the drawing or set of formatted data having the at least one or more objects.

7509335

11832034

1. A method, in a data processing system, for processing a request directed to a Java Server Page (JSP) using a JSP engine, comprising: receiving the request for the JSP by an extensible JSP resource manager system programming interface, wherein the extensible JSP resource manager system programming interface is programmed default behavior of the JSP engine for creating and loading JSP resources to be overridden without modifying the JSP engine, wherein the extensible JSP resource manager system programming interface includes a JSP translation context manager, a JSP input source manager, a created JSP resource manager, and a JAVA compiler manager; determining by the JSP translation context manager if an extensible translation context has been defined for the JSP to which the request is directed, wherein the extensible translation context defines one or more alternative mechanisms for generating a JSP servlet from JSP input source data than is provided by the JSP engine; generating a first JSP servlet based on the extensible translation context if an extensible translation context has been defined for the JSP; generating a second JSP servlet based on a default translation context if an extensible translation context has not been defined for the JSP; and processing the request using one of the first JSP servlet and the second JSP servlet.

8417755

12474175

1. A system for reducing memory traffic and power consumption in a processing environment by efficiently solving a consistent set of linear equations represented by AX=B, said system comprising: one or more memory modules, wherein said one or more memory modules store the matrices A and B; and one or more processor modules, wherein said one or more processor modules: a) transform the rows of augmented matrix [A|B] to form [A′|B′], such that the rows of A′ are zero, effectively zero, or part of an orthonormal set, and form one or more solution features, including at least one of: i) a particular solution formed as (A′)*B′, and ii) a null space projection operator formed as I n −(A′)*A′; b) transform the rows of augmented matrix [A|I m ] to form [A′|M], such that the rows of A′ are zero, effectively zero, or part of an orthonormal set, and form one or more solution features, including at least one of: i) a generalized inverse G formed as (A*)M, ii) a particular solution formed as (A′)*MB or GB, and iii) a null space projection operator formed as I n −(A′)*A′ or I n −GA; or c) transform the rows of augmented matrix [A|B|I m ] to form [A′|B′|M], such that the rows of A′ are zero, effectively zero, or part of an orthonormal set; and form one or more solution features, including at least one of: i) a generalized inverse G formed as (A′)*M, ii) a particular solution formed as (A′)*B′, (A′)*MB or GB, and iii) a null space projection operator formed as I n −(A′)*A′ or I n −GA.

20080192057

11672692

1. A method for converting an input stream of graphics primitives to one of a plurality of predetermined output streams of graphics primitives, comprising the steps of: recognizing one of a plurality of predetermined sequence patterns in the input stream of graphics primitives; determining whether the recognized one of the plurality of predetermined sequence patterns in the input stream of graphics primitives can be converted into the one of the plurality of predetermined output streams of graphics primitives; identifying a number of vertices in the recognized one of the plurality of predetermined sequence patterns in the input stream of graphics primitives; reordering the identified number of vertices in the recognized one of the plurality of predetermined sequence patterns in the input stream of graphics primitives into a predetermined pattern corresponding to the one of the plurality of predetermined output streams of graphics primitives; and outputting the predetermined pattern corresponding to the one of the plurality of predetermined output streams of graphics primitives to one or more graphics processing components.

9003168

11061696

1. A method comprising: processing signals in a processor system including first and second conjoined-cores; and sharing a single memory interconnection network port for communicating signals of the first and second conjoined-cores such that the first conjoined-core issues requests through the single memory interconnection network port to a memory bank on odd cycles and the second conjoined-core issues requests to the memory bank on even cycles.

7899803

12033823

1. A method for fulfilling an Internet search request for information related to a user's search term, the method steps comprising: (a) accepting a search term from the user; (b) automatically selecting a plurality of search Views having dynamically computed degrees of relevance to the search term, wherein the relevance is determined utilizing at least one relevancy criterion, wherein each View comprises a unique combination of data presentation, processing widgets, and preselected data sources from which search results are obtained for the View; (c) displaying the plurality of search Views to the user; (d) accepting user selection of a View; (e) obtaining search results based on the search term by utilizing an instruction set for the selected View; and (f) displaying the search results within the selected View to the user.

7913170

09742946

1. A method for propagating type information for hardware device nodes in a graphical program, wherein the method operates in a computer including a display screen and a user input device, the method comprising: displaying on the display screen of the computer a first hardware device node in the graphical program in response to user input, wherein the graphical program comprises a plurality of interconnected nodes or icons, wherein the plurality of interconnected nodes or icons visually indicate functionality of the graphical program; associating the first hardware device node with a hardware device; displaying on the display screen a second hardware device node in the graphical program in response to user input; connecting the first hardware device node to the second hardware device node in response to user input; propagating information from the first hardware device node to the second hardware device node, wherein the information specifies the hardware device with which the first hardware device node is associated, wherein said propagating occurs in response to said connecting the first hardware device node to the second hardware device node; wherein the graphical program is executable by the computer.

20120215861

13324979

1. A method, comprising: scanning a first set of messages to generate a plurality of profiles for persons associated with one or more of the messages; scanning, by a computer, a second set of messages that are classified by a spam filter as spam; determining, by the computer, one or more false positive spam messages from the second set of messages classified as spam using one or more of the plurality of profiles; and presenting a list to identify the one or more false positive spam messages to a user.

7610190

10684508

1. A method of determining a hybrid text summary by a hybrid summarization system having a processor, a relevance score determination module, a structural representation of the discourse determination module and a percolation module, the method comprising: determining discourse constituents for a text by the processor; determining a structural representation of discourse for the text by the structural representation of the discourse determination module; determining relevance scores for discourse constituents based on at least one non-structural measure of relevance by the relevance score determination module; percolating relevance scores based on the structural representation of discourse by the percolation module; and determining a hybrid text summary, by the processor, based on discourse constituents with relevance scores compared to a threshold relevance score, wherein percolating the relevance scores comprises: for each child discourse constituent node in the structural representation, assigning the relevance score of the child discourse constituent node to the parent discourse constituent node if the child discourse constituent node is more relevant; for any subordinating nodes, assigning the relevance scores of the subordinated discourse constituent to the subordinating discourse constituent if the subordinated discourse constituent is more relevant; and for any coordination nodes, assigning the relevance score of the most relevant child to other child discourse constituent nodes.

5414853

07969681

1. An apparatus for checking the format of computer microcode, comprising: means for receiving a plurality of restrictive conditions which said microcode must satisfy; means for automatically transforming each said plurality of restrictive conditions into one or more logical expressions, wherein said means for automatically transforming each said plurality of restrictive conditions into one or more logical expressions further includes means for transforming each said plurality of restrictive conditions into one or more logical tests, each comprising a number of sub-tests for the values of fields of the instruction, each logical test and sub-test having the characteristics of evaluating FALSE if the restriction is satisfied wherein an evaluation of FALSE of any one of the sub-tests by an instruction indicates that the restriction is satisfied by the instruction; means for receiving a plurality of computer microcode instructions as input; means for automatically generating a restriction checker program from said logical expressions for verifying whether each of said microcode instructions satisfies said plurality of restrictive conditions: and means for outputting the results of said verification.

8898646

12976799

1. A machine-implemented method for profiling program code comprising: identifying a first set of the instructions for which profiling is desired, wherein the first set of the instructions comprises a subset of all instructions, and wherein identifying the first set of the instructions comprises specifying a particular address range and identifying instructions within the address range as being instructions for which profiling is desired; associating profiling events with each of the first set of instructions; receiving an indication that an instruction has been retired; determining whether the instruction is within the first set of instructions for which profiling is desired; and if the instruction is within the first set, then determining whether a designated event associated with the instruction has occurred or not occurred; and recording the occurrence or not occurrence of the event within a first storage device upon an indication indicating the first storage device is not saturated, wherein the first storage device is a register having an entry for each of a plurality of instruction and event pairs, each entry recording a number of occurrences and a number of not occurrence of a particular event for a particular instruction.

8588555

12814369

1. A processor for efficiently recognizing sensory information including a plurality of recognizable features comprising: a feature recognition engine that resolves features from the sensory information and provides a feature information input; and a plurality of processing nodes, arranged in a hierarchy of layers, receiving the input at a lowest layer thereof and being constructed and arranged to simultaneously, and in parallel recognize multiple components of the features, and to transfer recognized features between the layers, and a filter at each node that receives from a bus and is configured to allow or reject a message communicated on the bus to proceed to an inbound buffer of the node for which it filters, and wherein each filter determines acceptance or rejection by comparing an input message to a value indicating the next input to accept, and wherein the value indicating the next input to accept is updated by retrieving a new value from a memory as determined by the current value and a clock, so as to build likely recognition candidates and remove unlikely recognition candidates; and a unit comparing a set of features retrieved from a hash table to an ideal feature and determining which feature from the set of features is the one that most closely matches the ideal feature.

20080301090

11755972

1. A method for detecting abnormal user behavior for a query session of an electronic search engine through determining clickstream data by tracking user click activities associates with a search results page generating in response to a user search request including a search term, the method comprising: determining a conformance score for the clickstream data based on existing clickstream data for one or more similar query sessions, normalizing the conformance score to generate a normalized conformance value based on an event count for the query session; mapping the clickstream characteristics onto a probability score using univariate or multivariate models and comparing the probability score with the probability scores for the one or more similar query sessions to determine if the query session is abnormal.

10110512

13716289

1. A method of managing a computer system providing virtual desktops for a plurality of users, comprising: an instance server executed on a computer defining in computer memory a plurality of computing classes, wherein each computing class of the plurality of computing classes: is associated with a respective per user resource cost for provisioning users in the computing class such that each computing class is associated with a different per user resource cost, the per user resource cost for a particular class indicating a level of provisioning provided to each user assigned to the computing class, and, wherein the instance server associates each user of the plurality of users with a selected computing class of the plurality of computing classes such that at least one first user is associated with a first computing class having a first per user resource cost and at least one second user is associated with second computing class having a second per user resource cost different from the first per user resource cost of the first computing class, the plurality of computing classes comprising at least the first computing class corresponding to a first configuration of computing resources for a first virtual desktop computing environment available on at least one server computer and the second computing class corresponding to a second configuration, different from the first configuration, of computing resources for a second virtual desktop computing environment available on the at least one server computer; the instance server continually storing, in a database in computer storage, a usage history for each user in the plurality of users, the usage history of each user of the plurality of users being indicative of usage of the computing resources for the corresponding virtual desktop computing environment on the at least one server computer by a remote computer used by the user; a provisioner, executed on a computer with a computer processor, that selects a particular computing class for each user, wherein the selecting for each user comprises: analyzing the usage history for the user, wherein the usage history defines a user profile of the user indicative of computing demands of the user to determine a provisioning cost of the user, and selecting a particular computing class of the plurality of computing classes based on i) the provisioning cost of the determined from the user profile and ii) the respective per user resource costs determined for provisioning users in each of the computing classes such that the selected computing class provides a level of provisioning for the user that does not overprovision or underprovision the user based on the computing demands of the user; the instance server provisioning the virtual desktop computing environment for each user according to the computing class selected for the user, wherein provisioning includes instantiating each respective virtual desktop computing environment using a portion of the available computing resources on the at least one server computer, the portion being defined by the computing class for the user and including memory and central processor resources of the at least one server computer, thereby provisioning a plurality of virtual desktop environments on the at least one server computer for use by the plurality of users, and enabling the remote computer associated with and used by the user to remotely use the corresponding virtual desktop computing environment, such that applications and central processor computations of a personal computer desktop environment are executed within the virtual desktop computing environment on the at least one server computer, including presenting a desktop user interface representing the virtual desktop computing environment on the remote computer wherein input from and output to the remote computer is provided over a computer network from the at least one server computer to the remote computer; the provisioner periodically reanalyzing an updated usage history of each user in the plurality of users to selectively update the computing class, selected from among the plurality of computing classes, associated with each user; and in response to an update of the computing class associated with the user, the instance server reprovisioning the desktop computing environment for the user according to the updated computing class for the user.

8694293

12458021

1. A simulation support method comprising: converting a subject block diagram model using a generated operation interface, wherein the subject block diagram model represents a subject system to be simulated, to a model for parallel computation, in which a plurality of subsystem models are connected to each other, wherein the plurality of subsystem models correspond to a plurality of processes in one step, and the processes repeatedly run in parallel in a cluster computer; synchronizing data in a parallel execution environment by inserting dummy blocks in the subject model using the generated operation interface; editing a simulation program for parallel computation, based on the model for parallel computation that is the subject model in which at least the dummy blocks are inserted, wherein the simulation program for parallel computation is used to generate the processes that run in parallel in the cluster computer; and incorporating a communication section into the simulation program for the parallel computation.

20040258313

10463726

1. A method for detecting a specific object in an image, comprising: determining an orientation of an arbitrary object in an image using an orientation classifier for the specific object; selecting one of a plurality of orientation and object specific classifiers according to the orientation; and classifying the arbitrary object in the image as the specific object with the selected orientation and object specific classifier.

20130173590

13340665

1. A computer-implemented method of optimizing a nested database query that includes at least one inner sub-query, at least one outer sub-query, one or more window functions in the at least one inner sub-query, and one or more filtering operations in the at last one outer sub-query, wherein the computer-implemented method comprises: determining whether to represent one or more filtering operations of the at least one outer sub-query as one or more corresponding qualification operations associated with the one or more window functions in the at least one inner sub-query; and effectively representing the one or more filtering operations of the at least one outer sub-query as the one or more corresponding qualification operations associated with the one or more window functions in the at least one inner sub-query when the determining determines to represent the one or more filtering operations as the one or more corresponding qualification operations.

20170177661

15381481

1. A computer system comprising: one or more computer processors; one or more computer readable storage media; program instructions stored on the computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising: program instructions to provide one or more system control blocks identifying software modules that have been loaded into memory without directed loads, and a directed load table identifying software modules that have been loaded into memory via directed loads, wherein the directed load table includes a wrapping feature that replaces older entries when space for newer entries is required; program instructions to receive a request for a directed load of a software module into memory, wherein the request for the directed load includes an address for storing the software module; program instructions to store the software module at the address according to the received request; program instructions to add a name and an address range of the stored software module to the directed load table; program instructions to receive a first query that includes an input module name; program instructions to, responsive to determining that the input module name of the received first query is not stored in the one or more system control blocks, search the directed load table for the input module name of the received first query; program instructions to, responsive to determining that the input module name of the received first query is stored in the directed load table, return an address range associated with a software module matching the input module name in the directed load table; program instructions to receive a second query that includes an input address range; program instructions to, responsive to determining that the input address range of the received second query is not stored in the one or more system control blocks, search the directed load table for the input address range of the received second query; program instructions to, responsive to determining that the input address range of the received second query is stored in the directed load table, return a name associated with a software module matching the input address range in the directed load table; program instructions to receive a third query that includes an input module name or an input address range; program instructions to, responsive to determining that the input module name or input address range of the received third query is not stored in the one or more system control blocks, search the directed load table for the input module name or input address range of the received second query; and program instructions to, responsive to determining that the input module name or input address range of the received third query is not stored in the directed load table, return an indication that no match has been found.

7664814

10828401

1. A presence-based seamless messaging method, comprising: from within a computing environment executing on a processor and configured for sending a message via a user interface associated with a first communications medium, detecting a current live presence of a potential message recipient who can be reached via a second communications medium; running contemporaneously multiple communications programs for accessing the first and second communications media to allow instantly sending a message via one of the communications programs; transforming the user interface to include an option of using the second communications medium; activating the second communications medium in response to the detecting; displaying a one-click control option for transitioning message delivery and message composition to the second communications medium when the potential recipient is present to the second communications medium; removing display of the one-click control option when the potential recipient becomes non-present to the second communication medium; transferring automatically upon actuation of the one-click control option at least part of an unsent message from a message composition environment associated with the first communications medium to a message composition environment associated with the second communications medium when the first communications medium becomes unavailable; and transferring automatically upon actuation of the one-click control option at least part of an unsent message from a message composition environment associated with the second communications medium to a message composition environment associated with the first communications medium when the second communications medium becomes unavailable.

8694449

12790735

1. A method comprising: generating, within a machine using a processing unit, actions for the machine based on correlating spatial inputs linked in time for each neuron in a set of neurons on a neuronal layer for the machine such that correlation of the correlating spatial inputs includes applying a firing-age dependent plasticity, wherein the spatial inputs are from an input layer and a corresponding output layer.

20170250906

15054781

1. A method of routing packets by a local route exchange processor in a local router, the method comprising: maintaining, by the local route exchange processor, in a computer storage of the local router, at least one forwarding information base that associates a plurality of named fabrics with at least one uniquely named authority, each fabric having at least one named tenant, each tenant having at least one named service, wherein the local route exchange processor is associated with a distinct local fabric from among the plurality of named fabrics; exchanging fabric adjacency information by the local route exchange processor with at least one remote route exchange processor, each remote route exchange processor operating in a separate remote router and associated with a distinct remote fabric from among the plurality of named fabrics; performing, by local the route exchange processor, a mesh-up process to establish at least one communication path between the local fabric and each of the remote fabrics; receiving first packet to establish a communication session between a source service in a source tenant and a destination service in a destination tenant; determining the source tenant for the communication session; identifying, using the at least one forwarding information base, a service agent for the communication session based on the name of the source tenant and the name of the destination service; selecting a communication path for the communication session; and forwarding the first packet via the selected communication path.

20110246972

12749947

1. A method, comprising: providing an application written in a domain-specific language (DSL) for a programming task, wherein the application includes a plurality of components configured by expressions; selecting from a plurality of techniques for evaluating the expressions a technique that most quickly implements the programming task; and compiling the DSL application to generate general-purpose programming language (GPL) code in accordance with the selected expression evaluation technique.

4612083

06755987

1. A process of fabricating a three-dimensional semiconductor device, comprising the steps of (1) preparing at least two semiconductor structures each including at least one semiconductor element and a conductor electrically connected at one end to said semiconductor element and having at the other end thereof an exposed surface portion, at least one of said semiconductor structures further including a thermally fusible insulating adhesive layer having a surface substantially coplanar with said exposed surface of said conductor, (2) positioning said semiconductor structures with respect to each other so that the exposed surface portions of the respective conductors of the semiconductor structures are spaced apart from and substantially aligned with each other, (3) moving at least one of said semiconductor structures with respect to the other until the exposed surface portions of the respective conductors of the semiconductor structures are brought into contact with each other, and (4) heating the semiconductor structures for causing said insulating adhesive layer of at least one of said semiconductor structures to thermally fuse to the other semiconductor structure with said semiconductor elements electrically connected together.

20070185889

11319514

1. A method comprising: monitoring changes to a first business object; determining whether a change necessitates communication to a second business object; when communication to a second business object is necessary, sending a message from a first process agent to an interface, said message including data representing the change; determining whether the message necessitates a second change to the second business object; and when the second change to the second business object is necessary, effecting the second change in the second business object.

10033941

14708955

1. At a mobile device communicatively coupled to a remote computing system, a method comprising: capturing imagery of an area at which the mobile device is located; performing at least one image-based privacy filtering process using the captured imagery to generate filtered imagery; determining a set of spatial features in the filtered imagery; selecting a subset having fewer spatial features than the determined set of spatial features for inclusion in an area description file, the subset based on a maximum spatial feature density criterion; and transmitting the area description file representative of the subset having fewer spatial features than the determined set of spatial features to the remote computing system.

8935222

13732537

1. A method for optimizing a partition of a data block into matching and non-matching segments in data deduplication using a processor device in a computing environment, the method comprising: applying an optimal calculation operation in polynomial time to the matching segments for selecting a globally optimal subset of a set of the matching segments according to overhead considerations for minimizing an overall size of a deduplicated file by determining a trade off between a time complexity and a space complexity; applying the optimal calculation operation individually on each sequence of the matching segments that are surrounded on both ends of the matching segments by two of the non-matching segments where the non-matching segment cannot be altered; splitting a sequence of the matching segments into sub-parts for obtaining the globally optimal subset; applying the optimal calculation operation on the sub-parts of the matching segments; combining solutions of the optimal calculation operation of the sub-parts into the optimal calculation operation for an entire range of the sequence of the matching segments; and building the globally optimal subset by means of a first two-dimensional table represented by a matrix C[i,j], and storing a representation of the globally optimal subset in a second two-dimensional table represented by a matrix PS[i,j] that holds, at entry [i,j] of the matrix, the globally optimal subset for a plurality of parameters in form of a bit-string of length j−i+1, wherein i and j are indices of bit positions corresponding to segments.

20160063242

14935504

1. A data processing apparatus comprising: processing circuitry to perform data processing operations, the processing circuitry being operable in a secure domain and a less secure domain; a stack pointer register to store a stack pointer value; stack access circuitry to, in response to an event requiring a transition from the secure domain to the less secure domain, store a data item to a data store at a given location determined relative to the stack pointer value, the data item comprising a return address when said event is of a first event type, and comprising a first value when said event is of a second event type; and fault checking circuitry configured, on receipt of a first event type return from the less secure domain, to identify a fault condition if the data item stored at the given location comprises the first value, wherein one of the first event type and the second event type comprises a function call, and the other of said first event type and the second event type comprises an exception.

9058180

12493743

1. A unified microprocessor pick queue comprising: control circuitry; and an array configured to dynamically allocate an entry of a plurality of entries for an instruction, wherein each entry of said entries includes a picked field and a trigger field, wherein the picked field indicates a corresponding instruction is eligible to be picked for issue, and the trigger field indicates a result of the instruction will be available in M clock cycles; wherein for a first instruction dependent upon a second instruction whose results are not yet available, in response to detecting the second instruction has asserted picked and trigger fields prior to said results being scheduled to be available, the circuitry is configured to: determine the first instruction is eligible to be picked for issue responsive to detecting: the first instruction corresponds to a first class of instructions comprising instructions with a same source and destination type, the first class of instructions being floating point instructions; the second instruction is a floating point instruction executable by a floating point unit; and the first instruction has a first latency from the second instruction associated with the first class; and determine the first instruction is eligible for stalling prior to being picked for issue responsive to detecting: the first instruction corresponds to the first class of instructions; the second instruction is a floating point instruction executable by an integer execution unit; and the first instruction does not have the first latency from the second instruction.

20040054500

10396768

1. A method for effecting performance analysis upon a system block, comprising: modeling the system block in both a TLM model and a RTL equivalent model; generating a set of stimuli at a testbench, the testbench being an application that may apply the set of stimuli against the TLM model or the RTL equivalent model to produce a set of timing information; effecting performance analysis on the TLM model using the set of stimuli; and effecting performance analysis on the RTL equivalent model using the set of stimuli.

20050131919

10863002

1. A method for efficient storage and retrieval of catalog information comprising: identifying a set of attributes associated with data items; creating a common data structure for said data items that excludes a first attribute from said set of attributes unique to any selected first data item selected from said data items; associating a first data item with said first attribute excluded from said common data structure; creating a category data structure for storing information corresponding to a category said category data structure comprising a set of alias fields, wherein a first category having a first alias field from said set of alias fields is configured to reference a second category having a second category ID and wherein a second set of attributes from said set of attributes which corresponds to said second category and said second category's set of parent categories are not inherited by said first category; associating said first data item with a third category; creating an attribute data structure comprising category attributes from said set of attributes where said category attributes are common to a plurality of said data items; associating at least one category with at least one attribute from said category attributes via a category-attribute data structure; creating a category hierarchy data structure; and, associating a hierarchy of categories within said category hierarchy data structure, wherein said category hierarchy data structure comprises at least one parent category and at least one child category wherein said at least one child category inherits at least one parent attribute from said category attributes and wherein a given child category set is associated with at least one set of parent categories and wherein said at least one child category comprises a position value associated with a given parent category.

8321637

11748044

1. A method comprising: executing, by a computing system, a string of instructions to complete a transaction of a first thread of a transaction program, beginning with one instruction of said string of instructions; and managing memory access to a shared memory location for transaction data of the first thread, the shared memory location accessible by the first thread and a second thread, the shared memory location being an increment of real system memory, each increment of real system memory having a ‘private to transaction’ (PTRAN) tag directly addressable as part of each increment of real system memory, the managing comprising: determining whether said one instruction is part of an active atomic instruction group (AIG) of instructions associated with the transaction of the first thread, said active AIG identifying a group of memory locations that are to be updated in an atomic fashion; based on determining that said one instruction is part of said active AIG: inspecting a PTRAN tag associated with the shared memory location to determine whether there is an active transaction associated with the shared memory location; based on determining that there is no active transaction associated with the shared memory location, updating the PTRAN tag associated with the shared memory location to indicate that the shared memory location is part of the active AIG, and locating a transaction table in physical main data storage which provides for entries in an active mode for said active AIG: based on determining that there is an active transaction associated with the shared memory location, determining whether the shared memory location is already part of the transaction table; and wherein all of the entries in the transaction table correspond to the first thread, and all storage locations inspected or modified by instructions of said active AIG remain pending until the computing system indicates that the storage locations should be committed; and based on determining that said one instruction is not part of an active AIG, executing a next instruction under normal execution mode.

8204936

12422264

1. A computer voting system to receive votes from one or more mobile devices through a wireless personal area network to select content stored on the system, each mobile device comprising a mobile device name that is editable by a user to include a user-entered vote, the system comprising: an input arrangement to receive a mobile device name from a mobile device; a processor to analyze the mobile device name to determine whether a user-entered vote is included in the mobile device name, and if the user-entered vote is included in the mobile device name, to extract the user-entered vote from the mobile device name; a storage apparatus to store content; and an output arrangement to output content, wherein the extracted user-entered vote relates to a selection of a content, and wherein the processor is further to select the content from the storage apparatus to be output by the output arrangement based on the extracted user-entered vote.

7995461

11210910

1. A method for performing an efficient constrained shortest path first (CSPF) optimization of Traffic Engineering (TE) Label Switched Paths (LSPs) in a computer network, the method comprising: detecting a topology change in the computer network that adds or restores a link or a node in the computer network, or a resource change in the computer network that increases available bandwidth on a link in the computer network, that could create a more optimal path for TE-LSPs; selecting a root node for a CSPF computation based on the root node being adjacent to the topology change or resource change, and based on the root node being located along a particular TE-LSP, wherein the root node is located downstream from a head-end node of the particular TE-LSP; and performing the CSPF computation for the particular TE-LSP rooted at the root node; applying a configurable margin to the current cost of the particular TE-LSP prior to determining during the CSPF computation if a higher new cost than a current cost of the particular TE-LSP is reached; determining during the CSPF computation if a higher new cost than the current cost of the particular TE-LSP is reached; and if so stopping the CSPF computation.

9842063

15345262

1. A method for retrieving data, the method comprises: retrieving, by a computing device of a dispersed storage network (DSN), a plurality of secure data packages from storage units of the DSN; separating, by the computing device, the plurality of secure data packages into a plurality of masked keys and a plurality of encrypted data units in accordance with a data intermingling pattern, wherein the data intermingling pattern insures that, when a threshold number of encrypted data units are available, the plurality of masked keys is retrievable regardless of which encrypted data units of the plurality of encrypted data units are included in the threshold number of encrypted data units; generating, by the computing device, a plurality of deterministic values from the plurality of encrypted data units; generating, by the computing device, a plurality of encryption keys based on the plurality of masked keys and the plurality of deterministic values; decrypting, by the computing device, the plurality of encrypted data units using the plurality of encryption keys to produce a plurality of data units; and recovering, by the computing device, a first portion of the data from a threshold number of the plurality of data units.

20140188847

13941560

1. An interactive object retrieval method, comprising: receiving a query and a time-space searching condition; selecting a plurality of searching results from an object database according to the time-space searching condition, a similarity between the query and each of a plurality of data records of a first category in the object database, and a time information and a location information corresponding to each of a plurality of data records of a second category in the object database; receiving at least one user input corresponding to at least one of the searching results; and determining a display manner of each of the searching results on a user interface according to the at least one user input and a similarity between the query and each of the searching results.

9412363

14194964

1. A method comprising: storing metadata related to items displayed on a display; receiving, by a computing device, an utterance; in response to the received utterance, applying, by the computing device, a disambiguation model to the utterance, including: identifying whether the utterance is directed to at least one of the plurality of items on the display, extracting a plurality of referential features from the utterance, and identifying an item among the plurality of items on the display corresponding to the utterance by comparing at least some of the plurality of referential features extracted from the utterance to the metadata; and performing, by the computing device, an action associated with the utterance in response to identifying the item corresponding to the utterance.

9465581

14280611

1. An automatic method for predicting tidal heights and currents using an automated forecast model comprising: accessing, by a specially programmed computer, processing options; automatically locating, by the specially programmed computer, at least one water cell and at least one river based on the processing options, wherein the at least one water cell and the at least one river are represented as geographic data in a graphical map that is displayed on a display device; automatically determining river discharge data for the at least one water cell, including: determining a domain of a forecast; if one of the at least one river is located within the domain, automatically locating the at least one water cell in the domain coincident with the one of the at least one river, if possible, or automatically locating the at least one water cell in the domain, the at least one water cell having a predetermined water depth and being near the one of the at least one river; and automatically calculating river discharge flow rates for the at least one water cell; automatically providing, by the specially programmed computer, the at least one water cell, the river discharge data, and the processing options, to the forecast model, automatically receiving a forecast from the forecast model based on the at least one water cell, the river discharge data, and the processing options; automatically generating a mapped product based on the forecast, wherein the mapped product comprises spatial data corresponding to a plurality of forecasted parameters in the forecast; and automatically updating the graphical map displayed on the display device to include the mapped product.

8631473

13341165

1. A social media content access system, comprising: a memory; a processor disposed in communication with said memory, and configured to issue a plurality of processing instructions stored in the memory, wherein the processor issues instructions for: identifying a request from a server, to access user social media content; obtaining, at the server, from a user, user authorization credentials to access user social media content; sending an access request with the obtained user authorization credentials to a social media platform; receiving an indication of a user experienced media asset indicating the user has been exposed to the media asset; receiving social media content data from the social media platform; determining a data format type of the received social media content data; tagging the received social media content data based on the data format type according to a progressive taxonomy mechanism of hierarchical category tags; receiving a social media analytics request related to consumer impression for the user experienced media asset; selecting a set of key terms descriptive of characteristics of the user experienced media asset; querying the tagged social media content data based on the selected key terms related to the user experienced media asset; determining the queried tagged social media content data is related to the user experienced media asset; and determining a consumer impression level for the user experienced media asset based on the queried tagged social media content data from query results.

20040268360

10610239

1. A method in a data processing system for transmitting accessibility requirements, method comprising: parsing content received from a computer for a selected indicator responsive to the selected indicator being present, identifying accessibility requirements set for the data processing system to form identified accessibility information; and sending the identified accessibility requirements to the computer.

9710370

14882020

1. One or more non-transitory computer-readable media, having executable code embodied thereon, wherein the code, when executed by one or more processors of a computing system, enables the computing system to: provide a test library to a testing environment utilized to perform automated testing of a software application in accordance with test code, the testing environment to perform automated testing of core functionality encoded in a first programming language, and the test library extending the testing capabilities of the testing environment to perform automated testing of shell scripts, which are encoded in a second programming language and invoke one or more executable modules external to the software application, by communicating with an interpreter that is to execute the second programming language and generate test versions of the one or more executable modules in accordance with the test code; and automatically test the core functionality and the shell scripts of the software application under test, utilizing the testing environment with the test library, in accordance with the test code, wherein the test code defines execution parameters for execution of the core functionality and the shell scripts of the software application under test and validation parameters for the validation of results of the execution of the core functionality of the software application under test.

20070189069

11611665

1. A method of providing a reference voltage in an integrated circuit, comprising: programming a threshold voltage of a first non-volatile memory (NVM) transistor while coupled with a second NVM transistor; coupling a first capacitor between a floating gate of the first NVM transistor and a first voltage supply during the programming step; generating a single-ended reference voltage in response to the programmed threshold voltage of the first NVM transistor; and then adjusting a temperature coefficient associated with the single-ended reference voltage by introducing a first p-n junction in series with the first capacitor.

20130202200

13877545

1. A method comprising: executing rating software on a computer to extract features from each of a plurality of training images by computing a numerical descriptor for each of the training images from pixel values of the respective training image; processing the numerical descriptors of the training images with the rating software to automatically select a representative subset of the training images; performing a first clustering process with the rating software to process the numerical descriptors of the representative subset of the training images and compute a plurality of image clusters for the representative subset of training images; receiving input from at least one of a user or the computer assigning an individual rating label to each of the plurality of image clusters for each of a specified classes of defects, wherein receiving input from the user further comprises presenting a user interface with the rating software to receive input from the user specifying one or more classes of defects present within the plurality of training images, and optionally wherein receiving input from the computer further comprises using the computer to determine a number of defect classes present within the representative training images and assign a severity label to each of the plurality of image clusters for each of the specified classes of defects; and for each of the image clusters, automatically propagating, with the rating software, each of the individual rating labels assigned to the classes of defects for the image cluster to all of the training images within that image cluster.

20050050199

10648506

1. A method for determining if a plurality of actions are available to be performed in connection with a context entity, the context entity being derived from a plurality of related service entities at a plurality of application services, the method comprising: classifying actions for a plurality of service entities at the plurality of application services, each action being classified according to its availability; matching the related service entities based on their attributes; consolidating the related service entities into the context entity; and determining for each of the related service entities if an action is available to be performed on the service entity at a corresponding application service based on a corresponding classification of the availability of the action.

20090307277

12133278

1. A method in a computing device for identifying deltas between versions of a database, the database having a schema that defines tables of the database, fields of each table, and a key field for each table, the method comprising: providing a baseline version and a modified version of the database; and for each table of the database, selecting the rows of the table of the baseline version and the modified version in an order based on the key field of the table; when the key fields of the selected rows are the same, when a field of the selected rows is different, saving an indication that the selected row of the baseline version has been changed; and selecting the next row of the baseline version and the modified version; and when the key fields of the selected row are different, when the key fields of the selected rows indicate that a row has been deleted from the baseline version, saving an indication that the selected row of the baseline version has been deleted and selecting the next row of the baseline version; and when the key fields of the selected rows indicate that a row has been added to the modified version, saving an indication that the selected row of the modified version has been added and selecting the next row of the modified version wherein the saved indications represent deltas between the baseline version and the modified version.

20060190833

11061218

1. A single-handed navigation system for mobile computing devices comprising: a display space comprising a plurality of application tiles corresponding to a plurality of applications; a navigation component that receives user input and moves about the display space based at least in part on the user input; and a display component that displays a view of the display space.

8909655

11870893

1. A method implemented by at least one data processing apparatus, the method comprising: determining historical click-through rates over a plurality of time periods for a first search result responsive to a query and for a second search result responsive to the query wherein the first and second search results refer to different respective web pages; calculating click-fractions for one or more of the plurality of time periods based on the determined historical click-through rates of the first and second search results; determining that a particular click-fraction of the calculated click-fractions in a first time period of the plurality of time periods exceeds a minimum change threshold; obtaining search results responsive to the query during a second time period that chronologically follows the plurality of time periods; adjusting a ranking of the first search result in the obtained search results during the second time period; and wherein determining, calculating, obtaining and adjusting are performed by the at least one data processing apparatus.

20020165810

09870387

1. A method for computing a point in a phase space, the method comprising the steps of a) providing a first sequence of first data samples; b) calculating a volatility of the first sequence of first data samples; c) scaling the volatility with a factor, the factor being dependent on the length of the first sequence; d) calculating a difference between a first data sample and a last data sample of the first sequence; and e) determining a first and a second coordinate value of a point in phase space based on the volatility and the difference.

9753934

15064386

1. A method for modifying a first storage medium having a plurality of files including a first file that includes a plurality of data blocks, wherein the first storage medium includes a first metadata structure that describes the plurality of files, the method comprising: providing a first modification tool; operatively coupling the first storage medium to the modification tool; constructing a second metadata structure that describes the plurality of files; dematerializing, using the first modification tool, at least the first file to form one or more dematerialized files, wherein the dematerializing of the at least first file includes: rendering the first file inaccessible without destroying the plurality of data blocks of the first file and without releasing the plurality of data blocks of the first file for reallocation, and modifying directory information that describes the at least first file; and materializing at least one of the one or more dematerialized files, wherein the materializing includes modifying the first metadata structure based at least in part on the second metadata structure.

20120078613

13239363

1. A method comprising: receiving search criteria for searching an electronic text; determining text subgroups within the electronic text; and for each text subgroup: determining a similarity relationship between the search criteria and the text subgroup; and presenting a graphic representing the similarity relationship between the text subgroup and the search criteria.

20140324411

14246861

1. A system for validating a translation memory against a terminology dictionary, said terminology dictionary comprising source terms and corresponding target terms, said translation memory comprising source segments and corresponding target segments, said system comprising: a rule match hardware engine for identifying, for each source term, occurrences of a particular source term within source segments, wherein an occurrence is determined according to grammar rules; a fuzzy match hardware engine for calculating, for each identified source term occurrence in a source segment, a closeness score between a corresponding target term and a corresponding occurrence of the corresponding target term in a target segment; and a report generator for reporting each identified occurrence of a source term in a source segment, and a closeness score, for said each identified occurrence, between said each identified occurrence and a corresponding target term in a target segment.

8005865

12789393

1. An event listening system, the event listening system comprising: a file system including a plurality of files, the plurality of files logically stored in a tree and including a first file, a parent file of the first file, and a grandparent file of the first file; a first data structure for the first file and configured to track a set of listening files, each of the listening files having at least one process associated with the respective listening file that is listening for events that affect the first file; a first data structure for the parent file and configured to track a set of listening files, each of the listening files having at least one process associated with the respective listening file that is listening for events that affect the parent file; a first data structure for the grandparent file and configured to track a set of listening files, each of the listening files having at least one process associated with the respective listening file that is listening for events that affect the grandparent file; and a traverse module configured to, in response to receipt of an identifier that is generated in response to an event that affects the first file: access the first data structure of the grandparent file; access the first data structure of the parent file; review the grandparent file's set of listening files to identify any listening files for the grandparent file that are also listening files for the parent file, but that are not being tracked by the parent file's first data structure; add the files identified in the review of the grandparent file's set of listening files to the parent file's first data structure; access the first file's first data structure; review the parent file's set of listening files to identify any listening files for the parent file that are also listening files for the first file, but that are not being tracked by the first file's first data structure; and add the files identified in the review of the parent file's set of listening files to the first file's first data structure.

7908353

12101181

1. A network management method comprising: identifying, by a computing system, overlapping address spaces between a plurality of networks; generating, by the computing system, virtual servers associated with the overlapping address spaces, wherein each virtual server of the virtual servers is associated with an overlapping address space of the overlapping address spaces; installing, by the computing system, a copy of management software on each virtual server of the virtual servers; installing, by the computing system, consolidation software on a consolidation server; configuring, by the computing system, each copy of the management software for discovering and managing an associated overlapping address space of the overlapping address spaces; configuring, by the computing system, each virtual server of the virtual servers for exporting discovered overlapping address spaces of the overlapping address spaces; configuring, by the computing system, the consolidation software for receiving and consolidating the discovered overlapping address spaces form the virtual servers; configuring, by the computing system, each virtual server of the virtual servers for exporting event data associated with the overlapping address spaces; configuring, by the computing system, the consolidation software for receiving and consolidating the event data from the virtual servers; providing a first virtual server within the virtual servers associated with a first overlapping address space of the overlapping address spaces; discovering, by said the virtual server, the first overlapping address space; generating, by the first virtual server, a first topology report indicating the first overlapping address space; storing, by the first virtual server, the first topology report; monitoring, by the first virtual server, the first overlapping address space; generating, by the first virtual server in response to monitoring the first overlapping address space, first events data indicating a status of first devices associated with the first overlapping address space; storing, by the first virtual server, the first events data; and transmitting, by the first virtual server to the consolidation server, the first topology report and the first events data.

20130311473

13476459

1. A method for dynamically clustering data items, the method comprising: receiving (a) a plurality of data items originating from at least two sources; (b) a plurality of distinct metadata details; (c) data indicative of associations between said data items and said metadata details, wherein each data item is associated with at least one metadata detail indicative of its owner, and wherein at least a first data item originating from a first source and a second data item originating from a second source are related data items associated with at least one shared metadata detail; grading strengths of relationships between at least one of said data items and at least one of said metadata details; and clustering said data items into one or more clusters, based on the calculated strengths wherein at least one of said clusters comprises related data items originating from more than one source.

20070073720

11383272

1. An electronic mail (email) server comprising: a pending email job queue manager for storing a plurality of email jobs for a plurality of users; and a processing email job queue manager for processing a threshold number of email jobs from said pending email job queue manager for a given user if a plurality of email jobs greater than the threshold number are available from said pending email job queue manager for the given user.

9542299

14045007

1. A method for processing core data produced by a computer process to identify data relevant to the computer process, the method comprising: identifying the core data for a computer process; identifying trace data comprising sequential trace entries for the computer process; selecting a predetermined number of most recent entries in the trace data; identifying any references to a memory address in each selected trace data entry; dereferencing each identified memory address in the core data; extracting the data from the dereferenced memory location in the core data; in response to the data from any dereferenced memory location in the core data comprising a further reference to a memory address, dereferencing the further memory address in the core data; and extracting the data from the dereferenced further memory location in the core data, wherein, for a given trace entry, the extraction of referenced data is limited to a predetermined depth of reference.

20050259585

10851585

1. A method for calculating an Nth order power series for a matrix comprising: (a) assigning a first memory area for storing the matrix; (b) assigning a second memory area and a third memory location for storage of a previous power term and a current power term; (c) assigning a fourth memory area for storage of a partial sum of the series; (d) assigning a first pointer to point to a current power term and a second pointer to point to a previous power term; (e) initializing the first, second, third and fourth memory areas; (f) calculating a current power term by forming the product of the matrix stored in the first memory area and the previous power term referenced by the second pointer; (g) storing the calculated current power term in the memory area referenced by the first pointer; (h) updating the partial sum stored in the fourth memory location by adding the contents of the memory area referenced by the first pointer to the partial sum stored in the fourth memory area; (i) updating the previous power term by exchanging the first and second pointer references; (j) repeating steps (f)-(h) as a function of the order N.

7644069

11679379

1. A computer-implemented search ranking method suitable for a file system, comprising: receiving a query via a computer; calculating final relevance scores of individual file items via said computer with respect to said query at least partially in accordance with energy scores of individual nodes on a current file system energy tree, and outputting a list of search results based on said final relevance scores; and updating said energy scores of said individual nodes on said file system energy tree via said computer in response to an operation on said file system performed by a user, wherein said file system energy tree has a tree structure corresponding to that of said file system, and said individual nodes thereof respectively correspond to the individual file items in said file system.

8160136

12537868

1. A computer-implemented method of video encoding comprising: computing spatial variance for video data in a block of a video sequence; estimating a first bit-rate based on the spatial variance, a transform coefficient threshold, and variance multiplicative factors empirically determined for first transform coefficients; and encoding the block based on the first bit-rate; wherein estimating a first bit-rate comprises estimating the first bit-rate as a value given by φ × ∑ i ⁢ exp ( - 2 ⁢ T i σ spatial ) wherein φ is a number of bits for encoding the first transform coefficients, Ti is a ratio of the transform coefficient threshold and a variance multiplicative factor of the variance multiplicative factors for the ith first transform coefficient, and σ is the spatial variance.

9424102

14277382

1. A computer program product for grouping related tasks, the computer program product comprising: one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions comprising: program instructions to receive a first task initialization by a first user, wherein a task is at least one of: an application, a tab within a window, or a process that has a user interface, and wherein a task represents a work unit that belongs to a work assignment of the first user; program instructions to determine whether one or more additional tasks contained in one or more task groups are in use by the first user; responsive to determining one or more additional tasks contained in one or more task groups are in use, program instructions to determine whether the first task is related to at least one task of the one or more additional tasks, wherein the first task and the at least one task are related by sharing one or more resources; and responsive to determining the first task is related to at least one task of the one or more additional tasks, program instructions to add the first task to the task group containing the at least one related task of the one or more additional tasks.

20140095145

13629885

1. A system comprising: at least one processor; an indexer which, if executed, causes the at least one processor to determine which keywords are likely to appear in a natural language query and to associate each likely keyword with a module of a plurality of modules; a query translator which, if executed, causes the at least one processor to determine whether at least one of the likely keywords determined by the indexer appears in a received natural language query; and a results generator which, if executed, causes the at least one processor to respond to the received natural language query with information generated by each module associated with a likely keyword appearing in the received natural language query.

20130151479

13324278

1. A method for verifying conversion when converting management operation data in which a query command for a first database described in a first program processed with the first database into a management operation data which described a query of the same function in the second program processed with the second database, comprising: a first step for inserting an acquisition operation code acquiring the first management operation data operating for the table data in the first program into the first program; a second step for acquiring the result which is obtained by converting the first management operation data obtained by the acquisition operation code in the process of executing the first program into the second management operation data of the second database; a third step for carrying out the first management operation data with the first database system and carrying out the second management operation data with the second database system; and a fourth step for comparing the data acquired depending on the processing of the first management operation data in the third step and the data acquired depending on the processing of the second management operation data in the third step, the first program comprises a plurality of first queries, and the second program comprises a plurality of second queries, the first query permits all of parameter, processing of addition, deletion and updating with respect to a database, and becoming a child query of a other query different from the second query, and the second query comprises: a view type which prohibits the parameter, permits the processing of addition, deletion and update, and permits becoming a child query of the other query; a function type which permits the parameter, prohibits the processing of addition, deletion and update, and permits becoming a child query of the other query; and a stored-procedure type which permits the parameter, permits the processing of addition, deletion and update, and prohibits becoming a child query of the other query, the second step is performed by a processing circuit of a conversion apparatus and comprises of: reading the plurality of the first queries of the first database system from a memory of the conversion apparatus; determining a nest relation of a plurality of the first queries; determining the type of the second query corresponding to each of the first query by determining in turn from the first query of a bottom layer to the first query of a top layer based on the nest relation; and generating the second query corresponding to the first query according to the type determined by the determining type in turn from the first query of the bottom layer to top layer based on the nest relation; the determining the type of the second query is performed by the processing circuit and comprises determining the second query corresponding to the first query as a dummy type when a child query of the first query is the function type or the stored-procedure type or the dummy type, and determining the second query corresponding to the first query as a view type when it is judged that the first query is not an action query and it is jugged that the first query not includes the parameter or the child is the view type, the generating the second query is performed by the processing circuit and comprises, generating the second query of the stored-procedure type including the function description equivalent to the functional description of a target query and generating the second query of the function type including function description equivalent to the functional description of the target query with respect to the target query which is the second query judged in the determining type as the dummy type or the stored-procedure type.

7792821

11427693

1. A computer-implemented method of automatically providing search query refinement options using a computing device having processor, memory, and data storage subsystems, the computer-implemented method comprising: receiving an unstructured web-search query request from a user via a user input component; initiating an unstructured web-search query according to the unstructured web-search query request; obtaining a first set of web-search results in response to said unstructured web-search query, wherein the first set of web-search results are ranked in order of relevance; determining whether sufficient common structure attributes are present in the first set of web search results to satisfy a structure threshold, wherein the structure threshold is satisfied if a sufficient percentage or absolute count of the first set of web search results have one or more common structure attributes, and the common structure attributes comprise similar name-value pairs having shared common name fields in meta-tags or in XML-code contained in the first set of search results; analyzing a subset of top-ranked web-search results from the first set to identify a common structure attribute present in the subset; analyzing the first set of web-search results according to the identified common structure attribute in the subset analysis; automatically generating a set of search refinement options according to the analysis of the first set of web-search results according to the identified common structure attribute; communicating the set of search refinement options for display to a user output device; receiving a selection of one of the search refinement options; and communicating a second set of web-search results resulting from the selected search refinement option to the user output device.

9264869

13741986

1. An apparatus for processing call services in a mobile terminal, the apparatus comprising: a communication unit configured to: send voice signals during a call, and receive voice signals during a call; a sensing unit configured to sense a state change of the mobile terminal; a control unit configured to: recognize, during a call, voice signals, produce speech analysis information on the basis of speech recognition results, predict, when a state change of the mobile terminal is detected by the sensing unit, an application corresponding to the speech analysis information, and activate the application as a follow-up service; and a display unit configured to output the follow-up service.

8533592

13275052

1. A configurable gaming system, said system comprising: at least one data store for storing a markup language file selected from the group consisting of 1) a mark-up language file and 2) a mark-up language file including token resolution information for use in a gaming application; a processor and game program instructions (that have been approved by a regulatory authority); and a markup language viewer for processing said markup language file, said markup language viewer resolves tokens in said markup language file including token resolution information using said token resolution information from said local storage without modifying the game program instructions to generate a resolved markup language file for display at a gaming system, said markup language file generates a display for the gaming application and customizes the display and the gaming application, and said markup language viewer for said mark-up language files including token resolution information dynamically adjusts the display and execution of the gaming application based on token values updated based on a change in at least one of a user, a game, and a game condition.

7760198

11319077

1. A display controller that performs multimedia processing, the multimedia processing being encoding or decoding processing of video data, still image data, or sound data, the display controller comprising: a host interface that performs interface processing between the display controller and a host processor; a memory into which a multimedia processing program is loaded, when the host processor has read the multimedia processing program from a multimedia processing program group stored in a host memory and the host processor transmitted the multimedia processing program to the display controller; a processor that executes a software processing portion of the multimedia processing assigned to software processing based on the multimedia processing program loaded in the memory; and a first hardware accelerator that executes a hardware processing portion of the multimedia processing assigned to hardware processing, the processor being released from a reset state when the host processor has directed reset release, and executing the multimedia processing program after being released from the reset state, the multimedia processing program being an encoding processing program that executes a software processing portion of encoding processing of the video data; the first hardware accelerator performing discrete cosine transform processing, quantization processing, inverse quantization processing, inverse discrete cosine transform processing, motion compensation processing, and motion estimation processing as the hardware processing portion; and the processor performing variable length code encoding processing as the software processing portion.

7917749

11438953

1. A method performed by a first electronic appliance by which two entities, a first entity seeking rights to information and a second entity owning rights to the information, electronically bargain toward an agreement concerning the information, the first electronic appliance comprising a processor and a memory encoded with program instructions that, when executed by the processor, cause the electronic appliance to perform the method, the method comprising: evaluating a first control set representing initial terms offered by the first entity in exchange for obtaining rights to the information; evaluating a second control set representing initial terms that the second entity is willing to accept in exchange for granting rights to the information, wherein the second control set is generated based on the second entity rejecting at least one of the initial terms of the first control set and proposing at least one alternative term to the first entity; generating a third control set of agreed upon terms; and sending, to a second electronic appliance associated with the first entity, an electronic indication granting rights to the information to the first entity in accordance with the terms of the third control set.

20020073405

09735027

1. A computer-implemented method for improving memory usage for a computer program, comprising: (a) reading a trace that describes data accesses performed by the computer program; (b) analyzing the trace to discover data access patterns; and (c) building a grammar that represents repetitively occurring sequences of the data access patterns.

20170242703

15403113

1. A non-transitory machine readable medium storing an instruction, which when executed by a hardware processor causes the processor to perform a method comprising: decoding an instruction having a first operand, a second operand, and a third operand; and Executing the decoded instruction to individually perform a shift operation by at least one bit for each of a plurality of packed data elements stored in a storage location indicated by the second operand, for each of the data elements that has an overflow in response to the shift operation, carrying over the overflow into an adjacent packed data element based on a mask obtained from the third operand, generating a final result, and storing the final result in a storage location indicated by the first operand.

7890212

10453438

1. A method for configuring a programmable logic controller, comprising: initiating a wizard at a computer when the computer is not communicatively coupled to the programmable logic controller, the wizard adapted for: determining when the programmable logic controller is communicatively coupled to the computer; retrieving parameter data from the programmable logic controller for an application of the programmable logic controller in response to determining that the programmable logic controller is communicatively coupled to the computer; automatically range checking the parameter data; pre-loading, through the wizard, one or more options for a configuration of the application of the programmable logic controller based on position parameter data retrieved from the programmable logic controller; querying for a plurality of answers regarding the application of the programmable logic controller; and based on the position parameter data retrieved, the pre-loaded one or more options, and the answers, generating at least one configuration adapted to configure a position module and at least one set of instructions executable by the programmable logic controller, the position module distinct from, and communicatively connected to the programmable logic controller, the position module adapted to generate a pulse train, the pulse train adapted to control motion of at least one of a stepper drive, servo drive, stepper motor, servomotor, linear motor, motor, ball screw, servo valve, hydraulic actuator, and pneumatic valve based on the at least one configuration, the pulse train generated responsive to an output polarity of the pulse train provided by a user via the wizard.

10133864

14861778

1. A method comprising: intercepting a request for a resource using a mediator at an application layer; determining, using the mediator, whether the resource is trusted or untrusted; when the resource is determined to be trusted, accessing the resource in a derived user account (DUA); and when the resource is determined to be untrusted: creating, using the mediator at the application layer, a protected DUA, wherein the protected DUA and the DUA are dynamically invoked within a same integrated user environment of a same user, redirecting, using the mediator at the application layer, the intercepted request to the protected DUA, and accessing the resource that is determined to be untrusted in the protected DUA, wherein the protected DUA provides unrestricted access to the resource.

9116709

13380681

1. A system for developing a graphical user interface (GUI) for an enterprise business application using a model driven technique, the system comprising: a repository to store common structural elements, variable structural elements, variation points, behavioral variants and situation specific structural variants; and a processor coupled to the repository, wherein the processor executes program instructions to: model one or more screens on a presentation layer of the enterprise business application for facilitating user interaction, wherein the one or more screens are connected to one another by navigation links and are modeled according to a plurality of metamodels defined according to the enterprise business application, wherein the navigation links facilitate a user to navigate from an existing screen to a new screen of the one or more screens, wherein the existing screen comprises common structural elements and variable structural elements, and wherein the existing screen is modeled by specifying behavioral specification for the existing screen, wherein behavioral specification are defined by existing event handlers, wherein the existing event handlers execute events, wherein the new screen is modeled using the existing screen by: defining variation points on the existing screen, wherein the variation points are indicative of a position on the existing screen to define the behavioral variants or the situation specific structural variants, and wherein the variation points are defined by introducing a variable field widget, wherein the variable field widget is configured to indicate a place-holder in the existing screen for accommodating the behavioral variants or the situation specific structural variants; defining behavioral variants for the variation points on the existing screen, wherein the behavioral variants are defined by adding new event handlers or by overriding the existing event handlers, wherein the behavioral variants depend upon a metamodel of the plurality of metamodels for specifying behavioral variations of the new screen, wherein the metamodel is defined for the new screen, wherein event handlers are configured to invoke services, trigger navigations or execute code specified by the user; defining situation specific structural variants at the variation points on the existing screen to specify structural extensions to the existing screen, wherein the situation specific structural variation correspond to structural variations for the new screen depending upon the metamodel defined for the new screen, wherein the situation specific structural variants are defined by introducing new structural elements onto the existing screen or by overriding the variable structural elements, wherein the situation specific structural variants correspond to a new widget to be added to the existing screen, or a changing the type of an existing widgets associated with the existing screen; and deriving specifications of the GUI of the new screen using the behavioral variants and the situation specific structural variants.

8326848

12538980

1. A computer-implemented method for reducing a size of a data set to be processed by an analytic routine, the method comprising: configuring one or more computer processors to perform an operation comprising: receiving a data set to be processed by the analytic routine, wherein the data set includes a set of data records returned from executing a first query; receiving, from a user, one or more parameters to pass with the data set to the to the analytic routine; identifying, from the one or more parameters, one or more conditions having predefined relationships to the respective parameters; evaluating each data record of the data set based on the one or more parameters and the one or more conditions to generate identify a reduced data set containing less than all of the set of data records; performing the analytic routine on the reduced data set to generate a result set; and outputting the result set, wherein evaluating each record of the data set includes generating a second query from the first query, the one or more parameters, and the identified condition; and executing the second query to generate the reduced data set.

9792310

14699464

1. A method comprising: receiving, by a database from a remote computing system, a query, the database comprising (i) a linear run length encoded compressed column, based on an original column of time series data partitioned into runs containing consecutive values and generated by run length encoding, (ii) a run index comprising at least one run index value having a run index position, the at least one run index value identifying runs in the original column, (iii) an offsets column identifying the run index positions corresponding to the runs that contain a desired value; identifying, by the database using the run index, data responsive to the query; and transmitting, by the database to the remote computing system, the identified data responsive to the query.

20090147725

12193181

1. A cross-layer routing method in a wireless sensor network comprising: locating a destination node which is a final destination of data by a source node which generates the data; and determining an optimal relay node among one or more neighboring nodes using their position information for each hop and forwarding the data from the source node to the destination node through the determined relay nodes.

20030005419

09416436

1. A computerized system that converts a first set of computer program instructions of a relatively higher level program instruction language into a second set of computer program instructions of a relatively lower level program instruction language, the system comprising: a process resident in said system that makes a determination whether to insert a memory prefetch instruction into a location in the second set of computer program instructions, the process making the determination based at least upon whether insertion of the prefetch instruction at the location is likely to cause an undesired cache memory conflict if the prefetch instruction were to be executed.

8458168

12412921

1. One or more computer-storage media embedded with computer-executable instructions, the embedded computer-executable instructions are executed by at least one processor for performing a method of determining an intent that is related to a present intent of a user, the method comprising: receiving one or more actions performed by the user, wherein the one or more actions include at least one action toward a goal; determining, for the user, a present intent, which is an object logically accomplished by performing an online action, based on the received one or more performed actions, wherein the determined present intent is one of a plurality of intents within an intent ontology that defines relationships between intents and actions, and wherein each of the plurality of intents is associated with at least one other intent through a chain of intent, wherein the chain of intent includes a chronological sequence of two or more related intents, wherein the chain of intent has a chronological relationship based on a temporal progression of intents; selecting a related intent that is part of a corresponding chain of intent that includes the determined present intent; and retrieving an online object that is associated with the related intent in anticipation to the related intent.

9544212

13721029

1. A system comprising: a memory area associated with a mobile computing device, said memory area storing a plurality of applications; and a processor programmed to: calculate data usage statistics associated with the plurality of applications stored in the memory area, the calculated data usage statistics representing data usage by the plurality of applications under a first data usage plan; analyze, at the mobile computing device, the calculated data usage statistics, the analysis determining a frequency of use by the mobile computing device of different types of network connections associated with different types of network data; present information describing at least a second data usage plan for review and selection on the mobile computing device; calculate an expected network usage by each of the plurality of applications as a percentage of the first data usage plan, the percentage reflecting a cost of network transfers associated with one or more applications of the plurality of applications; and rank, at the mobile computing device, the plurality of applications based on the percentage.

20080263525

12163398

1. A computer implemented method of detecting vulnerabilities in a pre-existing source code listing, said source code listing having a listed sequence of expressions, each expression including a set of operands and operators to transform values of the operands, said listed sequence of expressions having an inherent control flow indicative of the run-time execution of the expressions and an inherent data flow indicative of the run-time transformations of operand values, said source code listing being expressable in multiple programming languages, said source code listing further having routine calls including arguments with which to invoke a routine, said source code listing being stored in a computer-readable medium, said computer implemented method comprising the acts of: executing computer instructions to create a single intermediate representation of said source code listing regardless of programming language by parsing said source code listing; executing computer instructions to provide a database having computer-readable records associated with pre-identified routines, each record specifying matching rules of said corresponding pre-identified routine, that, if satisfied, presents a vulnerability during execution of said routine, said database allowing new rules to be incorporated into said database corresponding to new vulnerabilities; executing computer instructions to statically analyze said intermediate representation of said source code listing to create computer models of said source code listing, said models representing expected run time execution of a computer program created by compilation of said source code listing, said analysis including at least one of a data flow analysis, a semantic analysis and a control flow analysis; executing computer instructions to retrieve from said database records corresponding to routine calls represented in said intermediate representation; executing computer instructions to compare said models with said matching rules specified in said retrieved records to determine whether said routine calls possess vulnerabilities; and generating a report that identifies the detected vulnerabilities, including identifying call sites having the detected vulnerabilities, said report being viewable by a developer-user, and allowing the developer-user to address said vulnerabilities by modifying said source code listing.