Skip to main content


Showing posts from October 20, 2019

Featured Post

Resuming Pace: I Shall Not Be Pursuing a Second Bachelor's Degree

On May the 5th, 2021, I used a strong position deciding my pursuit of a second Bachelor’s degree: my choice was the University of Maryland Global Campus (UMGC, link ), but I decided to resume my Master’s program, by itself.  Let me explain with Scripture: the Gospel of Jesus Christ According to Matthew, specifically. In ancient times, records of a man called Jesus the Christ were written. Among these records was a Gospel, According to Matthew, of Jesus Christ. According to legend, Jesus Christ stated, “Blessed are the meek: for they shall inherit the earth (KJV, Matthew 5:5, link ).” Jesus the Christ was saying those who are submissive shall inherit the earth rather than those who are brash.  In my attempt at starting a second Bachelor’s program, I eventually realized I had been too pushy: I wanted the May 19th start date, and I wanted the admission process expedited, I wanted ease of access between majors, I wanted advantages to the application process because of what UMGC (I was gra

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 *