blog.area23.at - a simple url encoder/decoder

 a simple url encoder/decoder
 http://blog.area23.at

Labels

Wirtschaft (120) Österreich (92) Pressefreiheit (68) IT (47) Staatsschulden (30) code (25) EZB (19) Pensionssystem (13) France (1) music (1)

2017-03-29

Energy saving through dynamic working hours according to geographic circumstances?

Norge vinter sommer skip historisk



Scandinavia summer winter day length



Yearly Sun Graph for Oslo

Life rhythm - how it worked historically?

During winter with few hours of daylight Scandinavians were less active outside, ships were mostly overwintered, there were joint gatherings. In the summer, where Scandinavians had daylight from 14 hours to 18 hours per day, the people were longer active outside.

How is that elsewhere?
In southern mediterranean regions, a siesta is held during the summer at high noon and in the Middle East, North Africa nobofy travel through desert at high noon or early afternoon.

Would it make sense in Scandinavia to extend working hours in summer by 1,5h additionally and to shorten the same time interval from working hours in winter?
No idea, I simply don't know!

2017-03-20

avoid arpspoofing and seperate clients not together same unsure pool

We know it all very well:
There is this cheap standard router, where all clients no matter, how they were connected, swim like little gold fishes in one and the same 256 subnet pool. All those connecting clients are often not really seperated from all other clients, the best way for hackers & arpspoofers to do evil monkey biz
This is a new concept, where each connecting client gets a seperate subnet with only 1 free IPaddr

2017-03-19

There are infinite prime numbers

supposing , that there are finite prime numbers, p1, p2, ..., p(n-1), pn,
where pn is the hightest prime number. 
this furthermore implies, that a number q would exists, which is defined:
q = p1 * p2 * ... * p(n-1) * pn + 1
q is greater than 1 and cause pn is the highest prime number,
q must have at least one or more divider r from p1, p2, ..., p(n-1), pn
since r|q and r|(p1...pn) => r|1 (what is not possible)
q.e.d.