Tag: “%s %s”

Train a model on synthetic data using Pyro

Post author By Full Stack
Post date December 14, 2020
No Comments on Train a model on synthetic data using Pyro

I’m trying to replicate the counterfactual fairness paper( https://arxiv.org/pdf/1703.06856.pdf ) in Pyro. I have found a tutorial that mentioned the following steps: Convert the above model to an SCM. Call this "GroundTruthModel". It should explicitly represent K. In SCMs endogenous variables are deterministic functions of exogenous variables and parent endogenous variables. So sample the endogenous […]

Tags 'f': 'F', 'p']) all_samples=[] for i in range(1000): trace = trace_handler.get_trace() R = trace.nodes['R']['value'] S = trace.nodes['S'][, 'p']) ProposedModel def ProposedModel(): #Nr = pyro.sample("Nr", "%s %s", (k) => (k, { l:l, 0.25]))) Ns = pyro.sample("Ns", 0.4]))) Nk = pyro.sample("Nk", dist.Categorical(torch.tensor([0.6, dist.Categorical(torch.tensor([0.75, dist.Delta(chi_1)) S = pyro.sample("S", dist.Delta(chi_2)) K = pyro.sample("K", dist.Delta(chi_3)) #Gval = K + 2.1* R + 3.3 * S + 0.5 * pyro.sample("g", dist.Delta(Gval)) Lval = K + 5.8 * R + 0.7 * S + 0.1 * pyro.sample("l", dist.Delta(Gval)) Lval = K + alpha_2 * R + beta_2 * S + gama_2 * pyro.sample("l", dist.Delta(Lval)) Fval = K + 2.3 * R + 1.0 * S + 0.3 * pyro.sample("f", dist.Delta(Lval)) Fval = K + alpha_3 * R + beta_3 * S + gama_3 * pyro.sample("f", dist.Delta(Lval)) trace_handler = pyro.poutine.trace(GroundTruthModel) samples = pd.DataFrame(columns=['R', dist.Delta(Lval)) trace_handler = pyro.poutine.trace(ProposedModel) samples = pd.DataFrame(columns=['R', dist.Delta(Nk)) Gval = K + 2.1* R + 3.3 * S + 0.5 * pyro.sample("g", dist.Delta(Nr)) S = pyro.sample("S", dist.Delta(Ns)) K = pyro.sample("K", dist.Normal(torch.tensor(0.), f: '' }, F]) samples.head() Can someone help me understand how to work on points 3 through 5, for the "abduction" part of the algorithm, g, G: 'G', gradient-based inference in Pyro will have problems with dist.Delta. So i suggest replacing it with PseudoDelta = partial(Normal, I'm trying to replicate the counterfactual fairness paper( https://arxiv.org/pdf/1703.06856.pdf ) in Pyro. I have found a tutorial that menti, ignore_index=True) all_samples.append([R, K, L)?, namely (https://latex.codecogs.com/png.latex?dpi150bg_whitefn_cmPU_RrSsLlGg, PP, s, scale=tensor(0.1)) but using the same weights you got during training (do this conversion before training if it makes it easier). Here is my, torch.tensor(1.))) F = pyro.sample("F", torch.tensor(1.))) G = pyro.sample("G", torch.tensor(1.))) Gval = K + alpha_1* R + beta_1 * S + gama_1 * pyro.sample("g", torch.tensor(1.))) L = pyro.sample("L", torch.tensor(1.))) Nr = Nr.type(torch.FloatTensor) Ns = Ns.type(torch.FloatTensor) Nk = Nk.type(torch.FloatTensor), use the action-abduction-inference algorithm (use both the condition operator and the do operator) to infer the counterfactual quantities of

Mastering Development

Hibernate custom type with manyToOne relation

Post author By Full Stack
Post date November 9, 2020
No Comments on Hibernate custom type with manyToOne relation

What I Woul like to have: Class Address, which represent address around a globe, also I do have Country entity, which I would like to use as relation here, to mitigate the risk to have an Address to a Country, which I would specify (is it worth mitigation?) My general question, is it even possible? […]

Tags `street`, 'City'], 'country', 'zipcode', "%s %s", "zipCode"}; } @Override public Type[] getPropertyTypes() { return new Type[]{ new TypeConfiguration().ge, Address address) { this.id = java.util.UUID.randomUUID(); this.user = user; this.address = address; } public, also I do have Country entity, Country is straight forward as well: @Entity @Table(name = "countries") public class Country { @Column @Id @NotNull private, final int property) throws HibernateException { if (component == null) { return null; } String propertyV, final Object owner) throws HibernateException, final SharedSessionContractImplementor session, final String city, final String name) { this.nameIso = nameIso; this.name = name; } public String getNameIso() { return nameIs, final String number, final String street, final String zipCode ) { this.country = country; this.street = street; this.number = number; this.city =, final String[] names, here is what I ended up with: public class AddressType implements CompositeUserType { public static final String NAME = "address";, I use Hibernate 5.4.6 on Java 11 Let's have a simple class: public class Address { private Country country; private String city;, is it even possible? Btw, Number, s, SQLException { String country = rs.getString(names[COUNTRY_INDEX]); String city = rs.getString(names[CITY_INDEX]); St, StandardBasicTypes.STRING, StandardBasicTypes.STRING }; } @Override public Object getPropertyValue(final Object component, that there will be many to one type through deprecated TypeFactory (ouch), to have relation in my CompositeType or should I stop trying and live with just any country iso code in my address class? Thanks!, to mitigate the risk to have an Address to a Country, What I Woul like to have: Class Address, which I would like to use as relation here, which I would specify (is it worth mitigation?) My general question, which represent address around a globe, zipCode); } return null; } } So is it possible

CMS Mastering Development Wordpress

How to WP_Query() from multiple blogs and order them?

Post author By Marcia D.
Post date September 29, 2020
No Comments on How to WP_Query() from multiple blogs and order them?

Dear WordPress community, my job seems quiet hard now. We have a blog for articles and another for videos and I now have to produce a list of it, ordered. Paginatedly. This is what I tried: switch_to_blog(1); $query = (new WP_Query([ ‘post_type’ => ‘video’, ‘post_status’ => ‘publish’, ‘posts_per_page’ => 30, ‘paged’ => 1, ‘s’ => […]

Tags 'order' => 'DESC' ]))->posts; and: switch_to_blog(2); $query = (new WP_Query([ 'post_type' => 'article', 'order' => 'DESC' ]))->posts; but as of my knowledge, 'order' => 'DESC' ]))->posts; the problem is, 'orderby' => 'date', 'paged' => 1, 'post_status' => 'publish', 'posts_per_page' => '30', "%s %s", 2]); $query = (new WP_Query([ 'post_type' => 'article', Dear Wordpress community, its not possible. Then how?, my job seems quiet hard now. We have a blog for articles and another for videos and I now have to produce a list of it, ordered. Paginatedly. This is what I tried: switch_to_blog(1); $query = (new WP_Query([ 'post_type' => 'video', the output is not correct of course. Both the resultset can only be appended not merged. The best would be: switch_to_blog([1

CMS Mastering Development Wordpress

WordPress pagination problem on merged queries

Post author By Marcia D.
Post date September 24, 2020
No Comments on WordPress pagination problem on merged queries

I have merged queries in search.php with custom post types. This is my scenario when user search to "math", the main query is searching in the post title, post excerpt, and post content. Now I have a "math" category but the post information is not including "math" text which exists in the math category so […]

Tags '%#%', '2' ); } } add_action('pre_get_posts', 'category__in' => $term_ids, 'current' => max( 1, 'fields' => 'ids', 'fix_query_post_per_page'); So how can I fix this problem? Thank you!, 'format' => '?paged=%#%', 'hide_empty' => true )); if (count($terms) > 0){ foreach($terms as $term){ array_push($term_ids, 'next_text' => 'Next >' )); wp_reset_postdata(); function.php function fix_query_post_per_page($query){ if ($query->is_main_query() &&, 'order' => 'DESC', 'orderby' => 'ID', 'paged' => $paged ); $search_query = new WP_Query($argo); $max_num = $search_query->max_num_pages; if ($search_query->have_posts()) : while, 'post__in' => $post_ids, 'post_status' => 'publish', 'posts_per_page' => -1 ); $arg2 = array( 'post_type' => 'course', 'posts_per_page' => -1 ); $query1 = new WP_Query($arg1); $query2 = new WP_Query($arg2); $post_ids = array_merge($query1->posts, 'posts_per_page' => 2, 'prev_text' => 'Prev', 'total' => $search_query->max_num_pages, "%s %s", $query2->posts); $post_ids = array_unique($post_ids); $search_count = count($post_ids); if($search_count == 0){$post_ids[] = -1;} $paged = (, $s); foreach($search_text_list as $search_text){ $terms = get_terms('category', $term->term_id); } } } if(count($term_ids) == 0){$term_ids[]=-1;} $arg1 = array( 'post_type' => 'course', and post content. Now I have a "math" category but the post information is not including "math" text which exists in the math category so it', array( 'course' ) ); $query->set( 'posts_per_page', array( 'name__like' => $s, get_pagenum_link( $big ) ), get_query_var('paged') ), I have merged queries in search.php with custom post types. This is my scenario when user search to "math", post excerpt, the main query is searching in the post title

Mastering Development

Solving modular linear congruences for large numbers

Post author By Full Stack
Post date July 22, 2020
No Comments on Solving modular linear congruences for large numbers

I’m looking for a better algorithm than one I found on stackoverflow to handle 4096 byte numbers, i’m hitting a maximum recursion depth. Code from stackoverlow post, i copy/pasted it but lost the original link: def linear_congruence(a, b, m): if b == 0: return 0 if a < 0: a = -a b = -b […]

Tags "%s %s", (old_s, [y'; y'], 1009) Out[19037]: 179 Thank you E, 256, 272) In [19037]: fastlinearcongruencex(272, 3266, 4033) 63 1 8261, 4033): 2147 But i hit maximum recursion depth with larger numbers. Is there a better algorithm or non recursive algorithm of the linear_cong, 63, a) + b) // a This works fine for smaller numbers, B, bezout_t It even works instantaneously on 4096 byte numbers which is great: In [19036]: rpowxxxwithbitlength(1009, bezout_t)) print("greatest common divisor:", but for now, divmodx, divmodx = {divmodx}, for example: In [167]: pow_mod(8261, i copy/pasted it but lost the original link: def linear_congruence(a, i have what i need since i'm working with powers of 2 -1 for y in pow(x, i wrote an extremely fast linear congruence algorithm utilizing egcd and the procedure from the pdf above. If any stackoverflowers need a fas, i wrote the pseudocode from the wikipedia entry and created a very fast linear congruence algorithm utilizing the method from here: http://ga, i'm hitting a maximum recursion depth. Code from stackoverlow post, I'm looking for a better algorithm than one I found on stackoverflow to handle 4096 byte numbers, m): if b == 0: return 0 if a m: a -= m return (m *, n, N = {N}") x, N) if withstats == True: print(f"x = {x}, offset=0, old_r - quotient * r old_s, old_r = {old_r}, old_r) return old_r, old_s - quotient * s if withstats == True: print(f"quotient = {quotient}, old_s = {old_s}, please point them to this one. I also learned that congruence is always maintained when the pow(x, R: ${R}, s = {s}") if b != 0: bezout_t = quotient = (old_r - old_s * a) // b if withstats == True: print(f"bezout_t = {bezout_t}") e, to get the answer. I'm looking into how offsetting from this changes the answer and hope to incorporate it to work for those answers as well, true, withbl=True) 63 1 272 1009 31 272 327 1009 15 152 984 1009 7 236 625 1009 3, withstats) if x > 1: powx//=x divmodx//=x N//=x if withstats == True: print(f"powx = {powx}, withstats=False): s = 0 r = b old_s = 1 old_r = a while r!= 0: quotient = old_r // r old_r, withstats=False): x, withstats=True, withx=True, y, z = {z}") answer = (y*divmodx)%N if withstats == True: print(f"answer = {answer}") return answer def egcditerx(a, z = egcditerx(powx, z) has a y off of the powers of 2-1. I will look into this further to see if an offset change exists to keep the answers intact and will foll, z): def fastlinearcongruencex(powx

Mastering Development

dice roll math with large n (>100) and numerical precision

Post author By Full Stack
Post date April 29, 2020
No Comments on dice roll math with large n (>100) and numerical precision

edit: thank you for the suggestions about numerical precision, I have included a currently non functional implementation of ramanujan’s approximation below. The probability is still getting too big for n > 80. re-titled to be more descriptive I promise this is not just another dice rolling homework problem. I implemented a function to calculate the […]

Tags ?\n ^\n'), "* n) as sum of n rolls of a", "%s %s", "sided dice")) Ramanujan's Approximation Per the comments, $m, edit: thank you for the suggestions about numerical precision, I have attempted to implement Ramanujan's approximation to work with logs. log(0) is of course not a valid number, I have included a currently non functional implementation of ramanujan's approximation below. The probability is still getting too big for n, i) * bignchoosek(s - 1 - i * m, i) * choose(s - 1 - i * m, k)) ramanujan <- function(n){ n*log(n) - n + log(n*(1 + 4*n*(1+2*n)))/6 + log(pi)/2 } exp(ramanujan(n) - ramanujan(k) - ramanujan(, k){ # the approximation is finicky and doesn't handle some edge cases well if(n <= 1 | k <= 1 | n == k | n < k) return(choose(n, m-m', main = paste("probability of rolling less than floor(", mean(1:m), n - i, n = n) plot(n, n) { # Probability of getting less than s i <- 0:((s-1-n) / m) m^(-n) * sum((-1)^i * bignchoosek(n, n)) } # Full example series n <- 1:90 # number of dice m <- 6 # number of sides s <- floor(mean(1:m)*n) # sum of faces p <- mapply(probab, n)) } Starts breaking with ~ n > 80 n <- 1:90 # number of dice m <- 6 # number of sides s <- floor(mean(1:m)*n) # sum of faces p <- mapply, P, so we need to put in place some safeguards for small values of n and k. bignchoosek <- function(n

Mastering Development

Strange behavior of EqualityComparer with nullable fields

Post author By Full Stack
Post date March 17, 2020
No Comments on Strange behavior of EqualityComparer with nullable fields

Assume there is this class: public class Foo { public int Id { get; set; } public int? NullableId { get; set; } public Foo(int id, int? nullableId) { Id = id; NullableId = nullableId; } } I need to compare these objects by following rules: If both objects have value for NullableId then we […]

Tags 'f': 'F', "%s %s", 1, 1) and new Foo(1, 2, 2)). For me it looks like that happens because of Lookup that is being created inside Join method. Could someone clarify what happens there?, 3) }; Next, 3) I can not get what am I doing wrong. If try to put a break point in Equals method then I can see that it tries to compare items from same, Assume there is this class: public class Foo { public int Id { get; set; } public int? NullableId { get; set; } public Foo(int, f: '' }, I want to join these lists. If I do it like this: var result = second.Join(first, if I change order and join first with second: var result = first.Join(second, int? nullableId) { Id = id; NullableId = nullableId; } } I need to compare these objects by following rules: If bot, new Foo(1, null) }; var second = new List { new Foo(1, null) and new Foo(1, s) => new {f, s}).ToList(); then the result would be as I expected and I will get 3 items. But, s}).ToList(); then the result would only have 1 item - new Foo(1

Development

Android LocaleList creates null content object for Test flow

Post author By Full Stack
Post date February 25, 2020
No Comments on Android LocaleList creates null content object for Test flow

Faced with a strange behaviour of android.os.LocaleList class for Test flow. I have a very simple test (based on just generated by Studio, nothing else). I’ve added some other object construction examples for comparison. In Test flow LocaleList doesn’t create a list of locales – it creates some object with “null” inside: import android.os.LocaleList import […]

Tags "%s %s", "JP") // {Locale@824} "ja_JP" val isequal = Locale.JAPAN.equals(locale) // true val list = listOf<Loca, "JP") // {Locale@9771} "ja_JP" val isequal = Locale.JAPAN.equals(locale) // true val list = listOf<Loc, but in Main(app develop) - it is possible., Faced with a strange behaviour of android.os.LocaleList class for Test flow. I have a very simple test (based on just generated by Studio, It, ja_JP]" val date = Date(System.currentTimeMillis()) // {Date@9770} "Tue Feb 25 23:39:56 GM, l=" + l + '}'; } } any mockito-, l=de_DE}" } } But for Application (app-development) flow - e.g. in Fragment - it works as expected: class PostsFragment : Fragment() {, l=de_DE}" } } This block of code doesn't use: static methods of final class (one of possible solutions I've surfed) Even have my loca, Locale l) { this.d = d; this.s = s; this.l = l; } @Override public String toString() { return "ClassWithStatics{" + "d=" + d +, Locale.GERMANY) // {ClassWithStatics@829} "ClassWithStatics{d=42, Locale.ITALIAN, Locale.JAPAN) /*HERE*/// {LocaleList@826} "null" val date = Date(System.currentTimeMillis()), Locale.JAPAN) /*HERE*/// {LocaleList@9749} "[fr, Locale.JAPAN) // {Arrays$ArrayList@825} size = 3 val pfc = ClassWithStatics(42, Locale.JAPAN) // {Arrays$ArrayList@9772} size = 3 val pfc = ClassWithStatics(42, nothing else). I've added some other object construction examples for comparison. In Test flow LocaleList doesn't create a list of locales -, powermock- dependencies at all any extra annotations - only @Test object of other classes were created identically for Test and App flows., s='WTF', String[][] S, Wtf....

Development

Readdir() in a sequential behavior

Post author By Full Stack
Post date January 1, 2020
No Comments on Readdir() in a sequential behavior

int indent = 0; int listDir(const char* dirname){ DIR* dir; struct dirent* d; if(!(dir = opendir(dirname))) return -1; while((d = readdir(dir)) != NULL){ if(strcmp(d->d_name, “.”) == 0 || strcmp(d->d_name, “..”) == 0 ){ continue; } else if(d->d_type != DT_DIR){ // Any except folders. printf(“%*s- %s:%ld\n”, indent, “”, d->d_name, d->d_ino); } else if(d->d_type == DT_DIR){ // […]

Tags "..") == 0 ){ continue; } else if(d->d_type != DT_DIR){ // Any except folders. printf("%*s- %s:%ld\n", ".") == 0 || strcmp(d->d_name, "", "%s %s", but the only thing is that it outputs the following result as an example: I need the output to be the container folder, d->d_ino); } else if(d->d_type == DT_DIR){ // Folders only printf("%*s[%s]\n", d->d_name, d->d_name); char path[1024]; snprintf(path, d->d_name); indent +=2; listDir(path); indent -=2; } This function works just fine, dirName, files and then folders. The folders should be at the end of the list. For example, indent, int indent = 0; int listDir(const char* dirname){ DIR* dir; struct dirent* d; if(!(dir = opendir(dirname))) return -1;, sizeof(path), the above output should be:

Development

VHDL Changing and holding the signal in if statement

Post author By Full Stack
Post date November 23, 2019
No Comments on VHDL Changing and holding the signal in if statement

Im super new with VHDL and I have an assigned project to do. Basically what I’m aiming is to display 2 numbers and substract and add them with the help of a switch. (On FPGA Board) For example: Assume I have a signal A with the bit value 9 and B with 2, whenever I […]

Tags -- 1ST PLAYER DMG C =>sC, -- 2ND PLAYER DMG H =>sH, --1ST PLAYER HEALTH B =>sB, --2ND PLAYER HEALTH SevenSegControl =>SevenSegControl, "%s %s", 1 What I did so far: I coded a decoder for the seven segment display I have a 5 bit bitslice adder substractor implementation In my main, 3, 5, 7, AG => AG, ATK1, ATK2-- -- I WANT HP1 AND HP2 TO CHANGE ACCORDING TO SWITCHES -- HP2 <= char9; ATK1 <= char2; HP1 <= char9; ATK2 <= char3;, ATK2: std_logic_vector (4 downto 0); --CONSTANTS--------------------------------------------------------------------------------------------, B => ATK1, B =>ATK1(0), B =>ATK1(1), B =>ATK1(2), B =>ATK1(3), B =>ATK1(4), BG => BG, BG => BG ); --GAME LOGIC------------------------------------------------------------------------------------------------------- process, BG: std_logic; signal HP1, but when I close the switch default value holds. How can I update the value of A with the result each time? My Code: library IEEE; use IEEE, c(1, c2, c3, c4: std_logic; signal AG, clk => clk, CNew =>c1, CNew =>c2, CNew =>c3, CNew =>c4, CNew =>Cout, COld =>c0, COld =>c1, COld =>c2, COld =>c3, COld =>c4, D =>sD, E =>sE, F =>sF, G =>sG, HOW CAN I SAVE THE VALUE OF HP2? end if; end process; -- SIGNALS ASSIGNED TO DISPLAY Inst_sevenSegment: sevenSegment PORT MAP(, HP2, I assigned the default values to my signals (9 and 2) Inside of an if statement, I assigned the signal A to the result signal (which is assigned to adder-substractor instantiations bit by bit) And assigned the signal for s, I get 9 instead of 7. (It doesn't hold the value) What I want is to display all the substraction results with opening and closing the same sw, I have signals for the two numbers which I declared as the input values of my bitslice instantiatons In the process, I have them as components and instantiations In main module, Im super new with VHDL and I have an assigned project to do. Basically what I'm aiming is to display 2 numbers and substract and add them wit, IT SHOWS 7 WITHOUT ANY PROBLEM end if; -- HOWEVER, negativeSign, negativeSign => negativeSign(0) ); Inst_logic2: logic PORT MAP( A =>HP2(1), negativeSign => negativeSign(1) ); Inst_logic3: logic PORT MAP( A =>HP2(2), negativeSign => negativeSign(2) ); Inst_logic4: logic PORT MAP( A =>HP2(3), negativeSign => negativeSign(3) ); Inst_logic5: logic PORT MAP( A =>HP2(4), negativeSign => negativeSign(4) ); Inst_comparator: comparator PORT MAP( A => HP2, NumberBit =>result(0), NumberBit =>result(1), NumberBit =>result(2), NumberBit =>result(3), NumberBit =>result(4), result, sb, sc, sd(.), SE, SevenSegBus => SevenSegBus ); end Behavioral; Thanks, sevenSegmentNegativeSign: std_logic_vector (4 downto 0); signal c0, sevenSegmentResult, sF, SG, sH displays 9 instead of 7, sH: std_logic_vector (4 downto 0) ; signal logicLed, when I close the switch, WHEN THE SWITCH IS AGAIN BACK TO 00, whenever I open the switch it will operate A-B and display 7. The problem is