Systems and methods for quantum monte carlo processing
US-2024428112-A1 · Dec 26, 2024 · US
US2017193375A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2017193375-A1 |
| Application number | US-201514983807-A |
| Country | US |
| Kind code | A1 |
| Filing date | Dec 30, 2015 |
| Priority date | Dec 30, 2015 |
| Publication date | Jul 6, 2017 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Embodiments are directed to a computer implemented method for fabricating test data. The method includes receiving, using a processor system, a file format layout having variables. The method further includes receiving, using the processor system, rules that are defined independently of the file format layout, wherein the rules impose constraints on the variables. The method further includes defining a constraint problem based on the variables and the constraints, and solving the constraint problem.
Opening claim text (preview).
1 . A computer implemented method for developing a system to fabricate test data into a database, the method comprising: receiving, using a processor system, a file format layout of the database, wherein the database includes variables; defining rules independently of the file format layout of the database; receiving, using the processor system, the rules that are defined independently of the file format layout of the database; wherein the rules impose constraints on the variables; wherein the rules being defined independently of the file format layout prevents the rules from imposing any limit on a first manner in which the rules are defined; wherein the rules being defined independently of the file format layout prevents the rules from imposing any limit on a second manner in which relationships between and among the variables are defined; defining a constraint problem based on the variables and the constraints; and solving the constraint problem. 2 . The computer implemented method of claim 1 , wherein solving the constraint problem generates an assignment of fabricated test data to each one of the variables. 3 . The computer implemented method of claim 2 further comprising generating an output comprising the file format layout having the fabricated test data, wherein the fabricated test data conforms to the rules. 4 . The computer implemented method of claim 3 , wherein the file format layout comprises a template. 5 . The computer implemented method of claim 1 , wherein the constraint problem is solved using a constraint satisfaction problem (CSP) solver. 6 . The computer implemented method of claim 1 , wherein the rules include an individual rule that imposes a constraint on more than one of the variables. 7 . The computer implemented method of claim 1 , wherein the file format layout comprises is selected from the group consisting of: a database; a flat file; a message; a data stream; and a web service call. 8 - 20 . (canceled)
Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound · CPC title
Data format conversion from or to a database · CPC title
Templates · CPC title
Fragmentation of text files, e.g. creating reusable text-blocks; Linking to fragments, e.g. using XInclude; Namespaces · CPC title
Tagging; Marking up (details of markup languages G06F40/143); Designating a block; Setting of attributes (style sheets, e.g. eXtensible Stylesheet Language Transformation [XSLT], G06F40/154) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.