Abstract: A database system translates a received set of workflow actions into a graph of nodes. The graph of nodes includes a node set corresponding to each node type of the set of workflow actions. Each node set may be re-executable for each instance of an action type of the set of workflow actions. Upon completion of an action, the graph of nodes is executed. Execution of the graph of nodes includes executing processor executable instructions corresponding to a subset of the set of workflow actions. The subset may be determined base do on the completed action. The completed action may be determined based on a sequence tracking parameter.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for facilitating early detection and warning for system bottlenecks in an on-demand services environment according to one embodiment. In one embodiment and by way of example, a method includes detecting waits during processing of a query within a processing pipeline, wherein the waits include one or more of application-specific waits and database-specific waits; diagnosing the waits to identify a wait that has turned into a bottleneck; classifying one or more types of issues causing the wait to turn into the bottleneck; generating an alert having associated information detailing the issues based on the one or more types and a location of the wait within the processing pipeline; and transmitting the alert to facilitate correction activities.

Abstract: A method, system, apparatus, and a computer program product are provided for optimizing database query plans generated from a received database query at a database management system by monitoring a global cost estimation function for one or more steps of the received database query to identify a first low-performing cost metric and collaboratively optimizing a query plan for the database query by comparing differences between the first low-performing cost metric and a second cost metric at an additional database management system, thereby generating an optimized query plan for the database management system that may be stored at the database management system along with corresponding information identifying a reason for rewriting the optimized query plan.

Abstract: Implementation of the present disclosure relates to a method, system and computer program product for improvement of query execution. According to one embodiment of the present invention, there is provided a method. In the method a query on data organized in a first data structure is received first. And then based on at least one property associated with the query, a second data structure is selected from a plurality of candidate data structures, wherein a performance measure of the query on the data organized in the second data structure is better than the performance measure of the query on the data organized in the first data structure. And at last the query on the data organized in the second data structure is executed. In other implementations, a system and a computer program product are disclosed.

Abstract: A method is provided that includes assigning one or more first records of a first table and one or more second records of a second table to corresponding range groups of a plurality of range groups. The method further includes comparing at least one record of the first table with at least one record of the second table, where the at least one record of the first table and the at least one record of the second table are assigned to a first range group of the plurality of range groups. The method also includes, based on the comparing, identifying a parent record and a child record and segmenting the parent record based on the child record. Further, the method includes subsequent to the segmenting the parent record, performing a join operation on the first table and the second table.

Abstract: A tuple manager of a database system processes partial tuples from a streaming application and stores them in a database. The partial tuples may include a large object (LOB) that arrives at the database at a different time than the rest of the corresponding tuple. A tuple manager stores partial tuples and uses a partial tuples index to track the partial tuples and coordinate recombination of corresponding partial tuples. The database allows queries to be run on the partial data before the tuples are reconstructed allowing faster access to potentially important data before the arrival and processing of a partial tuple such as an LOB.

Abstract: Provided is a process, including: obtaining a set of candidate captions associated with one or more data visualizations; obtaining criteria designating whether candidate captions are descriptive of potential instances of the one or more data visualizations; producing a plurality of simulated instances of each of the one or more data visualizations; determining which of the captions apply to each of the simulated instances of each of the one or more data visualizations based on whether the simulated instances satisfy corresponding criteria; causing captions determined to be applicable to be presented; receiving feedback indicative of whether presented captions are perceived as descriptive of the corresponding simulated instances of data visualizations; and adjusting the criteria based on the feedback.

Abstract: One embodiment provides a system for facilitating anomaly detection and characterization. During operation, the system determines, by a computing device, a first set of testing data which includes a plurality of data points, wherein the first set includes a data series for a first variable and one or more second variables. The system identifies anomalies by dividing the first set into a number of groups and performing an inter-quartile range analysis on data in each respective group. The system obtains, from the first set, a second set of testing data which includes a data series from a recent time period occurring before a current time, and which further includes a first data point from the identified anomalies. The system classifies the first data point as a first type of anomaly based on whether a magnitude of a derivative of the second set is greater than a first predetermined threshold.

Abstract: Aspects of the disclosure relate to a system for amalgamating a plurality of graphs. The system may include a set of graphs. A user may input search criteria via a user interface (“UI”) module. The system may search the set of graphs for a subset of qualifying graphs that satisfy the search criteria. The subset of graphs may be merged into an amalgamated graph. Merging the graphs may include superimposing the qualifying graphs over each other at a locus. The locus may be a node or a sub-graph. The amalgamated graph may be displayed via the UI module.

Abstract: Systems and methods for reducing data storage overhead are disclosed herein. In some embodiments, a system includes a rollup service that converts a raw data set into a rolled up index that takes up less storage than the raw data but is created in such a way that the rolled up index can be queried so as to generate responses that will substantially correspond to responses that would be generated using the raw data.

Abstract: A method and system for improving memory reorganization and storage technology is provided. The method includes configuring data capture settings of a database system resulting in configured data capture settings. Data objects associated with a user are retrieved and stored in a database. Overlapping data elements of the data objects are determined and associated collaboration data model software code is generated. A request for first data is received and mapped to the data objects. A clone data object associated with the first data object is generated with respect to the overlapping data elements.

Abstract: Systems, apparatus, and methods for any point in time replication to the cloud. Data is replicated by replicating data to a remote storage or a data bucket in the cloud. At the same time, a metadata stream is generated and stored. The metadata stream establishes a relationship between the data and offsets of the data in the production volume. This allows continuous replication without having to maintain a replica volume. The replica volume can be generated during a rehydration operation that uses the metadata stream to construct the production volume from the cloud data.

Abstract: A method for synchronizing customized templates is provided. The method may include detecting a change to a first database table associated with a first cloud-based system hosting a first cloud-based software application. The change may correspond to customizations applied to a first template deployed at the first cloud-based system. The first template may define columns and/or rows in the first database table that is operated upon by the first cloud-based software application. The customizations applied to the first template may be identified based on the first database table. The customizations may be applied to a second template deployed at a second cloud-based system hosting a second cloud-based software application. The second template may define columns and/or rows in a second database table that is operated upon by the second cloud-based software application. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: A method and system are provided for assigning a particular record into a chunk of a partition within a non-relational database system. When a number of records in a particular candidate chunk is greater than a particular threshold number, an application performs an auto-balancing operation to split the particular candidate chunk such that records originally assigned to the particular candidate chunk are divided among the particular candidate chunk and a new chunk. Some of the number of records that were originally part of the particular candidate chunk are assigned to a new chunk and the other remaining ones of the number of records that were originally part of the particular candidate chunk remain assigned to the particular candidate chunk.

Abstract: In one general embodiment, a computer-implemented method includes determining attributes of a plurality of objects in an object-based storage environment, grouping the objects into clusters based on similarities of the attributes using a clustering algorithm, storing indication of which objects are in which clusters, detecting occurrence of a trigger event associated with an object, determining to which cluster the object belongs using the clustering algorithm in response to detecting the trigger event, and performing a deduplication process for the object against other objects in the cluster to which the object belongs. In another general embodiment, a computer program product includes a computer readable storage medium having program instructions embodied therewith. The computer readable storage medium is not a transitory signal per se. The program instructions are readable and/or executable by a computer to cause the computer to perform the foregoing method.

Abstract: Methods, apparatus, systems, computing devices, computing entities, and/or the like for employing machine learning concepts to accurately predict categories for unseen data assets, present the same to a user via a user interface for review, and assign the categories to the data assets responsive to user interaction confirming the same.

Abstract: Systems and methods for generating stories from segments classified with real-time feedback data are disclosed. In embodiments, a method includes sending, by a computing device, a story to a user computer device, wherein the story is associated with target story goals; receiving, by the computing device, real-time user feedback data of a consumer of the story; determining, by the computing device, that the real-time feedback data does not match the target story goals; and dynamically modifying, by the computing device, the story based on the determining that the real-time feedback data does not match the target story goals.

Abstract: Methods and systems for data indexing are disclosed. According to some embodiments, an index is split into a number of slots based on a slot power value. Each of the slots is assigned with a slot number. A first subset of the slots is allocated to a first shard mapped to the index. A second subset of the slots is allocated to a second shard mapped to the index. The first subset and the second subset are respectively allocated to the first shard and the second shard based on a shard-slot mapping.

Abstract: A method includes initializing an addressable array indexing data structure comprising addresses for respective strings having a first length, the addressable array indexing data structure comprising two or more levels of character arrays with each level being associated with a corresponding character position in the strings having the first length. The method also includes extracting variable length strings from one or more records in a data set, and populating entries in the addressable array indexing data structure for extracted strings having the first length with addresses for indexes corresponding to those strings, wherein addresses for strings having the first length are generated by selecting a character value from a character array at each of the levels in the addressable array indexing data structure. The method further includes receiving, from client devices, queries to the records in the data set, and processing the queries utilizing the addressable array indexing data structure.

Abstract: Methods and systems for generating a search expression. The system begins with an empty search expression, and iteratively expands the search expression until some terminating condition is reached.

Abstract: Embodiments provide a computer implemented method for ranking supporting passages in a question answering (QA) system. The method includes the following steps: receiving an input question and a plurality of passages, wherein the plurality of passages are extracted from the document corpus by the QA system; identifying a plurality of candidate answer occurrences from the plurality of passages; assigning a plurality of first local features to each candidate answer occurrence; merging the plurality of candidate answer occurrences to generate a group of candidate answers; assigning a plurality of second local features and a plurality of nonlocal features to each candidate answer; ranking the group of candidate answers using a linear answer scoring model; and ranking the plurality of candidate answer occurrences using the linear answer scoring model.

Abstract: Methods, systems, and computer program products related to a cognitive assistant for co-generating creative content are provided herein. A computer-implemented method includes obtaining semantic-level inputs from at least one user, wherein the semantic-level inputs pertain to multiple aspects of a desired content narrative; generating textual content based at least in part on the semantic-level inputs, wherein said generating the textual content comprises applying one or more deep learning algorithms to the semantic-level inputs; generating image content based at least in part on the generated textual content; creating the desired content narrative by integrating (i) the generated textual content and (ii) the generated image content; and outputting the desired content narrative to the at least one user.

Abstract: Provided is a process, including: obtaining a first identifier of a first user for whom a first presentation including a first natural language text summary of data is to be provided; selecting a first domain from among a plurality of domains based on the first identifier; selecting a first set of fields among a plurality of fields of the data based on the first domain; determining a first set of exposure-control rules based on the first set of fields of data; determining a first applicable subset of the first set exposure-control rules by comparing criteria of the first set of exposure-control rules to user attributes associated with the first identifier; generating with a trained captioning model, the first natural language text summary in the first domain of the data compliant with exposure permissions of the first applicable subset of the first set of exposure-control rules.

Abstract: A system comprising at least one hardware processor; and a non-transitory computer-readable storage medium having stored thereon program instructions executable to receive, as input, one or more digital documents, a query statement, and a summary length constraint, automatically generate, for each of said one or more digital documents, an initial summary based, at least in part, on a first sentence selection which satisfies said query statement, a modified said summary length constraint, and a first summary quality goal, automatically extract, from each of said initial summaries, one or more associated feedback metrics, and automatically generate, for each of said one or more digital documents, a final summary based, at least in part, on: (i) a second sentence selection which satisfies said query statement, said summary length constraint, and a second summary quality goal, and (ii) at least one of said associated feedback metrics.

Abstract: Systems and methods disclosed herein provide for semantically aligning data tables, controlled domain vocabularies, and domain ontologies. Embodiments of the systems and methods provide for aligning the data tables, controlled domain vocabularies, and domain ontologies based on a proxy table ontology representing a physical syntactical structure of the data table.

Abstract: Methods, systems, and computer program products are disclosed for providing a user friendly plot summary of a video for a particular user. According to the method, a plot category of a video can be determined. The method can determine a type of a plot summary of the video for a user based on preferences of the user and the determined plot category of the video. The method can generate a plot summary of the video with the determined type. The method can provide the generated plot summary to the user.

Abstract: Technologies are described for systems to generate a report. The systems may comprise a processor and a memory including instructions. The processor may be configured to receive a request for a user interface, generate interface data, send the interface data to an interface processor, and receive and save an input that includes a location and a crop. The processor may be configured to send a first query to a climate processor, receive and save climate data; send a second query to a water usage processor, receive and save water usage data; and send a third query to a water reserves processor, receive and save water reserves data. The processor may be configured to generate report data based on the input, climate data, water usage data, water reserves data, and a demand sensitive drought index algorithm, and send the report data to the interface processor to be displayed upon a display.

Abstract: A social media control method, system, and computer program product, include detecting a contextual meaning of a content of a third-party post on a user's social media account, classifying the content into user-defined categories based on an overlap between the contextual meaning and the user-defined categories, identifying an undesired piece of information from the content, identifying a trusted online friend within a social media circle of the user, and providing a one-time access control to the identified trusted online friend to rectify the undesired content in the third-party post.

Abstract: In some examples, a system accesses, in response to a search received from a first entity, a model derived from documents produced by the first entity or a group of entities comprising the first entity during operation of the first entity or the group of entities, the model comprising indications of importance of terms extracted from the documents. The system returns a search result that is based on the query and on the model.

Abstract: In some examples, a system performs language processing of text of an information page to determine whether the text refers to an online resource, and in response to determining that the text refers to the online resource, identify the text as an implicit reference to the online resource. The system derives a link to the online resource based on the implicit reference, the derived link useable in accessing the online resource.

Abstract: Systems and methods for retrieving data of a web page are described herein. In one broad aspect, there is provided a method comprising: requesting the data of the web page from a browser application instance in accordance with a protocol capable of remotely instructing behavior of the browser application instance; in response to the requesting, receiving the data of the web page; instructing a server-side parser to retrieve at least one data item from the data of the web page; and transmitting the at least one data item to a requestor.

Abstract: A computing system includes a server and a client computing device. The server includes a web application, and anchor definition layers associated with the web application. The client computing device is operated by an end user and includes a display, and a native application that includes an embedded browser for accessing the web application in a customization mode. The customization mode permits display of one of the web pages along with anchors that can be customized based on what is permitted by the anchor definition layer corresponding to the displayed web page, and customization of the anchors on the displayed web page by the end user to define an anchor customization layer for the displayed web page. In normal use of the web application, the anchor customization layer is applied to the corresponding web page before the corresponding web page is displayed so as to display a customized web page without re-designing the web page itself.

Abstract: Techniques for storing block-based metadata in a storage system are provided. A method includes (a) receiving a request to write a block of data to a logical address, (b) assigning a physical address where the block of data is to be stored, (c) creating a metadata entry for the block of data, the metadata entry including the physical address, (d) storing a key-value pair within a sorted key-value structure (SKVS) of an ordered plurality of SKVSes, each SKVS having a unique identifier, the key-value pair including the logical address as key and the metadata entry as value; (e) placing an entry within a Cuckoo filter based on the key, the entry including the identifier of the SKVS in which the key-value pair was stored, and (f) subsequently accessing the data by: (1) locating the metadata entry with reference to the Cuckoo filter and (2) locating the data with reference to the physical address in the metadata entry.

Abstract: Disclosed are systems and methods for improving interactions with and between computers in content providing, searching and/or hosting systems supported by or configured with devices, servers and/or platforms. The disclosed systems and methods provide a novel framework for analyzing messages shared over a network and identifying information in them referencing entities based on a determined context of the messages. Once the entity information is identified, the disclosed framework segregates them based on the context, and then presents them in contextual views as content cards within or as part of generated, content-specific interfaces. The disclosed framework enables users to continue messaging while pivoting between different views of the generated interfaces, which enables the retrieval of additional information related to the entity information included on the content cards.

Abstract: Computer systems, computer-implemented methods and computer program products that detect a homographic string against defined strings is disclosed. In one embodiment, a computer-implemented method comprises: preparing, by a device operatively coupled to a processor, a mapping function to map a character into an identifier, the mapping function defining a plurality of groups each comprising two or more characters that resemble one another assigned a same identifier, and wherein the plurality of groups are mutually exclusive; preparing, by the device, a list of identifier sequences obtained from defined strings based on the mapping function; applying, by the device, the mapping function to a queried string to obtain a queried identifier sequence; and determining, by the device, whether the queried string is a homographic string by comparing the queried identifier sequence with the list of the identifier sequences.

Abstract: Provided is a process, including: obtaining, with one or more processors, data to be summarized, wherein the data comprises a plurality of metrics; generating, with one or more processors, a plurality of instances of data visualizations depicting at least some of the data by systematically varying: type of data visualization, and mapping of fields of the data to data visualizations; generating, with one or more processors, with a trained captioning model, intermediate natural language text summaries of each of the instances of data visualizations; summarizing, with one or more processors, with a natural language text summarization model, the intermediate natural language text summaries to form a natural language text description of the data; and storing, with one or more processors, the natural language text description of the data in memory.

Abstract: An input unit to which shape definition data that defines a three-dimensional shape is input. A processing unit disposes a plurality of particles on an edge and a surface of the three-dimensional shape defined by the input shape definition data, disposes particles according to an internal distribution rule in an inner part spaced apart from the surface of the three-dimensional shape, disposes particles at a position deviated from the position according to the internal distribution rule, in a space between the inner part and the surface of the three-dimensional shape, and generates a tetra mesh having a center of the disposed particles as a vertex.

Abstract: A method for improving performance of a predefined Deep Neural Network (DNN) convolution processing on a computing device includes inputting parameters, as input data into a processor on a computer that formalizes a design space exploration of a convolution mapping, on a predefined computer architecture that will execute the predefined convolution processing. The parameters are predefined as guided by a specification for the predefined convolution processing to be implemented by the convolution mapping and by a microarchitectural specification for the processor that will execute the predefined convolution processing. The processor calculates performance metrics for executing the predefined convolution processing on the computing device, as functions of the predefined parameters, as proxy estimates of performance of different possible design choices to implement the predefined convolution processing.

Abstract: To enable to display one or more drawing content, which have been created during defining one or more engineering drawings from a model which comprises one or more parts to model one or more structures, digital twins of the one or more drawing content with associated information are created and published. The associated information of the digital twin comprises three-dimensional coordinates for the drawing content in question, determined based on one or more parts, to which the drawing content relates, and identifying information of said one or more parts.

Abstract: Efficient synthesis of arbitrary quantum states and unitaries from a universal fault tolerant gate-set (e.g., Clifford+T) is a goal in quantum computation. As physical quanturn computers are fixed in size, all available qubits should be used if it minimizes overall gate counts, especially that of the expensive T-gates. In this application, a quantum algorithm is described for preparing any dimension-N quantum state specified by a list of N classical numbers, that realizes a trade-off between space and T-gates. Example embodiments exploit (?) ancilla qubits, to reduce the T-gate cost to ? ? ( N ? + ?log 2 ? N ? ) . Notably, this it proven to be optimal up to logarithmic factors for any ?=o(?{square root over (N)}) through an unconditional gate counting argument. Though (N) Clifford gates are always required, only (?{square root over (N)}) T-gates are needed in the best case, which is a quadratic improvement over prior art.

Abstract: Techniques include retrieving a first structural netlist (SN1) that indicates electronic components, values of programmable parameters, and connections for a first electronic circuit, and retrieving a first placed and routed netlist (PR1) that indicates physical placement of the electronic components and physical routing of connections for SN1. Also retrieved is a second structural netlist (SN2) for a different second electronic circuit. For each component in SN2, a matching component, if any, is found in SN1 based on type of component and inputs that are output from other matching components without regard to value of the programmable parameter. A different second placed and routed netlist (PR2) is generated for the second circuit by including, from PR1, all matching components and connections, updated value of the programmable parameter from SN2, and by deriving new placement and routing for non-matching components in SN2. An electronic circuit is constructed according to PR2.

Abstract: A system and method for calibrating a simulation model based on a framework. The system includes a calibration parameter value generating processor configured to generate a value of a first calibration parameter for calibrating microdata and a value of a second calibration parameter for calibrating a simulating processor; an initial data generating processor configured to determine a missing value of the microdata based on the value of the first calibration parameter to generate initial data; and the simulating processor configured to simulate based on the initial data and the value of the second calibration parameter.

Abstract: Model elements of an executable model, representing a physical system, are partitioned into one or more linear portions and one or more nonlinear portions. Simulating behavior of the physical system, by executing the model, includes, for each of multiple simulation time intervals, for a first nonlinear portion, computing a correlation matrix characterizing noise associated with one or more ports of the model. A scattering matrix corresponds to a portion of the physical system represented by the first nonlinear portion without accounting for any noise within the portion of the physical system. The correlation matrix is derived from the scattering matrix based on noise within the portion of the physical system. Noise sources representing noise within the portion of the physical system are identified based on the correlation matrix. At least one characteristic of noise associated with each noise source is computed, and noise characteristics are output at selected ports.

Abstract: A value of a parameter defining a linear term and a value of a parameter defining a nonlinear term of an interaction potential between particles determined according to a material to be simulated and an initial condition of a particle disposition are input to an input unit. A processing unit analyzes behavior of the particles by a molecular dynamics method using the interaction potential defined by the values of the parameters input to the input unit and based on the initial condition input to the input unit.

Abstract: Systems and methods described herein are configured to estimate nominal stress using finite element (FE) stress calculations, without hand calculations, specific mesh density requirements, or identifying specific geometric parameters such as plate thickness. The systems and methods described herein may be utilized to identify nominal stress in welded structures and components, and also in non-welded components that have stress raisers due to other causes. The systems and methods described herein also allow readily available FE stress results to be utilized in a consistent manner, as well as providing user feedback regarding the accuracy of the nominal stress approximations. Furthermore, the systems and methods described herein are generally faster and less error prone than conventional techniques, and are relatively insensitive to mesh density of the FE stress calculations.

Abstract: A method for accelerating an explicit finite element analysis (FEA) simulation of a modeled system or process includes performing an initial iteration of the FEA simulation according to a baseline time interval via an FEA computing network, and calculating a criteria ratio of a predetermined set of scaling criteria for the modeled system or process. The method includes determining a time-scaling factor using the criteria ratio via the FEA computing network as a function of the criteria ratio, and then applying the time-scaling factor to the baseline time interval to generate a scaled time interval. The scaled time interval accelerates simulation time of the FEA simulation. The method includes performing a subsequent iteration of the explicit FEA simulation at the scaled time interval using the FEA computing network. The process continues for subsequent iterations, with the time-scaling factor adapting with each iteration.

Abstract: A system and method to perform timing analysis in integrated circuit development involves defining an integrated circuit design as nodes representing components of the integrated circuit design that are interconnected by edges representing wires. Sequentially connected nodes define a path. Statistical variables are defined for a canonical delay model of each node and edge of the integrated circuit design and define a first set of conditions. The method includes performing a statistical static timing analysis to obtain an arrival time at each node as a sum of the canonical delay models for nodes and edges that precede the node in the path of the node, obtaining a projected arrival time at a second set of conditions for the node by scaling the arrival time for the node using scale factors that represent the second set of conditions and using a transformation matrix, and providing the integrated circuit design for fabrication.

Abstract: A system and method to perform an ordered write of timing analysis data obtained in parallel during integrated circuit development process two or more data sets with two or more processors in parallel. The two or more data sets result from timing analysis and correspond with two or more paths, each path includes a set of interconnected components, and the processing includes collecting and formatting information to obtain the timing analysis data associated with each of the two or more paths. The method includes determining a next timing analysis data using an ordered list of the two or more data sets that correspond with the timing analysis data, consulting an availability vector to determine whether the next timing analysis data is available, and writing the next timing analysis data as soon as it is available prior to completion of the processing of others of the two or more data sets.

Abstract: A simulation system includes an application, a chip model and an off-chip model. The application is configured to generate a corresponding instruction set in accordance with an application situation of a simulation circuit, wherein the simulation circuit includes a chip. The chip model receives the instruction set as an input to simulate operation of at least one intellectual property core of the chip via high-level languages in accordance with the at least one intellectual property core of the chip and to generate a power consumption and an I/O logic signal of the chip. The off-chip model constructs one or more orders of RLCG circuit cascading models in accordance with all or part of the off-chip model abstracted by the S parameter. The application program and the RLCG circuit cascading model are integrated for simulating and analyzing power integrity and signal integrity of the simulation system.

Abstract: A virtual fabrication environment for semiconductor device fabrication that determines a lowest lithography exposure dose range in which one or more defects are still reparable by deposition and etch operations is discussed. Further techniques for repairing line edge roughness caused by lithography are described.