## Security – USB Programming – Computer Science Stack Exchange

I want to back up my computer program that I created myself on USB and anyone can use this program by copying it from USB to their computer and using it. But they have to keep this USB plug to use it. So this USB drive must be unique, and when copying to another USB drive, the new USB drive can not run the program. How can I make this unique USB key. It would be great if someone could help me.

## rpg theory – A new table RPG on Science Fantasy!

I published a post last week for our new Science Fantasy Table RPG – Magic Vs Machines. This week, we updated the website and worked on a FREE PDF version of the rule book (version v0.01 is available for download on the downloads page). We spent some time testing the combat system and found that the fight seemed fast. and fluid. We will continue to update the website over the next week. With the material listed on the website, you should be able to create level 0 characters and play. (We have reached level 2 without major problems.) If anyone saw our article last week and has comments, please let us know.

## Algorithm for multiplication tables – Computer Science Stack Exchange

Thanks for contributing an answer to Computer Science Stack Exchange!

• Please make sure to respond to the question. Provide details and share your research!

But to avoid

• Make statements based on the opinion; save them with references or personal experience.

Use MathJax to format equations. MathJax reference.

## 2 Step Consolidation – Computer Science Stack Exchange

The problem I am facing is a clustering problem, which is necessary for a vehicle routing problem (VRP) to which I am attacking. This is a heterogeneous VRP with time windows and capacity utilization constraint, ie a truck can only be routed if its load factor is greater than 80%.

We have a set of clients scattered on the map. Each customer has placed an order of a certain volume, ranging from 1,000 to 36,000 liters of a petroleum product.

I have to group these customers in order to route them. Right now, I'm using the k-means algorithm and finding the number of clusters I'm taking $$(int) frac {SumOfUnroutedOrders} { capacityOfBiggestIdleVehicle}$$

Unfortunately, this method is a little defective because of the following problems:

1) A cluster can be very small because the algorithm MUST create a number of clusters. In this case, the clients of this small cluster will not be routed because of the constraint of capacity utilization.

2) Creating clusters with remote clients to reach the cluster target volume (close to the capacity of the vehicle)

So my question is:

a) Do you know a method to find the optimal number of clusters, next to the elbow and silhouette methods, because the regrouping part is executed several times, and I can not waste time choosing the number of clusters for each iteration .

b) Do you know a variant of the algorithm k means that takes into account the volumes of the orders?

## Regex Expression – Computer Science Stack Exchange

Let L be the language used for the alphabet {0, 1, 2, 3, (,), +, -, *, /}, L is the set of operations with correctly formatted natural numbers (only one number is considered as belonging to L, 2 – – 3 is an incorrect expression, 2 + 3 is correct, 2 + (-3) is correct.
Is it possible to write a regular expression for this language? If not why?

I think it's not possible to write a regular expression for this language, because of the operator / we do not write 2/0 for example and are more than a combination of finite numbers to make that possible. That's ok then?

## terminology – Is there a term to express the meaning of counterpart in the field of computer science?

Suppose there are only 3 people A, B, C working for a company. In other words, the employees of the company are composed of A, B and C. A, B and C are colleagues of each other, within this company.

Similarly, machine learning (M) is a field of computer science that includes supervised learning (S), unsupervised learning (U), and reinforcement learning (R).

So, is it common to say that S, U and R are counterparties from each other in the field of machine learning?

Is there another term to express this meaning?

## insertion in the heap min – Computer Science Stack Exchange

These are the instructions that I have been given:

What does the table look like at each step when inserting "2" into the
next min-pile?

Write your answer as numbers separated by commas, with a space after each
number, for example, 0, 2, 3, 4

The heap starts at entry 1 (second entry) of the array, so start with
"0, …" for the unused input.

and I have to write the chart at every step like

Immediately after the addition of the article: for this step, I've 4 6 8 7 2

After the first sieving: 4 2 8 7 6

but it's fake apparently? I do not know why I do not know where and why I'm supposed to put a 0. Is there a different way to write?

## computer science – the algorithm solves the decision problem: does this binary string (yy) have an exact factor of $M$?

Forgive me, I have developed a growing interest. I just started working on my first research project as a hobby. So please be courteous to one of my mistakes and I will fix them for this stack.

Decision problem

For a binary string equal to the input value (integer) in terms of length.
Does this binary string $$(yy)$$ has an exact factor for $$M$$?

replication link of the work algorithm

paste

$$M$$ is basically a divisor. If there is no rest, then the answer is yes. If there is a rest, the answer is no.

In this case, the decision problem requires an integer so that it can create a bit string equal to the input value in terms of length. This is equivalent to counting. So, my algorithm will always run in $$O (2 ^ n)$$ time.

## Question

It was said that it is impossible to convert binary files into lean files in polynomial time.

If this assumption is true, would not my problem be just $$NP$$?

## Help science and earn money

Guys, I would like to share a great site to make money – Lifeinspace – lifeinspace.org

Lifeinspace allows you to rent the free computing power of your computer for scientific calculations and to be rewarded for it.

It's very easy, you have nothing to do.
You just have to register and start winning
lifeinspace.org

Let me describe in more detail
1. Register on the site.