Abstract: The disclosed embodiments provide a system for processing data. During operation, the system launches a set of child processes for processing queries of a graph database storing a graph, wherein the graph comprises a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates. When a query of the graph database is received, the system transmits the query to one or more of the child processes. Next, the system receives a result of the query from the one or more child processes. The system then provides the result in a response to the query.

Abstract: A technique includes in a relational database query engine, receiving a query associated with a relational data structure. The received query includes a database graph query. The technique includes using the relational database query engine to integrate a result acquired from the graph database engine into a result provided by the relational database query engine to the received query.

Abstract: Selecting at least an implementation for executing a query. In response to a query run request in respect of a given query, accessing query execution data comprising implementations and their respective performance records for executing the given query in a given context. The query execution data is assessed, and at least an implementation is selected on a basis of its respective performance record to execute the given query in at least a current context.

Abstract: A method and system for automatically determining a processing path is provided. The method includes generating an input criteria associated with performing a hardware apparatus implemented process. Metadata describing the input criteria is generated and stored. Weighting factors associated with the metadata are generated and a specialized hardware apparatus executing the hardware apparatus implemented process is enabled. Measurement characteristics associated with conditions resulting from the specialized hardware apparatus executing the hardware apparatus implemented process are retrieved from a plurality of hardware sensors. A resource database catalog for hardware based data processing resources is queried and an optimization process for determining an optimized processing path for processing the metadata with respect to the resource database hardware based data and the measurement characteristics is executed.

Abstract: A system includes a relational database management system component and a column-oriented data processing component. The relational database system component stores database information in a row format. The column-oriented data processing component stores the database information in a column format. In response to a database update request, the relational database management system component updates the database information stored in the row format; the relational database management system component notifies the column-oriented data processing component of the database update request; and the column-oriented data processing component updates the database information stored in said column format. In response to a query request, the column-oriented data processing component generates a query response based on the database information stored in said column format. In this manner, the system is able to generate up-to-date reports without the need for extraction, translation and loading procedures.

Abstract: A high-precision data search function is provided by calculating feature values of time series data in a unit that is different from the unit of compression, while conserving data storage capacity. A data management apparatus 100 comprises a data reception unit 111 which acquires data in a first unit from time series data that was input, a data compression unit 114 which compresses the data acquired in the first unit, and a feature value calculation unit 113 which calculates a feature value indicating a feature of data acquired in a second unit that differs from the first unit.

Abstract: An approach for synopsis guided scan processing of MIN/MAX data queries where a minimal or maximal data query operation and a synopsis store are received. The synopsis store includes at least one of tuple range identifiers, column minimal and maximal metadata values. The synopsis store is sorted, where the column minimal or maximal metadata values search order is created for the tuple range identifiers. Dataset data associated with the tuple range identifiers is searched in the search order for a minimal or maximal value result until the minimal value result is less than or equal to a next column minimal metadata values or the maximal value result is greater than or equal to a next column maximal metadata values respectively and the minimal or maximal value result associated with the respective minimal or maximal data query operation is output.

Abstract: A computer-implemented method is provided for generating an event log from raw data stored in a source system, wherein a processor is provided with a process sensor and the process sensor derives process data from the raw data, wherein the process data comprises at least one process element which comprises at least one process step. The process sensor further generates unique identifies of process elements, identifiers of process steps which are assigned to the process elements, and an order of the process steps, and stores the generated data as an event log according to a predetermined data structure.

Abstract: Approaches are provided for an apparatus that includes a memory configured to store a plurality of time-series data records. Each time-series data record has a data value having an associated time and corresponding to one or more characteristics of an industrial machine or system. A query corresponding to the one or more characteristics of the industrial machine or system is received at an input. The query includes a query time range and one or two extended interval ranges abutting the query time range. A processor obtains from the memory a first value of a first record having an associated time within the query time range. The processor obtains from the memory device a second value of a second record having an associated time within the extended interval range. The processor calculates a third value having an associated time within the query time range.

Abstract: Techniques are described herein for executing queries on distinct portions of a database object that has been separate into chunks and distributed across the volatile memories of a plurality of nodes in a clustered database system. The techniques involve redistributing the in-memory database object portions on changes to the clustered database system. Each node may maintain a mapping indicating which nodes in the clustered database system store which chunks, and timestamps indicating when each mapping entry was created or updated. A query coordinator may use the timestamps to select a database server instance with local in memory access to data required by a portion of a query to process that portion of the query.

Abstract: A file system for supporting a time-series analysis on data of a previous point in time and an operating method thereof. The file system includes a storage server configured to store input data, and provide data suitable for a data request among the stored data, and an analysis server configured to receive the data from the storage server according to an analysis request, and perform an analysis on the received data, and the storage server assigns a time-series attribute to data together with the data, and stores the time-series attribute together with the data.

Abstract: Techniques are described for selecting, based on a data visualization intent specification and a defined set of data fields associated with a set of data, two or more Meta templates that meet the data visualization intent specification and that support the set of data fields, for determining chart parts that can be used within the selected Meta templates to form chart templates and for determining, based on a set of combination rules and the specification, the chart templates that meet the data visualization intent specification.

Abstract: Databases are organized collections of data to model aspects of reality and support processes including those requiring, generating, and finding information or modelling real or virtual world systems. These are typically accessed via an application which may have been coded to only return specific columns or limits functionality requiring the user to either know names of desired fields or search the entire table. Such applications allow users who are not knowledgeable with Structured Query Language (SQL) for managing data held in a relational database management systems (RDBMSs) to access the database. However, the application may be coded to return only specific columns or limit accessible functionality. These issues are further exacerbated through user interfaces mobile/portable devices which typically present a smaller portion of the grid.

Abstract: Systems and methods for exploiting link information in streaming feature selection, resulting in a novel unsupervised streaming feature selection framework are disclosed.

Abstract: Embodiments described herein provide enhanced computer- and network-based methods, techniques, and systems for automatically accessing large bodies of potentially disparate data in a compelling environment without the limitations of access provided by spreadsheet systems and in a uniform manner for all types of data. Example embodiments provide an Automated Data Visualization System (“ADVS”), which enables users to access data typically provided by backend systems of organizations in an environment that automatically presents the data using user interface patterns that align with the data. In an example embodiment, the ADVS comprises one or more functional components/modules including an attribute determination logic/engine, a visualization logic/engine, a resizing logic/engine, and a scaling logic/engine in addition to a user interface. Also, in one example embodiment the visualization utilizes a user interface card metaphor to present information.

Abstract: The disclosed embodiments provide a system for providing a graph database storing a graph. During operation, the system executes one or more processes for providing the graph database. Next, the system stores a sequence of changes to the graph in a base version of the graph database. The system then branches a version of the graph database from a virtual time in the base version. Finally, the system uses the branched version to process one or more queries of the graph database.

Abstract: Log synchronization among discrete devices in a computer system includes, periodically at a predefined interval: sending, by a host to each of a plurality of discrete devices in the computer system, a synchronization tag, wherein each of the discrete devices, responsive to receiving the synchronization tag from the host, is configured to record the synchronization tag in a log entry; and recording, by the host, the synchronization tag in a log entry.

Abstract: The upgrading of a relational database on multiple of machines (e.g., a service) that perform data operations via a set of one or more stored procedures. The upgrade occurs without changing the functionality of the set of one or more stored procedures. Accordingly, even if the machine itself is not upgraded, the machines can still interface with the database via the set of one or more stored procedures. The upgrade of the relational database occurs by adding occur by adding new table(s) to the relational database, and thereafter adding new stored procedures to the stored procedure store, the new stored procedures referencing parameters of the new tables. Since the machines that interface with the relational database can still operate on the upgraded database using the old stored procedures, each machine may then be upgraded in an orderly manner to interface with the new stored procedures.

Abstract: A method of collecting and organizing online resources may include selecting an item from an electronic document. The method may include extracting data related to the item from the electronic document. The method may include identifying whether a first list that includes the item is associated with the electronic document. The method may include refining the first list in response to an identification of the first list. The method may include generating a second list that includes the item in response to a failure to identify the first list. The method may include verifying that the first list is consistent with a user interest. The method may include saving the first list to an electronic data storage device when the first list is consistent with the user interest. The method may include selecting a second item when the first list is inconsistent with the user interest.

Abstract: Techniques and systems for auditing and augmenting user-generated tags for digital content are described. A corpus is generated for each tag associated with digital content to represent different aspects of the tag's definition. A hierarchy of semantic relationships between the tags is created based a corpus co-occurrence between the tags to relate at least two tags having different levels of specificity. Some of the tags are verified with the digital content based on feature detection, and a correspondence to the digital content is determined for each verified tag. The correspondence of the verified tags is then propagated up the hierarchy to others of the tags that are semantically related to the verified tags but which were not verified by the feature detection. The verified tags and the verified other tags are then assigned to the digital content to control how the digital content is retrieved when subject to a search.

Abstract: A method, a computer system, and a computer program product are provided for calculating a degree of similarity of users. Each user may be a preparer and an answerer of one or more quizzes. The method includes collecting one or more quizzes from one or more users as preparers and providing the collected quizzes to one or more user as answerers. The method further includes collecting one or more answering activities of one or more answerers to the provided quizzes from the one or more answerers, wherein a pair includes a preparer and an answerer. The method additionally includes calculating, for each pair, a degree of similarity of knowledge background, based on the one or more answering activities of the one or more answerers.

Abstract: A computer-implemented method determines a document flow of documents stored in a documents database. Data on the documents including relational data may be stored in the documents database. The method includes creating a database view of the document flow of the documents stored in the documents database. Creating the database view of the document flow includes calculating a document-document relationship on the fly by retrieving references from the original documents stored in the documents database. A SQL select statement is used to calculate the document-document relationship.

Abstract: An event clustering system includes an extraction engine in communication with a managed infrastructure. A sigalizer engine that includes one or more of an NMF engine, a k-means clustering engine and a topology proximity engine. The sigalizer engine determines one or more common characteristics or features from events that includes one or more event parameters. The sigalizer engine uses the common features of events to produce clusters of events relating to the failure or errors in the managed infrastructure. Membership in a cluster indicates a common factor of the events that is a failure or an actionable problem in the physical hardware managed infrastructure directed to supporting the flow and processing of information. Each of an event parameter is converted into a numerical representation.

Abstract: A computer implemented method for classifying at least one source dataset of a computer system. The method may include providing a plurality of associated reference tables organized and associated in accordance with a reference storage model in the computer system. The method may also include calculating, by a data classifier application of the computer system, a first similarity score between the source dataset and a first reference table of the reference tables based on common attributes in the source dataset and a join of the first reference table with at least one further reference table of the reference tables having a relationship with the first reference table. The method may further include classifying, by the data classifier application, the source dataset by determining using at least the calculated first similarity score whether the source dataset is organized as the first reference table in accordance to the reference storage model.

Abstract: Sentence polarity determination is used to assess whether a sentence is an affirmative expression or a negative expression, and is applied for reputation analysis, etc. Polarity determination determines whether an input sentence is affirmative or negative. When some subject is being talked about, it is sometimes desired to determine whether what is being referred to in the sentence is affirmative or negative, rather than the polarity of the sentence per se. The present invention provides a method for determining the polarity of the sentence by applying a recursive polarity rule based on a dependency structure of the sentence, taking into consideration the portion of the sentence that is being referred to. Use of a recursive rule makes it possible to prevent the number of rules from becoming huge, and thereby to perform efficient polarity determination in terms of memory amount and calculation amount. The length of the dependency needed for polarity determination can also be efficiently controlled.

Abstract: A system and method of storing data in an unstructured or semi-structured database, such as a JSON database, includes defining a columnar store, or hybrid column portion having a set of values for each field, such that each set stores a sequence of values from commonly named fields of each document together, and defining a hybrid store, or hybrid row portion having, for each document in the columnar store, a hybrid entry storing fields from the same document together, such that each entry in the hybrid store includes fields of a corresponding document represented in the columnar store. The hybrid arrangement provides that both the columnar store and the hybrid store are derived from the same set of documents, and each of the columnar store and the hybrid store are configured to fulfill a query request for determining whether to access the columnar store or the hybrid store.

Abstract: Methods and system for text conversion are described. In one embodiment, free-form text associated with an item may be received. The item may be identified based on the free-form text. The item may be compatible with a parent item. The parent item may be identified based on the free-form text. An item descriptor may be identified in the free-form text. The item descriptor may be a particular term of the free-form text. Compatibility-based text may be constructed for the item based on identification of the parent item and the item descriptor. The compatibility-based text may be capable of being used to identify a plurality of matching items. Additional methods and systems are disclosed.

Abstract: Methods, systems, and computer programs are presented for identifying data representations across multiple network assets and generating content responsive to the representations. A method includes receiving a set of queries comprising a first set of keywords and identifying a set of results within a first database where the set of results includes a set of publications with an identification and a title. The method generates an association between the first set of keywords and the identifications and titles of the set of publications. The method generates a first association among keywords of the first set of keywords based on user activity received in response to identifying the set of results. The method identifies a second set of keywords based on the first set of keywords and associates the second set of keywords with the first set of keywords within the first database.

Abstract: Digital image data including discrete photographic images of a variety of different subjects, times, and so forth, are collected and analyzed to identify specific features in the photographs. In an embodiment of the invention, distinctive markers are distributed to aid in the identification of particular subject matter. Facial recognition may also be employed. The digital image data is maintained in a database and quarried in response to search requests. The search requests include criteria specifying any feature category or other identifying information, such as date, time, and location that each photograph was taken, associated with each photograph. Candidate images are provided for review by requesters, who may select desired images for purchase or downloading.

Abstract: An abstraction engine receives requests identifying a source application and a logical identifier and maps the request attributes to a stored procedure. The stored procedure invokes a native database call with respect to a database and returns the response to the abstraction later, which reformats the response to an object having <key, value> pairs that is independent of the database protocol or organization. Stored procedures may be mapped to various combinations of attributes of requests, which may include attributes such as a user identifier and application version. The stored procedure may return data from a particular database location or perform more complex functions such as filtering functions with using predefined filer criteria and locations or a filtering criteria and/or location derived from the request.

Abstract: A method and system are provided by which a wireless mobile device takes a vocally entered query and transmits it in a text message format over a wireless network to a search engine; receives search results based on the query from the search engine over the wireless network; and displays the search results.

Abstract: The present disclosure provides a method, a client device and a server of accessing network information through a graphic code. The method comprises: receiving an access request from a client, where the access request includes information of a graphic code; querying and obtaining, in a server, display information and action instruction that is configured in correspondence with the information of the graphic code in the access request; and performing a corresponding action in the display information according to the action instruction information to obtain an access result of the graphic code. The disclosed method simplifies operations of a user without waiting for the user's step-by-step operation requests, and further simplifies a handling process of the server. In addition, this method of directly returning an access result of a graphic code to a client fulfills an intention of a publisher of the graphic code.

Abstract: An apparatus and method of managing history information in an electronic device are provided. The method includes: displaying a web browser on a display, based on a first input applied to an input device; receiving data of a web page via a communication circuit; displaying the web page on the display, via the web browser; receiving a second input for creating at least one action related to the web page, via the input device; storing, in a memory, information related to at least one action, as part of a web page browsing history related to the web browser; and providing the display with at least one notification related to at least one action, using the web browser.

Abstract: A method of retrieval of items of particular relevance from a particular domain. A processor receives from a remote computing device a resource-identifying string that has a combination of a predefined notation and a resource-related sub-string. The processor uses the resource-identifying string to retrieve a subset of data items from within a data set, the subset of data items relating to a subset of resources within a set of resources available to be served by the particular domain over a distributed network. The processor uses the subset of data items to generate a list of the subset of resources and serves the list to the remote computing device.

Abstract: Systems and methods for rendering dynamic content when converting a website to its static representation. A set of commands may be created with a syntax using the data attribute in HTML 5. Web designers may inject these attributes into the code of the webpages without affecting how the webpages will render in any browser that supports HTML 5. A specific and documented set of data attributes may indicate that the given element is a type of dynamic content. These data attributes will also indicate how to handle the dynamic elements such that a static representation of each visual state rendered in the browser may be generated accordingly.

Abstract: A method includes associating a state identifier with a page of a user interface; associating an element identifier with an element of the page of the user interface; and tracking a state of the element based on the state identifier and the element identifier throughout a user session of the user interface.

Abstract: An input graph is decomposed into a graph topology component and a graph properties component. A matrix representation is generated for each of the graph topology component and the graph properties component. Each of the graph topology matrix representation and graph properties matrix representation are partitioned into one or more sub-matrices. A forward pass comprising one or more vectorized operations is performed over the one or more sub-matrices. An output matrix is generated in response to the performing step.

Abstract: A compass tool for use with a digital modeling (e.g., a computer-aided design (CAD)) program to model and visualize rotation of a conduit bend or other connector. The compass tool generates a graphical representation of a compass or compass element. The compass element has a planar, circular-shaped body that is arranged orthogonal to the end of conduit to be sandwiched between the conduit end and the first end of the connector. The compass element's body is formed with one to four or more bands that are each defined by concentric rings having increasing diameters and centers coinciding with the center of the compass body. Compass measurement marks are provided with differing divisions in each band, e.g., 90 degree increments marked in the first (innermost band), 45 degree increments marked in the second band, 15 degree increments marked in the third band, and 5 degree increments marked in the fourth band.

Abstract: A method enables arithmetic circuit verification with improved runtime complexity by coupling reverse engineering and a SAT solver together. The method provides a netlist f of a first arithmetic circuit and a netlist g of a second arithmetic circuit; and improves the runtime complexity by conducting equivalence checking between the netlist f and the netlist g such that structural difference between the netlist f and the netlist g is minimized by reverse engineering before generating a conjunctive normal form (CNF) encoding that is solved by a satisfiability (SAT) solver such that the arithmetic circuit verification is completed in polynomial time rather than in exponential time.

Abstract: Generating a layout of an integrated circuit chip area from a description of an integrated circuit (IC). The description includes a register-transfer-level (RTL) design. The RTL design is partitioned in large blocks for synthesis of large block synthesis (LBS) blocks. The description of the IC further includes a floorplan for the IC, wherein each LBS block to be synthesized is assigned to a respective rectilinear shape in the floorplan and the rectilinear shapes do not overlap each other.

Abstract: Generating a layout of an integrated circuit chip area from a description of an integrated circuit (IC). The description includes a register-transfer-level (RTL) design. The RTL design is partitioned in large blocks for synthesis of large block synthesis (LBS) blocks. The description of the IC further includes a floorplan for the IC, wherein each LBS block to be synthesized is assigned to a respective rectilinear shape in the floorplan and the rectilinear shapes do not overlap each other.

Abstract: Example computer-implemented methods, computer-readable media, and computer systems are described for performing gravity modeling. In some aspects, survey data that includes gravity data of a rifted continental margin is accessed. A value of a geometric parameter is determined, which corresponds to a desired value of a Mohorovicic Discontinuity (Moho) uplift at a specified location of the rifted continental margin. A Moho surface is determined based on a value of Moho uplift at a rift center that is determined based on the value of the geometric parameter. A top basement surface is determined based on a residual gravity data associated with the Moho surface. A crustal model of the rifted continental margin is output. The crustal model includes the Moho surface and the top basement surface of the rifted continental margin.

Abstract: Low power VLSI designs using circuit failure in sequential cells as low voltage check for limit of operation of the design are provided. One such method involves the addition of a plurality of bits for sequential elements in the design including set of flip-flops, RAMs, ROMs and register files to add parity or single error correct and double error detect mechanism, a method to detect the parity errors or a single or double bit error in the sequential elements, starting at a nominal voltage of operation and gradually lowering the voltage setting till the first error is detected in the sequential elements, increasing the operating voltage by predetermined step above the voltage of first fail to achieve the optimal lowest voltage of correct operation of the design, storing this optimal voltage setting in a non-volatile memory for subsequent use.

Abstract: The present invention relates to a method for optimizing a fluid deposit traversed by a fracture network. For this method, the deposit is discretized in a meshed representation, a “dual medium” approach is used, and the exchange flows are determined between the meshes, together with corrective factors. The corrective factors are dependent on the initial pressure and the minimum production pressure of the deposit. The fluid flows in the deposit are simulated by means of these flows and these corrective factors.

Abstract: A method of performing a computer implemented analysis of a vehicle in a simulated wading event, the method comprising: defining a trough domain representing a region comprising a water level to be waded by the vehicle; defining a vehicle domain comprising a simulation of the vehicle; the method further comprising: generating a first mesh comprising a plurality of finite mesh elements representing the trough domain; generating a second mesh comprising a plurality of finite mesh elements representing the vehicle domain; defining an overset between the first and second meshes; simulating the wading event by moving the second mesh representing the vehicle domain through the first mesh representing the trough domain, resolving the forces on at least a subset of the finite mesh elements to obtain transient pressures on at least a part of said vehicle domain, and outputting data indicative of said transient pressures

Abstract: Various implementations described herein are directed to systems and methods for controlling physical placement of a circuit design. The systems and methods may extract state groups of the circuit design by deriving state groups from each logical hierarchy of the circuit design. At each level, available state points may be grouped by similarity and stored in a state groups collection alongside grouping terms. The systems and methods may generate a state bounds file that bounds locations of the state points in the circuit design. The state bounds file may be based on the extracted state groups and the grouping terms stored in the state groups collection. The systems and methods may control physical placement of the circuit design using the state bounds file.

Abstract: A method for assigning nets to wiring planes for generating a chip design includes executing, by a computer, a zero wire load timing session for a placed but unbufferred chip design. All nets of the chip design are set to a single wide wiring track without wiring plane assignments. A delta time delay is added to each sink of each of the nets to represent an estimated time of flight (TOF) delay. The nets wiring plane or width type for a particular pin is upgraded to a type having improved TOF characteristics. Each of the nets are compared against new predetermined slack and distance targets and new assigned wiring plane or width type determined to consume additional wiring track resources, and based on results, the upgrade is repeated or a design for session timing state for the nets is output to represent the unbufferred chip design.

Abstract: Disclosed are integrated circuit (IC) design methods, systems and computer program products that provide for area and/or power optimization through post-layout modification of design blocks. Specifically, a layout for an initial IC design is accessed. This initial IC design incorporates multiple instances of the same design block. Each instance includes a primary input connected to top-level logic for receiving a signal and one or more modifiable periphery sections. A timing analysis is performed to close timing and determine arrival times of the signal at the primary inputs of all instances of the design block, respectively, given the layout. The arrival times are then compared to a preselected threshold arrival time and the modifiable periphery section(s) of any specific instance of the design block having an arrival time that is equal to or less than the preselected threshold arrival time is selectively modified in order to generate an area and/or power optimized integrated circuit design.

Abstract: Disclosed are integrated circuit (IC) design methods, systems and computer program products. During IC design, an electrical netlist with built-in electrical resistance elements (i.e., electrical resistors) is extracted based on an IC design layout. A thermal netlist with built-in thermal resistance elements (i.e., thermal resistors) is automatically extracted based on the electrical netlist. This thermal netlist identifies thermal resistors, external thermal nodes and internal thermal node(s) and does so such that there is one-to-one mapping of the thermal resistors to electrical resistors in the electrical netlist, one-to-one mapping of the external thermal nodes to input, output and power supply nodes in the electrical netlist and one-to-one mapping of the internal thermal node(s) to element(s) (e.g., library and/or customized elements) in the electrical netlist.

Abstract: A method of modelling and simulating the full-scale temperature distribution, temperature gradient and cooling rate for 3D printing (additive manufacturing) a part or multi-parts throughout the additive manufacturing procedure on the basis of layerwise block technique is disclosed and claimed. The method enables to model the deposition part(s) with the various profiles as multi-different blocks by introducing the multi-blocks model and then reduce the 3D simulation problem to a 2D simulation problem by laminated block approach. Thus, the method can reduce the computational work and realize the quick simulation and analysis of the effect of processing parameters and deposit strategy on the full-scale temperature distribution, temperature gradient and cooling rate in the additive manufacturing deposition track-by-track and layer-by-layer, further help people to design the processing parameters and deposit strategy through full-scale temperature field change.