Abstract: An event limited field picker for a search user interface is described. In one or more implementations, a service may operate to collect and store data as events each of which includes a portion of the data correlated with a point in time. Clients may use a search user interface perform searches by input of search criteria. Responsive to receiving search criteria, the service may operate to apply a late binding schema to extract events that match the search criteria and provide search results for display via the search user interface. The search user interface exposes an event limited field picker operable to make selections of fields with respect to individual events in a view of the search results. In response to receiving an indication of a fields selected via the picker, visibility of selected fields may be updated to control which field and values are included in different views.

Abstract: A system that enables a user to configure alert actions based on search results generated by a query is disclosed. During operation, the system presents an alert user interface (UI) to a user, wherein the alert UI enables the user to configure one or more alert actions to be performed based on the search results. Next, the system receives alert configuration information from the user through the alert UI, wherein the alert configuration information includes tokens representing parameters associated with the query and the search results. Then, while generating an alert associated with the search results, the system performs a token substitution operation that substitutes tokens in the alert configuration information with corresponding parameters from the search results to generate a payload that is communicated to alert-generating functionality. This token substitution allows the parameters to be used by the alert-generating functionality while performing the one or more alert actions.

Abstract: Systems and techniques for indexing and/or querying a database are described herein. Discrete sections and/or segments from documents may be determined by a concept indexing system. The segments may be indexed by concept and/or higher-level category of interest to a user. A user may query the segments by one or more concepts. The segments may be analyzed to rank the segments by statistical accuracy and/or relatedness to one or more particular concepts. The rankings may be used for presentation of search results in a user interface. Furthermore, segments and/or documents may be ranked based on recency decay functions that distinguish between segments that maintain their relevance over time in contrast with temporal segments whose relevance decays quicker over time, for example.

Abstract: An electronic media distribution/play system includes a service facility that has a communications network interface and maintains a data file catalog. The catalog is sent over the network to requesting users, and the system processes payments from customers in establishing file access authorizations. Encrypted user-selected files and a player program are transmitted to each customer for metered access to received data files as limited by the authorization, and customers can make additional selections and play the encrypted files freely while the authorization remains established. The system can transmit the data files from local storage, and also provide links to encrypted files that are stored at remote vendor facilities. Authorizations can be for selected portions or class levels of the catalog, and for terms measured as calendar time, play time, and collective number of plays. Also disclosed is a method for facilitating the distribution and accessing of electronic files.

Abstract: Disclosed is a system and method for parallelizing grid search technique facilitating determination of PK-PD parameters. The method may comprise determining number of grids. The method may further comprise creating grid points based upon the number of grids (N) and a number of parameters (p). The method may further comprise distributing the grid points amongst number of threads. The method may further comprise evaluating an objective function value corresponding to each grid point in order to compute an objective function value associated with each of the grid points. Further, the method may comprise identifying a grid point having minimum objective function value. The grid point having the least objective function value may indicate the estimated initial PK-PD parameters.

Abstract: A new approach is proposed that contemplates systems and methods to generate customized subjective search results from the perspective of a user who conducts the search or any other subject entity of chosen by the user. A scored subject list is created from the user's network of sources/subjects/contacts, where each element on the list is a subject/source and the score reflects the subject's potential influence or closeness of its connection/relation with the user. Once created, the subject list is then used as a bias filter on the list of citations from search results. With such influence-weighted citation scores, objects and/or subjects from citations of subjects that have big influence on or enjoy high respect from the user will be ranked prominently in the search result presented to the user, thus biasing the search results from the user's perspective.

Abstract: An electronic document analysis method receiving N electronic documents pertaining to a case encompassing a set of issues including at least one issue and establishing relevance of at least the N documents to at least one individual issue in the set of issues, the method comprising, for at least one individual issue from among the set of issues, receiving an output of a categorization process applied to each document in training and control subsets of the at least N documents, the output including, for each document in the subsets, one of a relevant-to-the-individual issue indication and a non-relevant-to-the-individual issue indication; building a text classifier simulating the categorization process using the output for all documents in the training subset of documents; and running the text classifier on the at least N documents thereby to obtain a ranking of the extent of relevance of each of the at least N documents to the individual issue.

Abstract: An information processing system, a computer readable storage medium, and a method of managing a query to find a set of JSON documents in a multi-schema JSON document store. A query engine receives a first query to find at least one JSON document in a plurality of sets of JSON documents stored in the JSON document store, each set of JSON documents being organized in a unique JSON schema version related to a unique JSON schema version of each other set of JSON documents by at least one schema change. The first query is organized in a first unique JSON schema version. A query translator translates the first query into a second query based on the at least one schema change. The first and second queries are executed to provide first and second query results which are collectively returned.

Abstract: A framing technique included in a set of framing techniques is applied to at least a portion of a target data set. When a result of the application of the framing technique meets a first condition, a typing technique included in a set of typing techniques is applied to the target data set. When a result of the application of the typing technique meets a second condition, a tokenization technique included in a set of tokenization techniques is applied to the target data set. When a result of the application of the tokenization technique meets a third condition, a parsing technique for the target data set is determined to include the framing technique, the typing technique and the tokenization technique. An indication of the parsing technique is generated.

Abstract: A method, computer program product, and computing system for receiving a point-in-time copy command for a virtual volume exposed within a storage virtualization layer of a storage system. The point-in-time copy command is provided to one or more data arrays underlying the storage virtualization layer. The virtual volume is associated with physical storage within the one or more data arrays, thus defining associated physical storage. A level of high-availability is identified for the associated physical storage. A copy of the associated physical storage is generated that has the same level of high-availability, thus defining a high-availability copy.

Abstract: Features that may be used to represent relevance information (e.g., properties, characteristics, etc.) of an entity, such as a document or concept for example, may be associated with the document by accepting an identifier that identifies a document; obtaining search query information (and/or other serving parameter information) related to the document using the document identifier, determining features using the obtained query information (and/or other serving parameter information), and associating the features determined with the document. Weights of such features may be similarly determined. The weights may be determined using scores. The scores may be a function of one or more of whether the document was selected, a user dwell time on a selected document, whether or not a conversion occurred with respect to the document, etc. The document may be a Web page. The features may be n-grams. The relevance information of the document may be used to target the serving of advertisements with the document.

Abstract: One or more techniques and/or systems are provided for populating and/or animating a spatial visualization, such as a map, a timeline, and/or other 2D and/or 3D visual representations of locations. The spatial visualization may be populated with events extracted from a data source (e.g., real-time events, news events, social network events, etc.), and may include relationships between events (e.g., based upon time, location, contextual similarity (e.g., social network check-in events at a restaurant), events referencing one another (e.g., an article describing a first event may comprise a hyperlink to an article describing a second event) etc.). Filter criteria (e.g., date, event type, location, etc.) may be applied to events and/or relationships when populating the spatial visualization. A sequence of events and corresponding relationships may be animated within the spatial visualization (e.g., as the events unfold over a (user) designated period of time).

Abstract: Establishment of an exclusive lock on each of an outer database ownership table and an inner database ownership table is attempted. In response to establishing the exclusive lock on each of the outer database ownership table and the inner database ownership table, a switch is made to a pair of overlapping shared locks on each of the outer database ownership table and the inner database ownership table. Release and re-acquisition of each of the pair of overlapping shared locks on the outer database ownership table and the inner database ownership table is alternated.

Abstract: An augmentation system configured to present global and local context sensitive augmented content in accordance with multiple criteria, including one or more user's preferences, and present the augmented content via a display layer on top of the original content. The augmentation system provides an efficient browsing, knowledge discovery and exploration experience. The original content remains visible to the user while the augmented content is being viewed and/or interacted with. The global context sensitive augmented content is generated using metrics based on the overall document or content being viewed, while the local context sensitive augmented content is generated using metrics based on the currently viewed or selected object within the document or content being viewed. Real-time and theme based augmentation are used to further enhance the user's experience.

Abstract: The present application describes performing a user initiated search query comprising receiving user input comprising description details of at least one desired object, retrieving a plurality of objects from a database sharing one or more of the description details of the user input, retrieving an image of the at least one desired object based on one or more of the plurality of objects, generating a contour of the image and comparing the generated contour with other related contours of other images stored in the database, displaying all of the available contours of all of the images that match the generated contour, receiving a selection of one of the available contours from the user and performing the search query based on the user selected contour.

Abstract: A first collection of content that includes digital assets is maintained on a host computer. Based on a determination that a portable media device becomes connected to a client computer that is separate from the host computer and that interacts with the host computer, initiation of a synchronization of the first collection of content resident on the host computer with a second collection of content on the portable media device is automatically triggered. The synchronization of the first collection with the second collection includes a transfer of at least one of the digital assets from the host computer to the client computer to the portable media device and is triggered and conditioned upon the determination that the portable media device has become connected to the client computer.

Abstract: Processing a database table comprises receiving a multi-dimensional processing instruction for processing at least two columns of the database table, wherein the two columns comprise a selection column and a sort column, wherein the multi-dimensional processing instruction is for selecting a plurality of candidate rows by sorting based on the selection column and the sort column. An index takes the selection column as master column and the sort column as slave column. Nodes in the index are selected according to the selection column. Each of the selected nodes is associated with a respective slave column value sequence. A merge sort is performed on each of the slave column value sequences to obtain a sort result for the candidate rows.

Abstract: The relevance of advertisements to a user's interests is improved. In one implementation, the content of a web page is analyzed to determine a list of one or more topics associated with that web page. An advertisement is considered to be relevant to that web page if it is associated with keywords belonging to the list of one or more topics. One or more of these relevant advertisements may be provided for rendering in conjunction with the web page or related web pages.

Abstract: One or more techniques and/or systems are provided for populating and/or animating a spatial visualization, such as a map, a timeline, and/or other 2D and/or 3D visual representations of locations. The spatial visualization may be populated with events extracted from a data source (e.g., real-time events, news events, social network events, etc.), and may include relationships between events (e.g., based upon time, location, contextual similarity (e.g., social network check-in events at a restaurant), events referencing one another (e.g., an article describing a first event may comprise a hyperlink to an article describing a second event) etc.). Filter criteria (e.g., date, event type, location, etc.) may be applied to events and/or relationships when populating the spatial visualization. A sequence of events and corresponding relationships may be animated within the spatial visualization (e.g., as the events unfold over a (user) designated period of time).

Abstract: There is provided a method for determining, for a set of co-ordinate records associating co-ordinates with incident values, the numbers of incidents associated with co-ordinates within a query area. Co-ordinate data is stored as data representing a binary tree comprising leaf nodes, a root node and branch nodes wherein the leaf nodes are associated with individual items of co-ordinate data identified by the set of co-ordinate records, and the root node and branch nodes are each associated with a pair of child nodes, and are each associated with split values. In response to a query identifying a query area the binary tree is then recursively processed starting with the root node.