Patent application number | Description | Published |
20090178055 | COLLABORATIVE PLANNING ACTIONS AND RECIPES - The complexities of actions and recipes used in collaborative planning are defined using set theory and an accompanying formalization. The formalizations presented can be used as a basis for making decisions in relation choosing recipes, and other activities concerning collaborative task execution in a multi-agent environment. Introducing the notion of the complexity of a recipe and an action provides a measure of the difficulty of a task, based upon which decisions regarding the use of particular recipes and contractors can be made. | 07-09-2009 |
20120159301 | SEMANTICALLY ENABLED, DATA SENSITIVE NEGOTIATION AND COLLABORATION ENGINE - A computer implemented method, system and/or computer program product presents data on a user interface. Tabular data for a particular type of data is converted into faceted data. The tabular data is stored according to headings in a table storing the particular type of data, and the faceted data is stored according to facets of the particular type of data. A set of facet names from the faceted data is mapped to a coordinate system on a user interface in order to assign each of the facet names to a predetermined area of a user interface. Facet values are associated with and mapped to the facet names in order to proximately display the facet values to their corresponding facet names according to the coordinate system. | 06-21-2012 |
20120166471 | NAVIGATION OF FACETED DATA - A processor implemented method, system and computer program product presents and retrieves data directories. A facet tree is initialized to present facet-converted stored tabular data and dynamically entered user-input data on multiple facet nodes. The facet nodes represent directories for the facet-converted stored tabular data and user-input data. In response to a single facet node from the multiple facet nodes being selected by a user, the single facet node is expanded by presenting, on the facet tree, all other facet nodes from the multiple facet nodes as children of the single facet node that was selected by the user. In response to a child of the single facet node being selected, value directories for the child are retrieved and presented according to a definition of the single facet node that was expanded. | 06-28-2012 |
20120179697 | FACETED INTERACTION INTERFACE TO OBJECT RELATIONAL DATA - A method, system and computer program product to generate selected tabular data from an object relational data model using a faceted interaction interface may include providing a faceted interaction interface to specify a faceted query to provide the selected tabular data from the object relational data model. The faceted query may include at least one facet and at least one facet condition. The method may also include constructing an object relational graph from a plurality of input object tables of the object relational data model. The method may also include selecting each object in the object relational graph which contains at least one facet and identifying each object in the object relational graph on which at least one facet condition applies. The method may additionally include generating at least one object group from the object relational graph. Each object group may include a path from a top level object which contains at least one facet in the object relational graph to an object which contains at least one facet and which does not have any children in the object relational graph. The method may further include generating an object table for each object group, wherein the object table comprises selected tabular data from the object relational data model. | 07-12-2012 |
20120197849 | RETRIEVING INFORMATION FROM A RELATIONAL DATABASE USING USER DEFINED FACETS IN A FACETED QUERY - A method, system and computer program product for retrieving information from a relational database using user defined facets in a faceted query may include receiving a faceted query and receiving at least one user defined facet group query. The method may also include filtering out facets in the faceted query that relate to metadata in the relational database. The method may additionally include associating each remaining facet in the faceted query with a corresponding user defined facet group query of the at least one user defined facet group query to provide a set of user defined facet groups. An SQL query may be generated for the faceted query using the set of user defined facet groups Information from the relational database may be retrieved responsive to the SQL query. | 08-02-2012 |
Patent application number | Description | Published |
20110107424 | Rollback Feature - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for rolling back protection processes. In one aspect, a method includes determining that a file is a malicious file, storing a duplicate of the file in a quarantine area, performing one or more protection processes on the file, if the determination that the file is a malicious file is a false positive determination, restoring the file by a pre-boot rollback process to a state prior to the one or more protection processes performed on the file, and booting the computer with the restored file, and if the determination that the file is a malicious file is not a false positive determination, not restoring the file to a state prior to the one or more protection processes performed on the file, and booting the computer. | 05-05-2011 |
20130097708 | SYSTEM AND METHOD FOR TRANSITIONING TO A WHITELIST MODE DURING A MALWARE ATTACK IN A NETWORK ENVIRONMENT - A method is provided in one example embodiment that includes receiving a signal to enable a whitelist mode on a host in a network, terminating a process executing on the host if the process is not verified, and blocking execution of software objects on the host if the software objects are not represented on the whitelist. In more particular embodiments, the method also includes identifying the process on a process list that enumerates one or more processes executing on the host. Yet further embodiments include quarantining the host if a second process on the process list is a critical process and if the second process is not verified. More specific embodiments include identifying and restarting another process on the process list if process memory was modified. | 04-18-2013 |
20140026218 | ROLLBACK FEATURE - A file stored in a first portion of a computer memory of a computer is determined to be a malicious file. A duplicate of the file is stored in a quarantine area in the computer memory, the quarantine area being in a second portion of the computer memory that is different from the first portion of the computer memory. One or more protection processes are performed on the file. The determination that the file is a malicious file is determined to be a false positive and the file is restored, during a boot sequence, to a state prior to the one or more protection processes being performed on the file. | 01-23-2014 |
20150347755 | ROLLBACK FEATURE - A file stored in a first portion of a computer memory of a computer is determined to be a malicious file. A duplicate of the file is stored in a quarantine area in the computer memory, the quarantine area being in a second portion of the computer memory that is different from the first portion of the computer memory. One or more protection processes are performed on the file. The determination that the file is a malicious file is determined to be a false positive and the file is restored, during a boot sequence, to a state prior to the one or more protection processes being performed on the file. | 12-03-2015 |
Patent application number | Description | Published |
20090319608 | AUTOMATED TASK CENTERED COLLABORATION - An automated task centered collaboration technique is described that significantly lowers the technological entry barrier for the development and deployment of a broad class of collaborative applications, which are termed Task Centered Collaboration (TCC) applications. TCC applications facilitate the processing of a large number of work items, or tasks, by people working independently or in small, synchronously collaborating groups. The technique also provides a mechanism for the study of computer mediated communication and human-computer interactions for this class of applications. The technique creates an abstraction applicable to the broad class of TCC applications, which enables the factoring out of significant portions of the application into a common infrastructure. It provides a programming model that enables a developer to focus on the User Interface and logic associated with operations on a single task, without being exposed to issues such as security, authentication, binding users to activities, synchronization, concurrency and persisting data. | 12-24-2009 |
20090327809 | DOMAIN-SPECIFIC GUIDANCE SERVICE FOR SOFTWARE DEVELOPMENT - During software development, both before and after release, information may be collected and stored that may provide insight to developers as a generalized service. For example, data from past debugging sessions, source code in various repositories, bug repositories, discussion groups, and various documents may provide relevant information for software developers to fix current problems when this information is coherently matched with the problem. Using various sources, a system may mine the stored data to give the current developer information related to past code development, and reveal why the code changed throughout previous development. Using sophisticated analyses to identify similar code patterns across multiple large software projects, discovering patterns in normal and abnormal uses of particular software interfaces, and employing other mining techniques, a developer may find domain-specific information to facilitate ongoing software development. | 12-31-2009 |
Patent application number | Description | Published |
20080197569 | Inverse Chess - This invention describes a game of inverse chess, with a pre-identified start position, and end position and arbitered moves chosen amongst a set of possible moves, played between two opponents on a chess board. This differs from normal chess in that it is played backwards in time where the objective is to reconstruct the pre-identified start position, from the pre-identified end position. While the pieces used in the game are essentially the same as that of regular chess, the moves they make are reversed. Since the state-space of this game is much larger in the potential moves, an arbiter is used to validate possible moves that one player might choose to make. Using either a regular or modified chess board, the pieces on the board move backwards. Three such moves are described in the I-castle, spawn and I-check moves. A variant of the game is the two-knight game wherein two knights play each other and the piece reaching the pre-identified start position, win. | 08-21-2008 |
20120035984 | Novel Methods for Supply Chain Management Incorporating Uncertainty - A robust method for solving in a computer, optimization problems under uncertainty including the steps of: specifying the uncertainty as a hierarchical series of sets of constraints on parameters, with the parameters restricted to each constraint set forming an ensemble, and the hierarchy of constraints, represented as mathematical sets forming a hierarchy of ensembles, said hierarchy being based on subset, intersection or disjoint relationships amongst them; utilizing optimization techniques to create effective identify minimum and maximum bounds on the each objective function, said bounds depending on the constraints comprising each ensemble of parameters and being computed for each of the assumptions about the future; estimating a volume of candidate ensembles and relating the volume to one or more information theoretic measures; and utilizing information theoretic measures to analyze and improve the candidate iteratively refine the ensembles and associated by changing a specificity of the bounds on the objective function. | 02-09-2012 |
Patent application number | Description | Published |
20110098949 | SYSTEM AND METHOD FOR HANDLING WIDE DYNAMIC RANGE SIGNALS ENCOUNTERED IN VIBRATION ANALYSIS USING A LOGARITHMIC AMPLIFIER - A data acquisition system for vibration analysis signals includes a logarithmic amplifier for compressing wide dynamic range signals. The logarithmic amplifier replaces attenuators, gain amplifiers, and gain switches used in a conventional system. Further, only a low bit-count analog to digital converter is needed in combination with the logarithmic amplifier. Consequently, the footprint of the system and system cost are reduced. | 04-28-2011 |
20110098956 | SYSTEM AND METHOD FOR CALIBRATING A HIGH RESOLUTION DATA ACQUISITION SYSTEM WITH A LOW RESOLUTION DIGITAL TO ANALOG CONVERTER - A high resolution data acquisition (DAQ) system is initially calibrated with a reference source having a resolution higher than the DAQ system. Measurements over the operating range of the DAQ system are taken, and characteristic calibration coefficients are determined from the measurements. Software corrections based upon the calibration coefficients are made to DAQ system measurements. A digital to analog converter (DAC) on-board the DAQ system having a lower resolution than the DAQ system is calibrated by generating a look-up table of input digital codewords and output electrical signals measured by the calibrated DAQ system. This look-up table is used to field calibrate the DAQ system using only the DAC, rather than the high resolution reference source. | 04-28-2011 |
20110098968 | SYSTEM AND METHOD FOR VIBRATION ANALYSIS AND PHASE ANALYSIS OF VIBRATION WAVEFORMS USING DYNAMIC STATISTICAL AVERAGING OF TACHOMETER DATA TO ACCURATELY CALCULATE ROTATIONAL SPEED - Vibration analysis is performed on a machine having a variable frequency drive by using a tachometer to monitor rotational speed of the drive shaft and a logic device to calculate speed parameters associated with the drive shaft using the tachometer data. The speed parameters include a maximum speed, a minimum speed, and an average speed of the drive shaft. By correlating the vibration spectra of the motor drive with the speed parameters, machine faults can be identified based upon the energy distribution in the spectra. Further, vibration waveforms from two or more locations on the machine can be sequentially acquired through synchronous triggering by using a pulse edge of a stable tachometer signal. The waveforms can be compared to determine a phase difference to help in identifying any machine faults that may be present. | 04-28-2011 |