Datasets:

patent

/

AIPD_evo_claim_one

like 0

10127432

15667812

1. A method comprising: obtaining data indicating (i) a list of minutiae extracted from a fingerprint image, and (ii) for each minutia included in the list of minutiae, an octant feature vector that identifies one or more neighboring minutiae within the fingerprint image; for each minutia included in the list of minutiae: computing one or more parameters based on comparing features of a minutia and respective features of one or more neighboring minutiae for the minutia, and computing an aggregate minutia quality confidence score based on combining the one or more computed parameters; computing a fingerprint quality confidence score for the fingerprint image based at least on combining the aggregate minutia quality confidence scores; and providing the fingerprint quality confidence score for output.

8346779

13074074

1. A computerized system of bitmap indexing of at least one dataset, said dataset comprising a plurality of cases and features, each case characterized by one or more values of each feature, said system comprising: i) a padding module, wherein one or more processors receive a set of bins vectors each is a mutually exclusive representation of at least one value associated with each feature of said respective case, wherein said bins vector is an array comprising a plurality of bits with values of ‘0’ or ‘1’, producing a bitmap indexing of said respective feature, said padding module enhances each said bins vector by identifying all target bit locations with a ‘1’ value and replacing at least one ‘0’ bit adjacent to a target bit location with a non-zero numerical value, thereby creating a padded bitmap index of each said bins vector, said padding module further enables determining a suitable padding factor associated with each feature of said dataset, prior to carrying out said padding of said bitmap index, said padding factor representing the number and location of adjacent bits to be replaced in the bitmap index, wherein said padding is carried out according to said determined padding factor; and ii) at least one storage unit for enabling storing all said padded bitmap indexes therein.

20120006278

13257746

1. A method for breeding scallop population with orange-red adductor muscles, wherein the method comprises: (1) randomly collecting adult scallops from wild scallop populations; slightly opening shells of the adult scallops, observing colors of adductor muscles in the shells; selecting and growing scallops that have orange-red adductor muscles; separating male and female scallops; promoting selected scallops to sexual maturity; (2) using high performance liquid chromatography (HPLC) technique to detect carotenoid contents in the orange-red adductor muscles of the selected scallops from (1); selecting male and female scallops with above 15 μg/g carotenoid contents as parental seeds; (3) repeating the steps of (1) and (2) for four generations until 100% of breeding scallops have stable carotenoid contents and an average carotenoid content of two year old scallops is above 30 μg; (4) then collecting scallops with orange-red adductor muscles from cultivated scallop populations or wild scallop populations; opening shells of the scallops and observing appearance of sex glands; selecting scallops with well developed sex glands as breeding parents; (5) putting the selected scallops of (4) in indoor culturing pools with filtered sea water; washing shells of the parental seeds to remove additive mud and other materials; gradually and slowly increasing culturing temperature with less than 1° C. increase every day until culturing temperature is 8-8.5° C. higher than environmental sea water temperature; culturing the scallops for additional 20 days to induce sexual maturity; (6) separating males and females of sexually matured breeding parents from (5); drying the scallop in dark for 30-40 minutes; inducing the breeding parents to spawn eggs and sperms using warmer filter sea water which is 2° C. higher than the culturing sea water temperature of (5); separately collecting the eggs and sperms; (7) mixing the eggs with the sperms; observing fertilized eggs under a microscope, each egg being surrounded by 3-4 sperms; and fertilization being finished within 1.5 hour; and (8) incubating and growing the fertilized eggs of (7) according to normal cultivation methods.

7778179

11285723

1. A method of evaluating a condition in a data transfer path that transfers data between data communication nodes of a data network, comprising: receiving at a data production unit probe packets that traverse the data transfer path during real-time operation of the data transfer path; in response to traversal of the data transfer path by said probe packets, and during said real-time operation of the data transfer path, the data production unit using information from said probe packets to provide estimation data for use in estimating the condition, the condition being available bandwidth in the data transfer path; and producing at an estimation unit coupled to the data production unit an estimate of the condition during said real-time operation of the data transfer path, including applying a filter operation to said estimation data during said real-time operation of the data transfer path, wherein said applying step includes using a Kalman filter, wherein said applying step including using a state vector that corresponds to a characteristic exhibited by said estimation data, and wherein said characteristic is piecewise linearity.

20140358914

14347776

1. (canceled)

9928234

15157760

1. A method, comprising: performing, by a computer system, semantico-syntactic analysis of a natural language text to produce a semantic structure representing a set of semantic classes; associating a first semantic class of the set of semantic classes with a first value reflecting a specified semantic class attribute; identifying a second semantic class associated with the first semantic class by a pre-defined semantic relationship, wherein an instance of the second semantic class is an ancestor of the first semantic class in a semantic hierarchy associated with the set of semantic classes; associating the second semantic class with a second value reflecting the specified semantic class attribute, wherein the second value is determined by applying a pre-defined transformation to the first value; evaluating a feature of the natural language text based on the first value and the second value; determining, by a classifier model using the evaluated feature of the natural language text, a degree of association of the natural language text with a particular category of a pre-defined set of categories; and performing, using the degree of association, a natural language processing operation.

20050198606

11023592

1. A method for creating a system for verifying a digital circuit design using a testbench that comprises an HDL component and an HAL component, the method comprising: synthesizing the digital circuit design into a structural model; transforming the HDL component of the testbench into a structural model maintaining exact simulation semantics, wherein the structural model includes a plurality of finite state machines (FSMs) corresponding to timed and untimed parallel blocks of code in the behavioral model; mapping the FSMs onto a reconfigurable hardware platform; and automatically synthesizing a communication interface between the FSMs running on the reconfigurable hardware platform and the HAL component of the testbench running on a sequential computation platform.

20160110443

14977604

1. A system for multidimensional data representation, comprising: a data aggregator comprising at least a plurality of software programming instructions stored in a memory of and operating on a processor of a computing device, configured to receive data from a plurality of data sources; and a visualization engine comprising at least a plurality of software programming instructions stored in a memory of and operating on a processor of a computing device, configured to receive data from the data aggregator, and configured to produce a representation of at least a portion the data suitable for viewing by a human user, wherein the representation comprises at least a plurality of time-ordered data points represented as a two-dimensional curve, and wherein each successive time-ordered data point is appended to an end of the curve, and wherein at least a portion of the plurality of time-ordered data points are represented as graphical indicia of varying size and opacity, the size and opacity of each particular data point being based at least in part on data represented by the data point.

4761758

06902988

1. A digital signal processor for dividing a digital dividend signal by a digital divisor signal to obtain a digital quotient signal and a digital remainder signal, the processor comprising: an arithmetic logic unit (alu) having selectively concatenated independently controllable most (MSB) and least (LSB) significant bit sections having first and second inputs, and first and second outputs; an accumulator (acc) having most (msb) and least (lsb) significant bit sections with respective inputs connected to the first and second outputs of the arithmetic logic unit; a shift register (sr) having an additional signal input, and having an output connected to the second input to the arithmetic logic unit, means for connecting respective inputs of the shift register to first and second outputs of the accumulator; and a control means: (a) for loading the dividend signal into the least significant bit section of the accumulator, (b) for testing whether the current value of the digital signal in the arithmetic logic unit from the most significant bit section of the accumulator is negative, (c) for shifting the concatenated signal from the accumulator in the shift register to double the value thereof, (d) in response to a negative msb signal in the accumulator, for adding in the most significant bit section of the arithmetic logic unit, the value of the divisor signal to the current value of the signal from the most significant bit section of the shift register and storing the resultant signal in the most significant bit section of the accumulator, (e) in response to a negative msb signal in the accumulator, for incrementing in the least significant bit section of the arithmetic logic unit, the value of the signal from the least significant bit section of the shift register by one, and storing the resultant signal in the least significant bit section of the accumulator (f) in response to a non-negative msb signal in the accumulator, for subtracting in the most significant bit section of the arithmetic logic unit the value of the divisor signal from the current value of the signal at the output of the most significant bit section of the shift register and storing the resultant signal in the most significant bit section of the accumulator; (g) in response to an N cycle counter, for repeating functions (b) to (f) N times, where N equals the number of bits of the dividend signal; then for (h) repeating function (b), (j) in response to a negative msb signal in the accumulator, for repeating functions (d) (c) and (e) to derive the digital remainder signal from the most significant bit section and the inverted digital quotient signal from the least significant bit section of the accumulator; and (k) in response to a non-negative msb signal in the accumulator, for deriving the digital remainder signal from the most significant bit section of the accumulator, and for repeating function (c) to derive the inverted digital quotient signal from the least significant bit section of the accumulator.

20070073566

11238825

1. A method for managing operations of a system, comprising: partitioning the system into a plurality of subsystems; for a subsystem: creating an agent to associate with the subsystem; providing to the agent one or more goals for the subsystem; and providing to the agent an overall objective function for the system; and using an optimization algorithm involving the agents to manage system operation based on the goals and the overall objective function.

8731729

13453665

1. A method of developing a set of computer readable control algorithms stored on non-transitory computer readable media for simulation of operation of a microgrid system, including: developing a model of a physical form of the microgrid system; identifying a plurality of loads and sources in the modeled microgrid system; assigning one or more state variables to each of the loads and sources in the modeled microgrid system, wherein the state variables represent a plurality of possible states; implementing candidate algorithmic control structures on the modeled microgrid system as state machine model elements that simulate control of the respective state variables of the loads and sources, wherein the state variables represent power routing of the microgrid system; simulating operation of the microgrid system according to the implemented candidate control algorithmic control structures; determining an overall power balance on the microgrid system based on individual states of aggregate system power sources and loads of the model, wherein the power balance is based on a value of each of the state variables of each of the loads and sources; selecting an optimal set of the algorithmic control structures for use in performing simulations of the microgrid, said selection being based on the selected set of control algorithms being capable of controlling a simulation of a desired simulation period within a minimal amount of computer processing time; and storing the selected set of control algorithms on the non-transitory computer readable media.

20090006045

11770385

1. A method in a computing device for forecasting frequency of a time-dependent query, the method comprising: storing frequency of the query at intervals; calculating a value of a frequency spectral of the query for each of a plurality of angular frequencies; identifying one or more peaks within the frequency spectral; generating, for a model, parameters for each identified peak; and determining a forecasted frequency at an interval based on the model parameters generated for the model.

7552409

11147814

1. A method for achieving signoff closure for a design layout for an integrated circuit (IC), the method comprising: analyzing the design layout using a signoff algorithm in a signoff tool to detect a set of violation paths and to generate context data for one or more of the set of violation paths, wherein each of the set of violation paths consists of a signal path in the design layout exhibiting a violation of a design specification for the IC, and wherein the context data comprises violation information other than violation path information; implementing changes to the design layout in an implementation tool based on the set of violation paths and the context data; and repeating the steps of analyzing and implementing until the design layout meets the design specification according to the signoff algorithm.

8225308

11925680

1. At a computer system, the computer system including a repository storing models that describe intended application behavior, executive services for refining models so that drivers can implement model related commands on applications, and driver services for implementing model related commands for applications, a method for managing the lifecycle of a software application, the method comprising: an act of storing application models in a repository, each application model comprising a declarative model that describes the structure and behavior of a distributed application; an act of storing command/workflow models in the repository, each command/workflow model defining lifecycle commands for performing a transition between states of the lifecycle of a corresponding distributed application; an act of storing lifecycle models in the repository, each lifecycle model defining states of a corresponding distributed application including transitions that can be made between the states, each transition including a reference to a command/workflow model that defines commands for implementing the transition; an act of receiving an application model reference along with a software lifecycle command, the application model reference referring to a first application model that is stored in the repository, the software lifecycle command indicating a software lifecycle transition that is to be applied to a first distributed application; an act of utilizing the application model reference to access the first application model, the first application model including a lifecycle model reference referring to a first lifecycle model in the repository and including a lifecycle state attribute configured to store a lifecycle state value indicating a current lifecycle state of the first distributed application; an act of utilizing the lifecycle model reference to access the first lifecycle model, the first lifecycle model defining states of the first distributed application including transitions that can be made between the states, the states including an initial state, a valid state, a ready state, a deployed state and a running state, each defined transition referencing a command/workflow model in the repository that defines commands for implementing the transition; an act of accessing the lifecycle state attribute in the first lifecycle model to determine the current lifecycle state of the first distributed application, the current lifecycle state comprising one of the initial state, the valid state, the ready state, the deployed state, or the running state; an act of referring to the first lifecycle model to determine if the first distributed application can transition from the current lifecycle state to a new lifecycle state in accordance with the lifecycle transition indicated in the received software lifecycle command, the lifecycle command comprising one of a create deployment transition command for transitioning the distributed application from the initial state to the valid state, a verify transition command for transitioning the distributed application from the valid state to the ready state, a deploy transition command for transitioning the distributed application from the ready state to the deployed state, and a start transition command for transitioning the distributed application from the deployed state to the running state; an act of determining that the first lifecycle model references a first command/workflow model for transitioning the first distributed application to the new lifecycle state in accordance with the lifecycle transition indicated in the received software lifecycle command; an act of instantiating a first command/workflow instance from the first command/workflow model; and an act of the first command/workflow instance performing commands to transition the distributed application to the new lifecycle state.

7721288

10930722

1. A method of organizing a transmission of repository data, the method comprising: receiving, in a computer system, a request to transmit data from a data repository to a data recipient, the data being transmitted in a plurality of concurrently executing batch jobs; performing, in response to the request, batch jobs for transmitting the data, each of the batch jobs identifying a data amount that is to be transmitted to the data recipient, wherein each of the batch jobs having a control parameter assigned thereto that specifies an amount of data to be transferred by the corresponding batch job, wherein the control parameters are assigned to the batch jobs using one of a plurality of predictive models that is selected according to an organization state of the batch jobs; and upon detecting during transmission that a performance parameter of the computer system does not meet a predefined standard, automatically changing the data amount that is handled by at least one of the batch jobs, wherein automatically changing the data amount that is handled by at least one of the batch jobs comprises splitting the at least one of the batch jobs into at least two batch jobs upon determining that the computer system can support an increased system load; wherein: the organization state is determined by collecting information selected from a group comprising: a number of batch subjobs that the new batch jobs are split into, a number of levels of the batch subjobs, a number of knowledge entities identified by each of the new batch jobs, a volume of the data amount identified by each of the new batch jobs, and combinations thereof; the plurality of predictive models are grouped into clusters of predictive models making similar predictions; and the selected predictive model is selected based on which cluster is closest to the organization state.

7813947

10842992

1. A method, comprising: identifying at least one critical asset of an enterprise; identifying at least one business process of the enterprise associated with the identified critical asset; evaluating at least one technological component related to the business process; creating a threat profile for an area of concern associated with the business process and the critical asset; creating an interdependency matrix for business processes of the enterprise; performing a risk analysis, a regulatory compliance analysis and a business process optimization analysis for the business process based on the evaluation of the at least one technological component related to the business process, the threat profile for the area of concern associated with the business process and the critical asset, and the interdependency matrix for business processes of the enterprise; developing a strategy for the enterprise's performance of the business process based on the performance of the risk analysis, the regulatory compliance analysis and the business process optimization analysis for the business process, wherein developing the strategy comprises developing at least one protection strategy, at least one compliance strategy, and at least one business process optimization strategy, and wherein the at least one compliance strategy is developed based on applicable government regulations for the enterprise's performance of the business process; developing a master plan for the enterprise based on the at least one protection strategy, at least one compliance strategy, and at least one business process optimization strategy; and monitoring the enterprise's performance of the business process, with a computer-based enterprise information system comprising at least one processor and a computer readable medium storing instructions to be executed by the at least one processor, to assess compliance with the strategy, wherein the at least one processor is programmed to retrieve information from one or more data sources to assess compliance with the strategy, wherein the computer-based enterprise information system comprises a plurality of engines executed by the at least one processor, wherein the plurality of engines comprise: an intelligence analytics engine that analyzes information from the one or more data sources to determine one or more parameters relevant to the enterprise's performance of the business process; and a process management engine that monitors the enterprise's performance of the business process in terms of compliance with the applicable government regulations, business process optimization, and security.

8412654

12587564

1. A method for fully automated energy demand curtailment, the method comprising: determining, by a processor, a first demand response event based on electronic message data indicating a demand response event received over a communication network, wherein the electronic message data indicates one of a plurality of demand response events including the first demand response event; determining, by the processor, one or more demand reduction actions to be implemented at one or more end users who agreed to implement demand reduction for the first demand response event, wherein the one or more demand reduction actions are determined based on energy demand curtailment objectives of the first demand response event and a hierarchy of predetermined demand reduction actions for the first demand response event available for the one or more end users and ordered to minimize undesired impact at the one or more end users, wherein a first of predetermined demand reduction actions includes supplying energy from an alternative energy source to operate a first appliance at the one or more end users; monitoring data related to implementing energy demand curtailment at the one or more end users; and generating a signal or control data to implement the one or more demand reduction actions for at least one of one or more appliances of the one or more end users and one or more supplemental energy sources for supplying energy to the one or more end users.

8584100

12635412

1. A method for testing software code in a computer system comprising: identifying a set of code tests associated with the software code; identifying, for each code test of the set of code tests, relevant code elements of the software code, determining, by a code change tracker implemented using at least one processor executing instructions stored on at least one non-transitory computer-readable storage medium, changed code elements in the software code; determining, by a dependency analyser implemented using at least one processor executing instructions stored on at least one non-transitory computer-readable storage medium, dependencies between the code elements and dependency changes between code elements based on the determined changed code elements; determining, by an impact assessment engine implemented using at least one processor executing instructions stored on at least one non-transitory computer-readable storage medium, impact factors for each of the respective changed code elements based on the determined dependency changes, each impact factor predicting a potential failure of future tests conducted using at least one of the set of code tests; selecting a subset of the set of code tests for the software code based on the identified relevant code elements and on the impact factors; and performing using at least one processor executing instructions stored on at least one non-transitory computer-readable storage medium, the selected subset of code tests on the software code.

20110004935

12865795

1. A method of determining a status of a virtual machine (VM) running in conjunction with a virtual machine monitor (VMM), wherein one or more applications and a guest operating system (OS) are running in the VM, the method comprising: collecting a stream of events from the VMM, each event in the stream corresponding to an operation of the VMM; and determining the status of the VM as a function of the collected stream of events.

20090063255

12199583

1. A system, comprising: a data collection device having a plurality of modalities, the data collection device operable to use the plurality of modalities to obtain neuro-response data from a consumer exposed to stimulus material, the stimulus material having a plurality of components; a response integration system operable use combined neuro-response data from the plurality of modalities to assess consumer experience, wherein the response integration system is operable to assess consumer experience for each of the plurality of components of the stimulus material.

20060107823

10993109

1. A system for generating a set of coordinate vectors from a sparse graph of media object similarities, comprising using a computing device for: receiving a sparse graph of media object similarities; computing a set of coordinate vectors from each media object comprising a subset of media objects represented by the sparse graph; and updating the set of coordinate vectors by computing coordinate vectors for each remaining media object represented by the sparse graph which was not included in the subset of media objects.

20130111583

13283371

1. In a data processing system associated with a plurality of users, wherein at least a portion of the users have each been previously assigned one or more permissions which correspond respectively to specified system resources, a method comprising the steps of: acquiring data from a first data source, wherein said first data source contains information pertaining to the users of said portion and to the permissions previously assigned thereto; acquiring data from a second data source, wherein said second data source contains information pertaining to one or more specified attributes of each user of said plurality; determining a set of permissions for a given role, wherein said set of permissions are determined using information from at least one of said first data source and said second data source, and said set of permissions comprises one or more specified permissions associated with resources of said system; determining a first criterion for assigning users to said given role from information contained in said first data source; determining a second criterion for assigning users to said given role from information contained in said second data source; and selecting a particular user for admission to said given role only if said particular user is in compliance with both said first criterion and said second criterion, wherein each user admitted to said given role is assigned each of the specified permissions of said permission set.

8468475

13400510

1. An apparatus for converting a description of a circuit into an abstract model of the circuit, the apparatus comprising: a causality engine coupled to at least one database comprising protocol information relating to the circuit, a model description of the circuit, and simulation data associated with the circuit, the causality engine configured to determine deterministic behavior between input and output signals of the simulation data; and a neural network coupled to the causality engine and configured to generate an abstract model of the circuit approximating a behavior of the circuit based on the determination of deterministic repetitive behavior by the causality engine; wherein, to generate an abstract model of the circuit, the neural network is configured to: generate a system of weighted equations representing the behavior of the circuit; apply input patterns to the system of equations to generate actual output values; calculate an error using a difference between the actual output values and desired values; and modify the weightings in the system of equations based on the calculated error.

20020038926

09927394

1. A method for determining the amounts of reagents required in the desulphurization of a hot metal batch, the method being characterized by the following steps. a) acquiring historical values ( 22 ) of process parameters ( 20 ); b) selecting training data ( 24 ) from said historical values of process parameters to represent normal operation of a desulphurization station; c) developing a multivariate statistical model ( 26 ) corresponding to normal operation of the desulphurization station with input from said training data; d) acquiring on-line values of process parameters ( 40 ) during operation of the desulphurization station; and e) calculating an output vector ( 44 ) to predict required amounts of desulphurization reagents using said multivariate statistical model.

9171011

14010857

1. A method comprising: identifying, by one or more computing devices, a 3D model of an object from a plurality of 3D models of objects, wherein each 3D model of an object of the plurality of 3D models of objects is associated with information defining a geographic area of a base polygon of the respective object; determining, by the one or more computing devices, whether a geographic coordinate of a point of interest is within the geographic area of the base polygon; when the geographic coordinate of the point of interest is within the geographic area of the base polygon, creating, by the one or more computing devices, a system tag including a search term selected based on the given point of interest; and associating, by the one or more computing devices, the system tag with the identified 3D model of the object.

9460055

14489289

1. A method for determining a polychoric correlation between a first discrete variable and a second discrete variable, the method comprising: if a first discrete variable is without a first known distribution, approximating a first distribution for the first discrete variable; if a second discrete variable is without a second known distribution, approximating a second distribution for the second discrete variable; transforming a first normally distributed variable to a first transformed variable by simulating values of the first normally distributed variable and discrete mapping from the first normally distributed variable to one of the first known distribution and the approximated first distribution for the first discrete variable based at least in part on the simulated values of the first normally distributed variable; transforming a second normally distributed variable to a second transformed variable by simulating values of the second normally distributed variable and discrete mapping from the second normally distributed variable to one of the second known distribution and the approximated second distribution for the second discrete variable based at least in part on the simulated values of the second normally distributed variable; and determining, by a computing device, a polychoric correlation between the first discrete variable and the second discrete variable by using a stochastic root finding algorithm to operate on the first transformed variable and the second transformed variable.

20100191530

12691958

1. A speech understanding apparatus comprising: a speech recognition unit which performs speech recognition of an utterance using multiple language models, and outputs multiple speech recognition results obtained by the speech recognition; a language understanding unit which uses multiple language understanding models to perform language understanding for each of the multiple speech recognition results output from the speech recognition unit, and outputs multiple speech understanding results obtained from the language understanding; and an integrating unit which calculates, based on values representing features of the speech understanding results, utterance batch confidences that numerically express accuracy of the speech understanding results for each of the multiple speech understanding results output from the language understanding unit, and selects one of the speech understanding results with a highest utterance batch confidence among the calculated utterance batch confidences.

5528929

08405951

1. A misfire detecting apparatus for an internal combustion engine, comprising: a) reference angular position setting means (2) mounted on a crank shaft (14) of said internal combustion engine and including a plurality of segments (12,13) individually defining angular intervals corresponding to reference positions for a plurality of cylinders of said engine, respectively; b) a crank angle sensor (3) disposed in opposition to said reference angular position setting means for generating a plurality of pulse signals as an angular position signal (SGT) for every predetermined crank angle per one rotation of said crank shaft; c) period measuring means (6) for measuring periods (T) of said plurality of pulse signals, respectively; d) correcting coefficient arithmetic means (7) for arithmetically determining a plurality of correcting coefficients (KL1,KL2) individually corresponding to the plurality of segments on the basis of said plurality of periods in a steady operation state of said internal combustion engine; e) period variation index arithmetic means (8) for arithmetically determining an index (.alpha.o) which quantifies variations of said periods on the basis of said correcting coefficients and said periods; and f) misfire decision means (9) for making a decision as to an occurrence of misfire in said internal combustion engine on the basis of said period variation index; g) wherein said correcting coefficient arithmetic means includes updating arithmetic means for updating said plurality of correcting coefficients to respective latest values by learning; and h) wherein said updating arithmetic means updates said plurality of correcting coefficients such that a number of times for updating said correcting coefficients is substantially the same for each one of said plurality of correcting coefficients, respectively.

20160371534

14741015

1. A system, comprising: a hardware processor, and a memory device configured to store computer-executable instructions that when executed by the processor cause the processor to enable computer-executable components, the components comprising: an access component configured to access information related to entities in an event captured in a video; a collection component configured to collect training data from the information and used for identification of the entities in the video; a recognition component configured to perform facial recognition processing of the entities in the video to identify a specific entity, the facial recognition processing performed using a model; and a content component configured to obtain content relevant to the specific entity for presentation with the video of the specific entity.

20090074658

12193624

1. A method of identifying a modified capsid-displayed adenoviral polypeptide, the method comprising: (a) contacting a population of mammalian cells with an adenoviral library generated by co-transforming a population of cells expressing Cre-recombinase with linearized shuttle plasmids, each comprising a selectable marker, and transfer plasmids, each comprising a variant capsid-displayed adenoviral gene flanked by lox sites, wherein the variant capsid-displayed adenoviral gene comprises a mutation relative to the native adenoviral gene sequence and recombining the variant capsid-displayed adenoviral gene and the negatively selectable marker to generate an adenovirus expressing a modified capsid-displayed adenoviral polypeptide; (b) identifying an adenovirus expressing a modified capsid-displayed adenoviral polypeptide that increases adenovirus binding to a mammalian cell relative to a wild-type adenovirus; and (c) isolating the variant capsid-displayed adenoviral gene, thereby identifying a modified capsid-displayed adenoviral polypeptide that re-targets an adenovirus.

8036735

11835812

1. A system for use with an implantable medical device, the system comprising: a remote external server, comprising: a physiological data input, configured to receive physiological data into a patient data storage device that stores historical physiological data of a population of congestive heart failure (CHF) patients, the physiological data input comprising an implantable physiological data input configured to receive implantable physiological data from an implantable physiological sensor of a first patient; a processor, coupled to the patient data storage device, the processor configured to apply multiple algorithm variations against the same implantable physiological data from the first patient to produce corresponding resulting CHF indicators; and a local or remote external user interface, configured to be coupled to the remote external server using a communications network, the local or remote external user interface comprising a display, configured to display to a user information allowing comparison between the resulting CHF indicators from the multiple algorithm variations, and the display including a population data selector configured to permit the user to select physiological data from a population comprising a different set of one or more patients or physiological data collected over a period of time from the first patient, wherein the processor is configured to automatically reprogram the implantable medical device with an algorithm selected from the multiple algorithm variations as a function of a false positive rate and a sensitivity.

7912798

12209071

1. A computer program product having a plurality of executable instruction codes, for determining an expansion of storage resulting from a candidate clustering scheme for data, the steps performed by the executable instruction codes comprising: modeling an anticipated space waste to result from two or more multidimensional candidate clustering schemes, each multidimensional candidate clustering scheme defined by two or more clustering keys and configured to group data into a plurality of logical cells such that logically related data is stored in close proximity on a physical storage medium to reduce data access times, each unique logical cell defined by a unique combination of two or more clustering key values, each of the two or more clustering keys defining a dimension in the multidimensional candidate clustering scheme, each unique logical cell corresponding to one or more physical storage blocks in the physical storage medium, wherein the physical storage blocks have a block size, wherein each unique cell comprises a partially filled storage block from the data, wherein defining the anticipated space waste comprises calculating the anticipated space waste as a proportion of the block size, wherein modeling the anticipated space waste comprises: determining a cardinality of unique cells to be created in accordance with the multidimensional candidate clustering scheme; defining the anticipated space waste in proportion to the cardinality of unique cells; wherein the anticipated space waste is determined in accordance with a following equation: W=n cell *P % *β, where W is the anticipated space waste (W), n cell is a cardinality of unique clusters, P % is an estimated proportion of each partially filled block that is waste space, and β is the block size, and a second set of instruction codes for defining the expansion of data storage in proportion to the anticipated space waste, and defining expansion of data storage in proportion to the anticipated space waste for each candidate clustering scheme; and selecting one or more candidate clustering schemes that result in a least amount of expansion of storage.

8094904

12283441

1. A method for suppressing bone structures in an x-ray image, comprising: receiving an x-ray image having a plurality of pixels; extracting a set of wavelet features for each pixel in the x-ray image; and generating a soft-tissue image without bone structures from the x-ray image by using a trained regression function to determine an intensity value for the soft-tissue image corresponding to each pixel in the x-ray image based on the set of wavelet features extracted for each pixel in the x-ray image.

20120250982

13427199

1. An image processing apparatus comprising: an image feature outputting unit that outputs each of image features, which are formed as features of a plurality of feature points of images of each frame in data of an input moving image, in correspondence with a time of the frame; a foreground estimating unit that estimates a foreground image at a time s by executing a view transform as a geometric transform on a foreground view model having the image feature of a foreground image in the image as a parameter in regard to the image feature at the time s, and then outputs an estimated foreground view; a background estimating unit that estimates a background image at the time s by executing a view transform as a geometric transform on a background view model having the image feature of a background image in the image as a parameter in regard to the image feature at the time s, and then outputs an estimated background view; a synthesized view generating unit that generates a synthesized view by synthesizing the estimated foreground view and the estimated background view; a foreground learning unit that learns the foreground view model based on an evaluation value obtained by comparison between the synthesized view and the image feature at the time s by updating the parameter of the foreground view model based on a stochastic generation model; and a background learning unit that learns the background view model based on the evaluation value by updating the parameter of the background view model based on a stochastic generation model.

9880995

11398728

1. A computer-aided method to determine whether an unidentified author of a textual work belongs to a group comprising the textual work of a known author, the method comprising the steps of: obtaining a sample of the textual work of the unidentified author; obtaining a sample of the textual work of the known author; entering the samples into a computer system, the computer system including a memory, a means for analyzing documents, and a means for determining belonging, stored within the memory; utilizing the means for analyzing documents, splitting the entered samples into individual sentences, the sentences each including a head, a plurality of words and punctuation, the punctuation defining a syntactic edge within the individual sentence, and graphemic features defining a discursive function emphatic selected from the group consisting of: bolding, italics, capitalization, emoticons and serial punctuation marks; categorizing the punctuation by determining the syntactic edge; indicating the discursive function emphatic, a graphemic feature being generated by the steps of categorizing and indicating; dividing each of the individual sentences into the words; labeling each of the words as a part of speech; listing the labeled words into phrases for each labeled word; identifying phrases for each said head; classifying the identified phrases as marked or unmarked; characterizing the identified phrases by markedness, thereby producing a plurality of syntactic features; and utilizing the means for determining belonging, inputting at least one of the syntactic features and inputting at least one feature selected from the group consisting of: (i) the graphemic features and (ii) the syntactic edges defined by punctuation; wherein the inputting is done for each said sample to determine whether the unidentified author of the textual work sample belongs to the known author group.

20160110433

14974871

1. A method for generating data to provide situational awareness or decision-making assistance to a user in relation to a physical environment, the method comprising, with a computer system: processing input data comprising at least data associated with the physical environment; and when a need for situational awareness or decision-making assistance is detected based on the input data, generating response data, the response data derived from multimodal data from a plurality of electronic data streams comprising audio, visual and textual information, the data streams received from a plurality of data sources, wherein generating the response data comprises: determining a characteristic of the need for situational awareness or decision-making assistance; extracting semantic information from the audio, visual and textual information; correlating the extracted semantic information in accordance with the characteristic; selecting a subset of the audio, visual and textual information based on the correlation of the extracted semantic information with the characteristic; and outputting at least a portion of the selected subset as the response data.

8131613

11385397

1. A computer-implemented method of allocating assets in a defined benefit pension plan with a set of pension liabilities from required benefit payments to plan participants as defined by a plan specification of the defined benefit pension plan including pension benefits and other post-retirement benefits, a plurality of pension assets with asset classes and security weightings representative of amounts of the pension assets invested over the plurality of asset classes and security weightings including stocks and bonds, the method being performed on a computer system having an output device, comprising: (A) calculating by the computer system the set of pension liabilities including calculating each of the required benefit payments using discounted values based on rates of mortality, morbidity, disability, withdrawal, turnover, retirement and a membership roster of the defined benefit pension plan wherein the required benefit payments are based on fixed deterministic assumptions or based on stochastic random variable assumptions; (B) calculating by the computer system a first calculated value indicative of a first set of pension assets that are matched with the set of pension liabilities wherein a unit of matched pension assets moves with a unit of pension liabilities of the set of pension liabilities and wherein the calculating of the first calculated value includes; (i) determining for each of the asset classes and security weightings in the first set of pension assets an expected asset return and a variance of asset return, (ii) determining for each of the asset classes and security weightings in the first set of pension assets a covariance of asset return with respect to every other asset return over the plurality of asset classes and security weightings, (iii) determining for each required benefit payment in the set of pension liabilities an expected liability return and a variance of liability return, (iv) determining for each required benefit payment in the set of pension liabilities a covariance of liability return with respect to every liability return of every other required benefit payment in the set of pension liabilities, (v) determining for each of the asset classes and security weightings in the first set of pension assets a covariance of asset return with respect to the liability return of each required benefit payment in the set of pension liabilities; and (vi) multiplying a matrix of variances and co-variances in B(i) to B(v) with the matrix of corresponding weightings of each of the required benefit payments in the set of pension liabilities and corresponding security weightings of each of the asset classes and security weightings in the first set of pension assets; (C) calculating by the computer system a second calculated value indicative of a second set of pension assets that are not fully matched with the set of pension liabilities wherein a unit of the non-fully matched pension assets does not move with a unit of pension liabilities of the set of pension liabilities and wherein the calculating of the second calculated value includes; (i) determining for each of the asset classes and security weightings in the second set of pension assets an expected asset return and a variance of asset return, (ii) determining for each of the asset classes and security weightings in the second set of pension assets a covariance of asset return with respect to every other asset return over the plurality of asset classes and security weightings, (iii) determining for each of the required benefit payments in the set of pension liabilities an expected liability return and a variance of liability return, (iv) determining for each of the required benefit payments in the set of pension liabilities a covariance of liability return with respect to every liability return of every other required benefit payment in the set of pension liabilities, (v) determining for each of the asset classes and security weightings in the second set of pension assets a covariance of asset return with respect to the liability return of every required benefit payment in the set of pension liabilities; and (vi) multiplying a matrix of variances and covariances in C(i) to C(v) with the matrix of corresponding weightings of each of the required benefit payments in the set of pension liabilities and corresponding weightings of each of the asset classes and security weightings in the second set of pension assets; (D) wherein the calculating of the first and second calculated values representative of the first and second sets of pension assets includes applying to specified portions of the first and second sets of pension assets each of; (i) a binary liability allocation method wherein any asset class or security that is not completely matched is assigned as completely unmatched, (ii) a continuous liability allocation method wherein any asset class or security that is not completely matched is assigned partially as matched and partially as unmatched in accordance with the extent of matching based on a defined volatility metric having a first anchor value for assigning zero percent matching, a second anchor value for assigning one-hundred percent matching, and a transformation function for transforming from the defined volatility metric to a matching factor for assigning intermediate values of matching, and (iii) a correlation-based liability allocation method wherein each of the asset classes and security weightings is assigned as matched or unmatched in accordance with the correlation of each asset return within the set of pension assets to the liability return of the set of pension liabilities and in accordance with the corresponding weightings of each of the asset classes and security weightings; (E) calculating by the computer system a pension liability allocation ratio by dividing one of the first and second calculated values by the other of the first and second calculated values in accordance with step (D); (F) calculating by the computer system a further first calculated value and a further second calculated value in accordance with steps (A)-(E) to provide differing asset class and security weightings representative of differing amounts of the pension assets invested over the plurality of asset classes and security weightings; (G) determining a pension liability allocation efficient frontier in accordance with; (i) calculating the pension liability allocation ratio within an optimization objective function, (ii) calculating the pension liability allocation ratio as a constraint to the optimization objective function; wherein an optimized asset class and security weighting are determined by an optimization process; and (H) outputting a representation of the optimized asset class and security weighting on the output device.

8645298

12912428

1. A method for training a topic model, comprising: for a document within a document corpus: receiving a document representation of the document and features of the document, the document representation comprising a frequency of word occurrences within the document; processing the document representation and the features using a topic model, the processing comprising: specifying a feature/topic parameter for a feature of the document, the feature/topic parameter specifying a probability of the feature being indicative of a first topic, the feature/topic parameter based upon a first uncertainty measure that is associated with a first determination of a first deviation of the feature/topic parameter from a current feature/topic parameter for the topic model; updating the first uncertainty measure based upon a first difference measure between the feature/topic parameter and one or more previously specified feature/topic parameters for the topic model, the first difference measure representing a first range of deviation for the first uncertainty measure; specifying a document/word/topic parameter for a word within the document, the document/word/topic parameter specifying a probability of the word being indicative of a second topic, the document/word/topic parameter based upon a second uncertainty measure that is associated with a second determination of a second deviation of the document/word/topic parameter from a current document/word/topic parameter for the topic model; and updating the second uncertainty measure based upon a second difference measure between the document/word/topic parameter and one or more previously specified document/word/topic parameters for the topic model, the second difference measure representing a second range of deviation for the second uncertainty measure; and training the topic model based upon the feature/topic parameter and the document/word/topic parameter.

20120143597

13396573

1. A system for evaluating a review having unstructured text, the system comprising: a segment splitter for separating at least a portion of the unstructured text into one or more segments, each segment comprising one or more words; a segment parser coupled to the segment splitter for assigning one or more lexical categories to one or more of the one or more words of each segment; an information extractor coupled to the segment parser for identifying a feature word and an opinion word contained in the one or more segments; and a sentiment rating engine coupled to the information extractor for calculating an opinion score based upon an opinion grouping, the opinion grouping including at least the feature word and the opinion word identified by the information extractor.

8001407

11590320

1. A method of managing power and performance in a server comprising: operating a server comprising a plurality of processor and associated storage and input/output interface components, arranged into a plurality of independent compute cells; selecting one or more performance metrics descriptive of performance of the plurality of independent compute cells; performing an optimization evaluation of the one or more performance metrics to determine optimal values; ranking applications executing on the plurality of independent compute cells in a selected order of priority; and tuning the plurality of independent compute cells based on the optimal values associated with the optimization evaluation, wherein said tuning comprises: based on one or more of the optimal values, stopping and/or reducing performance of components in the plurality of independent compute cells that execute applications ranked with low priority.

20050047376

10948463

1. A method of determining an acquisition indicator bit AI s at a receiver in a communication system, the method comprising: receiving multiplexed acquisition bits y=B×AI+n, where B is the signature matrix known at both base station and UE, AI is all the acquisition indicator bits and n represents noise; calculating an estimated value of the AI bit of interest AÎ MMSE (s) as a function of ∑ j ⁢ B T ⁡ ( s , j ) × y ⁡ ( j ) , where B T (s,.) is the s-th row vector of the transposed matrix B T for acquisition indicator bit AI s ; and setting the acquisition indicator bit AI s as follows: AI s =−1, if AÎ MMSE (s)<R AI s =0, if R≦AÎ MMSE (s)<U AI s =1, if AÎ MMSE (s)≧U where R and U are decision thresholds.

20170134157

14934048

1. At least one device comprising: one or more processors; and memory storing modules that, when executed by the one or more processors, cause the at least one device to perform operations comprising: receiving a data set including a real number, the real number including an integer portion and a fractional portion; and encoding the integer portion and the fractional portion in a polynomial, the fractional portion of the real number represented as at least one top coefficient of the polynomial, wherein the at least one top coefficient is determined by a length of the polynomial determined for at least one homomorphic operation, and wherein the real number is encoded in the polynomial as a single polynomial without converting the real number to an integer.

20160334546

14845859

1. A weather recognition method based on image information detection, characterized in that it includes: obtaining an image to be detected; extracting multiple first image features of the image to be detected with respect to each preset type of weather according to a number of first preset algorithms preset correspondingly for different preset types of weather; inputting the extracted multiple first image features to a preset multi-kernel classifier, the multi-kernel classifier performing classification according to the inputted image features to identify the weather in which the image to be detected was taken; wherein the multi-kernel classifier is a classifier for the preset types of weather realized by: selecting a first preset number of image samples for the different preset types of weather in which the image was taken respectively; and for the image samples of each preset type of weather respectively, extracting the first image features of each image sample according to the first preset algorithm which corresponds to this preset type of weather; and performing machine learning for the extracted first image features according to a preset multi-kernel learning algorithm.

20130185274

13721355

1. A method of identifying terms suitable for search engine optimization (SEO) for a site, the method comprising: determining a volume of search queries for each term in a set of terms, wherein the set of terms comprises at least a plurality of terms used in search engine queries to access the site; counting referrals to the site for each term in the set of terms; computing rates of referrals for each term in the set of terms based at least partly on the counted referrals and the volume of search queries; and identifying one or more terms in the set of terms that are underrepresented relative to one or more other terms in the set of terms, wherein the one or more underrepresented terms are identified as being suitable for SEO; wherein the determining, the counting, and the computing are performed, at least in part, by one or more computing devices.

8219896

12140956

1. A decoder configured to operate upon an input encoded sequence using a wrap around Viterbi procedure, the decoder being configured to output a selected path as a decode sequence, and wherein the decoder is configured not to store, for a current iteration of the wrap-around Viterbi procedure other than a first iteration, a best path found before the current, iteration other than a best tail-biting path up to the current iteration.

20100297769

12531287

1. An isolated mini-chromosome comprising a centromere, wherein the centromere comprises (a) at least two first repeated nucleotide sequences that hybridize under conditions comprising hybridization at 65° C. and washing three times for 15 minutes with 0.25×SSC, 0.1% SDS at 65° C. to any one of: the nucleotide sequence of SEQ ID NO: 70, the nucleotide sequence of SEQ ID NO: 71, the nucleotide sequence of SEQ ID NO: 91 or the nucleotide sequence of SEQ ID NO: 92, and (b) at least a second nucleotide sequence comprising a nucleotide sequence that hydridizes under conditions comprising hybridization at 65° C. and washing three times for 15 minutes with 0.25×SSC, 0.1% SDS at 65° C. to any one of: the nucleotide sequence of SEQ ID NO: 77 or the nucleotide sequence of SEQ ID NO: 78.

20160171385

14567901

1. A method comprising: extracting features from an application linked to an online system, the application used by users of the online system and posting content to the online system; applying a trained model to the extracted features to generate a quality score for the application, wherein the trained model is trained using features extracted from a set of training applications and quality scores manually assigned to the training applications, the manually assigned quality scores indicating whether each training application satisfies a set of criteria and the generated quality score representing a probability of the application satisfying the set of criteria; ranking for presentation to a user of the online system, content provided by the application in relation to other content of the online system based on the generated quality score; and presenting the content provided by the application to the user of the online system according to the ranking.

8073659

11939146

1. A computer implemented method of developing multiple models adapted for various stages of a non-linear process control comprising: (a) computer clustering dynamic data of a data set so as to permit multiple local data regions to be identified as a function of substantial similarity between the data within the local data regions, wherein the data in the data set represents dynamic behavior of the non-linear process; (b) computer developing a discrete model corresponding to each of the local data regions; (c) computer reducing the number of the discrete models based on a prediction error between actual outputs and predicted outputs provided by the discrete models in response to corresponding inputs and based on a stability similarity between pairs of discrete models thereby producing a reduced model set; and, (d) computer selecting at least some of the models in the reduced model set for deployment.

20050278329

10861132

1. A system for merging product characterization information with a characterized product comprising: a product characterization database in communication with a product characterizing device to receive said product characterization information for said characterized product; a merging rule database describing a merging criteria for merging the product characterization information with said characterized product; a merging processor in communication with the product characterization database to receive the product characterization information and the merging rule database to receive said merging criteria to generate merged characterization information by executing the steps of: extracting a trigger merging rule from said merging rule database, determining if said trigger merging rule has been met to initiate a merging of said product characterization information with said product, if said trigger merging rule has been met, extracting a merging criteria sort type map and a merging criteria sort number map, whereby said merging criteria sort type map determines which of the products has certain characteristics and said merging criteria sort number map determines which of the products are classified according to grades of said merging criteria; and creating a merged product characterization information defined by the grades of said merging criteria.

8938432

11461512

1. A method of determining an insurance agency location, the method comprising: (a) receiving a geographical region to be evaluated for placement of the insurance agency location; (b) determining at a data solutions transaction manager zip codes associated with the received geographical region; (c) gathering data associated with the determined zip codes; (d) selecting a template having various predetermined modeling factors to be utilized in the determination of the insurance agency location, the modeling factors representing data on a per zip code level, wherein the predetermined modeling factors includes a number of new homeowners and new movers, a current year estimate of households with two or more vehicles, a five year projection of the households with the two or more vehicles, a net change in the households that own the vehicles within five years, a current year estimate of a number of owner-occupied dwellings, a five year projection of the number of owner-occupied dwellings, a net change in the owner-occupied dwellings in five years, a current year estimate of a total number of households, a five year projection of the total number of households, a net change in the total number of households in five years, an average household net worth, an average household income, number of people at least twenty-five years old, number of people at least twenty-five years old with some college education, number of people at least twenty-five years old with an associate's degree, number of people at least twenty-five years old with a bachelor's degree, number of people at least twenty-five years old with a professional degree, percent of population at least twenty-five years old with any college education, a number of households with length of residence less than one year, percent of households with the length of residence less than one year, number of active property insurance policies, number of active life or financial insurance policies, number of active insurance policies, total number of customer households, total insurance customer household lifetime value, average customer household lifetime value, value of expansion opportunity, and number of new businesses; (e) calculating at the data solutions transaction manager a final score representative of a desirability for placement of the insurance agency location for each of the zip codes determined in step (b); and (f) comparing at the data solutions transaction manager the final scores for each of the zip codes.

20090006360

11770027

1. A method in a computer system for providing improved search results in response to a user query, the method comprising: obtaining a set of ranked query item pairs, each query item pair corresponding to a query and a hit document, each query item further corresponding to a set of feature vectors including a set of features and corresponding feature weights; executing a series of query relaxation operations, each query relaxation operation extracting one of the set of feature vectors for an item pair and calculating a relevancy score using the extracted feature vector and a learned ranking function that is unique for that query relaxation operation; and generating a hit list for the user query to be displayed to the user that contains hits from the executed query relaxation operations.

8583783

12543449

1. A method for automated garbage collection in a heap of an application server, comprising: gathering a plurality of garbage collection log files associated with a plurality of garbage collection events over periods of time; analyzing data from the plurality of garbage collection log files; determining a trend in the garbage collection activities over the periods of time based on the analyzing; obtaining data on a volume of application transactions in the application server that have occurred over the same periods of time from another source; projecting either an increase or decrease in the volume of application transactions in the application server based on the data obtained on the volume of application transactions; identifying a correlation between garbage collection activity and the data obtained on the volume of application transactions in the application server based on the trend; forecasting at least one of a future utilization of heap memory and a future garbage collection activity based on the correlation and the projected increase or decrease in the volume of application transactions; and tuning the heap based on the forecast, wherein tuning the heap comprises setting an average length of time between garbage collection events to a multiple of an average length of time of an application transaction, and wherein the average length of time between garbage collection events is set to at least twice the average length of time of an application transaction.

7526620

11227813

1. A method for sanitizing storage in a data storage system, the method comprising: maintaining a queue of pointers pointing to a plurality of data storage units in a physical storage facility, wherein each of the plurality of data storage units contains data deemed discarded in an active file system; and automatically sanitizing the plurality of data storage units according to a specified scheduling criterion, wherein said sanitizing is performed by overwriting the data on the plurality of data storage units and causing the data to be unrecoverable from the physical storage facility, and wherein the active file system remains accessible for non-sanitization operations during said sanitizing.

8478053

12834457

1. An image sorting apparatus comprising: an image inputting unit that inputs an image; a distribution function preparing unit that prepares a distribution function of pixel values of the image; a describing unit that performs series expansion on the distribution function by using base functions that form a complete set and are orthogonal to each other due to different weights in a distribution area and describing the distribution function by expansion coefficients, an evaluating unit that evaluates features of the shape of the distribution function based on the expansion coefficients, and a sorting unit that sorts the image to images of at least two categories based on results of the evaluation, wherein the describing unit uses base functions that are orthogonal to each other due to different weights between a center portion and two end portions of the distribution area spreading in a positive region.

20110252010

12746889

1. A method of selecting a word sequence for a text written in a language without word boundary marker, the method comprising: segmenting the text into a plurality of word sequences, each word sequence having at least one word segmentation unit that is different from the word segmentation units in other word sequences; determining a word boundary to be a common word boundary when a respective position of the word boundary after a word segmentation unit in a first word sequence of the plurality of word sequences is the same as a respective position of the word boundary after a word segmentation unit in a second word sequence of the plurality of word sequences; and selecting an optimal word sequence from one of a portion of the first word sequence that is before the common word boundary and a portion of the second word sequence that is before the common word boundary, at least one word segmentation unit in the portion of the first word sequence that is before the common word boundary being different from at least one word segmentation unit in the portion of the second word sequence that is before the common word boundary.

8111626

12347444

1. A method for providing event correlation in a network, comprising: extracting a plurality of events of interest from a database; creating an event time series from the plurality of events of interest, wherein the event time series comprises a set of events of a same type and of a same location that occur within a given time period; forming a composite event from the event time series; performing a pair-wise correlation for the event time-series or the composite event; identifying a pair-wise correlation that is statistically significant; and performing a common time-series conversion on the event time series, wherein the performing the common time-series conversion results in a binary time-series, wherein the binary time-series has a first value to represent a time-window over which an event occurred and a second value to represent a time-window over which the event did not occur.

7831455

11716365

1. A method for posting ideas from clients of tenants to a website, the method comprising: sending a web page from a host system to a client machine, the web page including at least one of an option for posting an idea, an option for viewing an idea already posted, an option for casting a vote for an idea posted; receiving from a client machine, at least one of a new idea for posting, a comment on a previously posted idea and a vote for a previously posted idea; and determining, by the host system, a Total Qualitative Management Criterion (TQMC) for each posted idea for each tenant of the web site, by applying an increasing function of time to newer votes to enable relative weightings of older votes to diminish over time without requiring computing a decaying time function to determine weightings for each vote.

8798345

13496391

1. A diagnosis processing device for diagnosing a target for abnormality by use of a neural network, the diagnosis processing device comprising: a learning pattern creating section for creating a learning pattern by (i) digitalizing a learning image into digital data, the learning image being an image in which abnormality information indicating a substantive feature of abnormality of the target is pre-known, and (ii) without extracting data of a possible abnormal site from the target, sampling data from the digital data of the learning image by use of a predetermined sampling method, the learning pattern indicating a data sequence of a sample data row of the data thus sampled; a learning processing section for causing the neural network to learn, by use of two or more learning patterns created as above by the learning pattern creating section; a diagnostic pattern creating section for creating a diagnostic pattern by (iii) digitalizing a diagnostic image into digital data, the diagnostic image being an image in which abnormality information is unknown, and (iv) without extracting data of a possible abnormal site from the target, sampling data from the digital data of the diagnostic image by use of the predetermined sampling method, the diagnostic pattern indicating a data sequence of a sample data row of the data thus sampled; and a determining section for determining a substantive feature of the abnormality of the target indicated in the abnormality information in the diagnostic image, based on an output value outputted, in response to an input of the diagnostic pattern, from a learned neural network which is the neural network subjected to learning.

20030216905

10151979

1. A method of training an information extraction system to extract information from a natural language input, comprising: generating parses with a structured language model using annotated training data that has semantic constituent labels with semantic constituent boundaries identified; while generating parses, constraining parses to match the semantic constituent boundaries; and while generating parses, constraining the parses to match the semantic constituent labels.

20060287840

11462928

1. A method for combining process measurement data comprising: providing two or more process metrics from independent process sensors to form a set of process metrics; analyzing the process metrics within the set of process metrics to determine a consistency relationship between the process metrics; identifying outliers within the set of process metrics; generating a set of consistent process metrics from the set of process metrics; combining the process metrics within the set of consistent process metrics to generate a combined best estimate for the set of process metrics; generating an uncertainty value associated with the combined best estimate; outputting the combined best estimate for the set of process metrics with the uncertainty value if the process metrics are consistent with each other.

20120151405

13354786

1. A method of assessing uncertainty of features in images rendered in a medical visualization system, comprising: accepting user input to apply at least one sensitivity lens to a region of interest of a portion of a visualization of a rendered image; and electronically displaying different visualizations of the portion of the image associated with the region of interest defined by the sensitivity lens to assess uncertainty in the visualization of the rendered image.

20060277165

11302226

1. A question answering system comprising: a question answering unit that executes search processing on a basis of an input question and acquires answer candidates to the question; an analysis unit that executes syntactic analysis processing or syntactic and semantic analysis processing on a passage obtained as a result of the search processing executed by the question answering unit; a tree structure generation unit that generates a tree structure on a basis of an analysis result of the analysis unit; a feature extraction unit that extracts a relation between a search word applied in the search processing executed by the question answering unit and each acquired answer candidate as a feature corresponding to each answer candidate from the tree structure generated by the tree structure generation unit; an evaluation unit that determines an evaluation value of each answer candidate on a basis of the feature extracted by the feature extraction unit; and a re-ranking unit that re-ranks the answer candidates on a basis of the evaluation values determined by the evaluation unit.

8180694

12262538

1. A method for incorporating qualitative factors into an econometric model, the method comprising: receiving time series data, the time series data including data describing a financial performance generated by corresponding marketing investments made as a function of time; configuring, by a computer processor, the econometric model from the time series data, the econometric model including linear coefficients that define a quantitative linear relationship between the financial performance and the corresponding marketing investments; and adjusting the linear coefficients in accordance with the qualitative factors, thereby quantifying the qualitative factors to incorporate into the econometric model.

8019666

11860084

1. A method of generating a directed graph representing an auction problem having I items and S counterparties, each item being subdivided into Q units, with a plurality of bids, each bid being a bid Bis (qs) representing the cost of qs units of item i with counterparty s where i may be any element of {1, 2,. .. l}, and s may be any element of {1, 2,. .. S}; the method comprising: generating a source vertex and a sink vertex; generating a plurality of intermediate vertices (i, s, q) for each item i where i =1, 2,. .. l, for each counterparty s where s =1, 2,. .. S, and for each possible quantity q where q =0,1,. .. Q, wherein when s =S q=Q; generating, by executing a module stored on a non-transitory computer readable medium, edges representing each bid, each edge being an ordered edge from the source vertex or one of the intermediate vertices towards the vertex (i, s, q) of length Bis (qs) representing the cost of a quantity qs of item i by counterparty s where q is the total quantity of units of item i supplied by counterparties from counterparty 1 up to and including counterparty s so that there are a plurality of paths along the ordered edges from the source vertex to the sink vertex via intermediate vertices; and storing the directed graph as a model of the auction problem for solving the auction problem.

20160196198

14590049

1. A process for controlling a performance state machine, comprising: automatically identifying notifications from an execution trace of an application, the execution trace including a plurality of trace events within a period which has endpoints, the notifications identified through comparison of trace events to notification events for at least three notification categories; automatically placing a state in a performance state machine for each identified notification; automatically aggregating application performance data for each transition between identified notifications, the performance data collectively including data in at least two performance data categories; automatically inserting performance data aggregations in the performance state machine; displaying a visual representation of the state machine states, transitions, and performance data aggregations on a display screen; capturing altered performance of the application in an updated execution trace after the placing and inserting steps; and altering at least one state, transition, or performance data aggregation of the state machine after the capturing step.

20090138416

12361092

1. A computer-readable medium having computer-executable instructions for analysis of a wireless network, wherein said instructions comprising: instructing a data partitioner to receive a first set of plurality types of data, wherein the data partitioner partitions the first set of data and groups the partitioned data into a plurality of data files, and the data partitioner generates indices according to the first set of data; and instructing a data modeler to receive a second set of plurality types of data, wherein the data modeler generates a plurality of models according to the first set of data and the second set of data.

20100217596

12391395

1. A method for processing media comprising: accepting a query; identifying one or more language patterns that are similar to the query; locating a putative instance of the query in the media, the putative instance being associated with a corresponding location in the media; comparing the media in a vicinity of the putative instance to the identified language patterns; and providing data characterizing the putative instance of the query according to the comparing of the media to the language patterns.

8630847

11870068

1. A computer-implemented method, comprising: identifying a word corpus; determining a weight based on a type of the word corpus, the weight indicating a degree of reliability for updating an existing input method editor dictionary using the word corpus; associating a word probability value with each word in the word corpus; identifying a sentence; determining candidate segmentations of the sentence based on the word corpus; determining a segmentation probability value for each of the candidate segmentations, each candidate segmentation having one or more segments that define words forming the sentence; determining a weighted segmentation probability value for each segmentation probability value based on the weight; determining, in a data processing apparatus, a soft-count value for each word in the word corpus based on the weighted segmentation probability values of the candidate segmentations in which the word appears and a number of occurrences of the word in the candidate segmentations in which the word appears; iteratively adjusting the associated word probability value for each word in the word corpus based on the soft-count value for the word; and updating the existing input method editor dictionary by iteratively adding a plurality of words from the word corpus and their respective associated word probability values to the existing input method editor dictionary, wherein the plurality of words from the word corpus are words having the highest associated word probability values.

8488772

13115657

1. A method of assigning contact center agents to groups, the method performed by a processor in a computing system of a contact center, comprising the steps of: (a) maintaining, for a set of contact center agents associated with a contact center, performance data relating to the activities of the contact center agents; (b) specifying one or more performance metrics against which the performance data of the contact center agents may be evaluated by specifying a number, n, of performance metrics P in numerical form as a set of values (p 1 , p 2 ,. .. p n ), and further comprising expressing, for each of the plurality of agents, a corresponding set of performance data Q in numerical form as a set of values (q 1 , q 2 ,. .. q n ); (c) determining an evaluation score for each of a plurality of the contact center agents against the performance metric(s) based on the performance data by evaluating for each agent the expression: S = ∑ i = 1 n ⁢ ⁢ c i ⁡ ( q i - p i ) 2 wherein c i represents a weighting constant; and (d) assigning the plurality of contact center agents among a plurality of agent groups according to each agent's respective evaluation score.

20170153927

15242703

1. A computer-implemented method comprising: dynamically grouping and un-grouping, by a computing device, processing operators and processing elements used by a streaming application; monitoring distributed processing elements utilization of resources to identify candidate operators and candidate processing elements for at least one of parallelization and fusion; and dynamically adjusting, at runtime, via at least one of parallelization and fusion, the grouping and un-grouping of the identified candidate operators and candidate processing elements, wherein dynamically adjusting, at runtime, the grouping and un-grouping of the identified candidate operators and candidate processing elements includes compiling the identified candidate operator to a library and implementing a loading mechanism to move the identified candidate operator.

20160021671

14867801

1. A method of selecting an antenna array state for a multi-element reconfigurable transmitter and/or receiver antenna, comprising the steps of: a processor executing a learning algorithm that optimizes a wireless link between at least one reconfigurable transmitter antenna and at least one reconfigurable receiver antenna over time over different antenna array states of said at least one reconfigurable transmitter antenna and said at least one reconfigurable receiver antenna; and the processor setting the antenna array configuration for the transmitter and/or a receiver antenna based at least in part on the antenna array states determined by said learning algorithm to lead to an optimized wireless link between said at least one reconfigurable transmitter antenna and said at least one reconfigurable receiver antenna over time, wherein executing the learning algorithm includes formulating selection of an antenna array state using an online learning framework for learning at least one unknown wireless channel condition of said wireless link and selecting the antenna array state that maximizes the at least one wireless channel condition between said at least one reconfigurable transmitter antenna and said at least one reconfigurable receiver antenna over time.

8055482

12367311

1. A computer implemented method for integrating multiple engineering design systems in a computer aided design (CAD) system, comprising: (a) displaying, on a display device of the CAD system, a design generator configured, via an application programming interface (API), to accept input from a designer that results in the creation of an engineering design wherein the engineering design comprises two or more different worksheets, wherein each worksheet: (i) represents a different aspect of the engineering design; (ii) comprises one or more local design objects, wherein each local design object: (1) represents a functional aspect of a component; and (2) is independent from a physical representation of the component; (iii) comprises one or more relation objects, wherein each relation object models constraints of one or more properties of the one or more design objects; (b) organizing the one or more local design objects and one or more relation objects in an Functional Layout Document (FLD); (c) storing the FLD in a data center comprising a shared database within the CAD system, wherein the shared database is shared by the two or more worksheets; (d) using the FLD, via user input and the display device, to design the engineering design; and (e) creating one or more master design objects each comprised of an amalgamation of one or more of the local design objects from the two or more different worksheets, wherein: (i) each local design object in the master design object refers to a different particular aspect of the master design object; and (ii) each master design object manages all of its constituent local design objects.

20120166373

13345644

1. A method of modifying a computer-readable elemental data structure of a knowledge representation system, the method comprising: applying, using at least one processor executing stored program instructions, one or more first rules of analysis to deconstruct a knowledge representation into one or more elemental components; adding, using at least one processor executing stored program instructions, data associated with the one or more elemental components to the elemental data structure; inferring candidate data associated with the elemental data structure, the inferring comprising detecting in reference data, using at least one processor executing stored program instructions, language corresponding to a predetermined linguistic pattern; modifying the elemental data structure to combine the candidate data and data associated with the one or more elemental components, wherein the one or more elemental components are encoded as one or more computer-readable data structures storing data associated with the one or more elemental components, and the reference communication is encoded as one or more computer-readable data structures storing data associated with the reference communication.

20140325666

13965870

1. A computer program product to guarantee anonymity under r-dereferenceability in a Linked Data graph, the computer program product comprising: a storage medium, wherein said storage medium is not a propagating signal, said storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising: transforming an original Linked Data graph structure having labelled nodes interconnected by directed edges into a corresponding anonymous Linked Data graph, with one or more nodes embodying a searchable Uniform Research Indicator (URI); iteratively expanding said corresponding anonymous Linked Data graph up to r times, where r is an integer, wherein in each expansion additional information nodes embodied by additional URIs and property values are added to the anonymized Linked Data graph nodes; and determining from each said additional URIs and property values in said expanded corresponding anonymous Linked Data graph whether anonymity is breached, and in that case making the URI determined as breaching said anonymity non-dereferenceable.

20060112098

11045926

1. A system for generating clusters of similar media objects, comprising using a computing device for: identifying a set of locally available media objects; querying a remote server computer to retrieve a set of coordinate vectors corresponding to each of the locally available music objects; determining distances between the retrieved coordinate vectors; and forming at least one cluster of at least one coordinate vector relative to a first adjustable minimum distance threshold such that any group of one or more of the coordinate vectors whose mutual distances are less than the first adjustable minimum distance threshold are assigned to a common cluster.

20120239164

13051793

1. An enterprise-integrated parametric hybrid model system controller/optimizer, comprising a non-transitory computer-readable medium having computer instructions encoded thereon, wherein the computer instructions comprise instructions for: transmitting a graphical user interface to a remote electronic device, wherein the graphical user interface enables the display of and interaction with a plurality of parametric hybrid models represented as nodes of a network, and a plurality of inputs and outputs of the parametric hybrid models connecting the nodes of the network, and wherein the parametric hybrid models relate to physical components of a plant of the enterprise and to interconnections between the physical components; receiving a command input relating to a node or connection of the network displayed by the graphical user interface; and processing the command input according to an access level of a user operating the electronic device.

9311620

13278653

1. A non-transitory tangible storage medium executed on a computer system that ranks at least one of the quality and importance of content on a social network, the non-transitory tangible storage medium executed on the computer system comprising: instructions for monitoring actions and information of social network users, wherein the social network comprises twitter; instructions for modeling and fitting the actions and information of the social network users to a predefined definition of a weighted game between at least two social network users, wherein the actions comprise one social network user following another social network user; instructions for determining the results of the weighted game between the at least two social network users based on the one social network user following the another social network user; instructions for applying a sports ranking algorithm to the results between the at least two social network users based on the one social network user following the another social network user; and instructions for determining a rank of at least one of the quality and importance of content of the social network users based on an outcome of the sports ranking algorithm based on the one social network user following the another social network user.

20070036250

11463877

1. A multiuser detector system with correlation based pruning, comprising: a parameter estimation module adapted to receive complex signals, and to produce estimated signature waveforms for each of K co-channel interfering signals; an S-matrix module forming an S-Matrix from said estimated signature waveforms; and a multiuser detector module processing said S-Matrix of said estimated signature waveforms with an unnormalized cross correlation matrix, and producing a more valid set of hypotheses for pruning with an M-algorithm.

8208765

11972446

1. A document image processing apparatus comprising: a character image feature dictionary for storing image features of character images in units of character; a character string clipping portion for clipping character images in units of character string composed of a plurality of characters from an inputted document image; an image feature extracting portion for extracting an image feature of each character image which is obtained by dividing character images of character string clipped by the character string clipping portion, for each of the characters; a feature similarity measurement portion for selecting N (N>1, integer) pieces of character images in descending order of degree of similarity of image feature as candidate characters, from the character image feature dictionary which stores image features of character image in units of character based on the image features of each of the character images extracted by the image feature extracting portion, preparing a first index matrix of M×N cells where M (M>1, integer) represents a number of characters in the clipped character string, and preparing a second index matrix of character strings including a meaningful character string which is formed by adjusting candidate character strings by application of a lexical analysis using a predetermined language model to the candidate character strings composed of a plurality of candidate characters constituting a first column of the first index matrix; an index information storing portion for storing the second index matrix prepared by the feature similarity measurement portion, so as to correspond to the inputted document image; and a searching section for searching, in a searching operation, the index information storing portion in units of search character constituting a search keyword of an inputted search formula, to take out the document image which includes the second index matrix containing the search character, wherein a position-based correlation value is set for each of the elements in the second index matrix, and the searching section comprises: an index matrix search processing portion for searching the index information storing portion for the second index matrix in units of search character constituting the search keyword to detect the second index matrix containing the search characters, and storing in a storing portion, information of matching position of search characters in the second index matrix together with information of the document images having the second index matrix; a degree-of-correlation calculating portion for calculating a degree of correlation between the search keyword and the second index matrix by accumulating correlation values of the respective search characters according to the information of matching position stored in the storing portion; and an order determining portion for determining a take-out order of document image based on the calculated result of the degree-of-correlation calculating portion.

20130002816

13339722

1. A method for encoding picture data, the method comprising: encoding at least one texture element of said picture data to obtain at least one encoded texture element, forming at least one texture encoding parameter in said encoding, encoding at least one depth element related to said at least one texture element to obtain at least one encoded depth element, applying filtering to depth data in said encoding of at least one depth element, and controlling said filtering using said at least one texture encoding parameter.

8542866

11664795

1. A method for camouflaging a visual presentation of measuring values of a test object comprising the steps: recording measuring values of the test object, forming camouflage data from the recorded measuring values with the help of a mathematical algorithm for changing the measuring values, and visually displaying the camouflage data, wherein the visually displayed camouflage data enable a quality assessment of the test object based on the visually displayed camouflage data.

7689620

11636857

1. A computer method for searching stock documents containing non-word-based data, comprising the computer executed steps of: (a) collecting a group of stock documents to form a collection of stock documents; (b) dividing each document in said group of collected documents into a series of elements of same type, each element of said series of elements is a time scale in stock document data; (c) defining a plurality of non-word-based token patterns; (d) tokenizing said documents by matching said series of elements against said plurality of defined non-word-based token patterns to generate a collection of tokens for each of said documents, and providing a name for each of said tokens; (e) combining the collections of tokens for said documents into a master collection of tokens; (f) searching for stock documents in said collection of documents that have the same token names as a query or a combination of queries, by searching said query or queries in said master collection of tokens, to provide a plurality of matching documents with respective scores; and (g) displaying matching documents in the order of their matching scores.

8509426

12958273

1. A computerized method of performing XZ-elliptic curve cryptography, comprising the steps of: (a) a sending correspondent and a receiving correspondent selecting and agreeing upon an elliptic curve set EC 3 ; (b) the sending correspondent and the receiving correspondent further agreeing upon a random scalar k and a random shared secret key for communication E s , and agreeing upon a base point (X B ,Y B ,Z B )εEC 3 ; the sending correspondent then performs the following steps: (c) embedding a first secret message bit string into an elliptic curve message point (X m ,Y m ,Z m ); (d) computing a scalar multiplication between the base point (X B ,Y B ,Z B ) and the scalar k as (X Bk ,Y Bk ,Z Bk )=k(X B ,Y B ,Z B ); (e) computing a cipher point (X c ,Y c ,Z c ) as (X c ,Y c ,Z c )=(X m ,Y m ,Z m )+k(X B ,Y B ,Z B ); (f) embedding a second secret message bit string into a data transformation index E m ; (g) transforming the cipher point coordinates X c and Z c as {circumflex over (X)} C =X C E s and {circumflex over (Z)} C =Z C E m , respectively; (h) calculating a cipher transformation index E c as E c = E s E m ; (i) sending a set of appropriate bits of {circumflex over (X)} c , {circumflex over (Z)} c , and Ê c to the receiving correspondent; the receiving correspondent then performs the following steps: (j) calculating the data transformation index E m as E m = E s E c ; (k) calculating the cipher point coordinates X c and Z c as X C ={circumflex over (X)} C E s −1 and Z C ={circumflex over (Z)} C E m −1 , respectively; (l) computing a scalar multiplication between the base point (X B ,Y B ,Z B ) and the scalar k as (X Bk ,Y Bk ,Z Bk )=k(X B ,Y B ,Z B ); (m) computing the elliptic curve message point (X m ,Y m ,Z m ) as (X m ,Y m ,Z m )=(X c ,Y c ,Z c )−k(X B ,Y B ,Z B ); and (n) retrieving the first secret message bit string from the elliptic curve message point (X m ,Y m ,Z m ).

20100199257

12363738

1. A method of automatically translating an implementation independent specification of a computation and a separate specification of a high capability execution platform into an executable implementation for said high capability execution platform such that said executable implementation exploits those computational capabilities of said high capability execution platform that cause improvement of said program execution in an objectively measurable way or ways, wherein said implementation independent specification of a computation is a specification that is substantially the same for all execution platforms, wherein said high capability execution platform is an execution platform that generally allows for improvement in program execution in some objectively measurable way or ways over a basic, sequential computer with a Von Neumann architecture, wherein said improvements include but are not limited to parallelism, accelerated memory access, cache behavior improvements, overall performance, total computation time, memory size, reliability, and security, wherein said method of claim 1 includes but is not limited to the architecture of FIG. 1 a and the methods, behaviors, and machinery defined and illustrated in FIGS. 1 b , 1 c , 4 - 60 , and tables 2-4, comprising: providing a first means of specifying domain specific operators and operands, including but not limited to the class definition, the class method-transform definition, the operator definition, the pattern-directed transformation definition, the dynamic deferred transformation definition, the type inference rules for operators definition and the type inference rules for method definitions, all from table 2 and FIGS. 53-57 ; providing a second means for specifying said implementation independent specification of said computation, including but not limited to an expression of application domain specific operators, operands, variables, and constant data that define said computation; providing a third means for specifying said high capability execution platform, including but not limited to an expression of execution platform specific operators, operands, variables, and constant data that describe architectural features of said execution platform; providing a fourth means for specifying a transformation that rewrites an expression, called a transformation step for short, wherein the transformation specification method includes but is not limited to the pattern-directed transformation definition, the operator definition, the class method-transform definition, the dynamic deferred transformation definition, the type inference rules for operators definition, and the type inference rules for methods definition, all from table 2 and FIGS. 53-56 ; providing a fifth means, including but not limited to the transformation engine in FIG. 1 a, for executing one of said transformation steps expressed using said transformation specification method; providing a sixth means, including but not limited to the generator execution unit in FIG. 1 a, for executing a series of transformational steps; and providing a seventh means, including but not limited to said generator execution unit for said transformation steps, for executing a series of said transformation steps on said implementation independent specification of said computation to produce said executable implementation that is required to exploit the high capability computational facilities of the target execution platform, where said series of transformation steps may be changed and customized based on the information in said specification of the high capability execution platform, wherein said transformation steps include but are not limited to FIGS. 5-49 b; wherein the improvement comprises the ability of said implementation independent form of a computation to not require reprogramming even though the target high capability execution platform on which it is to be executed may be replaced by a new execution platform with variations that would require reprogramming if it were to be programmed using a conventional programming language or even a special purpose programming language, where said variations include differing architectures, differing high capability features, and differing methods of programming to exploit the high capability features; the ability to avoid reprogramming said implementation independent specification of said computation for a reason or reasons other than the user has decided to perform a different computation; the ability to exploit any existing execution platform without reprogramming said implementation independent specification of said computation; the ability to exploit new or unanticipated execution platform abilities without reprogramming said implementation independent specification of said computation; the ability to port a computation from one execution platform to a different and possibly high capability execution platform with a substantially different architecture and operating method by automatically generating a new executable implementation that is specific to the different high execution platform and that thereby exploits said high capability facilities of said high capability execution platform; the ability to automatically produce the executable implementation form from said implementation free specification of said computation and said separate execution platform specification; and the ability to automatically exploit said high capability features of said high capability execution platform without programming actions on the part of the user.

9509722

14623311

1. A computer-implemented method for producing at least one Security Descriptor Definition Language (SDDL) rule from an attribute-based access control (ABAC) policy (P), said method comprising: providing, on a non-transitory computer readable media, a ABAC policy (P) that, when implemented by a processor, is configured to control access to one or more resources in a computer network; feeding the ABAC policy (P) to a transformation engine, the transformation engine including software that, when executed by a processor, creates the at least one SDDL rule; producing a reverse query indicating a given decision (d), which is one of permit access and deny access, and a set (R) of admissible access requests; translating, by the transformation engine based on the reverse query, the ABAC policy (P) and the given decision (d) into a satisfiable logic proposition in Boolean variables (v i , i=1, 2,. .. ); deriving, by the transformation engine, variable assignments (RC j =[ARC j1 : v 1 =x j1 , ARC j2 : v 2 =x j2 ,. .. ], j=1, 2,. .. ) satisfying the logic proposition; creating, by the transformation engine, the at least one SDDL rule based on said variable assignments (RC j =[ARC j1 : v 1 =x j1 , ARC j2 : v 2 =x j2 ,. .. ], j=1, 2,. .. ) satisfying the logic proposition, wherein the at least one SDDL rule, when implemented by a processor, is configured to control access to the one or more resources in a computer network; loading the at least one SDDL rule onto a non-transitory computer readable media of an SDDL system; and controlling access to the one or more resources in the computer network using the at least one SDDL rule.

10097645

15490693

1. A method, comprising: receiving a response to a data test message from a first network device, communicating via a second communications connection, to a second network device; comparing the response to previously measured test data associated with a first communications connection between the first network device and the second network device; determining an average measured connection bandwidth exceeds a current connection bandwidth of the first communications connection by a predefined percentage threshold; and determining a change-over from the first communications connection to the second communications connection would provide a more optimal data connection based on the comparing and the predefined percentage threshold being exceeded.

4762456

06873213

1. In a combination having a commonly known double cantilevered, through-leg, floating gantry crane comprising, a hull and deck contained tower means, disposing a bridge elevationally above said deck for a trolley with hoist means towed between bridge ends to exchange containers as an arrangement of three floating vessels, unencumbered by tidal change, with said crane having a second outer bridge portion extending above a fixed positioned second floating vessel located alongside the crane for a second moored engagement, and having a first outer bridge portion above a moveable first floating vessel along the other of the two sided crane for a first moored engagement; for a development embodying an offshore terminal in a sheltered cove for disposition of said three floating vessels in contention with control of four motion directional differences among said vessels involving said moored engagement, the improvement comprising: (a) a first and second distantly spaced apart primary floating stations, stayed to rise and fall with the tide, establishing limited connection of a motor powered wire towing system for said floating crane disposed along a straight course to selected positions with the second vessel in motion control with said second moored engagement; (b) a first and second distantly spaced apart secondary floating stations, stayed to rise and fall with the tide, establishing limited connection of a motor powered wire towing system for said first floating vessel disposed along a straight course to selected positions with the crane, including an integrating means of the first vessel with its wire system suiting the repeating trade-off of first vessels effecting a first moored engagement; (c) dual spaced apart `A` frames mounted atop the bridge portion contained between said towers, having a simple connecting truss spanning between apices of said `A` frames, providing for the upper connection of a guy system extending for connection to bridge ends; (d) a dual wire system established in tensioned arrangement between said primary floating stations, interacting said wires with sheaves having mounting means to the bottom of said crane hull, with wires being passive during said straight course unimpeded travel and containing said wires with sheaves to oppose impediments to travelling of said crane as a crane antiskew means furthering the first and second moored engagement; (e) a second antilist rope system having a motor drive mechanism atop said second outer bridge portion for a rope arrangement with sheave means for tension engagement to the first floating vessel, and a first antilist rope system having a motor drive mechanism atop said first outer bridge portion for a rope arrangement with sheave means for tension engagement to said second floating vessels, said rope systems accommodating disposition of the trolley over said outboard bridge portions and variation in draft of vessels with container exchanges; (f) a stabilizing means including a second lever having a fulcrum automatically contained to constant clearance above tidal water level, depending on the second lever longer arm connection to a second float providing buoyant reaction to the tension in a pendant connecting said second lever shorter arm to said second outer bridge portion, and a first lever having fulcrum automatically contained to constant clearance above tidal water level, depending on the first lever longer arm connection with a first float providing buoyant reaction to the tension in a pendant connecting said first lever shorter arm to said first outer bridge portion, said floats stabilizing the idle crane in heavy weather; and, (g) a composite equalizer arrangement modulating elastic stretch differences in a four wire hoisting system bearing a container non-distributedly loaded.

8429605

12650413

1. A computer implemented system for developing an application program having functionality that corresponds to a finite state machine (FSM) model, including: a first plurality of non-transitory machine readable instructions adapted to be stored on a first computer comprising an action library including a plurality of dynamic link library (DLL) files operable to execute a plurality of functions comprising one or more standard actions associated with a plurality of potential FSM models; a second plurality of non-transitory machine readable instructions adapted to be stored in a second computer system operable to generate a visual interface that generates a graphical environment on a display associated with said second computer system, the graphic environment including a workspace for creating and displaying an FSM model representing functionality of an application program, the FSM model including a plurality of elements including state elements, said standard actions, and transition elements connecting the state elements, wherein said visual interface further is adapted to output a first data file that is adapted to be output from said second computer and stored in said first computer comprising a third plurality of non-transitory machine readable instructions comprising one or more specifications of a generated said FSM model which includes markup language descriptions comprising one or more identifiers for said plurality of functions associated with said one or more standard actions within said DLL files; a fourth plurality of non-transitory machine readable instructions adapted to be stored in said first computer system comprising a dynamic state machine processor (DSMP) that uses the first data file storing said FSM model elements and said action library to generate the application program executed at run-time, each of the FSM elements is referenced in said first data file including at least one of said markup language descriptions defining functionality of a respective one of said FSM elements, at least some of the markup language descriptions including function calls to said standard actions comprising one or more said identifiers to one or more said standard actions stored in said DLLs within said action library corresponding to basic software functions associated with a control system; and a fifth plurality of non-transitory machine readable instructions comprising an extensible graphic user interface (GUIX) adapted to be stored in said first computer system that provides an interactive control system interface including the end-user interface features to the end-user as generated during run-time by the DSMP based on the action library and the first data file comprising said FSM model elements, wherein said GUIX is operable to generate a plurality of interactive graphical user interface displays based on said first data file, said DSMP, and said action library, where the DSMP performs a lookup of said standard actions stored in said DLL files that are specified in said first data file and generates said plurality of interactive graphical user interfaces based at least in part on data stored in said first data file and retrieved from said action library; wherein the visual interface includes a plurality of editor buttons, activation of which cause the visual interface to display editor windows that permit a technician to build said FSMs within said visual interface by defining or selecting said FSM elements including said state elements, said standard actions associated with said DLL files stored in said action library, and said transition elements as well as define or modify functionality of the FSM elements, the markup language descriptions of the functionality being stored in a database in said second computer comprising at least one said first data file; wherein the visual interface includes a controller, a state machine GUI and a state machine layout system, the state machine GUI and the state machine layout system being configured to generate a graphic representation of the FSM model on the workspace according to a current state of the FSM model provided by the controller.

9176978

12366563

1. A non-transitory computer-readable storage medium storing computer-executable instructions that when executed by a computer cause the computer to perform a method, the method comprising: accessing data to be classified; classifying the data into a deduplication classification based, at least in part, on a classification policy where the classification policy explicitly indicates at least a blocklet size for the data, where classifying the data into a deduplication classification based, at least in part, on the classification policy includes classifying the data based, at least in part, on an access requirement associated with the data; controlling a processor to selectively perform a whole file deduplication methodology on an item upon determining that the deduplication classification associated with the item is a whole file deduplication policy; and controlling the processor to perform a sub-file blocklet level deduplication methodology on the item upon determining that the deduplication classification associated with the item is a sub-file blocklet level deduplication policy, where the sub-file blocklet level deduplication methodology is controlled, at least in part, by the deduplication classification associated with the item, where the item comprises a file or a data stream, and where the different deduplication methodologies deduplicate with respect to average blocklet size, minimum blocklet size, or maximum blocklet size as controlled by the deduplication classification.

9245354

14273636

1. A method for modelling a set of transform coefficients, the method being performed by a device and comprising: determining at least one boundary coefficient value; determining one or more parameters for a first distribution model for transform coefficients of the set the magnitudes of which are greater than one of the boundary coefficient values; determining parameters for at least one further distribution model for transform coefficients of the set the magnitudes of which are less than the one of the boundary coefficient values; and performing a device operation on at least part of a composite distribution model which is a composite of the first distribution model and the at least one further distribution model having the respective determined parameters.

20100199266

12761800

1. A computer readable medium having computer-executable instructions for causing one or more programmable control devices to perform a method for analyzing code execution, the method comprising the steps of: displaying information pertaining to samples of function calls during execution of one or more processes on a computer system as a chronological chart of callstack depth versus sample number; and automatically identifying a function-call pattern indicative of non-optimal performance of at least one of the processes wherein the function-call pattern comprises at least two substantially similar structures.

7933451

11559237

1. In a graphical information system (GIS), a method for processing a digital image depicting one or more physical objects to locate a feature in the digital image, the method comprising the following: by a processor, executing a pixel-level cue algorithm to identify an interesting area of a raster image depicting the one or more physical objects; determining a pixel-level probability that the interesting area of the raster image identified is the feature using a result from the pixel-level cue algorithm; comparing the pixel-level probability to a pixel-level cue threshold; and if the pixel-level probability satisfies the pixel-level cue threshold: converting at least a portion of the raster image to a vector layer by geometric modeling using points, lines, curves, and polygons to generate a representation of digital vector objects represented by the points, lines, curves and polygons; executing an object-level cue algorithm on the vector layer to identify an interesting area of the vector layer; determining an object-level probability that the interesting area of the vector layer is the feature using a result of the pixel-level cue algorithm; and comparing the object-level probability to an object-level threshold.

20120239696

13479207

1. A data searching method performed by a server system, the method comprising: receiving a query to search data stored in an organizing system in which data has been organized from a highest confidence quality tier to a lowest confidence quality tier; and searching data of the highest confidence quality tier of the organizing system to satisfy the query, wherein searching the data of the highest confidence quality tier is performed before searching data of a lower confidence quality tier of the organizing system.

9577821

14680320

1. A function masking apparatus for preventing side channel attacks in symmetric cryptography that utilizes a plurality of internal functions, the apparatus comprising: a controller including a processor that is configured to execute program instructions to randomly generate a plurality of non-linear functions, a plurality of linear functions, and a plurality of constants for the internal functions of the symmetric cryptography, for each of the plurality of internal functions, create a lookup table that includes a plurality of operations, through which at least two functions or constants selected from the plurality of non-linear functions, the plurality of linear functions, and the plurality of constants are used to convert an input to said each internal function to obtain a converted result, mask said each internal function by using the converted result as an output of said each internal function, and encrypt a plaintext using the masked internal functions; and a storage unit storing the created lookup tables for the plurality of internal functions.

8331558

12656897

1. A computerized method of cipher block chaining using elliptic curve cryptography, comprising the steps of: (a) defining a maximum block size that can be embedded into (nx+1) x-coordinates and ny y-coordinates, wherein n is an integer, and setting the maximum block size to be (nx+ny+1)N bits, wherein N is an integer; (b) a sending correspondent and a receiving correspondent agree upon the values of nx and ny, and further agree on a set of coefficients a,bεF, wherein F represents a finite field where the field's elements can be represented in N-bits, the sending and receiving correspondents further agreeing on a random number k, wherein the random number k is a shared secret key for communication, the sending and receiving correspondents further agreeing on a base point on an elliptic curve (x B ,y B )εEC and a base point on the twist of the elliptic curve (x TB ,√{square root over ( α y TB )εTEC; the sending correspondent then performs the following steps: (c) embedding a bit string of the secret key into the x-coordinate of a key elliptic point (x k ,√{square root over (α k )}y k ); (d) computing a scalar multiplication (x TS 0 ,√{square root over ( α y TS 0 )=k(x TB ,√{square root over ( α y TB ) if (x k ,√{square root over (α k )}y k ) is on the elliptic curve, where α k =1, and setting (x S 0 ,y S 0 )=(x k ,y k ), wherein if α k =α o , then computing a scalar multiplication (x S 0 ,y S 0 )=k(x B ,y B ) and setting (x TS 0 ,√{square root over ( α y TS 0 )=(x k ,√{square root over ( α y k ); (e) embedding the message N-bit string of a 0-th block into the x-coordinate of an elliptic message point (x m 0 ,√{square root over (α m 0 )}y m 0 ); (f) computing a set of cipher points as (x c 0 ,y c 0 )=(x m 0 ,y m 0 )+(x S 0 ,y S 0 ) and (x Tc 0 ,√{square root over ( α y Tc 0 )=(x TS 0 ,√{square root over ( α y TS 0 ) if the message point of the 0-th block is on the elliptic curve, where α m 0 =1, wherein if otherwise, the set of cipher points are computed as (x Tc 0 ,√{square root over ( α y Tc 0 )=(x m 0 ,√{square root over ( α y m 0 )+(x TS 0 ,√{square root over ( α y TS 0 ) and (x c 0 ,y c 0 )=(x S 0 ,y S 0 ); (g) sending appropriate bits of the x-coordinate of the cipher point (x c 0 ,y c 0 ) to the receiving correspondent if the message point of the 0-th block is on the elliptic curve, wherein if the message point of the 0-th block is on the twist of the elliptic curve, the appropriate bits of the x-coordinate of the cipher point (x Tc 0 ,√{square root over ( α y Tc 0 ) are sent to the receiving correspondent; (h) establishing integers i and u and iteratively repeating the following steps i) through k) until i>u: (i) embedding the message N-bit string of an i-th block into the x-coordinate of the elliptic message point (x m i ,√{square root over (α m i )}y m i ); (j) computing the set of cipher points as (x c i ,y c i )=(x m i ,y m i )+(x i i ,y S 0 ) and (x Tc i ,√{square root over ( α y Tc i )=(x Tc i-1 ,√{square root over ( α y Tc i-1 ) if the message point of the i-th block is on the elliptic curve, where α m i =1, wherein if otherwise, the set of cipher points are computed as (x Tc i ,√{square root over ( α y Tc i )=(x m i ,√{square root over ( α y m i )+(x Tc i-1 ,√{square root over ( α y Tc i-1 ) and (x c i ,y c i )=(x c i ,y c i ); (k) sending appropriate bits of the x-coordinate of the cipher point (x c i ,y c i ) to the receiving correspondent if the message point of the i-th block is on the elliptic curve, wherein if the message point of the i-th block is on the twist of the elliptic curve, the appropriate bits of the x-coordinate of the cipher point (x Tc i ,√{square root over ( α y Tc i ) are sent to the receiving correspondent; the receiving correspondent then performs the following steps: (l) embedding the bit string of the secret key into the x-coordinate of the key elliptic point (x k ,√{square root over (α k )}y k ); (m) computing a scalar multiplication (x TS 0 ,√{square root over ( α y TS 0 )=k(x TB ,√{square root over ( α y TB ) if (x k ,√{square root over (α k )}y k ) is on the elliptic curve, where α k =1, and setting (x S 0 ,y S 0 )=(x k ,y k ), wherein if α k = α , then computing a scalar multiplication (x S 0 ,y S 0 )=k(x B ,y B ) and setting (x TS 0 ,√{square root over ( α y TS 0 )=(x k ,√{square root over ( α y k ); (n) computing a message point as (x m 0 ,y m 0 )=(x c 0 ,y c 0 )−(x S 0 ,y S 0 ) and setting (x Tc 0 ,√{square root over ( α y Tc 0 )=(x TS 0 ,√{square root over ( α y TS 0 ) if the received cipher point of the 0-th block (x c 0 ,y c 0 ) is on the elliptic curve, wherein if the received cipher point (x Tc 0 ,√{square root over ( α y Tc 0 ) is on the twist of the elliptic curve, the message point (x m 0 ,√{square root over ( α y m 0 ) is computed as (x m 0 ,√{square root over ( α y m 0 )=(x Tc 0 ,√{square root over ( α y Tc 0 )−(x TS 0 ,√{square root over ( α y TS 0 ) and (x c 0 ,y c 0 )=(x S 0 ,y S 0 ); (o) recovering the secret message bit string of 0-th block from the x-coordinate of the point (x m 0 ,y m 0 ) if the message point is on the elliptic curve, wherein the secret message bit string of the 0-th block is recovered from the x-coordinate of the point (x m 0 ,√{square root over ( α y m 0 ) if the message point is on the twist of the elliptic curve; (p) setting i=0 and iteratively repeating the following steps q) through r) until i>u: (q) computing the message point as (x m i ,y m i )=(x c i ,y c i )−(x c i-1 ,y c i-1 ) and (x Tc i ,√{square root over ( α y Tc i )=(x Tc i-1 ,√{square root over ( α y Tc i-1 ) if the received cipher point of the i-th block (x c i ,y c i ) is on the elliptic curve, wherein if the received cipher point (x Tc i ,√{square root over ( α y Tc i ) is on the twist of the elliptic curve, the message point (x m i ,√{square root over ( α y m i ) is computed as (x m i ,√{square root over ( α y m i )=(x Tc i ,√{square root over ( α y Tc i )−(x Tc i-1 ,√{square root over ( α y Tc i-1 ) and (x c i ,y c i )=(x c i-1 ,y c i-1 ); and (r) recovering the secret message bit string of i-th block from the x-coordinate of the point (x m i ,y m i ) if the message point is on the elliptic curve, wherein the secret message bit string of the i-th block is recovered from the x-coordinate of the point (x m i ,√{square root over ( α y m i ) if the message point is on the twist of the elliptic curve.

9384493

13780409

1. A computer-implemented method, comprising: providing a computing apparatus having a transaction handler configured in an electronic payment processing network connecting separate computers, including first computers controlling consumer accounts from which payments of transactions are made in the electronic payment processing network; second computers controlling merchant accounts in which the payments are received via the electronic payment processing network; and transaction terminals configured to initiate the transactions in the electronic payment processing network using identifications of the consumer accounts; a data warehouse coupled with the transaction handler and storing: first transaction data recording payment transactions processed by the transaction handler in a first period of time, and second transaction data recording payment transactions processed by the transaction handler in a second period of time; and a portal coupled with the data warehouse; receiving, in the portal of the computing apparatus using a communication channel outside the electronic payment processing network, internet content indicative of consumer sentiment during the first period of time; evaluating, by the computing apparatus, consumer sentiment values based on the internet content published during the first period of time; correlating, by the computing apparatus using a machine learning technique, the first transaction data recording the payment transactions processed by the transaction handler in the first period of time with the consumer sentiment values evaluated based on the internet content published during the first period of time; generating, by the computing apparatus, a computer quantification model of consumer sentiment from the correlating; training the computer quantification model based on adjusting parameters of the quantification model to reduce differences between the consumer sentiment values evaluated based on internet content published during the first period of time, and numerical values computed from applying the first transaction data in the first period of time to the quantification model; adjusting regional and temporal differences in emotional sentiment for the numerical values in the training of the quantification model; receiving, by the computing apparatus from the data warehouse, the second transaction data recording payment transactions of a group of users during the second period of time; applying, by the computing apparatus, the second transaction data to the quantification model; determining, by the computing apparatus through the applying of the second transaction data to the computer quantification model, a numerical value of consumer sentiment of the group of the users during the second period of time; identifying, by the computing apparatus, offers based at least in part on the numerical value of consumer sentiment of the group of the users; and communicating, by the portal using a channel outside the electronic payment processing network, the offers to the group of the users.

20150193694

14164446

1. A method comprising: receiving, at a network device, a first data set indicative of the statuses of a plurality of network devices when a type of network attack is not present; receiving a second data set indicative of the statuses of the plurality of network devices when the type of network attack is present, wherein at least one of the plurality simulates the type of network attack by operating as an attacking node; training a machine learning model using the first and second data set to identify the type of network attack; and identifying a real network attack using the trained machine learning model.

20160298183

14392322

1. A high-throughput sequencing method for detecting methylated CpG islands comprising: (a) treating a DNA sample with a modifying agent to form the modified DNA wherein cytosine bases but not 5′-methyl-cytosine bases of the DNA sample are modified to uracil bases; (b) providing Primer A and DNA polymerase to the modified DNA to allow at least one round of linear amplification to form the semi-amplicon capable of anchoring Adapter Primer C at one end, wherein Primer A is composed of a 3′ portion and a 5′ portion, wherein the 3′ portion contains 4 or more nucleotides capable of binding to the modified DNA and allowing amplification, wherein the 5′ portion allows Adapter Primer C to bind to its reverse complementary sequence for PCR amplification; (c) amplifying the semi-amplicon by using Primer B and DNA polymerase to form the full-amplicon enriched with methylated CpG islands and capable of anchoring Adapter Primer C at one end and Adapter Primer D at the other end, wherein Primer B is composed of a 3′ portion and a 5′ portion, wherein the 3′ portion contains 7 or more nucleotides and is a high-CpG-density sequence capable of binding to the semi-amplicon and allowing amplification and enrichment of the methylated CpG islands, wherein the high-CpG-density sequence is a sequence of which the 3′-terminal 7 nucleotides contain 2 or 3 CpG dinucleotides, wherein the 5′ portion allows Adapter Primer D to bind to its reverse complementary sequence for PCR amplification; (d) amplifying the full-amplicon by using Adapter Primer C, Adapter Primer D and DNA polymerase to form the final-amplicon via PCR exponential amplification; (e) separating and purifying the final-amplicon to form the library for high-throughput sequencing, sequencing the library and analyzing the data.

10065224

15196212

1. A method of treating contaminated soil or water supply, comprising: providing a bioremediation composition comprising: between about 20 wt % and about 40 wt % fly ash; between about 10 wt % and about 20 wt % kiln dust; between about 5 wt % and about 15 wt % sand; between about 0.5 wt % and about 4 wt % corn; between about 0.5 wt % and about 4 wt % cotton; between about 5 wt % and about 15 wt % calcium carbonate; between about 2 wt % and about 10 wt % grout; between about 1 wt % and about 10 wt % detergent; a biocatalyst mixture comprising about 9.1 wt % Bacillus amyloliquifaciens , about 9.1 wt % Bacillus atrophaeus , about 9.1 wt % Bacillus benzeovorans , about 9.1 wt % Bacillus cereus , about 9.1 wt % Bacillus lichenformis , about 9.1 wt % Bacillus megarterium , about 18.5 wt % Bacillus subtilus , about 9.1 wt % Bacillus polymyxa , about 9.1 wt % Micrococcus flavus , and about 9.1 wt % Micrococcus conglomeratus; at least one bioluminescent bioreporter that has been genetically engineered to produce light when a substance in said contaminated soil or water supply is metabolized, said bioluminescent bioreporter comprising a microbe that is genetically engineered to include bioluminescent (lux) transcriptional gene fusions so that said microbe is able to biodegrade organic chemical pollutants; spreading an effective amount of the bioremediation composition onto the contaminated soil or water supply, wherein the contaminated soil or water supply comprises a first color characteristic; and providing an effective amount of time in which the bioremediation composition can interact with the contaminated soil or water supply, wherein after the effective amount of time the contaminated soil or water supply comprises a second color characteristic, and wherein the second color characteristic is different than the first color characteristic.

20140229164

14001242

1. A non-transitory computer readable medium including instructions thereon that are accessible by a hardware processing arrangement, wherein, when the processing arrangement executes the instructions, the processing arrangement is configured to at least generate information associated with a classification of at least one document, comprising: identifying at least first characteristic of the at least one document; obtaining at least one second classification of the at least one document after removing the at least one first characteristic of the at least one document; and generating the information associated with the classification of the at least one document based on the at least one second classification.