Abstract: The present invention relates to a combination therapy of propane-1-sulfonic acid {3-[5-(4-chlorophenyl)-1H-pyrrolo[2,3-b]pyridine-3-carbonyl]-2,4-difluoro-phenyl}-amide, or a pharmaceutically acceptable salt thereof, and an topoisomerase inhibitor for treating a patient suffering from a proliferative disorder, in particular a solid tumor, for example, colorectal cancer, melanoma, and thyroid cancer. In particular, the present invention relates to such a therapy wherein the topoisomerase inhibitor is irinotecan, or a pharmaceutically acceptable salt thereof, and the disorder is colorectal cancer involving a tumor comprising b-Raf having the V600E mutation.

Abstract: Systems and methods useful in communicating messages over a peer-to-peer network, optionally over transient connections to participants in a collaborative session (e.g., an “electronic whiteboard” session), are described. Examples include establishing a session for data transfer, wherein participants easily enter and leave the session without losing data or connections between the participants. Participants in a session may gain access to and catch up with data previously transmitted. Various data structures are useful for communicating messages. Such data structures may be used for transmitting message data or identification data to participants.

Abstract: A Global Position System signal acquiring system and method is provided in this invention. Pluralities of counters are set, each corresponding to a code bin and a frequency bin of the signal. Subsequently, the signal corresponding to the counters is repeatedly received in a unit of time and the counters are accordingly updated for a pre-determined iteration. At last, a maximum value among the counters is found to acquire the signal corresponding to the counter having the maximum value.

Abstract: The claimed subject matter provides a system and/or a method that facilitates conveying enhanced query results. An interface component can receive a query corresponding to data. A visual component can employ a search result based at least in part upon the query, wherein the search result includes a graphic identifying a location of at least one term of the query within the queried data.

Abstract: Aspects of the invention provide virtual hover zones. When a user lowers a hovering stylus while remaining within a hover zone, cursor control is modified to be more easily controllable by the user. If the user pauses the stylus in mid-air before lowering the stylus, and if the stylus remains within the hover zone, then upon touchdown the cursor may be moved to the projection of the location where the stylus was paused. Any action that may be taken in response to the touch down may be sent to the projection location as well. Also provided are cursor control zones. A dampening zone may be used to provide dampened cursor movement feedback in response to movement input provided by a pointing device. Also, a dead zone may be used to prohibit cursor movement in response to movement input provided by the pointing device.

Abstract: Aspects of the invention provide virtual hover zones. When a user lowers a hovering stylus while remaining within a hover zone, cursor control is modified to be more easily controllable by the user. If the user pauses the stylus in mid-air before lowering the stylus, and if the stylus remains within the hover zone, then upon touchdown the cursor may be moved to the projection of the location where the stylus was paused. Any action that may be taken in response to the touch down may be sent to the projection location as well. Also provided are cursor control zones. A dampening zone may be used to provide dampened cursor movement feedback in response to movement input provided by a pointing device. Also, a dead zone may be used to prohibit cursor movement in response to movement input provided by the pointing device.

Abstract: A locking arrangement for data structures is provided that prevents deadlocks, but still allows different threads to simultaneously obtain locks on different nodes of a data structure for both read and write operations. The locking system differentiates locks based on a priority hierarchy. The locking system will fail a request to lock one or more resources in a data structure if access to those resources has already been restricted by a conflicting lock of an equal or higher priority. The locking system may also employ preemptable and non-preemptable locks such that, if a preemptable lock with a lower priority has restricted access to resources, then the locking system will preempt the lower priority lock in favor of a conflicting higher priority lock. Alternately, if a non-preemptable lock with a lower priority has restricted access to resources, then the locking system will wait until the lower priority lock is removed before implementing a requested conflicting higher priority lock.

Abstract: Geographically distributed data-gathering client computers are connected to the Internet in the same manner as typical users (for example, via local dial-up connections). The data-gathering client computers poll a central server (the “UserMon” server) for a target site to access. After receiving the address of a target site from the UserMon server, the data-gathering client computers access the target site and obtain performance-parameter values indicative of the quality of their respective Internet connections to the target site and/or the performance of the target site itself. Each data-gathering client computer then pushes the performance-parameter values back to the “UserMon” server for analysis.

Abstract: Methods for bridging subnet broadcasts across subnet boundaries include: (a) receiving a first broadcast message that originates in a first subnet; (b) sending the first broadcast message to a second subnet; and (c) broadcasting the first broadcast message on the second subnet, wherein the first broadcast message is not sent from the second subnet back to the first subnet and/or it is not rebroadcast on the first subnet. Other methods of processing broadcast messages include: (a) receiving a first broadcast message on a first subnet; (b) determining whether the first broadcast message originated in the first subnet; and (c) when the first broadcast message originated in the first subnet, sending the first broadcast message to a second subnet. Such methods may further include, at least in some examples, marking the first broadcast message to indicate that it originated from the first subnet.

Abstract: Various techniques are disclosed for easily and accurately estimating the amount of overlap between two or more polygons. With various examples of these techniques, a pattern of objects, such as points, is provided over the entire area of the first polygon. The amount of objects within the first polygon then is determined, as is the amount of objects within the first polygon that also are located within the second polygon. The ratio of the amount of objects located within both the first polygon and the second polygon to the total amount of objects located within the first polygon then provides an estimate of the amount of the first polygon overlapped by the second polygon.

Abstract: The claimed subject matter provides a system and/or a method that facilitates generating a content rank that includes at least one quantitative measurement to ascertain the importance of a literary work and/or media. An interface component can receive data related to a query. A rank component can employ a content rank based on a quantitative measurement to ascertain an objective ranking of the queried content.

Abstract: The claimed subject matter provides a system and/or a method that facilitates conveying enhanced query results. An interface component can receive a query corresponding to data. A visual component can employ a search result based at least in part upon the query, wherein the search result includes a graphic identifying a location of at least one term of the query within the queried data.

Abstract: Geographically distributed data-gathering client computers are connected to the Internet in the same manner as typical users (for example, via local dial-up connections). The data-gathering client computers poll a central server (the “UserMon” server) for a target site to access. After receiving the address of a target site from the UserMon server, the data-gathering client computers access the target site and obtain performance-parameter values indicative of the quality of their respective Internet connections to the target site and/or the performance of the target site itself. Each data-gathering client computer then pushes the performance-parameter values back to the “UserMon” server for analysis.

Abstract: The convex hull of two polygons having congruent corresponding angles with the same orientation can be determined by analyzing the relationship of each vertex of one of the polygons relative to its adjacent vertices. More particularly a line may be defined between a selected vertex on one of the polygons and its corresponding vertex on the other polygon. If the vertices adjacent to the selected vertex both fall on the same side of the line, then a line connecting the selected vertex with its corresponding vertex lies on the convex hull of the two polygons. If, on the other hand, the vertices adjacent to the selected vertex are located on different sides of the line, then the line connecting the selected vertex with its corresponding vertex does not lie on the convex hull.

Abstract: A Global Position System signal acquiring system and method is provided in this invention. Pluralities of counters are set, each corresponding to a code bin and a frequency bin of the signal. Subsequently, the signal corresponding to the counters is repeatedly received in a unit of time and the counters are accordingly updated for a pre-determined iteration. At last, a maximum value among the counters is found to acquire the signal corresponding to the counter having the maximum value.

Abstract: Web server controls are provided for generating client side markups with recognition and/or audible prompting to enable telephone call controls such as making, transferring and disconnecting telephone calls.

Abstract: A locking arrangement for data structures is provided that prevents deadlocks, but still allows different threads to simultaneously obtain locks on different nodes of a data structure for both read and write operations. The locking system will fail a request to lock one or more resources in a data structure if access to those resources has already been restricted by a conflicting lock of an equal or higher priority. The locking system may also employ preemptable and non-preemptable locks such that, if a preemptable lock with a lower priority has restricted access to resources, then the locking system will preempt the lower priority lock in favor of a conflicting higher priority lock. Alternately, if a non-preemptable lock with a lower priority has restricted access to resources, then the locking system will wait until the lower priority lock is removed before implementing a requested conflicting higher priority lock.

Abstract: The convex hull of two polygons having congruent corresponding angles with the same orientation can be determined by analyzing the relationship of each vertex of one of the polygons relative to its adjacent vertices. More particularly a line may be defined between a selected vertex on one of the polygons and its corresponding vertex on the other polygon. If the vertices adjacent to the selected vertex both fall on the same side of the line, then a line connecting the selected vertex with its corresponding vertex lies on the convex hull of the two polygons. If, on the other hand, the vertices adjacent to the selected vertex are located on different sides of the line, then the line connecting the selected vertex with its corresponding vertex does not lie on the convex hull.

Abstract: Geographically distributed data-gathering client computers are connected to the Internet in the same manner as typical users (for example, via local dial-up connections). The data-gathering client computers poll a central server (the “UserMon” server) for a target site to access. After receiving the address of a target site from the UserMon server, the data-gathering client computers access the target site and obtain performance-parameter values indicative of the quality of their respective Internet connections to the target site and/or the performance of the target site itself. Each data-gathering client computer then pushes the performance-parameter values back to the “UserMon” server for analysis.

Abstract: Geographically distributed data-gathering client computers are connected to the Internet in the same manner as typical users (for example, via local dial-up connections). The data-gathering client computers poll a central server (the “UserMon” server) for a target site to access. After receiving the address of a target site from the UserMon server, the data-gathering client computers access the target site and obtain performance-parameter values indicative of the quality of their respective Internet connections to the target site and/or the performance of the target site itself. Each data-gathering client computer then pushes the performance-parameter values back to the “UserMon” server for analysis.