Tootfinder

India Approves Massive $9 Bil. Rooftop Solar Plan with Panels for 10 Million Homes https://www.goodnewsnetwork.org/india-approves-massive-9-bil-rooftop-solar-plan-with-panels-for-10-million-homes/

India Approves Massive $9 Bil. Rooftop Solar Plan with Panels for 10 Million Homes
Subsidies for a 2-kilowatt solar array will cover as much as 60% of the installation costs, falling to 40% for arrays 3 kilowatts or higher.

inploid: Inploid: an online social Q&A platform
Inploid is a social question & answer website in Turkish. Users can follow others and see their questions and answers on the main page. Each user is associated with a reputability score which is influenced by feedback of others about questions and answers of the user. Each user can also specify interest in topics. The data is crawled in June 2017 and consist of 39,749 nodes and 57,276 directed links between them. In addition, for …

World's Largest Rooftop Solar Power Plant To Be Built In Denmark - 35 MW on a massive, 300,000 m² logistics center. https://cleantechnica.com/2024/03/01/worlds-largest-rooftop-solar-power-plant-to-be-built-in-denmark/…

World's Largest Rooftop Solar Power Plant To Be Built In Denmark - CleanTechnica
Danish Solar Company To Build The World's Largest Rooftop Solar Power Plant In Horsens

Michigan woman found living inside rooftop store sign with desk and coffee maker
Contractors curious about an extension cord on the roof of a Michigan grocery store made a startling discovery:
a 34-year-old woman was living inside the business sign, with enough space for a computer, printer and coffee maker, police said.
“She was homeless,” said Brennon Warren, an officer with the Midland police department.
“It’s a story that makes you scratch your head, just somebod…

Applicability of oculomics for individual risk prediction: Repeatability and robustness of retinal Fractal Dimension using DART and AutoMorph
Justin Engelmann, Diana Moukaddem, Lucas Gago, Niall Strang, Miguel O. Bernabeu
https://arxiv.org/abs/2403.06950

Applicability of oculomics for individual risk prediction: Repeatability and robustness of retinal Fractal Dimension using DART and AutoMorph
Purpose: To investigate whether Fractal Dimension (FD)-based oculomics could be used for individual risk prediction by evaluating repeatability and robustness. Methods: We used two datasets: Caledonia, healthy adults imaged multiple times in quick succession for research (26 subjects, 39 eyes, 377 colour fundus images), and GRAPE, glaucoma patients with baseline and follow-up visits (106 subjects, 196 eyes, 392 images). Mean follow-up time was 18.3 months in GRAPE, thus it provides a pessimisti…

Honest question I couldn’t answer with Googling: is Avaaz a reputable org to donate to?

if AWS does repeatably random batch job jitter (the time it picks in a 1 hour window is consistent from day to day for the job)
how long does it keep the same predictable time slot before reshuffling when jobs happen?
(a similar thing happens in jenkins jobs called hash-time, and you can enable random timing in cron too with a custom jitter amount)

Refutability as Recursive as Provability
Paola Cattabriga
https://arxiv.org/abs/2404.04038 https://arxiv.org/pdf/2404.04038

Refutability as Recursive as Provability
Godel numbering is an arithmetization of sintax which defines provability by coding a primitive recursive predicate, Pf(x,v). A multiplicity of researches and results all around this well-known recursive predicate are today widespread in many areas of logic and AI. Not equally investigated is the refutability predicate defined by Godel numbering within the same primitive recursive status. Rf(x,v) can be defined as a recursive predicate meaning that x is the Godel number of a refutation in PA of…

On the existence of $\delta$-temporal cliques in random simple temporal graphs
George B. Mertzios, Sotiris Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis
https://arxiv.org/abs/2404.07147

On the existence of $δ$-temporal cliques in random simple temporal graphs
We consider random simple temporal graphs in which every edge of the complete graph $K_n$ appears once within the time interval [0,1] independently and uniformly at random. Our main result is a sharp threshold on the size of any maximum $δ$-clique (namely a clique with edges appearing at most $δ$ apart within [0,1]) in random instances of this model, for any constant~$δ$. In particular, using the probabilistic method, we prove that the size of a maximum $δ$-clique is approximately $\frac{2\…

inploid: Inploid: an online social Q&A platform
Inploid is a social question & answer website in Turkish. Users can follow others and see their questions and answers on the main page. Each user is associated with a reputability score which is influenced by feedback of others about questions and answers of the user. Each user can also specify interest in topics. The data is crawled in June 2017 and consist of 39,749 nodes and 57,276 directed links between them. In addition, for …