Abstract: An administrator may wish to limit the number of tuples that may be spawned as a result of a first tuple entering an operator graph. A first stream operator may receive a first tuple in order to perform an operation on the first tuple to generate a second tuple. The first stream operator may determine whether it is permitted to generate the second tuple by comparing the first tuple's tuple spawn counts to a tuple creation policy. If the first stream operator is permitted to generate the second tuple, the first stream operator may perform the operation on the first tuple and generate the second tuple.

Abstract: A method and apparatus for performing a top-down Breadth-First Search (BFS) includes performing a first determination whether to convert to a bottom-up BFS. A second determination is performed whether to convert to the bottom-up BFS, based upon the first determination being positive. The bottom-up BFS is performed, based upon the first determination and the second determination being positive. A third determination is made whether to convert from the bottom-up BFS to the top-down BFS, based upon the third determination being positive.

Abstract: Disclosed are various implementations of systems that facilitate idempotence of transactions that are generated by a client application executed by a client device. Systems and methods described herein also facilitate cleanup of transaction data that is outside an idempotence window provided by an idempotence service.

Abstract: The disclosed embodiments relate to systems and methods for efficiently distributing content among a plurality of users which may be used to implement a social networking service. Content items, which may include “posts” submitted by one user, e.g. responsive to a “post” submitted by another user, are stored in association with data indicative of a specified subset of an interest category classifications defined by the system. Users of the system further specify a subset of the interest category classifications to define their interests. The system then provides content items of interest to the user by mapping, as will be described, the defined interests of the user against the interests associated with the stored content items. The disclosed embodiments enable users to discover and expand their interconnections with other users which may have similar interests.

Abstract: A computer querying stored information by application of a user-defined importance condition, a preference probability in relation to a user-defined preference condition, and a user-defined target condition is provided. The computer may perform a search operation, filtering operation, and matching operation based on a result of the querying and generate a search result, filtering result, and matching result. The computer may also generate an indication of a ranking of the search result, filtering result, and matching result.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for processing local search results. In one aspect, a method determines a first local document in a set of local documents for search results is eligible for a demotion operation. The determination is based at least in part on a proximity measure based on the location of the user device and a location specified for the first local document. In response to the determination, for each other local documents in the set of local documents, a proximity measure location of the user device and the location specified for the other local document is determined. The first local document is demoted in its ranking when at least one of the proximity measures indicates a respective other local document has a specified location that is within a threshold distance of the location of the user device.

Abstract: An approach is provided for automatically ingesting additional corpus based on an interaction history that is mined to identify a question that meets specified answer deficiency criteria, and then generate a second question which is correlated to the first question by requesting additional answer information for answering the first question, where the second question is posted to a forum using a selected persona so that forum responses can be monitored and ingested as additional content in the knowledge base.

Abstract: A server receives a query identifying one or more attributes of an entity. The server accesses a set of candidate templates for answering the query based on the one or more attributes of the entity, each candidate template having one or more fields, wherein each field is associated with at least one constraint. The server obtains a set of information that answers the query and selects a template from the set of candidate templates, where the selected template has a maximum number of fields with constraints that are satisfied by the set of information. The server then generates a phrase by adding the set of information to the one or more fields of the selected template, such that the phrase comprises an answer to the query. Finally, the server communicates the phrase to a client device.

Abstract: A method, implemented on at least one computing device each of which has at least one processor, storage, and a communication platform connected to a network for presenting a search result in a search result card, the method includes receiving from a user, an input associated with a search query; fetching one or more search results in accordance with the search query; generating a search result card for each of the one or more search results; and presenting to the user, one or more search result cards as a response to the search query, the one or more search result cards corresponding to the one or more search results, respectively.

Abstract: The present invention provides a method of transferring content from a file and a database. In this case, the file includes content instances, each content instance being associated with a respective field, and each field having a respective type. The transfer is achieved by determining the type of each field, and then storing each content instance in a store in accordance with the determined field type of the associated field. Each content instance can then be transferred to the database in accordance with the determined field type. A similar procedure is provided for creating XML files based on content within the database.

Abstract: Database systems and methods that implement a data aggregation framework are provided. The framework can be configured to optimize aggregate operations over non-relational distributed databases, including, for example, data access, data retrieval, data writes, indexing, etc. Various embodiments are configured to aggregate multiple operations and/or commands, where the results (e.g., database documents and computations) captured from the distributed database are transformed as they pass through an aggregation operation. The aggregation operation can be defined as a pipeline which enables the results from a first operation to be redirected into the input of a subsequent operation, which output can be redirected into further subsequent operations. Computations may also be executed at each stage of the pipeline, where each result at each stage can be evaluated by the computation to return a result. Execution of the pipeline can be optimized based on data dependencies and re-ordering of the pipeline operations.

Abstract: A system and method are disclosed for modeling a non-relational database as a normalized relational database. In one embodiment, the system identifies a column having a first type in a column-oriented, non-relational database; determines whether the column-oriented, non-relational database includes at least one column having a second type and identifies the one or more columns having the second type; virtually divides the column-oriented, non-relational database based on column type; and generates a normalized, relational model based on the virtual division of the column-oriented, non-relational database, the normalized, relational model including catalog information representing a parent table including the column having the first type and, when the column-oriented, non-relational database includes at least one column having the second type, catalog information representing a child table, the parent table and child table both represented as relational tables.

Abstract: Systems, methods, and software are disclosed that provide enhanced replication for message services. In one implementation, updates to a replication source are replicated to replication targets. The replication is monitored to identify an individual health of the replication for each of the replication targets. A composite health of the replication is determined based on the individual health of the replication for each of the replication targets. The updates to the replication source are then controlled based on the composite health of the replication.

Abstract: The preservation of the user interface state of first application on a first device allows, in one embodiment, a user to resume use of at least a portion of the user interface state on a second application on second devices. The first and second applications can be the same or different (with some common user interface UI features or elements and other UI features that are different). Other embodiments are also described.

Abstract: The described technology is directed towards asynchronous models that retrieve view-specified data for a view. A view requests a view model to return view-specified data; in turn, the view model makes one or more requests to a data model to retrieve information corresponding to the view-specified data. The data model communicates with a data source such as a web service or a cache to return the requested information to the view model. The view model may assemble/reformat the information into a data format corresponding to the view specified data format for returning to the view. The requests may be asynchronous, with a promise returned in response until the data or information is returned to fulfill the promise.

Abstract: Systems, methods, and software program products discussed herein can create a backup or replica of a master. A method can include receiving, at a backup server, a serialized stream of data representative of changes to a first file of a computer and sorting the received stream of data and storing the sorted data in a memory. The method can include sending an acknowledgment to the computer indicating that the stream of data was received, writing all the sorted data to a single second file, and merging, on the backup server, the written data with data representative of a backup of data on the computer in response to writing all the sorted data to the single second file.

Abstract: The present invention relates to a method and system for partitioning a database. The method for partitioning a database comprises: grouping a plurality of entries in the database into one or more entry groups, so that entries in the same entry group are always accessed together by one or more transactions; and dividing the one or more entry groups into a set number of partitions, so that a total number of transactions that access across more than one partition is minimized. By means of the present invention, it is possible to obtain an efficient, flexible and convenient method for partitioning a database, thereby greatly improving the system performance.

Abstract: Methods and systems are provided for processing data objects in a computer system. In one embodiment, a method is provided that comprises (a) storing a first data object in a database in a non volatile storage, (b) creating a second data object assigned to the first data object, step (b) being triggered by step (a), and (c) processing the second data object by means of an object processor, the object processor creating a third data object using data contained in the second data object, data contained in the first data object and data contained in the database by applying a set of one or more pre-settable rules to the data contained in the first and second data objects and in the database.

Abstract: A method for identifying at least one contact associated with a user and an online communication network. The method may include receiving at least one search term or a social media post entered by the user. The method may also include performing text analytics on the received search term or the social media post to determine at least one subject. The method may further include identifying a plurality of contacts associated with the user, whereby the user and the plurality of contacts are associated with the online communication network. The method may additionally include performing text analytics on a plurality of communications associated with the identified plurality of contacts to determine a plurality of context information. The method may include comparing the determined subject to the determined plurality of context information. The method may include identifying at least one contact within the identified plurality of contacts based on the comparing.

Abstract: In a computing device that implements a data object classification tool, a method for classifying data may include detecting change in spatial coordinates for each of at least two of a set of data objects within a canvas space. Each of the data objects may be associated with a vector of features. A rule set may be generated based on the vector of features associated with each of the at least two data objects. The rule set may use feature(s) that explain the changed spatial coordinates. The data objects may be selectively rearranged within the canvas space by applying the generated rule set to any remaining data objects among the set of data objects so as to assign spatial coordinates to the remaining objects. For each of the data objects, the spatial coordinates may be stored as new semantic feature(s) within the vector of features for that data object.

Abstract: The method and system for sorting the phonebook contacts by finding the weight of contacts for each application based on contact incentives and sorting the applications by measuring the weight of the applications based on application incentives is provided. The contact incentives can be identified for each application and the method calculates weight of contacts for each application. The method identifies the application incentives, and calculates the weight of each application. Based on the weight of contacts and the weight of application, the method normalizes sorts the contacts in phonebook.

Abstract: Systems and methods are provided herein for using a trained knowledge graph to accurately determine whether two phrases are conversationally connected. To this end, three phrases are received. The phrases are translated to strings of word types by determining what type of word each word of each phrase represents, and replacing each word of the first phrase with its respective type. A knowledge graph is then accessed to determine strengths of association between a combinations of each string of word types and any conversational category of a plurality of conversational categories. If any of the strengths of association exceed a threshold, the corresponding strings may be determined to be part of a conversation.

Abstract: A system and method of processing a search request is provided. Identification of a desired content item is based on comparing a topic of the search request to previous user input. The method includes providing access to a set of content items with metadata that describes the corresponding content items and providing information about previous searches. The method further includes receiving a present input from the user and determining a relatedness measure between the information about the previous searches and an element of the present input. If the relatedness measure is high, the method also includes selecting a subset of content items based on comparing the present input and information about the previous searches with the metadata that describes the subset of content items. Otherwise, the method includes selecting a subset of content items based on comparing the present input with the metadata that describes the subset of content items.

Abstract: In embodiments, the present invention provides a method and system for switching between broadcast and unicast content on a mobile device. The method and system involves making unicast content available to the mobile device, making broadcast content available to the mobile device; and providing an application on the mobile device which allows for switching between the unicast and broadcast content.

Abstract: The described embodiments relate to techniques for facilitating text inputs with long-tail keywords from a user in a social question and answer (Q&A) application. During operation, the system receives an input from the user. The system then applies a predictive model to determine a predicted business outcome for the received input from the user. Next, the system renders a user interface (UI) for subsequent user interaction with the social Q&A application, based on the predicted business outcome. Finally, the system displays the rendered UI to the user.

Abstract: A system and associated methods for responding to a request for a web page containing dynamic content by generating and delivering a static version of the requested page and content. Specifically, embodiments are directed to a system and methods for receiving a request for dynamic web content at a server, instantiating a virtual browser within an execution environment running on the server, loading the requested dynamic web content into the virtual browser, executing the executable content of the requested dynamic web content (thereby creating a corresponding static version of the requested dynamic web content), and delivering the static version in response to the request.

Abstract: Web information providing system and method are provided to search for Web sites and content that provide services given the keywords input by a user and displays the linked data. When a user inputs the search keywords into a keyword input unit, an entry decision unit determines the entered formats of the input keywords. An attribute decision unit determines the attributes from the content represented by the keywords corresponding to the format of the entry. A search unit searches for Web sites and content that provide the services corresponding to the attributes and displays the linked data of the searched Web sites and content on a display unit. If the linked data displayed on the display unit is selected, an access unit accesses the Web site and instructs the provision of the service indicated by the entry content of the keywords.

Abstract: Disclosed is a method and system for identifying a sensor to be deployed in a physical environment. The method may comprise storing sensor data and metadata of the plurality of sensors in a data store. Further, the method may comprise deriving sensor information comprising at least one of thematic information, temporal information, and spatial information. The method may further comprise creating sensor ontology to define a relationship between the sensor data, the metadata, and the sensor information. The sensor ontology may be stored in a knowledge repository of the data store. The method may further comprise receiving and decomposing the search query into at least one of a basic query component and an inferred query component. Finally, the method may comprise executing the basic query component or the inferred query component on the data store and the knowledge repository respectively in order to identify the sensor.

Abstract: A method for searching assigned planograms corresponding to a floor plan includes receiving an indication of a type of search to conduct and a search parameter. The computer-implemented method further includes searching determining if the search is for a planogram or for a product contained within a planogram. When the search is for a planogram, the property of the planogram corresponding to the search type is compared to the search parameter. When the search is for a product, the property of each product contained within each planogram corresponding to the search type is compared to the search parameter. A list of all planograms matching the search parameter or containing a product that matches the search parameter is generated. The list is interpreted by a display device running a store layout application to depict the matching planograms in a first color and non-matching planograms in a second color.

Abstract: Search results are prioritized based on the size of the content sources from which the search results were obtained. Such content sources may include, for instance, a user's local sources (e.g., a hard drive associated with a user's computer), a user's online content sources (e.g. a user's cloud storage), and the entire web. Search results which are obtained from smaller content sources (i.e., those containing fewer resources) are presented to the user before search results which are obtained from larger content sources (i.e., those containing a greater number of resources).

Abstract: A personalization system includes a user events module configured to receive a plurality of user events, each user event of the plurality of user events including one or more of a transactional event and a behavioral event associated with the online user, and a personalization cluster including a plurality of personalization servers, each personalization server of the plurality of personalization servers configured to receive a personalization request from a requesting system, the personalization request including a plurality of intermediate results identified by the requesting system, each intermediate result representing a possible outcome that may be presented by the requesting system to the online user, compute a score for each intermediate result of the plurality of immediate results based at least in part on the plurality of user events, thereby generating a plurality of scores, and return the plurality of scores to the requesting system.

Abstract: A method, system and product for filtering out data content on a computing device that is integrated into the operating system of the computing device, comprising receiving, by the computing device and in response to a network request by an application, an object associated with content identifiers. The method, system and product further comprise determining, by the computing device and based on an indication of selected filter criteria, a respective weighted probability for the object, and determining, by the computing device, a graphical element for the application based on the weighted probabilities. The method, system and product further comprise outputting, by the computing device and at the graphical user interface of the computing device, the graphical element.

Abstract: A system for providing a search service application is disclosed and includes an application builder component that provides a search model for a first object of a plurality of objects. The search model is based at least on an end-user input field corresponding to a first attribute of the first object and a search result output field corresponding to a second attribute of the first object. The search model is also associated with a backend data store that supports a storage structure that stores information relating to the first object. The system also includes a deployment engine that automatically configures a search engine system associated with the backend data store to generate new search indexes based on the search model, and to place a portion of indexed data into a first partition and to place another portion of indexed data into at least another partition based on the search model.

Abstract: An improved method and system for identifying individual users accessing a web site. A web site server is able to identify distinct users by using a unique identifier associated with each client computer system requesting access to the web site. The unique identifier comprises an Internet address, such as an Internet Protocol (IP) address, and a time value associated with each client computer system requesting access to the web site. On starting up a web browser, an application program or browser plug-in may synchronize the internal clock included with the client computer system with a global time standard. The synchronized time value may be based on an event associated with the client computer system, such as the start of a web browser. A web site server may determine the uniqueness of the client computer system by comparing unique identifier records of users accessing the web site. A user may be identified as distinct if no matching record exists in the database.

Abstract: Various embodiments for intelligent homepage tuning using a processor device in a computing environment. Usage patterns of website activity within a web browser are recorded. The recorded usage patterns are stored. A preferred homepage is determined and displayed within the web browser according to time and location based on the stored recorded usage patterns.

Abstract: A method and associated system for converting both a tabbed table in an XML format and a collapsible section in the XML format to forms configured for storage in a relational database and use by a web-based application. The tabbed table is a first type of unstructured rich text information in the XML format that is tabbed table specific. The collapsible section is a second type of unstructured rich text information in the XML format that is collapsible section specific. The tabbed table in the XML format is transformed to an XHTML format. The tabbed table in the XHMTL format is exported from the relational database to the web-based application. Storage of the collapsible section in the XHTML format in the relational database is initiated. The collapsible section in the XHMTL format is exported from the relational database to the web-based application.

Abstract: Methods and systems for efficient retrieval of neighboring measurement values in order to enable fast execution of rule-based error correction are disclosed. In one aspect, a method for data normalization using multi-key sorting is disclosed. In some embodiments, the method includes receiving, by a data organization engine, a set of uncorrected data including corresponding neighboring data. In various embodiments, the data organization engine organizes the uncorrected data by construction of a directed acyclic graph (DAG), where the DAG includes a plurality of nodes. In some embodiments, the data organization engine may traverse the plurality of nodes to retrieve the corresponding neighboring data. Upon retrieval of the neighboring data, a rule-based correction engine may correct the uncorrected data utilizing the retrieved corresponding neighboring data.

Abstract: System, computer implemented method and computer program product for preparing and navigating a query tree including a plurality of query nodes and informational nodes. Each query node is associated with a prompt, branching criteria and keywords. A current query node provides a prompt to a user and a user response is received and analyzed to identify branching criteria and keywords from the user response. The method navigates to another node in the query tree in consideration of the branching criteria received in the user response and a comparison between the keywords received in the user response and the keywords associated with the query nodes. The comparison may validate navigation to a destination node corresponding to the branching criteria or the comparison may indicate incorrect navigation of the query tree. Corrective navigation can be implemented in various ways based upon the keywords received in the user response.

Abstract: A processor calculates, in accordance with a convex hull configuration algorithm, an interface of a fluid model expressing the fluid as a collection of particles according to an input boundary condition and initial condition. The processor calculates surface energy of the calculated interface. The processor calculates surface tension of the interface according to the calculated surface energy. The processor outputs, for each predetermined time interval, a state of the fluid according to the calculated surface tension.

Abstract: Examples of techniques for statistical static timing analysis of an integrated circuit are disclosed. In accordance with aspects of the present disclosure, a computer-implemented method for statistical static timing analysis of an integrated circuit is provided. The method may comprise identifying a timing parameter that contributes to a delay calculation. The method may further comprise determining, by a processing device, whether the identified timing parameter significantly impacts the delay calculation. The method may also comprise, responsive to determining that the identified timing parameter does not significantly impact the delay calculation, avoiding a sensitivity calculation for the identified timing parameter.

Abstract: The present disclosure relates to a system and method for performing Path-Based Analysis (PBA) of an electronic circuit design. Embodiments may include receiving a command to create a spice deck of a timing path associated with the electronic circuit design. In response to receiving the command, embodiments may further include initiating PBA for the timing path and identifying one or more stages within the timing path. Embodiments may also include performing a delay calculation for each of the one or more stages and generating a stage spice deck for each of the one or more stages based upon, at least in part, information from the delay calculation, wherein the stage spice deck encapsulates all elements of the stage. Embodiments may further include connecting the stage spice deck for each of the one or more stages in series to form a complete path spice deck.

Abstract: Integrated circuits (ICs) rely on static timing analysis during their design to ensure that they will operate at desired frequencies. Delays between sequential elements (e.g., latches and flip-flops) are constrained to meet target clock periods. Certain signals, however, such as untimed nets may be excluded from timing constraints if the circuit function does not require these nets to switch and propagate to sequential elements within the clock period. However, a signal marked as “untimed” may have been mistakenly specified by the designer as an untimed net. To verify that an untimed net does not negatively impact the function of the design logic, the embodiments herein generate upstream and downstream event networks using shadow logic that corresponds to design logic upstream and downstream of the untimed net. A metastability network coupled to these networks is used to model nondeterminism and metastability resulting from transitions or potential glitches on the untimed net.

Abstract: A method of performing transistor simulation with improved sensitivity to parasitic by model order reduction in transistor-level timing is disclosed. The method includes reducing a number of derivative calculations during transistor simulation by representing parasitics as a reduced-order model, wherein the reducing includes: compressing the parasitics to a reduced-order model; simulating with load which is replaced with the reduced-order model; differentiating results of the simulation with respect to reduced-order model parameters; differentiating parameters of the reduced-order model with respect to parasitic values; differentiating the parasitic values with respect to statistical parameters; and computing the differential results of the simulation with respect to the statistical parameters via chain ruling.

Abstract: Disclosed are a system and a method for integrated circuit (IC) performance modeling, wherein a design layout of an IC is analyzed to identify a first conductive shape (e.g., an internal local interconnect or contact bar shape) on a diffusion boundary shape of a semiconductor device and to also identify the first conductive shape's connectivity to any second conductive shapes (e.g., a via, via bar, or external local interconnect shapes) inside and/or outside the limits of the diffusion boundary shape. A condensed resistance model for the first conductive shape is selected from a model library based on the previously identified connectivity. The selected condensed resistance model will have a lesser number of nodes and/or resistive elements than a full resistance model for the conductive shape. The selected condensed resistance model is used to construct a condensed netlist, which is used in a combined netlist to simulate IC performance.

Abstract: The present disclosure relates to a computer-implemented method for electronic design verification. The method may include receiving, using a processor, an electronic design at a verification environment and generating a symbolic constant for use with the verification environment. The method may further include identifying a plurality of X sources associated with the verification environment and modifying the plurality of X sources based upon, at least in part, the symbolic constant. The method may also include running a first target node and if the first target node is proven, run at least one additional target node until all target nodes are proven.

Abstract: The present disclosure relates to a computer-implemented method for electronic design verification. Embodiments may include receiving an electronic design environment including both a design under test (“DUT”) and a testbench. Embodiments may further include simulating an electronic design associated with the electronic design environment and generating a coverage database associated with the electronic design. Embodiments may include performing coverage analysis of the DUT and testbench using an automated inheritance aware analysis and applying the coverage analysis results to the testbench after simulation.

Abstract: A computer-implemented method for manufacturing an integrated circuit (IC) chip includes defining digital block specifications for the IC; and automatically synthesizing and integrating digital blocks with support circuits in accordance with the digital block specifications.

Abstract: A computing device, computer-readable medium, and method are provided to dynamically configure an FPGA of a computing device at runtime without rebooting the computing device. At least one upgradable capability of the FPGA is displayed to a user. The user selects an upgradable capability of the FPGA and accepts a license to enable the selected upgradable capability. An update to a reconfigurable FPGA image associated with the FPGA is obtained in response to issuance of the license. The update to the reconfigurable FPGA image is installed on the FPGA to enable the selected upgradable capability of the FPGA. An operating system of the computing device is notified of the update to the reconfigurable FPGA image at runtime, and the operating system exposes the selected upgradable capability of the FPGA to at least one component of a software stack managed by the operating system.

Abstract: Disclosed herein are systems and methods to reduce wirelength and congestion in an integrated circuit (IC) design. The systems and methods disclosed herein may be implemented during a detailed placement stage of IC design to identify and select a cell for relocation and determine an area of interest to which the cell can be relocated. The systems and methods may identify one or more potential locations within the area of interest where the cell can be relocated to, and then determine a cost based upon the wirelength and/or congestion for the selected cell, at each of the one or more potential locations. Upon determining that a potential location may have a lower cost compared to the original location of the selected cell, the systems and methods may relocate the selected cell to the potential location.

Abstract: An end point report for a design of an electronic circuit may be analyzed. Results of a static timing analysis run are loaded, a path from the loaded results is selected, and technology specific context data is provided. Additionally, a determination is made for every test point of the selected path of design quality parameters for determining a design problem area, and a determination is made for every design problem area, of a root cause by analyzing design problem area data in comparison to related ones of the technology specific context data.