Project 1: Search in Pacman
Table of Contents
All those colored walls,
Mazes give Pacman the blues,
So teach him to search.
Introduction
In this project, your Pacman agent will find paths through his maze world, both to reach a particular location and to collect food efficiently. You will build general search algorithms and apply them to Pacman scenarios.
The code for this project consists of several Python files, some of which you will need to read and understand in order to complete the assignment, and some of which you can ignore.
| Files you'll edit: | |
search.py |
|
searchAgents.py |
Where all of your search-based agents will reside. |
| Files you might want to look at: | |
pacman.py |
The main file that runs Pacman games. This file describes a Pacman GameState type, which you use in this project. |
game.py |
The logic behind how the Pacman world works. This file describes several supporting types like AgentState, Agent, Direction, and Grid. |
util.py |
Useful data structures for implementing search algorithms. |
| Supporting files you can ignore: | |
graphicsDisplay.py |
Graphics for Pacman |
graphicsUtils.py |
Support for Pacman graphics |
textDisplay.py |
ASCII graphics for Pacman |
ghostAgents.py |
Agents to control ghosts |
keyboardAgents.py |
Keyboard interfaces to control Pacman |
layout.py |
Code for reading layout files and storing their contents |
Deadline: 2019 / 10 / 16
Files to Edit and Submit: You need implement 7 questions by filling in portions of search.py
and searchAgents.py
during the assignment. You should submit these two files only. Pack these files and upload it to Ceiba. Please do not change the other files in this distribution or submit any of our original files other than these files.
Evaluation: Your code will be autograded for technical correctness. Please do not change the names of any provided functions or classes within the code, or you will wreak havoc on the autograder. However, the correctness of your implementation -- not the autograder's judgements -- will be the final judge of your score. If necessary, we will review and grade assignments individually to ensure that you receive due credit for your work.
Academic Dishonesty: We may be checking your code against other submissions in the class for logical redundancy. If you copy someone else's code and submit it with minor changes, we may know. We trust you all to submit your own work only; please don't let us down. If you do, we will pursue the strongest consequences available to us.
Getting Help: You are not alone! If you find yourself stuck on something, contact the TA for help. Office hours, section, and the discussion forum are there for your support; please use them. We want these projects to be rewarding and instructional, not frustrating and demoralizing. But, we don't know when or how to help unless you ask. One more piece of advice: if you don't know what a variable does or what kind of values it takes, print it out.
Discussion: Please be careful not to post spoilers.
Welcome to Pacman
After downloading the code, unzipping it, and changing to the directory, you should be able to play a game of Pacman by typing the following at the command line:
python pacman.py
Note: if you get error messages regarding Tkinter, see this page.
Pacman lives in a shiny blue world of twisting corridors and tasty round treats. Navigating this world efficiently will be Pacman's first step in mastering his domain.
The simplest agent in searchAgents.py
is called the GoWestAgent
, which always goes West (a trivial reflex agent). This agent can occasionally win:
python pacman.py --layout testMaze --pacman GoWestAgent
But, things get ugly for this agent when turning is required:
python pacman.py --layout tinyMaze --pacman GoWestAgent
If Pacman gets stuck, you can exit the game by typing CTRL-c into your terminal.
Soon, your agent will solve not only tinyMaze
, but any maze you want.
Note that pacman.py
supports a number of options that can each be expressed in a long way (e.g., --layout
) or a short way (e.g., -l
). You can see the list of all options and their default values via:
python pacman.py -h
Also, all of the commands that appear in this project also appear in commands.txt
, for easy copying and pasting. In UNIX/Mac OS X, you can even run all these commands in order with bash commands.txt
.
Question 1 (1 points): Finding a Fixed Food Dot using Depth First Search
In searchAgents.py
, you'll find a fully implemented SearchAgent
, which plans out a path through Pacman's world and then executes that path step-by-step. The search algorithms for formulating a plan are not implemented -- that's your job. As you work through the following questions, you might find it useful to refer to the object glossary (the second to last tab in the navigation bar above).
First, test that the SearchAgent
is working correctly by running:
python pacman.py -l tinyMaze -p SearchAgent -a fn=tinyMazeSearch
The command above tells the SearchAgent
to use tinyMazeSearch
as its search algorithm, which is implemented in search.py
. Pacman should navigate the maze successfully.
Now it's time to write full-fledged generic search functions to help Pacman plan routes! Pseudocode for the search algorithms you'll write can be found in the lecture slides. Remember that a search node must contain not only a state but also the information necessary to reconstruct the path (plan) which gets to that state.
Important note: All of your search functions need to return a list of actions that will lead the agent from the start to the goal. These actions all have to be legal moves (valid directions, no moving through walls).
Important note: Make sure to use the Stack
, Queue
and PriorityQueue
data structures provided to you in util.py
! These data structure implementations have particular properties which are required for compatibility with the autograder.
Hint: Each algorithm is very similar. Algorithms for DFS, BFS, UCS, and A* differ only in the details of how the fringe is managed. So, concentrate on getting DFS right and the rest should be relatively straightforward. Indeed, one possible implementation requires only a single generic search method which is configured with an algorithm-specific queuing strategy. (Your implementation need not be of this form to receive full credit).
Implement the depth-first search (DFS) algorithm in the depthFirstSearch
function in search.py
. To make your algorithm complete, write the graph search version of DFS, which avoids expanding any already visited states.
Your code should quickly find a solution for:
python pacman.py -l tinyMaze -p SearchAgent
python pacman.py -l mediumMaze -p SearchAgent
python pacman.py -l bigMaze -z .5 -p SearchAgent
The Pacman board will show an overlay of the states explored, and the order in which they were explored (brighter red means earlier exploration). Is the exploration order what you would have expected? Does Pacman actually go to all the explored squares on his way to the goal?
Hint: If you use a Stack
as your data structure, the solution found by your DFS algorithm for mediumMaze
should have a length of 130 (provided you push successors onto the fringe in the order provided by getSuccessors; you might get 246 if you push them in the reverse order). Is this a least cost solution? If not, think about what depth-first search is doing wrong.
Question 2 (1 points): Breadth First Search
Implement the breadth-first search (BFS) algorithm in the breadthFirstSearch
function in search.py
. Again, write a graph search algorithm that avoids expanding any already visited states. Test your code the same way you did for depth-first search.
python pacman.py -l mediumMaze -p SearchAgent -a fn=bfs
python pacman.py -l bigMaze -p SearchAgent -a fn=bfs -z .5
Does BFS find a least cost solution? If not, check your implementation.
Hint: If Pacman moves too slowly for you, try the option --frameTime 0
.
Note: If you've written your search code generically, your code should work equally well for the eight-puzzle search problem without any changes.
python eightpuzzle.py
Question 3 (1 points): Varying the Cost Function
While BFS will find a fewest-actions path to the goal, we might want to find paths that are "best" in other senses. Consider mediumDottedMaze
and mediumScaryMaze
.
By changing the cost function, we can encourage Pacman to find different paths. For example, we can charge more for dangerous steps in ghost-ridden areas or less for steps in food-rich areas, and a rational Pacman agent should adjust its behavior in response.
Implement the uniform-cost graph search algorithm in the uniformCostSearch
function in search.py
. We encourage you to look through util.py
for some data structures that may be useful in your implementation. You should now observe successful behavior in all three of the following layouts, where the agents below are all UCS agents that differ only in the cost function they use (the agents and cost functions are written for you):
python pacman.py -l mediumMaze -p SearchAgent -a fn=ucs
python pacman.py -l mediumDottedMaze -p StayEastSearchAgent
python pacman.py -l mediumScaryMaze -p StayWestSearchAgent
Note: You should get very low and very high path costs for the StayEastSearchAgent
and StayWestSearchAgent
respectively, due to their exponential cost functions (see searchAgents.py
for details).
Question 4 (1 points): A* search
Implement A* graph search in the empty function aStarSearch
in search.py
. A* takes a heuristic function as an argument. Heuristics take two arguments: a state in the search problem (the main argument), and the problem itself (for reference information). The nullHeuristic
heuristic function in search.py
is a trivial example.
You can test your A* implementation on the original problem of finding a path through a maze to a fixed position using the Manhattan distance heuristic (implemented already as manhattanHeuristic
in searchAgents.py
).
python pacman.py -l bigMaze -z .5 -p SearchAgent -a fn=astar,heuristic=manhattanHeuristic
You should see that A* finds the optimal solution slightly faster than uniform cost search (about 549 vs. 620 search nodes expanded in our implementation, but ties in priority may make your numbers differ slightly). What happens on openMaze
for the various search strategies?
Question 5 (1 points): Finding All the Corners
The real power of A* will only be apparent with a more challenging search problem. Now, it's time to formulate a new problem and design a heuristic for it.
In corner mazes, there are four dots, one in each corner. Our new search problem is to find the shortest path through the maze that touches all four corners (whether the maze actually has food there or not). Note that for some mazes like tinyCorners
, the shortest path does not always go to the closest food first! Hint: the shortest path through tinyCorners
takes 28 steps.
Note: Make sure to complete Question 2 before working on Question 5, because Question 5 builds upon your answer for Question 2.
Implement the CornersProblem
search problem in searchAgents.py
. You will need to choose a state representation that encodes all the information necessary to detect whether all four corners have been reached. Now, your search agent should solve:
python pacman.py -l tinyCorners -p SearchAgent -a fn=bfs,prob=CornersProblem
python pacman.py -l mediumCorners -p SearchAgent -a fn=bfs,prob=CornersProblem
To receive full credit, you need to define an abstract state representation that does not encode irrelevant information (like the position of ghosts, where extra food is, etc.). In particular, do not use a Pacman GameState
as a search state. Your code will be very, very slow if you do (and also wrong).
Hint: The only parts of the game state you need to reference in your implementation are the starting Pacman position and the location of the four corners.
Our implementation of breadthFirstSearch
expands just under 2000 search nodes on mediumCorners
. However, heuristics (used with A* search) can reduce the amount of searching required.
Question 6 (2 points): Corners Problem: Heuristic
Note: Make sure to complete Question 4 before working on Question 6, because Question 6 builds upon your answer for Question 4.
Implement a non-trivial, consistent heuristic for the CornersProblem
in cornersHeuristic
.
python pacman.py -l mediumCorners -p AStarCornersAgent -z 0.5
Note: AStarCornersAgent
is a shortcut for
-p SearchAgent -a fn=aStarSearch,prob=CornersProblem,heuristic=cornersHeuristic
.
Admissibility vs. Consistency: Remember, heuristics are just functions that take search states and return numbers that estimate the cost to a nearest goal. More effective heuristics will return values closer to the actual goal costs. To be admissible, the heuristic values must be lower bounds on the actual shortest path cost to the nearest goal (and non-negative). To be consistent, it must additionally hold that if an action has cost c, then taking that action can only cause a drop in heuristic of at most c.
Remember that admissibility isn't enough to guarantee correctness in graph search -- you need the stronger condition of consistency. However, admissible heuristics are usually also consistent, especially if they are derived from problem relaxations. Therefore it is usually easiest to start out by brainstorming admissible heuristics. Once you have an admissible heuristic that works well, you can check whether it is indeed consistent, too. The only way to guarantee consistency is with a proof. However, inconsistency can often be detected by verifying that for each node you expand, its successor nodes are equal or higher in in f-value. Moreover, if UCS and A* ever return paths of different lengths, your heuristic is inconsistent. This stuff is tricky!
Non-Trivial Heuristics: The trivial heuristics are the ones that return zero everywhere (UCS) and the heuristic which computes the true completion cost.
Question 7 (2 points): Eating All The Dots
Now we'll solve a hard search problem: eating all the Pacman food in as few steps as possible. For this, we'll need a new search problem definition which formalizes the food-clearing problem: FoodSearchProblem
in searchAgents.py
(implemented for you). A solution is defined to be a path that collects all of the food in the Pacman world. For the present project, solutions do not take into account any ghosts or power pellets; solutions only depend on the placement of walls, regular food and Pacman. (Of course ghosts can ruin the execution of a solution! We'll get to that in the next project.) If you have written your general search methods correctly, A*
with a null heuristic (equivalent to uniform-cost search) should quickly find an optimal solution to testSearch
with no code change on your part (total cost of 7).
python pacman.py -l testSearch -p AStarFoodSearchAgent
Note: AStarFoodSearchAgent
is a shortcut for -p SearchAgent -a fn=astar,prob=FoodSearchProblem,heuristic=foodHeuristic
.
You should find that UCS starts to slow down even for the seemingly simple tinySearch
. As a reference, our implementation takes 2.5 seconds to find a path of length 27 after expanding 5057 search nodes.
Note: Make sure to complete Question 4 before working on Question 7, because Question 7 builds upon your answer for Question 4.
Fill in foodHeuristic
in searchAgents.py
with a FoodSearchProblem
. Try your agent on the trickySearch
board:
python pacman.py -l trickySearch -p AStarFoodSearchAgent
Our UCS agent finds the optimal solution in about 13 seconds, exploring over 16,000 nodes.
Make sure that your heuristic returns 0 at every goal state and never returns a negative value.
Remember: If your heuristic is inconsistent, we will deduct your credit, so be careful! Can you solve mediumSearch
in a short time? If so, we're either very, very impressed, or your heuristic is inconsistent.
Object Glossary
Here's a glossary of the key objects in the code base related to search problems, for your reference:
SearchProblem (search.py)
- A SearchProblem is an abstract object that represents the state space, successor function, costs, and goal state of a problem. You will interact with any SearchProblem only through the methods defined at the top of
search.py
PositionSearchProblem (searchAgents.py)
- A specific type of SearchProblem that you will be working with --- it corresponds to searching for a single pellet in a maze.
CornersProblem (searchAgents.py)
- A specific type of SearchProblem that you will define --- it corresponds to searching for a path through all four corners of a maze.
FoodSearchProblem (searchAgents.py)
- A specific type of SearchProblem that you will be working with --- it corresponds to searching for a way to eat all the pellets in a maze.
Search Function
- A search function is a function which takes an instance of SearchProblem as a parameter, runs some algorithm, and returns a sequence of actions that lead to a goal. Example of search functions are
depthFirstSearch
andbreadthFirstSearch
, which you have to write. You are providedtinyMazeSearch
which is a very bad search function that only works correctly ontinyMaze
SearchAgent
SearchAgent
is is a class which implements an Agent (an object that interacts with the world) and does its planning through a search function. TheSearchAgent
first uses the search function provided to make a plan of actions to take to reach the goal state, and then executes the actions one at a time.
Submission
You're not done yet! Follow your instructor's guidelines to receive credit on your project!


'We Must Take Advantage Of Messi'
by Kurt BuckerfieldFollowing Lionel Messi's remarkable performance in LaLiga on Tuesday night, during which he contributed to four goals, his teammate Arturo Vidal has insisted football should make the most of the Argentine while he is still around.
Click through the gallery above to see some pictures of Messi in action on Tuesday night!
The 32-year-old was instrumental in FC Barcelona's 5-1 home win over Real Valladolid, scoring twice and assisting two further strikes.
One of Messi's goals came via a brilliantly taken free-kick, one that had many, including his own colleagues, in disbelief. After the game, Vidal was quick to praise his captain, saying he continues to surprise his own teammates day in and day out.
Download The Soccer Laduma Social Media App & Earn Airtime for Selfies!
"It makes a difference with Leo giving all his quality. When he's like this, the team feels it," the Chilean told Movistar+.
"We see him every day, but he surprises us every day. Leo is from another planet.
"We are happy, we won, and the team felt good. I have no words to talk about Leo. You have to take advantage of it and make the most of him."
10 Stars Who've Scored 100 Goals Or More Under One Manager
Messi has scored five goals and assisted a further five strikes in eight appearances for the Blaugrana so far this season.


Conway's Blocks visualizer
for
Advent Of Code
2020, Day 17
By
Francesco Mazzella
Your input
...#.#.# ..#..#.. #.#.##.# ###.##.. #####.## #....... #..#..## ...##.##
Send
Working…
Step
Reset
Status
Current cycle:
......
Currently active:
......
Mode
3D
4D
Current W:


Something went wrong! The page you are looking for could not be found at this location. Try the navigation or search above to look for it.


Clinton...err, Stanton, flies his colors
Primary Colors A Film Review By Michael Redman Copyright 1998 By Michael Redman
*** (out of ****)
There's a popular maxim that the American public gets exactly the politicians that it deserves. It's difficult to judge the truth of that because the masses never really see these men and women, only their public faces. The demand that they live the life of saints has created a situation where everyone in office must lie in order to remain there.
The film from the novel by (no longer) "Anonymous" (former "Newsweek" writer Joe Klein) follows the presidential primary campaign of Jack Stanton (John Travolta), a very thinly disguised Bill Clinton. Although the book is loosely based on Clinton's 1992 campaign, it would be a mistake to take it as truth. Some events are drawn from reality; others are completely fictional.
Told from the point of view of Henry (a darker George Stephanopoulos) Burton (Adrian Lester), the story is one of difficult decisions. Burton is an idealistic young black man drafted into the position of campaign manager for the southern governor. At first he is excited about working for a man who matches his vision. After a series of scandals, he has to re-think his position and determine how much he is willing to bend to get his candidate elected.
Charismatic Stanton has a thing for the ladies. He's shown bedding down the head of a teacher's union, accused of fathering the child of a teenage girl and is the subject of a Gennifer Flowers lookalike's tabloid tale. Although potentially a fatal flaw for a politician, his uncontrolled libido is not the moral dilemma at the core of the film.
Is it justifiable for a politician to tell something different from the truth? What is the high ground in terms of dealing with damaging personal dirt about your opponent? These are the major issues at stake.
Stanton genuinely cares about the common man. In a scene reminiscent of Edward Hopper's painting "Nighthawks", he sits in a Krispy Kreme doughnut shop in the middle of the night listening to the lone employee explain how he has to work impossibly long hours just to make ends meet. To demonstrate his concern and get elected, the would-be president fabricates stories about his past during speeches. They could have been true, they just aren't.
When campaign investigator Libby Holden (Kathy Bates), a stand-in for real life Betsy Wright, comes up with information that would sink his opponent there is the question about what to do with it. Stanton has refused to "go negative" previously, but this material would guarantee his victory.
Is Stanton God or Satan? It turns out, like politicians in the real world, he's neither. Admirably the film doesn't provide easy answers, but we do see that idealism and politics are not good bedfellows...although other campaign workers might be.
That politicians and their staff are human beings might come as a surprise to many people. The media and the public tend to see them as symbols and forget that there's flesh and blood there. If a friend has an extra-marital affair, it's unfortunate, Maybe the couple can work things out and if not, well, it happens every day. If the President of the United States does the same thing, there's moral outrage. In "Primary Colors", the characters are people: sometimes noble and certainly flawed.
Remembering my experiences as a minor staffer during a congressional race years ago, the behind the scenes look feels realistic. Nothing is as organized and unified as it appears from the outside. The intense feelings and abrupt coming and going of staff members seem about right. It's not a shock when co-workers end up in bed together.
Director Mike Nichols ("The Graduate", "The Birdcage") has a remarkable cast here. Billy Bob Thornton who has burst on the cinema scene like a house afire during the past year plays self-proclaimed redneck spin doctor Henry Burton Jemmons (or maybe it's James Carville). Emma Thompson is Stanton's wife Hilary -- err, Susan. Florida governor Fred Picker (possibly inspired by Jerry Brown) is portrayed by Larry Hagman who has turned out to be quite the talent after his mundane years on television.
Travolta is outstanding as the good ol' boy with an apple fritter in one hand, a greasy chicken leg in the other and always talking the talk. Gnawing on a rib held in his hands, you can tell that he's filled with a gusto for being alive. That zest is what gets him into trouble, but it's also what gets him elected. Travolta is one of those actors with such a presence that sometimes he's "John Travolta" rather than the character. It's a testament to his skills that just minutes after the film starts, you forget the actor and see Jack Stanton.
The real standout is Bates. Her inspired off-the-wall (judged safe for the campaign because, after all, she's been out of the mental institution for months) pistol-toting lesbian has a fire in her belly for truth and justice. She dominates every scene she's in. Her sexual persuasion is handled well in a matter of fact manner. When Burton discovers the actual relationship with her beautiful "assistant" (Stacy Edwards), it gets no more than a raised eyebrow.
Although you can look for Academy Awards acting nominations next spring, there are odd moments. When the bigger than life Travolta, Thornton or Bates is on-screen with some of the lesser-skilled others, the contrast is sometimes jarring. Lester's adequate performance appears flat when compared.
Clinton's popularity seemingly results from his persona as a real person. This might mark a turning point in America's future. Politicians as human beings? Who would have thunk it?
"Michael Redman's thoughtful analysis of the Oscars Presentation" Only in Hollywood could they take such a lively art form and turn it into such a boring non-event. It was the "Anti-Titanic".
(Michael Redman has written this column for 23 years and it might be that long again before he watches another awards show.)
[This appeared in the 3/26/98 "Bloomington Voice", Bloomington, Indiana. Michael Redman can be contacted at<EMAIL_ADDRESS>--<EMAIL_ADDRESS>This week's film review at http://www.bvoice.com/ Film reviews archive at http://us.imdb.com/M/reviews_by?Michael%20Redman
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


(Beware of bignumber implementations that clip leading 0x00 bytes, or prepend extra 0x00 bytes to indicate sign - your code must handle these cases properly or else you may generate valid-looking addresses which can be sent to, but cannot be spent from - which would lead to the permanent loss of coins.)
seems that even btc core allows sending to invalid checksum addresses but they can't be spent from. ouch.
jl777c28-Nov-18 04:23 PM
addresses dont exist on the blockchain
i think it issue is if the rmd160 hash has leading base58 nulls and they are suppressed, it ends up being a different hash value that is encoded in the address
all address checksums are validated in the bitcoin code that sends to addresses (that I have seen)
dukeleto28-Nov-18 04:32 PM
that wiki may be quite old and wrong, i believe James and yes, addresses don't exist on the blockchain. Still learning that lesson....
SAN FRANCISCO, CA / ACCESSWIRE / November 22, 2018 / Binance Labs, the investment and incubator arm of the world's largest cryptocurrency exchange Binance, has just announced a $3 million investment in cryptocurrency OTC trading company Koi Trading. Koi Trading is an OTC trad...
Deleted User29-Nov-18 07:31 AM
no fear
dukeleto29-Nov-18 08:04 AM
Thing I learned today: Sapling addresses are actually bech32 format, not base58, which made me realize how to make the last failing tests pass
in practice, this means that Sapling zaddrs contain only a-z0-9 chars, while taddrs also contain uppercase (except for O, I), and don't include "l" or zero
it's invalid for them to have mixed case
Deleted User29-Nov-18 05:00 PM
Managed to get the new version of sending working with the db. It made me fix some things I couldn t see before. Am at the point the sending goes and I only need to make db moves to reflect the sending.
The status codes for sending part have been implemented more precisely and will be explained in an updated flowchart(edited)
Will manage to rewrite the eth and Z part this evening. Fortunately the T one is one of the most complex as it contatenate txes dynamically
dukeleto29-Nov-18 05:04 PM
I believe my address-validator does 90% or more of what you need it to do, i can add specific coins pretty easily(edited)
i am going to work on some other pressing concerns, let me know what I can do to help us get things running in prod
Deleted User29-Nov-18 05:12 PM
Thanks a lot
I ll keep you updated :)
Deleted User30-Nov-18 01:19 AM
latest news from here : I got it finally working for T and Z using the db, made a lot of swaps, still need to make sure every specific Z case is handled but as 100% passed it will be ok
latest part it about eth stuff, I had to adapt it too, the only missing part is the rebranding of the eth specific part that handles the sending. As it will consist to change source of info it won't take long, so I'll be ready for the next... steps
jl777c30-Nov-18 08:41 AM
you can also test with sapling activated chain like RKT
Deleted User30-Nov-18 09:20 AM
would test with verus act the same? (I have some VRSC)
sending back for eth's script is working with the db now
more checks to add correct info on db and make good switches, but... base is ok now
2
dukeleto30-Nov-18 10:01 PM
@Deleted User can we do some kind of "soft launch" where we allow trusted people to do swaps? What needs to happen to get there?
Deleted User30-Nov-18 10:14 PM
We will invite trusted people to test
First wave will mostly be people from this chan some notary and some people we want to "help" I mean I have a few contacts with some kmd assetchain creators like people from pirate to oot that know it is coming.
I managed to contact a few of em 1 by 1 to give em some infos and ask em if we can include their icon on our front page.(edited)
We ll want it to be very closed at start and when we ll have fixed some stuff and seen how it goes we ll manage to begin spreading the word and inviting more people but using each involved coin to gather testers
(For interested people I think I ll make videos to show how internal stuff works.)
About the date : I can only speak about my part : I began revamping Coinsservers code to get stuff rely on db calls instead of file handling. Every type of trade works : that means my next phase (in a few min) will be to clean everything. Fix latest db calls and start making more and more swaps.
When we ll have the confirmation on gui side we ll begin connecting everything and shaping the api (that may not be ready for first tests)
I think it should be done pretty fast : ok to test at the end of next week
Btw for an update about gui : I think most stuff has been done but I can t confirm it myself but so far it looked very good
1
Deleted User01-Dec-18 12:01 AM
Am testing vrsc on z mode and ltc pivx dash and litecoin atm
Zchain: Zcash Block Explorer, Analytics Platform & API. Browse and search blocks, transactions, accounts, statistics and more.
2
1
1st time I try those...
full completed
@dukeleto btw... I dont know if you handled this, in fact, I even missed myself... but are Z hashing supported for address checking?
dukeleto01-Dec-18 04:00 AM
@Deleted User do you mean if shielded addresses are supported? Yes(edited)
Deleted User01-Dec-18 04:00 AM
SHossain01-Dec-18 11:55 AM
@Sri
Deleted User01-Dec-18 02:24 PM
:)
Deleted User01-Dec-18 02:38 PM
@Ludom
@miketout
@infotech-al
infotech-al01-Dec-18 02:46 PM
Present
Deleted User01-Dec-18 02:53 PM
hello my friend
you're on the channel that explains why I'm not so much here for weeks
infotech-al01-Dec-18 02:54 PM
Ready to assist
Deleted User01-Dec-18 02:54 PM
hopefully... you'll be able to test in a few days
at least, I believe now it s only a matter of a week or 2 before launching the first test phase with limited people
I d like to invite every ecosystem dev, but that may be on 2nd round, that will let me the 1st round time to develop tracking trades status pages
infotech-al01-Dec-18 02:56 PM
Happy to help please let me know what pre request is required
I’m no dev but can follow
Deleted User01-Dec-18 02:56 PM
nothing, you ll just have the ability to test the swap stuff before public
infotech-al01-Dec-18 03:10 PM
Sri01-Dec-18 04:23 PM
Great Job @Deleted User
Deleted User01-Dec-18 04:24 PM
am finishing adding ravencoin and snowgem atm ^^
dukeleto01-Dec-18 04:54 PM
@Deleted User i just added both to address-validator
Deleted User01-Dec-18 04:54 PM
dukeleto01-Dec-18 04:58 PM
both with tests, too
Deleted User01-Dec-18 04:59 PM
I ll have to buy a little bit of em to test now ^^
dukeleto01-Dec-18 05:01 PM
@Deleted User XSG supports zaddrs too
i just verified my address-validator code is correct. XSG does not have sapling yet, sprout zaddrs only
@Sri can you clarify for me, is OOT going to stay on sprout zaddrs, and not upgrade to Sapling? I heard something about that
Sri01-Dec-18 05:03 PM
Yes its true Duke
We dint see any value with this hard fork for our blockchain.
We will go for hard fork for our crypto conditions though, then we would do it
Moreover its a pain to deal with our exchanges, they are so lame
Deleted User01-Dec-18 05:33 PM
hopefully soon you ll have a friendly trading platform @Sri ^^ (I hope ^^)
Sri01-Dec-18 05:33 PM
@Sri CEX are such a pain dwy, their support staff sucks
Deleted User01-Dec-18 05:34 PM
that s also a reason for the app... get a listing on a CEX costs either a lot of money, or a lot of troubles hadling it
Sri01-Dec-18 05:34 PM
We paid 3 BTC for exchange listing - 3 exchanges - 9 BTC in total
Deleted User01-Dec-18 05:34 PM
...
Sri01-Dec-18 05:35 PM
Then, for hardfork coinexchange wants 0.5 btc
Deleted User01-Dec-18 05:35 PM
I'll support you free, as any other assetchain, until the app dies :p
and any dpowed coin
I know it s not an exchange, or all
but at least people will be able to change OOT for whatever they want
Sri01-Dec-18 05:35 PM
Recently we had an issue with daemon, sistemkoin, one of our exchange disabled our deposit, withdrawls even now. They take ages to fix anything
Deleted User01-Dec-18 05:36 PM
trying to get as much automated stuff as I can, the only problem I face now is I added a lot of coins, and didn t update the register part to get em working as soon as they re synced. Will fix this this evening and test a OOT/ RVN // OOT / XSG


Shortest Remaining Time First
Shortest Remaining Time
The full form of SRT is Shortest remaining time. It is also known as SJF preemptive scheduling. In this method, the process will be allocated to the task, which is closest to its completion. This method prevents a newer ready state process from holding the completion of an older process.
Characteristics of SRTF scheduling method:
• This method is mostly applied in batch environments where short jobs are required to be given preference.
• This is not an ideal method to implement it in a shared system where the required CPU time is unknown.
• Associate with each process as the length of its next CPU burst. So that operating system uses these lengths, which helps to schedule the process with the shortest possible time.


I build things with computers, for people.
Posts
July 9, 2019
October 30, 2017
October 15, 2016
October 14, 2016
October 13, 2016
October 12, 2016
October 8, 2016
October 7, 2016
October 6, 2016
October 5, 2016
May 16, 2016
February 5, 2016
July 24, 2015
March 6, 2015
Talks
-
Well-Designed Phoenix Applications
October 3, 2017
-
Intro to Phoenix
December 6, 2016


Triggered when a check suite is completed, requested, or rerequested.
completed
requested
rerequested


For REAP:
For FS:
OR
INSURANCE
Please click here when you arrive at your patient's FS appointment for further directions.
Once your patient has charity care, please contact the Bills and Insurance Manager, Neeraja Konuthula.
Cost to EHHOP Patient Cost will vary depending on the bill. Most (but not all) Mt. Sinai bills are usually resolved with the patient having to under fifty dollars on the bill. There is no cost for going to Financial Services.
Most bills are usually resolved in 2-3 weeks .
Patient Financial Services: 17 East 102 Street, 1st floor. Telephone:<PHONE_NUMBER>


Software Development Company
Free State, Bloemfontein
Not Registered? Register
A lowercase letter
A capital (uppercase) letter
A number
A special character
Minimum 6 characters
Minimum 8 characters
@bitcube.com


Test Case
Author: build
2018-04-17 16:22:36 -- 2018-04-17 16:23:58
Assert: Test Steps Summary
No record information found.
[main]Step 1 Touch [2018-04-17 16:22:36]
record_pos: [0.235, 0.171], resolution: [2160, 1080]
Matching confidence: 94.9%
寻找目标图片，触摸屏幕坐标[1587, 910]
Execution finished successfully
[main]Step 2 Sleep [2018-04-17 16:22:48]
等待10.0秒
Execution finished successfully
[main]Step 3 Touch [2018-04-17 16:22:52]
record_pos: [0.439, -0.231], resolution: [2160, 1080]
Matching confidence: 95.6%
寻找目标图片，触摸屏幕坐标[2028, 41]
Execution finished successfully
[main]Step 4 Sleep [2018-04-17 16:23:52]
等待60.0秒
Execution finished successfully
[main]Step 5 Touch [2018-04-17 16:23:53]
record_pos: [-0.006, 0.217], resolution: [2160, 1080]
Matching confidence: 97.3%
寻找目标图片，触摸屏幕坐标[1068, 1009]
Execution finished successfully
[main]Step 6 Sleep [2018-04-17 16:23:56]
等待3.0秒
Execution finished successfully
[main]Step 7 Touch [2018-04-17 16:23:56]
record_pos: [0.35, 0.203], resolution: [2160, 1080]
Matching confidence: 93.9%
寻找目标图片，触摸屏幕坐标[1836, 979]
Execution finished successfully
[main]Step 8 Sleep [2018-04-17 16:23:58]
等待2.0秒
Execution finished successfully


LETTERS TO THE EDITOR: State Dept. ruined relations
by THE WASHINGTON TIMESANALYSIS/OPINION:
George Kent, deputy assistant secretary at the State Department, alledgedly overheard a July 26 phone call between President Trump and Ambassador to the European Union Gordon Sondland, in which the two discussed investigations that President Trump wanted Ukraine to pursue. Mr. Kent also said Mr. Trump told Mr. Sondland that Mr. Trump didn’t care about Ukraine.
Right or wrong, Mr. Kent is simply upset that he was not in the loop. What the Democrats did was give Mr. Kent his 15 minues of fame while destroying any chance of normal relations with Ukraine. So much for the motives of the State Department.
JOSEPH DUPONT
Towanda, Pa.
Sign up for Daily Opinion Newsletter
Copyright © 2019 The Washington Times, LLC. Click here for reprint permission.
Please read our comment policy before commenting.


autofunc.get_precision_recall
¶
Find the accuracy of a prediction based on the known results in a testing set and the predicted results from a training set. The accuracy is represented in the F1 score.
Module Contents¶
Functions¶
|
Imports the results of the frequency-finding and thresholding algorithm, which are the results predicted to be in |
-
autofunc.get_precision_recall.
precision_recall
(thresh_results, test_records)¶ Imports the results of the frequency-finding and thresholding algorithm, which are the results predicted to be in future components. The functions and flows for the components in the testing set are predicted based on these results, which are compared with the actual results and used to calculate the accuracy of how well the prediction performed.
Predicted?
Yes
No
Actual?
Yes
True Positive
False Negative
No
False Positive
True Negative
TP = True Positive, FP = False Positive, FN = False Negative, TN = True Negative
Precision is the ratio of correct predictions to all predictions made by the classifier (TP/(TP + FP)). This number is the ratio of predictions that were identified as being in the product that are actually in the product.
Recall is the ratio of correct predictions to all actual results made by the classifier (TP/(TP + FN)). This number is the ratio of the actual results that were correctly predicted.
Recall is representative of the confidence that no positives have been missed and precision is representative of the confidence in the True Positives.
The F1 score is the harmonic mean of precision and recall
(2 * precision * recall) / (precision + recall)
- Parameters
thresh_results (dict) –
results of the "find_top_thresh" function. These are the predicted function and flow combinations for each (The) –
component –
test_records (list) –
function and flow combinations for each component in the testing set (The) –
in a list. (organized) –
- Returns
learned_dict
Returns a dictionary of what was learned from the results of the data mining automation
matched
A dictionary of the functions and flows that were True Positives
overmatched
A dictionary of the functions and flows that were False Positives
unmatched
A dictionary of the functions and flows that were False Negatives
recall
A single number for the recall score for this combination of testing and training sets
precision
A single number for the precision score for this combination of testing and training sets
f1
A single number for the F1 score for this combination of testing and training sets


Data Science Immersive Student
General Assembly
Applied data analysis, data visualization, and machine learning skills during a 500-hour immersive course. Individually or with a team, completed 6 projects including:
- An Analysis of AirBnB in Washington, D.C.
- Conducted exploratory data analysis on 9,000+ listings and 358,000+ reviews, finding trends on how price is affected by distance from the National Mall, how increased review volume is indicative of major events, and how hosts with multiple listings can contribute to housing shortages for District residents
- Implemented KMeans Clustering model to outline D.C. neighborhoods and Gradient Descent model to predict price, which explained 69% of variability
- Estimating the Business Impact of Wildfire’s According to FEMA’s Seven Lifelines
- Collaborated with a team utilized Google and Yelp APIs to scrape location information for a geographic area, aligned locations to a FEMA lifeline, and built an interactive WebApp map that helps assess potential damage from disasters
- Created a reproducible method and results that FEMA and their contractors can use for a new disaster to assess potential damage to Lifeline businesses
- Similar but Unique: An NLP Model to Predict a Subreddit Post as Nike or Adidas
- Completed an end-to-end classification problem analysis, which included web scraping of 4,000+ posts from subreddit pages, conducted exploratory data analysis, and implemented Natural Language Processing (NLP) transformers
- Developed a Naive Bayes Multinomial machine learning model that predicted if a subreddit post was from /r/Nike or /r/Adidas with an accuracy score of 91%
September 2019 - December 2019
Global Client Delivery Manager
DXC Technology
- Managed service delivery and recruitment lifecycle of an IT desktop support team, driving consistent processes with 41 technicians at 16+ locations across the globe for key Under Armour client, supporting 6,000+ employees
- Built relationships and collaborated with client representatives and vendors across 10+ business units in each global region, using their insights to fuel process improvements
- Executed financial plans according to the SOW, driving savings and efficiency, including $200,000 annual reduction in overtime
December 2017 - August 2019
North America Client Delivery Manager
DXC Technology (formerly HPE, formerly HP)
- Achieved and exceeded critical client service level agreement of 85% of incident tickets closed within 2 business days
- Implemented and managed PC lifecycle refresh project, starting with backlog of over 1,000 overdue leased machines to new state of 3 months ahead of schedule
- Reduced average yearly spend on overtime by $200,000 utilizing data collected from timesheets and productivity levels to model and implement more efficient processes
September 2016 - November 2017
Solution Integrator
DXC Technology (formerly HPE, formerly HP)
- Analyzed requests to compose and deliver contracts for business opportunities using pre-existing data coupled with new sales data
- Exceeded client expectations by delivering additional requests for contracts in 3 business days or less, to remain compliant with Service Level Agreements (SLAs) and business standards
July 2016 - August 2016
Midrange Graduate Development Program
DXC Technology (formerly HPE, formerly HP)
- Organized and completed reporting and communication for server decommission project resulting in future cost savings of $700,000+
- Managed server projects for 14 different clients simultaneously, including Anheuser-Busch, Mercedes Benz, and Molson Coors, consistently delivering 160% of monthly goal within client SLA
June 2014 - June 2016


Music
Music Imaging
Imaging Technology And.... Lawsuits?
The inclusion of this planned feature was a relatively modest evolution in that it obviated the need for separate music scanning software (priced at around $300) to read these files, save them, and then open them in your music notation software of choice. There was no real breakthrough in terms of music recognition capability, for which the technology had been available and modestly improving for a couple of decades already.
Surprisingly, though, a row ensued, with one prominent composer predicting lawsuits over the feature along with “the collapse of music sales” and declaiming “no upside” to it. This misguided opinion gained a following on social media, and in light of the brouhaha MakeMusic decided to pull the feature prior to release of Finale 25.
Excerpt from the article, Musitek introduces SmartScore Music-to-XML, a PDF music scanning converter News | January 9, 2017 | by Philip Rothman
Multiple Methods
Digitizing music will make it "accessible" -- it may be played back, and therefore, a student will have access to the music. For a student to be able to learn music in the company of his peers, how


--- layout: default ---
Fabulists are fable-spinners and myth-makers. We are storytellers ourselves, but we poke holes in the hype and distortion of new digital technologies and the narratives associated with them. Contrafabulists are, as the name would suggest, against lying.
Kin Lane has spent the last decade or more obsessed with APIs, studying how our digital works and often doesn't work. While he is good at what he does and enjoys telling stories about how the digital machine works--he is slowly losing his soul in this world, and looking for more nourishment at the edge of our physical and digital worlds.
@kinlane (Twitter), @apievangelist (Twitter)
@kinlane (Mastodon), @apievangelist (Mastodon)
Audrey Watters is writer who focuses on education technology - the relationship between politics, pedagogy, business, culture, and ed-tech. Although she was two chapters into her PhD dissertation, she decided to abandon academia, and she now happily fulfills the one job recommended to her by a junior high aptitude test: freelance writer.
@audreywatters, @hackeducation
personal, page, hack education's page
Image credits: Bryan Mathers


class Job
def run
@retriever = FtpFileRetriever.new
strm = @retriever.get_file('theirs')
@cleaner = FileCleaner.new
cleaned = @cleaner.clean(strm)
local = 'mine'
File.open(local, 'w') {|f| f.write(cleaned) }
local
end
end
An injection
class Job
attr_reader :retriever, :cleaner
def initialize(retriever, cleaner)
@retriever = retriever
@cleaner = cleaner
end
def run(remote, local)
strm = retriever.get_file(remote)
cleaned = cleaner.clean(strm)
File.open(local, 'w') {|f| f.write(cleaned) }
local
end
end
Hollywood Principle
Don't call us, we'll call you
Inversion of control
Control over what?
Dependency Inversion
Abstractions should not depend upon details. Details should depend upon abstractions
Manual Dependency Injection
class Injector
def ftp_job
Job.new(FtpFileRetriever.new, FileCleaner.new)
end
def http_job
Job.new(HttpFileRetriever.new, FileCleaner.new)
end
end
Automated Dependency Injection
class Injector
include Dependor::AutoInject
def ftp_job
inject(Job, file_retriver: FtpFileRetriever.new)
end
def http_job
inject(Job, file_retriver: HttpFileRetriever.new)
end
end
Takes
class Job
attr_reader :retriever, :cleaner
def initialize(retriever, cleaner)
@retriever = retriever
@cleaner = cleaner
end
end
class Job
takes :retriever, :cleaner
end
Dependor
dependency injection
convention over configuration
constructor based injection
tried and tested
Deep dependencies
class BetsController < ApplicationController
def create
BetPlacement.place!(current_user, bet_slip, channel)
end
end
class BetPlacement
def self.place!(current_user, bet_slip, channel)
bonus = BonusCalculator.calculate(current_user, bet_slip)
BetsCreator.create!(current_user, bet_slip, channel, bonus)
end
end
class BetsCreator
def self.place!(user, bet_slip, channel, bonus); end
end
Wishful thinking
class BetPlacement
takes :bonus_calculator
def place!
bonus = bonus_calculator.calculate
bets_creator.create!(bonus)
end
end
class BetsCreator
takes :current_user, :bet_slip, :channel
def place!(bonus); end
end
is not a fallacy
class BetsController < ApplicationController
def create
Injector.new(channel, params).bet_placement.place!
end
end
def Injector
include Dependor::AutoInject
takes :channel, :params
def bet_slip; end
def current_user; end
end
Runner
class Runner
takes :feature, :exception_notifier, :alive_marker #, ...
def run
return unless feature.enabled? # otherwise start importing
end
end
class Injector
include Dependor::AutoInject
takes :import_type
def feature
return AlwaysEnabled unless [:horse_import].include?(import_type)
inject(FeatureSwitch)
end
end
Injector.new(ARGV[0]).runner.run
Exception Notifier
class ExceptionNotifier; end
class FakeExceptioNotifier; end
class Injector
include Dependor::AutoInject
takes :configuration
def exception_notifier
configuration.exception_notifier || ExceptionNotifier
end
end
EventImport.configure do |c|
c.exception_notifier = FakeExceptionNotifier
end
Per environment injection
#development.rb, test.rb
FileUploader = LocalFileUploader.new
Rails::Application.configure do
end
#production.rb
FileUploader = S3FileUploader.new
Rails::Application.configure do
end
Per server injection
class Injector
include Dependor::AutoInject
def press_downloader
if Environment.live?
SFTPDownloader.new(#SFTP configuration)
elsif Environment.local?
LocalDownloader.new(#local path)
elsif Environment.primary_staging?
# ...
elsif Environment.seconary_staging?
# ...
else
raise UnsupportedEnvironemnt
end
end
end
Sinatra
post "/orders" do |order_creator|
order_creator.create
end
class OrderCreator
takes :current_user, :params, :order_db
def create
current_user.orders << order_db.new(params[:order])
end
end


With the prevalence of mobile devices, video is widely used to record memorable moments such as weddings, graduations, and birthday parties. Popular websites such as YouTube have further boosted the phenomenon as broadcasting becomes easy. However, in music videos (MVs), movies, and television programs, music and video are often accompanied to complement each other to enhance emotional resonance and viewing experiences. Without soundtracks, most user-generated videos (UGVs) might look boring. Therefore, an automated process that can suggest a soundtrack to a UGV and make the UGV a music-compliant professional-like video is highly desirable. To this end, we have developed an emotion-based MV generation system that conducts soundtrack recommendation and video editing simultaneously. In this talk, I will introduce our research development from music emotion recognition to music video generation.
Hsin-Min Wang received the B.S. and Ph.D. degrees in electrical engineering from National Taiwan University in 1989 and 1995, respectively. In October 1995, he joined the Institute of Information Science, Academia Sinica, where he is currently a research fellow and deputy director. He also holds a joint appointment as Professor in the Department of Computer Science and Information Engineering, National Cheng Kung University. He was an adjunct associate professor with National Taiwan University, National Taipei University of Technology, and National Chengchi University. He currently serves as an associate editor of IEEE/ACM Transactions on Audio, Speech and Language Processing and APSIPA Transactions on Signal and Information Processing. His major research interests include spoken language processing, natural language processing, multimedia information retrieval, machine learning and pattern recognition. Dr. Wang received the Chinese Institute of Engineers (CIE) Technical Paper Award in 1995 and the ACM Multimedia Grand Challenge First Prize in 2012. He was an APSIPA distinguished lecturer for 2014-2015. He is a life member of APSIPA, ACLCLP, Institute of Information & Computing Machinery (IICM), and the Chinese Institute of Electrical Engineering (CIEE), a senior member of IEEE, and a member of the International Speech Communication Association (ISCA) and ACM.


I am a software engineer experienced in ReactNative, React, JavaScript, Golang, Ruby on Rails. Hope my contributions to various open sourced projects can make others' life a bit easier.
I am determined and constantly strive to deliver simple and efficient coding solutions. I love solving complicated problems using my programming skills. I enjoy working on teams with other passionate programmers, to produce the best results.


{{ SITENAME }}
Sorry, an error has occurred
Rest assured, we're working on the problem!
{% if traceback %}
{{ traceback|escape }}
{% endif %}


MikelSV Documentation - Index page
About
This is docamentation for my projects and library.
Projects
Documentation
docat - wiki generator.
Languages
msl-fl - My Server language, Fast Line. (Php analog.)
mash - My active shell.
Server
stormserver - storm server.
Library
msvcore - deprecated. Old version.
msvcore2 - this version of msvcore library. 12 years old. No std, no Qt.