Tag: H

Replace specific character matches in all rows, using the first line as a reference

Post author By Linux Questions
Post date March 30, 2020
No Comments on Replace specific character matches in all rows, using the first line as a reference

H, I want to replace specific character matches (.) in all rows, using the first line as a reference My attempt at re-hashing an answer I got to a different question: awk -F’|’ ‘BEGIN{OFS=FS} NR==1 {for(i=1;i<=NF;i++) a[$i] } NR>1 {for(i in a) if( $i == “\.” ) $i=”a”}1’ …the idea of the re-work I tried […]

Tags and then when seeing a '.' in rows>1 changing the '.' to the corresponding column character stored in 'a'. But its not worked. Input: A|N|G, H, I want to replace specific character matches (.) in all rows, using the first line as a reference My attempt at re-hashing an answer I got to a different question: awk -F'|' 'BEGIN{OFS=FS} NR==1 {for(i

Bitcoin Cryptocurrency Mastering Development

How to construct and redeem a bip199 htlc with python-bitcoinlib

Post author By Crypto Questions
Post date March 29, 2020
No Comments on How to construct and redeem a bip199 htlc with python-bitcoinlib

Playing with this script, I’d like to understand how to construct a bip199 htlc and redeem it, however this script fails on the OP_EQUALVERIFY and I can’t seem to understand why. import bitcoin import bitcoin.rpc from bitcoin import SelectParams from bitcoin.core import b2x, lx, b2lx, COIN, COutPoint, CMutableTxOut, CMutableTxIn, CMutableTransaction, Hash160 from bitcoin.core.script import CScript, […]

Tags 'lx', 'utf8') h = sha256(preimage).digest() recipientpubkey = proxy.getnewaddress() senderpubkey = proxy.getnewaddress() seckey = proxy.dumpprivke, (SCRIPT_VERIFY_P2SH, )) txid = proxy.sendrawtransaction(tx), [txout]) sighash = SignatureHash(txin_redeemScript, 0, amount) txinfo = proxy.gettransaction(fund_tx) details = txinfo['details'][0] vout = details['vout'] txin = CMutableTxIn(COutPoint(fund_tx, b2lx, bytes(Hash160(seckey.pub)), CBitcoinSecret import hashlib from hashlib import sha256 SelectParams('regtest') proxy = bitcoin.rpc.Proxy() preimage = bytes(b'preimage'., CMutableTransaction, CMutableTxIn, CMutableTxOut, COIN, COutPoint, H, Hash160 from bitcoin.core.script import CScript, however this script fails on the OP_EQUALVERIFY and I can't seem to understand why. import bitcoin import bitcoin.rpc from bitcoin import Se, I'd like to understand how to construct a bip199 htlc and redeem it, OP_CHECKLOCKTIMEVERIFY, OP_CHECKSIG, OP_CHECKSIG ]) txin_scriptPubKey = txin_redeemScript.to_p2sh_scriptPubKey() txin_p2sh_address = CBitcoinAddress.from_scriptPubKey, OP_DROP, OP_DUP, OP_ELSE, OP_ENDIF, OP_EQUALVERIFY, OP_HASH160, OP_IF, OP_SHA256, OP_TRUE from bitcoin.core.scripteval import VerifyScript, Playing with this script, preimage, recipientpubkey, recipientpubkey.to_scriptPubKey()) tx = CMutableTransaction([txin], redeemblocknum, SCRIPT_VERIFY_P2SH from bitcoin.wallet import CBitcoinAddress, seckey.pub, SIGHASH_ALL from bitcoin.core.script import OP_DROP, SIGHASH_ALL) sig = seckey.sign(sighash) + bytes([SIGHASH_ALL]) txin.scriptSig = CScript([sig, SignatureHash, tx, txin_redeemScript]) VerifyScript(txin.scriptSig, txin_scriptPubKey, vout)) default_fee = 0.001*COIN txout = CMutableTxOut(amount - default_fee

Mastering Development

Black image output only when using Flask

Post author By Full Stack
Post date March 28, 2020
No Comments on Black image output only when using Flask

I have a main app.py script that calls the neuralStyleProcess.py script but it always outputs a completely black image. I’ve tested the neuralStyleProcess.py script by itself and it works fine. The problem only arises when I’m running on development server (when using app.py to call neuralStyleProcess.py). Here’s my codes: For app.py: # Import required packages: […]

Tags 'bbq.jpg') running python neuralStyleProcess.py worked fine and output the correct img (i uncommented the imshow part to test for this). The, 'images/') #newImg = test.printTest(directoryName, 'images/') print("TARGET", 'models/') net = cv2.dnn.readNetFromTorch(target + 'triangle_style_1000.t7') # load the input image, "w", (103.939, 0) ''' # show information on how long inference took print("[INFO] neural style transfer took {:.4f} seconds".format( en, 1 0, 116.779, 123.680), 2, add back in the mean subtraction, and # then grab the image dimensions image = cv2.imread(directoryName+filename) image = imutils.resize(image, and # then swap the channel ordering output = output.reshape((3, and then perform a # forward pass of the network blob = cv2.dnn.blobFromImage(image, crop=False) net.setInput(blob) #start = time.time() output = net.forward() #end = time.time() # reshape the output tens, debug=True) For neuralStyleProcess.py: import imutils import cv2 import os APP_ROOT = os.path.dirname(os.path.abspath(__file__)) def neur, destination) file.save(destination) myFiles.append(filename) print(myFiles) return render_template("complete.html", file_extension = os.path.splitext(filename) print(filename) newFileName = 'processedImg'+ '_' + filename + file_extension print(n, file) filename = file.filename print("filename", filename) destination = "".join([target, filename) newImg = neuralStyleProcess.neuralStyleTransfer(directoryName, filename) print(filename) print(newImg) return send_from_directory("images", filename): print("style transfer script called") # load the neural style transfer model from disk print("[INFO] loading style tr, filename]) print("destination", filename1) @app.route('/upload/') def send_processed_image(filename): print("@@@@@@@@###########") print("TEST SCRIPT CALL, H, I have a main app.py script that calls the neuralStyleProcess.py script but it always outputs a completely black image. I've tested the neura, image_names=myFiles) # in this function send_image will HAVE to take in the parameter name @app.route('/complete/') de, image) cv2.imshow("Output", methods=['POST']) def upload(): target = os.path.join(APP_ROOT, newImg) #good practise to have this: this means this will only run if its run directly (and not called from somewhere else) if __name__ == ", output.shape[2], output.shape[3])) output[0] += 103.939 output[1] += 116.779 output[2] += 123.680 output /= 255.0 output = output.transpos, output) cv2.waitKey(0) ''' filename, output) return newFileName if __name__=='__main__': neuralStyleTransfer('/Users/fangran/Documents/pyFlaskCV/images/', redirect import os import test import neuralStyleProcess import time app = Flask(__name__) APP_ROOT = os.path.dirname(os.path.abspath(__fil, render_template, request, resize it to have a width of 600 pixels, send_from_directory, set the input, swapRB=False, target) if not os.path.isdir(target): os.mkdir(target) else: print("Couldn't create upload directory: {}".format(tar, upload.html: Upload File Uploader, w) = image.shape[:2] # construct a blob from the image, width=600) (h

Ask Mathematics

Find the minimizer $u$ of a functional whose derivate contains both $u$ and the sign of $u$

Post author By Q+A Expert
Post date March 27, 2020
No Comments on Find the minimizer $u$ of a functional whose derivate contains both $u$ and the sign of $u$

Let $N,h,\gamma,\bar x$ be constants and $x_i\in[-1,1],\forall i=\overline{1,N}$. Consider the following problem $$ \min_u J(u^n) \quad\text{subject to}\quad x_i^{n+1} = x_i^n+hu^n $$ where $$ J(u^n) = \frac{1}{2N}\sum_{i=1}^N |x_i^{n+1}-\bar x|^2+h\gamma|u^n| $$ Consider the problem on a single time interval $[t^n,t^{n+1}]$ and plug the expression for $x_i^{n+1}$ inside $J$ $$ J(u^n) = \frac{1}{2N}\sum_i|x_i^n+hu^n-\bar x|^2+h\gamma|u^n| $$ Derive wrt $u$ […]

Tags \bar x$ be constants and $x_i\in[-1, \text{sgn}(u^n) \\ &= \frac 1N \sum_i(x_i^n-\bar x)+hu^n+\gamma\, \text{sgn}(u^n) \end{align} By posing $J'(u)=0$ we should be able to find the $u$ minimizing $J$, $\forall i=\overline{1, 1, but how can we isolate it if we have both $u$ and $\text{sgn}(u)$ appearing? I'd say that we have to discuss separately the two cases $u$ po, but I am a bit confused about how we can find an expression for $u$, but in order to compute the formula we have to know the sign of $u$, gamma, H, if we don't know a priori when $u$ is positive or negative. I mean, in one of the two cases, in order to know the sign of $u$, Let $n, N}$. Consider the following problem $$ \min_u J(u^n) \quad\text{subject to}\quad x_i^{n+1} = x_i^n+hu^n $$ where $$ J(u^n) = \frac{1}{2N}\sum, so it seems like we can't do anything. $u^n>0$ $$ u^n = \frac {1}{hN} \sum_i(\bar x-x_i^n)-\frac{\gamma}{h} $$ $u^n<0$ $$ u^n = \frac {1}{hN, t^{n+1}]$ and plug the expression for $x_i^{n+1}$ inside $J$ $$ J(u^n) = \frac{1}{2N}\sum_i|x_i^n+hu^n-\bar x|^2+h\gamma|u^n| $$ Derive wrt $, we have to compute the formula for $u$

Ask Mathematics

How to find the minimizer u of a functional whose derivate contains both u and the sign of u?

Post author By Q+A Expert
Post date March 27, 2020
No Comments on How to find the minimizer u of a functional whose derivate contains both u and the sign of u?

Let $N,h,\gamma,\bar x$ be constants and $x_i\in[-1,1],\forall i=\overline{1,N}$. Consider the following problem $$ \min_u J(u^n) \quad\text{subject to}\quad x_i^{n+1} = x_i^n+hu^n $$ where $$ J(u^n) = \frac{1}{2N}\sum_{i=1}^N |x_i^{n+1}(u)-\bar x|^2+h\gamma|u^n| $$ Consider the problem on a single time interval $[t^n,t^{n+1}]$ and plug the expression for $x_i^{n+1}$ inside $J$ $$ J(u^n) = \frac{1}{2N}\sum_i|x_i^n+hu^n-\bar x|^2+h\gamma|u^n| $$ Derive wrt $u$ […]

Tags \bar x$ be constants and $x_i\in[-1, \text{sgn}(u^n) \\ &= \frac hN \sum_i(x_i^n-\bar x)+h^2u^n+h\gamma\, \text{sgn}(u^n) \end{align} By posing $J'(u)=0$ we should be able to find the $u$ minimizing $J$, $\forall i=\overline{1, 1, but how can we isolate it if we have both $u$ and $\text{sgn}(u)$ appearing? I'd say that we have to discuss separately the two cases $u$ po, but I am a bit confused about how we can find an expression for $u$, but in order to compute the formula we have to know the sign of $u$, gamma, H, if we don't know a priori when $u$ is positive or negative. I mean, in one of the two cases, in order to know the sign of $u$, Let $n, N}$. Consider the following problem $$ \min_u J(u^n) \quad\text{subject to}\quad x_i^{n+1} = x_i^n+hu^n $$ where $$ J(u^n) = \frac{1}{2N}\sum, so it seems like we can't do anything., t^{n+1}]$ and plug the expression for $x_i^{n+1}$ inside $J$ $$ J(u^n) = \frac{1}{2N}\sum_i|x_i^n+hu^n-\bar x|^2+h\gamma|u^n| $$ Derive wrt $, we have to compute the formula for $u$

Mastering Development

Inconsistent pool.map behavior

Post author By Full Stack
Post date March 27, 2020
No Comments on Inconsistent pool.map behavior

I’m testing a really simple worker pool using python using this code: from multiprocessing import Pool from itertools import cycle def do_stuff(work): core = work[0] inp = work[1] print(‘Running: “{}” “{}”‘.format(core, inp)) def main(): num_cores = 4 jobs = [‘a’, ‘b’, ‘c’, ‘d’, ‘e’, ‘f’, ‘g’, ‘h’] with Pool(num_cores) as pool: work = list(zip(cycle(range(0, num_cores)), […]

Tags 'h'] with Pool(num_cores) as pool: work = list(zip(cycle(range(0, 'm'] I get: Running: "0" "a" Running: "2" "c" Running: "0" "e" Running: "2" "g" Running: "1" "b" Running: "3" "d" Running: "1" "f" Running:, $m, a, B, c--, d, e, f: '' }, g, H, i, I'm testing a really simple worker pool using python using this code: from multiprocessing import Pool from itertools import cycle def do_s, inp)) def main(): num_cores = 4 jobs = ['a', it does what I expect it to do (Round Robin on the first column): Running: "0" "a" Running: "1" "b" Running: "2" "c" Running: "3" "d" Runnin, it starts distributing the job almost arbitrarily. E.g. for: jobs = ['a', j, jobs)) pool.map(do_stuff, K, L)?, n, num_cores)), work) if __name__ == "__main__": main() When the jobs array size is less than 16

Ask Mathematics

Qustion on the center of universal enveloping algebra

Post author By Math Problems
Post date March 26, 2020
No Comments on Qustion on the center of universal enveloping algebra

Let $h \subset g$ be reductive algebra and $U(h),U(g)$ their universal enveloping algebra. Let $Z(h)$ and $Z(g)$ be the center of $U(h),U(g)$. I know that $U(h)$ is a subalgebra of $U(g)$. I am wondering whether $Z(h)$ is subalgebra of $Z(g)$. If it is not true in general, is there a sufficient condition to guarantee this? […]

Tags g$ are Lie algebras of two unitary groups $U(m)$ and $U(n)$ where $m \le n.$) If there is no such inclusion relation, H, is there a sufficient condition to guarantee this? (In my case, is there any relation between them? Any comments will be highly appreciated!, Let $h \subset g$ be reductive algebra and $U(h), U(g)$ their universal enveloping algebra. Let $Z(h)$ and $Z(g)$ be the center of $U(h), U(g)$. I know that $U(h)$ is a subalgebra of $U(g)$. I am wondering whether $Z(h)$ is subalgebra of $Z(g)$. If it is not true in general

User Help

Find Non-Matching Values Between Multiple Ranges

Post author By How To
Post date March 26, 2020
No Comments on Find Non-Matching Values Between Multiple Ranges

I am looking to see if there is a formula only (no VBA) way to find the values in a list of constants that are not in a range; and can be dynamically adjusted for different lengths of lists and with different column counts. Such as: Table 1 is a 3×2, Table 2 is 4×9, […]

Tags B, c--, d, e, f: '' }, g, H, i, I am looking to see if there is a formula only (no VBA) way to find the values in a list of constants that are not in a range; and can be dyn, Table 2 is 4x9, Table 3 is 6x8. The list of constants will always be the same length as the table they are for. The list of constants {"A"

User Help

Find Non-Matching Values Between Multiple Ranges

Post author By How To
Post date March 25, 2020
No Comments on Find Non-Matching Values Between Multiple Ranges

Tags "J"}. Column 1 Column 2 Column 3 A J C B G E I *Blank Row* *Blank Row* *Blank Row* *Blank Row* *Blank Row* *Blank, B, c--, Column 3 would look like: Column 3 D F H *Blank Row* *Blank Row* *Blank Row* *Blank Row* *Blank Row* *Blank Row* *Blank Row*, d, e, f: '' }, g, H, i, I am looking to see if there is a formula only (no VBA) way to find the values in a list of constants that are not in a range; and can be dyn, Table 2 is 4x9, Table 3 is 6x8. The list of constants will always be the same length as the table they are for. The list of constants {"A"

Mastering Development

Fortran Error: Rank mismatch in array reference (2/1)

Post author By Full Stack
Post date March 24, 2020
No Comments on Fortran Error: Rank mismatch in array reference (2/1)

i am looking for your help on this where i kept on getting an error at variables in do loops: Rank mismatch in array reference (2/1). I am new at Fortran and still couldnt completely understand creating two dimensional array and that is where i got the error. I am basically trying to create 2000×25000 […]

Tags -1 if (i==Nx) then hf(i, -1 if (i==Nx) then hh(i, '-bf', 'H:H', "w", 1, 25000, a, Af, Ah, B, bh, C and its derivatives. Any help would be highly appreciated. program HW5 implicit none real::g, C real, CF integer::matrix(2000, Cf_, ch, cycl, deltat, deltax, dimension(2000)::x, dimension(25000)::t, H, h_, h=0, HF, i, i am looking for your help on this where i kept on getting an error at variables in do loops: Rank mismatch in array reference (2/1). I am ne, j, j !two dimensional real array real, j) & B(i, j) BH(i, j)-((deltat/(2*deltax))*(A(i+1, j)-((deltat/(2*deltax))*(AH(i+1, j)-((deltat/(deltax))*(AH(i+1, j)-(deltat/(2*deltax))*(B(i, j)-(deltat/(2*deltax))*(BH(i+1, j)-(deltat/(deltax))*(BH(i, j)-AH(i-1, j)-B(i-1, j)-BH(i-1, j)) AH(i, j))-(deltat*C(i, j))-(deltat*CH(i, j))-(deltat/(4*deltax))*(A(i+1, j))-(deltat/(4*deltax))*(B(i+1, j))) AF(i, j))) uF(i, j))) uH(i, j)))/(2*W) else hh(i, j)))/(2*W) elseif (i==1) then hh(i, j)))/(2*W) end do end do do j=1, j)))/(2*W) end if end do end do do j=1, j))*(W+2*h(i, j))*(W+2*hh(i, j))**2)/2 C(i, j))**2)+(g*(h(i, j)**2)/2 CH(i, j)**2+(g*hh(i, j)*abs(u(i, j)*abs(uH(i, j)*h(i, j)*uH(i, j)/2) uF(i, j)/2) uH(i, j)/hh(i, j)+h(i-1, j)=(Cf_*abs(uH(i, j)=(Cf_*u(i, j)=(Cf_*uH(i, j)=0.5*(A(i+1, j)=0.5*(h(i+1, j)=AH(i, j)=h0 u(i, j)=h0+(H_/2)*sin(2*pi*tmid(j)/T_) AH(i, j)=hh(i, j)=u(i, j)=V0 A(i, j]) a[i, j]) a[i-1, j+1) BF(i, j+1)))/(2*W) else hf(i, j+1)))/(2*W) elseif (i==1) then hf(i, j+1)))/(2*W) end if end do end do end program HW5, j+1))*(W+2*hf(i, j+1)**2)/2 CF(i, j+1)**2+(g*hf(i, j+1)*abs(uF(i, j+1)*uF(i, j+1)/hf(i, j+1)=(Cf_*uF(i, j+1)=A(i, j+1)=AF(i, j+1)=h0+(H_/2)*sin(2*pi*tmid(j+1)/T) AF(i, j+1)=hf(i, j+1)=hh(i, ja[i - 1], ja[i], L)?, N*T, Nt !integer::i, Nt do i=1, Nt-1 do i=Nx, Nt-1 t(j+1)=t(j)+deltat tmid(j)=t(j)+deltat/2 end do do j=1, nx, Nx h(i, Nx real, Nx-1 x(i+1)=x(i)+deltax xmid(i)=x(i)+deltax/2 end do t(1)=0 do j=1, parameter::pi=4*atan(1.0) g=9.81 !gravitational acceleration W=1 !channel width L=20 !channel length h0=12 !initial water depth V0=0 !in, t_, tmid, U, u'F', uh, v[0], xmid