Skip to main content

Posts

Showing posts with the label Mathematics

Featured Post

Spectre and Meltdown Explained, and a Proposed Counter Against Them

On January 15, 2018, 2:58 AM PST, Josh Fruhlinger wrote Spectre and Meltdown explained: What they are, how they work, what’s at risk . As threats, regarding these two risks, Spectre and Meltdown, Fruhlinger wrote, “In the first days of 2018, published research revealed that nearly ever computer chip manufactured in the last 20 years contains fundamental security flaws, with specific variations on those flaws being dubbed Spectre and Meltdown ” (Fruhlinger, Jan 15, 2018). Fruhlinger was stating this: despite the best known efforts Electrical Engineers and Computer Scientists exercised, computer chip technology dated 1998 AD - 2018 AD has experienced an error, design flaws, that led to known defects, Spectre and Meltdown, and these are potentially great failures.  Side-channel technology requires high grade technical research, and this can be because Spectre and Meltdown exist, so a layman would not have known it, 22 years ago. According to Josh Fruhlinger, speculative execution and cac

A cutting-plane method for contiguity-constrained spatial aggregation

A Cutting Plane Method for a Special Aggregation On November 28, 2017 AD, the Institute of Geodesy and Geoinformation, University of Bonn, Germany accepted an article: by Johannes Oehrlein and Jan-Henrik Haunert, a cutting-plane method for contiguity-constrained spatial aggregation ( link ). Planar Subdivisions are Geographic Space Structures Oehrlein and Haunert wrote that planar subdivisions are regular 'geographic space' structures. Oehrlein and Haunert used the same integer linear program s, but the constraints ensured contiguity differences. Next, Oehrlein and Haunert adapted a Shirabe model: on spatial unit allocation. After that, Oehrlein and Haunert wrote: area aggregation is an important map-generalization step; but it contains line simplication, selection, and displacement. Further, the cutting-plane method Oehrlein and Haunert used is a growth: on the ILP basis, the method parts are Objective, Constraints, and an exponent constraint number called contiguity con

Contact Form

Name

Email *

Message *