Patent application number | Description | Published |
20090163511 | Carboxamide, Sulfonamide and Amine Compounds and Methods for Using The Same - Disclosed are carboxamide, sulfonamide and amine compounds, as well as pharmaceutical compositions and methods of use. One embodiment is a compound having the structure | 06-25-2009 |
20090170829 | Carboxamide, Sulfonamide and Amine Compounds and Methods for Using The Same - Disclosed are carboxamide, sulfonamide and amine compounds, as well as pharmaceutical compositions and methods of use. One embodiment is a compound having the structure | 07-02-2009 |
20090186894 | N-Substituted-Heterocycloalkyloxybenzamide Compounds and Methods of Use - The present invention provides N-substituted-heterocycloalkyloxybenzamide compounds, as well as pharmaceutical compositions and methods of use. One embodiment of the invention is a compound having the structure | 07-23-2009 |
20090258864 | PYRIMIDINE-2-AMINE COMPOUNDS AND THEIR USE AS INHIBITORS OF JAK KINASES - This invention is directed to compounds of formula (I): | 10-15-2009 |
20090275609 | Carboxamide Compounds and Methods for Using The Same - Disclosed are carboxamide compounds, as well as pharmaceutical compositions and methods of use. One embodiment is a compound having the structure | 11-05-2009 |
20100190802 | CARBOXAMIDE COMPOUNDS AND METHODS FOR USING THE SAME - Disclosed are carboxamide compounds as well as pharmaceutical compositions and methods of use. One embodiment is a compound having the structure | 07-29-2010 |
20110306767 | N-Substituted-Heterocycloalkyloxybenzamide Compounds and Methods of Use - The present invention provides N-substituted-heterocycloalkyloxybenzamide compounds, as well as pharmaceutical compositions and methods of use. One embodiment of the invention is a compound having the structure | 12-15-2011 |
20120108606 | Carboxamide, Sulfonamide and Amine Compounds and Methods for Using The Same - Disclosed are carboxamide, sulfonamide and amine compounds, as well as pharmaceutical compositions and methods of use. One embodiment is a compound having the structure | 05-03-2012 |
20120115838 | AMPK-Activating Heterocycloalkyloxy(Hetero)Aryl Carboxamide, Sulfonamide And Amine Compounds And Methods For Using The Same - Disclosed are carboxamide, sulfonamide and amine compounds, as well as pharmaceutical compositions and methods of use. One embodiment is a compound having the structure | 05-10-2012 |
20130018041 | PYRIMIDINE-2-AMINE COMPOUNDS AND THEIR USE AS INHIBITORS OF JAK KINASES - This invention is directed to compounds of formula (I): | 01-17-2013 |
20130023660 | Carboxamide Compounds and Methods for Using the Same - Disclosed are carboxamide compounds, as well as pharmaceutical compositions and methods of use. One embodiment is a compound having the structure | 01-24-2013 |
20130131078 | Carboxamide Compounds And Methods For Using The Same - Disclosed are carboxamide compounds as well as pharmaceutical compositions and methods of use. One embodiment is a compound having the structure | 05-23-2013 |
20140045882 | Carboxamide, Sulfonamide and Amine Compounds and Methods for Using The Same - Disclosed are carboxamide, sulfonamide and amine compounds, as well as pharmaceutical compositions and methods of use. One embodiment is a compound having the structure | 02-13-2014 |
20140051673 | AMPK-Activating Heterocycloalkyloxy(Hetero)Aryl Carboxamide, Sulfonamide And Amine Compounds And Methods For Using The Same - Disclosed are carboxamide, sulfonamide and amine compounds, as well as pharmaceutical compositions and methods of use. One embodiment is a compound having the structure | 02-20-2014 |
20140148467 | Carboxamide Compounds and Methods for Using the Same - Disclosed are carboxamide compounds, as well as pharmaceutical compositions and methods of use. One embodiment is a compound having the structure | 05-29-2014 |
20150232451 | Carboxamide Compounds and Methods for Using the Same - Disclosed are carboxamide compounds, as well as pharmaceutical compositions and methods of use. One embodiment is a compound having the structure | 08-20-2015 |
Patent application number | Description | Published |
20140181192 | Ranking Test Framework for Search Results on an Online Social Network - In one embodiment, a method includes accessing a social graph comprising a plurality of nodes and edges, receiving a set of scored results from a user that include results generated by a search algorithm in response to a query from the user and a score for each result, where each result corresponds to a node of the social graph, calculating a gain for each result based on the score of the result, and modifying the search algorithm based on the calculated gain. | 06-26-2014 |
20140330809 | Using Inverse Operators for Queries on Online Social Networks - In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving from a user a structured query comprising references to selected nodes and selected edges, parsing the structure query to identify a first query constraint and one or more second query constraints, identifying a inverse constraint associated with the first query constraint, and generating a query command based on the structured query, where the query command includes the inverse constraint and the one or more second query constraints. | 11-06-2014 |
20140330819 | Search Query Interactions on Online Social Networks - In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving from a user a structured query comprising references to selected nodes and selected edges, generating a query command based on the structured query based on the structured query comprising a first query constraint and a second query constraint, identifying a first set of nodes matching the first query constraint and at least in part matching the second query constraint, identifying a second set of nodes matching the second query constraint, and generating search results based on the first and second set of nodes. | 11-06-2014 |
20140337317 | Approximate Privacy Indexing for Search Queries on Online Social Networks - In one embodiment, a method includes receiving from a first user of an online social network a search query, searching data stores to identify objects that match the search query, where identifying the objects is also based in part on the privacy setting for each object, determining for each identified object a visibility of the object with respect to the first user, and generating one or more search results corresponding to the search query. | 11-13-2014 |
Patent application number | Description | Published |
20090061505 | APPARATUS FOR SELECTIVE EXCITATION OF MICROPARTICLES - Nucleic acid microparticles are sequenced by performing a sequencing reaction on the microparticles using one or more selectively exciting the microparticles in an excitation pattern, optically imaging the microparticles at a resolution insufficient to resolve individual microparticles, and processing the optical images of the microparticles using information on the excitation pattern to determine the presence or absence of the optical signature, which indicates the sequence information of the nucleic acid. An apparatus for optical excitation of the microparticles comprises an optical fiber delivering a first laser beam, and an interference pattern generation module coupled to the optical fiber. The interference pattern generation module splits the first laser beam into second and third laser beams and generates the excitation pattern for selectively exciting the microparticles by interference between the second and third laser beams. | 03-05-2009 |
20090061526 | NUCLEIC ACID SEQUENCING BY SELECTIVE EXCITATION OF MICROPARTICLES - Nucleic acid microparticles are sequenced by performing a sequencing reaction on the microparticles using one or more reagents, selectively exciting the microparticles in an excitation pattern, optically imaging the microparticles at a resolution insufficient to resolve individual microparticles, and processing the optical images of the microparticles using information on the excitation pattern to determine the presence or absence of the optical signature, which indicates the sequence information of the nucleic acid. An apparatus for optical excitation of the microparticles comprises an optical fiber delivering a first laser beam, and an interference pattern generation module coupled to the optical fiber. The interference pattern generation module splits the first laser beam into second and third laser beams and generates the excitation pattern for selectively exciting the microparticles by interference between the second and third laser beams. | 03-05-2009 |
20140242683 | APPARATUS FOR SELECTIVE EXCITATION OF MICROPARTICLES - Nucleic acid microparticles are sequenced by performing a sequencing reaction on the microparticles using one or more reagents, selectively exciting the microparticles in an excitation pattern, optically imaging the microparticles at a resolution insufficient to resolve individual microparticles, and processing the optical images of the microparticles using information on the excitation pattern to determine the presence or absence of the optical signature, which indicates the sequence information of the nucleic acid. An apparatus for optical excitation of the microparticles comprises an interference pattern generation module that splits a first laser beam into second and third laser beams and generates the excitation pattern for selectively exciting the microparticles by interference between the second and third laser beams. | 08-28-2014 |
Patent application number | Description | Published |
20140189665 | System For Applying Transformation To Improve Graph Analysis - A method for performing a neighbor-flipping transformation is provided. In one embodiment, a graph analysis program for computing a function relating to nodes in a directed graph is obtained and analyzed for neighborhood iterating operations, in which a function is computed over sets of nodes in the graph. For any detected neighborhood iterating operation, the method transforms the iterating operation by reversing the neighbor node relationship between the nodes in the operation. The transformed operation computes the same value for the function as the operation prior to transformation. The method alters the neighbor node relationship automatically, so that a user does not have to recode the graph analysis program. In some cases, the method includes construction of edges in the reverse direction while retaining the original edges in addition to performing the transformation. | 07-03-2014 |
20140258635 | INVALIDATING ENTRIES IN A NON-COHERENT CACHE - Techniques are provided for performing an invalidate operation in a non-coherent cache. In response to receiving an invalidate instruction, a cache unit only invalidates cache entries that are associated with invalidation data. In this way, a separate invalidate instruction is not required for each cache entry that is to be invalidated. Also, cache entries that are not to be invalidated remain unaffected by the invalidate operation. A cache entry may be associated with invalidation data if an address of the corresponding data item is in a particular set of addresses. The particular set of addresses may have been specified as a result of an invalidation instruction specified in code that is executing on a processor that is coupled to the cache. | 09-11-2014 |
20140258637 | FLUSHING ENTRIES IN A NON-COHERENT CACHE - Techniques are provided for performing a flush operation in a non-coherent cache. In response to determining to perform a flush operation, a cache unit flushes certain data items. The flush operation may be performed in response to a lapse of a particular amount of time, such as a number of cycles, or an explicit flush instruction that does not indicate any cache entry or data item. The cache unit may store change data that indicates which entry stores a data item that has been modified but not yet been flushed. The change data may be used to identify the entries that need to be flushed. In one technique, a dirty cache entry that is associated with one or more relatively recent changes is not flushed during a flush operation. | 09-11-2014 |
20150178125 | REDUCING SYNCHRONIZATION OF TASKS IN LATENCY-TOLERANT TASK-PARALLEL SYSTEMS - Techniques are provided for reducing synchronization of tasks in a task scheduling system. A task queue includes multiple tasks, some of which require an I/O operation while other tasks require data stored locally in memory. A single thread is assigned to process tasks in the task queue. The thread determines if a task at the head of the task queue requires an I/O operation. If so, then the thread generates an I/O request, submits the I/O request, and places the task at (or toward) the end of the task queue. When the task reaches the head of the task queue again, the thread determines if data requested by the I/O request is available yet. If so, then the thread processes the request. Otherwise, the thread places the task at (or toward) the end of the task queue again. | 06-25-2015 |
20150178405 | FINDING COMMON NEIGHBORS BETWEEN TWO NODES IN A GRAPH - Techniques for identifying common neighbors of two nodes in a graph are provided. One technique involves performing a binary split search and/or a linear search. Another technique involves creating a segmenting index for a first neighbor list. A second neighbor list is scanned and, for each node indicated in the second neighbor list, the segmenting index is used to determine whether the node is also indicated in the first neighbor list. Techniques are also provided for counting the number of triangles. One technique involves pruning nodes from neighbor lists based on the node values of the nodes whose neighbor lists are being pruned. Another technique involves sorting the nodes in a node array (and, thus, their respective neighbor lists) based on the nodes' respective degrees prior to identifying common neighbors. In this way, when pruning the neighbor lists, the neighbor lists of the highly connected nodes are significantly reduced. | 06-25-2015 |
20150178406 | COUNTING TRIANGLES IN A GRAPH - Techniques for identifying common neighbors of two nodes in a graph are provided. One technique involves performing a binary split search and/or a linear search. Another technique involves creating a segmenting index for a first neighbor list. A second neighbor list is scanned and, for each node indicated in the second neighbor list, the segmenting index is used to determine whether the node is also indicated in the first neighbor list. Techniques are also provided for counting the number of triangles. One technique involves pruning nodes from neighbor lists based on the node values of the nodes whose neighbor lists are being pruned. Another technique involves sorting the nodes in a node array (and, thus, their respective neighbor lists) based on the nodes' respective degrees prior to identifying common neighbors. In this way, when pruning the neighbor lists, the neighbor lists of the highly connected nodes are significantly reduced. | 06-25-2015 |
20150331683 | Automatic Selection Of An Abstract Data Type - An implementation of an abstract data type is automatically selected by a compiler. The compiler chooses an implementation for each instance of an abstract data type in a program based on operations performed in the instance within the program. | 11-19-2015 |
20160048607 | IN-MEMORY GRAPH PATTERN MATCHING - Techniques for identifying, in a target graph, subgraphs that match a query graph are provided. Processing a query graph comprises multiple stages, one for each query node in the query graph. In the first stage, a query node is selected, different portions of the target graph are assigned to different threads, each thread identifies nodes that match the selected query node and stores the identities of those nodes in storage that is local to the thread. The results of each thread are then stored in a “global” data structure. In the second stage, a second query node is selected and different portions of the global data structure are assigned to different threads. Each thread identifies nodes that match the second query node and that are connected to a previously-matched node. The second stage repeats until all nodes in the query graph are processed. | 02-18-2016 |
Patent application number | Description | Published |
20110080351 | METHOD OF CONTROLLING TOUCH INPUT ON A TOUCH-SENSITIVE DISPLAY WHEN A DISPLAY ELEMENT IS ACTIVE AND A PORTABLE ELECTRONIC DEVICE CONFIGURED FOR THE SAME - A method of controlling touch input on a touch-sensitive display when a display element is active and a portable electronic device configured for the same are provided. In accordance with one embodiment, there is provided a method of controlling touch input on a touch-sensitive display of a portable electronic device, the method comprising: displaying a widget having at least one field on a user interface screen displayed on the touch-sensitive display; selecting the field in the widget in response to predetermined interaction with the touch-sensitive display; changing the value of the selected field in accordance with a predetermined touch gesture at any location on the touch-sensitive display; and re-displaying the widget on the user interface screen with the changed value of the selected field. | 04-07-2011 |
20110202879 | GRAPHICAL CONTEXT SHORT MENU - A system and method for displaying a graphical context short menu on a display screen of a mobile communication device. The method includes displaying information associated with a contact, receiving a request for a menu and displaying, in response to the request, a graphical context short menu including menu items based on context associated with the displayed information. The graphical context short menu can include an icon associated with the contact. The icon can be an image of the contact, an avatar, and name of the contact. The graphical context short menu can include nine (9) menu options with the icon in the center of the menu. The graphical context short menu can also include a more menu items in the bottom right of the menu. | 08-18-2011 |
20110260970 | Portable Electronic Device and Method of Controlling Same - A method includes displaying a shutter adjacent to a boundary of an information display region on a display of a portable electronic device, the information display region for displaying first information; receiving an input associated with the shutter; and displaying second information. | 10-27-2011 |
20110265035 | GRAPHICAL CONTEXT MENU - A system and method for displaying a graphical context menu on a display screen of a mobile communication device. The method includes receiving a menu request, determining the number of menu items based on the context of the menu request, generating a graphical context menu based on the determined number of the determined number of menu items, inserting the menu items into the generated graphical context menu, and displaying the generated graphical context menu on the display screen with the inserted menu items. The graphical context menu can include menu items displayed in a 3×3 grid, a 2×3 grid or a 1×3 grid. The graphical context menu can include a default menu item in the center of the grid and a full menu option in the bottom most right slot of the grid. | 10-27-2011 |
20120268387 | TEXT INDICATOR METHOD AND ELECTRONIC DEVICE - A method includes displaying text on a touch-sensitive display and displaying a text indicator at a first position within the text. A first touch is detected at a first location associated with the text indicator. A second touch is detected at a second location associated with the text indicator. When a distance between the first location and the second location meets a first threshold, the indicator is moved to a second position within the text. When the distance between the first location and the second location does not meet a first threshold, the indicator is displayed at the first position. The display of the handle on the touch-sensitive display may be moved in coordination with movement of the touch. The distance between the text indicator and the handle may vary along a path of the touch | 10-25-2012 |
20130080963 | Electronic Device and Method For Character Deletion - A virtual keyboard for an electronic device having a display. The keyboard comprises a plurality of virtual keys organized in accordance with a keyboard layout with each key in a position according to the layout. The plurality of virtual keys include a first virtual key designated to activate, upon selection, a backward-delete function for deleting characters in a first direction and a forward-delete function for deleting characters in a second direction. The first direction and the second direction are opposite to each other. The keyboard also comprises direction identifier indicia displayed on the first virtual key. The direction identifier indicia are configured to indicate the first direction when the backward-delete function is activated, and the second direction when the forward-delete function is activated. | 03-28-2013 |