Lifeboat Foundation

We live in a time where great software is available with the click of a mouse, often for free or — at least — low cost. But there’s a problem: how do you select from so many alternatives? We were interested in [Lee Teschler]’s review earlier this year of 30 free circuit simulators. If you are selecting one or don’t like the one you are currently using, it is well worth the time to review.

There are several on the list that you’ve probably heard of before like GNUCap and LTspice. There are also some lesser-known products. Some of those are just trial or student versions of paid products. Some are branded versions of commercial products (like Tina) or were made free after selling for higher price tags (like MicroCap 12).

Old favorites like Falstad (which is apparently known as Circuit Sims) and TinkerCAD made the list. Many of the trial versions were very limited. For example, DCAClab only provides an NPN bipolar transistor model. Proteus doesn’t let you save or print unless you pay. While the list includes TI’s Tina, it doesn’t seem to mention that TI also provides a free version of PSpice which is a very popular professional product.

Another version of the PCP theorem, not yet proved, specifically deals with the quantum case. Computer scientists suspect that the quantum PCP conjecture is true, and proving it would change our understanding of the complexity of quantum problems. It’s considered arguably the most important open problem in quantum computational complexity theory. But so far, it’s remained unreachable.

Nine years ago, two researchers identified an intermediate goal to help us get there. They came up with a simpler hypothesis, known as the “no low-energy trivial state” (NLTS) conjecture, which would have to be true if the quantum PCP conjecture is true. Proving it wouldn’t necessarily make it any easier to prove the quantum PCP conjecture, but it would resolve some of its most intriguing questions.

Then in June of 2022, in a paper posted to the scientific preprint site arxiv.org, three computer scientists proved the NLTS conjecture. The result has striking implications for computer science and quantum physics.

DNA-based information is a new interdisciplinary field linking information technology and biotechnology. The field hopes to meet the enormous need for long-term data storage by using DNA as an information storage medium. Despite DNA’s promise of strong stability, high storage density and low maintenance cost, however, researchers face problems accurately rewriting digital information encoded in DNA sequences.

Generally, DNA data storage technology has two modes, i.e., the “in vitro hard disk mode” and the “in vivo CD mode.” The primary advantage of the in vivo mode is its low-cost, reliable replication of chromosomal DNA by cell replication. Due to this characteristic, it can be used for rapid and low-cost data copy dissemination. Since encoded DNA sequences for some information contain a large number of repeats and the appearance of homopolymers, however, such information can only be “written” and “read,” but cannot be accurately “rewritten.”

To solve the rewriting problem, Prof. Liu Kai from the Department of Chemistry, Tsinghua University, Prof. LI Jingjing from the Changchun Institute of Applied Chemistry (CIAC) of the Chinese Academy of Sciences, and Prof. Chen Dong from Zhejiang University led a research team that recently developed a dual-plasmid editing system for accurately processing digital information in a microbial vector. Their findings were published in Science Advances.

This post is also available in: עברית (Hebrew)

The World Meteorological Organization (WMO) states that there’s a 93 percent chance that one year between now and 2026 will be the hottest on record. Not only will these record high temperatures have an impact on our environment and lives, but they are also expected to change the way in which we safeguard technology. For example, how do you cool data centers while the outside temperature keeps getting higher and higher?

This problem has been discussed previously before due to several failings of data centers around the world caused by cooling failures. That weather shift will have an impact on all human-made infrastructure—including the data centers that keep our planet’s collective knowledge online. According to wired.com, 45 percent of US data centers have experienced an extreme weather event that threatened their ability to operate.

When users want to send data over the internet faster than the network can handle, congestion can occur—the same way traffic congestion snarls the morning commute into a big city.

Computers and devices that transmit data over the internet break the data down into smaller packets and use a special algorithm to decide how fast to send those packets. These congestion control algorithms seek to fully discover and utilize available network capacity while sharing it fairly with other users who may be sharing the same network. These algorithms try to minimize delay caused by data waiting in queues in the network.

Over the past decade, researchers in industry and academia have developed several algorithms that attempt to achieve high rates while controlling delays. Some of these, such as the BBR algorithm developed by Google, are now widely used by many websites and applications.

Using just a handful of quantum bits, researchers have used a quantum computer to simulate an infinite line of electron-like particles. The technique could be used to better understand the behaviour of molecules in materials.

Computer-based animators who are tasked with bringing to life imaginary worlds and characters are aided by simulators that can model the many possible ways an object or fluid might move through a physical space. Known as “solvers,” these simulators provide a significant head start on the work of animation. But there’s a catch. As computers have gotten faster, these solvers often create too many options for the animator to effectively sort through looking for just the right one.

“A simulator can return thousands of options. It’s so time consuming to sort through them that these helpful solvers can’t be used to their full potential,” said Purvi Goel, a doctoral candidate in computer science at Stanford, who with her mentor, professor Doug James, has created a new approach to refine the search and narrow results to the most promising options.

Continue reading “A new, faster way to browse physics-based animations” »

It took researchers about 62 minutes to crack a late-stage Post-Quantum Encryption candidate algorithm using a single-core CPU.

Innovative Solutions For Unmet Needs Of Older Adults & Their Caregivers — Keith Camhi, Managing Director, Techstars Future of Longevity Accelerator — A Partnership With Melinda Gates Pivotal Ventures.

Keith Camhi is Managing Director, Techstars Future of Longevity Accelerator (https://www.techstars.com/accelerators/longevity), a program, run in partnership with Pivotal Ventures (https://www.pivotalventures.org/), an investment and incubation company created by Melinda French Gates, focusing on innovative solutions to address the unmet needs of older adults and their caregivers. The longevity accelerator core program themes include: Caregiver Support, Care Coordination, Aging in Place, Financial Wellness and Resilience, Preventive Health (both Physical and Cognitive), and Social Engagement.

Continue reading “Keith Camhi — Techstars Future of Longevity Accelerator — Innovative Solutions For Older Adults” »