doc_id
stringlengths 7
11
| appl_id
stringlengths 8
8
| flag_patent
int64 0
1
| claim_one
stringlengths 13
18.4k
|
|---|---|---|---|
8849575 | 11429628 | 1 | 1. A method of defining a library of biological molecules, the method comprising: (a) receiving an original set of data points representing activity and sequence of multiple biological molecules in a training set, wherein the activity of the multiple biological molecules was obtained in vitro; (b) constructing a bootstrap set of data points by computationally selecting said bootstrap set of data points from the original set of data points; (c) generating a sequence activity model from the bootstrap set, wherein the sequence activity model comprises a plurality of terms, the terms are separated by plus or minus signs, and each of the terms comprises the product of a coefficient and a bit-value independent variable, wherein the coefficient indicates the relative impact on activity by the bit-value independent variable, and wherein the bit-value independent variable specifies the presence or absence of only one particular residue or codon of a specific type at a specific sequence position; (d) repeating (b) and (c) multiple times to generate multiple models, each of the multiple models providing one of multiple values for each coefficient; (e) for each coefficient, determining (i) an average or mean value of the multiple values and (ii) a statistical indication of the distribution of the multiple values; and (f) toggling particular residues or codons based on their respective values of (i) and (ii) determined in (e) to thereby define the library of biological molecules, wherein operations (a)-(f) are performed by executing instructions on a computer system programmed to perform said operations. |
20140149065 | 13685095 | 0 | 1. A temperature detector comprising: a temperature sensor that obtains a temperature measurement; and a processor that adjusts the temperature measurement to establish more accurate detection of fever. |
8666862 | 13471325 | 1 | 1. A method of transforming and analyzing divided beneficiary interests in at least one trust to at least first and second beneficiaries, wherein the trust is described in data stored in non-transitory memory and the data comprises at least an identification and ownership of at least one trust asset and claims on the trust asset, the method comprising: using a first processor, accessing trust assets identification and ownership data in a non-transitory memory and constructing multiple complementary beneficiary portfolios that are adapted to portfolio analysis, including automatically mapping a hypothetical long position in an annuity for a first beneficiary portfolio and a complementary hypothetical short position in the annuity for a second beneficiary portfolio, whereby interests in the hypothetical long and complementary short positions have an expected payout and cost equal to the first and second beneficiaries' interests in the trust asset; and using a second processor, performing portfolio analysis on combinations of actual and hypothetical assets in at least one of the complementary beneficiary portfolios of the first and second beneficiaries, including accessing expected returns and risks of the actual and hypothetical assets, and producing a perceptible output summarizing results of the portfolio analysis. |
20170178184 | 14973622 | 0 | 1. A computer-implemented method comprising: storing, by an online system, a set of user profiles describing users of the online system, each user profile comprising one or more user attributes describing a user; receiving, by the online system, information identifying an input content item for sending to users of the online system; receiving a target audience criteria for selecting users for receiving the input content item, the target audience criteria mapping each of one or more user attributes to a set of values; identifying one or more content attributes describing the input content item; selecting a user attribute for determining a modified target audience criteria; determining a plurality of subsets of values of the selected user attribute, each subset of values associated with a set of users having a value from the subset of values for the selected user attribute; for each subset of users associated with a subset of values, determining a measure of interest of users of the subset of users in the input content item based on a match of user attributes of users of the subset with content attributes describing the input content item, wherein determining the measure of interest of users of the subset of users with the input content item comprises determining a value inversely related to the number of past interactions with a matching content item indicating a dislike towards the matching content item; selecting a subset of values based on the measure of interest of users of the subset of users associated with the subset of values; determining a modified target audience criteria based on the selected subset of values; and distributing the input content item to users selected based on the modified target audience criteria. |
20170185474 | 14980997 | 0 | 1. A method for recovering data transmitted to a terminal, the method comprising: selecting, by a processor of the terminal, a plurality of candidate frames expected to include the data, from a memory of the terminal, each of the plurality of candidate frames received by the terminal and comprising one or more errors; comparing, by the processor, corresponding values, for each of a plurality of bit sets, in the plurality of candidate frames, wherein specified fields of the plurality of candidate frames are excluded from comparison; and recovering, by the processor, the data based on the comparison. |
20120045793 | 13214406 | 0 | 1. An isolated polynucleotide having promoter activity comprising (a) a nucleotide sequence set forth in any of SEQ ID NOS:1-40; (b) a subsequence of (a) comprising at least 75 contiguous nucleotides set forth in any of SEQ ID NOS:1-40; (c) a nucleotide sequence having at least 90% sequence identity to (a) or (b); or (d) a nucleotide sequence that hybridizes to any of SEQ ID NOS:1-40, and/or the complement thereof. |
6148292 | 09115048 | 1 | 1. A method for statistics mode reloading and statistics acquisition according to statistics classes in storage of data in a postage meter machine which can communicate with a data center located remote from the postage meter machine, the method comprising the steps of: (a) operating said postage meter machine to conduct frankings and causing said postage meter machine to enter into a statistics mode wherein data associated with said frankings are stored in respective statistics classes; (b) forming freely selectable new statistics instruction data at said data center for a future statistics mode, said instruction data including instructions for forming new statistics classes and for pre-compression of statistics mode data; (c) establishing communication between said postage meter machine and said data center and transmitting said data in said statistics classes from said postage meter machine to said data center, and transmitting said new statistics instruction data from said data center to said postage meter machine; (d) transmitting an instruction from said data center to said postage meter machine to cause said postage meter machine to non-volatilely store said new statistics instruction data in said postage meter machine; and (e) operating said postage meter machine to conduct further frankings and causing said postage meter machine to enter into said statistics mode wherein data associated with said further frankings are pre-compressed, stored in respective statistics classes, and interpreted according to said new statistics instruction data. |
9218181 | 14471650 | 1 | 1. A processor-implemented method for automatically creating a software catalog content that includes a plurality of software components associated with a computing system, the method comprising: detecting, by a processor, a new release for a specific software product in a software catalog content manager that manages the plurality of software components associated with the computing system; creating a population comprising a plurality of potential software signatures associated with the plurality of software components based on the detection of the new release for the specific software product in the software catalog content manager, wherein the population comprising the potential software signatures includes a software version, a software release, a software name, and a registry entry; ranking the population comprising the potential software signatures based on a highest ratio value; selecting a set of parent software signatures based on the ranking; creating a new population of potential software signatures based on the selected set of parent software signatures; performing recombination on the new population of potential software signatures, wherein recombination is performed using a mutation operation; and predicting at least one potential software signature from the new population of potential software signatures based on a comparison between the performed recombination and the created new population of potential software signatures. |
20100008526 | 12090232 | 0 | 1. In a hearing aid with a library of signal processing algorithms F(Θ), where Θ is the algorithm parameter space, a method of automatic adjustment of at least one signal processing parameter θ∈Θ, comprising the steps of: recording an adjustment made by the user of the hearing aid, and modifying the automatic adjustment of the at least one signal processing parameter θ∈Θ in response to the recorded adjustment based on Bayesian incremental preference elicitation. |
20120084789 | 13236550 | 0 | 1. A computer-implemented method for optimizing a task graph that delineates a plurality of tasks to be evaluated in a parallel processing environment, the method comprising: generating a first aggregation topology associated with the task graph that divides the plurality of tasks into a first collection of sets, wherein each set in the first collection of sets includes one or more tasks from the plurality of tasks, and each task of the plurality of tasks belongs to only one set included in the first collection of sets; compiling the plurality of tasks according to the first task aggregation topology to generate units of work to be executed in the parallel processing environment; collecting statistics associated with executing the units of work in the parallel processing environment; and determining whether the first task aggregation topology is more efficient in execution than any previously-defined task aggregation topology based on the statistics; and if the task aggregation topology is more efficient in execution than any previously-defined task aggregation topology, then selecting the first task aggregation topology as the most optimal task aggregation topology, or if the first task aggregation topology is not more efficient in execution than any previously-defined task aggregation topology, then selecting a second task aggregation topology as the most optimal task aggregation topology. |
9245197 | 14383727 | 1 | 1. An image processing apparatus for processing an image including a plurality of areas which include a foreground area and a background area, comprising: a modification part configured to instruct modification of a portion of the image which is erroneously divided as a result of dividing predetermined image data into the foreground area being an extraction target and the background area being an out-of-extraction target; a model creation part configured to create a foreground model of the foreground area and a background model of the background area which are modified, based on first pixel values of a predetermined line segment where the modification is instructed and second pixel values of the foreground area and the background area which are divided; and a division part configured to divide the image data into the foreground area and the background area by using the foreground model and the background model which are created by the model creation part. |
20080022162 | 11480103 | 0 | 1. A method of calculating Signal to Noise Ratio (SNR) comprising: calculating a first SNR value for a received signal using a first SNR equation; comparing the first SNR value against a threshold value; calculating a second SNR value using a second SNR equation based on the result of the comparison; and utilizing the second SNR value to selectively modify operational parameters. |
20170351788 | 15174075 | 0 | 1. A computer-implemented method for verifying a design of an electronic circuit including a register, the method comprising: receiving specification information of a register, said specification information comprising information regarding the parts included in the register; automatically generating a register monitor module based on said received specification information, said register monitor module comprising a scoreboard for each part of the register, said scoreboard comprising an expected data value queue for receiving expected data values which are expected to be included in the respective part of the register and an actual data value queue for receiving actual data values actually included in the respective part of the register, the register monitor module further including a matching strategy for comparing expected data values with actual data values; calculating expected data values using a reference model of the electronic circuit and providing said expected data values to the expected data value queue of the respective scoreboard; calculating actual data values using a simulation environment simulating the electronic circuit and providing said actual data values to the actual data value queue of the respective scoreboard; comparing, for each scoreboard, the values of the expected data value queue with the values of the actual data value queue based on the matching strategy; and generating an error indication if the result of the comparison step does not fulfill the requirements specified in the matching strategy. |
9324241 | 14064094 | 1 | 1. A method of diagnosing Attention Deficit Hyperactivity Disorder (ADHD), comprising: providing a tangible-graphical interactive game with a patient, the tangible-graphical interactive game comprising providing at least four cubes, one being a mallet cube, and the others being object cubes on which the images of rabbit, birds, a groundskeeper or a gopher are selectively and electronically displayed, the game comprising a fixed period over which measurement data are recorded, the measurement data comprising the location of the object and mallet cubes, and further comprising the continuous location and orientation of the mallet cube; and wherein the object of the game is for a patient to strike the object cube displaying a gopher with the mallet cube, and if successful, sounding a bonk noise; playing the game in at least three sessions comprising three levels of increasing spatial distraction, the three sessions comprising: arranging the object cubes in a row having a first spacing and then playing the game in a first session and generating first measurement data; generating from the first measurement data from the first session using a predefined set of variables, a set of first measured metrics; arranging the object cubes in a diagonal having a first spacing and then playing the game in a second session and generating second measurement data; generating from the second measurement data from the second session using a predefined set of variables, a set of second measured metrics; arranging the object cubes in a diagonal having a second spacing greater than the first spacing and then playing the game in a third session and generating third measurement data; generating from the third measurement data from the third session using a predefined set of variables, a set of third measured metrics; generating from the first, second and third measured metrics a signal that indicates whether there is a likelihood that the patient has ADHD. |
20140286529 | 14176436 | 0 | 1. A method of tracking one or more worms, the method being implemented by a computer-based worm-tracking system and comprising: receiving, sequentially, a plurality of frames of a video containing one or more worms; displaying, sequentially on an electronic display, the plurality of frames of the video; calculating, substantially simultaneously with said displaying of the plurality of frames and sequentially from the plurality of frames, tracking information for one or more of the worms so as to create one or more tracked worms; and displaying, substantially simultaneously with said displaying of the plurality of frames on the electronic display, the tracking information overlaid onto the corresponding respective ones of the plurality of frames of the video. |
20150081565 | 14478650 | 0 | 1. A computer-implemented method for bringing offline data online, comprising the steps of: a. receiving from a match partner server a partner-encoded link, wherein the partner-encoded link is associated with a consumer using a consumer device and who has provided through the consumer device personally identifiable information (PII) at a match partner site; b. utilizing the partner-encoded link to determine an anonymous link from which the partner-encoded link was constructed; c. setting a marketing services provider (MSP) cookie on the consumer device, and correlating the anonymous link with an MSP cookie ID in a cross-reference table; d. receiving from a distribution partner server a distribution partner cookie ID and the MSP cookie ID for the consumer who is associated with the distribution partner cookie ID; e. correlating the distribution partner cookie ID with the anonymous link in the cross-reference table; f. receiving at a landing area in communication with an MSP server an extract file from a client database, wherein the extract file comprises a plurality of records pertaining to a group of consumers, and each record comprises client data and a consumer link associated with one of the group of consumers; g. calculating the anonymous link for the record associated with one of the group of consumers in the extract file based on the consumer link; and h. removing all PII from each record and moving each record to a secure storage area. |
20080165595 | 11620704 | 0 | 1. A method for operating a memory cell collection, the memory cell collection including a plurality of memory cells, each memory cell in the memory cell collection storing at least one possible binary values delimited by preset value ranges of a characteristic parameter, wherein the value ranges of the characteristic parameter shift over time, the method comprising: sensing a shifted value of the characteristic parameter for a target memory cell; sensing shifted values of the characteristic parameter for each memory cell in the memory cell collection; generating a probability distribution function of the characteristic parameter for each of the possible binary values from the shifted values of the characteristic parameter for each memory cell in the memory cell collection; for each of the possible binary values, determining a probability that the shifted value of the characteristic parameter for the target memory cell is within its probability distribution function; and converting the shifted value of the characteristic parameter for the target memory cell into a binary value for which the probability is highest. |
8838872 | 13354169 | 1 | 1. A library system comprising: a first sub-library possessing a first set of mobile data storage elements and a first robotic transporter; a second sub-library possessing a second set of mobile data storage elements and a second robotic transporter; a transport bridge connecting said first sub-library to said second sub-library; a computer processor programmed to control a strategy to redistribute a portion of said first set of mobile data storage elements from said first sub-library to said second sub-library, said strategy governed by a priority scheme whereby a host-initiated move instruction that requires use of one of said robotic transporters takes priority over any redistribution of said first portion and temporarily interrupts said redistribution scheme. |
9706925 | 14985200 | 1 | 1. A method of image analysis to produce a cardiovascular index, the method comprising: receiving vascular image data including: relative positions in one or more two-dimensional angiographic images of a plurality of vascular segments linked by branch points, and at least one lesion for which a respective lesion metric includes one or more of a cross-sectional area of a stenotic segment, a plaque strength, a plaque stress, and a size and/or position relative to the vascular segments; determining automatically a plurality of lesion-related vascular metrics for each of a plurality of said vascular segments, based on at least one angiographic image of said received image data; determining at least one subscore based on a function of said plurality of lesion-related vascular metrics, and on said position of the lesion within the vascular segments and relative to the branch points; determining a myocardial perfusion risk index based on said at least one subscore; and outputting said myocardial perfusion risk index to an electronic storage medium or display. |
20170031803 | 14813126 | 0 | 1. A method for determining a root cause of a performance issue of a software application executing in a distributed computer system, the distributed computer system including multiple components, the method comprising: constructing a hierarchical graph of metrics of a component of the distributed computer system based on search traces of the metrics of different users, where a parent-child edge between a first metric and a second metric in the hierarchical graph is constructed when there is a sequential association between the search traces of the first metric and the second metric for the different users, and where a sibling edge between the first metric and the second metric in the hierarchical graph is constructed when there is no sequential association between the search traces of the first metric and the second metric for the different users; and providing a metric investigation recommendation to address the performance issue based on traversal of the hierarchical graph of the metrics. |
8176004 | 11952050 | 1 | 1. A Web-based system for intelligent paperless document management, comprising, (a) at least one user account and at least one inbox, wherein said user account requires security sign-up and said at least one inbox accepts incoming documents; (b) at least one automatic indexing engine to automatically classify said incoming documents received by said inbox; wherein said at least one automatic indexing engine does not require barcodes or separators; (c) a repository to store documents classified by said at least one automatic indexing engine; and (d) a online collaborative portal; said online collaborative portal allows access of multiple users to documents in said repository; wherein said system automatically indexes and places documents in said repository, wherein said system does provide the capability of prearranging access levels according to functions of said multiple users; and wherein said system does prohibit a user from modifying or deleting a document in said repository. |
9697103 | 14813126 | 1 | 1. A method for determining a root cause of a performance issue of a software application executing in a distributed computer system, the distributed computer system including multiple components, the method comprising: presenting a dashboard to different users for monitoring the distributed computer system; parsing a plurality of uniform resource identifiers (URIs) from the dashboard to identify, for each specific user of the different users of the distributed computer system, a plurality of components of the distributed computer system under investigation, and a metric of each component under investigation listed as a parameter within each parsed URI, creating a separate search trace, for each search performed by a specific user of the different users, wherein each separate search trace links the identified metric of each component investigated by that specific user in a temporal order each component was investigated by that specific user during the search; constructing a hierarchical graph of metrics of a component of the distributed computer system based on the search traces of the metrics of the different users, where a parent-child edge between a first metric and a second metric in the hierarchical graph is constructed when there is a sequential temporal association between the search traces of the first metric and the second metric for the different users, and where a sibling edge between the first metric and the second metric in the hierarchical graph is constructed when there is no sequential temporal association between the search traces of the first metric and the second metric for the different users; traversing the hierarchical graph of metrics to identify a metric investigation recommendation to address the performance issue; and displaying on the dashboard to the user the metrics identified for recommendation. |
10031831 | 14694022 | 1 | 1. A method of monitoring performance regression comprising: recording one or more changes to a computing environment, wherein the computing environment includes at least one application, one or more jobs, and an operating system, and wherein recording one or more changes further comprises: periodically identifying and recording the changes; and determining one or more jobs impacted by the identified changes, wherein determining one or more jobs includes: determining that an identified change impacts a plurality of different jobs based on the identified change being associated with a shared object; identifying each job using the shared object as being impacted by the identified change; and identifying each job of the computing environment as being impacted by the identified change in response to the identified change being associated with the operating system; executing the at least one application in the computing environment and measuring one or more performance metrics; analyzing the measured performance metrics and detecting an operational performance regression; correlating the detected operational performance regression with one or more recorded changes, wherein correlating the detected operational performance regression further comprises: determining one or more jobs associated with the detected operational performance regression; and obtaining the changes impacting the determined jobs to correlate the changes with the detected performance regression; identifying a correlated change as a cause of the operational performance regression; and adjusting execution of the determined jobs and operational performance of the computing environment to remedy the detected performance regression by altering steps of the determined jobs causing the detected performance regression indicated by the identified changes. |
7716102 | 09522709 | 1 | 1. A computerized method for managing risk in a market related to electricity delivered over a network comprised of tradable network locations, comprising the steps of: (1) a computer modeling locational prices of electricity in the market as a linear combination of congestion prices for a plurality of congestible transmission lines in the network, wherein said step of modeling locational prices comprises: determining a set of distribution factors representing the physics of the flow of electricity in the network, determining a plurality of values representing the prices of congestion for the congestible transmission lines at a prospective time, and determining a pattern of spot locational prices in the network at the prospective time, wherein said pattern of spot locational prices is a function of said set of distribution factors and said plurality of values representing the prices of congestion for the congestible lines; (2) the computer creating a portfolio of future positions with respect to the set of distribution factors which includes: selecting a portfolio of price risk instruments which represent the set of distribution factors describing the physics of the flow of electricity in the network and the available market for the price instruments; and (3) the computer producing a combination of price risk instruments with respect to the set of distribution factors for the market in which an underlying position in the market is determined from: (a) the spot locational prices determined in step (1), and (b) the portfolio of future positions with respect to the set of distribution factors created in step (2), such that the difference between the underlying position in the market with respect to the set of distribution factors and the portfolio of future positions with respect to the set of distribution factors is calculated such that at least one amount of each of the price risk instruments are proportioned, thereby interlocking eventual locational prices and reducing an effect of the congestion prices for the plurality of congestible transmission lines on the locational prices of the electricity. |
8621477 | 12915140 | 1 | 1. A system for providing real time job resource monitoring of a computer system, comprising: one or more processors; a resource estimator executing on the one or more processors configured for analyzing input data of a job provided to the computer system and for estimating a total resource requirement representing adequate levels of processing resources in the computer system needed for successful execution of the job, the resource estimator further configured for obtaining a series of application performance benchmarks against the computer system, for determining a resource consumption rate of the job based on the application performance benchmarks, and for estimating a total amount of time required to execute the job on the computer system; a resource monitor executing on the one or more processors configured for monitoring adequate processing resources of the computer system throughout execution of the job within the computer system, by: measuring cumulative resource consumption for the job and available resource levels in the computer system; factoring remaining execution time from the total amount of time required to execute the job on the computer system; estimating future resource requirements of the execution of the job based on the remaining execution time, the total resource requirements of the job and the cumulative resource consumption for the job; and comparing the future resource requirements of the execution of the job with the available resource levels in the computer system that are projected to exist in the future to predict any resource deficiency; and a resource manager executing on the one or more processors configured for implementing one or more corrective actions to prevent failure of the job execution on the computer system responsive to prediction of a resource deficiency, wherein the resource monitor is further configured for monitoring adequate processing resources of the computer system at a predefined interval throughout execution of the job within the computer system, the predetermined interval correlating to one or both of the input data's size and the total resource requirements of the job. |
8627328 | 12618474 | 1 | 1. A system for deploying and managing software services, comprising: a computing environment that includes a plurality of virtualized and non-virtualized machines, which are organized into resource pools, wherein each of the resource pools includes a collection of virtualized resources; a plurality of software services, wherein each of the plurality of software services includes one or more software applications which are manageable as a unit and deployable to one of the resource pools; a plurality of agents, wherein each of the plurality of agents resides on one of the plurality of virtualized and non-virtualized machines, manages software applications and resources on the one of the plurality of virtualized and non-virtualized machines, and exposes the resources to the resource pools for use by the computing environment; a system controller that communicates with the plurality of agents to determine resources available on the plurality of virtualized and non-virtualized machines and to select a resource pool for deploying a software service, based on one or more of remaining capacity of the resource pool, dependencies of the software service, a service level agreement (SLA) of software services already deployed on the resource pool, and a priority for the software service; and a rules engine that compares administrator defined constraints with runtime metrics, wherein an administrator defined constraint is a user defined SLA that is captured a metric or state derived from meta data or other metrics and the runtime metrics are provided to the rules engine by a monitor service, and generates events when a constraint is violated by a metric of the runtime metrics, each event generated by the rules engine carries with it information necessary to handle the event including the scope of a constraint failure that caused the event. |
20040230506 | 10439570 | 0 | 1. A method of managing an information technology (“IT”) portfolio, comprising steps of: determining a plurality of criteria that are important to a target market for products in an IT portfolio, and at least one attribute that may be used for measuring each of the criteria; specifying objective measurements for each of the attributes; conducting an evaluation of one or more of the IT products in the portfolio, wherein the evaluation of each of the one or more IT products further comprises steps of: inspecting a representation of a selected one of the one or more IT products, with reference to selected ones of the attributes; assigning attribute values to the selected attributes, according to how the selected IT product compares to the specified objective measurements; and generating an assessment score, for the selected IT product, from the assigned attribute values; and comparing the generated assessment scores for each of the evaluated IT products to select a subset of the IT products in the IT portfolio, wherein the subset comprises those evaluated IT products having highest ones of the compared assessment scores. |
20100070319 | 12355584 | 0 | 1. An automated configuration management system (ACMS) for a virtualized ecosystem, comprising one or more modules configured to analyze data concerning security and compliance criteria of monitored resources of the virtualized ecosystem and to recommend configuration changes for resources of the virtualized ecosystem according to results of said analysis, the configuration changes including security control changes. |
20090076730 | 12280513 | 0 | 1. An automated method of adaptively modifying a seismic survey of a survey area to achieve survey goals within survey resource constraints, said survey resources including one or more seismic energy sources, said method comprising: (a) identifying survey goals for the survey area and survey resource constraints, selecting an initial set of acquisition parameters including source operating parameters, and selecting sensor type and location in the survey area for at least one adaptive feedback sensor; (b) assigning a value to each survey goal; (c) selecting a minimum acceptable survey value to define satisfying the survey goals; (d) activating the seismic energy sources in accordance with the selected acquisition parameter set; (e) collecting measurement data from the adaptive feedback sensors; and (f) comparing the sensor data or a quantity extracted therefrom with the survey goals as the survey progresses, and predicting a probability of satisfying the survey goals within the resource constraints; (g) if the probability of satisfying the survey goals falls at any time below a pre-selected minimum value, predicting the probability for at least one alternative set of acquisition parameters; (h) selecting a parameter set with a probability of satisfying the survey goals above the pre-selected minimum value, and returning to step (d); and (i) if no parameter set has a predicted probability of satisfying the survey goals above the pre-selected minimum value, displaying a notice to the effect that the survey cannot be completed within the resource constraints. |
20020163933 | 09985257 | 0 | 1. A method for a distributed medium access protocol that schedules transmission of different types of packets on a channel based on a service quality specification for each type of packet, comprising the steps of: determining at a plurality of nodes in the access network, an urgency class of pending packets according to a scheduling algorithm; and transmitting pending packets in a given urgency class before transmitting packets of a lower urgency class. |
20130325831 | 13485541 | 0 | 1. A method comprising: displaying query search results; and graphically depicting search query provenance related to the search results; said depicting comprising graphically according an investigative function to avail investigation of at least one aspect of the search query provenance. |
20170247667 | 15591816 | 0 | 1. A recombinant cytochrome P450-BM3 variant having at least 90% sequence identity to a polypeptide sequence comprising the sequence set forth in SEQ ID NOS:2, 4, 6, 8, 12, 14, or 16. |
8145976 | 12120483 | 1 | 1. A method comprising: receiving from a single, integrated memory, current and previous iterations of Log Likelihood Ratio (“LLR”) parameters for a current iteration of a Low-Density Parity-Check code (“LDPC code”) error-correcting process; performing an LDPC code error-correcting algorithm using the current and previous iterations of LLR parameters; overwriting the previous iteration of LLR parameters with a now-current iteration of LLR parameters and treating the current iteration of LLR parameters as a now-previous iteration of LLR parameters; after overwriting the previous iteration of LLR parameters, receiving both the now-current and the now-previous iterations of LLR parameters for the now-current iteration of the LDPC code error-correcting process from the single, integrated memory; and performing the LDPC code error-correcting algorithm using the now-current and the now-previous iterations of LLR parameters. |
7487077 | 11021511 | 1 | 1. In a graphical modeling environment, a method for modeling a delay in a time-based graphical representation of a control system, comprising: (a) providing, on an electronic device, a time-based graphical model of the control system that includes: at least one time-driven execution component modeling the control system, and at least one event-driven execution component modeling the delay induced in the control system; (b) receiving a time-based signal from the at least one time-driven execution component; (c) transforming the time-based signal to a set of entities using the electronic device, the set of entities being objects on which the at least one event-driven execution component operates; (d) passing the set of entities through the at least one event-driven execution component; (e) modeling the delay in the control system by delaying the passing of one or more entities in the set of entities through the at least one event-driven execution component; and outputting a result of modeling the delay on a display. |
20170235667 | 15585177 | 0 | 1. A computerized method of optimizing code of a software program by analyzing dominance relationships between a plurality of functions of the software program, the method comprising: receiving, at a computer including at least one processor and memory, a source code of a software program, the source code having a plurality of functions; identifying a plurality of intraprocedural dominator graphs each for another of the plurality of functions of the source code; combining, by the at least one processor, the plurality of intraprocedural dominator graphs to create a combined interprocedural dominance graph with edges that logically connect between nodes of the plurality of functions of the source code; identifying, by the at least one processor, a plurality of interprocedural dominance relations between nodes in different functions of the plurality of functions of the source code using the combined interprocedural dominance graph; computing a static single assignment (SSA) form based on the plurality of interprocedural dominance relations; performing an analysis of the received software program according to the plurality of interprocedural dominance relations; optimizing of the source code according to an outcome of said analysis by: making localized changes to one or more of the plurality of functions of the source code; identifying a group of functions from the plurality of functions, wherein members of the group are affected by the localized changes; re-computing an interprocedural dominator set for the group; and re-connecting only the nodes of the group. |
20090049565 | 12187502 | 0 | 1. A method of introgressing an allele into a soybean plant comprising: A) Providing a population of soybean plants, B) Genotyping at least one soybean plant in the population with respect to a soybean genomic nucleic acid marker selected from the group comprising SEQ ID NO: 81 through SEQ ID NO: 120, C) Selecting from the population at least one soybean plant comprising at least one allele associated with aphid resistance. |
20140136005 | 14021948 | 0 | 1. A computer system for use with a building management system in a building, comprising: a processing circuit configured to use historical data received from the building management system to automatically select a set of variables estimated to be significant to energy usage in the building; wherein the processing circuit is further configured to apply a regression analysis to the selected set of variables to generate a baseline model for predicting energy usage in the building. |
20140181102 | 14001984 | 0 | 1. A computer implemented method of identifying and ranking preferences regarding a plurality of options, for a group including two or more members, the method comprising: (a) obtaining from one or more data sources, preference information, including partial preference information, for the members, or a subset of the members, wherein the partial preference information may include a set of pairwise comparisons involving one or more of the options; (b) analyzing, by operation of one or more server computers, the pairwise comparisons so as to learn one or more statistical models for inferring and ranking a set of preferences based on the partial preference information; and (c) applying the one or more statistical models so as to identify the set of preferences and rank the options. |
8869053 | 13543042 | 1 | 1. A computer-implemented method comprising: causing a view engine in a portable electronic device, to obtain workforce information from a remote centralized storage medium, the workforce information relating to an absent employee and comprising employee-specific information selected from an employee preference; causing the view engine to display the workforce information on the portable electronic device to a user comprising a supervisor; causing the view engine to receive input from the user to change the workforce information; communicating updated workforce information reflecting an absence of the absent employee, from the portable electronic device to the remote centralized storage medium; in response to the updated workforce information, causing the view engine to receive from the remote centralized storage medium, a call list comprising contact information for an appropriate replacement employee based upon the employee preference; causing the portable electronic device to display the call list to the user; causing the view engine to provide an alert view for the user to create an alert identifying another supervisor based upon a conditional event comprising an unexpected presence at work of a replacement employee of the other supervisor indicated by a failure of the replacement employee to clock out; and causing the view engine to automatically send out the alert to the other supervisor based upon the updated workforce information satisfying the conditional event. |
6148274 | 08902319 | 1 | 1. A computer method for estimating a solution by successively improving solution vectors, the solution vectors being set for a problem having time sequential information, said computer method comprising the steps of: (a) inputting time sequential information associated with the operation of a target apparatus; (b) setting an initial set of solution vectors; (c) presenting said time sequential information expressed by each solution vector to a user; (d) receiving a value from the user which is indicative of an evaluation by the user of the suitability for solving the problem of each solution vector; (e) rearranging in accordance with each value received from the user the order in which the tine sequential information expressed by each solution vector are presented to the user; (f) calculating a fitness value of each solution vector based on the value received from the user; (g) performing an arithmetical genetic recombination operation on the solution vectors in the solution vector set based on the fitness value of each solution vector, thereby constructing a new solution vector set; and (h) adjusting the target apparatus operating on the time sequential information inputted in step (a) based on the solution, wherein step (c) through step (g) are iteratively performed until one of a number of iterations of steps (c) through (g) and the fitness value of one solution vector exceeds a predetermined threshold, thereby estimating the solution for the user. |
20080209374 | 11679831 | 0 | 1. A computerized method of decreasing processing time in multi-corner static timing analysis, the method comprising: determining an n number of dependent parameters (P i ), each dependent parameter (P i ) having an impact on variability of timing; ensuring the n number of dependent parameters (P i ) are organized in a decreasing parameter order from a first parameter P 1 having a largest impact on variability of timing to a last parameter P n having a smallest impact on variability on timing; and performing a multi-corner timing analysis by utilizing the decreasing parameter order to output an indication of timing verification for one or more paths of an integrated circuit design. |
20090216860 | 12274243 | 0 | 1. A method for communicating event information, comprising the steps of: storing at a first server at least one parameter for each of a plurality of indications and warnings associated with an event; identifying at least one information source at a second server comprising downloadable data; downloading the data at the end of a predetermined time period; filtering the downloaded data at the first server to identify a subset of the data comprising the at least one parameter; storing an event report comprising a descriptive summary of the subset of the data and a first scale value selected from a range of scale values for describing a severity of the event; and providing at least a portion of the event report over a communications network. |
20100239154 | 12731032 | 0 | 1. An information processing apparatus for selecting, from a plurality of feature amounts that are extracted from input data items, feature amounts that are to be used to classify the input data items, the information processing apparatus comprising: generating means for generating a plurality of combinations by generating combinations of feature amounts that are selected from the plurality of feature amounts; first calculating means for calculating, for each of the plurality of combinations, a first evaluation value for evaluating a suitability for classification of the input data items; and second calculating means for obtaining, on the basis of the first evaluation values, for each of the plurality of feature amounts, a second evaluation value for evaluating a suitability for classification of the input data items. |
20050228666 | 10332652 | 0 | 1. A method comprising: training a set of multiple mixture monophone models using a set of monophone transcripts to generate a set of multiple mixture context independent models; training a set of single mixture triphone models using set of triphone transcripts to generate a set of context dependent models; and estimating parameters of the context dependent models using a data dependent maximum a posteriori (MAP) adaptation method wherein parameters of tied states of the context dependent models are derived by adapting corresponding parameters of the context independent models through MAP adaptation method using training data associated with the corresponding tied states. |
20160011959 | 14327483 | 0 | 1. A method comprising: determining sequence-execution constraints that constrain execution orders of a plurality of events of an event-driven software application; determining sequence-position constraints that constrain positions of the plurality of events in one or more possible event sequences of the plurality of events; determining event-relation constraints that each indicates a relationship between an event input and an event output of each of the plurality of events; forming a constraint set that enumerates the one or more possible event sequences and that includes the sequence-execution constraints, the sequence-position constraints, and the event-relation constraints; and encoding control flow information of the one or more possible event sequences into the constraint set. |
20110066490 | 12558263 | 0 | 1. A method implemented in a computer infrastructure having computer executable code tangibly embodied on a computer readable storage medium having programming instructions operable to: generate a test model based on at least one of test group dependencies and test group constraints; generate a resource base; generate a cost model; and generate a resource allocation plan based on the test model, the resource base, and the cost model. |
9058387 | 11113808 | 1 | 1. A computer-implemented method of a forum for an adversarial discussion, the method comprising: accepting a first statement from a topic author, wherein the first statement is labeled as an assumption statement on a first computer, creating a topic layout based on file first statement on the first computer, the topic layout representing the basis for an adversarial discussion; allowing the topic author to add one or more secondary statements on the first computer, wherein a secondary statement can support the first statement, and if the first statement is an assumption statement, then relabeling the first statement from an assumption statement to a conclusion statement; enabling a plurality of users using a plurality of computer users to independently critique the first statement or the one or more secondary statements and enabling the topic author to rebut said critiques wherein revisioning is required upon a limited structure thereby preventing digression wherein every critique is made against only a single said statement of the original topic; allowing the topic author to create said topic layout on the first computer wherein the topic layout displays in a visual tree structure the explicit relationships among the one or more secondary statements and the first statement, thereby enabling adversarial online discussions without a moderator and facilitating the plurality of users and the topic author to succinctly define th0ir own positions, and wherein the first computer and the plurality of computers communicate over a network; and displaying one or more statements of disagreement by the plurality of users and excluding from view a plurality of extraneous earlier revisions of statements by the plurality of users made in identifying the one or more statements of disagreement, thereby allowing said plurality of computer users to make a contribution to the discussion that can not be hidden by repetitive rebuttals, therefore decreasing a noise-to-content ratio while automatically restricting the display depth of all content to a maximum of 3 levels, topic statement, critique and rebuttal and since said statements of disagreement are made on the fixed said topic each user can fully contribute to the discussion without having their contribution hidden as happens in time based messaging systems. |
20140219335 | 14130541 | 0 | 1. A video decoding method comprising: extracting syntax elements of a picture encoded based on data units having a hierarchical structure by parsing an encoded bitstream; determining a context model used to entropy decode a first syntax element of a current data unit to be entropy-decoded based on at least one second syntax element of the current data unit, wherein the at least one second syntax element is usable and different from the first syntax element of the current data unit; and entropy decoding the first syntax element by using the determined context model. |
20100241430 | 12793181 | 0 | 1. A method of generating a language model using non-speech metadata, the method comprising: applying a tree growing algorithm to highly fragmented non-speech metadata associated with a caller to a spoken dialog system but which does not describe physical characteristics of the caller; identifying projections based on the highly fragmented non-speech metadata and leaf nodes in which a history appears as a result of applying the tree growing algorithm to yield identified projections; and estimating a conditional, metadata dependent language model based on the identified projections and speech data from the caller. |
20060167704 | 10538225 | 0 | 1. A computer system for managing data relating to the performance of an enterprise, comprising: a plurality of terminals each having a user interface for displaying data to a business person of the enterprise; a communications network to which said terminals are connected; and a database storing a database of historical data comprising values of each of a plurality of indicators at a plurality of points in time, said indicators including raw data; and at least one computer configured to receive real-time events comprising new values of a plurality of said indicators comprising new raw data from one or more external sources, and configured to combine the new raw data with selected historical business data from said database to calculate at least one value of a metric therefrom, so as to provide real-time event-driven values of the metrics. |
8099424 | 12048194 | 1 | 1. A computer based method for determining a treatment for an illness associated with an individual by identifying modifiable attributes of that individual, said computer including a data input device, a processor, a memory, and an output device, the method comprising: a) receiving a query into said processor that is representative of an illness associated with an individual; b) accessing in said memory an attribute profile associated with the individual, the attribute profile comprising pangenetic and non-pangenetic attributes; c) accessing a database in said memory containing a set of attribute combinations associated with successful treatment of the illness, each attribute combination containing at least one pangenetic attribute, the database also containing corresponding statistical results which indicate the strength of association of each of the attribute combinations with successful treatment of the illness; d) determining one or more treatments for the individual based on at least one comparison of the attribute profile with the set of attribute combinations, i) rank-ordering the attribute combinations based on the at least one comparison and the corresponding statistical results; ii) identifying one or more of the attribute combinations that meet a predetermined threshold applied to rank; and iii) selecting one or more modifiable attributes from at least one of the identified attribute combinations that meet the predetermined threshold applied to rank to determine one or more treatments for the individual, wherein the one or more modifiable attributes do not occur in the attribute profile of the individual; and e) transmitting the determination as output through said output device, wherein the determination transmitted as output comprises one or more modifiable attributes associated with a corresponding potential for successful treatment of the illness that is greater than or equal to a user specified threshold. |
9824319 | 14601838 | 1 | 1. A system, comprising: a processor; and a memory communicatively coupled to the processor, the memory having stored therein computer-executable instructions, comprising: a plurality of scheduler engines, respectively having different look-ahead periods, configured to generate respective schedules that forecast availability of at least one energy source employed in generation of electrical power in a power grid; and an energy system tool configured to: generate a comprehensive operating plan that merges the respective schedules generated by the plurality of scheduler engines, dispatch at least one resource of the power grid according to the comprehensive operating plan to generate the electrical power in the power grid using the at least one energy source, and trigger an update of the comprehensive operating plan in response to at least one of a minimum uptime or minimum downtime associated with the at least one resource being determined to have been reached. |
6102961 | 09323174 | 1 | 1. A method for determining a group of IP Blocks from a first plurality of IP Blocks to incorporate into a circuit design, the method comprising: determining a circuit architecture to be implemented by the circuit design; determining an architecture profile for implementing the circuit architecture; determining a first design profile for designing the circuit architecture with a first group of IP Blocks from the first plurality of IP Blocks, and a second design profile for designing the circuit architecture with a second group of IP Blocks from the first plurality of IP Blocks; determining a first integration profile for implementing a first implementation of the circuit architecture with the first group of IP Blocks, and a second integration profile for implementing a second implementation of the circuit architecture with the second group of IP Blocks; determining a first verification profile for verifying the first implementation of the circuit architecture, and a second verification profile for verifying the second implementation of the circuit architecture; determining a first technical profile for the circuit architecture with the first implementation in response to the architecture profile, to the first design profile, the first integration profile and the first verification profile; determining a second technical profile for the circuit architecture with the second implementation in response to the architecture profile, the second design profile, the second integration profile and the second verification profile; and selecting one of said first and said second groups of IP blocks as the group of IP blocks. |
20050204889 | 11084084 | 0 | 1. A portable electronic sheet music device for transporting, storing, displaying, and annotating music scores, comprising: a) a housing; b) a display; c) a processor; d) an internal memory; and e) an external memory medium interface; wherein said processor is contained in said housing; wherein said internal memory is contained in said housing; wherein said external memory medium interface is accessible through said housing; wherein said display is disposed on said housing; wherein said display is a touch-sensitive display; wherein said internal memory is operatively connected to said processor; wherein said touch-sensitive display is operatively connected to said processor; wherein said external memory medium interface is operatively connected to said processor; and wherein said external memory medium interface is for operatively connecting to an external memory medium that has encoded thereon music scores and corresponding titles that are displayed electronically as sheet music on said touch-sensitive display following operative connection of the external memory medium to said external memory medium interface and selection of a title. |
20130311468 | 13877576 | 0 | 1. A method for changing a pattern in data according to at least one data model (DM 1 , DM 2 ), said data being grouped in a data base DDE) according to entity, the method being performed in a pattern processing node ( 21 ) of a data collection system ( 10 ) and comprising the steps of: obtaining ( 66 ) an existing pattern (P 1 ) of historical data according to at least one existing data model (DM 1 ), said existing pattern relating to an entity ( 11 ) associated with the data collection system, obtaining ( 68 ) a further pattern (P 2 ) of newer data according to a further data model (DM 2 ), said further pattern also relating to said entity, comparing ( 70 ) the above patterns with each other, determining ( 72 ) if the existing data model can be mapped on the further data model based on the comparison, and updating ( 76 ) the existing pattern with the further pattern in relation to the historical data if the existing data model can be mapped on the further data model. |
8261250 | 12987997 | 1 | 1. A single-chip multiprocessor for executing programs compiled using a static clock-precise macro-scheduling program such that a compiled source program is a set of consecutive super-wide instructions, comprising: K explicit parallelism architecture processors each of which may decode no more than N operations each clock cycle, wherein the K processors are configured to execute no more than K parallel streams, wherein the K parallel streams are created by partitioning each super-wide instruction into no more than K wide instructions, and wherein each wide instruction contains no more than N operations and belongs to only one parallel stream; and a register exchanger for providing data exchange between the streams at a processor register file or control register level using special exchange processor operations added in wide instructions of specified streams, wherein the exchange processor operations include: “transmit” operations defined between each processor, wherein the “transmit” operations send data from a given internal processor register to respective other processors; and “receive” operations defined for each processor, wherein the “receive” operations read data accepted from the respective other processor and lock the processor from running while transmitted data is absent, wherein K and N are integers, and wherein K is greater than one. |
20140046877 | 13755062 | 0 | 1. A method for building a relationship hierarchy comprises: extracting a plurality of relationships defined between entities from a big data, building relationship recognition models adapted to identify different forms of generic relationships; resolving the relationships by grouping the similar relationships together and separating the relationships which are syntactically and semantically dissimilar; and reconciling the resolved relationships to build the relationship hierarchy; wherein the relationship hierarchy comprises groups and subgroups of relationships created based on generic relationship similarity based on a contextual aspect and a specialization aspect using a Language and Domain model. |
9600746 | 14587802 | 1 | 1. An image processing apparatus comprising: an image acquisition unit that acquires an input image that is to be subjected to processing; a foreground map generation unit that generates a foreground map, which indicates a foreground region and a background region in the input image, based on the input image; a learning sample extraction unit that extracts data of a positive learning sample from the foreground region in the input image and extracts data of a negative learning sample from the background region in the input image, based on the foreground map; a classifier learning unit that performs learning of a plurality of classifiers using the positive and negative learning samples extracted from the input image; a strong classifier generation unit that generates a strong classifier by combining the plurality of learned classifiers; and a saliency map generation unit that generates a final saliency map of the input image using the strong classifier. |
20160205595 | 14593187 | 0 | 1. An apparatus comprising: at least one processor; memory storing a program of instructions; wherein the memory storing the program of instructions is configured to, with the at least one processor, configure the apparatus to at least: examine one or more measurements of radio conditions experienced by a user device operating in a wireless communication network; compare each of the one or more measurements of radio conditions against every handover threshold applicable to that measurement, that could have been the handover threshold configured for use at the user device at the time of the measurement; and record a failure event for each comparison that indicates that a failure could have occurred. |
20150227845 | 14180335 | 0 | 1. A method, implemented by one or more computing devices, for generating intent output information, comprising: receiving input data, the input data comprising: a first set of linguistic items with known intent labels; and a second set of linguistic items without known intent labels; determining an intent for each linguistic item in the input data, to produce intent output information, by: if the linguistic item corresponds to a member of the first set, deterministically assigning an intent to the linguistic item based on a known intent label associated with the linguistic item; and if the linguistic item corresponds to a member of the second set, inferring the intent associated with the linguistic item based on selection log data, which reflects selections made by users in response to submitting linguistic items, the intent that is inferred being selected from a set of possible intents, including a first group of known intents associated with the known intent labels, and a second group of unknown intents, not represented by the known intent labels; and storing the intent output information in a data store, said receiving, determining, and storing being performed by said one or more computing devices. |
20130103615 | 13719203 | 0 | 1. A computer-implemented system comprising: a project economics analysis tool (PEAT) module comprising physical memory storing instructions that cause the PEAT module to: provide a user, via said PEAT module, a user interface for integrated risk management integration; present said user with one or more integrated risk management methodologies from a group of risk management methodologies comprising Monte Carlo risk simulation, strategic real options, stochastic and predictive forecasting, business analytics, business statistics, business intelligence, decision analysis, and portfolio optimization, wherein said one or more integrated risk management methodologies project and portfolio economics and financial analysis; receive user input from said user, wherein said user input comprises one or more entries to one or more open fields of said one or more integrated risk management methodologies; process said user input from said user, wherein said user input is analyzed using said one or more integrated risk management methodologies, wherein said PEAT module automatically causes said user input to be analyzed by said one or more integrated risk management methodologies consecutively, wherein the outputs from a first integrated risk management methodology become inputs to a second integrated risk management methodology, and so forth; generate a result, wherein said result is determined after being processed by a final integrated risk management methodology of said group of risk management methodologies; and create a report, wherein said report allows said user to numerically and graphically interpret said result. |
20130300646 | 13570173 | 0 | 1. A graphics card for collaborative computing through wireless technologies, the card comprising: a Graphics Processing Unit (GPU) for data computing; and a wireless controller for wirelessly receiving data from other graphic cards or sending data to the other graphics cards, and communicating with the GPU by bus. |
20160034502 | 14451011 | 0 | 1. A method comprising: at a computing device having one or more processors and memory storing one or more programs for execution by the one or more processors: automatically without human intervention: identifying a set of side effect data associated with a set of enterprise data, wherein the set of side effect data includes a plurality of data fields; selecting a first set of data quality detection rules, in a plurality set of data quality detection rules, in accordance with a first data field in the plurality of data fields; identifying one or more candidate data quality problems in the set of side effect data by comparing the set of side effect data to the first set of data quality detection rules; responsive to identifying the one or more candidate data quality problems: causing to be displayed to a user: information representing the one or more candidate data quality problems; and one or more candidate solutions for correcting the one or more candidate data quality problems. |
8255285 | 12394392 | 1 | 1. A computer-implemented method for proposing a value to a user, the method comprising: mapping, by one or more processors, each of multiple bids for an item type with a percentage of bidding processes for items of the item type that were won using that bid; generating, by the one or more processors, a graph of the mapping; identifying a rectangle that has a first corner at a specific bid value and a second corner opposite to the first corner at a point on the mapping, and that is larger than any other rectangle that has a corner at the specific bid value and an opposite corner on the mapping; identifying, by the one or more processors, a first bid associated with the point on the mapping or with a corresponding point in a normalized mapping; and outputting, the one or more processors, a proposed value for the bidding process to a user, the proposed value generated using the first bid. |
20090106059 | 11874151 | 0 | 1. A system that facilitates executive reporting, comprising: an inference engine that receives a set of data related to a periodic or event-triggered report and outputs a set of results, the set of results is indicative of a change within the set of data over a prior report or with respect to a predetermined characteristic of a triggering event; and a synthesis component that filters the set of data or set of results and extracts information pertinent to at least one user, and compiles an executive summary that contains the set of results and the information pertinent to at least one user. |
9501504 | 14451011 | 1 | 1. A method comprising: at a computing device having one or more processors and memory storing one or more programs for execution by the one or more processors: automatically without human intervention: identifying a set of side effect data associated with a set of enterprise data, wherein the set of side effect data includes a plurality of data fields; selecting a first set of data quality detection rules, in a plurality set of data quality detection rules, in accordance with a first data field in the plurality of data fields; identifying one or more candidate data quality problems in the set of side effect data by comparing the set of side effect data to the first set of data quality detection rules; responsive to identifying the one or more candidate data quality problems: causing to be displayed to a user: information representing the one or more candidate data quality problems; and one or more candidate solutions for correcting the one or more candidate data quality problems. |
20020116357 | 09732499 | 0 | 1. In a relational database system, a method for determining an optimal join order for use in an access plan employed for executing a database query, the method comprising: receiving a query specifying at least one join condition between two or more database tables; establishing an initial join order, based on each table's size and join predicates between the tables, said initial join order specifying a particular sequence for accessing said tables, said sequence indicating a first join position specifying an outer table and one or more subsequent join positions specifying one or more successive inner tables; determining a strategy cost for satisfying the query using a query access plan that employs said initial join order; starting from the innermost positions of the join order and proceeding to be outermost position of the join order, evaluating other candidate join orders by swapping ordering of tables at a given position with those at subsequent positions and thereafter determining the cost strategy for that join order; and if a given candidate join order under consideration has a prefix ordering of outermost tables that has a cost strategy that is worse than that already obtained, then eliminating from consideration any candidate join orders having that prefix ordering of outermost tables; and selecting the candidate join order having the most favorable strategy cost. |
7720032 | 10875938 | 1 | 1. Apparatus for selecting an algorithm from a plurality of algorithms employed in a wireless communications system, each algorithm being provided to cure or ease a particular condition, comprising: a unit for assigning a priority level, taken from priority levels P 1 , P 2 , P 3. .. P n , to each algorithm wherein priority level P n is a highest priority level; a unit for assigning a parameter to each algorithm wherein a same parameter is assigned to algorithms of a same priority level; a unit for selecting an algorithm wherein, when two or more algorithms are associated with a given condition, that algorithm having a higher priority is selected; an accumulator for accumulating a number of times an algorithm has been consecutively selected and has failed to solve a problem; a unit for retaining a priority level assigned to the selected algorithm when the number accumulated by the accumulator is less than a given number; a unit for lowering a priority level of the selected algorithm when it has been consecutively selected said given number of times and its priority level has not been lowered below a lowest allowed priority; and a unit for retaining for use the selected algorithm regardless of the given number of times it has failed to solve a problem. |
8942114 | 13165352 | 1 | 1. A method for monitoring traffic in a network comprising a plurality of links, wherein each of the plurality of links comprises a plurality of neighboring pairs of slots, the method comprising: receiving network traffic at a traffic monitoring module of a network node; using the traffic monitoring module, identifying a usage status for a first slot and a second slot, the first and second slots being a neighboring pair of slots, the neighboring pair of slots being one of the plurality of neighboring pairs of slots; calculating a utilization entropy value for the first and second slots, the utilization entropy value based at least on a difference between the usage status for the first slot and the usage status for the second slot; performing the above steps for each of the neighboring pairs of the plurality of neighboring pairs of slots to create a set of utilization entropy values; and calculating a link utilization entropy value, the link utilization entropy value based at least on a statistical analysis of the set of utilization entropy values. |
20140306107 | 14251137 | 0 | 1. A method for performing a mass analysis of a subset of ions generated from a sample, the subset of ions comprising a restricted range mass-to-charge (m/z) ratios of the generated ions, the method comprising the steps of performing a survey mass analysis using a mass analyzer of a mass spectrometer so as to identify the restricted range of m/z ratios and to measure a flux of ions having m/z ratios within said restricted range and performing a dependent mass analysis of an optimal quantity of ions having m/z ratios within said restricted range, said optimal quantity of ions collected for a time period determined by the measured ion flux, the method CHARACTERIZED IN THAT: the time period is determined using a corrected ion flux that is calculated from the measured flux of ions, wherein the correction accounts for, during the dependent mass analysis, one or more of: (a) imperfect restriction of collected ions to the range of m/z ratios, (b) ion collection that includes ions within the range of m/z ratios that are undetected by the survey mass analysis, (c) the use of a different mass analyzer than the mass analyzer used for the survey mass analysis, and (d) one or more ion pathways that differ from those used during the survey mass analysis. |
20070173255 | 11341964 | 0 | 1. A cell reselection method for selecting a target cell in a cellular wireless communications system, the method including observing over time signal characteristics of cells, including at least potential target cells, and selecting a target cell by using the observed characteristics to predict which potential target cell will in future satisfy certain criteria. |
8503525 | 12084443 | 1 | 1. A method, comprising: performing, by a computing device, a bitstream analysis of a media file having a plurality of segments to determine a number of non-zero inverse discrete cosine transform (IDCT) coefficients of each of the plurality of respective segments, or input parameter values of a motion compensation (MC) task function associated with the respective segments, or both; determining, by the computing device, a predicted number of processor cycles for playing the media file based on a result of the bitstream analysis, including determining, for the respective segments, predicted numbers of variable length decoding (VLD) task cycles from the number of non-zero IDCT coefficients of the respective segments; and generating and saving in the media file at a position preceding each respective segment of the media file, by the computing device, metadata comprising the predicted number of processor cycles for each respective segment of the media file for subsequent playing of the media file, wherein a size of a segment in the plurality of segments is based on the predicted number of processor cycles for the segment. |
8606730 | 13566289 | 1 | 1. A method comprising: storing, by a computer device and in a plurality of memory locations in a memory, values relating to a feature of a feature set; subjecting, by the computer device, a string, associated with the feature, to multiple, different hash functions to generate multiple, different hash values; identifying, by the computer device and for each of the multiple, different hash values, a respective memory location, of the plurality of memory locations, in the memory; reading, by the computer device, the values stored at the respective memory locations; performing, by the computer device, an operation on the read values, from the respective memory locations, to obtain updated values, the performing including: identifying a value from the read values, updating the value, and replacing each of the read values with the updated value; and using, by the computer device, the updated values to make a prediction regarding particular data. |
5563317 | 08196139 | 1 | 1. A method for the production of homokaryons from breeding stock of the mushroom Agaricus bisporus comprising the steps of: providing a first strain of Agaricus bisporus having tetrasporic ancestry and carrying at least one gene which determines the trait for production of mushrooms which produce basidia, among which basidia bearing at least three spores predominate; and crossing said first strain with at least a second strain of Agaricus bisporus to form at least one hybrid heterokaryotic culture, said at least one hybrid heterokaryotic culture being capable of producing mushrooms, the basidia of which predominantly bear at least three spores, at least 10 percent of said spores being homokaryotic. |
20080148307 | 11576328 | 0 | 1. A method to determine whether a presentation device is ON or OFF, the method comprising determining a plurality of metrics based on monitoring at least one output of the presentation device, wherein each metric in the plurality of metrics comprises a decision indicating an operating state of the presentation device; and combining the plurality of metrics to determine whether the presentation device is one of ON or OFF, wherein combining the plurality of metrics comprises at least one of weighting the plurality of metrics or determining a majority vote of the plurality of metrics. |
9442490 | 13452967 | 1 | 1. A method of aircraft performance predictions for descent and approach phases in a flight management system (FMS), comprising: stopping cruise computation substantially around a default distance from a destination by an aircraft performance prediction module residing in a memory of the FMS; determining current predicted aircraft state using a total energy of the aircraft starting from the default distance by the aircraft performance predictions module; computing descent and approach phase profiles including a flight path using the determined current predicted aircraft state by the aircraft performance prediction module, comprising: selecting a starting top of descent distance from the destination while the aircraft is in cruise altitude by the aircraft performance predictions module; performing an iterative backward computation from the destination to the cruise altitude by the aircraft performance predictions module to compute the descent and approach phase profiles including the flight path using the determined current predicted aircraft state; and obtaining the aircraft performance predictions along the flight path based on the computed descent and approach phase profiles by the aircraft performance predictions module that comprises: obtaining a first top of descent distance from the obtained descent and approach profiles; determining whether a difference between the starting top of descent distance and the first top of descent distance is within a design value; and if so, determining the aircraft performance predictions along the flight path using the descent and the approach phase profiles in a forward computation from the cruise altitude to the destination; and if not, considering the first top of descent distance to be the starting top of descent distance; and using the considered starting top of descent, repeating the steps of performing the iterative backward computation, obtaining the first top of descent, and determining whether the difference between the starting top of descent distance and the first top of descent distance is within the design value, until the difference is within the design value; and guiding the aircraft through the descent and approach phase profiles based on the aircraft performance predictions. |
9065727 | 13601775 | 1 | 1. A computerized method of building a device identifier similarity model with online event signals, the method comprising: receiving at a processing circuit a first set of network device identifiers; identifying, by the processing circuit, an online event associated with network activity of each network device identifier of the first set; identifying, using the processing circuit, for each network device identifier of the first set, one or more long-term browsing history events surrounding the identified online event based on the network device identifier's network activity, the long-term browsing history events corresponding to events occurring prior to a first time from the identified online event; identifying, using the processing circuit, for each network device identifier of the first set, one or more short-term browsing history events surrounding the identified online event based on the network device identifier's network activity, the short-term browsing history events corresponding to events occurring after the first time from the identified online event; representing, using the processing circuit, each device identifier of the first set as a vector based on feature data corresponding to each network device identifier's network activity, the feature data comprising keywords corresponding to content associated with the device identifier's network activity; applying, using the processing circuit, abstractions on the feature data to form concepts, wherein each concept represents a category of interest; deriving, using the processing circuit, at least one hierarchy of the feature data based on the keywords and concepts of the feature data; expanding, using the processing circuit, the feature data based on the derived at least one hierarchy of the feature data; applying, using the processing circuit, a clustering algorithm on each of the vectors to identify a plurality of clusters of device identifiers that share a common interest; providing, using the processing circuit, at least one subset of network device identifiers corresponding to each of the plurality of cluster; and generating, using the processing circuit, the device identifier similarity model based on the expanded feature data. |
20070277265 | 11779036 | 0 | 1. A method for multigenerational plant trait analysis and associated data management comprising: a) generating a random insertion of an insertional mutagen in the genome of a T0 plant, and collecting T1 seed from said T0 plant, wherein said insertional mutagen is capable of a loss of function and a gain of function mutation; b) growing T1 plants from the seed collected in (a) under conditions to select transformed T1 plants, and assigning a T1 identification number to each transformed T1 plant selected; c) analyzing a transformed T1 plant grown in (b) for dominant mutant traits and recording at least one dominant mutant trait observed in the transformed T1 plant, wherein a record of a dominant mutant trait observed in a transformed T1 plant is linked to the T1 identification number assigned to the T1 plant analyzed; d) collecting T2 seed from T1 plants analyzed in (c), and assigning a T2 identification number to said seed, wherein the T2 identification number is linked to the T1 identification number assigned to the T1 plant analyzed in (c); e) growing T2 plants from the T2 seed collected in (d); and f) analyzing a T2 plant grown in (e) for recessive mutant traits and recording at least one recessive mutant trait observed in the analyzed T2 plant that was not present in its parent T1 plant, wherein a record is generated that associates the information of the analyzed T2 plant to any information recorded about its parent T1 plant. |
20050131718 | 10736268 | 0 | 1. A method for selecting a characterizing algorithm for generating a characterizing information descriptor for a selected block of printed material, where said printed material is to be scanned from an object and compared with said characterizing information descriptor at a location distant from where said block is printed, said method comprising the steps of: a) printing said block on an object; b) applying each algorithm from a predetermined set of characterizing algorithms to a pristine image of said block of printed material to generate a plurality of corresponding first characterizing information descriptors for said block; c) determining estimates of robustness, with respect to said block of printed material, for each of said algorithms in said set to determine which of said characterizing algorithms is most robust; and d) selecting a descriptor generated by said algorithm and being so determined to be most robust be used at said distant location. |
20160105308 | 14878854 | 0 | 1. A system to provide a data processing service to a client device, comprising: an optimization platform communicatively coupled to a source of the data processing service and configured to perform one or more optimization processes on a data processing application that is hosted at least in part by the service, on data, or on both; a first optimization process residing on the optimization platform and operable to identify an association between a first subset of a set of data and a second subset of the set of data; a second optimization process residing on the optimization platform and operable to determine one or more executable instructions that are part of the data processing application and that may be executed by the client device in response to a signal received from the client device; a data transfer process configured to provide the client device with the second subset of the set of data in response to a signal received from the client device requesting the set of data; and an application transfer process configured to provide the client device with the one or more executable instructions that are part of the data processing application and that may be executed by the client device in response to the signal received from the client device. |
20020169299 | 10041856 | 0 | 1. An isolated and purified nucleic acid molecule comprising a nucleic acid sequence selected from the group consisting of: (a) the nucleic acid sequence in FIG. 6 ; (b) the nucleic acid sequence in FIG. 6, wherein the thymine nucleotide at position 34,201 is replaced by a cytosine nucleotide; (c) the nucleic acid sequence in FIG. 6, wherein the guanine nucleotide at position 33,714 is replaced by a cytosine nucleotide; (d) the nucleic acid sequence in FIG. 6, wherein the thymine nucleotide at position 34,201 is replaced by a cytosine nucleotide and the guanine nucleotide at position 33,714 is replaced by a cytosine nucleotide; (e) the nucleic acid sequence in FIG. 7 ; (f) the nucleic acid sequence in FIG. 7, wherein the guanine nucleotide at position 2397 is replaced by a cytosine nucleotide. |
20150026108 | 13835294 | 0 | 1. A system comprising: a plurality of server machines, each comprising at least one computer processor, one or more computer memories, and an input-output bus; a data store storing corresponding load and health measurements of the plurality of server machines; a neural network configured to receive the corresponding load and health measurements as inputs; a memory of a computing device storing a learn module that, when executed by a processor of the computing device, causes an update to the neural network using inputs of corresponding load and health measurements of the plurality of server machines; the memory of the computing device storing a predictor module that, when executed by the processor of the computing device, generates a predicted health value of the plurality of server machines, using the updated neural network, given a hypothetical increased load value, wherein the predicted health value comprises a confidence score; and the memory of the computing device storing a simulator module that, when executed by the processor of the computing device, generates a simulated load on the plurality of server machines in accordance with hypothetical increased load value. |
9588820 | 13603167 | 1 | 1. A computer implemented method for recommending alternative computing architectures for a selected application using automated workload instrumentation, the method comprising: selecting a plurality of performance parameters; implementing instruments to gather data on the selected application to provide at least one measurement instrument corresponding to at least one of the performance parameters; measuring, on a first computing architecture, a first performance of the selected application when processing a workload using at least one measurement instrument; measuring, on a second computing architecture, a second performance of the selected application when processing the workload processed by the selected application on the first computing architecture using the at least one measurement instrument; comparing, by a computer, the first performance of the selected application to the second performance of the selected application to produce a comparison; and selecting, by a computer, at least one additional performance parameter to be measured by: reviewing the measurements of the at least one measurement instrument of the workload; and selecting the at least one additional performance parameter to be measured based at least in part on a result of the review of the measurements. |
8498913 | 10837849 | 1 | 1. A portfolio integration software module for facilitating financial advising and planning, the portfolio integration module configured to: facilitate, by a computer for facilitating financial advising and planning and comprising the portfolio integration software module, integration of goals, assets, savings, planned hypothetical events, unplanned hypothetical events, transactions, and a risk tolerance of a client; communicate, by the computer, with a portfolio reconciler module, a stochastic modeling module, a simulation module and an advice utility server, wherein the advice utility server is configured to create a financial advice application including data from a plurality of financial services; wherein the portfolio reconciler module is configured to facilitate comparison of a customized strategy to at least one of other strategies or projected client financial decisions in order to further facilitate the financial portfolio planning for the client; wherein the stochastic modeling module is configured to facilitate use of data from the at least one of: the portfolio integration software module or the portfolio reconciler module in a stochastic modeling analysis to facilitate creation of a proposed situation portfolio, wherein the analysis includes stochastic simulation of both planned hypothetical events and unplanned hypothetical events, wherein the unplanned hypothetical events comprise at least one of a disability, a retirement date, a death or a divorce; wherein the simulator module is configured to simulate, monitor and test at least one of the advice utility server, the portfolio integration software module or the portfolio reconciler module; obtain, by the computer, the risk tolerance, a goal timing schedule, the goals value, an assets value, a regular assets value, and contributions value; determine, by the computer, a plurality of proposed portfolios based upon the risk tolerance, the goal timing schedule, the goals value and an allocation table, wherein the allocation table comprises a plurality of cash, equity and fixed percentages for each portfolio in the plurality of portfolios, and for each of a plurality of time segments, the time segments comprise i) 0 to 3 Years from non-retirement goal, ii) 4 to 7 Years from non-retirement goal, iii) 8 to 15 Years from non retirement goal, iv) 16 or more Years from non-retirement and greater than 3 years away from retirement, v) 2 years or less from retirement, and wherein the goal timing schedule is based at least partially upon the plurality of time segments; determine, by the computer, a short-term timeframe based upon the goal timing schedule; determine, by the computer, a long-term timeframe based upon the goal timing schedule and a retirement date of the client; determine, by the computer, a short-term goals value based upon the goals value, the goal timing schedule and the short-term timeframe; determine, by the computer, a long term goals value based upon the goals value, the goal timing schedule and the long-term timeframe; determine, by the computer, a short-term regular assets portfolio based upon the short-term timeframe and the risk tolerance of the client; determine, by the computer, a long-term regular assets portfolio based upon the long-term timeframe and the risk tolerance; determine, by the computer, a short term portfolio regular assets amount; determine, by the computer, a proposed regular assets portfolio based upon the short-term regular assets portfolio and the long-term regular assets portfolio; determine, by the computer, a short-term regular contributions portfolio based upon the short-term timeframe and the risk tolerance; determine, by the computer, a long-term regular contributions portfolio based upon the long-term timeframe and the risk tolerance; determine, by the computer, a short-term regular contributions amount; determine a proposed regular contributions portfolio; determine, by the computer, a short-term variable universal life (VUL) goals portfolio based upon the short-term timeframe and the risk tolerance; determine, by the computer, a long-term VUL goals portfolio based upon the long-term timeframe and the risk tolerance; determine, by the computer, an amount of VUL cash values and premiums that should be invested in the VUL goals short-term portfolios and the VUL goals long-term portfolios; determine, by the computer, a proposed VUL goal funding portfolio based upon the short-term VUL goals portfolio and the long-term VUL goals portfolio; determine, by the computer, a retirement proposed portfolio based upon long-term timeframe and the risk tolerance; determine, by the computer, a proposed VUL non-goal funding portfolio based upon long-term timeframe and the risk tolerance; and update, by the computer, the plurality of proposed portfolios in response to receiving a change in at least one of the risk tolerance, the goal timing schedule, the goals value, a proposed contribution amount, or a mixture of regular versus retirement assets. |
10158522 | 15393745 | 1 | 1. A method of predicting outages in radio networks, the method comprising: receiving a plurality of alarms during a baseline period from a plurality of network elements; establishing a baseline for at least one of the plurality of the network elements by determining a number of the plurality of alarms during the baseline period that occur during each of a plurality of sub-intervals within the baseline period; calculating a mean arrival rate for each of the plurality of alarms during the baseline period; generating a probability density function for an arrival rate for each of the plurality of alarms during the baseline period; calculating a probabilistic score for each of a plurality of alarms during a test period based on the probability density function for the arrival rate of each of the plurality of alarms during the baseline period; determining if the score for each of the plurality of alarms during the test period is greater than or equal to a probabilistic threshold; summing the number of the scores for each of the plurality of alarms during the test period that is greater than or equal to probabilistic threshold; generating a list by sorting the plurality of network elements in descending order based on the sum of the number of the scores for each of the plurality of alarms that generated a probabilistic score greater than or equal to probabilistic threshold or based on a sum of the probabilistic scores that are greater than or equal to probabilistic threshold; reporting first network elements of the generated list and reporting alarms for the first network elements of the generated list having probabilistic scores higher than the probabilistic threshold. |
7529759 | 10966329 | 1 | 1. A computer-implemented system to provide batch operation for container-managed components, comprising: a plurality of instances of a container-managed component; a database maintaining a table corresponding to the container-managed component; a batch of one or more SQL statements maintained in a container, wherein each of the one or more SQL statements to perform one of inserting, updating, and deleting operations against the database; and said container to generate an SQL statement based on the plurality of instances; insert the SQL statement into the batch of the one or more SQL statements; delay execution of the batch against the database until the commit time of the transaction; and execute the batch against a plurality of entries in the table in the database; and a DTD file to define one or more features of batch operations that are performed over the batch within said container, wherein the number of instances in the plurality instances is bounded by the maximum size of the cache holding the plurality of instances, and wherein said container runs on one or more processors. |
8525647 | 11988235 | 1 | 1. A measuring system for detecting radio-frequency tags operating at a predefined wavelength, the system comprising a reading device and an antenna, which is connected to the reading device for connecting to one or more radio-frequency identifier (RFID) tags moving in a direction towards said antenna, wherein the antenna has a microstrip configuration and a length which is equal to or longer than a multiple of said predefined wavelength of the one or more RFID tags in order to form a leaky waveguide and an elongated detection zone, said leaky waveguide having the microstrip configuration acting as both a transmission and a reception antenna and being connected to the reading device in order to produce a radio-frequency excitation signal and in order to receive from said one or more RFID tags crossing said elongated detection zone, a return signal powered by the radio-frequency excitation signal, and wherein the antenna comprises: a long conductor configured like a wire, an elongated ground plane in the vicinity of the long conductor and essentially parallel to the long conductor in order to form said elongated detection zone, and wherein the long conductor is connected at one end to the elongated ground plane. |
8825514 | 13893874 | 1 | 1. A system for evaluating a first consumer, comprising: a computer database which contains 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; and a processor operatively connected to said database; wherein said processor is programmed such that: (a) for a time variable product in the current product mix for a one of the plural consumers, said processor: (i) determines a baseline product survival curve; (ii) determines a shift in the baseline product survival curve as a function of characteristics of said one consumer to thereby determine a consumer product survival curve; (iii) calculates an area under the consumer product survival curve; (iv) calculates an estimated potential residual profit from the calculated area to thereby determine a first Residual Life Time Value (“RLTV”) estimate for said time variable product for said one consumer; (v) repeats (a)(i) through (a)(iv) for each time variable product in the current product mix for said one consumer; and (vi) determines an aggregate first RLTV estimate for said one consumer from the first RLTV estimate for each said time variable product for said one consumer; and wherein said processor is programmed to repeat (a) for each one of the plural consumers; and wherein said processor is programmed such that: (b) for a finite duration product in the current product mix for a one of the plural consumers, said processor: (i) determines a remaining outstanding balance; (ii) multiplies the remaining outstanding balance by a funds transfer pricing value for said finite duration product to determine an approximate residual value to thereby determine a second RLTV estimate for said finite duration product for said one consumer; (iii) repeats (b)(i) through (b)(ii) for each finite duration product in the current product mix for said one consumer; and (iv) determines an aggregate second RLTV estimate for said one consumer from the second RLTV estimate for each said finite duration product for said one consumer; and wherein said processor is programmed to repeat (b) for each one of the plural consumers, and to determine, individually for each of the plural consumers, an aggregate third RLTV estimate from that consumer's aggregate first RLTV estimate and from that consumer's aggregate second RLTV estimate; and wherein said processor is programmed to: (c) calculate the likelihood of a one of the plural consumers to acquire one or more of the predetermined products not in the current product mix for said one consumer; and (d) for a preselected product not in the current product mix of a one of the plural consumers, said processor: (i) determines a baseline product survival curve; (ii) calculates an area under the baseline product survival curve; (iii) calculates an estimated potential residual profit from the calculated area to thereby determine a Potential Life Time Value (“PLTV”) estimate for said preselected product for said one consumer; (iv) repeats (d)(i) through (d)(iii) for each preselected product not in the current product mix for said one consumer; and (v) determines an aggregate PLTV estimate for said one consumer from the PLTV estimate for each said preselected product for said one consumer; and wherein said processor is programmed to repeat (c) and (d) for each one of the plural consumers, analyze a distribution of the aggregate third RLTV estimates for the plural consumers, analyze a distribution of the aggregate PLTV estimates for the plural consumers, and evaluate 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. |
9037915 | 13627229 | 1 | 1. A data-processing system comprising a processor, a memory, and a storage device, wherein the storage device comprises program code that is loadable into the memory and executable by the processor to perform steps of: receiving an indication of each failed test case of a plurality of test cases whose current execution has failed; and classifying each failed test case into a plurality of disjoint classes according to a corresponding suspicion attribute, change attribute and regression attribute, wherein the suspicion attribute of a given failed test case is indicative of a change to a corresponding exercised software component since a previous execution of the given failed test case, the change attribute of the given failed test case is indicative of a change to the given failed test case since the previous execution of the given failed test case, and the regression attribute of the given failed test case is indicative of a regression of the given failed test case since the previous execution of the given failed test case. |
20140051583 | 13921881 | 0 | 1. A method for determining a fetal abnormality, the method comprising: obtaining a maternal sample; sequencing at least a portion of nucleic acids in the sample; comparing obtained sequence information to a reference sequence; identifying fetal nucleic acid, if present, in the sample; optionally, if fetal nucleic acid is present, determining whether the fetus has an abnormality. |
20050027661 | 10860123 | 0 | 1. A method of providing a cost estimate for a data processing system, the method comprising: selecting application programs from a set of application programs, each application program having objects, entering load profile data for the selected application programs, retrieving a set of sizing coefficients for the objects of the selected application programs, estimating hardware requirements for the data processing system for the objects of the selected application programs by entering the sizing coefficients and the load profile data into a sizing model, entering the hardware requirements for the objects of the selected application programs into a cost estimation component to generate cost estimates for the objects of the selected application programs, calculating the total hardware requirement by adding the hardware requirements for the objects of the selected application programs, and calculating the total cost estimate for the data processing system by adding the cost estimates for the objects of the selected application programs. |
20130325781 | 13484476 | 0 | 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. |
8200440 | 12123463 | 1 | 1. A method for determining the genotype of a plurality of nucleic acid samples at a plurality of SNPs, comprising: (a) hybridizing each nucleic acid sample in said plurality of nucleic acid samples to an array of allele specific probes to obtain a plurality of raw probe intensity measurements; (b) normalizing said raw probe intensity measurements to obtain normalized probe intensities; (c) summarizing the normalized probe intensities to obtain an allele signal estimate for each allele of each SNP in each nucleic acid sample, wherein the allele signal estimate for each allele of each SNP in each nucleic acid sample comprises a first value S A and a second value S B where S A is the summary value for a first allele of the SNP and S B is the summary value for a second allele of the SNP; (d) transforming said allele signal estimates in clustering space in one-dimension to obtain a transformed allele signal estimate for each SNP in each nucleic acid sample using the following equation: transformed allele signal estimate =asinh(K(S A −S B )/(S A +S B ))/asinh(K), where K is a tuning constant; (e) obtaining a prior distribution of genotype cluster characteristics; (f) evaluating all possible assignments of the transformed allele signal estimates to the genotype clusters of the prior distribution; (g) calculating an optimal assignment from the possible assignments of step (f) for each transformed allele signal estimate, to one or more genotype clusters using a Gaussian cluster model; (h) updating the prior distribution with optimal assignments calculated in (g) to obtain a posterior distribution of genotype cluster characteristics for each SNP; and (i) using the posterior distribution of genotype cluster characteristics for each SNP to make genotype calls for that SNP in each nucleic acid sample. |
8214240 | 13190894 | 1 | 1. A computer-implemented method for optimizing allocation of resources across projects in a project portfolio, comprising: receiving, at a computing device, (i) resource information, (ii) a portfolio of project definitions and (iii) one or more portfolio-level optimization criteria, the resource information representing a plurality of resources available for allocation to the projects, each project definition comprising a unique identifier and one or more project-level constraints; generating, using the computing device, a plurality of project portfolio allocation scenarios by optimizing at least a first objective function and satisfying the one or more project-level constraints corresponding to each project definition, wherein generating each project portfolio allocation scenario comprises: assigning a date value to each of the unique identifiers; and allocating one or more of the plurality of resources to one or more of the unique identifiers, wherein the assignment of the date values and the allocation of the resources to the one or more unique identifiers satisfies the one or more project-level constraints associated with each project definition; and determining, using the computing device, one or more optimized project portfolio allocation scenarios from the plurality of project portfolio allocation scenarios, wherein determining the one or more optimized project portfolio allocation scenarios optimizes a sequence of the projects by optimizing at least a second objective function and satisfying the one or more portfolio-level optimization criteria. |
20080228680 | 12048045 | 0 | 1. A modeling system that comprises: a memory; and a processor coupled to the memory and configured to execute software stored in said memory, wherein said software configures the processor to: create a pool of neural networks trained on a portion of a data set; for each of various coefficient settings for a multi-objective function: apply selective evolution subject to the multi-objective function with that coefficient setting to obtain a corresponding group of neural network ensembles; and select a local ensemble from each said group of neural network ensembles, wherein the selection is based on data not included in said portion of the data set; combine a plurality of the local ensembles to form a global ensemble; and provide a perceptible output based at least in part on a prediction by the global ensemble. |
20090187555 | 12017288 | 0 | 1. A method to select features for ranking, implemented at least in part by a computing device, the method comprising: computing importance scores for features, wherein the scores include ranking performances; measuring similarity scores between two features based on the ranking performances; and selecting features that maximize total importance scores of the selected features and minimize total similarity scores between the selected features, wherein the features selected for ranking are modeled as an optimization problem. |
20110252073 | 13080988 | 0 | 1. A data storage and/or retrieval system implemented on one or more digital data processing systems, comprising: storage media comprising a plurality of data tunnels for each entity type and a fixed plurality of data tunnels for each attribute, one or more of which data tunnels comprise a plurality of data cells, wherein each of the data cells contain data associated with a respective instance of an attribute for a respective instance of an entity type, wherein for one or more of the data tunnels, the data cells in each of which have data for which a respective operator evaluates to a boolean result indicating either the likely possibility or the impossibility of a respective instance of an attribute being characterised by said operator for a given set of one or more operands, and a storage engine that is in communications coupling with the storage media and that accesses one or more data tunnels based on one or more of said operators and a given set of one or more operands. |
20090003687 | 12159960 | 0 | 1. A method of segmenting image elements in each of a pair of stereo images into at least two segments being a foreground and a background said method comprising the steps of: (i) defining an energy function for probabilistic stereo matching; (ii) approximating that energy function to require computation only over foreground disparities; (iii) using an optimisation algorithm on the approximated energy function to achieve the segmentation. |
20150380004 | 14754539 | 0 | 1. A computer-implemented method for matching audio sequences, the method comprising: deriving a first probability density function P M outputting a probability that an initial correspondence score for a pair of chroma vectors of an audio sequence indicates a semantic correspondence between the chroma vectors; deriving a second probability density function P R outputting a probability that the initial correspondence score for a pair of chroma vectors of an audio sequence indicates that the chroma vectors have a random correspondence; deriving, using P M and P R , a match function indicating whether a given pair of chroma vectors of an audio sequence correspond semantically; obtaining a first audio sequence; comparing, using the match function, the first audio sequence with a plurality of known audio sequences; and based on the comparing, identifying a best-matching audio sequence for the first audio sequence from the known audio sequences. |
8811748 | 13476676 | 1 | 1. A collaborative feature extraction system, comprising: a knowledge base containing a first dataset, the first dataset comprising parameters that are associated with one or more assets; a second dataset, the second dataset comprising three-dimensional data representing a geographic area and one or more candidate objects within the geographic area; a processor in electronic communication with the knowledge base; and a computer-readable medium containing programming instructions that, when executed, cause the processor to: analyze the three-dimensional data to identify one of the candidate objects as a selected one of the assets by comparing the second dataset with one or more of the parameters in the first dataset; output, to multiple users, a first image representing the identified candidate object and a user prompt; in response to the user prompt, receive user responses from each of the multiple users indicating whether the selected asset matches the identified candidate object; and based on receipt of user responses from a threshold number of users that indicate the selected asset matches the identified candidate object and when the identified candidate object has attributes that are at an edge of a parameter range for the selected asset, update the knowledge base by expanding the parameter range associated with the selected asset. |