Abstract: A method for generating an electronic file associated with health care professionals (HCPs). The method includes receiving health information from a covered entity computing system and a file generation request from a user computing device. The method further includes matching HCP information with the health information and determining one or more statistical values based on at least one of the matched HCP information or the matched health information. The method further includes generating the electronic file including the one or more statistical values and at least a portion of the matched HCP information and providing the file to the destination address of the file generation request. The electronic file is generated as the file type identified by the file generation request, and is structured based on at least one of the file generation request or the file destination.

Abstract: A method and system for decontaminating raw yield maps by combining filters with spatial outlier detectors is provided. In an embodiment, the method comprises receiving over a computer network electronic digital data comprising first yield data representing crop yields harvested from an agricultural field; applying one or more filters to the first yield data to identify, from the first yield data, first outlier data; generating first filtered data from the first yield data by removing the first outlier data from the first yield data; identifying, in the first filtered data, second outlier data representing outlier values based on one or more outlier characteristics; generating second outlier data from the first filtered data by removing the second outlier data from the first filtered data; generating and causing displaying on a mobile computing device a graphical representation of the crop yields harvested from the agricultural field using only the second outlier data.

Abstract: A map output device is provided for preventing a storage medium from being sharedly used. The map output device comprises a connection unit; an output unit that outputs map data; and a control unit. The control unit is configured, when a storage medium is connected to the connection unit or when a movable body is used beyond a predetermined usage amount, to write a file containing information on a unique value related to the movable body into the storage medium connected to the connection unit, and to output, to the output unit, the map data read from the storage medium.

Abstract: K-NN spatial queries may be performed, and the results of one K-NN query are re-used to perform a plurality of K-NN queries on a set of query points. More specifically, a K-NN query is performed on a pre-defined location, for example, an object point, to find the nearest K data objects for this pre-defined location, the results of this K-NN query being used to perform further K-NN queries on the query points near the pre-defined location. In doing so, the efficiency of large scale K-NN spatial queries is improved by limiting the spatial search range of the K-NN queries to be performed and re-using pre-computed K-NN data.

Abstract: In certain embodiments, single-page application server-side rendering may be facilitated. In some embodiments, a request related to a single-page web application may be obtained. A determination of whether the request is a crawler request may be effectuated. In response to determining that the request is a crawler request, a server-side renderer may generate a static page in connection with the request from the crawler. In some embodiments, web assets may be obtained from one or more databases via the server-side renderer, and the server-side renderer may generate the static page based on the web assets. The static page may then be provided as a response to the request.

Abstract: A method for storing shard data and data formats for storing shard data are proposed. Shard data entries are generated and stored, wherein each shard data entry comprises a definition of one or more semantic objects covered by the shard data entry. Shard metadata is generated and stored, wherein the metadata comprises references to the shard data entries and, for each of the shard data entries, data representative of a bounding box indicative of an area in a geographical area that is covered by the shard data entry.

Abstract: Improved computer technology is disclosed for enabling high performance stream processing on data such as complex, hierarchical data. In an example embodiment, a dynamic field schema specifies a dynamic field format for expressing the incoming data. An incoming data stream is then translated according to the dynamic field schema into an outgoing data stream in the dynamic field format. Stream processing, including field-specific stream processing, can then be performed on the outgoing data stream.

Abstract: Systems and methods for file management by mobile computing devices. An example method, performed by a computer system, may comprise: storing, by a computer system, a first file having a first size, in a memory; storing, in the memory, a second file derived from the first file, the second file having the second size, the second size being less than the first size; determining that the memory is not sufficient to perform a memory write operation; selecting a third file having a fourth file associated with it, the fourth file derived from the third file; and removing the third file from the memory.

Abstract: A system, method, and computer-readable medium are disclosed for improved searching of contact information that includes receiving a request for a member's contact information. An initial list of candidates is returned. Based on organizational charts, distances between candidates and a point of reference are calculated, calculation is made as to a number of messages that are exchanged between candidates and the point of reference. Scores are determined based on the calculations. The scores are aggregated, and a refined list of candidates' contact information based on the aggregated scores is returned.

Abstract: A method for traversing hierarchical data is provided. The method may include generating, based on a source table stored in a database, an index for traversing a graph corresponding to the source table. The source table may identify a parent node for each node in the graph. The generating of the index may include iterating over the source table to generate an inner node map. The inner node map may include at least one mapping identifying one or more children nodes descending from an inner node in the graph. The graph may be traversed based at least on the index. The index may enable the graph to be traversed depth first starting from a root node of the graph and continuing to a first child node descending from the root node of the graph. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: Described herein are techniques, devices, and systems for database management using sound-based identifiers. The sound-based identifiers can be encoded based on text-based identifiers input into one or more databases. The sound-based identifiers can be preprocessed and encoded by encoding the text-based identifiers with a double metaphone algorithm. First sound-based identifiers can be sorted in a cluster associated with a node of a hybrid prefix tree list, based on a longest common prefix of the group. The first sound-based identifiers can be re-encoded as second sound-based identifiers and organized into sub-clusters associated with nodes, based on characters of the second sound-based identifiers positioned after characters associated with the clusters. The re-encoded sound-based identifiers can be determined based on metadata. A query can be received and utilized to identify a re-encoded sound-based identifier.

Abstract: Methods, systems, and computer programs, for generating dynamic data filters. In one aspect, a data processing system is disclosed that is configured to perform operations that include receiving a data source agnostic information request (DSAIR), determining, based on the DSAIR, (i) one or more source selection keys and (ii) a data dictionary, identifying, by the data processing system, one or more data sources related to the received DSAIR using the one or more source selection keys, generating a dynamic data filter using one or more of the plurality of terms of the data dictionary, filtering, using the dynamic data filter, information in the one or more data sources that were identified using the source selection keys, and providing the filtered information from the one or more data sources for output by the user device.

Abstract: Data management units for supporting health control of a human or animal body. The units can include a processor adapted to process the following steps: i) if a number of previous measurement data referring to a corresponding tag stored in a data storage is less than a predetermined minimum value: a) no tag is automatically assigned to a new measurement value, or b) a corresponding tag chosen from a group of tags is automatically assigned to the new measurement value based on a first tagging calculation rule; and ii) if the number of the previous measurement data referring to a corresponding tag stored in the data storage is equal to or bigger than the predetermined minimum value, the corresponding tag chosen from a group of tags is automatically assigned to the new measurement value based on at least one second tagging calculation rule.

Abstract: Signature-based cache optimization for data preparation includes: performing a first set of sequenced data preparation operations on one or more sets of data to generate a plurality of transformation results; caching one or more of the plurality of transformation results and one or more corresponding operation signatures, a cached operation signature being derived based at least in part on a subset of sequenced operations that generated a corresponding result; receiving a specification of a second set of sequenced operations; determining an operation signature associated with the second set of sequenced operations; identifying a cached result among the cached results based at least in part on the determined operation signature; and outputting the cached result.

Abstract: A counting method, a counter and a storage medium, wherein the method includes: detecting whether a count application source exists; obtaining a quantity of counts caused by a current count application source in unit time and server-related parameters, if a count application source exists; determining a mode in which the current count application source updates the database according to the quantity of counts or the server-related parameters, the mode including a real-time mode and a high-performance mode; accumulating the counts caused by the current count application source running in the server to obtain an accumulated value, if the current count application source updates the database in the high-performance mode; and updating the accumulated value of the current count application source to the database according to a preset frequency.

Abstract: Methods, apparatus, and processor-readable storage media for request processing using dynamic item data structures are provided herein. An example method includes an item data structure comprising an item identifier for a given item and a plurality of global identifiers, wherein a given one of the global identifiers is indicative of a corresponding one of a plurality of different variations of the given item based on a particular combination of values associated with the given global identifier, wherein the particular combination of values is specified for a set of parameters associated with the given item; dynamically identifying one of the global identifiers in the item data structure based at least in part on one or more user inputs indicative of a value for at least one of the parameters; and processing a request for the given item based at least in part on the identified global identifier.

Abstract: A system and method for representing physical coordinates related to an address in machine-readable format. The disclosed invention provides a method for assigning an identifier to a set of geographical coordinates, such that said identifier may be used to share location information in lieu of a regular address (street name, city, state, etc.). The disclosed invention further allows said identifier to be correlated to additional information related to the address, such as altitude, in order to more accurately point a user to the desired location by only using the assigned identifier.

Abstract: Described herein is a computer implemented method for identifying one or more documents of potential relevance to an input query. The method comprises receiving the input query; processing input text from the query to generate an input query vector; accessing document records from a record database, each document record including a document vector; generating a document similarity score in respect of each accessed document, the document similarity score for a given document record being generated using the document vector for the given document record and the input query vector, the document similarity score for a given document record indicating the similarity of the input text to a document that the given document record is in respect of; and identifying one or more potentially relevant document records based on their document similarity scores.

Abstract: Provided is an edit unit that checks, as time data, a designated time received in an input unit, against a map data DB to identify map data corresponding to the designated time. Upon the receipt of the designated time in the input unit, a map-data generating unit redoes the update of the map data, identified by the edit unit, using measurement data newly acquired after the designated time is received in the input unit.

Abstract: Indexing and matching records in a data management system by defining entity indexing attributes associated with system records, receiving an incoming data entity, selecting a set of entity candidates according to the entity indexing attributes, matching the incoming entity to an entity candidate, generating an analysis of the entity candidate selection according to entity attribute effectiveness, and revising the entity indexing attributes according to the analysis.