Toolleeo's links
We present HotStuff, a leader-based Byzantine fault-tolerant replication
protocol for the partially synchronous model. Once network communication
becomes synchronous, HotStuff enables a correct leader to drive the protocol to
consensus at the pace of actual (vs. maximum) network delay--a property called
responsiveness--and with communication complexity that is linear in the number
of replicas. To our knowledge, HotStuff is the first partially synchronous BFT
replication protocol exhibiting these combined properties. HotStuff is built
around a novel framework that forms a bridge between classical BFT foundations
and blockchains. It allows the expression of other known protocols (DLS, PBFT,
Tendermint, Casper), and ours, in a common framework.
Our deployment of HotStuff over a network with over 100 replicas achieves
throughput and latency comparable to that of BFT-SMaRt, while enjoying linear
communication footprint during leader failover (vs. quadratic with BFT-SMaRt).
In the midst of the deep learning hype, p-values might not be the hottest topic in data science. However, association mapping remains a fundamental tool to justify and underpin scientific conclusions. Inspired by an approach for time series classification based on predictive subsequences (i.e shapelets [1]), we developed S3M, a method that identifies short time series subsequences that are statistically associated with a class or phenotype while tackling the multiple hypothesis problem.
Daniel J. Bernstein, Bo-Yin Yang. "Fast constant-time gcd computation and modular inversion."
Lookup the rank of your conference.
This video demonstrates the concept of series-elastic actuators (SEAs) and how they are used in rehabilitation robotics.
An old artifact kept in a vault outside Paris is no longer the standard for the kilogram. Now, nature itself provides the definition.
Developed in China, the lidar-based system can cut through city smog to resolve human-sized features at vast distances.
A new proof with important implications for game theory shows that no algorithm can possibly determine the winner.
You’ve probably played with model trains, for instance with something like the Brio set shown below.1 And if you’ve built a layout with a model train set, you may well have wondered: is it possible for my train to use all the parts of my track?
Rebuttal to the opinion of Christoph Buchal, Hans-Dieter Karl and Hans-Werner Sinn titled “Coal Engines, Wind Engines and Diesel Engines. What does the CO2 balance show?”
Britney Crystal Gallivan (born 1985) of Pomona, California, is best known for determining the maximum number of times that paper or other materials can be folded in half.
In early tests, this laser-activated silk and gold material held wounds together better than stitches or glue.
This is the abstract of the paper published on this painting UAV.
This paper describes a system for autonomous spray painting using a UAV, suitable for industrial applications. The work is motivated by the potential for such a system to achieve accurate and fast painting results. The PaintCopter is a quadrotor that has been custom fitted with an arm plus a spray gun on a pan-tilt mechanism. To enable long deployment times for industrial painting tasks, power and paint are delivered by lines from an external unit. The ability to paint planar surfaces such as walls in single color is a basic requirement for a spray painting system. But this work addresses more sophisticated operation that subsumes the basic task, including painting on 3D structure, and painting of a desired texture appearance. System operation consists of (a) an offline component to capture a 3D model of the target surface, (b) an offline component to design the painted surface appearance, and generate the associated robotic painting commands, (c) a live system that carries out the spray painting. Experimental results demonstrate autonomous spray painting by the UAV, doing area fill and versatile line painting on a 3D surface.
The Fibonacci numbers are the sequence 1, 1, 2, 3, 5, 8, ..., and satisfy the recurrence F(n) = F(n – 1) + F(n – 2).
They also have a beautiful formula.
My favorite derivation of this formula entirely avoids algebraic manipulation.
Roughly speaking, Gödel’s Incompleteness Theorem states that there are true mathematical statements that cannot be proven. When I was in 11-th grade, my geometry teacher Mr. Olsen, my friend Uma Roy, and I spent five weeks reading through Gödel’s original proof of the theorem. Why did it take so long? Partly because Uma and I were high-school students. Partly because Gödel was a less-than-talented writer. But mostly because the proof is actually pretty hard.
Experienced programmers often need to use online resources to pick up new programming languages. However, we lack a comprehensive understanding of which resources programmers find most valuable and utilize most often. In this paper, we study how experienced programmers learn Rust, a systems programming language with comprehensive documentation, extensive example code, an active online community, and descriptive compiler errors. We develop a task that requires understanding the Rust-specific language concepts of mutability and ownership, in addition to learning Rust syntax.
Our results show that users spend 42% of online time viewing example code and that programmers appreciate the Rust Enhanced package’s in-line compiler errors, choosing to refresh every 30.6 seconds after first discovering this feature. We did not find any significant correlations between the resources used and the total task time or the learning outcomes. We discuss these results in light of design implications for language developers seeking to create resources to encourage usage and adoption by experienced programmers.
Researchers at the University of Tokyo were expecting to create a strong magnetic field, but they got a lot more than they were bargaining for.
Potential predatory scholarly open‑access publishers
Instructions: first, find the journal's publisher - it is usually written at the bottom of journal's webpage or in the "About" section. Then simply enter the publisher's name or its URL in the search box above. If the journal does not have a publisher use the Standalone Journals list.