Skip to main content


Showing posts from October 20, 2019

Featured Post

On Trust, Bias, and Privilege: my Response to 'Anti-Blackness is no glitch'

In Winter 2020, Stephanie T. Jones and Natalie Melo wrote ‘Anti-Blackness is no glitch’: The need for critical conversations within computer science education . Jones and Melo mentioned, “The conversation around and application of computer science often reinforces neoliberal ideals” (Jones, Melo, November 25, 2020, pg. 42). Jones and Melo were saying this: the computer science revolution and organizational IT network futuristic left-wing best standards access is telling. For Trust, I am Checking my Privilege But this is not excluding contemporary conversations: any futuristic conversation based on personal interpretation is not from ABBA, so it is not prophecy (NIV, 2 Peter 1:20). For your review, Peter wrote, "For prophecy never had its origin in the human will, but prophets, though human, spoke from [ABBA] as they were carried along by the Holy Spirit" (2 Peter 1:21). You, reader, can predict something shall happen, but prediction is uncertain: it is a terminating series ca

Google: Quantum Supremacy

On October 23, 2019, Ian Randall wrote Google says it has achieved 'quantum supremacy' with super computer that  'can complete TEN THOUSAND years' work in just three minutes' ( link ) Ten Thousand Years Randall wrote: with a processor that performed minutes work, Google claimed a quantum computing breakthrough, and the same task would have taken classic computers ten thousand years. Next, Randall reported quantum supremacy, a proposition achieved, for it surpassed normal computers: in computer research, this had been a decades-long goal. A Fledgling Technology After that, Randall wrote that the results, faster computing, was proven: in the real world, no sneak physical law stopped this, reported researchers. In Randall's technology article, quantum computing is a fledgling technology, and it uses the abnormal quantum physics: to achieve greater information processed.  To Quantum Computers, the von Neumann Computer On normal co

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


Email *

Message *