We have a thief in Virginia who is and has been stealing people's service for at least two years and running a group with at least 5 drones.
He has also hacked them out and burnt holes in old women among chasing them with it in cars and more as a Santanic group.
We need to find this person as he is cause of giving us a bad name.
Uses Verizon DLINK2500 TP2500. , 69.78.96.14. Also 174.255.207.224. 890L64b2 on Verizon. Mac 38-46-08-1c-63-ae. Goes by Serialconsole1 or Shaezche among others.
He has ask questions on every form he can.
Please if you find him STOP HIM.
Related
Noob here, sorry if this is a too silly question. Only I am looking to the name of the algorithm. because I am pretty sure someone solved this problem before, but I cannot found anything on google, mostly because of a lack of vocabulary.
Basically, what I am looking, is the best algorithm to solve the following situation:
I have a group of elements, let say Companies. I need to process all of them, one by one, but the criteria are that the next one will be the least attended. For example, if my universe where 3 companies:
Oracle
Apple
Google
The first time, whichever of those will fulfill the criteria, so let's say we choose Oracle. We process Oracle, so in the next round it will be or Apple or Google, but clearly not Oracle. Let's choose now Apple. The next round is clearly Google. When I finished the first round, I need to attend them again, this time, I do not need to choose at random, because of the 3 companies, Oracle was processed the most time ago.
I am sure there is a well known algorithm for this
As #Henry mentioned in the comments, the answer to my question is "Round Robin"
I am running a Tennis Website in behalf of a friend of mine because she's not that really passionate about technology and computers.
When we create a tournament subscription page, users and amateur tennis players fill out a form to subscribe to that tournament.
There is a field in the form where the user can describe their availability based on their needs.
Basically, users write when they can play matches, and most of the times they are time costraints, like for example:
"I can play all the evenings after 9.00 PM",
"only in the weekdays",
"because of work, I can play only in the weekends",
"Always, except not after 10.00 PM every evening because I have to wake up early".
I call them time costraints.
Yesterday I found a new costraint, and it is like so:
"Me (UserA) and my friend (userB) will share the car in order to partecipate in the tournament, because we live far from you, and we have to travel long miles and we would like to come together in order to save fuel.
As long as my friend is not eliminated in the tournament, I'd prefer to play in similar times with my friend (userB).
If my friend is eliminated, I can always play everytime"
My question now is if there is an algorithm to satisfy all these costraints, or a precooked solution my friend can use even if she's not a techie or a geek.
I undertand that this algorithm should run after every day, because of course match winners are not known in advance and hence user time costraints vary.
I also understand it is an operations research problem, but I haven't got experience and I'm not a professional programmer.
Please leave any pointer you may have on specific literature or software.
Thanks
There is no precooked solution to such problems AFAIK. Somebody will have to build a model and an application for that.
As suggested, Constraint Programming is one technique that solves this kind of problem and proposes solutions that satisfy all given constraints. Choco is a very handy open source tool.
However, you may want to formulate it as an optimization problem. You want the algorithm to place each pair UserA/UserB in the same day/time slot when scheduling the next round. How many such pairs are there? What if it is not possible to place all such pairs?
Go for the largest number of pairs would be doable using MILP. Maybe take history into account and average out the number of times each pair comes together ? Such a model is definitely more complex...
I've worked on VRP problems previously, but its been several years and going through literature hasn't helped much because the variations in the problem change a lot about the solution. So I was hoping, if I laid the problem description out, someone with a bit more insight could help me identify what flavor of VRP I'm working on, or if it more closely matches something else entirely.
The problem I have is a set number of locations, 10 in my current case but this is variable. Each location has a set of shipments that need to be sent out to the other locations, the number of shipments and destinations are random so location 0 could have 1 shipment for each of the other locations, it could have 10 shipments all to location 5, or anywhere in between. All locations are directly connected, although the distance between each location is not uniform, all distance is Euclidean, so there is an element of needing to travel the longer distances as few times as possible. There is only 1 vehicle, and it can only carry 6 shipments at once, but shipments are NOT held in a queue or stack so any shipment that has been picked up can be delivered to its destination at any time regardless of when other shipments are picked up. The vehicle can carry any mix of shipments, to between 1 and 6 destinations at a time. There is no time constraint such as pick up or drop off only possible during certain hours. The vehicle can start at any one of the locations and can end at any location, and there is no limit to the number of stops at each location or number visits to each location, except that total distance traveled needs to be minimized.
It is also possible to pick up shipments, move them, and unload them at a location that is not their proper destination. This won't count as a successful delivery, but after being moved the shipment could be picked up and moved again later. I'm not sure if this changes anything about the problem since I'm restricting the problem to 1 vehicle, but it is an allowed action.
Given that description I've been trying to classify this as capacitated VRP with pickup and delivery, but when I compare my problem to examples in that area it doesn't seem like a match when I listen to lectures over it or in literature. I'm not sure if having my all locations as potential pick-up and delivery targets is skewing my understanding, or if I'm just making this problem more complicated than it needs to be, maybe it matches a simpler interpretation.
If after you read this you think I'm on the right track and that I've identified everything correctly, could you please advise me as to where/how to start or learn more. At this point if I have correctly classified the problem then I'm not really sure what my next step should be since what I've gone over in other solutions doesn't seem to match what I'm working with. Thank you.
-i used a ø in problem, because Vehicle Routing Problem wasn't allowed in the title. Sorry.
It is also possible to pick up shipments, move them, and unload them
at a location that is not their proper destination. This won't count
as a successful delivery, but after being moved the shipment could be
picked up and moved again later. I'm not sure if this changes anything
about the problem since I'm restricting the problem to 1 vehicle, but
it is an allowed action.
The key question is whether this can actually make routes more efficient or not. If it doesn't, you can ignore this (i.e. don't do it) and the problem is a capacitated pickup delivery vehicle routing problem. (i.e. a vehicle routing problem where items are picked up from one location, dropped at another, where neither location is the vehicle depot). If you've only got one vehicle you could probably call it a "capacitated TSP with pickup and deliveries" or something similar.
If this does make routes more efficient, you're doing some kind of crossdocking, and this becomes a very complex/rich vehicle routing problem requiring a custom algorithm. This paper may be of some use?
So I want to write a small program that would be able to take a group of people (100-200) and divide them into several equal groups (10-15) with constraints.
Each person has a city they came from (usually around 8-12 different cities total).
Each person was in a group of people before this new division (10-20 different groups).
Thats it for the example.
Now I want to divide those people in different group such that we strive to have same number of people from different cities in each team (so not all new yorkes are in the same team etc) and strive that people who have been in the same team before wont team up again.
Cant find an algorithm that can help me.
There is an np-complete feeling about finding an absolute best answer. But you just want a pretty good answer, pretty fast, it isn't hard to come up with a heuristic.
Set up your empty teams. Decide on the maximum team size. Sort people by the number of other people to avoid (same city or past same team) descending. Put each person in the non-full team with the least other people you are trying to avoid, breaking ties for the team with smaller people, and randomly breaking any remaining ties.
This is not guaranteed to produce optimal results. But it is simple and will produce pretty good ones.
Closed. This question is not about programming or software development. It is not currently accepting answers.
This question does not appear to be about a specific programming problem, a software algorithm, or software tools primarily used by programmers. If you believe the question would be on-topic on another Stack Exchange site, you can leave a comment to explain where the question may be able to be answered.
Closed 2 months ago.
Improve this question
Each year at Thanksgiving, my family has drawn names out of a hat to determine who they'll be a "Secret Santa" for the Christmas gift exchange. It's important to our family culture that no one else in the family knows who each other got in order to keep it interesting. The only rule to the selection is that you can't pick your spouse. If that happens, you draw again and put your spouse's name back in the hat.
Due to logistics and travel plans this year, we're celebrating Christmas early (only two weeks after Thanksgiving).
In order to allow for plenty of time to look for gifts, we'd like to select names now. Our family is located across the U.S.A. Some members have access to the Internet and some don't (e.g. my dear Grandma).
What I would like to do is have a fair protocol that simulates drawing names out of a hat and ensures some level of secrecy without being overly complex. Some websites, like the former drawnames.com or others like it usually require people to put in their email address. I want to make absolutely sure that my family's email addresses don't get abused
so I don't want to trust them to another site.
The best protocol I can come up with is:
Write a program that randomly picks people and ensures people don't get their spouse.
The program will show me half the list but will not show me who got my name, but will show me whose name I have and the person who got my wife's name.
Then, I will leave the room and the program will display the other half of the list of people to my wife (which will include who has my name).
My wife and I will then contact each person and tell them who they have.
Am I missing a better protocol? By better, I mean something that would allow more secrecy. Again, due to logistics and to keep things simple, I don't want to have to build a website.
Get some paper and some envelopes. Number two of each envelope and two of each paper so that you have 2 "1" envelopes and 2 "1" papers, 2 "2" envelopes and 2 "2" papers, etc.
Have either you or your wife write every couple's names on matching papers, for example: you could put your name on a "1" sheet and your wife would have to be on the other "1" sheet. Address the matching envelope appropriately (your address would be on both "1" envelopes in the example).
Turn all of the papers and envelopes over so that none of the names or addresses can be seen (you did remember to write the numbers on the back of the paper and envelopes, right?) Swap places so that the person that did not do the writing stuffs the envelopes. Just be sure to put every numbered paper into an envelope with a different number (e.g.: never put a "1" paper into a "1" envelope). That way, you'll know that A) nobody got themselves and B) nobody got their significant other.
Not every answer needs to involve a computer! Just ask your nearest D&D player. :-P
Here's a real low tech solution. Give the list of names and email address to a friend of yours and ask them to draw the names and email everyone. Hell, I'll do it if you don't have anyone.
This is a software solution.
Put everyone's name and address in a list.
Make a copy of the list, then shuffle it.
If any address in the original list has a matching address in the shuffled list, either shuffle again, or make a random swap until no slots have the same address in both lists. (Do this in software so you're not peeking.)
Print envelopes in the order of the first list.
Print letters in the order of the shuffled list.
Stuff the envelopes without peeking.
This assumes that everyone in your family lives at the same address as their spouse. It also assumes that you can trust yourself not to peek.
Happy Holidays.
Well, there has to be an element of trust since you could easily cheat, but if you want to simply avoid accidentally seeing the gift assignments, how about assigning a large random numbers to everyone, the create a list for everyone of people and their code numbers, and print individual sheets with for each person with the code of the person they "draw". In that way, without the effort of memorizing the number and looking it up on the list, you likely interpret "Bob got assigned to 0785286741234" as "Bob got assigned to Kelly". I'd probably make the first and last few digits the same for everyone so you can't simply recall that Bob got 7-something and there was only one random entry starting with a 7. Bury the differences deeper into the numerical string. See how they get "lost" visually:
0785253451234 Bob
0785286741234 Kelly
0785238761234 Herman
0785200281234 Lydia
On OS X it is very easy to take advantage of the Text-to-speech engine, just by calling the "say " command line utility. There are also ways to do this in windows as well.
SO you could ring up whoever is on your list, tell them to listen for who they should buy a gift for, and put a headphone from the computer up to the telephone, as you tell your program to say the name associated with the person you are calling. They can then tell you if they heard it clearly and that it wasn't their spouse.
Why not automatically send everyone an email? You can put the name in a file and zip it as an attachment to avoid peeking eyes.
You could have your computer dial each person via modem and use text-to-speech to announce their name over the line after an answer. It's sort of like the auto-dialer programs that political candidates and advertisers use to play you a message. Alternatively you could set it up so that your family calls your number and the computer answers. Then they push phone buttons to spell their name and the computer then tells them who they drew.
That way the names can be randomly selected by a simple program, and you don't have to see/hear who gets what names.
There is open source software that can run on linux to do this, although I have never used it. I assume there's an open source windows equivalent.
I assume your entire family has access to telephone even if they have no email.
An easy solution:
Write each name on a card and close it.
For each couple, put one on stack A and the other on stack B.
Divide the singles over A and B. (You have to know who is on which stack).
Assign the notes on stack B to someone on stack A and the other way round.
If there is an odd number, keep one of the singles (blind) apart and assign that to another. (There is a slight chance that person gets himself) but you can counter that by taking the card yourself and swap it with another if it is you.
I don't know if this is too late for you. I just created a web app that will do something very similiar to this - http://www.secretsantaswap.com/
You can import contacts from Gmail/Hotmail/Outlook, and you can designate subgroups that won't be matched with one another (e.g. bill and lisa never want to get each other's names). I email each participant with their target. Participants can have the same email address (for instance, a parent could receive all of the emails for their child).
When we did exchange gifts this year, I suggested http://www.secretsanta.com. My sister was in charge and she didn't have an internet connection at the time so it wasn't used.
If I remember correctly, it can keep track of previous years and can make exclusions so that people from the same family don't get each over.
Use your neighbor:
Prepare N envelopes with names on them.
Prepare N name sheets, that include the spouse names on them e.g.
"Bob (spouse of Molva)"
Then leave the room and ask your neighbor to do the random matching.
Presto. Give the envelopes to the persons either personally or via US mail