Abstract: Data searching apparatus to speed up searching time. This apparatus searches search target items associated with the specified relation items. When a group of search target items is associated with a same group of relation items, an upper item is defined to both of the groups of search target items and relation items. The relation between the upper item and relation items are recorded on first data, whereas the relation between the upper item and search target items are recorded on second data. The relations between the relation items and search items which are not associated with the upper items are recorded in third data. When part of or all of the specified relation items is contained in the first data, the first data, at least the second data is searched, and when no specified relation item is contained on the first data, only the third data is searched.

Abstract: A method for retrieving content by processing a user request received by a first device identifying other devices in proximity to the first device, and retrieving content related to the user request from the other devices based on one or more menu trees.

Abstract: Methods for identifying potentially sensitive information and protecting such potentially sensitive information include scanning systems that collect and/or disseminate such information. Without limitation, systems collect and/or disseminate personal identification numbers (e.g., personal identification numbers, tax identification numbers, etc.), such as merchant systems, bank systems, healthcare systems, and the like, that collect, use, or disseminate sensitive information may be scanned to identify sequences of data that are likely to be sensitive, and may take actions to protect such sequences of data. Scanning and protection systems are also disclosed.

Abstract: In various exemplary embodiments, a system and associated method perform a search for a plurality of items in an electronic environment. In one embodiment, the system provides a user-prompt interface to receive a plurality of sets of keywords from an end-user. An item is identified for each set of keywords and a listing of the items is provided as a response. In some cases, sellers are identified in which each seller offers each item identified from the plurality of sets of keywords. In some cases, the user-interface prompt is configured to receive at least one price range for items associated with the plurality of sets of keywords.

Abstract: A personalized way to digitally record a person's physical activities over time serves web searching, business advertising, nostalgia, security and object tracing purposes. The chronological digital history of the person's physical presence over a time includes (i) digital network entries from other members who hold their portable wireless short range device near the person's device and transmit a URL or other key data and (ii) digital member entries such a digital photograph of a store sign. The digital network entries and digital member entries are automatically transmitted to a database located on a telecommunications network at a time of entry. Advertisers can transmit to members when members enter premises of advertiser's store. Upon sign-up online, the authentication data uniquely associated with an account is provided and key data they want to transmit is associated with the account. Digital histories can be used to improve web searching and networking opportunities.

Abstract: An information acquisition system includes: a mobile terminal; and an information search system. The information search system searches for information on a route based on route information input from the mobile terminal and transmits a search result to the mobile terminal, and the mobile terminal includes a navigation unit that navigates the route from a departure point to a destination. The information search system includes: a database in which information on the route is stored in correspondence with the route information; and an information search server that searches for the information on the route from the database based on the route information and acquires reservation information for transportation on the route based on the information on the route from a reservation system of the transportation, and the information search server transmits the reservation information to the mobile terminal together with the information on the route.

Abstract: A computer-implemented system and method for navigation on a communication network to robustly locate, retrieve and display information. In response to a few user inputs, a hyperlink is created that provides efficient and robust access to original resources and also to alternative resources for originally intended content. Intended content may comprise the whole of or only parts of document resources, which may be affected by linkrot or content modification. Such created links and hyperlinks can be checked to determine if they cannot be followed or if they can be followed but originally intended content is missing or altered. Then intended content can be accessed from alternative resources including archival resources and non-archival live resources.

Abstract: The invention introduces an apparatus for searching linked lists at least including: a memory arranged to operably store a linked list; a linked-list search engine arranged to operably search content of the linked list until a search success or fail and generate a search result; and a processing unit arranged to operably write the content of the linked list into the memory, drive the linked-list search engine to start a search on the linked list and obtain the search result from the linked-list search engine.

Abstract: A method of identifying content, in particular images, that web page visitors view upon an initial connection to a web page. The method includes the server identifying the content most likely to be viewed by a user upon visiting a web page, and prioritizing that content such that the user can interact with the web page without buffering interruption. For example, the method connects each image in an HTML code to the ultimate location of the image on a user's browser, allowing the server to prioritize images to send to the user's electronic device based on the location of the image. As such, the method represents an improvement over existing loading protocols, including the HTTP/2 protocol, by utilizing image location information to identify and prioritize images, and thus determine what images to send to the user's electronic device.

Abstract: The system for search of the present invention includes a search engine, a web site server, and a terminal. The control unit of the terminal performs the input receiving module to receive the predetermined keyword and argument input from the user. The control unit of the search engine performs the web site specifying module to specify the web site relating to the keyword and the argument that the terminal has received as the web site server. The control unit of the terminal performs the argument-related page display module and displays the page relating to the argument of the web site on the image display unit.

Abstract: The present disclosure provides a method and a device for information retrieval, and a computer readable storage medium. The method includes: determining a plurality of search results associated with user input data, and determining a first relevancy between each of the plurality of search results and the user input data; determining a plurality of target paragraphs associated with the user input data from each of the plurality of search results, and determining a second relevancy between each of the plurality of target paragraphs and the user input data; determining a target text segment associated with the user input data from the plurality of target paragraphs in each of the plurality of search results, and determining a third relevancy between the target text segment and the user input data; and determining an order of the plurality of search results based on the first relevancy, the second relevancy and the third relevancy.

Abstract: Each image of a plurality of user-defined collections of images has properties associated therewith. A seed image is defined as currently viewed or selected image and the properties associated with the seed image are retrieved. The seed image is used to identify seed collections as the collections of images which have the seed image as one of their images. A plurality of candidate images are identified from the seed collections. For each candidate image, a significance score is determined as a function of either the number of seed collections to which the candidate image belongs or the ratio of the number of seed collections to the set of all collections to which the candidate image belongs. Each candidate image is ranked based on the significance scores and the seed image properties. At least one candidate image is recommended to the user based on the ranking of the candidate images.

Abstract: Embodiments of the invention provide a method, system and computer program product for content contribution validation. A content contribution validation method includes receiving in memory of a host computing system, from over a computer communications network, a content contribution to existing content stored in data storage coupled to the host computing system. The method also includes selecting a portion of textual terms the contribution and generating a search query utilizing the selected portion. The method yet further includes querying the existing content by a processor of the host computing system using the search query and receiving a result set from the search query. Finally, the method includes determining by the processor whether or not the result set exceeds a threshold match and applying the content contribution to the existing content in response to a determination that the result set exceeds the threshold match, but otherwise rejecting the content contribution.

Abstract: A method and system for improving a domain specific search is provided. The method includes executing a user initiated search query and analyzing associated. In response, a search results data set is generated and associated hardware sensor devices detect how a user interacts with specific search facets of the search results data set. The search results data set is refined and attributes of the specific search facets are determined. Unstructured data associated with items described within the search results data set is updated.

Abstract: The disclosure relates to a method and an apparatus for recommending an associated user. In one embodiment a method comprises determining a first interactive attribute of a first user based on first interactive data of the first user in a multimedia resource playing process; determining interactive relevance between the first user and a second user according to the first interactive attribute and a second interactive attribute of the second user; and recommending, according to the interactive relevance, the second user associated with the first user. Embodiments according to the disclosure can determine an interactive attribute based on interactive data, determine interactive relevance between a first user and a second user according to the interactive attribute, and further recommend the second user associated with the first user, thereby recommending associated users based on user behavior, improving the accuracy in recommending associated users, and enhancing user experience.

Abstract: A method for displaying a service object, a method for processing map data, a client, and a server are disclosed by the embodiments of the present disclosure. The method for displaying the service object includes: providing a filtering interface, wherein the filtering interface comprises a map display area and a dimension-divided display area, the dimension-divided display area displays at least one divided dimension and description information corresponding to a plurality of sub-dimensions, a map of a target city is displayed in the map display area, and the map of the target city displays regional scopes corresponding to the plurality of sub-dimensions; receiving information of a divided dimension and a sub-dimension selected by a user; and displaying a service object associated with the sub-dimension selected by the user according to an association relationship between the service object and the sub-dimension. The methods can provide more rich filtering information to a user.

Abstract: A system includes: a website; a database operably connected to the website; a microguide creation module operably connected to the database, the microguide creation module configured to create a microguide comprising a submission approved for publication, the microguide publishable by the website as a microguide display; and a publication interface operably connected to the microguide creation module, the publication interface comprising a publication readable by a user, the publication comprising a machine readable code, the machine readable code configured to transfer the user from the publication to the microguide display.

Abstract: The application discloses a data processing device, a data processing method and a digital signal processing device. The data processing device is used to reduce computing amount by reading and writing operation of memory. The data processing device comprises: a module for calculating reduced coefficient matrices, a storage module, a module for modifying reduced coefficient matrices, a module for triangular inversing, a module for obtaining inversion matrices and a module for correcting reverse result.

Abstract: Methods, systems, and apparatus, including a system for transforming sparse elements to a dense matrix. The system is configured to receive a request for an output matrix based on sparse elements including sparse elements associated with a first dense matrix and sparse elements associated with a second dense matrix; obtain the sparse elements associated with the first dense matrix fetched by a first group of sparse element access units; obtain the sparse elements associated with the second dense matrix fetched by a second group of sparse element access units; and transform the sparse elements associated with the first dense matrix and the sparse elements associated with the second dense matrix to generate the output dense matrix that includes the sparse elements associated with the first dense matrix and the sparse elements associated with the second dense matrix.

Abstract: Techniques facilitating matrix multiplication on a systolic array are provided. A computer-implemented method can comprise populating, by a system operatively coupled to a processor, respective first registers of one or more processing elements of a systolic array structure with respective input data bits of a first data matrix. The one or more processing elements can comprise a first processing element that comprises a first input data bit of the first data matrix and a first activation bit of a second data matrix. The method can also include determining, by the system, at the first processing element, a first partial sum of a third data matrix. Further, the method can include streaming, by the system, the first partial sum of the third data matrix from the first processing element.

Abstract: Methods, structures and computer program products for digital sample rate conversion are presented. An input digital sample with a first frequency is converted to an output sample with a second frequency. A sample rate conversion circuit is provided which provides an enhanced transposed farrow structure that enables an optimised trade-off between noise levels and computational complexity. Each output sample is derived by convolution of a continuous time interpolation kernel with a continuous time step function representing the input sample stream. In a sample rate conversion structure, there is a trade-off between the quality and the computational complexity. The quality is defined as a ratio between the (wanted) signal power and the (unwanted) noise power. The computational complexity may be defined as the average number of arithmetic operations that are required to generate one output sample. A higher computational complexity will generally lead to a higher power consumption and larger footprint.

Abstract: An associative processor includes a memory array and a controller. The memory array stores a multiplicity of N bit stochastic numbers in separate rows of a stochastic section of the memory array and each stochastic number has a same probability distribution P. The controller includes a probability calculator which receives a desired probability distribution Pdesired, determines a Boolean function of a set of the N bit stochastic numbers which produces the probability distribution Pdesired and activates associated rows of the stochastic numbers to implement the function on the rows to produce a resultant stochastic number having the probability distribution Pdesired.

Abstract: A processor may determine at least one document formatting feature by analyzing raw data and select templates corresponding to the at least one document formatting feature. The processor may generate a dynamic document template including at least a portion of the raw data and based on the selected templates. The dynamic document template may include a plurality of template sections arranging the raw data into a prescribed document format. The processor may receive at least one user change to the dynamic document template and may regenerate the dynamic document template by regenerating only a subset of the template sections affected by the change while preserving at least one template section unaffected by the change. The processor may generate the formatted document by processing the dynamic document template into a static form having the at least one document formatting feature and including the at least the portion of the raw data.

Abstract: A system and method for creating and managing electronic forms is described. The system includes a processor configured to receive an image of a form and receive, via a network interface, form template information specifying at least a first input field. The form template information includes a first input field type selection and first field location information for the first input field. The first input field type is selected from a plurality of input field types and the first field location information is defined relative to the image. The processor stores the form template information within a memory. The electronic form is configured to be rendered by superimposing a representation of the first input field over the image of the form.

Abstract: Systems for user interface composition in a collaboration environment. A method commences upon identifying a server in a cloud-based environment, wherein the server is interfaced with one or more storage devices that store one or more objects accessible by two or more users. Upon receiving a request to access an object that is stored in the cloud-based environment, the method processes the request to determine if the object has two or more rendering options such as a popup rendering option or a modal rendering option. If so, the method selects one of the rendering options and collects further information such a user profile information and/or a collaboration rulebase, which further information is used to drive composition of formatted object. The adaptively-formatted object is transferred over the network to satisfy the request.

Abstract: A technique for providing alternative text for use in association with an image in a web page includes processing code for a web page to display the web page. An application program identifies from the code a URI specifying an image data file for an image to be displayed in the web page. The application program determines whether the URI of the image data file includes a fragment identifier and, in response to determining that the image data file includes a fragment identifier, determines whether text follows the fragment identifier. In response to determining that text follows the fragment identifier, the text is used to identify alternative text for the image and the web page is rendered with the alternative text in place of the image.

Abstract: In an approach to determining one or more logical breaks in a digital text, a computer determines a reading speed of a user for a current reading session of a digital text and an available time for the current reading session for the user. The computer then determines, based, at least in part, on the reading speed and the available time, a user range in the digital text for the current reading session, and then one or more possible logical breaks within the user range. The computer further determines a first logical break, based on the determined user range, of the one or more possible logical breaks for the current reading session.

Abstract: Display of a graphical user interface form is initiated in response to selection of a targeted uniform resource locator (URL) directed to a customer destination. The form can have a plurality of required fields. Thereafter, using identification information for the customer encapsulated within the targeted URL, at least one data source is polled to obtain data associated with the form and the customer. Based on the polling and the obtained data, an identification of which of the plurality of required fields do not have entries in the at least one data source is made. In response, the graphical user interface form is generated and rendered in a graphical user interface so as to include the identified fields and to exclude at least a portion of the other fields. Related apparatus, systems, techniques and articles are also described.

Abstract: The technology disclosed relates to formulating and refining field extraction rules that are used at query time on raw data with a late-binding schema. The field extraction rules identify portions of the raw data, as well as their data types and hierarchical relationships. These extraction rules are executed against very large data sets not organized into relational structures that have not been processed by standard extraction or transformation methods. By using sample events, a focus on primary and secondary example events help formulate either a single extraction rule spanning multiple data formats, or multiple rules directed to distinct formats. Selection tools mark up the example events to indicate positive examples for the extraction rules, and to identify negative examples to avoid mistaken value selection. The extraction rules can be saved for query-time use, and can be incorporated into a data model for sets and subsets of event data.

Abstract: At least one XML document to be validated is parsed, and XML data in the at least one XML document is represented as data objects in at least one data object model in a memory. At least one rule document is parsed and a rule object model that includes rule objects is created in the memory. At least part of the data objects are extracted from the at least one data object model and at least part of rule objects are extracted from the rule object model. Partial validation is performed in a corresponding execution context that validates the extracted at least part of the data objects based upon the extracted at least part of the rule objects.

Abstract: Disclosed herein is a translation platform making use of both machine translation and crowd sourced manual translation. Translation is performed on pages in an application. Manual translations are applied immediately to local versions of the client application and are either human reviewed or reverse machine translated and compared against the original text. Once verified, the translations are applied to all end-clients.

Abstract: A process for context-based autocompletion suggestion includes, based on initiating an online chat by a user of a computer system, the chat having as participants the user and a target participant, providing participant information that identifies the participants. The process maintains at the computer system a relation-based autocompletion model for use in word autocompletion suggesting. The maintained relation-based autocompletion model is initially a template model based on to relationship between chat participants, and is updated over time via training. The process suggests to the user words for autocompletion in the user's composition of chat messages, the suggested words being selected as suggestions based on the maintained relation-based autocompletion model. Maintaining the relation-based autocompletion model includes sending chat messages as training data to further train the autocompletion model.

Abstract: A method comprising: operating at least one hardware processor for: receiving, as input, at least one named entity, modifying said named entity based on a plurality of modification rules to generate a set of candidate named entities corresponding to said named entity, and identifying, for at least one candidate named entity in said set of candidate named entities, an article in a knowledge base of articles, wherein a title of said article matches said candidate named entity.

Abstract: Systems and methods for annotating conversations between a user and an electronic assistant in a hierarchical manner are disclosed. An example system includes a data store of hierarchical annotation records. The hierarchical annotation records include root records and non-root records. Each root record has a conversation identifier and an annotation identifier. Each non-root record includes an annotation identifier and a parent identifier, the parent identifier being an annotation identifier of another record. At least some of the non-root records further include an annotation tag. The system generates a first new root record and first non-root records for an input dialog act and generates a second new root record and second non-root records for an output dialog act that is responsive to the input dialog act. At least one of the second non-root records includes an annotation tag linking back to a record of the first non-root records.

Abstract: A method, system, and computer program product provide a conversation agent to process natural language queries expressed by a user and perform commands according to the derived intention of the user. A natural language processing (NLP) engine derives intent using conditional random fields to identify a domain and at least one task embodied in the query. The NLP may further identify one or more subdomains, and one or more entities related to the identified command. A template system creates a data structure for information relevant to the derived intent and passes a template to a services manager for interfacing with one or more services capable of accomplishing the task. A dialogue manager may elicit more entities from the user if required by the services manager and otherwise engage in conversation with the user. In one embodiment, the conversational agent allows a user to engage in multiple conversations simultaneously.

Abstract: Disclosed is a system for real-time expression of a semantic mind map and its operation method there for. The system includes an association matrix and a focus associated operation module, the association matrix is connected to the focus associated operation module. The association matrix includes a start node, a direct associated module, an indirect associated module, a weakly associated module, a superscript module, or the like. The focus associated operation module includes a focused node and focus associated nodes, or the like. When the present disclosure is applied to a search engine including a cross-database search engine, a search result service interface is in real time expanded, thus being used to help a user better identify and discover relevant documents of interest.

Abstract: A document processing system is configured to identify, for each accessed electronic document in a first set of multiple electronic documents, a set of identified multi-word phrases determined to be in ordered text information in the accessed electronic document, each multi-word phrase of the set of identified multi-word phrases including adjacent words in the ordered text information; and determine, for each accessed electronic document in the first set of multiple electronic documents, a selected document type from the first set of document types based at least on an analysis of the set of identified multi-word phrases with respect to multi-word-phrase characteristics identified by a first definition and associated with each document type in a first set of document types associated with a first document-set type.

Abstract: A bidirectional speech translation system, a bidirectional speech translation, method and a program are provided for executing speech translation by using a combination of a speech recognition engine, a translation engine, and a speech synthesis engine that are suitable for received speech or a language of the received speech. The bidirectional speech translation system executes processing for synthesizing speech by translating first language speech entered by a first speaker into a second language and processing for synthesizing speech by translating second language speech entered by a second speaker into a first language.

Abstract: Systems, methods and computer program products related to aligning heterogeneous sequential data. A first sequential data stream and a second sequential data stream are received. An action related to aligning the first sequential data stream and the second sequential data stream is determined using an alignment neural network. The alignment neural network includes a fully connected layer that receives as input: data from the first sequential data stream, data from the second sequential data stream, and data relating to a previously determined action by the alignment neural network related to aligning the first sequential data stream and the second sequential data stream.

Abstract: Disclosed herein are an apparatus, non-transitory computer readable medium, and method for querying big data and displaying the results of the query. A multilevel hierarchy of data structures is associated with a particular date to reduce the linearity of the search. The client receiving the query results stores the results in a linked list with a record format consistent with the resulting records. The client also periodically refreshes a graphical user interface with the query results until all the results are received.

Abstract: Providing objects in a feed is described. A computing device identifies activities of fans of content of a content owner. The activities are associated with objects pertaining to the content of the content owner. The computing device creates a feed that includes at least a subset of the objects pertaining to the content of the content owner for presentation to the content owner.

Abstract: Systems, methods, and computer program products relating to clustering unstructured data. A set of unstructured documents is tokenized to produce a plurality of tokens. A frequency at which terms appear in the plurality of tokens is analyzed, to generate a vocabulary of terms. A vocabulary indices matrix is generated based on the generated vocabulary of terms. The matrix relates to the set of unstructured documents. A plurality of rows in the vocabulary indices matrix are matched to generate a plurality of clusters for the set of unstructured documents.

Abstract: Presented herein are methodologies for implementing erasure coding in a distributed log structured storage system. A method includes receiving a write request for first data from a file system, selecting a physical sector on a selected storage device in an array of storage devices on which to store the first data, assigning a key to the physical sector, storing the key and an indication of the physical sector in a key-to-physical medium map, erasure coding the data, including generating parity data associated with the first data, writing the first data and the parity data as a data stripe to each storage device in the array of storage devices and, in response to receiving the write request, sending the key to the file system. Read, update, and delete procedures in the context of a log structured framework are also described.

Abstract: Embodiments of the present disclosure are directed to methods and systems for adapting workflows for the processing of database records. More specifically, the records management and processing system can maintain a plurality of records in a database. Each record can comprise a record of a service provided to a consumer by a service provider of a plurality of service providers. For each record of the plurality of records, an expected result from taking an additional action on the record can be determined. A set of records from the plurality of records and having a common attribute value can be determined based on the determined expected result for each record of the plurality of records. The identified records can be processed according to one or more workflows executed by the records management and processing system.

Abstract: An example operation may include one or more of receiving cryptocurrency information of a cryptocurrency mined via a blockchain, determining a volatility of the cryptocurrency based on the received cryptocurrency information, in response to the determined volatility being greater than a predetermined threshold, stopping inclusion of transaction data within data blocks for storage on the blockchain, and generating one or more transaction-free data blocks, and storing the one or more transaction-free data blocks within a hash-linked chain of transaction data blocks previously stored on the blockchain.

Abstract: This disclosure is of an information management system that includes a first computer programmed to: receive (a) observation data resulting from observation of a physical location, and (b) at least one associated visual image of the physical location; link the received observation data and the at least one associated visual image; and display the observation data and the at least one associated visual image.

Abstract: A method of augmenting a knowledge graph includes obtaining the knowledge graph, which includes entities and relationships between the entities defining respective edges, clustering the entities into knowledge domains using semantic distances determined between the entities and a threshold on the semantic distances, identifying strengths of the relationships between adjacent entities in the knowledge graph, creating knowledge chains from node pairs in the knowledge graph, including generating a minimum spanning tree using the strengths of the relationships, pruning edges from the knowledge chain using a threshold on weights corresponding to the edges, defining a first knowledge index for each of the knowledge chains, defining a second knowledge index for each of the knowledge domains, and defining a third knowledge index for the knowledge graph as a harmonic mean of a sum of the first knowledge indexes and a sum of the second knowledge indexes.

Abstract: Technologies are described for improving the performance of distributed database systems. The technologies provide suggested table distributions that can reduce the performance overhead associated with database operations that involve multiple nodes, and can provide more even distribution of computing resource use. In a particular example, a method includes minimizing a scoring function that includes a plurality of performance metrics, at least a portion of the metrics being associated with a weight. Candidate table distributions can be analyzed in an iterative manner to determine a lowest-score distribution. A final table distribution can be output, such as to a user.

Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. After a time, packets in the uncompacted portion of a buffer are combined into compacted packets in the compacted portion of the buffer. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.

Abstract: A method is provided for space-efficient bookkeeping using bit-level locking. Each row of a bookkeeping table stores binary data comprising a plurality of bits. Each bit of the plurality of bits corresponds to a particular message and a particular consumer of the message, and indicates whether the particular message has been dequeued by the particular consumer. The bookkeeping table is stored on-disk and data corresponding to the bookkeeping table is stored in volatile memory. When a message is dequeued the in-memory bookkeeping data is updated, and the bookkeeping table is updated based on the in-memory bookkeeping data when the dequeue is committed.