no logro que al mover el control deslizante se actualice solo el resultado, Tkinter Scale

Cordial saludo amigos, tengo el siguiente código:

from tkinter import *  def suma():      valor2 = 0     R = valor2 + valor1.get()     return resultado.set(R)  root = Tk() root.title("Slider - Funcionamiento") root.geometry('1000x600+120+40') root.iconbitmap('descarga.ico') root.resizable(0,0)  valor1 = IntVar() resultado = IntVar() Slider1 = Scale(root, orient = VERTICAL, length = 155, from_ = 0, to = 10,              tickinterval = 1, variable = valor1) Slider1.place(x = 200, y = 200)  pantalla = Entry(root, textvariable = resultado, state = "disable") pantalla.place(x = 32, y = 500) boton10 = Button(root, text = "suma", width = 20, height = 1,              command = suma) boton10.place(x = 130, y = 360)  root.mainloop() 

lo que quisiera es que al mover el scale, y variar entre sus valores, el resultado que se muestra en el Entry cambie sin necesidad de estar presionando el boton de resultado.

¿como puedo lograr esto? Agradeceria su ayuda.

How to auto scale plot

I have this large equation involving the variables x, y and I need to plot it with all its important features. How? Is there an auto fit/zoom feature?

25448251500000 - 535526010000 x + 5077310000 x^2 - 36775800 x^3 +    250890 x^4 - (6199 x^5)/5 + (17 x^6)/5 - x^7/250 + 920347020000 y -    16448410100 x y + 122367000 x^2 y - 607718 x^3 y + (15694 x^4 y)/   5 - (7099 x^5 y)/500 + (9 x^6 y)/250 - (x^7 y)/25000 +    15128205050 y^2 - 220083300 x y^2 + 1275939 x^2 y^2 - (   19598 x^3 y^2)/5 + (8699 x^4 y^2)/1000 - (11 x^5 y^2)/500 + (   x^6 y^2)/50000 + 152047500 y^3 - 1691358 x y^3 + 7640 x^2 y^3 - (   96 x^3 y^3)/5 + (13 x^4 y^3)/500 - (x^5 y^3)/25000 + 1032409 y^4 - (   40191 x y^4)/5 + (119 x^2 y^4)/5 - (11 x^3 y^4)/250 + (x^4 y^4)/   50000 + (24094 y^5)/5 - (12299 x y^5)/500 + (9 x^2 y^5)/250 - (   x^3 y^5)/25000 + (14699 y^6)/1000 - (23 x y^6)/500 + (x^2 y^6)/   50000 + (13 y^7)/500 - (x y^7)/25000 + y^8/50000 +    5089650300000 Sin[x] - 107105202000 x Sin[x] +    1015462000 x^2 Sin[x] - 7355160 x^3 Sin[x] + 50178 x^4 Sin[x] -    6199/25 x^5 Sin[x] + 17/25 x^6 Sin[x] - (x^7 Sin[x])/1250 +    133172901000 y Sin[x] - 2218630000 x y Sin[x] +    14318780 x^2 y Sin[x] - 47992 x^3 y Sin[x] + 6299/50 x^4 y Sin[x] -    9/25 x^5 y Sin[x] + (x^6 y Sin[x])/2500 + 1693912000 y^2 Sin[x] -    21830360 x y^2 Sin[x] + 112000 x^2 y^2 Sin[x] -    304 x^3 y^2 Sin[x] + 12/25 x^4 y^2 Sin[x] - (x^5 y^2 Sin[x])/1250 +    13470380 y^3 Sin[x] - 119968 x y^3 Sin[x] + 408 x^2 y^3 Sin[x] -    4/5 x^3 y^3 Sin[x] + (x^4 y^3 Sin[x])/2500 + 71778 y^4 Sin[x] -    10199/25 x y^4 Sin[x] + 17/25 x^2 y^4 Sin[x] - (x^3 y^4 Sin[x])/   1250 + 12299/50 y^5 Sin[x] - 21/25 x y^5 Sin[x] + (x^2 y^5 Sin[x])/   2500 + 12/25 y^6 Sin[x] - (x y^6 Sin[x])/1250 + (y^7 Sin[x])/2500 ==   0 

What system can I use for a small scale battle? [duplicate]

This question already has an answer here:

  • Is there a proper way to handle large combat engagements with party members involved? 3 answers
  • How can I model the mechanics of an army battlefield scene? 2 answers

I am DMing an homebrew DND 5e adventure. My players are going to defend a village from an orc tribe. The village will have around 100 armed farmers. Players also gained support of a local dwarven mining expedition ( around 30 dwarwes ), and freed an enslaved kobold tribe from the orcs ( about 15 surviving kobolds ).

The village will be defended by 100 farmers, 30 dwarfs and 15 kobolds againts 50ish orcs and 30ish goblins.

They don’t know the exact numbers, I will adjust depending on how they will prepare for this.

I took a look at unhearted arcana mass combat, but I think it’s unlikely to be fun, interesting or balanced for this type of battle.

I would like the players (4 players) to be field commanders of this small army, each commanding a small amount of units.

Is there any system that can let the players play out the battle?

Incident response to a medium scale phishing attack whereas the targets are not from our company?

Our company suffered a phishing attack yesterday. While investigating about the attacker and the potential employees of ours who might have been phished, we ended up with the attacker database of phished users.

This database include user email and passwords (~40) from multiple companies (~10) who seems to be sharing the same phishing attack as us. Moreover, it seems that the target are high profile.

So far, here is what we have been accomplishing :

  • Contact targeted companies and list phished users
  • Contact websites where the phishing attack is happening (it is happening on multiple hacked websites so it’s hard to stop it)

However, we’re not sure this is the best way to deal with the following situation, here is why :

  • More and more users still enter their credentials and this is not our role to secure other companies users and we would like to stop wasting time on this (most of the companies following up to our email or calling us asking for more details).

  • We are worried that some companies (targeted companies being in the same industry as us) might not understand us well and think we are in some way associated to that phishing attack because we are one of their competitors

  • We are doing security for our competitors (so we’re spending money for them)

One solution could be to publish a blog post but it has downsides too such as being seen as a toxic player because we would be pointing fingers at our competitors security. Another solution would be not to contact this companies and let them get compromised.

What would be the best way to react to this phishing attack ?

Do pseudo-polynomial algorithms for NPC-problems scale in practice?

Given for example the NP-complete (NPC) Knapsack-problem, we know that there exists pseudo-polynomial algorithms that run in $ O(n*w)$ , where $ W$ is pseudopolynomial.

Are those algorithms useful to solve Knapsack in practice? Do they scale with the input size of the pseudo-polynomial input instance?

My intution is the following: Suppose we have $ w= 1.000.000$ Then, the running time is basically the same as if we have $ w=2.000.000$ . So, as long as $ w$ does not grow exponentially, the pseudo-poly algorithm has a linear running time in practice.

Is this assumption true? Can we use pseudo-poly algorithms to solve NPC problems in practice? Or are their any other “hidden pitfalls”? I would appreciate some empiricial studies.

How to Scale this Image Rollover CSS UL Menu? Disappearing Images when Browser Scaled Down.

Hello, I'm having issues with this dictionary menu I'm working on. They are image rollovers using one image file and a ul list. However, when I scale the browser down the letters will disappear. I would like the whole menu to just scale down smaller to fit the screen. How can this be done? After doing some searches someone said it's because of the float, what would need to be done to correct this issue from happening?

You can see my menu here to see what I mean……

How to Scale this Image Rollover CSS UL Menu? Disappearing Images when Browser Scaled Down.

How do I scale a group in Phaser 3

In Phaser 2 we scale a simple by setting the scale property as explained in docs:

https://phaser.io/examples/v2/groups/group-scale

But there is no equivalent in Phaser v3.

The possible url https://phaser.io/examples/v3/groups/group-scale points to nothing. And if I do:

this.enemies = this.add.group(); this.enemies.scale.set(2, 2); 

It throws:

 Phaser v3.19.0 (WebGL | Web Audio)  https://phaser.io indexph.js:22 Uncaught TypeError: Cannot read property 'set' of undefined 

What is the appropriate form to scale a group of sprites in Phaser 3?

How well do multi objective optimization algorithms such NSGAii scale when there are many objectives (for example 10 or more)?

What I’m trying to figure out is what happens when using a multi objective optimization algorithm such as NSGA-ii and instead of trying to find the usual 2/3 objectives, I use 10 or many more objectives?

How do I scale up a monster for a large party?

I am DMing a game for 6 PCs who are currently level 5.

During gameplay, even high-CR monsters have been easy pickings for them due to their advantage in numbers. They are starting to underestimate single-monster encounters.

I don’t want to always try to match the monster numbers (because sometimes it makes sense that that particular opponent is alone).

Problem to solve

I don’t want to shower them with hordes of monsters at every encounter. How do I scale up some of the more story-driving monsters for a more memorable campaign?