Who is this person in the right corner at the floor?

I know this question has little to do with security excuse me for this.

I lost my phone. Because I wan’t to track the person who now has the phone, I’m trying to contact my phone anyway. But I see something strange.

Who is this person I see in the right corner at the bottom? Would this be the person on the other side now owning my phone?


enter image description here

Why can’t we use the Master Theorem on recurrences with floor or ceiling operations? [duplicate]

This question already has an answer here:

  • Master Theorem and rounding up to the nearest integer 1 answer
  • Rigorous proof for validity of assumption $ n=b^k$ when using the Master theorem 1 answer

From my understanding, using such operators on large numbers doesn’t have an impact on running time, since the integer rounding becomes negligible after a certain point. For example, the recurrence $ $ T(n)= \begin{cases} T(\lfloor{n/2}\rfloor)+(\log(n))^{2}, & \text{if $ n>1$ } \ 1 & \text{if $ n=1.$ } \end{cases} $ $ is unsolvable using the Master Theorem, whereas $ $ T(n)= \begin{cases} T({n/2})+(\log(n))^{2}, & \text{if $ n>1$ } \ 1 & \text{if $ n=1.$ } \end{cases} $ $ is solvable using the Master Theorem. Why is this?

EDIT: Why doesn’t this floored example work? Isn’t it monotonically increasing?

3D Collisions – Walking below a slope pushes me through the floor

Here’s a really short video (less than 30s) of this issue : https://www.youtube.com/watch?v=JrKbpTY8cMU

When I move the player towards a slope (the player is below it), it pushes the player inside the floor Collider instead of blocking it.

I’ve searched the Internet for a while but haven’t found anything about it

Do you have something in mind ?
Thanks for your time

Info : I move the player using rigidbody.MovePosition()

The collision of the player is a Capsule.

floor instead of ceiling for log2

A colleague and myself are working out the compression factor for dictionary compressions and we came accross this site, exploring binary, in the example of converting base 10 to base 2 numbers it recommends the use of floor instead of ceiling, $ $ bspec = ⌊log2(n)⌋ + 1$ $

To quote the author, “You might be tempted to use the ceiling function — ⌈x⌉, which is the smallest integer greater than or equal to x — to compute the number of bits as such:”

$ $ bspec = ⌈log2(n)⌉$ $

However, this fails when n is a power of two.

Could you explain how ceiling fails when n is power of two? And maybe from the perspective of people that are more accustomed to programming not math.

How to make a transformation to the floor function to the right or left?

Assume a function called $ f(x)$ , Then all of us know that of we draw $ f(x+a)$ it will be a transformation to the left or right and $ f(x)+b$ to up or down.

But when I drew floor function on Desmos online graphing I found something a little bit different.

View post on imgur.com

As you see that the black function is exactly on the purple one and that confusing me , Here $ f(x+a)=f(x)+a$ , And we are just rising the function up .

To be more specific I need you to explain these question :

$ 1.$ Why when we add a number in the floor function notation $ f(x+a)$ or $ [\frac {x}{2}+1]$ it rise the function.

$ 2.$ How can transform the function to the left just a unit.

Couple forced to fly on the floor

A couple was forced to spend a 2h flight on the floor, because the seats they had purchased didn’t exist (airplane swapped).

What should the passenger do when finding theirself in a situation like that? I mean how to handle it, and what can they request (if anything) during the flight.

I am not interested in the colossal safety hazard here, nor the legal postactions that can be made.

What algorithm is appropriate for a thermostat controlling the heating of a room with floor heating?

I built my own thermostat that controls the boiler heater for the radiant floor heating in my house and I would like to develop / implement a smarter temperature control algorithm. What I am specifically interested in is the ability to predict when to turn on the heating so that a certain temperature is achieved according to a schedule.

Suppose I want the temperature at 7 am to be 22 degrees Celsius. During the night I want it to be at 18C. Currently, I set the schedule up so that the heating is started at 6 am but depending on how cold it is during the night, an hour may be too little and the temperature does not rise to 22C or it may be to much and the temperature overshoots. I would like an algorithm that would automatically calculate the appropriate time at which to start heating.

I keep searching online and most results are for industrial uses and/or for heating systems that can be modulated such as electrical heaters. The heating system in my house consists of a boiler that heats the water in the floor tubing and I cannot modulate the output, I can only tell it to start or to stop via a mechanical relay that opens or closes a solenoid valve. This, I believe, renders a PID algorithm inappropriate. Fuzzy logic and just PI control may be suitable but can they be made to work with varying set points?

Supervised machine learning is overkill for my needs and I don’t want to spend weeks to train it.

What other options would I have?