Patent application number | Description | Published |
20080275833 | Link spam detection using smooth classification function - A collection of web pages is considered as a directed graph in which the pages themselves are nodes and the hyperlinks between the pages are directed edges in the graph. A trusted entity identifies training examples for spam pages and normal pages. A random walk is conducted through the directed graph that includes the collection of web pages and the stationary probabilities, and transitional probabilities, among the nodes in the directed graph are obtained. A classifier training component estimates a classification function that changes slowly on densely connected subgraphs within the directed graph. The classification function assigns a value to each of the nodes in the directed graph and identifies them as spam or normal pages based upon whether the value meets a given function threshold value. | 11-06-2008 |
20080275902 | Web page analysis using multiple graphs - A collection of web pages is modeled as a directed graph, in which the nodes of the graph are the web pages and directed edges are hyperlinks. Web pages can also be represented by content, or by other features, to obtain a similarity graph over the web pages, where nodes again denote the web pages and the links or edges between each pair of nodes is weighted by a corresponding similarity between those two nodes. A random walk is defined for each graph, and a mixture of the random walks is obtained for the set of graphs. The collection of web pages is then analyzed based on the mixture to obtain a web page analysis result. The web page analysis result can be, for example, clustering of the web pages to discover web communities, classifying or categorizing the web pages, or spam detection indicating whether a given web page is spam or content. | 11-06-2008 |
20100185649 | SUBSTANTIALLY SIMILAR QUERIES - A system described herein includes analyzer component that analyzes queries submitted by users and corresponding URLs selected by the users, wherein the queries include a first query and a second query, and wherein the analyzer component determines that the first query and the second query are substantially similar queries. The system additionally includes a correlator component that, responsive to the analyzer component determining that the first query and the second query are substantially similar, generates correlation data that indicates that the first and second queries are substantially similar. | 07-22-2010 |
20110282816 | LINK SPAM DETECTION USING SMOOTH CLASSIFICATION FUNCTION - A spam detection system is disclosed. The system includes a classifier training component that receives a first set of training pages labeled as normal pages and a second set of training pages labeled as spam pages. The training component trains a web page classifier based on both the first set of training pages and the second set of training pages. A spam detector then receives unlabeled web pages uses the web page classifier to classify the unlabeled web pages as spam pages or normal pages. | 11-17-2011 |
20110295589 | LOCATING PARAPHRASES THROUGH UTILIZATION OF A MULTIPARTITE GRAPH - A method is described herein that includes acts of receiving a selection of a first phrase in a first language and executing a random walk over a computer-implemented multipartite graph, wherein the multipartite-graph includes a first set of nodes that are representative of phrases in the first language, a second set of nodes that are representative of phrases in a second language, and edges between nodes that are representative of relationships between the respective phrases. The random walk includes traversals over edges of the graph between nodes. The method also includes the act of indicating that a second phrase in the first language is a paraphrase of the first phrase based at least in part upon the random walk. | 12-01-2011 |
20120166366 | HIERARCHICAL CLASSIFICATION SYSTEM - The claimed subject matter provides a method for hierarchical classification. The method includes receiving a hierarchical structure with a first level comprising a parent node and a sibling node. The structure also includes a second level comprising two child nodes. The method further includes receiving training examples. Each training example may be associated with a class of the parent node, the sibling node, or the two child nodes. The method also includes generating a first classifier for the first level. The first classifier includes a first hyperplane distinguishing the parent and sibling nodes. A first vector is normal to the first hyperplane. Additionally, the method includes generating a second classifier for the second level. The second classifier includes a second hyperplane distinguishing the two child nodes. A second vector is normal to the second hyperplane. An orthogonality of the second vector in relation to the first vector is maximized. | 06-28-2012 |
20130282632 | LINK SPAM DETECTION USING SMOOTH CLASSIFICATION FUNCTION - A spam detection system is disclosed. The system includes a classifier training component that receives a first set of training pages labeled as normal pages and a second set of training pages labeled as spam pages. The training component trains a web page classifier based on both the first set of training pages and the second set of training pages. A spam detector then receives unlabeled web pages uses the web page classifier to classify the unlabeled web pages as spam pages or normal pages. | 10-24-2013 |
20140105488 | LEARNING-BASED IMAGE PAGE INDEX SELECTION - Architecture that performs image page index selection. A learning-based framework learns a statistical model based on the hyperlink (URL-uniform resource locator) previous click information obtained from the image search users. The learned model can combine the features of a newly discovered URL to predict the possibility of the newly-discovered URL being clicked in the future image search. In addition to existing web index selection features, image clicks are added as features, and the image clicks are aggregated over different URL segments, as well as the site modeling pattern trees to reduce the sparse problem of the image click information. | 04-17-2014 |
20140172767 | BUDGET OPTIMAL CROWDSOURCING - To optimize the number of correct decisions made by a crowdsourcing system given a fixed budget, tasks for multiple decisions are allocated to workers in a sequence. A task is allocated to a worker based on results already achieved for that task from other workers. Such allocation addresses the different levels of difficulty of decisions. A task also can be allocated to a worker based on results already received for other tasks from that worker. Such allocation addresses the different levels of reliability of workers. The process of allocating tasks to workers can be modeled as a Bayesian Markov decision process. Given the information already received for each item and worker, an estimate of the number of correct labels received can be determined. At each step, the system attempts to maximize the estimated number of correct labels it expects to have given the inputs so far. | 06-19-2014 |
20140222747 | LEARNING WITH NOISY LABELS FROM MULTIPLE JUDGES - A system and method infer true labels for multiple items. The inferred labels are generated from judgments. Multiple judges select the judgments from a specified choice of labels for each item. The method includes determining a characterization of judge expertise and item difficulties based on the judgments. The method also includes determining, using maximum entropy, a probability distribution over the specified choice of labels for each judge and item, based on the judgments. The method further includes selecting improved labels for the items from the specified choice such that the entropy over the probability distribution is reduced. The improved labels represent an improvement from the judgments toward the true labels. Additionally, the method includes performing iterative procedure to determine the true labels, the characterizations of judge expertise and the labeling difficulties. | 08-07-2014 |
20150262313 | MULTIPLICATIVE INCENTIVE MECHANISMS - A user interface may include instructions to complete a task (including a plurality of task items) and rule(s) that indicate to a worker how a payment associated with the task is to be calculated. The worker may provide information associated with the individual task items via the user interface. The payment may be calculated based on the rule(s), where the payment is determined based at least in part on a multiplicative payment component. In some implementations, the user interface may include an option for the worker to skip question(s), and the worker may be incentivized to skip question(s) when the worker does not know the answer. Further, in some implementations, the user interface may allow the worker to specify a confidence value when the worker chooses to answer the question, and the worker may be incentivized to provide an accurate confidence value. | 09-17-2015 |
Patent application number | Description | Published |
20100290744 | ADAPTIVE DEVICE FOR SHIFTING IMAGING AXIS ACROSS FIBER-OPTIC ENDFACES IN MULTI-FIBER CONNECTOR FOR INSPECTION - A device for shifting the imaging axis of a microscope across the endfaces of a multi-fiber connector for inspecting the endfaces comprises: a supporting body attached to the optical tube of a microscope and having an extended portion; a swinging lever mounted at one end to the extended portion of the supporting body and rotatable on an axis perpendicular to the imaging axis of the microscope; a connection piece connecting between the swinging lever and a fitting tip; a bevel wheel fastened to the supporting body; and a torsion spring for pushing the swinging lever against a slanted surface of the bevel wheel. The bevel wheel is adapted to swing the swinging lever relative to the supporting body so that the imaging axis of the microscope is moved relative to the fitting tip to selectively align the imaging axis across the endfaces for inspection. | 11-18-2010 |
20140063598 | ADAPTIVE DEVICE FOR INSPECTING ENDFACES OF FIBER-OPTIC CONNECTOR HAVING MULTIPLE ROWS OF FIBERS - A device for shifting the imaging axis of a microscope for inspecting endfaces of a fiber-optic connector having multiple rows of endfaces has a supporting body for receiving a microscope; a first swinging lever mounted on top of the supporting body and rotatable about a first swinging axis perpendicular to the imaging axis of the microscope; a first connecting piece extending from the first swinging lever towards the imaging axis; a second swinging lever pivoted on the first connecting piece and rotatable about a second swinging axis perpendicular to the first swinging axis; and a fitting tip connected to the second swinging lever for interfacing with the fiber-optic connector. Using two sets of biasing means and adjustment drivers, the imaging axis passing through the supporting body and the fitting tip can be shifted in two mutually perpendicular directions to selectively align with any endface of the fiber-optic connector. | 03-06-2014 |
20140268114 | APPARATUS FOR SIMULTANEOUSLY INSPECTING AND CLEANING FIBER CONNECTOR - The fiberscope for inspecting and cleaning a fiber connector simultaneously includes a housing with a front panel, a microscope system, a connector holder mounted at a distance from the front panel for receiving a connector ferrule of a fiber connector, and a translation stage for moving the microscope system transversely to align its optical axis with the connector ferrule. The fiberscope further includes a hand knob attached to a fine screw through the connector holder for adjusting the vertical position of the connector ferrule, a mirror pivotally mounted between the connector holder and the front panel, an LED lamp, air nozzles attached to the front panel, and a cleaning air tube for supplying compressed air to the air nozzles. The cleaning air from the air nozzles spray sideways onto the fiber endfaces so that the cleaning air bounces off sideways to avoid secondary contamination. | 09-18-2014 |
20140268813 | LIGHTING DEVICE WITH VIRTUAL LIGHT SOURCE - A lighting device includes a light source and an enclosure enclosing the light source wherein a portion of the enclosure has a focus-forming curvature such that when the light from the light source is reflected off the enclosure element the reflected light intersects at the focus of the curvature and creates a virtual light source at the focus. A reflective coating or a reflective material may be applied to the enclosure, or a ball lens may be used around the light source, to increase the intensity of the reflected light and of the virtual light source. A diffuser may be used to change the size and shape of the virtual light source. | 09-18-2014 |
20140327756 | USER-FRIENDLY WIRELESS FIBER OPTIC ENDFACE INSPECTOR - A wireless fiber optic endface inspector includes a video microscope capable of wirelessly transmitting video streaming signal of endface image in real-time to a display device. The video microscope includes a microscope optical system, an adapting tip for interfacing an endface, an LED light source, a camera module for receiving and converting the endface image into video streaming signal, a Wi-Fi AP board, and a battery for supplying power. The video microscope may be constructed by adding a Wi-Fi AP board and a battery to a conventional inspector microscope. The display device has software for detecting when the endface is focused. Once the endface is focused, the display device emits an audio signal to alert the operator, who may then trigger the display device to analyze the endface image using an endface analysis software or save it to a folder, or transmit the image to a remote server. | 11-06-2014 |
20140354977 | FITTING TIP WITH RELAY LENS FOR FIBER-OPTIC CONNECTOR ENDFACE INSPECTOR - A fitting tip of fiber-optic connector endface inspection microscope for inspecting angled connector endfaces includes a relay lens fixed inside its internal channel and is designed such that when it is received in an intended connector adapter and mounted to the inspection microscope, the normal line to the connector endface forms an acute angle γ with the optical axis of the relay lens; the ray exiting from the relay lens and conjugate to the ray along the normal line is aligned with the optical axis of the inspection microscope; and as a result the connector endface is imaged on an imaging plane within the focusing adjustment range of the inspection microscope. The best image of the connector endface is obtained when the angle γ is half of the inclined angle of the angled connector endface. | 12-04-2014 |
Patent application number | Description | Published |
20120087871 | WASP, HORNET, AND YELLOWJACKET SPRAY REPELLANT AND NEST PESTICIDE - Methods for killing insects and a nest are disclosed. The methods may be used to disrupt a colony of nestdwelling insects. The insects may include wasps, hornets, and yellowjackets. | 04-12-2012 |
20130004603 | WASP, HORNET, AND YELLOWJACKET SPRAY REPELLANT AND NEST PESTICIDE - Methods for killing insects and a nest are disclosed. The methods may be used to disrupt a colony of nest-dwelling insects. The insects may include wasps, hornets, and yellowjackets. | 01-03-2013 |
20130078211 | MURGANTIOL AS A STINK BUG SYNERGISTIC ATTRACTANT FOR USE OUTDOORS - Provided herein are uses of the Harlequin bug pheromone, murgantiol, alone or in a synergistic combination with at least one other stink bug attractant, such as methyl (2E,4E,6Z)-decatrienoate or methyl (2E,4Z)-decadienoate, or both, for attracting stink bugs such as the brown marmorated stink bug in outdoor settings. Stink bug traps comprising murgantiol, or synergistic compositions comprising murgantiol with at least one other stink bug attractant, and methods of using these compositions in traps outdoors are provided. Compositions comprising murgantiol are also described as synergistic combinations of murgantiol with at least one other stink bug attractant. | 03-28-2013 |
Patent application number | Description | Published |
20090086275 | PROCESSING A DIGITAL IMAGE OF CONTENT - Systems, methods and processes for processing a digital image of content to generate an on-demand print ready document are presented. An obtained digital image of content includes a plurality of image pages. To process the digital image, for each image page in the digital image, the following steps are performed. Each image page is oriented such that a content bounding box of the image page is aligned with a desired page orientation. Boundary and content areas are identified for each image page, wherein the boundary area and the content area are separated by the content bounding box. Artifacts are removed from within the boundary area based on a set of first criteria. Artifacts are removed from within the content area based on a set of second criteria. The plurality of image pages are assembled in order of a desired sequence and an on-demand print ready document is generated with the plurality of assembled image pages. | 04-02-2009 |
20090171750 | INCORPORATING ADVERTISING IN ON-DEMAND GENERATED CONTENT - A system and a method of incorporating advertisements in on-demand printed content are disclosed. In response to receiving a request from a consumer for on-demand printed content, an advertisement is selected. The selected advertisement is included within the requested content. Thereafter, and further responsive to the request, an on-demand printed copy of the requested content, included the selected advertisement, is printed. | 07-02-2009 |
20090171751 | ON-DEMAND GENERATING E-BOOK CONTENT WITH ADVERTISING - A method of providing fixed computer-displayable content in response to a consumer request for content is presented. Upon obtaining a digital image corresponding to the requested content, an advertisement is selected. The advertisement is to be included in an on-demand electronic content corresponding to the requested content. The advertisement is included with the digital image corresponding to the requested content. A fixed computer-displayable content corresponding to the requested content is generated. The fixed computer-displayable content is then provided to the consumer. | 07-02-2009 |
20140372186 | On-Demand Generating E-Book Content with Advertising - A method of providing fixed computer-displayable content in response to a consumer request for content is presented. Upon obtaining a digital image corresponding to the requested content, an advertisement is selected. The advertisement is to be included in an on-demand electronic content corresponding to the requested content. The advertisement is included with the digital image corresponding to the requested content. A fixed computer-displayable content corresponding to the requested content is generated. The fixed computer-displayable content is then provided to the consumer. | 12-18-2014 |
Patent application number | Description | Published |
20100203590 | ANTIBODIES THAT BIND INTERLEUKIN-4 RECEPTOR - The present invention relates to antibodies that bind to the IL-4 receptor, fragments, muteins, and derivatives of such antibodies, nucleic acids encoding such antibodies, fragments, muteins and derivatives, and methods of making and using such antibodies, fragments, muteins, derivatives and nucleic acids. Methods for treating medical conditions induced by interleukin-4 involve administering an IL-4 receptor binding antibody, or an IL-4 receptor binding fragment, mutein, or derivative of an IL-4 receptor binding antibody, to a patient afflicted with such a condition. Particular antibodies provided herein include human monoclonal antibodies. Certain of the antibodies inhibit both IL-4-induced and IL-13-induced biological activities. | 08-12-2010 |
20110081361 | ANTIBODIES THAT BIND INTERLEUKIN-4 RECEPTOR - The present invention relates to antibodies that bind to the IL-4 receptor, fragments, muteins, and derivatives of such antibodies, nucleic acids encoding such antibodies, fragments, muteins and derivatives, and methods of making and using such antibodies, fragments, muteins, derivatives and nucleic acids. Methods for treating medical conditions induced by interleukin-4 involve administering an IL-4 receptor binding antibody, or an IL-4 receptor binding fragment, mutein, or derivative of an IL-4 receptor binding antibody, to a patient afflicted with such a condition. Particular antibodies provided herein include human monoclonal antibodies. Certain of the antibodies inhibit both IL-4-induced and IL-13-induced biological activities. | 04-07-2011 |
20120039880 | FRAGMENTATION RESISTANT IgG1 Fc-CONJUGATES - The present invention provides compositions and methods relating to human IgG1 and IgG3 Fc-conjugates which are resistant to free-radical mediated fragmentation and aggregation. The present invention also provides compositions and methods for making the Fc-conjugates of the invention. | 02-16-2012 |
20120116057 | DESIGN OF STABLE AND AGGREGATION FREE ANTIBODY FC MOLECULES THROUGH CH3 DOMAIN INTERFACE ENGINEERING - The present invention relates to methods of increasing stability and reducing aggregation in compositions comprising antibody Fc molecules and to composition comprising such molecules. Certain amino acid substitutions in the CH3 domain result in increased stability and reduced aggregation of compositions containing polypeptides comprising a CH3 domain, e.g., an antibody or Fc-fusion protein. | 05-10-2012 |
20120244578 | MONOMERIC ANTIBODY FC - The invention relates to monomeric Fc polypeptides and methods of making and using such polypeptides. The polypeptides comprise substitution of one or more hydrophobic interface residues in the CH3 region with a polar amino acid. | 09-27-2012 |
20120321626 | MULTI-SPECIFIC FAB FUSION PROTEINS AND METHODS OF USE - The present disclosure relates generally to multi-specific Fab fusion proteins (MSFP) which comprise an antibody Fab fragment with both N-termini fused to a fusion moiety (fusion moiety A or B). MSFP containing the Fab fragment exhibit significantly reduced binding ability of the Fab fragment to the Fab target. Binding of the Fab to its target is restored when the MSFP is clustered on a cell surface by binding of the fusion moieties to their target. The reduced binding of the Fab to its target, especially when presented on a cell surface in its native state, absent fusion moiety binding provides advantages such as: reduced side effects and allows desirable pharmacological effects of selectivity and specificity in a controlled manner. | 12-20-2012 |
20130115215 | DOMAIN INSERTION IMMUNOGLOBULIN - Described herein is an antibody format, which is amenable to bispecific antibody creation. This format is referred to herein as “Domain Insertion Immunoglobulin G” or “(Di-IgG)”. The Di-IgG molecules are capable of specifically binding two different antigens simultaneously, show high level recombinant expression, and are sufficiently aggregation-free to be amenable to commercial production. Further described herein are, Di-IgG-encoding nucleic acids and vectors, host cells for making Di-IgGs, Di-IgG pharmaceutical compositions, and methods of treatment. | 05-09-2013 |
20150056206 | MULTI-SPECIFIC FAB FUSION PROTEINS AND METHODS OF USE - The present disclosure relates generally to multi-specific Fab fusion proteins (MSFP) which comprise an antibody Fab fragment with both N-termini fused to a fusion moiety (fusion moiety A or B). MSFP containing the Fab fragment exhibit significantly reduced binding ability of the Fab fragment to the Fab target. Binding of the Fab to its target is restored when the MSFP is clustered on a cell surface by binding of the fusion moieties to their target. The reduced binding of the Fab to its target, especially when presented on a cell surface in its native state, absent fusion moiety binding provides advantages such as: reduced side effects and allows desirable pharmacological effects of selectivity and specificity in a controlled manner. | 02-26-2015 |
Patent application number | Description | Published |
20080306903 | CARDINALITY ESTIMATION IN DATABASE SYSTEMS USING SAMPLE VIEWS - A system and method that facilitates and effectuates estimating the result of performing a data analysis operation on a set of data. Employing an approximation of the data analysis operation on a statistically valid random sample view of the data allows for a statistically accurate estimate of the result to be obtained. Sequential sampling in the view enables the approximated operation to evaluate accuracy conditions at intervals during the scan of the sample view and obtain the estimated result without having to scan the entire sample view. Feedback regarding the accuracy of the estimated result can be captured when the data analysis operation is performed against the set of data. Process control techniques can be employed with the feedback to maintain the statistical validity of the sample view. | 12-11-2008 |
20090064160 | Transparent lazy maintenance of indexes and materialized views - Described herein is a materialized view or index maintenance system that includes a task generator component that receives an indication that an update transaction has committed against a base table in a database system. The task generator component, in response to the update transaction being received, generates a maintenance task for one or more of a materialized view or an index that is affected by the update transaction. A maintenance component transparently performs the maintenance task when a workload of a CPU in the database system is below a threshold or when an indication is received that a query that uses the one or more of the materialized view or the index has been received. | 03-05-2009 |
20090327255 | VIEW MATCHING OF MATERIALIZED XML VIEWS - A materialized XML view matching system and method for processing of SQLXML queries using view matching of materialized XML views. The view matching process of the embodiments of the system and method use a multi-path tree (MPT) data structure. Embodiments of the materialized XML view matching system and method construct an MPT data structure for each input query and view expression. View matching is performed on the MPT data structures to generate a set of partial matches, which then are cleaned to generate a set of candidate matches. A valid match definition is generated by testing each candidate match for different forms of compliance. Using the valid match definition, a set of valid matches is identified and extracted. For each valid match, a substitute query expression is constructed that can serve as a replacement for the original query. These substitute queries can be used to evaluate the original query. | 12-31-2009 |
20100175049 | SCOPE: A STRUCTURED COMPUTATIONS OPTIMIZED FOR PARALLEL EXECUTION SCRIPT LANGUAGE - Embodiments of the present invention relate to systems, methods and computer storage media for providing Structured Computations Optimized for Parallel Execution (SCOPE) that facilitate analysis of a large-scale dataset utilizing row data of those data sets. SCOPE includes, among other features, an extract command for extracting data bytes from a data stream and structuring the data bytes as data rows having strictly defined columns. SCOPE also includes a process command and a reduce command that identify data rows as inputs. The reduce command also identifies a reduce key that facilitates the reduction based on the reduce key. SCOPE additionally includes a combine command that identifies two data row sets that are to be combined based on an identified joint condition. Additionally, SCOPE includes a select command that leverages SQL and C# languages to create an expressive script that is capable of analyzing large-scale data sets in a parallel computing environment. | 07-08-2010 |
20100281005 | Asynchronous Database Index Maintenance - This disclosure provides techniques for asynchronously maintaining database indexes or sub-indexes. For example, a database management server may receive a data manipulation statement to modify particular data stored in a database and determine whether an index associated with executing the statement is maintained asynchronously. When the index is maintained asynchronously, maintenance of the index to reflect changes made to the particular data by executing the data manipulation statement may be delayed until an index maintenance event. The index maintenance may be based on an isolation level of a transaction including a query that triggered the index maintenance. | 11-04-2010 |
20110153593 | EXPLOITING PARTITIONING, GROUPING, AND SORTING IN QUERY OPTIMIZATION - An optimizer uses comprehensive reasoning regarding partitioning, sorting, and grouping properties for query optimization. When optimizing an input query expression, logical exploration generates alternative logical expressions. Physical optimization explores physical operator alternatives for logical operators. Required partitioning, sorting, and grouping properties of inputs to physical operators are determined. Additionally, delivered partitioning, sorting, and grouping properties of outputs from physical operators are determined. In some embodiments, enforcer rules are employed to modify structural property requirements to introduce alternatives for consideration. Property matching identifies valid execution plans in which the delivered partitioning, sorting, and grouping properties satisfy corresponding required partitioning, sorting, and grouping properties. An execution plan having the lowest cost is selected as the optimized execution plan. | 06-23-2011 |
20120096001 | AFFINITIZING DATASETS BASED ON EFFICIENT QUERY PROCESSING - Embodiments of the present invention relate to systems, methods, and computer-storage media for affinitizing datasets based on efficient query processing. In one embodiment, a plurality of datasets within a data stream is received. The data stream is partitioned based on efficient query processing. Once the data stream is partitioned, an affinity identifier is assigned to datasets based on the partitioning of the dataset. Further, when datasets are broken into extents, the affinity identifier of the parent dataset is retained in the resulting extent. The affinity identifier of each extent is then referenced to preferentially store extents having common affinity identifiers within close proximity of one other across a data center. | 04-19-2012 |
20120284719 | DISTRIBUTED MULTI-PHASE BATCH JOB PROCESSING - A distributed job-processing environment including a server, or servers, capable of receiving and processing user-submitted job queries for data sets on backend storage servers. The server identifies computational tasks to be completed on the job as well as a time frame to complete some of the computational tasks. Computational tasks may include, without limitation, preprocessing, parsing, importing, verifying dependencies, retrieving relevant metadata, checking syntax and semantics, optimizing, compiling, and running. The server performs the computational tasks, and once the time frame expires, a message is transmitted to the user indicating which tasks have been completed. The rest of the computational tasks are subsequently performed, and eventually, job results are transmitted to the user. | 11-08-2012 |
20130332446 | EFFICIENT PARTITIONING TECHNIQUES FOR MASSIVELY DISTRIBUTED COMPUTATION - A repartitioning optimizer identifies alternative repartitioning strategies and selects optimal ones, accounting for network transfer utilization and partition sizes in addition to traditional metrics. If prior partitioning was hash-based, the repartitioning optimizer can determine whether a hash-based repartitioning can result in not every computing device providing data to every other computing device. If prior partitioning was range-based, the repartitioning optimizer can determine whether a range-based repartitioning can generate similarly sized output partitions while aligning input and output partition boundaries, increasing the number of computing devices that do not provide data to every other computing device. Individual computing devices, as they are performing a repartitioning, assign a repartitioning index to each individual data element, which represents the computing device to which such a data element is destined. The indexed data is sorted by such repartitioning indices, thereby grouping together all like data, and then stored in a sequential manner. | 12-12-2013 |
20130346988 | PARALLEL DATA COMPUTING OPTIMIZATION - The use of statistics collected during the parallel distributed execution of the tasks of a job may be used to optimize the performance of the task or similar recurring tasks. An execution plan for a job is initially generated, in which the execution plan includes tasks. Statistics regarding operations performed in the tasks are collected while the tasks are executed via parallel distributed execution. Another execution plan is then generated for another recurring job, in which the additional execution plan has at least one task in common with the execution plan for the job. The additional execution plan is subsequently optimized based at least on the statistics to produce an optimized execution plan. | 12-26-2013 |
20140297680 | ANALYZING MULTIPLE DATA STREAMS AS A SINGLE DATA OBJECT - Embodiments of the present invention allow multiple data streams to be analyzed as a single data set. The single data set may be described as a stream set herein. The multiple streams that are included in the stream set may be specified through a user script or query. For example, a query may be used to gather all streams created within a date range. The query could include one or more filters to gather certain information from the data streams or to exclude certain data streams that otherwise are in the query's range. A stream may be an unstructured byte stream of data. The stream may be created by append-only writing to the end of the stream. The stream could also be a structured stream that includes metadata that defines column structure and affinity/clustering information. | 10-02-2014 |
20150058316 | Continuous Cloud-Scale Query Optimization and Processing - Runtime statistics from the actual performance of operations on a set of data are collected and utilized to dynamically modify the execution plan for processing a set of data. The operations performed are modified to include statistics collection operations, the statistics being tailored to the specific operations being quantified. Optimization policy defines how often optimization is attempted and how much more efficient an execution plan should be to justify transitioning from the current one. Optimization is based on the collected runtime statistics but also takes into account already materialized intermediate data to gain further optimization by avoiding reprocessing. | 02-26-2015 |
20160006779 | DISTRIBUTED STREAM PROCESSING IN THE CLOUD - A low-latency cloud-scale computation environment includes a query language, optimization, scheduling, fault tolerance and fault recovery. An event model can be used to extend a declarative query language so that temporal analysis of event of an event stream can be performed. Extractors and outputters can be used to define and implement functions that extend the capabilities of the event-based query language. A script written in the extended query language can be translated into an optimal parallel continuous execution plan. Execution of the plan can be orchestrated by a streaming job manager which schedules vertices on available computing machines. The streaming job manager can monitor overall job execution. Fault tolerance can be provided by tracking execution progress and data dependencies in each vertex. In the event of a failure, another instance of the failed vertex can be scheduled. An optimal recovery point can be determined based on checkpoints and data dependencies. | 01-07-2016 |
20160048771 | DISTRIBUTED STAGE-WISE PARALLEL MACHINE LEARNING - A method for machine learning a data set in a data processing framework is disclosed. A forest is trained with the data set that generates a plurality of trees in parallel. Each tree includes leaf nodes having a constant weight. A discriminative value for each leaf node is learned with a supervised model. The forest is reconstructed with the discriminative values replacing the constant weight for each leaf node. | 02-18-2016 |
20160098292 | JOB SCHEDULING USING EXPECTED SERVER PERFORMANCE INFORMATION - A job scheduler that schedules ready tasks amongst a cluster of servers. Each job might be managed by one scheduler. In that case, there are multiple job schedulers which conduct scheduling for different jobs concurrently. To identify a suitable server for a given task, the job scheduler uses expected server performance information received from multiple servers. For instance, the server performance information might include expected performance parameters for tasks of particular categories if assigned to the server. The job management component then identifies a particular task category for a given task, determines which of the servers can perform the task by a suitable estimated completion time, and then assigns based on the estimated completion time. The job management component also uses cluster-level information in order to determine which server to assign a task to. | 04-07-2016 |
Patent application number | Description | Published |
20100316987 | EDUCATIONAL SERVICES AND CONTRACTS - Described is a technology in which an educational service provides contracts (an interface set) for calling functions that allow management of educational-related data. The interface set may be divided as interfaces to various services; roles associated with users of the educational service determine which interfaces/functions each user can call. The interfaces may include interfaces for calling course-related functions (e.g., of a course service), profile-related functions (e.g., of a profile service), membership-related functions (e.g., of a membership service) and task-related functions (e.g., of a task service). Other interfaces may include interfaces for calling plan-related functions, group-related functions, content-related functions, notification-related functions, provisioning-related functions, institution-related functions, department-related functions, utilities-related functions, standards-related functions, degree program-related functions, contextual communication-related functions and/or scoring related functions. | 12-16-2010 |
20100318589 | EDUCATIONAL ENTITY ARCHITECTURE AND OBJECT MODEL - Described is a technology in which a set of objects represent educational entities of an educational model, with relationships between objects. For example, a course object instance may have a relationship with a task instance and a user instance (such as representing a student). Other objects may include user credentials objects, group objects, degree program objects, course plan objects, institution objects, school objects, and/or department objects. The set of objects may be pre-defined and maintained in a persistent storage; this pre-defined set may be extended with an extended object that has relationships with pre-defined objects. The educational entities of an object model may be maintained in rows of a table, with each row having a field that identifies which entity is represented by that row. The table is accessed to determine relationships between an instantiated object for an entity and at least one other instantiated object for another entity. | 12-16-2010 |
20100318657 | Educational Adaptive Provider Architecture - The educational adaptive provider architecture described herein provides a way for an educational services framework to be built on varying underlying existing technologies without any changes in the object model and services. The provider framework supports the ability to have multiple types of providers for various services, such as, for example, for authorization, authentication, communication, grouping, scoring, social-networking, storage and user functions. The educational adaptive provider architecture provides easy integration of existing institutional and educational service deployments. | 12-16-2010 |
Patent application number | Description | Published |
20110313847 | MAPPING IDENTIFIERS - Systems and methods for mapping identifiers are provided. Activity logs illustrate activities and/or events associated with a plurality of identifiers. The identifiers may be registered identifiers, unregistered identifiers, or a combination thereof. When at least two identifiers share a linking attribute, the at least two identifiers may be mapped to one another, along with information associated therewith (if any) such as a user profile. Each subsequent line of an activity line may also be mapped to the identifiers of the initial single line when a linking attribute or an overlapping identifier is present. A number of identifiers associated with each other may be increased by mapping identifiers and, thus, a targeted audience for a customized advertisement may, in turn, be increased. | 12-22-2011 |
20120072554 | NODE CLUSTERING - Large sets of unorganized data may provide little value in identifying useful observations from such data. For example, an online merchant may maintain a database of millions of user IDs (e.g., a cookie ID, a login ID, a device ID, a network ID, etc.) along with content viewed and/or actions taken with the user IDs, where minimal associations are known between user IDs. It may be advantageous to link together user IDs of respective users to capture a comprehensive view of respective users' activities. Accordingly, one or more systems and/or techniques for identifying a cluster of nodes based upon transforming a set of node pairings (e.g., pairings of related nodes) one or more times are disclosed herein. Iterative transformations may be performed until respective nodes are paired with merely their smallest neighboring node and are paired with no other node. In this way, node clusters may be identifiable. | 03-22-2012 |
Patent application number | Description | Published |
20080199656 | Three-dimensional microstructures and methods of formation thereof - Provided are three-dimensional microstructures and their methods of formation. The microstructures are formed by a sequential build process and include microstructural elements which are affixed to one another. The microstructures find use, for example, in coaxial transmission lines for electromagnetic energy. | 08-21-2008 |
20090001499 | THICK ACTIVE LAYER FOR MEMS DEVICE USING WAFER DISSOLVE PROCESS - Methods for producing MEMS (microelectromechanical systems) devices with a thick active layer and devices produced by the method. An example method includes heavily doping a first surface of a first silicon wafer with P-type impurities, and heavily doping a first surface of a second silicon wafer with N-type impurities. The heavily doped first surfaces are then bonded together, and a second side of the first wafer opposing the first side of the first wafer is thinned to a desired thickness, which may be greater than about 30 micrometers. The second side is then patterned and etched, and the etched surface is then heavily doped with P-type impurities. A cover is then bonded to the second side of the first wafer, and the second wafer is thinned. | 01-01-2009 |
20090025477 | SENSOR WITH POSITION-INDEPENDENT DRIVE ELECTRODES IN MULTI-LAYER SILICON ON INSULATOR SUBSTRATE - A micoroelectromechanical system (MEMS) includes a housing defining an enclosed cavity, stator tines extending from the housing into the cavity, a MEMS device located within the cavity, the MEMS device including a proof mass and rotor tines extending from the proof mass, each rotor tine being positioned at a capacitive distance from a corresponding stator tine. The rotor tines include a first section extending a first distance from an insulating layer of the rotor tines and a second section extending a second distance from the insulating layer in an opposite direction from the first section. The stator tines include a first section extending a first distance from an insulating layer of the stator tines and a second section extending a second distance from the insulating layer in an opposite direction from the first section, the stator tine first distance being greater than the rotor tine first distance. | 01-29-2009 |
20090166827 | MECHANICAL ISOLATION FOR MEMS DEVICES - A device according to the present invention includes a MEMS device supported on a first side of a die. A first side of an isolator is attached to the first side of the die. A package is attached to the first side of the isolator, with at least one electrically conductive attachment device attaching the die to the isolator and attaching the isolator to the package. The isolator may include isolation structures and a receptacle. | 07-02-2009 |
20090321008 | SYSTEMS AND METHODS FOR FABRICATING AN OUT-OF-PLANE MEMS STRUCTURE - System and methods offset mechanism elements during fabrication of Micro-Electro-Mechanical Systems (MEMS) devices. An exemplary embodiment applies a voltage across an offset mechanism element and a bonding layer of a MEMS device to generate an electrostatic charge between the offset mechanism element and the bonding layer, wherein the electrostatic charge draws the offset mechanism element to the bonding layer. The offset mechanism element and the bonding layer are then bonded. | 12-31-2009 |
20100326191 | BIDIRECTIONAL, OUT-OF-PLANE, COMB DRIVE ACCELEROMETER - A bi-directional, out-of-plane electrostatic comb drive apparatus including two electrically independent sets of stator comb tines; and a method for fabricating an out-of-plane comb drive with stacked sets of stator comb tines. A first set of stator comb tines is offset from a second set of stator comb tines. A set of rotor comb tines interleaves with both sets of stator comb tines. A first voltage applied to the first set of stator comb tines operates to pull the rotor tines toward the first set of stator comb tines. A second voltage applied to the second set of stator comb tines operates to pull the rotor tines toward the second set of stator comb tines, enabling bi-directional operation. A fabrication method is disclosed that enables fabrication of the first and second sets of stator comb tines that are mechanically and electrically independent and interleaved by the rotor comb tines. | 12-30-2010 |
20130341735 | ANODICALLY BONDED STRAIN ISOLATOR - A stress isolator that allows a sensor to be attached to materials of the same coefficient of thermal expansion and still provide the required elastic isolation between the sensor and the system to which it is mounted. The isolator is made of two materials, borosilicate glass and silicon. The glass is the same material as the mounting surface of the microelectromechanical system (MEMS) sensors. The silicon makes an excellent isolator, being very elastic and easy to form into complex shapes. The two materials of the isolator are joined using an anodic bond. The construction of the isolator can be specific to different types of MEMS sensors, making the most of their geometry to reduce overall volume. | 12-26-2013 |
Patent application number | Description | Published |
20100228744 | INTELLIGENT ENHANCEMENT OF A SEARCH RESULT SNIPPET - A method, system, and medium are provided for enhancing a search result snippet that is associated with a URL. Potentially descriptive terms of the URL are identified by reconciling multiple sources of terms related to the URL. One aspect includes comparing search terms of historically relevant queries to anchor text for the URL. The search result snippet might be intelligently enhanced by causing common terms to be visibly distinguished when the snippet is displayed. | 09-09-2010 |
20110225152 | CONSTRUCTING A SEARCH-RESULT CAPTION - The present invention is related to constructing a search-result caption that represents content of a search result (e.g., webpage). Information that is extracted from the webpage and/or other webpages is categorized and ranked based on a perceived relevance to a user context. Extracted information is then compared for inclusion in the search-result caption in order to provide a caption that accurately reflects content of the webpage and that is relevant to a context of the user | 09-15-2011 |
20110307482 | SEARCH RESULT DRIVEN QUERY INTENT IDENTIFICATION - A system and method are provided for detecting entity information contained within search results. The detected entity information can be used to determine a category of entity as well as a specific entity within the search results. The entity information can be used to alter the style and/or format of the presented results based the detected entity category. | 12-15-2011 |
20110307483 | ENTITY DETECTION AND EXTRACTION FOR ENTITY CARDS - A system and method are provided for detecting entity information contained within search results. The detected entity information can be used to determine a category of entity as well as a specific entity within the search results. Entity information can be extracted from the documents associated with the search results. This information can be used as part of the information for an entity card, which can be displayed to a user in conjunction with and/or in place of the search results. | 12-15-2011 |
20120059838 | PROVIDING ENTITY-SPECIFIC CONTENT IN RESPONSE TO A SEARCH QUERY - Computer-readable media, computer systems, and computing devices facilitate providing entity-specific content to a user in response to a search request. A search request is received from a user and determined to be related to an entity. Domains associated with the entity are also identified. The search service identifies a set of potential answers and uses the potential answers to generate a set of reformulation queries, which are used to query answer services. Answers returned by the answer services are ranked and bound to an entity card, which is subjected to a quorum checking process that facilitates optimization of the use of allocated screen real estate associated with the entity card. A representation of the entity card is presented on a search-results page. | 03-08-2012 |
20160034471 | ENTITY DETECTION AND EXTRACTION FOR ENTITY CARDS - A system and method are provided for detecting entity information contained within search results. The detected entity information can be used to determine a category of entity as well as a specific entity within the search results. Entity information can be extracted from the documents associated with the search results. This information can be used as part of the information for an entity card, which can be displayed to a user in conjunction with and/or in place of the search results. | 02-04-2016 |
Patent application number | Description | Published |
20130013928 | Secure Credential Unlock Using Trusted Execution Environments - Computing devices utilizing trusted execution environments as virtual smart cards are designed to support expected credential recovery operations when a user credential, e.g., personal identification number (PIN), password, etc. has been forgotten or is unknown. A computing device generates a cryptographic key that is protected with a PIN unlock key (PUK) provided by an administrative entity. If the user PIN cannot be input to the computing device the PUK can be input to unlock the locked cryptographic key and thereby provide access to protected data. A computing device can also, or alternatively, generate a group of challenges and formulate responses thereto. The formulated responses are each used to secure a computing device cryptographic key. If the user PIN cannot be input to the computing device an entity may request a challenge. The computing device issues a challenge from the set of generated challenges. Upon receiving a valid response back, the computing device can unlock the secured computing device cryptographic key associated with the issued challenge and subsequently provide access to protected data. | 01-10-2013 |
20140101454 | SECURE CREDENTIAL UNLOCK USING TRUSTED EXECUTION ENVIRONMENTS - Computing devices utilizing trusted execution environments as virtual smart cards are designed to support expected credential recovery operations when a user credential, personal identification number (PIN), password, etc. has been forgotten or is unknown. A computing device generates a cryptographic key that is protected with a PIN unlock key (PUK) provided by an administrative entity. If the user PIN cannot be input to the computing device the PUK can be input to unlock the locked cryptographic key and thereby provide access to protected data. A computing device can also, or alternatively, generate a group of challenges and formulate responses thereto. The formulated responses are each used to secure a computing device cryptographic key. If the user PIN cannot be input to the computing device an entity may request a challenge. The computing device issues a challenge from the set of generated challenges. Upon receiving a valid response back, the computing device can unlock the secured computing device cryptographic key associated with the issued challenge and subsequently provide access to protected data. | 04-10-2014 |
20150213278 | SECURE CREDENTIAL UNLOCK USING TRUSTED EXECUTION ENVIRONMENTS - Computing devices utilizing trusted execution environments as virtual smart cards are designed to support expected credential recovery operations when a user credential, e.g., personal identification number (PIN), password, etc. has been forgotten or is unknown. A computing device generates a cryptographic key that is protected with a PIN unlock key (PUK) provided by an administrative entity. If the user PIN cannot be input to the computing device the PUK can be input to unlock the locked cryptographic key and thereby provide access to protected data. A computing device can also, or alternatively, generate a group of challenges and formulate responses thereto. The formulated responses are each used to secure a computing device cryptographic key. If the user PIN cannot be input to the computing device an entity may request a challenge. The computing device issues a challenge from the set of generated challenges. Upon receiving a valid response back, the computing device can unlock the secured computing device cryptographic key associated with the issued challenge and subsequently provide access to protected data. | 07-30-2015 |
Patent application number | Description | Published |
20150195525 | SELECTION OF MOTION VECTOR PRECISION - Approaches to selection of motion vector (“MV”) precision during video encoding are presented. These approaches can facilitate compression that is effective in terms of rate-distortion performance and/or computational efficiency. For example, a video encoder determines an MV precision for a unit of video from among multiple MV precisions, which include one or more fractional-sample MV precisions and integer-sample MV precision. The video encoder can identify a set of MV values having a fractional-sample MV precision, then select the MV precision for the unit based at least in part on prevalence of MV values (within the set) having a fractional part of zero. Or, the video encoder can perform rate-distortion analysis, where the rate-distortion analysis is biased towards the integer-sample MV precision. Or, the video encoder can collect information about the video and select the MV precision for the unit based at least in part on the collected information. | 07-09-2015 |
20150195527 | Representing Motion Vectors in an Encoded Bitstream - A format for use in encoding moving image data, comprising: a sequence of frames including plurality of the frames in which at least a region is encoded using motion estimation; a respective set of motion vector values representing motion vectors of the motion estimation for each respective one of these frames or each respective one of one or more regions within each of such frames; and at least one respective indicator associated with each of the respective frames or regions, indicating whether the respective motion vector values of the respective frame or region are encoded at a first resolution or a second resolution. | 07-09-2015 |
20150195557 | Encoding Screen Capture Data - An input of an encoder receives moving image data comprising a sequence of frames to be encoded, each frame comprising a plurality of blocks in two dimensions with each block comprising a plurality of pixels in those two dimensions. A motion prediction module performs encoding by, for at least part of each of a plurality of said frames, coding each block relative to a respective reference portion of another frame of the sequence, with the respective reference portion being offset from the block by a respective motion vector. According to the present disclosure, the moving image data of this plurality of frames comprises a screen capture stream, and the motion prediction module is configured to restrict each of the motion vectors of the screen capture stream to an integer number of pixels in at least one of said dimensions. | 07-09-2015 |