Skip to main content

Posts

Showing posts from October 20, 2019

Featured Post

We Should Have Already Had This: The Lithium-Ion Battery With Built-In Fire Suppression

On October 22, 2020, yesterday, Dexter Johnson posted The Lithium-Ion Battery With Built-In Fire Suppression. Within this topic, Dexter Johnson regards a Stanford University research team and the SLAC National Accelerator Laboratory (its former name was the Stanford Linear Accelerator Center[1]). Johnson stated:Now [Yi] Cui and his research team, in collaboration with SLAC National Accelerator Laboratory, have offered some exciting new capabilities for lithium-ion batteries based around a new polymer material they are using in the current collectors for them. The researchers claim this new design to current collectors increases efficiency in Li-ion batteries and reduces the risk of fires associated with these batteries.[2]Johnson was saying this: fires are a current Li-ion battery threat that has been realized, but a new design can secure client use-case safety, and this required this battery redesigned. As this technology approaches marketplace entry points, this shall confront Li-io…

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 computing, Randall reported: von Neumann c…

A cutting-plane method for contiguity-constrained spatial aggregation

A Cutting Plane Method for a Special AggregationOn 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 StructuresOehrlein and Haunert wrote that planar subdivisions are regular 'geographic space' structures. Oehrlein and Haunert used the same integer linear programs, 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 methodOehrlein and Haunert used is a growth: on the ILP basis, the method parts are Objective, Constraints, and an exponent constraint number called contiguity constraints. Us…

Contact Form

Name

Email *

Message *