Tag: …

Fibonacci Adder Machine – Calculating Digits in Fibonacci Sequence

Post author By Full Stack
Post date September 21, 2019
No Comments on Fibonacci Adder Machine – Calculating Digits in Fibonacci Sequence

I’m working on a program that will calculate fibonacci numbers with certain digit limitations (i.e. first fibonacci number with 100 digits). The code I have below overall is running, but I am hitting a logical error that has me stumped. The goal of the code is to calculate Fibonacci numbers in a fashion similar to […]

Tags ..., 0, 1, 1] ... but after it hits the [..., 1] loop it moves on to [..., 10, 2, 20, 3, 30, 50, 80, but I am hitting a logical error that has me stumped. The goal of the code is to calculate Fibonacci numbers in a fashion similar to binary, but it gets off between 13 and 21 because of the way the loop is handled. It adds the number sin the 10's place together and then saves a 31, each element is to hold a digit from 0 - 9, I'm working on a program that will calculate fibonacci numbers with certain digit limitations (i.e. first fibonacci number with 100 digits)., len(num2)): carry = num2[len(num2) - count] + num1[len(num1) - count] if carry > 9: num2[len(num2)- (count + 1)], so each array index represents a 10's place. It starts working and looping through fine

Development

base64 encoded image in REST call to tensorflow-serving yeilds Type: Object is not of expected type: uint8

Post author By Full Stack
Post date September 19, 2019
No Comments on base64 encoded image in REST call to tensorflow-serving yeilds Type: Object is not of expected type: uint8

My understanding is that I should be able to grab a TensorFlow model from Google’s AI Hub, deploy it to TensorFlow Serving and use it to make predictions by POSTing images via REST requests using curl. I could not find any bbox predictors on AI Hub at this time but I did find one on […]

Tags -102], -11, -32, -38, -48, ..., .44, .53, .97], "71", "caption": "mountains" } ] } Uncertainties include: should I use "instances" in my JSON should I base64 encode a JPG or PNG or somet, "caption": "seaside" }, "examples": [ { "image": { "b64": "aW1hZ2UgYnl0ZXM=" }, [ "103", [ 75, [[ 87, [109, [132, [56, { "image": { "b64": "YXdlc29tZSBpbWFnZSBieXRlcw==" }, {"b64": "pT4rmN"}, {"b64": "w0KGg2"} ] } I used this image: https://tensorflow.org/images/blogs/serving/cat.jpg and base64 encoded it like so, // Input Tensors in row ("instances") or columnar ("inputs") format. // A request can have either of them but NOT both. "instances": <val, 0, 1, 100, 101, 104, 105, 106]]], 107, 108, 110, 114, 117, 119, 120, 121, 123, 124, 125, 126, 128, 131, 133, 17, 17 Sep 2019 10:47:18 GMT < Content-Length: 85175 < { "error": "Failed to process element: 0 of \'instances\' list. Error: Invalid argument:, 2, 20, 21, 24, 25, 27, 28, 29, 3) name: image_tensor:0 The given SavedModel SignatureDef contains the following output(s): outputs['out'] tensor_info:, 30, 31, 33, 36, 37, 4, 40, 43, 46]]]]} ... it works. The problem is this json file is >11 MB in size. How do I make the base64 encoded version of the json work?, 54, 57, 62, 63, 66, 68, 70], 72, 74, 77, 78, 8, 80, 85, 88, 89, 90, 91, 92, 93, 94, 95, 96, 98, buf = cv2.imencode('.jpg', but the documentation is unclear with respect to exactly what should be included in the JSON of the REST request. My understanding is that, deploy it to TensorFlow Serving and use it to make predictions by POSTing images via REST requests using curl. I could not find any bbox pre, img) jpeg_bytes = base64.b64encode(buf).decode('utf-8') predict_request = '{"instances" : [{"b64": "%s"}]}' % jpeg_bytes But posting thi, My understanding is that I should be able to grab a TensorFlow model from Google's AI Hub, stream=True) dl_request.raise_for_status() # Compose a JSON Predict request (send JPEG image in base64). jpeg_bytes = base64.b64encode, when the json is formated like so ... {'instances': [[[[112, you must Base64 encode the data and encapsulate it in a JSON object having b64 as the key as follows: { "b64": "base64 encoded string" } Yo

Development

How to find the optimal path for a graph with weighted edges using depth first search method?

Post author By Full Stack
Post date September 18, 2019
No Comments on How to find the optimal path for a graph with weighted edges using depth first search method?

I was trying mit 6.0002 problem set 2 and can’t figure out what i am doing wrong in the algorithm to find the shortest path using the depth search method. I have tried unweighted edges and it works fine for that but when i try weighted edges it does not return the shortest path. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-0002-introduction-to-computational-thinking-and-data-science-fall-2016/assignments/ […]

Tags ..., [n_1, [path[0], { path: '', and total distance outdoors. max_dist_outdoors: int Maximum distance spent outdoors on a path best_di, best_dist, best_dist) best_path = new_path return best_path, best_path) if new_path != None: best_dist = path[1] print('best_dist', best_path): """ Finds the shortest path between buildings subject to constraints. Parameters: digraph: Digraph instance, call the function recursively # if the destination node is not already in path # and if the best_dist has not been found yet or it is, end=''), for all 1 <= i < k and the distance of that path. If there exists no path that satisfies max_total_dist and max_dist_outdoor, I was trying mit 6.0002 problem set 2 and can't figure out what i am doing wrong in the algorithm to find the shortest path using the depth s, int, int] Represents the current path of nodes being traversed. Contains a list of node names, max_dist_outdoors, n_2, n_k], path[1], path[2]], start, str(a_node), then return None. """ # TODO # put the first node in the path on each recursion path[0] = path[0] + [start] # if start a, total distance traveled, where there exists an edge from n_i to n_(i+1) in digraph

Development

Get latest file by Version Number file name in a Folder

Post author By Full Stack
Post date September 18, 2019
No Comments on Get latest file by Version Number file name in a Folder

How do I get the highest number file inside a folder like N.2.4.0.12?. The file names are N.2.4.0.1, N.2.4.0.2, …, N.2.4.0.12 (highest number). I have been trying to get it but it is still showing N.2.4.0.10 instead of N.2.4.0.12 var FileInOrdered = allFiles.OrderBy(f => f.Name).Last();

Tags ..., How do I get the highest number file inside a folder like N.2.4.0.12?. The file names are N.2.4.0.1, N.2.4.0.12 (highest number). I have been trying to get it but it is still showing N.2.4.0.10 instead of N.2.4.0.12 var FileInOrdered = allFi, N.2.4.0.2

Development

For each Loop Deployment issue

Post author By Full Stack
Post date September 17, 2019
No Comments on For each Loop Deployment issue

I have a package that need to use for each loop. I have a staging table that has all the months, I want to loop through every month (Jan, Feb, Mar, …, Dec) and load the data into the real table. So I have use execute SQL task to query all the column names of […]

Tags ..., and save it to "ListMonth" (type:Object). Then I loop through each column name by ADO Enumerator - and here the problem appear: I can loop th, but it raise the error that the "ListMonth" is null and it does not contain enumerator object Please note that when running them in VS 2019, but when I deploy it to Integration service, Dec) and load the data into the real table. So I have use execute SQL task to query all the column names of the staging table, Feb, I do not know why the problem still occurs. I have already tried to make a script task to initialize an array of Month and loop through that, I have a package that need to use for each loop. I have a staging table that has all the months, I want to loop through every month (Jan, it keeps raising the errors: "Variable User::ListMonth" does not contain a valid data object. Does anyone know the solution to the problem?, Mar

Development

How to collect numbers in ascending order with minimal number of rounds?

Post author By Full Stack
Post date September 16, 2019
No Comments on How to collect numbers in ascending order with minimal number of rounds?

Has someone an idea how to solve the following problem? Take the numbers 1,…,100000 and permute them in some way. At first you can make a swap of two numbers. Then you have to compute how many rounds it would take to collect numbers in ascending order. You have to collect numbers by every round […]

Tags -23, ..., 1, 10, 100000 and permute them in some way. At first you can make a swap of two numbers. Then you have to compute how many rounds it would take to c, 2, 3, 4, 4 and finally 5. But you can do one swap in three different ways to collect numbers in two rounds, 5, 5 Five number sequence can be solved easily by brute force and I found an algorithm to collect 1000 numbers, 6, 7, 8]. You can swap 4 and 9 to collect numbers in three rounds. But my code returns that there are 3 ways to make a swap. Where is my mistake?, 8]] case = 1 ways_to_change = len(longest_subsequence(lines[case], 9, bisect_right from functools import cmp_to_key def longest_subsequence(seq, but 100000 numbers needs maybe some kind of trick to compute fast how a specific swap at the beginning affects how many rounds it takes to co, computerounds(lines[case]), Has someone an idea how to solve the following problem? Take the numbers 1, i, if numbers are from one to five and those at the beginning in order 3, index=False): bisect = bisect_left if mode.startswith('strict') else bisect_right # compute keys for comparison just once rank = seq, index=False)) print(len(lines[case]), key=None, len(seq)): # seq[i] can extend a subsequence that ends with a lesser (or equal) element j = bisect([rank[k] for k in lastoflength], mode='strictly', namely 3, on the second round 3, order='decreasing', order='increasing', p(i), p(p(i)), rank) rank = list(rank) if not rank: return [] lastoflength = [0] # end position of subsequence with given length predecessor = [No, rank[i]) # update existing subsequence of length j or extend the longest try: lastoflength[j] = i except: lastoflength.append(i), seq) if order == 'decreasing': rank = map(cmp_to_key(lambda x, then you can collect them in three rounds: On first round you collect 1, ways_to_change) # Should return 10 3 1 My effort: I guess the hardest part is to find a permutation that guarantees you collect the num, where n=len(lastoflength)-1 def trace(i): if i is not None: yield from trace(predecessor[i]) yield i indices = trace(last, y: 1 if x<y else 0 if x==y else -1)

Development

How to run several scripts in differents folders on python

Post author By Full Stack
Post date September 16, 2019
No Comments on How to run several scripts in differents folders on python

I have to run a lot of scripts for paper, and I would like to make this automatic. I have several folders (P1, P2,…, PN) in wich I have a script ( test1, test2, … testN) and I need to run all this, but doing on by one by myself I wast a lot of […]

Tags ..., ... testN) and I need to run all this, @p2, and I would like to make this automatic. I have several folders (P1, but doing on by one by myself I wast a lot of time that I don't have! Could someone help me? I tried subprocess: where P1_T1 is: for i i, I have to run a lot of scripts for paper, PN) in wich I have a script ( test1, test2

Development

Keras: Create a custom generator for two input model using flow_from _directory() function

Post author By Full Stack
Post date September 15, 2019
No Comments on Keras: Create a custom generator for two input model using flow_from _directory() function

I was trying to train my siamese network with fit_generator(),I learned from this answer: Keras: How to use fit_generator with multiple inputs that the best way to do this was to create your own generator that yield the multiple data points, my problem was that I retrieve my data with flow_from_directory() function and I didn’t […]

Tags ..., [0.14117648, [0.14509805, 0.15294118, 0.15686275, 0.16862746... What am I doing wrong?, 0.16862746], 150, batch_size = 20, but instead got the following list of 1 arrays: [array([[[[0.14509805, class_mode = 'categorical', d2[0]] model.compile(loss = 'categorical_crossentropy', epochs = 5) My code give me the exact same error as when I tried to fit my model without the custom generator: ValueError: Error when check, I learned from this answer: Keras: How to use fit_generator with multiple inputs that the best way to do this was to create your own generato, I was trying to train my siamese network with fit_generator(), metrics=['acc']) history = model.fit_generator(generator(), my problem was that I retrieve my data with flow_from_directory() function and I didn't know if that was possible. This is my attempt to rea, optimizer= optimizers.RMSprop(lr=2e-5), shuffle = True) t2 = train_datagen.flow_from_directory(base_dir, shuffle = True) while True: d1 = t1.next() d2 = t2.next() yield [d1[0], steps_per_epoch = 10, target_size = (150

Development

With pairwise summation, how many terms do I need to get an appreciably wrong result?

Post author By Full Stack
Post date September 15, 2019
No Comments on With pairwise summation, how many terms do I need to get an appreciably wrong result?

Using a given species of fp numbers, say float16, it is straight forward to construct sums with totally wrong results. For example, using python/numpy: import numpy as np one = np.float16(1) ope = np.nextafter(one,one+one) np.array((ope,one,-one,-one)).cumsum() # array([1.001, 2. , 1. , 0. ], dtype=float16) Here we have used cumsum to force naive summation. Left to […]

Tags -one)).cumsum() # array([1.001, -one)).sum() # 0.000977 The above is based on cancellation. To rule out this class of examples, ..., ('one', 1, 10**-4, 15x0, 2, 2.0e-04, 2.5e-01, 3.0e-04, 3x0, 7x0, allowing numpy to use pairwise summation gives a much better result: np.full(10**4, but this involves an insane number of terms. My question: Using float16 and only non negative terms, dtype=float16) Here we have used cumsum to force naive summation. Left to its own devices numpy would have used a different order of summati, dtype=float16) The last term is off by a factor of 4. Again, EPS, how many terms are required to obtain from pairwise summation a result that is off by at least a factor of 2. Bonus: Same question with "pos, it is straight forward to construct sums with totally wrong results. For example, let us only allow non negative terms. For naive summation it is still easy to give examples with very wrong sums. The following sums 10^4 ide, np.float16).cumsum() # array([1.0e-04, np.float16).sum() # 1.0 It is possible to construct sums that beat pairwise summation. Choosing eps below resolution at 1 we can use 1, one+one) np.array((ope, say float16, Using a given species of fp numbers, using python/numpy: import numpy as np one = np.float16(1) ope = np.nextafter(one, yielding a better answer: np.array((ope

Development

Combination of connected paths of 0 to (k-1) to build path of k

Post author By Full Stack
Post date September 14, 2019
No Comments on Combination of connected paths of 0 to (k-1) to build path of k

Suppose there is a polygon of 6 vertices. I have to build an array of paths of progressive distances. The attached image is an example. Background: Polygon vertices are 0,1,2,3,4,5. A path from 1 to 4 will have vertices 1,2,3,4. I need to generate different combinations of this path. For example, (1,2,3) + (4) or […]

Tags -23, ..., 0). I increase this distance to 3 and then generate (0, 1, 1). While generating a path, 2, 2) and (3) which are generated previously. I tried developing the algorithm. Tried looking online for something closer. But no luck! The in, 3, 3) + (4) or (1, 3) or (3, 4, 4. I need to generate different combinations of this path. For example, 4) + (5). Because (2, 4) is in the middle of (1) and (5). We don't want to consider (1, 4) One such example is given in the image on the link below. I start by covering 1 vertex, 4). To reach any vertex, 5, 5. A path from 1 to 4 will have vertices 1, ex. (1, I get the paths of distance 2 as: (0, I use the path (1, if we consider (2, only possible combination of path is (1) + (2, Suppose there is a polygon of 6 vertices. I have to build an array of paths of progressive distances. The attached image is an example. Back, then 1 edge, then 2 edges, then 3 and so on. This is the path distance. I repeat it with the same path distance on all the vertices. So if path distance is 2, we need to visit all the vertices in between.