- IEEE Standard for Local and Metropolitan Area Networks--Link Aggregation.pdf

Computer Organization and Design fifth edition 英文原版

Find out everything you need to know to build powerful robots with the most up-to-date ROSBuilding and programming a robot can be cumbersome and time-consuming, but not when you have the right collection of tools, libraries, and more importantly expert collaboration. ROS enables collaborative software development and offers an unmatched simulated environment that simplifies the entire robot building process.This book is packed with hands-on examples that will help you program your robot and give you complete solutions using open source ROS libraries and tools. It also shows you how to use virtual machines and Docker containers to simplify the installation of Ubuntu and the ROS framework, so you can start working in an isolated and control environment without changing your regular computer setup.It starts with the installation and basic concepts, then continues with more complex modules available in ROS such as sensors and actuators integration (drivers), navigation and mapping (so you can create an autonomous mobile robot), manipulation, Computer Vision, perception in 3D with PCL, and more. By the end of the book, you’ll be able to leverage all the ROS Kinetic features to build a fully fledged robot for all your needs.,解压密码 share.weimo.info

Extending SSIS with .NET Scripting

该文档为特斯拉Model3北美版用户手册，英文完整原版，发布于2020年04月份。 总体看下来，北美版的特斯拉在配置上确实与国产特斯来有配置上的差异，需要的同行可以下载下来有针对性的搜索相关领域，可以用作benchmark对标参考车型资料

包含 第7版的卷1，卷2A，卷2B 相当经典的一部名著！

Programming Abstractions In C

OpenCV3.4.5官方文档，主要api介绍及代码展示，简单的理论介绍，英文原版，为无法下载的同学提供方便

Mastering Regular Expressions 3rd Edition

Abstract. A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide part of the solution, but the main benefits are lost if a trusted third party is still required to prevent double-spending. We propose a solution to the double-spending problem using a peer-to-peer network. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power. As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers. The network itself requires minimal structure. Messages are broadcast on a best effort basis, and nodes can leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone.