Abstract: Caching of an immutable buffer that has its data and address prevented from changing during the lifetime of the immutable buffer. A first computing entity maintains a cache of the immutable buffer and has a strong reference to the immutable buffer. So long as any entity has a strong reference to the immutable buffer, the immutable buffer is guaranteed to continue to exist for the duration of the strong reference. A second computing entity communicates with the first computing entity to obtain a strong reference to the immutable buffer and thereafter read data from the immutable buffer. Upon reading the data from the cache, the second computing entity demotes the strong reference to a weak reference to the immutable buffer. A weak reference to the immutable buffer does not guarantee that the immutable buffer will continue to exist for the duration of the weak reference.

Abstract: One illustrative method disclosed herein involves, among other things, decomposing an initial circuit layout into first and second mask patterns, for the first mask pattern, identifying a first four-polygon pattern in the first mask pattern that violates a multi-polygon constraint rule, wherein the first four-polygon pattern comprises four polygons positioned side-by-side in the first mask pattern, and recoloring one or two of the polygons in the first four-polygon pattern in the first mask pattern to the second mask pattern to eliminate the first four-polygon pattern from the first mask pattern without introducing any design rule violations in the initial circuit layout.

Abstract: Various technologies pertaining to exploratory suggestions are described herein. A computer-implemented graph is constructed, where the graph includes nodes that are representative of aspects and edges that are representative of associations between aspects. An aspect is representative of a sub-topic of a topic or a sub-task of a task. The computer-implemented graph is learned based upon content of search logs, and is used to output exploratory suggestions, where a user is exploring a topic or attempting to complete a multi-step task.

Abstract: Described herein are technologies pertaining to determining which search engine results page (SERP), from a plurality of SERPs, is preferable to a user. A query is received, and multiple SERPS are retrieved based upon the query, wherein the multiple SERPs are generated independently from one another. Values of features of the query and the multiple SERPs are obtained, and a determination as to which of the SERPs from the multiple SERPs is preferable to the user is made based upon the values of the features. The SERP determined to be preferable over other SERPs in the multiple SERPs is presented to the user.

Abstract: The environment and use of an immutable buffer. A computing entity acquires data or generates data and populates the data into the buffer, after which the buffer is classified as immutable. The classification protects the data populated within the immutable buffer from changing during the lifetime of the immutable buffer, and also protects the immutable buffer from having its physical address changed during the lifetime of the immutable buffer. As different computing entities consume data from the immutable buffer, they do so through views provided by a view providing entity. The immutable buffer architecture may also be used for streaming data in which each component of the streaming data uses an immutable buffer. Accordingly, different computing entities may view the immutable data differently without having to actually copy the data.

Abstract: Various technologies described herein pertain to evaluating search preferences. A search query, a first search result list returned by a first ranker system responsive to the search query, and a second search result list returned by a second ranker system responsive to the search query are received. A classifier is employed to predict (e.g., based upon values of features of the search query, the first search result list, and the second search result list) whether a search preference judgment (e.g., a side-by-side search preference judgment, etc.) indicates a quality difference between the first search result list and the second search result list. The search query, the first search result list, and the second search result list are excluded from a set of search queries and search result list pairs to be manually judged for search preference judgments when predicted to lack the quality difference.

Abstract: The claimed subject matter includes a system and method for attribution of search activity in multi-user settings. The method includes training a classifier to distinguish between machines that are single-user and multi-user based on activity logs of an identified machine. The identified machine is determined to be multi-user based on the classifier. A number of users is estimated for the identified machine. Activity of the users is clustered based on the number of users estimated. A similarity function is learned for the number of users estimated. The method also includes assigning new activity to one of the users based on the clustering, and the similarity function.

Abstract: The two-path amplify-and-forward relaying method for bandwidth efficient cognitive radios utilizes a primary user (PU) transmitter cooperating with a secondary user (SU) transmitter and receiver to relay PU data to the PU receiver. The present algorithm makes use of the inter-relay interference (IRI) between the two relay nodes to transmit SU data and cancel this IRI at the PU receiver node. The SU transmission power and the relaying amplifying factors are optimized to minimize the probability of error. Lagrangian multiplier method is used to obtain the optimal solution for the problem. Simulation results show that the present algorithm outperforms the single data transmission and gets closer to the performance of multiple input multiple output (MIMO) system of diversity 3 for PU network and 2 for SU network when a maximum likelihood decoder (MLD) is used.

Abstract: Compounds having the general formula II, III, or IV wherein R1 can be a radical of an optionally substituted C-4 to C-7 N-containing heterocycle or a radical of an optionally substituted cyclic or acyclic tertiary amine or isoindoline-1,3-dione: R2,3,4,5,6 can each independently be any one or combinations of the following moieties, cyano, nitro, acyl, alkyl, amido, azido, isothiocyanate, isocyanate, optionally substituted anilino, halogens, ethers, sulfonamides, thioacyl, nitro, aromatic, heterocyclic, olefinic, acetylene, deuterium, or tritium; Y can be either CH, CH2, O, S, OCH2, N—R, N—Ar, C—R, C—Ar; Z can be either H, O, S, S—R or NR.

Abstract: A method of shutting down a message routing component that has stored thereon outgoing messages that are destined for a communications device, the shutting down method including storing selected messages from the outgoing messages to a persistent storage. Also a system for routing messages, including: a persistent storage; and a message routing component having a memory for storing outgoing messages that are destined for a communications device, the message routing component being configured to store selected messages from the outgoing messages to the persistent storage when shutting down.

Abstract: Caching of an immutable buffer that has its data and address prevented from changing during the lifetime of the immutable buffer. A first computing entity maintains a cache of the immutable buffer and has a strong reference to the immutable buffer. So long as any entity has a strong reference to the immutable buffer, the immutable buffer is guaranteed to continue to exist for the duration of the strong reference. A second computing entity communicates with the first computing entity to obtain a strong reference to the immutable buffer and thereafter read data from the immutable buffer. Upon reading the data from the cache, the second computing entity demotes the strong reference to a weak reference to the immutable buffer. A weak reference to the immutable buffer does not guarantee that the immutable buffer will continue to exist for the duration of the weak reference.

Abstract: The environment and use of an immutable buffer. A computing entity acquires data or generates data and populates the data into the buffer, after which the buffer is classified as immutable. The classification protects the data populated within the immutable buffer from changing during the lifetime of the immutable buffer, and also protects the immutable buffer from having its physical address changed during the lifetime of the immutable buffer. As different computing entities consume data from the immutable buffer, they do so through views provided by a view providing entity. The immutable buffer architecture may also be used for streaming data in which each component of the streaming data uses an immutable buffer. Accordingly, different computing entities may view the immutable data differently without having to actually copy the data.

Abstract: Compounds having the general formula II, III, or IV wherein R1 can be a radical of an optionally substituted C-4 to C-7 N-containing heterocycle or a radical of an optionally substituted cyclic or acyclic tertiary amine or isoindoline-1,3-dione: R2,3,4,5,6 can each independently be any one or combinations of the following moieties, cyano, nitro, acyl, alkyl, amido, azido, isothiocyanate, isocyanate, optionally substituted anilino, halogens, ethers, sulfonamides, thioacyl, nitro, aromatic, heterocyclic, olefinic, acetylene, deuterium, or tritium; Y can be either CH, CH2, O, S, OCH2, N—R, N—Ar, C—R, C—Ar; Z can be either H, O, S, S—R or NR.

Abstract: Technologies pertaining to automatically identifying sets of query attribute values that are highly correlative with user dissatisfaction with a search engine are described. Dissatisfied queries are automatically identified through analysis of search logs, wherein a dissatisfied query is a query submitted to a search engine by a user, wherein the user was dissatisfied with search results provided by the search engine responsive to receipt of the query. Sets of query attribute values that are highly correlated with dissatisfied queries, and thus user dissatisfaction, are automatically identified based at least in part upon the identifying of the dissatisfied queries. Subsequent to identifying a set of query attribute values, a segment-specific ranker is learned that is configured to rank search results responsive to receipt of a query with the set of query attribute values, wherein the segment-specific ranker outperforms a general purpose ranker for queries having the set of query attribute values.

Abstract: A kinetic energy penetrator with a longitudinal axis may include a forward segment having a lateral surface, a rear surface, and at least one air bleed channel extending from the lateral surface to the rear surface. A second segment may be disposed aft of and torsionally engaged with the forward segment. The second segment may include a front surface adjacent the rear surface of the forward segment. The forward and second segments may each be asymmetric about the longitudinal axis of the penetrator. When the penetrator is in flight, bleed air through the bleed channels may impinge on the front surface of the second segment. The second segment may separate from the front segment. Kinetic energies of each of the forward and second segments may be less than about 75 joules upon impact with a ground surface.

Abstract: A learning system refines a prediction model that determines the effectiveness of a search engine in achieving a goal of a search. Search goal achievements are estimated for sequences of user actions in an unlabeled data set using the prediction model, which is based on a mixture model and values for parameters of the mixture model. The values of the parameters are redefined based at least on the search goal achievement estimates of the unlabeled set. The prediction model is stored in accordance with the mixture model and the redefined values.

Abstract: A method of activating security functions on a computer device, for example a mobile communications device. The computer device includes a device state that may be realized by way of a first user input or a second user input. The method includes designating the first user input to realize the device state as a security rule having an associated security function, detecting realization of the device state, and activating the associated security function if the device state was realized by way of the second user input rather than the first user input. For example, the first user input may be a shortcut input, and the second user input may be a conventional or normal input.

Abstract: A system and method is disclosed for determining a prediction measurement, or measure, using geo-spatial information which can be used to determine whether or not to include type of information in search results. The prediction measurement comprises a measure of the likelihood that an item of the type of information for which the prediction measure is determined will be selected, or clicked on, by a user, if the item of the type of information is included in the search result. Without limitation, one such information type is news.

Abstract: A method of and device for transmitting a data message to a communication device configured to receive data through a plurality of communications mediums, including: assigning a first priority to a first component of the data message and a second priority to a second component of the data message; sending the first message component to the communication device over an available communications medium; and queuing the second component for delivery via a communication medium having a lower relative data transmission cost than the medium over which the first component was sent.

Abstract: A mechanism is provided for determining a second document of a set of documents in a second language having the same textual content as a first document in a first language. A first histogram that is indicative of the textual content of the first document is generated. A second histogram is generated for each document of the set of documents. Each second histogram is indicative of the textual content of a document of the set of documents. Each second histogram is compared with the first histogram to determine at least one histogram from the plurality of second histograms which matches the first histogram. The second document is then identified as the document having the at least one histogram.