Datasets:

patent

/

AIPD_evo_claim_one

like 0

8745083

13665629

1. A computer-implemented system for matching personnel with personnel seekers, comprising: a personnel seeker database structured to contain at least one personnel need, as well as at least one personnel need attribute associated with the at least one personnel need; a candidate database structured to contain at least one candidate, as well as at least one candidate attribute associated with the at least one candidate; utilizing at least one matching algorithm to produce a list of candidates having attributes that correspond to the attributes of the at least one personnel need; soliciting feedback regarding the candidates within the list of candidates; modifying the at least one matching algorithm, the at least one candidate attribute, or the at least one personnel need attribute based on the feedback; and producing a next list of candidates utilizing the modified at least one algorithm.

20100080471

12317994

1. A method for determining if a document is an original version comprising: receiving a captured copy detection pattern (CDP) from a document to be verified; obtaining an expected CDP; manipulating the expected CDP to create a manipulated expected CDP; performing an identification test using the captured CDP and the manipulated expected CDP to determine an identification test parameter; if the identification test parameter indicates failed identification, then reporting the failed identification; if the identification test parameter indicates passed identification, then performing at least one authentication test using the captured CDP and the manipulated expected CDP to determine an authentication test parameter, wherein the at least one authentication test is selected from a plurality of authentication tests; and using the authentication test parameter to determine if the document is an original version.

8224641

12274182

1. A method of identifying one or more languages for a document, the languages being selected from a set of candidate languages, the method comprising: for each language (M) in the set of candidate languages, defining a set of non overlapping languages (N(M)), the set N(M) consisting of one or more languages (L), wherein each language L in the set N(M) does not overlap with the language M; obtaining n-gram data for a target document; for each language M in the set of candidate languages, using the n-gram data to determine a final score S F (M) based on relative probabilities of a first hypothesis that the target document is entirely in the language M and a second hypothesis that one portion of the target document is in the language M while another portion of the target document is in a language L selected from the set N(M); identifying, by a processor, one or more of the candidate languages as being languages of the document based on the final scores S F (M) for different languages M; and storing, in a computer readable storage device, information indicating the one or more languages of the document.

20130217582

13582351

1. A method for identifying an aptamer that binds to a target comprising the steps of: (a) providing a starting library of a starting pool of aptamer candidates; (b) reducing the sequence complexity of said starting library of aptamer candidates by a factor of at least about 100 to an intermediary pool of surviving aptamer candidates; (c) amplifying said intermediary library of surviving aptamer candidates to an over-represented library of said surviving aptamer candidates such that, for every 100 pmol of said surviving aptamer candidates, each surviving aptamer candidate has, on average, at least about three copies; (d) contacting said over-represented library with a target under a buffer condition that allows binding between members of said over-represented library and said target; (e) isolating at least one aptamer candidate that is bound to said target; and (f) determining the sequence of said bound aptamer candidate.

20140317277

14226358

1. A network infrastructure management system, comprising: a computer readable medium including a network infrastructure manager module, a management database module and a manager agent module, the manager agent module including a discovery engine and pluggable management protocols which interfaces with the discovery engine.

9861066

15099795

1. A plant, a plant part, or a seed of soybean variety CC1415432, wherein a representative sample of seed of said soybean variety CC1415432 has been deposited under ATCC Accession Number PTA-122976.

8214437

10743015

1. A method of handling messages in a messaging system that includes a message gateway and individual message boxes for users of the system, wherein a message addressed to a user is delivered to the user's message box after passing through the message gateway, the method comprising: knowingly biasing a global, scoring e-mail classifier relative to a personal, scoring e-mail classifier such that the global, scoring e-mail classifier is less stringent than the personal, scoring e-mail classifier as to what is classified as spam, wherein the global, scoring e-mail classifier and the personal, scoring e-mail classifier are probabilistic e-mail classifiers such that, to classify a message, the global, scoring e-mail classifier and the personal, scoring e-mail classifier use respective internal models to determine a probability measure for the message and compare the probability measure to a classification threshold; receiving messages at the message gateway; inputting the received messages into the global, scoring e-mail classifier to classify the input messages as spam or non-spam; handling at least one of the messages input into the global, scoring e-mail classifier based on whether the global, scoring e-mail classifier classified the at least one message as spam or non-spam; outputting at least one message from the global, scoring e-mail classifier, wherein the outputted message has been classified as non-spam by the global, scoring e-mail classifier; inputting the outputted message from the global, scoring e-mail classifier into the personal, scoring e-mail classifier to classify the at least one outputted message as spam or non-spam; handling the at least one outputted message input into the personal, scoring e-mail classifier based on whether the personal, scoring e-mail classifier classified the at least one outputted message as spam or non-spam; receiving an indication from a user to change the classification of the at least one outputted message; in response to the indication, changing the classification of the at least one outputted message; generating retraining data based on the change to the classification of the at least one outputted message; and retraining the personal, scoring e-mail classifier based on the generated retraining data such that the personal, scoring e-mail classifier's internal model is refined to track the user's subjective perceptions as to what messages constitute spam messages.

9514161

13870346

1. A method to guarantee anonymity under r-dereferenceability in a Linked Data graph comprising: transforming an original Linked Data graph structure having labeled nodes interconnected by directed edges into a corresponding anonymous Linked Data graph, with one or more nodes embodying a searchable Uniform Resource Identifier (URI), and updating the corresponding ontology definitions of the Linked Data graph based on the applied transformations; iteratively expanding said corresponding anonymous Linked Data graph up to r times, where r is an integer>0, wherein said iteratively expanding comprises: dereferencing a searchable URI of a node of said anonymized Linked Data graph structure by following a link to a resource from which a further Linked Data graph structure is obtained, said further Linked Data graph structure having additional labeled nodes embodying additional searchable URIs and property values, and replacing the node embodying the searchable URI of the anonymized Linked Data graph structure with the further Linked Data graph structure to obtain an expanded Linked Data graph, and updating the corresponding ontology definitions of the expanded Linked Data graph to include the ontology definitions of the further Linked Data graph structure; determining from each said additional URIs and property values in said expanded corresponding anonymous Linked Data graph whether anonymity is breached by searching for a URI whose iterative dereferencing originates a graph containing a Linked Data graph node URI that was present in the original Linked Data graph, and making a URI determined as breaching said anonymity non-dereferenceable, wherein a computing system including at least one processor unit performs one or more of: the transforming, iteratively expanding, determining and said dereferencing.

8849353

11796328

1. A method of MIMO communications in a wireless network, said network having a plurality of wireless units and at least first and second base stations, each of the first and second base stations having one or more transmit antennas, wherein the method comprises the steps of: forming a user group based at least in part on a semi-orthogonal selection of a subset of said plurality of wireless units; and transmitting data from at least the first and second base stations over an assigned transmission channel to the wireless units in said user group, wherein the data transmitted from at least the first and second base stations is transmitted according to a zero-forcing beamforming (ZFBF) operation and at least one designated transmission power constraint is applied to at least the first and second base stations, and wherein the at least one designated transmission power constraint comprises at least one of (1) a first transmission power constraint applied on a per-transmission basis for each of at least first and second transmit antennas respectively associated with at least the first and second base stations, and (2) a second transmission power constraint applied on a per-base station basis for all of the transmit antennas associated with each of at least the first and second base stations.

8560461

12059601

1. A computing system, comprising: one or more computers; wherein the one or more computers are configured to implement: a data store storing packaging-related information; and a shipment splitting analyzer configured to: receive data identifying a group of items to be shipped to a same destination from a materials handling facility, wherein the data comprises two or more unique item identifiers and a respective quantity of items associated with each unique item identifier, and wherein at least two items in the group of items have different sizes or shapes; compare one or more of a number of unique item identifiers in the data identifying the group of items or a number of items in the group of items to a respective pre-determined threshold condition; in response to the comparison resulting in meeting the pre-determined threshold condition: attempt to split the group of items into two or more shipment sets, wherein to attempt to split the group of items into two or more shipment sets, the shipment splitting analyzer is configured to: access a portion of the packaging-related information in the data store; attempt to divide the group of items into two or more shipment sets dependent, at least in part, on the accessed packaging-related information; and provide data identifying each of one or more shipment sets to the materials handling facility dependent on results of said attempt to divide the group of items, wherein each shipment set comprises items to be packaged together for shipment in a respective container; wherein said providing is performed prior to the group of items being sorted for shipping; and in response to the comparison resulting in not meeting the pre-determined threshold condition: refrain from attempting to split the group of items into two or more shipment sets; and provide data to the materials handling facility identifying the group of items as a single shipment set.

20110093459

12579855

1. A method, comprising: accessing, by one or more computer systems, a set of recency ranking data comprising one or more recency search queries and one or more recency search results, each of the recency search queries being recency-sensitive with respect to a particular time period and being associated with a query timestamp representing the time at which the recency search query is received at a search engine, each of the recency search results being generated by the search engine for one of the recency search queries and comprising one or more recency network resources; constructing, by the one or more computer systems, a plurality of recency features from the set of recency ranking data; and training, by the one or more computer systems, a first ranking model via machine learning using at least the recency features.

8289884

12353769

1. A computer implemented method for identifying unknown illicit networks, a computer performing steps comprising: obtaining by the computer node data and link data for a plurality of nodes, the node data comprising attributes of a node, there being one or more links, each link representing an interaction between nodes and the link data comprising attributes associated with the link; training by the computer a node-based probability model iteratively using the node data and the link data, iterating until a stop condition is satisfied, each iteration recursively using a probability of each node as input for computation of a probability of each other node; training by the computer a topology-based model using network data; and solving by the computer a maximum likelihood problem based on said node probabilities from said recursive iteration, using as constraints output of said topology-based model, and determining whether each of said nodes is illicit (bad') or not ('good').

20090204594

12027315

1. A recommendation system for assisting mashup developers at build-time comprising: a repository manager which accesses a repository of mashups database and responds to mashup developer's requests to generate outputs that can be added to the developer's existing partial mashup, the repository manager including a catalog manger, which keeps track of all mashups, services and service outputs in the repository of mashups database, and a statistics manager, which collects statistics and determines probability distributions for the occurrence of different repository terms and their co-occurrence patterns; a semantic matcher which accesses one or more databases and provides a similarity score for any pair of terms to the statistics manager of the repository manager; an output ranker which receives the mashup developer's requests and communicates those requests to the repository manager, the output ranker receiving input from the semantic matcher and the repository manager and identifying a set of candidate outputs that can be added to the developer's existing partial mashup, assigns a relevance score to each candidate output and ranks candidate outputs based on their scores, the output ranker outputting ranked candidate outputs as recommended outputs to the mashup developer; and a planner receiving a selected recommended output from the mashup developer and communicating the selected output to the repository manager, the planner receiving input from the semantic matcher and the repository manager and outputting a best plan to generate the selected recommended output starting from information already present in the mashup developer's mashup.

20090272889

12405650

1. A method of calibrating a spectrophotometer, the method comprising: (a) harvesting rumen fluid from at least one ruminant animal; (b) combining the rumen fluid with a primer composition comprising a carbohydrate; (c) incubating the rumen fluid and carbohydrate of step (b) until a pre-determined endpoint is achieved, thereby yielding primed rumen fluid; (d) digesting a plant matter sample with the rumen fluid of step (c) to yield a digested sample and measuring fiber content of the digested sample; (e) measuring absorbance or reflectance of the plant matter sample of step (d) using a spectrophotometer; and then (f) calibrating the spectrophotometer by correlating the measured fiber content from step (d) with the measured absorbance or reflectance from step (e).

6090601

09010809

1. A polyketide synthase comprising a ketoreductase domain wherein said ketoreductase domain comprises a peptide sequence selected from the group consisting of: TBL (subset of SEQ ID NO:1) (a) Val-Asp-Arg-His-Gly-Val-Lys-His-Leu-Val; (subset of SEQ ID NO:1) (b) Gly-Ala-Ser-Asp-Leu-Ala-Ala-Glu-Leu-Gln; (subset of SEQ ID NO:1) (c) Ala-Arg-Gly-Ala-Ser-Val-Val-Val-Ala-Ala; (subset of SEQ ID NO:1) (d) Ala-Asp-Ala-Ala-Asp-Arg-Val-Ala-Leu-Glu; (subset of SEQ ID NO:1) (e) Arg-Val-Leu-Leu-Ala-Ile-Pro-His-Asp-Arg; (subset of SEQ ID NO:1) (f) Pro-Leu-Thr-Ala-Val-Val-His-Ala-Ala-Gly; (subset of SEQ ID NO:1) (g) Thr-Leu-Asp-Asp-Gly-Val-Leu-Ser-Ser-Met; (subset of SEQ ID NO:1) (h) Ala-Lys-Val-Asp-Ala-Ala-Val-Asn-Leu-Asp; (subset of SEQ ID NO:1) (i) Glu-Gln-Thr-Arg-His-Ser-Pro-Leu-Arg-Ala; (subset of SEQ ID NO:1) (j) Phe-Val-Leu-Phe-Ser-Ser-Leu-Ser-Gly-Val; and (subset of SEQ ID NO:1) (k) Leu-Gly-Ser Pro Ala-Gln-Ser-Asn-Tyr-Ala Ala- Ala.

9275061

14498189

1. A system for automatic folder ownership assignment in an enterprise computer network, the system comprising at least one computer processor and one memory implementing the following functionalities: actual modification scrutinizing functionality operative for ascertaining which first folders, among a first multiplicity of folders in an enterprise computer network, have been at least actually modified by entities other than IT administration entities, and adding said first folders to a list of base-folder candidates for ownership assignment; first pruning functionality operative for defining a second multiplicity of folders, said second multiplicity of folders being a subset of said first multiplicity of folders which does not include said first folders, all descendents of said first folders and all ancestors of said first folders; actual access scrutinizing functionality operative for ascertaining which second folders among said second multiplicity of folders, have been at least actually read by entities other than IT administration entities and adding said second folders to said list of base-folder candidates for ownership assignment; second pruning functionality operative for defining a third multiplicity of folders, said third multiplicity of folders being a subset of said second multiplicity of folders which does not include said second folders, all descendents of said second folders and all ancestors of said second folders; topmost folder scrutinizing functionality operative for ascertaining which third folders among said third multiplicity of folders are topmost folders and adding said third folders to said list of base-folder candidates for ownership assignment; and possible ownership assignment recommendation functionality operative for recommending possible assignment of ownership of at least one of said list of base-folder candidates.

8832158

13433507

1. An information handling system comprising: one or more processors; a memory coupled to at least one of the processors; a set of computer program instructions stored in the memory and executed by at least one of the processors in order to perform actions of: receiving, by one or more of the processors, a scan request corresponding to a data table, wherein the data table includes a plurality of columns; selecting, by one of the processors, one of the plurality of columns that correspond to the scan request, wherein the selected column has a column width and includes a plurality of column data entries corresponding to the column width; selecting a bankwidth size, from a plurality of bankwidth sizes, based upon the column width, wherein the bankwidth size identifies a number of bit locations of each one of the one or more column data vectors; selecting, by one of the processors, a scan algorithm from a plurality of scan algorithms based upon the column width and the bankwidth size; loading, by one of the processors, one or more of the plurality of column data entries into one or more column data vectors; and computing, by one of the processors, one or more scan results using the selected scan algorithm and the one or more column data vectors.

9417797

14299195

1. A storage system comprising: a nonvolatile memory (NVM) comprising at least a first flash memory die having a plurality of flash memory cells; and a solid-state disk (SSD) controller in communication with the NVM memory via a first interface (I/F) that interfaces the NVM with the SSD controller, the SSD controller being configured to execute read commands in order to read the memory cells, and wherein the SSD controller is configured to perform a soft read process during which the SSD controller repeatedly reads one or more pages of the memory cells N times using N respective read reference voltages, V 1 to V N , where N is a positive integer that is equal to or greater than 2, and wherein during the soft read process, the SSD controller calculates N disparity values, ΔV 1 to ΔV N , for the N reads, respectively, and generates a disparity vector comprising the N disparity values, wherein each disparity value is calculated by taking a ratio of a number of 1 bits in a bit sequence corresponding to the respective pages or pages read to a total number of bits in the bit sequence, and wherein during the soft read process, after generating the disparity vector, the SSD controller takes a derivative of the disparity vector to obtain a derivative vector having N−1 derivative values, δ(V 1 ) to δ(V N−1 ), and then uses the disparity vector and the derivative vector to estimate an optimal read reference voltage, V REF,DD , to be used by the SSD controller in a subsequent hard read process to read said one or more pages.

20140072209

14026295

1. A computer-implemented method, comprising: learning, by a computing system, a sparse overcomplete feature dictionary for classifying and/or clustering a remote sensing image dataset.

20070179357

11635364

1. Stored baseline data for automated patient management, comprising: information to identify a patient for enrollment in automated patient management and comprising at least one of treatment profile and medical history; collected device measures to provide raw physiometry for the patient regularly recorded by a medical device, beginning with an initial observation period; and derived device measures to provide derivative physiometry based on the collected device measures, wherein the collected and derived device measures quantify baseline data.

20170036346

15206413

1. A desired ZMP trajectory generating device for a mobile robot which generates a desired ZMP trajectory as a trajectory of a desired position of a zero moment point (ZMP) of the mobile robot, the device comprising: a polynomial function coefficient group determining section which determines, by regarding the desired ZMP trajectory as a trajectory expressed by a polynomial function of degree 2 or higher with time as a variable, a desired coefficient group comprising desired values of coefficients in respective terms of the polynomial function, wherein the polynomial function coefficient group determining section is configured to use a quadratic evaluation function configured to include square values of the coefficients included in the desired coefficient group as variables and a plurality of constraint conditions each configured by a linear equality or linear inequality about the coefficients, to determine the desired coefficient group, so as to minimize a value of the evaluation function while fulfilling the constraint conditions by a solution method for a quadratic programming problem, and the constraint conditions are configured to include a linear inequality which expresses a first constraint condition that a desired position of the ZMP at one or more sampling time in the desired ZMP trajectory exists within a predetermined polygonal region set in accordance with a desired position and desired posture of a floor-contacting site of the mobile robot at the sampling time.

9424510

14283377

1. An adaptive fuzzy rule controlling system for a software defined storage (SDS) system to control performance parameters in a storage node, comprising: a traffic monitoring module, for acquiring observed values of performance parameters in the storage node; an adaptive neural fuzzy inference module, for learning a dynamic relationship between configurations of a plurality of storage devices in the storage node and the performance parameters during a period of time, and outputting fuzzy rules which is built according to the dynamic relationship; a traffic forecasting module, for providing forecasted values of the performance parameters in a particular point in time in the future; and a fuzzy rule control module, for arranging the configuration of the storage devices in the storage node in the particular point in time in the future according to the fuzzy rules and the forecasted values so that a specified value of one specified performance parameter can be achieved in the particular point in time in the future, wherein the storage node is operated by SDS software.

20110279316

13187877

1. A method for predicting GNSS satellite trajectory extension data in a mobile apparatus, said method comprising steps of: obtaining at least one satellite navigation message from one of satellites; determining a satellite trajectory prediction model according to the obtained satellite navigation message; and propagating at least one set of satellite trajectory extension data by using the estimated satellite trajectory prediction model.

20060230391

11104323

1. A method in a data processing system for collecting a plurality of metrics, the method comprising: initializing a plurality of counters to count events associated with metrics of interest; counting occurrences of events associated with metrics of interest during a single execution of a computer program; and responsive to a determination that a branch has been taken, generating a trace record for the branch taken, wherein the trace record contains a count of events associated with the metrics of interest.

20140235726

14179088

1. A method of improving cognitive functioning in a human having Down syndrome, which comprises the step of administering an amount of one or more β2 adrenergic receptor agonists or a pharmaceutically-acceptable salt or salts thereof to a human in an amount and with a frequency of administration effective to improve the cognitive functioning of said human.

20060282799

11148086

1. A method of determining high-speed VLSI reduced-order interconnect by non-symmetric Lanczos Algorithm, which includes the following steps: a) input a mesh circuit; b) input an expand frequency point; c) set a state space matrix of circuit; and d) judge the order of reduced model for model reduction as per iteration termination conditions.

20070083385

11278084

1. A method, implemented at least in part in a clinical computing environment, for facilitating the improvement of a current clinical process within one or more clinical facilities, the method comprising: defining an optimized practice process model for a type of clinical process corresponding with the current clinical process, the optimized practice process model defining an optimal clinical process flow for the type of clinical process; accessing clinically-related data related to the current clinical process within the one or more clinical facilities; identifying one or more opportunities for improving the current clinical process based on the optimized practice process model and the clinically-related data; and generating one or more user interfaces for analyzing the one or more opportunities.

10107205

15023480

1. A method for controlling, regulating, or controlling and regulating a technical system in a computer-assisted manner, in which dynamic behavior of the technical system is respectively characterized for a plurality of times by a state of the technical system and an action carried out on the technical system in the state, a respective action at a respective time resulting in a new state of the technical system at a next time, and an action sequence being one or more actions to be successively carried out on the technical system in a temporal sequence, a measure of quality with respect to an optimization criterion for operating the technical system being able to be calculated for each action sequence based on the states of the technical system resulting from carrying out the one or more actions in the action sequence, the measure of quality being higher, the better the optimization criterion is satisfied, the method comprising: providing a simulation model of the technical system for predicting the resulting states of the technical system for respective action sequences; determining an action sequence having a highest possible measure of quality at a respective predefined time from a sequence of successive predefined times using a numerical optimization method, the numerical optimization method using the simulation model to predict the resulting states for action sequences generated during the numerical optimization method and to then determine the measure of quality of the generated action sequences using the predicted states; and carrying out one or more actions in the determined action sequence on the technical system, the carrying out comprising changing one or more state variables of the technical system; and operating the technical system based on the one or more changed state variables of the technical system, wherein the numerical optimization method comprises a particle swarm optimization, the particles of which are assigned to respective action sequences randomly determined when initializing the particle swarm optimization and are iteratively changed during the particle swarm optimization by respective speed vectors, the respective speed vectors being determined using a fitness function corresponding to the measure of quality, and wherein the technical system is an electrical energy generation installation.

9836595

15412081

1. A processor-implemented method for determining a password strength, the method comprising: receiving, by a processor, a user-entered password through a plurality of user interactions with an input device associated with a user device, wherein the plurality of user interactions are selected from a group consisting of a plurality of key presses, a plurality of screen traces, and a plurality of spoken words, and wherein the input device is selected from a group consisting of a physical keyboard, a digital keyboard, and a microphone; identifying a keyboard layout type associated with a keyboard utilized to enter the received user-entered password; mapping each character within a plurality of characters in the received user-entered password to a corresponding location on a grid associated with the identified keyboard layout type; determining a coordinate sequence associated with the received user-entered password based on the mapped plurality of characters, wherein the coordinate sequence is on an x-y coordinate grid and calculated based on a plurality of measurements, and wherein the plurality of measurements is selected from a group consisting of a plurality of inches from a source, a plurality of centimeters from the source, and a plurality of millimeters from the source; applying a Hough transform pattern recognition algorithm to the determined coordinate sequence, wherein applying the Hough transform pattern recognition algorithm further analyzes a previous password coordinate sequence associated with a user account; and determining a password strength based on the applied Hough transform pattern recognition algorithm and comparing the determined coordinate sequence of the received user-entered password with the analyzed previous password coordinate sequence, wherein the determined password strength is displayed to a user as a word, a number, or a color, and wherein the determined password strength will be weak when the determined coordinate sequence is the same as the analyzed previous password coordinate sequence.

20120124203

13296342

1. An interne based social networking system, the system including: a series of video sensors monitoring a specified environment and streaming video events into the system; a series of system users collectively monitoring the video streams and analyzing events generated in relation to the video stream; a reporting system for reporting actions taken by said system users among said system users.

20060062404

11222001

1. A method for selecting a cross-over frequency to attenuate a spectral notch in a cross-over region, the method comprising: measuring a full-range subwoofer and satellite speaker response in at least one position in a room; selecting a cross-over region; selecting a set of candidate cross-over frequencies and corresponding bass-management filters for the subwoofer and the satellite speaker; applying corresponding bass-management filters to the full-range subwoofer and satellite speaker response to obtain bass managed subwoofer and satellite speaker responses; level matching the bass managed subwoofer and satellite speaker responses to obtain leveled subwoofer and satellite speaker responses; summing the leveled subwoofer and satellite speaker responses to obtain a net bass-managed subwoofer and satellite speaker response; computing an objective function using the net bass-managed subwoofer and satellite speaker response for each of the candidate cross-over frequencies; and selecting the candidate cross-over frequency resulting in the lowest objective function.

10134131

15433027

1. A method, comprising: receiving, by a computing device, a target image of a target biological cell having a target phenotype; obtaining, by the computing device, a semantic embedding associated with the target image, wherein the semantic embedding associated with the target image is generated using a machine-learned, deep metric network model; obtaining, by the computing device for each of a plurality of candidate images of candidate biological cells each having a respective candidate phenotype, a semantic embedding associated with the respective candidate image, wherein the semantic embedding associated with the respective candidate image is generated using the machine-learned, deep metric network model; determining, by the computing device, a similarity score for each candidate image, wherein determining the similarity score for a respective candidate image comprises computing, by the computing device, a vector distance in a multi-dimensional space described by the semantic embeddings between the respective candidate image and the target image, and wherein the similarity score for each candidate image represents a degree of similarity between the target phenotype and the respective candidate phenotype; determining, by the computing device, a threshold similarity score; and determining, by the computing device, those candidate images having similarity scores that satisfy the threshold similarity score, wherein the target phenotype is a healthy phenotype, wherein the candidate images having similarity scores that satisfy the threshold similarity score have respective candidate phenotypes corresponding to the healthy phenotype, and wherein those candidate images having similarity scores that do not satisfy the threshold similarity score have respective candidate phenotypes corresponding to an unhealthy phenotype.

9271374

13877663

1. An illumination system comprising: at least one luminaire which is configured to provide light according to a plurality of at least three preset combinations of illumination level and color temperature, wherein the color temperature and the illumination level are controlled via a control protocol; and a user interface configured to select the illumination level and color temperature from said plurality of preset combinations, the control protocol comprising transition times for transitions between said preset combinations, said transition times being in the range of about 2 seconds to about 5 minutes, wherein at least one combination of said plurality of preset combinations is a calm setting in which the illumination level is at least 100 lux and the color temperature is about 2900K, or a standard setting in which the illumination level is at least 100 lux and the color temperature is about 3500K, and at least one other combination of said plurality of preset combinations includes at least one of an energy setting in which the illumination level is about 650 lux and the color temperature is at least 9000 K or a focus setting in which the illumination level is at least about 750 lux and the color temperature is about 6500K, wherein the plurality of preset combinations comprises at least four preset combinations, and the illumination system further comprises a lighting controller comprising a motion detector which is configured to automatically switch-over the illumination system to the calm setting upon detection of a level of motion that supersedes a preset motion threshold value.

8625904

13221078

1. A method comprising: analyzing each digital image in a digital image collection to generate associated feature descriptors related to image content or image capture conditions; storing the feature descriptors associated with the digital images in a metadata database; using a data processor to automatically analyze the metadata database to identify a plurality of frequent itemsets, wherein each of the frequent itemsets is a set of co-occurring feature descriptors that occurs in at least a predefined fraction of the digital images, each frequent itemset being associated with a subset of the digital images; determining, for each of the identified frequent itemsets, a probability of occurrence representing a probability that a respective frequent itemset occurs in a general population of images based on one or more probability distributions determined from an analysis of a large number of image collections; determining a quality score for each of the identified frequent itemsets responsive to the determined probability of occurrence; ranking the frequent itemsets based at least on the determined quality scores; identifying one or more groups of related digital images corresponding to one or more of the top ranked frequent itemsets; and storing an indication of the identified groups of related digital images in a processor-accessible memory.

20040008799

10190579

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&equals;B×AI&plus;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Î ML (s) as a function of 15 &Sum; j &it; B T &af; ( s, j ) × y &af; ( 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 &equals;−1, if AÎ ML ( s )< R AI s &equals;0, if R<AÎ ML ( s )< U AI s &equals;1, if AÎ ML ( s )&gE; U where R and U are decision thresholds.

20160063084

14835231

1. A method performed by at least one computer processor, the method comprising: (1) storing data representing a plurality of classes and a plurality of instances in a bijective-set memory; (2) storing data representing class membership relationships between the plurality of classes and the plurality of instances in the bijective-set memory; (3) receiving data representing a query, wherein the query does not specify any table; (4) identifying an operation specified by the query; (5) identifying an operand specified by the query; (6) executing the query, comprising: (6)(a) identifying a table to be searched, based on the query; and (6)(b) performing the operation on the operand, including searching the identified table, to produce an output.

20080291467

11753496

1. A method of determining one or more profile parameters of a photomask covered with a pellicle, the method comprising: developing an optical metrology model of a pellicle covering a photomask, the pellicle having a first and second surface; developing an optical metrology model of the photomask, the photomask separated from the pellicle by a medium and having a structure, the structure having profile parameters, the optical metrology model of the photomask taking into account the optical effects on the illumination beam transmitted through the pellicle and diffracted by the photomask structure, the diffraction generating a detection beam; integrating the optical metrology model of the pellicle and the optical metrology model of the photomask, generating an integrated optical metrology model; optimizing the integrated optical metrology model; and determining one or more profile parameters of the mask structure using the optimized integrated optical metrology model.

20160063322

14475809

1. A computer implemented method of extracting structural label and value pairwise data associated with a digital version of a document, the method comprising: a) performing a layout analysis of the digital version of the document to generate one or more layout structures associated with the document, each layout structure including a plurality of structural elements vertically or horizontally aligned where each structural element is defined as a typographical box including one or more lines of textual elements associated with the digital version of the document; b) processing the one or more lines of textual elements to identify and tag textual elements associated with label and value pairwise data; c) processing the one or more layout structures and associated tagged textual elements to generate one or more respective label:value sequences of tagged textual elements representative of a respective layout structure; and d) extracting label and value pairwise data from the one or more label:value sequences of tagged elements.

20100076738

12561854

1. A computer-implemented method for use in modeling a geomechanical reservoir system, comprising: receiving, through a computer system, data indicative of physical properties associated with the geomechanical reservoir system; generating, through a computer system, fracturing predictions by solving a system of partial differential equations that model the geomechanical reservoir system; wherein the system of partial differential equations comprises a reservoir flow model, a geomechanical model, and a fracture model of the geomechanical reservoir system; wherein the system of partial differential are coupled through a fully-expanded Jacobian; wherein the solving of the system of partial differential equations comprises solving simultaneously in a single timestep the fully-expanded Jacobian based upon the received physical properties data; and wherein the fracturing predictions model the geomechanical reservoir system for the timestep; and outputting or displaying, through a computer system, the generated fracturing predictions.

20130067894

13236217

1. A selective catalytic reduction control system comprising: a diesel engine; a selective catalytic reduction exhaust after-treatment mechanism for connection to the engine; an engine controller; and a selective catalytic reduction controller connected to the selective catalytic reduction exhaust after-treatment mechanism and to the engine controller; and wherein the engine controller and the selective catalytic reduction controller provide coordinated control of the engine and selective catalytic reduction selective catalytic reduction exhaust after-treatment mechanism to control an amount of pollutants in an exhaust emission from the engine.

9355160

13763568

1. An automated data analysis system for automatically determining compatibility of an executable set of machine readable instructions implementing a computational analysis and a data set as input to the executable computational analysis to be operated upon by the executable computational analysis, comprising: one or more tangible, non-transitory computer readable storage devices storing computational analysis attribute data, the computational analysis attribute data being information indicative of one or more respective attributes of each executable computational analysis of a set of executable computational analyses, and the one or more respective attributes indicating respective characteristics of data required or preferred for a data set to be considered compatible with the each executable computational analysis as an input to and an object of a performance of the each executable computational analysis; and one or more computing devices communicatively coupled to the one or more tangible, non-transitory computer readable storage devices, the one or more computing devices configured to: receive data set attribute data, the data set attribute data being information indicative of one or more characteristics of a data set; perform a comparison of the received data set attribute data and computational analysis attribute data corresponding to a particular executable computational analysis of the set of executable computational analyses; determine a measure of compatibility between the data set and the particular executable computational analysis based on the comparison; and at least one of: (i) select a subset of one or more executable computational analyses from the set of executable computational analyses based on the measure of compatibility corresponding to the particular executable computational analysis, the selected subset of the one or more executable computational analyses to be performed on at least a portion of the data set, or (ii) cause an indication of the measure of compatibility corresponding to the particular executable computational analysis to be transmitted to a user computer.

20110055128

12551606

1. A method for determining a relationship between biological predictors and a phenotype, the method implemented at least in part by a computer, the method comprising: obtaining data regarding a set of biological predictors; obtaining an indication of the phenotype; training a probabilistic predictor on one portion of the data to predict the phenotype based on the set of biological predictors; applying the probabilistic predictor to a second portion of the data to produce predictive probabilities of the phenotype for the second portion of the data; and using statistical significance between an aspect of the predictive probabilities and actual phenotype observations to summarize the relationship between the set of biological predictors and the phenotype.

8087088

11864736

1. A method of testing a web application, wherein a web application is a program that operates on a server and interacts with clients that access the program over a network, wherein further the web application accepts parameters that define results generated from the web application, the method comprising: executing a first target request at a scanner, the first target request being directed at the web application and being a request to be tested; receiving a first target response in response to the first target request; executing a second target request at a scanner, the second target request being directed at the web application and determined based on the first target request; receiving a second target response in response to the second target request, the second target response being a predetermined target response; comparing the first target response to the second target response to determine an attribute of the first target response; determining whether the first target response is equal to the predetermined target response; and if it is determined that the first target response is not equal to the predetermined target response: executing one or more additional target requests, the additional target requests being directed at the web application and determined based on the first target request; in response to the additional target requests, receiving a corresponding one or more additional target responses; and comparing the additional target responses to the first target response to determine an attribute of the first target response, wherein the predetermined target response is a hypertext transport protocol (HTTP) class response, comparing the first target response to the second target response includes using a fuzzy classification process, and comparing the additional target responses to the first target response includes using a fuzzy classification process.

20070005537

11150852

1. A method of comparing inputs, comprising: receiving a first input; receiving a second input; ordering the first input with respect to the second input using a neural network.

8676598

12798083

1. A non-transitory computer-readable medium storing computer-readable instructions that are executed by a processor to perform operations comprising: assigning an individual to a first health state from among a plurality of health states that are ordered based on a number of chronic diseases, wherein the number of chronic diseases is determined by parsing an insurance claim submitted by the individual and wherein one or more chronic diseases are identified based on one or more disease codes extracted from the insurance claim; upon determining an increase in the number of chronic diseases suffered by the individual, re-assigning the individual into a second health state from among the plurality of health states, the second health state being representative of an increase in the number of chronic diseases; determining a total number of transitions from the first health state into each of the plurality of health states, each transition the total number of transitions representing a number of individuals acquiring an increased number of chronic diseases; and representing each transition as an element in a transition matrix; using the transition matrix to determine a comparative efficacy of a preventative care program related to the number of changed chronic diseases, and using the transition matrix is to set a target for patient transition to implement an improved preventative care program.

20130227518

13766024

1. A device for modeling a software application to be used in an environment, comprising: an environmental model creating portion operable to enable a user to create an environmental model comprising a first set of attributes of the environment, each of the first set of attributes comprising a value attribute, a declaration, and an associated set of meta-attributes, each of said meta-attributes comprising at least one of a declaration and function; wherein the environmental model creating portion is implemented in a computer system that comprises instructions stored in a machine-readable medium and a processor that executes the instructions; a behavioral model creating portion operable to enable the user to create a behavioral model to describe behavior of the software application at a boundary of the software application and the environment, the behavioral model comprising a second set of attributes, which comprise a portion of the first set of attribute, wherein the portion of the first set of attributes is shared between the environmental model and the behavioral model; each of the second set of attributes comprising a value attribute having at least one of a declaration and function, and a set of meta-attributes, each of said meta-attributes having at least one of a declaration and function; wherein changes to an attribute in the behavioral model is reflected automatically in all models that share the attribute, and wherein the behavioral model creating portion is implemented in a computer system that comprises instructions stored in a machine-readable medium and a processor that executes the instructions; a design model creating portion operable to enable the user to create a design model comprising a first decomposition of the second set of attributes into a first plurality of groups, wherein the design model creating portion is implemented in a computer system that comprises instructions stored in a machine-readable medium and a processor that executes the instructions; and a run-time model creating portion operable to enable the user to create a run-time model comprising a second decomposition of the second set of attributes into a second plurality of groups, the run-time model being operable to record the decomposition of the behavioral model into run-time components, wherein the run-time model creating portion is implemented in a computer system that comprises instructions stored in a machine-readable medium and a processor that executes the instructions.

8621411

13552919

1. A method of identifying bit stacks in an integrated circuit design comprising: receiving a circuit description for the integrated circuit design which includes a plurality of cells interconnected to form a plurality of nets, the cells having locations from a previous placement, by executing first instructions in a computer system; identifying at least one cluster of the cells from the design, by executing second instructions in the computer system; generating candidate bit stacks from groups of interconnected cells in the cluster, by executing third instructions in the computer system; calculating wirelength costs for the candidate bit stacks based on the cell locations, by executing fourth instructions in the computer system; and selecting a partition from a plurality of different partitions of the candidate bit stacks as final bit stacks wherein said selecting is based on a minimum total wirelength cost for the partition equal to the sum of the wirelength costs of all candidate bit stacks in the partition, by executing fifth instructions in the computer system.

20040122601

10323000

1. A method for processing tester information comprising: determining the number of clusters of data in the tester information to determine the number of data clusters; determining a basis from the tester information to be used for plotting the data clusters; and plotting the data clusters on a plurality of trellis charts to form a trellising plot with a trellis of the trellis charts.

8510298

11881950

1. A method for ranking one or more products in online shopping, the method comprising the steps of: a) receiving a keyword search query for the one or more products, the one or more products being associated with a product category; b) identifying one or more attributes, based on receiving the keyword search query, related to the product category, the one or more attributes comprising at least one of a brand name, a store name, a style, and price; c) selecting one of the one or more identified attributes as a base attribute, wherein the base attribute is selected based on the product category; d) identifying one or more features corresponding to the base attribute, the one or more features comprising query independent features and query dependent features; e) computing a normalized score of each of an attribute instance of the base attribute for each product in the product category, the normalized score being computed based on the value associated with each of the one or more features associated with the base attribute, wherein the value of the one or more features is determined based on a query dependent and a query independent analysis of the one or more features, the normalized score being computed using one or more mathematical functions; f) computing a normalized score of each of an attribute instance of the one or more attributes other than the base attribute for each product in the product category, the normalized score being computed based at least in part on the normalized score of the corresponding base attribute instance of each product, the normalized score being computed using one or more mathematical functions and an attribute affinity matrix, wherein the attribute affinity matrix comprises one or more values, for the attribute instance of the one or more attributes other than the base attribute, calculated based on normalized scores of the attribute instances of the base attribute; g) assigning weights to each of the one or more attributes based on the relative importance of each of the one or more attributes for the product category and the keyword search query; h) generating a product rank for each of the one or more products in the product category based on the assigned weights of the one or more attributes and the scores of each attribute instance using a predefined relevancy-ranking algorithm; and i) displaying a rank ordered list of the one or more products, wherein the steps of the method are performed by a microprocessor.

7672865

11256386

1. A method for semi-supervised insight discovery, the method being implemented by one or more data processors and comprising: seeking, by at least one data processor, pair-wise relationships between large numbers of entities, in a variety of domain specific contexts, from appropriately filtered and customized transaction data; representing, by at least one data processor, the pair-wise relationships between the entities in a graph structure containing a set of nodes representing entities, and a set of edges representing strength of relationships between pairs of nodes; discovering, by at least one data processor, insights in the form of relationship patterns of interest that may be projected or scored on individual or groups of transactions or customers; and using, by at least one data processor, said insights to make data-driven-decisions for a variety of business goals; said graph structure comprising any of the following types of structures: a sub-graph comprising a subset of a graph, created by picking a subset of nodes and edges from an original graph, a sub-graph comprising any of: node based sub-graphs which are created by selecting a subset of the nodes and by keeping only those edges between selected nodes; and edge based sub-graphs which are created by pruning a set of edges from the graph and removing all nodes that are rendered disconnected from the graph; a neighborhood of a target product comprising a sub-graph that contains the target product and all the products that are connected to the target product with consistency strength above a predefined threshold to show the top most affiliated products for a given target product; a bundle structure comprising a sub-set of products wherein each product in the bundle has a high consistency connection with all the other products in the bundle, wherein each product in a bundle is assigned a product density with respect to the bundle which is high if the product has high consistency connection with other products in the bundle and low otherwise; and a bridge structure comprising a collection of two or more, otherwise disconnected, product groups that are bridged by one or more bridge product(s).

9038131

14197371

1. A method for valuating compliance of computer resources, the method comprising: valuating, by a processor, compliance of a hardware or software resource of a computer system with requirements for the computer system; valuating compliance of one or more objects of interest associated with the hardware or software resource with requirements for the objects of interest, wherein the one or more objects of interest comprise contents of the hardware or software resource that influence the compliance of the hardware or software resource; and valuating overall compliance of the hardware or software resource based on the compliance of said hardware or software resource with the requirements for the computer system and the compliance of the one or more objects of interest associated with said hardware or software resource with the requirements for the objects of interest, wherein valuating the overall compliance of the hardware or software resource comprises computing a product of a value of compliance of the hardware or software resource with each of the plurality of requirements for the computer system and a sum function of values of compliance of the one or more objects of interest associated with said hardware or software resource with each of the plurality of requirements for the objects of interest.

7725259

11744059

1. A system for determining a trajectory of a satellite comprising: a processor; and a computer program stored in a computer-readable medium, and executable on the processor, the computer program operable, when executed on the processor to: determine a first estimated trajectory of a satellite using a first sequential mode of operation; perform a thruster burn as a correction maneuver for the satellite; provide a real-time assessment of the correction maneuver by utilizing a second sequential mode of operation, the second sequential mode of operation comprising: receiving a data point from an uplink/downlink facility; determining, using a least squares algorithm, a second estimated trajectory and an estimated thruster performance of the satellite based upon the received data point; and determining, using the least squares algorithm, a trajectory error of the satellite based upon the received data point, the trajectory error including a vector quantity indicating position error in space and a scalar error value; and repeat the second sequential mode of operation if the trajectory error is above a specified threshold level; and repeat the first sequential mode of operation if the trajectory error is below the specified threshold level.

8386787

12551267

1. A hashing method performed by a computing apparatus and comprising: receiving a message at an input port; storing the received message at a first computer readable storage coupled to the input port; constructing an array of data from the stored message, wherein the array is at least a two dimensional array representing a plurality of objects arranged in a heap; storing a set of values representing the array in a second computer readable storage coupled to a processor, the array representing a state of a heap model algorithm; applying the heap model algorithm to the array in order to update the array, wherein applying the heap model algorithm to the array comprises: removing at least one of the objects; and replacing the object with another of the objects in the heap; repeating the storing of the set of values in the second computer readable storage and applying the heap model algorithm to the array until the heap model state reaches a predetermined state; using the updated array to provide a hash value of the message; and storing the hash value in a third computer readable storage.

20120284213

13101048

1. A computer-implemented method comprising: receiving a new data set of data samples, each data sample comprising input data and corresponding output data, wherein the data set is new compared to an initial training data set and a plurality of previously received update data sets of data samples that were used to train and retrain respectively an updateable trained predictive model; assigning a richness score to each of the data samples included in the new data set and to retained data samples from the initial training data and the plurality of previously received data sets, wherein the richness score for a particular data sample indicates how information rich the particular data sample is relative to other retained data samples for determining an accuracy of the trained predictive model; ranking the data samples included in the new data set and the retained data samples based on the assigned richness scores; selecting a set of test data from the data samples included in the new data set and the retained data samples based on the ranking; and testing how accurate the trained predictive model is in determining predictive output data for given input data using the set of test data and determining an accuracy score for the trained predictive model based on the testing.

9466042

13356760

1. A computer-implemented method comprising: determining an anticipated usage pattern for an information technology system, wherein the anticipated usage pattern includes a variability of load for the information technology system; determining a desired service level for the information technology system; determining a utilization saturation point for the information technology system, wherein the utilization saturation point is a highest utilization at which the information technology system is designed to run and utilization is determined based on a count of busy cycles for the information technology system divided by a count of cycles in an interval of time; selecting a number of servers in the information technology system; calculating, with a processor, one or more performance characteristics for the information technology system based on the anticipated usage pattern, the desired service level, the utilization saturation point, and the number of servers, wherein the one or more performance characteristics include a normalized headroom and at least one of an average wait time, a maximum wait time and an average utilization; comparing the one or more performance characteristics for the information technology system with one or more desired performance characteristics for the information technology system; and displaying, via a user interface, a characteristic curve of the information technology system which illustrates a relationship between the average utilization of the information technology system and one of the normalized headroom, the average wait time and the maximum wait time.

8321201

13050902

1. A computer-readable storage medium encoded with a computer program, the program comprising instructions that, when executed by one or more computers, cause the one or more computers to perform operations comprising: receiving a multi-term synonym phrase that is a candidate synonym for a multi-term query phrase; and determining that each term of the query phrase is a lexical synonym of a corresponding term of the synonym phrase or shares meaning with the corresponding term of the synonym phrase; in response to determining that each term of the query phrase is a lexical synonym of the corresponding term of the synonym phrase or shares meaning with the corresponding term of the synonym phrase, using the query phrase and the synonym phrase to improve a synonym mapping between a particular term of the query phrase and a term of the synonym phrase that corresponds to the particular term.

8868478

13484476

1. A non-transitory storage medium storing instructions executable by an electronic data processing device to perform a method including minimizing a convex regularized loss function respective to a prediction tensor X of order K having dimensions n 1 , n 2 ,. .. , n K to generate an optimized prediction tensor of order K where K>2 and the convex regularized loss function comprises a linear combination of (i) a loss function e(X; Y) comparing the prediction tensor X and an observation tensor Y of order K representing a set of observations and (ii) a regularization parameter λ∥X∥ * where λ is a scalar value and ∥X∥ * is a K-th order matrix norm decomposition of the tensor trace norm of the prediction tensor X given by  X  * = 1 K ⁢ ( min A 1 ⊗ A 2 ⊗ … ⊗ A K = X ⁢ (  A 1  K K +  A 2  K K + … +  A K  K K ) ) where A k ε n k ×R , R=max{n 1 , n 2 ,. .. , n K }, ∥A k ∥ K is the K-th order matrix norm of A k , and denotes the outer matrix product operator.

20150205825

14672019

1. A method for analyzing a process, the method comprising a computer system automatically performing the following: processing a data set containing observations of the process, the observations expressed as values for a plurality of variables and for an outcome of the process, wherein processing the data set determines behaviors for different variable combinations with respect to the outcome, the variable combinations defined by values for one or more of the variables; estimating impacts of different variable combinations based on (a) the behaviors of the variable combinations and (b) populations of the variable combinations; and based on the estimated impacts, automatically generating a multi-screen reporting of which variable combinations have a largest estimated impact.

20110099422

12982560

1. In a general purpose computer, a method for automatically testing a business intelligence artifact, comprising: receiving business metric data from a business intelligence system; creating a business intelligence artifact derived from the received business metric data; executing the business intelligence artifact to generate a business intelligence output populated with information related to the business metric data; creating at least one test case for the business intelligence artifact, the at least one test case having at least one assertion condition associated with the business intelligence output to verify the proper functioning of the business intelligence artifact; testing, with an automated agent interfaced with the business intelligence system, the business intelligence artifact for errors by determining whether the business intelligence output generated by the current version of the business intelligence artifact satisfies the conditions of the at least one assertion after execution of the business intelligence artifact; and if errors are detected during the testing, correcting the errors to create a subsequent version of the business intelligence artifact.

20100268697

12724312

1. A method for efficiently managing content of a landmark database in an autonomous localization and mapping system, the method comprising: determining a density of landmarks in one or more maps; and discontinuing the adding of new landmarks to the one or more maps at least partially in response to a determination that the density of landmarks is higher than a threshold; wherein determining and discontinuing are performed under the control of electronic hardware.

20050256713

10844093

1. A method of modeling a data generating process, said method comprising: observing a data sequence comprising irregularly sampled data; obtaining an observation sequence based on the observed data sequence; assigning a time index sequence to said data sequence; obtaining a hidden state sequence of said data sequence; and decoding said data sequence based on a combination of said time index sequence and said hidden state sequence to model said data sequence.

8583645

12016439

1. A computer implemented method of putting items into categories, the method comprising: (a) dividing a plurality of items of a data structure into a plurality of groups, wherein each group contains one or more items divided into that group; (b) performing a first ranking of one or more items within each group of the plurality of groups, such that each item has a set of befores and a set of afters, wherein the set of befores is a set of items ranked higher than an item, and the set of afters is a set of items ranked lower than an item; (c) selecting, according to a what-if scoring methodology, at least one best group from the plurality of groups for a subsequent ranking, wherein the what-if scoring methodology includes determining which items from the at least one best group will yield a maximum amount of new information upon performing the subsequent ranking; (d) performing, via processor execution, the subsequent ranking of the one or more items within the at least one best group; (e) cascading the befores and afters of the one or more items of the at least one best group according to the subsequent ranking, wherein each item of the one or more items inherits a set of afters from each other item ranked after that item and a set of befores from each other item ranked before that item; (f) determining which of the plurality of items are categorized, wherein an item is determined to be categorized when that item is in exactly one category; (g) removing each categorized item of the plurality of items from the data structure, wherein each removed categorized item is removed from further consideration; (h) in response to finding one or more invalid rankings of a subset of items: discarding the one or more invalid rankings of the subset of items of the plurality of items, wherein the one or more invalid rankings are associated with a particular source from a plurality of sources; and re-ranking the subset of items; and (i) repeating steps (c) through (g) until all of the plurality of items have been categorized.

7664774

11345593

1. A physical design tuning system, comprising: a processing unit; a storage media, comprising: an acquisition component that receives an input sequence of statements representative of a workload; a tuning component that utilizes a relative ordering to leverage between the statements in the sequence of statements to generate a recommendation, implementation of which minimizes execution costs associated with the sequence of statements, wherein the relative ordering defines a plurality of sub-sequences or single statement sets, the sequence alternates between the sub-sequences or statement sets, wherein the recommendation includes an output sequence of statements, the output sequence of statements including each statement of the input sequence of statements, at least one create statement, and at least one drop statement, wherein the at least one create statement creates one or more physical design structures and the at least one drop statement drops one or more of the physical design structures, wherein the at least one create statement and the at least one drop statement are interleaved with the statements from the input sequence of statements, and wherein the recommendation is a sequence derived from the sequence of statements and a sequence of configurations; an analysis component that identifies the sequence of configurations; and a pruning component that interacts with the analysis component, that produces a representation of a reduced directed acyclic graph with nodes for every statement representing configurations, and that determines an optimal sequence of configurations from the graph.

8306850

13187750

1. A method for directing an interaction with at least a first consumer, the method comprising the steps of: (a) providing a computer database comprising first information about plural consumers and second information about predetermined products, wherein the plural consumers include the first consumer, and wherein each of the plural consumers is associated with a current product mix comprising certain ones of the predetermined products independent of an association of another consumer with the predetermined products; (b) individually for each one of the plural consumers: (i) calculating, using a processor, an aggregate first Residual Life Time Value (“RLTV”) estimate from the time variable products in the current product mix for said one consumer; (ii) calculating, using a processor, an aggregate second RLTV estimate from the finite duration products in the current product mix for said one consumer; (iii) calculating, using a processor, an aggregate third RLTV estimate from the aggregate first RLTV estimate and from the aggregate second RLTV estimate; and (iv) calculating, using a processor, an aggregate Potential Life Time Value (“PLTV”) estimate from preselected products not in the current product mix for said one consumer; (c) analyzing a distribution of the aggregate third RLTV estimates for the plural consumers; (d) analyzing a distribution of the aggregate PLTV estimates for the plural consumers; (e) evaluating the first consumer as a function of the distribution of the third aggregate RLTV estimates and as a function of the distribution of the aggregate PLTV estimates; and (f) interacting with the first consumer based on said evaluation of the first consumer.

20020039216

09963514

1. A method of detecting switching subnodes in a monoblock wavelength division multiplex optical switching network, each subnode corresponding to a given level of granularity and to a given switching function, which method includes the following steps: (a) collecting information concerning how traffic is crossing the initial monoblock switching node; (b) defining the granularity and switching function of the subnodes to be detected; (c) considering each subnode successively in an order corresponding to reducing switching constraints; and (d) for each subnode, selecting all or part of the traffic of an incoming granularity and an outgoing granularity that satisfy the switching constraints of the subnode concerned.

7752577

11609895

1. A computer-implemented method for operating on a layout, comprising: using a computer which comprises at least one processor and is programmed for performing: using a design rule which comprises at least an image to identify a portion of said layout; applying at least one of a plurality of criteria to said portion of said layout; reporting said portion of said layout if said at least one of the plurality of criteria is satisfied by said portion of said layout; and storing the portion in a computer readable storage medium or a computer storage device or displaying the portion in a display device of the computer.

20040220771

10853499

1. A method of forecasting comprising: designating a last portion of time series data as a base pattern; searching a remaining portion of the time series data that precedes the base pattern for one or more candidate patterns using the base pattern; identifying one or more candidate forecasts corresponding to the one or more candidate patterns; and calculating a set of final forecast values based on the one or more candidate forecasts.

9226654

13457349

1. A method of analyzing an abnormality in the retinal layers of the eye, said method comprising: collecting three dimensional optical coherence tomography (OCT) intensity data of the retinal layers of the eye including the abnormality; segmenting the OCT intensity data to identify the boundaries of the abnormality; determining a first representative value associated with the identified abnormality; determining a second representative value associated with the identified abnormality, said first and second representative values being selected from the following characteristics of the identified abnormality: average intensity of the data within the boundaries of the abnormality; uniformity of the intensity of the data within the boundaries of the abnormality; shape of the abnormality; size of the abnormality; blood flow within the abnormality; and location of the abnormality; provided, however, that the characteristic selected for the first representative value is different from the characteristic selected for the second representative value; classifying the abnormality based on the first and second representative values using predetermined criteria; and displaying or storing the classification.

10140506

16008752

1. A method of identifying a human subject by gait recognition, the method comprising: obtaining a number of image frames of the human subject showing the human subject's walking style and storing the image frames in a memory, receiving by circuitry a gait sequence, the gait sequence including a predetermined number of the image frames of the human subject; processing by circuitry, the received gait sequence to generate a gait-energy-image (GEI), wherein the GEI is a sum of walking silhouette images divided by the number of images; computing by circuitry, a plurality of Gabor filter responses by convoluting the generated GEI with a bank of Gabor filters, the filter bank including a first predetermined number of unique scales, and a second predetermined number of unique orientations, partitioning by circuitry, each Gabor filter response of the computed plurality of Gabor filter responses, into a predetermined number of overlapping regions, wherein the partitioning is performed as a fraction of the height of the human subject and width of the human subject, and is denoted by horizontal and vertical lines; extracting by circuitry, a predetermined number of statistical features only from the overlapping regions, the extracted statistical features corresponding to texture content of the subject; and identifying by circuitry, the human subject based on a classification of the extracted statistical features.

20010044661

09727424

1. A method for optimizing in real-time operation of a machine assembly manipulated by a user, said machine assembly comprising plural replaceable devices, each device being operated by a control module, the input-output relationship of which control module is regulated by control parameters, said method comprising the steps of: (a) operating the replaceable devices using control modules; (b) optimizing in real-time the input-output relationship of at least one control module by coding into templates parameters fully or partially regulating the control module, said templates being subjected to heuristic processing, wherein at least one fitted set of parameters is selected by evaluating output of the machine assembly based on the user's ultimate choice or a preselected target; and (c) operating the machine assembly using the optimized control module.

8717437

13735703

1. A visual recognition method for identifying objects captured in a video stream having a captured time period, the method comprising: capturing a video stream on an electronic device having an image sensor, said video stream comprising a plurality of temporally adjacent images; enabling a user of the electronic device to select, from said video stream, a target object or scene for training; associating each frame in an image with a corresponding frame in temporally adjacent images, or in images taken from nearby vantage points; temporally aggregating statistics computed at one or more collections of temporally corresponding frames, into a descriptor; and ranking features according to their structural stability margin; wherein the structural stability margin is a limit or bounded range of variability acceptable from a nuisance factor.

8255351

12430166

1. A system for fault prediction in a home network, the system comprising: a processor and a memory, the memory haying stored thereon: a context generator for generating context information based on status data collected in real time about components of the home network; a specification interpreter for generating knowledge rules for fault detection by using specifications of the components of the home network; a context analyzer for analyzing if the generated context information meet the generated knowledge rules to classify the context information into normal situation contexts and abnormal situation contexts; a context pattern learner for generating new knowledge rules based on the abnormal situation contexts and fault rules corresponding to the abnormal situation contexts; a knowledge rule database for storing and managing the knowledge rules and the new knowledge rules; and a fault predictor for analyzing a correlation between the knowledge rules or the new knowledge rules and the generated context information, thereby predicting faults to be generated.

8276192

12130243

1. A method for security planning with access control policies, comprising: receiving descriptions of available external inputs and processing components, wherein a first processing component description identifies data receivable by the first processing component, a function the first processing component performs on the received data and data produced by the first processing component as a result of performing the function; receiving first security-related requirements and a desired output result of a first network to be developed using the available external input and processing component descriptions; and generating the first network according to the security-related requirements, wherein the first network satisfies access control policies and includes external inputs and processing components, wherein the processing components are configured such that the first network produces the desired output result, wherein to satisfy the access control policies, the following rules are adhered to: (1) each processing component of the first network cannot accept any data that require an access class higher than the component's access class and (2) each processing component of the first network must label all data it produces with a minimum access class equal to or higher than the component's access class, yet after review of the operation of the processing components, at least one of the processing components is authorized to violate rule (2) and assign lower access classes to its data without incurring a security risk, wherein generating the first network according to the security-related requirements further comprises: verifying access control policies for the external inputs and processing components in the first network, based on subject labels assigned to the processing components and object labels assigned to the external inputs.

8872832

12635929

1. A processor-implemented method for reducing error between motion capture sessions, comprising: receiving a first and a second set of measured points, the first set of measured points from a first motion capture session and associated with a first set of facial skin markers of a target model in a first facial animation sequence of the target model, the second set of measured points from a second motion capture session and associated with a second set of facial markers of the target model in a second facial animation sequence of the target model, wherein each measured point is associated with a three-dimensional coordinate triple; computing, by a computer system including a processor, an optimal affine transformation function for reducing error between the motion capture sessions, wherein the computing includes, selecting an unprocessed point from the first set of measured points, the unprocessed point being a point of the first set of measured points that has not been used to compute any affine transformation function to minimize an error, selecting two nearby neighboring points of the unprocessed point, computing, as part of aligning the first set of measured points with the second set of measured points to reduce error between the motion capture sessions, an affine transformation function that minimizes an L 2 -norm error, and identifying the optimal affine transformation function from a set of computed affine transformation functions; and generating, by the computer system and utilizing the optimal affine transformation function, a head motion animation sequence.

20170083797

15364222

1. A computer-implemented method to extract card information, comprising: performing, by the one or more computing devices, a classification algorithm on data encompassed by a first area, the first area being selected as a potential location of one or more digits on the image; and performing, by the one or more computing devices, an optical character recognition algorithm on areas of the card that are anticipated by the one or more computing devices as comprising digits based on the application of the card models and the identified lines based on a comparison of the image to one or more card models comprising digit distribution patterns of data displayed on the image.

20050066298

10666470

1. A system for determining criticality in an electrical circuit comprising: a. a netlist input for receiving a circuit netlist, the netlist representing a topology of the electrical circuit; b. an assertion input for receiving one or more assertions representing boundary timing conditions; c. a delay variability input for receiving a list of one or more sources of delay variation that contain variability information of one or more of the sources of delay variation; d. a model input for receiving a parameterized delay model, the parameterized delay model containing a model for the delay of each component of the electrical circuit, each model being a function of one or more of the sources of variation; and e. a process that determines and outputs timing criticality information of the electrical circuit.

20130073484

13239155

1. A method for managing memory in a processing system, comprising: allocating memory among a plurality of elements; configuring rules for each element, wherein at least some of the rules associated with a first type of element control updates to memory allocated to a second type of element; and providing a system clock defining a step interval during which certain of the rules are executed, wherein execution of the certain rules for two or more elements of the same type is order-independent during the step interval, wherein the plurality of elements are interconnected according to a graph representative of a neuronal network.

6137909

08502741

1. A system for automatic pattern classification by ranking features within a feature set using a computer readable memory and processing capabilities, said system comprising: a feature extractor, connected to receive a plurality of exemplars, for producing an n-element feature vector for each one of said plurality of exemplars, said n-element feature vectors comprising a design set; a training set compiler, connected to receive said design set, for creating a training set; a projection space processor, connected to receive said training set created by said training set compiler, for generating a reduced feature space for said training set; and a Procrustes feature ranking processor, connected to receive reduced feature space, for determining a Procrustes angle for each feature in said feature set, wherein said Procrustes angle is the angle between said feature and its projection onto said reduced feature space, and for linearly ranking said features in increasing numerical size of their respective Procrustes angle, wherein said linearly ranked features comprise a ranked feature set.

20050021452

10795541

1. A method for calculating the financial status of a company, comprising the steps of: calculating the company's value in accordance with the formula d ⁢ ⁢ V V = ( r + λ ) ⁢ ⁢ d ⁢ ⁢ t + σ ⁢ ⁢ d ⁢ ⁢ W - d ⁢ ⁢ N wherein V is the value of the company, r is the risk neutral rate, λ is the intensity of jump arrivals, σ is the company's volatility, N) is the standard Poisson process, W is the standard Wiener process, and t is a time between 0 and T, the maturity of the debt; and using the company value to calculate a financial metric for the company.

20070282768

11420879

1. An artificial intelligence system, comprising: a data partitioner receives first set of plurality types of data, wherein the data partitioner partitions the first set of data and groups the partitioned data into plurality of data files, and wherein the data partitioner generates indices according to the first set of data; a data modeler receives second set of plurality types of data, wherein the data modeler generates plurality of models according to the first set of data and the second set of data.

20140279957

14203472

1. A system, comprising: a storage component having a graph database; a graph editor component coupled to the storage component that selects a graph, selects a view of the graph and configures the view of the graph; and the graph editor component configured to browse information in the view of the graph using a tabular navigation element, configured to remove redundancy from the view of the graph in the tabular navigation element and configured to change information in the graph using the view.

9721114

14834864

1. A system for automatic folder ownership assignment in an enterprise computer network, the system comprising at least one computer processor and one memory implementing the following functionalities: sensitive content scrutinizing functionality operative for ascertaining which first folders, among a first multiplicity of folders in an enterprise computer network, comprise at least sensitive content, and adding said first folders to a list of base-folder candidates for ownership assignment; first pruning functionality operative for defining a second multiplicity of folders, said second multiplicity of folders being a subset of said first multiplicity of folders which subset does not include said first folders, all descendants of said first folders and all ancestors of said first folders; access permissions scrutinizing functionality operative for ascertaining which second folders among said second multiplicity of folders, have permissions to entities other than IT administration entities and for adding said second folders to said list of base-folder candidates for ownership assignment; second pruning functionality operative for defining a third multiplicity of folders, said third multiplicity of folders being a subset of said second multiplicity of folders, which subset does not include said second folders, all descendants of said second folders and all ancestors of said second folders; topmost folder scrutinizing functionality operative for ascertaining which third folders among said third multiplicity of folders are topmost folders and for adding said third folders to said list of base-folder candidates for ownership assignment; and possible ownership assignment recommendation functionality operative for recommending possible assignment of ownership of at least one of said list of base-folder candidates.

20110257896

12986986

1. A method of differentially filtering genetic data, which comprises: providing a visual display device; providing a computer connected to the visual display device with genetic data, wherein the computer comprises a computer program capable of visually displaying the data to a user on the visual display device; providing a user with an input interface via the computer; selecting a subset of genetic data designated as one or more CytoRegions; entering a first set of parameters into the computer program pertaining to the CytoRegions; differentially filtering the subset of genetic data; and distinguishably displaying the genetic data which are encompassed by the entered parameters.

20060064661

10946677

1. A method of creating a circuit layout based on a plurality of constraints and at least one objective, comprising the steps of: (a) constructing a Boolean satisfiability problem containing a plurality of constraints and at least one objective; (b) determining if said at least one objective renders said Boolean satisfiability problem unsatisfiable; (c) if said at least one objective renders said Boolean satisfiability problem unsatisfiable, removing said at least one objective so as to form a reduced Boolean satisfiability problem; and (d) creating a circuit layout as a function of said reduced Boolean satisfiability problem.

20150180729

14133649

1. A computer implemented method for distributed application integration, executing on a processor, the method comprising: identifying a composed on-demand application for a user, the composed on-demand application comprising a plurality of deployed applications running in a plurality of data centers; deriving, using the processor, virtual geo-distances of the plurality of data centers from a data center map for integration of the plurality of deployed applications; and based on the derived virtual geo-distances, adjusting the configuration of the plurality of deployed applications that affect data latency of the plurality of deployed applications.

9261467

13918215

1. A non-transitory computer readable storage medium having stored thereon a computer program comprising instructions, which, when executed by a computer, cause the computer to: acquire projection data from a scanned object, the set of projection data comprising a plurality of projection measurements; calculate a set of modified statistical weights from the projection data, wherein a respective modified statistical weight of the set of modified statistical weights comprises a deviation from an inverse variance of a corresponding projection measurement of the projection data; and reconstruct an image of the scanned object using the set of modified statistical weights as coefficients in an iterative reconstruction algorithm; wherein the instructions further cause the computer to: define a set of conventional statistical weights from the plurality of projection measurements, wherein a respective conventional statistical weight of the set of conventional statistical weights comprises an inverse variance of a respective projection measurement of the plurality of projection measurements; and apply a nonlinear transformation function to the set of conventional statistical weights to generate the set of modified statistical weights.

10152564

14491838

1. A method for operation of a building information modeling (BIM) system, comprising: at a BIM server, generating a network accessible graphical user interface (GUI) simultaneously displaying a 3-dimensional rendering of a building model, a hierarchical structure of building model data, and a Construction Operations Building Information Exchange (COBie) spreadsheet, where the building model, the hierarchical structure of building model data, and the COBie spreadsheet are associatively linked; sending, from the BIM server, the 3-dimensional rendering of the building model, the hierarchical structure of building model data, and the COBie spreadsheet to a first client computing device; sending, from the BIM server, the 3-dimensional rendering of the building model, the hierarchical structure of building model data, and the COBie spreadsheet to a second client computing device without reloading the 3-dimensional rendering of the building model in memory at the BIM server and while maintaining a shared data session between the BIM server and the first and second client computing devices-where instances of the network accessible GUI are accessed by the first and second client computing devices over a network; at the BIM server, receiving a punch list image associated with an object in the hierarchical structure of building model data from a third mobile client computing device and storing the punch list image in a database; and associating, at the BIM server, the punch list image with the COBie spreadsheet and the 3-dimensional rendering of the building model by linking the punch list image with the data structures in the COBie spreadsheet, and the 3-dimensional rendering of the building model in response to receiving the punch list image.

8718944

12125366

1. A method for determining cardiac status, comprising: for a given patient, a) using a computer-based modeler, constructing a patient-specific, three-dimensional, computational model of the patient's heart, the model including fluid-structure interactions and right ventricle, left ventricle, and patch and scar tissues of the patient's heart, wherein the fluid-structure interactions include deformation of the patient's heart and are represented by a system of differential equations for solid mechanics and fluid mechanics; by a processor, executing the constructed computational model, said executing generating a quantitative analysis of cardiac function, including assessment of ventricle volume based on a patient-specific simulation which simulates heart expansion and contraction by solving the differential equations, wherein the patient-specific simulation is based on ventricle pressure measured in the patient and includes mechanical stress/strain, flow velocity, shear stress and pressure; and validating by the processor the model with pre-operative patient-specific data, including the measured ventricle pressure, prior to assessing surgical options to establish a validated model useable for surgical design, the processor outputting to a user results of the generated quantitative analysis.

20020099982

09726283

1. A method for characterizing average performance in a data processing system, comprising: adding a meta-tool level variable to a verification tool; finding the image of an initial state variable; dividing the image into a frontier and a set of previously reached states; ignoring the previously reached states; finding the image of the frontier; and repeating the previous three steps until the frontier is empty.

20130243422

13896544

1. A method for estimating a chromatic dispersion of a received optical signal, the method comprising: scanning the received optical signal (R x (f)) through a number (M) of chromatic dispersion compensation filters in a chromatic dispersion filter range (D min. .. D max ) between a first chromatic dispersion value (D min ) and a second chromatic dispersion value (D max ) with a resolution (ΔD) determined by the chromatic dispersion filter range (D min. .. D max ) normalized by the number (M) of chromatic dispersion compensation filters to obtain filtered samples (R x, D (f)) of the received optical signal (R x (f)); and determining a correlation function (C D (τ,B)) indicating an estimate of the chromatic dispersion by correlating the filtered samples (R x, D (f)) of the received optical signal with respect to frequency shifts (τ) over a correlation bandwidth (B), wherein the correlation bandwidth (B), the chromatic dispersion filter range (D min. .. D max ) and the resolution (ΔD) are iteratively adapted according to an optimization criterion.

20030172065

10113901

1. A computer-implemented system for analyzing relatedness comprising: an expandable database for storing a plurality of hierarchical trees; a first user interface for creating a plurality of data fields within at least one tree of said plurality of hierarchical trees; a second user interface for adding genetic data to at least one data field of said plurality of data fields; analytical programming for relating and alterably categorizing each data field of said plurality of data fields; executable programming for describing a genetic pattern for a first tree of said plurality of hierarchical trees; means for correlating said genetic pattern with a genetic pattern for at least a second tree of said plurality of hierarchical trees; and executable programming for predicting an antecedent genetic pattern in said first tree.

20040210500

10655503

1. An apparatus for portfolio management and risk-analysis, comprising: a risk model comprising a mechanism for at least one of: building customized risk analyses and reports, covering multiple asset classes and markets; organizing and categorizing assets along dimensions best reflecting a user's investment process; determining risk assumed; determining sources of risk; viewing a portfolio's risk exposures; identifying and quantifying sources of volatility; providing risk reporting; and providing a trade scenario utility; a data base; and a secure, Web-based, interactive, N-layer, shared object framework for temporary data storage, process coordination, synchronous state management, and notification comprising a set of objects that reside in a conceptual space.

20100171837

12728467

1. A method for setting a camera for image capture, said method comprising the steps of: capturing an initial set of two or more evaluation images; assessing a plurality of characteristics of said initial set of evaluation images to provide a first assessment, said characteristics including subject motion vectors between at least two of said initial set of evaluation images; when said subject motion vectors are in excess of a predetermined threshold, setting a final capture state of said camera responsive to said first assessment; when said subject motion vectors are less than said predetermined threshold: (a) capturing one or more additional evaluation images after said capturing of said initial set of evaluation images; (b) determining said characteristics of said additional one or more images to provide a second assessment; (c) analyzing both said assessments; and (d) setting said final capture state of said camera responsive to said analyzing.

20040138862

10695899

1 ) A method for forming more rapidly a stochastic numerical model of Gaussian or related type representative of the distribution of a physical quantity in a porous heterogeneous medium, calibrated in relation to dynamic data obtained by measurements performed in the medium or previous observations, and characteristic of the displacement of fluids therein, comprising an iterative process of gradual deformation wherein an initial realization (y) of at least part of the medium is linearly combined, upon each iteration, with at least a second realization independent of the initial realization, the coefficients (&agr; i ) of this linear combination being such that the sum of their squares is 1, and an objective function (J) measuring the difference between a set of non-linear data deduced from said combination by means of a flow simulator and said geologic and dynamic data is minimized by adjusting the coefficients of the combination, the iterative process being repeated until an optimum realization of the stochastic model is obtained, characterized in that the rate of gradual deformation to the optimum model representative of the medium is accelerated by selecting as the second realization to be combined with the initial realization at least one composite realization obtained by selecting beforehand a direction of descent defined as a function of the gradients of the objective function in relation to all the components of said initial realization (y).

20090164176

12300314

1. A method of producing a finite-element model of a unique body of complex shape having an outer surface that is known in the form of a cloud of points describing said surface analytically or algebraically in a determined frame of reference, comprising the steps of: a) using a generic and parameterizable finite-element model, the model being made up of simple geometrical volumes that are representative of the family to which the unique body belongs; b) adapting the model as a function of parameters describing the unique body that is to be modeled; c) within the frame of reference, adjusting the position and/or the parameterization of the generic finite-element model and causing the surface nodes of the parameterized model to correspond with points of the known outer surface of the body by projecting said nodes onto said surface along a direction that is normal to the surface of the generic model; and d) using the nodes of the surface as control points in a three-dimensional interpolation method in order to personalize the internal finite elements of the generic model.

20160269700

14759234

1. A color grading monitor with LUT mapping function, for performing LUT mapping to an input image, characterized in that the color grading monitor comprises an LUT storing unit, and further comprises: a receiving module, configured for receiving at least one LUT data or generating LUT data in a specific format according to received operation; an analysis module, configured for analyzing that whether the LUT data meets a predetermined condition, if the LUT data meets the predetermined condition, the received data is updated in the LUT storing unit for a new LUT mapping; if the LUT data does not meet the predetermined condition, the LUT data is discarded; and a display module, configured for displaying the input image which is updated with the new LUT mapping according to the analysis result from the analysis module.

8566276

12544082

1. A network device comprising: a ternary content addressable memory (TCAM) programmed to include entries representing a plurality of prefix tree (trie) data structures used in processing network traffic received by the network device; logic to determine a first entry for insertion in the TCAM; logic to determine a first location of a second stored entry and a first location of a third stored entry; logic to determine if an empty space exists between the second stored entry and the third stored entry; logic to insert the first entry in the TCAM when the empty space exists; logic to push, when the empty space does not exist, the second stored entry from the first location of the second stored entry to a second location; logic to insert the first entry in the TCAM, based on pushing the second stored entry from the first location of the second stored entry to the second location and when the empty space exists after pushing the second stored entry; logic to push, when the empty space does not exist after pushing the second stored entry, the third stored entry from the first location of the third stored entry to a third location; logic to insert the first entry in the TCAM, based on pushing the third stored entry from the first location of the third stored entry to the third location and when the empty space exists after pushing the third stored entry; and logic to insert the first entry in the TCAM, when the empty space does not exist after pushing the third stored entry, based on a defragmentation operation performed on the TCAM in which a candidate entry having a relocation weight is chosen to be relocated as part of the defragmentation operation, the relocation weight being determined based on trie depths corresponding to entries that occupy the candidate entry before defragmentation.

8693752

13354786

1. A method of assessing uncertainty of features in images rendered in a medical visualization system, comprising: accepting user input on a display to selectively apply at least one sensitivity lens to a region of interest (ROI) of a portion of a visualization of a rendered image shown on the display; and electronically displaying different visualizations of only the portion of the image associated with the sensitivity lens to assess uncertainty of at least one feature in the image, wherein the displaying step is carried out by displaying the different visualizations of only the portion of the image associated with the sensitivity in at least one animation mode that generates a sequence or series of alternate visualizations based on known potential sources of uncertainty in a medical imaging pipeline.

8533787

13106023

1. A system for automatic folder ownership assignment in an enterprise computer network, the system comprising at least one computer processor and one memory implementing the following functionalities: modify/write permissions scrutinizing functionality operative for ascertaining which first folders, among a first multiplicity of folders in an enterprise computer network, have at least one of modify and write permissions to entities other than IT administration entities, and adding said first folders to a list of base-folder candidates for ownership assignment; first pruning functionality operative for defining a second multiplicity of folders, said second multiplicity of folders being a subset of said first multiplicity of folders which does not include said first folders, all descendents of said first folders and all ancestors of said first folders; permissions scrutinizing functionality operative for ascertaining which second folders among said second multiplicity of folders, have permissions to entities other than IT administration entities and adding said second folders to said list of base-folder candidates for ownership assignment; second pruning functionality operative for defining a third multiplicity of folders, said third multiplicity of folders being a subset of said second multiplicity of folders which does not include said second folders, all descendents of said second folders and all ancestors of said second folders; topmost folder scrutinizing functionality operative for ascertaining which third folders among said third multiplicity of folders are identified as topmost folders in a tree and adding said third folders to said list of base-folder candidates for ownership assignment; and possible ownership assignment recommendation functionality operative for recommending possible assignment of ownership of at least one of said list of base-folder candidates.

20080181469

11986122

1. A method of extracting ridge and valley lines from three-dimensional point data, the method comprising the steps of: (a) receiving point data input from a three-dimensional range scanning system; (b) estimating a normal vector by analyzing localized neighborhood information of each point from the received point data; (c) creating an approximation of a moving least squares (MLS) surface of points with regard to each point of the received point data and the estimated normal vector thereof; (d) obtaining connection information on each point from the MLS surface of points; (e) measuring a curvature value and a curvature derivative regarding each point on the MLS surface of points to obtain a curvature direction; (f) extracting ridge and valley points by measuring zero-crossing of the connection information; and (g) creating ridge and valley lines by connecting the ridge and valley points in the curvature direction.