181 results about "Dynamic search" patented technology

A method and system for modeling of object-oriented database structures, translation to relational database structures, and dynamic searches thereon. The user may create, edit and manipulate a user's object database (dynamically translated into a set of relational database structures), to create, edit and manipulate objects for that object database (dynamically translated into data for those relational database structures), and to create, edit and manipulate queries to be applied to that object database (dynamically translated into queries to be applied to those relational database structures). A meta-model of the user's object database, which is itself an object database, and which has itself been translated into a set of relational database structures for manipulation by a relational database engine. The meta-model comprises a set of classes, objects, and relationships between classes which model the classes and relationships between classes of the system. Each of these classes may comprise a set of searchable properties, and each of these relationships may comprise an inheritance relationship (between a base class and a derived class) or a data-model relationship (such as a one-to-one, one-to-many, or many-to-many relationship). The data model of the user's object database is modeled by actual objects in the meta-model, and editing or manipulating the user's object database is modeled by creating, modifying, or deleting objects in the meta-model. The meta-model also models itself, in the same manner as it models the user's object database, and may be manipulated in the same manner as the user's object database.

An industry database and method of creating same is provided. The database is created in accordance with a process that includes: identifying a plurality of web sites meeting at least one search criteria; automatically extracting URL addresses for each of the plurality of web sites; automatically categorizing each of the web sites and their corresponding URL addresses in accordance with a predefined category structure; and automatically indexing and storing each of the URL addresses in accordance with the predefined category structure in the database. A method of using a database system is also provided. The method includes: storing in a database, information extracted from a plurality of web sites, wherein the information is automatically categorized and indexed in accordance with a predefined category structure and includes a plurality of URL addresses corresponding to the plurality of web sites; receiving a user query; executing a search engine in response to the user query that searches a subset of the stored information extracted from a subset of the plurality of web sites, and subsequently searching said subset of web sites to find additional information responsive to said user query.

The digital photo organizing and tagging method includes software and a database that organizes digitized versions of dispersed collections of images such as photographs, pictures and other graphical objects from a variety of sources. The method facilitates describing, resizing, indexing, and sorting the different aspects contained in images. Features include documentation, e-mail, updating, version control, inclusion of video, embellishment, sound, animation, text to speech and, dynamic search. An Internet application facilitates annotation, organization, researching and sharing images and corresponding information collected at different times and places. Desktop / Internet applications link and relate images that share common elements. The same person found as a child in one image, as an adult in another, and referenced in a newspaper article is a relation example. The method collects the knowledge embedded in multiple images and produces well documented, organized, and clearly explained printable images, as well as dynamic albums of related images.

A visual method for enhancing search result navigation, comprising: obtaining a first search result from a search engine; clustering the first search result to get clustering information; calculating the correlations between the clustering information and the ranked list of the first search result, and performing visualization processing on the clustering information; and displaying the visual cluster hierarchy and the ranked list of the first search result in a joint manner based on the correlations. When a cluster is selected, further searching is performed and the search result is clustered again. Using the present invention, through combining a traditional ranked list of search results and the visual cluster hierarchy of these search results to display them in a joint manner, a convenient way is provided for the web user to find the potential correlations between the visual cluster hierarchy and the ranked list of the search results. Besides, through dynamically searching and clustering more search results again, the web user may get more detailed and more accurate search results easily.

A method and apparatus for dynamically modifying search results “on the fly” based on the behavior of the user currently conducting a search. In one embodiment, data regarding user behavior is gathered from virtually any activity, including clicks on links, dwell times, downloads, transactions and cursor movements. Subordinate keywords are generated to reflect the intent of the user as inferred from the user's behavior. Subordinate keywords, as opposed to traditional primary keywords, are keywords that are identified as important to the search, but are not necessarily essential for a matched document. They are automatically generated by the system from a variety of places, such as documents clicked on by the user as well as documents that are skipped. The system uses the subordinate keywords to dynamically re-rank matched documents and advertisements to best reflect the inferred intent of the user in order to continuously provide the most relevant results.

The present invention provides systems and methods in which user-created and user-selectable personas are used to enhance a search string for submission to a search engine. The persona information can also be used to filter or rank search results. A given user can combine multiple characteristics in various ways to produce different persona, and can choose among different as desired for a given search. Software to capture, maintain, store, and use persona information can be physically spread out across multiple computers operated by different companies, with a third party hosting the persona capturing interfaces.

A system may receive one or more terms of a search query. The system may automatically identify prior search queries that include the one or more terms of the search query from a history of prior search queries. The system may automatically identify possible spelling corrected search queries based on the one or more terms of the search queries. The system may automatically receive remote server-based query completion suggestions including the one or more terms of the search query. The system may present query refinement options, the query refinement box being populated with the prior search queries as suggested queries for possible selection by a user, the identified possible spelling corrected search queries, and the received query completion suggestions.

A device, system, and method are directed towards enabling a mobile device user to perform a federated search across a plurality of disparate contact data stores, including a phone directory, IM store, an email address book, a buddy list, a social networking group, a SMS list, or any of a variety of other communication contact data stores. When a user inputs a character, a dynamic search is performed across the various contact data stores. The results of the search may be repeatedly updated based on additional input characters. The results of the search may be displayed on the mobile device organized by categories of the contact data stores and / or a preferred communication mechanism. The results may also indicate a preferred mechanism for communicating with the displayed name.

A wavelength division multiplexed optical network has a restoration process to re-route one or more of the wavelengths, by dynamically determining possible restoration routes, and re-routing each wavelength along a chosen one of the possible restoration routes. A distributed dynamic search for restoration routes down to the optical layer, for wavelengths, gives faster and more scalable restoration than reconfiguring routing tables and enables much better utilisation of bandwidth than using predetermined restoration paths.

An apparatus, method, and system are directed to managing a multi-modal communication over a network. In one embodiment, the method, apparatus, and system employ an instant messaging client to perform actions. The actions may include receiving contact information associated with a plurality of communication mediums. The contact information includes contact names and addresses that are integrated into a unified contact store. When a user inputs a character for use in initiating a communication, a dynamic search is performed on the unified contact store. The results of the search may be repeatedly updated based on additional input characters. The results display contact names and addresses, where either the contact name or address includes the input character(s). The user may then select an address, and automatically initiate a communication with a contact name associated with the selected address over a communication medium associated with the address.

A dynamic search interface presents a context which changes in response to user interaction. When the user engages the interface, it responds dynamically to display relevant information and controls. When the user disengages the interface, it returns to a simpler form.

The present invention generally provides methods, systems and articles of manufacture for programmatically providing a user interface for creating queries. In one embodiment, the graphical user interface comprises (i) a region for displaying conditions of a user-defined query; and (ii) a graphical element for initiating a process of applying an event profile to a first condition of the query, whereby results returned by execution of the query are restricted to those for which the first condition and a second condition defined by the event profile are contemporaneously true.

A system and method for manipulating graphic objects on a tactile user interface are provided. The graphic objects can be photographic images which are retrieved in response to a query and are clustered, based on values of first and second user-selected features assigned to the graphic objects. A navigation map is displayed on the user interface. The navigation map represents the clusters of graphic objects in first and second dimensions, corresponding to the first and second features. A user can manipulate a target window displayed on the navigation map using the tactile user interface. The target window encompasses a subset of the clustered graphic objects. A synchronized display of graphic objects in the subset of graphic objects on the user interface corresponds to the subset of clustered graphic objects within the displayed target window.

The present invention is directed towards systems and methods for providing dynamic search results based upon historical data through the use of one or more widgets. The method of the present invention comprises receiving a request for content from a client and generating one or more widgets for providing search result content. A display profile is applied to the one or more widgets and the one or more widgets are combined with static search results to form a search result page that is provided to a requesting client.

A visual method for enhancing search result navigation, comprising: obtaining a first search result from a search engine; clustering the first search result to get clustering information; calculating the correlations between the clustering information and the ranked list of the first search result, and performing visualization processing on the clustering information; and displaying the visual cluster hierarchy and the ranked list of the first search result in a joint manner based on the correlations. When a cluster is selected, further searching is performed and the search result is clustered again. Using the present invention, through combining a traditional ranked list of search results and the visual cluster hierarchy of these search results to display them in a joint manner, a convenient way is provided for the web user to find the potential correlations between the visual cluster hierarchy and the ranked list of the search results. Besides, through dynamically searching and clustering more search results again, the web user may get more detailed and more accurate search results easily.

An apparatus and method is provided to dynamically search for available Web services by persistently searching a distributed multi-level UDDI registry chain, interrogating their published technical specifications and enabling the consumer to find, bind, and invoke the desired Web service in real-time and without intervention by the consumer. The search criteria includes identifying candidate published services that fall within an acceptable margin of error based on information previously published within a consumer service profile. The measure of conformance between the registry semantic map and consumer service profile is parameterized and chosen by the consumer in advance. The service profile includes an XML schema which exposes consumer profile metadata and corresponding information sets used by a rules engine for pattern matching purposes.

The invention provides a method for providing a dynamic searching page, which includes the following steps: detecting key words in a search box; judging the most relevant searching method based on the key words; and changing labels on a searching box page according to relevant searching methods. Correspondingly, the invention further provides a device for providing the dynamic searching page. The method and the device for providing the dynamic searching page reduce operation times for users to adjust to an ideal searching method and improve experience of the users.

The invention discloses a method for shortening an intelligent car path planning and searching time based on a heuristic search algorithm. The method can be applied to the situation that an intelligent car deviates from an initially-set optimum path due to emergency. In view of the situation, the present invention provides a path searching algorithm having a dynamic heuristic function. The method comprises the following steps: extracting environmental information in real time by virtue of a global positioning system and a laser radar of a differential technology, and establishing an environmental map containing a barrier zone and a free zone by virtue of uniform rasterization of the environmental information; and triggering a deviation mechanism in the case that the intelligent car deviates from the original path, and calling the dynamic searching algorithm, and rapidly searching a feasible path in real time. By adopting the method, the contradiction between the optimism and searching efficiency of the global path planning and searching can be effectively processed, and technical support can be provided for the path planning of unmanned driving.

The invention discloses a recommendation method and device of tour routes. The recommendation method and device are used for solving the problems that scenic spots recommended by existing tour recommendation services are scattered and a single tour route is recommended. The recommendation method comprises the steps that a server receives a tour route search request submitted by a client; according to search conditions carried by the search request, scenic spots meeting the search conditions are searched for; according to describing information of the searched scenic spots and the number of tour days, the scenic spots are clustered; clustering results of the scenic spots are recommended to the client. By the adoption of the technical scheme, search results of the scenic spots can be intelligently fed back according to the search conditions of users, the relevance among the scenic spots is improved by means of clustering, the scattered scenic spots are converted into the relevant scenic spots, dynamic search can be achieved, and the problem that the scenic spots are single is solved.

The invention is directed to a system and method of searching a focal object for related objects. The invention may extract clues or information from the focal object and search the information to identify related objects. The invention also may leverage a chronological timeline of user action information to infer additional relationships with the focal object. The related objects may appear on a display for a predetermined amount of time. The invention may provide icons corresponding to related object with characteristics to signify the relevance of the information.

Methods, techniques, and systems for gathering social media content are provided. Some embodiments provide a Social Intelligence System (“SIS”) configured to provide dynamic search capability of a content source by using a proxy server system as an intermediary between the SIS and the content source. The SIS may then dynamically determine a rate at which it searches for content based on a rate of change or predicted change of a particular content source. Dynamically determining a rate allows the SIS to track a particular topic or series of topics over time, while only searching for content on the topic at the most optimal time periods to reduce overall cost.

Techniques are disclosed for performing topologically planar routing of System in Packages (SiPs). A routing graph can be represented by a particle-insertion-based constraint Delaunay triangulation (PCDT) and its dual. A dynamic search routing may be performed using a DS* routing algorithm to determine the shortest path on the dual graph between a start point and an end point. Based on a dynamic pushing technique, net ordering problems may be solved. A first wire can be topologically routed. Dynamic search routing of a second wire may be performed. The first wire may be pushed or detoured in response to the dynamic searching routing of a second wire.

The invention provides a method and system for household meter dynamic registration and stage area identification. The method comprises a step of starting a carrier node registration command in a meter reading idle period, a step of receiving a registration message fed by a collector according to the carrier node registration command, and a step of recording carrier node information according to the registration message and forming collector archive information, wherein the carrier node information is the address information of the collector. According to the method, the functions of user stage area automatic identification, household meter address dynamic search and user data automatic collection are realized, the statistics of electric energy meter address information is not needed, the collector can automatically search meter information and actively registers to a concentrator, the archive information is formed, dynamic update is achieved, the maintenance amount of the management personnel is simplified greatly, and the labor cost is saved.

Communications from autonomous spread-spectrum transmitters are received by dynamically searching the communications band for messages having the same communications parameters, including the use of the same spreading code, but having potentially different code-phases. A receiver that is independent of the transmitters samples the communications band at each code-phase of the spreading code. When a message element is detected at a particular code-phase, the message element is appended to a queue associated with this code-phase. Message elements detected at other code-phases are appended to queues associated with the corresponding code-phases. Gaps between message elements at each code-phase define the beginning and end of each message. In a preferred embodiment of this invention, the processing of the samples occurs at a frequency above the baseband of the encoded message. An FFT processor provides a magnitude and phase associated with each detected message. The magnitude distinguishes message elements from noise elements, and changes in phase determine the bit value associated with each message elements.