Abstract: A computer-implemented method for increasing the scalability of software-defined networks may include (1) maintaining a set of databases collectively configured to (i) store a set of flow entries that direct network traffic within a software-defined network and (ii) facilitate searching the set of flow entries based at least in part on at least one key whose size remains substantially constant irrespective of the number of flow entries within the set of flow entries, (2) detecting a request to perform an operation in connection with a flow of data packets within the software-defined network, (3) identifying at least one attribute of the flow of data packets in the request, and then (4) searching, using the attribute of the flow of data packets as a database key, at least one database within the set of databases to facilitate performing the operation. Various other methods, systems, and apparatuses are also disclosed.

Abstract: A variety of methods for improving efficiency in a database system are provided. In one embodiment, a method may comprise: generating multiple levels of data according to how recently the data have been updated, whereby most recently updated data are assigned to the newest level; storing each level of data in a specific storage tier; splitting data stored in a particular storage tier into two or more groups according to access statistics of each specific data; during compaction, storing data from different groups in separate data blocks of the particular storage tier; and when a particular data in a specific data block is requested, reading the specific data block into a low-latency storage tier.

Abstract: In an index-only multi-index access in a database, when a query to be executed requires multiple indexes, a query optimizer determines whether columns are needed for a query result, subquery, or inner join result. If not, then the query result is resolved using qualified record identifiers (RIDs) from the multiple indexes without accessing the data pages. When the columns are needed and can be resolved using input values of the query, then the query result is resolved using the qualified RIDs from the multiple indexes and substituting column values with the input values of the query. When the columns are needed and cannot be resolved using the input values of the query, the query optimizer may store one or more index keys with its corresponding qualified RIDs from the multiple indexes and may resolve the query result using the stored index keys without accessing the data pages of the database.

Abstract: In an index-only multi-index access in a database, when a query to be executed requires multiple indexes, a query optimizer determines whether columns are needed for a query result, subquery, or inner join result. If not, then the query result is resolved using qualified record identifiers (RIDs) from the multiple indexes without accessing the data pages. When the columns are needed and can be resolved using input values of the query, then the query result is resolved using the qualified RIDs from the multiple indexes and substituting column values with the input values of the query. When the columns are needed and cannot be resolved using the input values of the query, the query optimizer may store one or more index keys with its corresponding qualified RIDs from the multiple indexes and may resolve the query result using the stored index keys without accessing the data pages of the database.

Abstract: A KVS data processing unit, upon receiving a KVS type command of a database system in which index data and actual data are stored in a pair, manipulates data stored in a storage device based on said command. An SQL command execution unit, upon receiving an SQL command, serializes this command, generates KVS type data, and passes this data to the KVS data processing unit. A KVS command processing unit, upon receiving a KVS command, serializes this command, and transmits this data to the KVS data processing unit.

Abstract: By converting address information 200 input to a geocoding unit 10 into a tree structure formed hierarchically in an administrative district, generating address tree information obtained by associating latitude and longitude information with at least a node of the lowest layer in each branch of the tree structure and storing the address tree information thus generated in a high-speed accessible memory 14 to proceed a retrieval while tracing the address tree information in order from a parent node to a child node to narrow down a retrieval range, it is possible to efficiently search latitude and longitude information corresponding to given address information therefrom and to perform a retrieval at a higher speed as compared with the related art in which access is given to a conversion table stored in a disk.

Abstract: Systems and methods for generating alias records are described. The alias records, which include deidentified data, are generated from corresponding real records of actual users. As production data (e.g., messages) that identify the actual users flows through a network, the alias records are updated so as to correspond to the real records.

Abstract: Various technologies related to control flow integrity checking are described herein and can be used to greatly improve software security. During static analysis, a canonical control flow graph can be built. Execution of a program can be interrupted at runtime, and the call stack can be observed to verify control flow integrity of the program using the canonical control flow graph. Attacks using stack tampering can be avoided, regardless of how the stack tampering is achieved. Non-invasive techniques can be used, making the technologies applicable in situations where source code is not available. Real-time operating system protection can be supported.

Abstract: A method is used in deduplicating sets of data blocks. A candidate data object is identified for deduplicating a data object. A digest associated with the candidate data object matches a digest associated with the data object. Digest information of a set of data objects is evaluated. The set of data objects are selected for evaluation based on an association between location of the set of data objects and location of the candidate data object. Based on the evaluation, a deduplicating technique is applied for deduplicating the data object.

Abstract: A database comprises a database interface and a database updater. The database interface receives a first set of information and a second set of information to be updated in the database. The database updater updates a second set of information in the database based at least in part on a condition that a first set of information in the database has been previously updated.

Abstract: A method, apparatus and article of manufacture for refining search results is disclosed. In one embodiment, the method comprises the steps of accepting a search query comprising one or more keywords, generating a first search result comprising one or more first search result members according to the search query, accepting a refinement command identifying one or more undesired first search result members, automatically refining the first search result to exclude the undesired first search result members and first search result members related to the undesired first search result members from the first search result, and providing the automatically refined search result.

Abstract: A system includes: a processor; and a memory, wherein the memory stores instructions that, when executed by the processor, cause the processor to: retrieve a first log over a network from a first server of a plurality of servers for at least one contact center; generate an index of values in the first log; update an index database based on the index; and save the first log on a storage device.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for distributing content are disclosed. In one aspect, a method includes accessing data specifying a plurality of search queries. Content distribution campaigns (“campaigns”) in which distribution of at least one content item is conditioned on a distribution parameter matching one of the search queries are identified. Two or more similar campaigns are identified, and a search query that matches a distribution parameter in at least one of the similar campaigns is identified as a candidate content distribution parameter. A trend score for the candidate content distribution parameter is determined based on a change in a submission rate of search queries that match the candidate distribution parameter. Suggestion data suggesting the candidate content distribution parameter as an additional content distribution parameter for at least one of the similar campaigns is provided based on the trend score.

Abstract: A system, method, and computer program product are provided for automatically accessing data in a database based on query information. In use, query information is received from a user interface, the query information including at least one selection of a preconfigured set of queries that are grouped logically based on a team or an application and the query information further including input parameters defined by a user utilizing the user interface. Additionally, data to access in at least one database is identified based on the query information. Further, a connection with the at least one database is automatically established, the connection with the at least one database being established utilizing a predefined database connection for one or more environments with which the user interface is associated. Moreover, the data in the at least one database is automatically accessed based on the query information.

Abstract: According to an aspect, a database system for integrating calculation models into execution plans includes a first engine configured to parse a query to be applied on a database. The first engine is configured to invoke a second engine during query compilation. The second engine is configured to instantiate a calculation model based on the query, and the second engine is configured to derive a converted calculation model by converting the calculation model into a format compatible with the first engine. The first engine is configured to incorporate the converted calculation model into an execution plan during the query compilation and execute the query on the database according to execution plan.

Abstract: This disclosure proposes systems, methods, and apparatus that identify raw SQL queries that are likely to cause a double counting error, and if such a SQL query is identified, then convert the raw SQL query into SQL queries that account for and avoid double counting. In some embodiments, this process uses queries and subqueries that refer back to a common table expression (CTE) in order to reduce code length and increase query execution speed.

Abstract: A user saves a structured query defining connections between two or more objects maintained by a social networking system. The social networking system finds objects matching the structured query, either by periodically performing searches for new objects or by analyzing objects as they are added or modified. The user creating the saved query can subsequently view the matching objects.

Abstract: A method, apparatus, and program product for generating check data for a location within an area of a workspace include receiving an identifier for a selected location that has check data associated therewith. Candidate check data for use with the selected location is generated. The candidate check data is evaluated for a match against at least one of existing check data for the selected location or check data associated with a related location. Based on the evaluation, a determination is made of whether the candidate check data is acceptable for use for the selected location.

Abstract: In general, the subject matter described in this specification can be embodied in methods, systems, and program products. A score for each of a plurality of authors of posts submitted to a server system is determined. The score for each individual author in the plurality is based on a score of one or more authors in the plurality that have requested to subscribe to a stream of posts that the individual author submits to the server system. A particular post submitted by a particular author in the plurality is received at the server system and from a computing device. A score is assigned to the particular post based on a score of the particular author. The particular post is transmitted from the server system to computing devices that are associated with authors who have requested to subscribe to posts by the particular author.

Abstract: Performing a user initiated search query is disclosed and comprises receiving user input comprising description details of at least one desired object, retrieving a plurality of objects from a database sharing one or more of the description details of the user input, constructing a tree data structure based on the description details of the plurality of objects, the tree data structure comprising one or more attributes related to each of the plurality of objects retrieved, displaying visual images associated with the retrieved plurality of objects, the visual images matching at least one of the attributes related to the plurality of objects, and receiving a user selection of one or more of the visual images.

Abstract: The present disclosure relates to computer-implemented methods and computer systems for providing user-friendly and understandable presentations of Open Data (OData) Protocol resources through an automatic translation and modification process. The present disclosure provides a user interface tool for presenting and browsing OData fees that can provide a visualization of an OData feed structure to users in an otherwise unavailable format. In particular, developers can view and modify resources outside of the underlying format in which such OData feeds are traditionally presented. The user interface tool can provide an out-of-box user interface with which a developer can view and modify resources associated with a feed, browse related entity sets, set filters, and perform other operations. In essence, the user interface tool can decrease user's efforts and difficult in understanding particular OData feeds and the entities associated therewith.

Abstract: Entity resolution in a database comprises receiving imported data comprising imported data entities each having properties each having values; receiving first user input that selects the imported data entities for resolution to existing data entities in a database; receiving second user input that specifies matching criteria for matching the imported data entities to the existing data entities, wherein each of the matching criteria comprises a matching technique; matching the imported data entities to the existing data entities using the matching criteria, resulting in creating and storing matched entity information, wherein the matched entity information is organized in matched entity data sets associated with subsets of the matching criteria that were matched; consolidating the imported data entities into the existing data entities; storing the first user input and second user input as a named criteria set for use in subsequent entity resolution operations.

Abstract: In some aspects, a method includes connecting over a network to a data storage system, the data storage system storing data objects. A dataflow graph that includes nodes representing data processing components connected by links that represent flows of data access an interface of the data storage system. The interface provides functions for accessing the data objects. At least one of the data processing components performs operations on a received input flow of data that enable the functions provided by the interface to modify one or more stored data objects, and performs operations in response to functions provided by the interface to generate an output flow of data.

Abstract: Embodiments relate to generating database sequences in a replicated database environment. An aspect includes providing a group of nodes each hosting an instance of a replicated database, with one node in the group elected as a master node responsible for generating and distributing values for auto-generated values in a column or row of the replicated database. Another aspect includes dividing, by the master node, a sequence space of possible auto-generated values for the column or row into sub-ranges and assigning a sub-range to a particular node in the group of nodes. Another aspect includes distributing, by the master node, values of the assigned sub-range to a particular node of the group of nodes.

Abstract: A storage object is migrated between nodes by a source node automatically verifying that another node is configured to service the storage object and changing ownership of the storage object based on the verifying. A cluster manager for the clustered storage system receives a request and provides the request to the source which owns the storage object. The source verifies that the destination is configured according to a predetermined configuration for servicing the storage object. Based on the verifying, the source offlines the storage object and updates ownership information of the storage object, thereafter allowing the destination to online the storage object. The cluster manager further provides the updated ownership information to all the nodes in the cluster, so an access request intended for the storage object may be received by any node and forwarded to the destination using the updated ownership information to effect a transparent migration.

Abstract: An approach is provided for providing a unified extensible platform for overall probe data and storage. The approach comprises causing, at least in part, a storage of probe data in one or more information spaces, one or more namespaces of the one or more information spaces, or a combination thereof. The approach further comprises determining one or more nodes for processing the probe data based, at least in part, on one or more context criteria, the one or more nodes associated with the one or more information spaces. The approach also comprises determining to provide access to the processed probe data via the one or more information spaces, the one or more namespaces, or a combination thereof.

Abstract: Disclosed is a method of predicting user's position. This method comprises, creating information on a plurality of location clusters by processing a plurality of position data for a user with a probability based clustering algorithm; receiving a current position data of the user and determining a first location cluster to which the current data is mapped among the plurality of location clusters; and creating second information related to a probability that the user moves from the first location cluster to a second location cluster among the plurality of location clusters. The position data is a data tuple including latitude, longitude, and time. For all the plurality of location clusters, the information includes a determined representative position value of each of the location clusters.

Abstract: A system and method is disclosed for presenting relevant advertising to web pages, including web logs. The ads can be selected by reference to an underlying content presented in web logs, based on extracting topics from the pages, and using these topics as the basis for a search query. Ads can then be matched against another set of topics derived from web pages forming the search results to the query.

Abstract: Systems, methods, and computer program products to perform an operation comprising providing a plurality of filters in a deep question answering (deep QA) system, wherein each of the filters is configured to remove candidate answers not meeting a set of criteria of each respective filter from further consideration by the deep QA system, determining that a first ordering, of a plurality of orderings of the plurality of filters, is an optimal ordering of the plurality of filters based on a respective filtering metric of each ordering, and configuring the deep QA system to apply the plurality of filters to candidate answers according to the first ordering.

Abstract: A method of improving the speed with which a sample data record can be matched against records in a database comprises defining a list of possible key values (430), testing those key values against the sample and, for each record in the database, counting the number of key values that match both the record and the sample at reference positions selected by a mask. A list of possible matches is then selected on the basis of that count, for more detailed matching or analysis. Such a method provides very fast matching at the expense of some additional effort when registering a new record within the database.

Abstract: A computer system including a memory, at least one processor coupled to the memory, and a search component executable by the at least one processor is provided. The search component is configured to receive information descriptive of at least one search term; execute a first query against a plurality of documents that identifies at least one first document of the plurality of documents responsive to the at least one search term; identify one or more secondary terms associated with the at least one first document based on occurrence of the one or more secondary terms within the at least one first document; and provide a search result including at least one of the one or more secondary terms and one or more identifiers of one or more documents including the one or more secondary terms. The search result may also include one or more identifiers of bookmarked documents.

Abstract: The disclosed embodiments provide a system that provides wireless service groups. During operation, a wireless device's advertising mechanism advertises a service group over Wi-Fi, wherein the service group comprises at least the wireless device and wherein the service group's security requirements regulate multicast protection within the service group. In response to receiving a request from a second device to be admitted into the service group, the wireless device's security mechanism admits the second device into the service group and sends the service group's security requirements to the second device, thereby enabling the second device to initialize multicast protection in accordance with the service group's security requirements.

Abstract: Disclosed are an apparatus and method for providing a community service. The apparatus includes a content analysis unit configured to generate a plurality of content figures representing a plurality of pieces of content, and generate connection relationships of the plurality of content figures according to connection relationships among the plurality of pieces of content, a content management unit configured to set a size value of an upper content figure based on lower content figures, from among the plurality of content figures, connected to lower hierarchies of the upper content figure, and a content transmitter configured to transmit connection relationships of the plurality of content figures and size data that includes the size value to a user terminal connecting to an on-line community. Accordingly, an overall trend may be noticed at a glance, and it may be possible to prevent content spamming because meaningless content would fall behind.

Abstract: A method includes aggregating a set of analyzed webpage portions from at least two unaffiliated websites. The method also includes transmitting an aggregated result, the aggregated result associated with an aggregated set of analyzed webpage portions. Another embodiment includes the set of analyzed webpage portions being associated with a topic. Yet another embodiment includes receiving an indication of an occurrence of a browser event and analyzing, in response to receiving the indication, a webpage portion then storing an analyzed webpage portion and the browser event in a database. Yet another embodiment includes analyzing the webpage portion by downloading a webpage portion from at least one website, extracting a text portion from the webpage portion and associating, in response to extracting the text portion, at least one topic from the text portion.

Abstract: A computer implemented method and system that generates a video playlist having recommended videos based on a user query object is disclosed. A user query object is used to search for a number of web pages. Summaries are generated for the returned web page search results. Valuable terms and phrases from those summaries may be extracted and used to search video storage sites based on the original user query. Playable videos returned from the video storage sites may be compared to the user query or to the extracted terms and phrases in order to rank the videos, and the most relevant videos may be returned. Those videos may be displayed to the user as a playlist in an Internet browser having an embedded video player.

Abstract: Methods, systems, and apparatus for determining, for a native application that generates an application environment for display on a user device within the native application, the native application operating independent of a browser application that can operate on the user device, a set of environment instances of the native application, each environment instance of the native application being different from each other environment instance of the native application; for each environment instance: determining textual data describing features of the corresponding environment instance, the textual data being data that is not rendered to be visible when the native application renders the environment instance on a user device display, generating, from the textual data, native application environment instance data describing content of the environment instance, and indexing the native application environment instance data for the native application in an index that is searchable by a search engine.

Abstract: A system determines a set of users satisfying a given criteria based on attribute values of the users. The system associates each value of an attribute with a representation of users having that attribute value. The representation of users may be an enumeration of users or a bit index. The system receives a request for determining a set of users satisfying a given criterion. The system identifies a logical operation based on the criterion and performs the logical operation to determine the set of users. The representation of the set of users may be distributed across a plurality of processors, allowing the system to perform the logical operation in parallel. The system may further determine statistical information describing a characteristic of the set of users, for example, page likes by the set of users. The statistical information may be presented to a business for analyzing their target audience.

Abstract: This disclosure relates to systems and methods for adaptively compressing data based on compression parameters. In one embodiment, a method for compressing a dataset is disclosed, including filtering a dataset based on occurrence of an event, and determining a quality of information index indicating a measure of quality of the dataset based on a quality of information estimation function. The method may include comparing the quality of information index with a list of indices stored in a lookup table to identify a target quality of information index and corresponding compression parameters, wherein the target quality of information index is indicative of a reference measure of quality of the dataset applicable for deriving statistical inferences based on analysis of the dataset. Also, the method may include inputting the compression parameters in a compression algorithm for compressing the dataset to achieve the target quality of information index for the analysis.

Abstract: Searching information includes: receiving current query data from a client; extracting generic attribute features of the current query data, wherein the generic attribute features are used for calculating a plurality of confidence degrees of the current query data that correspond to a plurality of categories, each of the confidence degrees indicating a degree of confidence that the current query data belongs to a respective one of the plurality of categories; determining the plurality of confidence degrees of the current query data based at least in part on the generic attribute features; selecting a category based at least in part on the plurality of confidence degrees, the selected category being one of the plurality of categories and having a confidence degree higher than a confidence degree of another category; searching in the selected category for a search result that corresponds to the current query data; and returning the search result.

Abstract: An approach for providing a framework to maintain continuous access to web content bookmarked in a browser, the framework comprising web content storage, change detection and change notification. Embodiments of the present invention create and store a snapshot of bookmarked web content with a version number in a repository and the snapshot is replaced by a new snapshot whenever bookmarked web content is updated, while access to previously versioned snapshots is maintained. Change detection comprises automatically subscribing to content update notification services provided by a web content provider and receiving updates, comparing the content of a most recent snapshot with the web content available from the content provider and detecting a change to the bookmarked URL. Keywords from a snapshot can be used to relocate web content at a new URL and a web browser user is notified whenever a change to bookmarked web content is detected.

Abstract: A software application having a graphical user interface (GUI) that displays content tiles along with the use of an electronic device to add tiles to the GUI is described in this disclosure. A predefined key on an input device is selected to indicate to display available tiles. One of the displayed available tiles is selected and the user designates a location on the display of the content tiles where to place the selected displayed available tiles. The selected tile is then inserted into the display with the plurality of tiles at the designated location and a tile previously at the designation location on the display is deleted and placed in a delete directory.

Abstract: In one embodiment, a device receives a request for a webpage from a client device via a network. The device identifies a societal issue associated with content of the webpage. The device determines a set of one or more online support actions associated with the identified societal issue. The device embeds an interface for a particular one of the set of online support actions into the webpage. The device provides the requested webpage with the embedded interface to the client device via the network.

Abstract: Systems and methods for modeling an electrical power system are disclosed. A computer and an analytics server are in network connection. The computer comprises a processor coupled with a memory. The memory is configured to maintain at least one engine element and a component database. The analytics server comprises a virtual system modeling engine and an analytics engine. The component database is operable to store power system components. The at least one engine element is operable to generate a virtual system model of the electrical power system and generate predicted output based on the virtual system model. The analytics engine is operable to monitor the predicted output and real-time output from at least one sensor of the electrical power system, and calibrate the virtual system model based on a difference between the predicted output and the real-time output.

Abstract: In a simulation system and method thereof, the simulation includes, when a function value for a nominal point (NP) of an input is a first value, running a first simulation on the input; and when the function value for the NP of the input is a second value different from the first value, running a second simulation on the input. Here, the running of the second simulation may include (a) setting a boundary of an input distribution for the second value as a first distribution value, (b) generating input samples within the set boundary of the input distribution, (c) obtaining a worst case point (WCP) for the input by performing machine learning on the generated input samples, and (d) repeatedly performing the steps (a) to (c) while shifting the boundary of the input distribution until the boundary of the input distribution reaches a minimum critical value.

Abstract: A semiconductor device can be manufactured based on patterning groups to include a metal layer patterned according to separate patterning groups. The patterning groups are based on a layout pattern. Preparing the layout pattern includes selecting a first power pattern and a second power pattern, selecting a first pattern and a second pattern therebetween, and selecting a tie-connection pattern to connect the first power pattern to the first pattern. The manufacturing includes forming metal lines according to the patterning groups. Photomasks are manufactured according to the layout pattern, and the metal lines are formed according to the photomasks. A first photomask is manufactured based on the first power pattern and the second power pattern, the first pattern, and the tie-connection pattern, and a second photomask is manufactured based on the second pattern.

Abstract: According to an embodiment, a method for cell placement in a semiconductor layout is provided. The method includes: providing a first cell having two sides, each side configured as at least one of a source side and a drain side; providing a place-and-route boundary (prBoundary) of the first cell based on the configuration of the two sides of the first cell; providing a second cell having two sides, each side configured as at least one of a source side and a drain side; providing a prBoundary of the second cell based on the configuration of the two sides of the second cell; and placing the first cell and the second cell based on the prBoundary of the first cell and the prBoundary of the second cell.

Abstract: A layout method for a printed circuit board (PCB) is provided. The method obtains a memory type of a dynamic random access memory (DRAM) to be mounted on the PCB, obtains a module group from a database according to the memory type of the DRAM, wherein the module group comprises a plurality of routing modules, obtains a plurality of PCB parameters, selects a specific routing module from the module group according to the PCB parameters, and implements the specific routing module into a layout design for PCB fabrication. The specific routing module comprises layout information regarding a main chip, a memory chip and a routing configuration between the main chip and the memory chip.

Abstract: A layout of a cell grid comprises a plurality of polycrystalline silicon (POLY) lines in the cell gird, wherein the POLY lines are arranged horizontally and evenly spaced with a pitch X, and a plurality of fin-shaped oxide diffused (OD) regions in the cell gird, wherein the fin-shaped OD regions are arranged vertically and evenly spaced with a pitch Y, wherein the pitch Y of the fin-shaped OD regions defines width of the cell grid. The layout of the cell grid further comprises a plurality of PMOS transistors and NMOS transistors in the cell grid, wherein the PMOS transistors and NMOS transistors have their source nodes and drain nodes formed in the fin-shaped OD regions and their gates connected to the POLY lines, wherein the plurality of PMOS transistors and NMOS transistors are connected together to form one or more CMOS devices in the cell grid.

Abstract: A method of designing an integrated circuit is described. The integrated circuit comprises a plurality of circuit components, including one or more functional components and one or more tile shapes. A pcell instance may be defined to specify a functional component along with one or more tile shapes. The tile shapes are thus associated with the functional component. A netlist may be arranged to specify interconnections between the functional components of the integrated circuit as well as electrical interactions between the tile shapes and functional components. A computer program product for carrying out the method is also described.

Abstract: A method of global connection routing includes determining a global connection tolerance of a cell for use in a circuit layout, wherein the cell comprises a plurality of pins, and a plurality of routing tracks are defined with respect to the cell. The method further includes determining a number of blocked tracks within the cell. The method further includes comparing the global connection tolerance with the number of blocked tracks. The method further includes adjusting a location of the cell within the circuit layout if the global connection tolerance and the number of blocked tracks fail to satisfy a predetermined condition.