Podcasts about 1kb

  True Faith- “How Do I Know I'm Saved?”                                            Pt. 4 “Fortitude”                                                                           Colossians 1:21-23   God's Preservation (vv.21-22)   Phil. 1:6  And I am sure of this, that he who began a good work in you will bring it to completion at the day of Jesus Christ     Ro. 8:31,33,39 31 What then shall we say to these things? If God is for us, who can be[i] against us?.. 33 Who shall bring any charge against God's elect? It is God who justifies….  39 nor height nor depth, nor anything else in all creation, will be able to separate us from the love of God in Christ Jesus our Lord.   Our Perseverance (vv. 22b -23)   Jo. 6:66-69 66 After this many of his disciples turned back and no longer walked with him. 67 So Jesus said to the twelve, “Do you want to go away as well?” 68 Simon Peter answered him, “Lord, to whom shall we go? You have the words of eternal life, 69 and we have believed, and have come to know, that you are the Holy One of God.”   Job 1:20-22 20 Then Job arose and tore his robe and shaved his head and fell on the ground and worshiped. 21 And he said, “Naked I came from my mother's womb, and naked shall I return. The Lord gave, and the Lord has taken away; blessed be the name of the Lord.” 22 In all this Job did not sin or charge God with wrong.   1 Cor. 15:1-2 Now I would remind you, brothers, of the gospel I preached to you, which you received, in which you stand, 2 and by which you are being saved, if you hold fast to the word I preached to you—unless you believed in vain   Ro. 8:35-39 35 Who shall separate us from the love of Christ? Shall tribulation, or distress, or persecution, or famine, or nakedness, or danger, or sword? 36 As it is written,   “For your sake we are being killed all the day long;     we are regarded as sheep to be slaughtered.”   37 No, in all these things we are more than conquerors through him who loved us. 38 For I am sure that neither death nor life, nor angels nor rulers, nor things present nor things to come, nor powers, 39 nor height nor depth, nor anything else in all creation, will be able to separate us from the love of God in Christ Jesus our Lord.       7-14.docx46.1kB

Добрый день уважаемые слушатели. Представляем новый выпуск подкаста RWpod. В этом выпуске: Ruby Rails 7 adds Enumerable#maximum Rails design patterns Code Loaders in Ruby: Understanding Zeitwerk Redis rate limiter Do Not Use the MacOS System Ruby Upgrow - a sustainable architecture for Ruby on Rails Web The Future of Web Software Is HTML-over-WebSockets Time for Next-Gen Codecs to Dethrone JPEG JavaScript performance beyond bundle size Streams — the definitive guide Simple-keyboard - a fast, dependency-free and customizable virtual keyboard for rich and snappy web applications Goober - a less than 1KB css-in-js solution RactivePlayer - create interactive videos in React RWpod Cafe #19 (06.03.2021) RWpod Cafe #19 Темы для выпуска

Historie: 1942 Konrád Zuse - počítač Zuse Z4 - zničený při náletu, 1944 Howard Aiken - Reléový počítač MARK 1 - podpora IBM, možné výpočty pro 1. atomovou bombu 1945 Pensylvánská univerzita: ENIAC (Electronic Numerical Integrator and Calculator) - 1. Elektronkový počítač 1951 - UNIVAC - 1. Sériově vyráběný počítač (nikoli však pro domácí použití) - firma Rennington, 60. - 70. Léta - sálové počítače, velké množství dat zpracováváno na zakázku, terminál: monitor + klávesnice napojeny na rozměrný počítač, herní konzole 80. Léta - osobní počítače, první mikroprocesor Intel C4004 - 1971 - první osobní počítače řady PC, 1981 IBM PC/XT 5150 , 1984 IBM PC/AT (Advanced Technology), v následujících letech rozhodující: velikost diskových kapacit, rychlost procesorů, dnes: výkon grafické karty, RAM, úložná kapacita disků, optické mechaniky - DVD, Blu-ray, nyní nahrazují cloudová úložiště, flash disky, konkurence PC: Mackintosh (Apple) POUŽITÍ POČÍTAČŮ: kancelářské aplikace, databáze, komunikace - VoIP (Voice over Internet Protocol), Grafika/ grafické systémy: GIS, CAD/CAM(Computer aided manufacturing), Řídící systémy, výzkum a vývoj, Audiovize - audiovizuální efekty, Zábava - zábavní průmysl - herní konzole, joystick, Další: tablety, smartphony JEDNOTKY 1 bit 0/1, 1 byte/bajt: 8 bitů 1kB = 1024 bytů/ bajtů, 1MB = 1024 kB, 1GB = 1024 MB, 1TB = 1024 GB, 1024 == 2^10 VON NEUMANNOVO SCHÉMA: vstupní zařízení - vstup dat, ALU (arithmetic-logic unit) - aritmeticko-logická jednotka - matematické a logické operace operační paměť - ukládání dat popř. mezivýsledků, řadič - řídí činnost všech částí počítače, vstupní zařízení - zobrazuje výstup, Dnes: ALU + Řadič = Procesor, procesor + operační paměť = CPU (Central processing unit)

Добрый день уважаемые слушатели. Представляем новый выпуск подкаста RWpod. В этом выпуске: Ruby What’s new in Interactive Ruby Shell (IRB) with Ruby 2.7, Ruby 2.7 adds Integer#[] to support range values, Rails 6 adds add_foreign_key and remove_foreign_key for SQLite3, Puma 4.2.0 и Behind-the-scenes of ‘Geared Pagination’ in Rails Best practices when writing a Dockerfile for a Ruby application, Erubi - a ERB template engine for ruby и The Journey to One Million by Samuel Williams (video) Web V8 release v7.8, Node v12.11.0, Wikipedia’s JavaScript initialisation on a budget и Why JavaScript Tooling Sucks 15 Must-Have Vue Directives That Will Significantly Maximize Your Productivity, GPU.js 2.0, OGL - a small, effective WebGL framework, Repeater.js - a missing constructor for creating safe async iterators, Robot - fast 1kB functional library for creating Finite State Machines и React-Toastify 5.4.0

Join Theo Roth as he describes his lab's novel CRISPR-Cas9 genome-targeting system that does not require viral vectors to modify T cell genomes, but instead focuses on HDR. This allows rapid and efficient insertion of large DNA sequences at specific sites in the genomes of primary human T cells, and permits individual or multiplexed modification of endogenous genes. Importantly, avoiding the use of viral vectors will result in accelerated research and clinical applications, reduce experimental cost, and improve safety. In this webinar, you will learn: - The advantages of using HDR versus recombinant viral vectors when modifying T cell genomes - How long double-stranded and single-stranded DNA can serve as a non-viral HDR template - A novel method that allows for the insertion of large DNA sequences (>1Kb) without a virus! Current efforts at reprogramming T cells for therapeutic purposes rely on using recombinant viral vectors. Unfortunately, viral vectors do not target transgenes to specific genomic sites. Moreover, the manufacturing and testing of effective viral vectors is often a lengthy and expensive process, which slows research progress and clinical use. However, recent studies have shown that re-engineering T cells in a specific and efficient manner is possible using homology-directed repair (HDR).

We explore whether a BSD can replicate Cisco router performance; RETGUARD, OpenBSDs new exploit mitigation technology, Dragonfly's HAMMER2 filesystem implementation & more! This episode was brought to you by Headlines Can a BSD system replicate the performance of a Cisco router? (https://www.reddit.com/r/networking/comments/6upchy/can_a_bsd_system_replicate_the_performance_of/) Short Answer: No, but it might be good enough for what you need Traditionally routers were built with a tightly coupled data plane and control plane. Back in the 80s and 90s the data plane was running in software on commodity CPUs with proprietary software. As the needs and desires for more speeds and feeds grew, the data plane had to be implemented in ASICs and FPGAs with custom memories and TCAMs. While these were still programmable in a sense, they certainly weren't programmable by anyone but a small handful of people who developed the hardware platform. The data plane was often layered, where features not handled by the hardware data plane were punted to a software only data path running on a more general CPU. The performance difference between the two were typically an order or two of magnitude. source (https://fd.io/wp-content/uploads/sites/34/2017/07/FDioVPPwhitepaperJuly2017.pdf) Except for encryption (e.g. IPsec) or IDS/IPS, the true measure of router performance is packets forwarded per unit time. This is normally expressed as Packets-per-second, or PPS. To 'line-rate' forward on a 1gbps interface, you must be able to forward packets at 1.488 million pps (Mpps). To forward at "line-rate" between 10Gbps interfaces, you must be able to forward at 14.88Mpps. Even on large hardware, kernel-forwarding is limited to speeds that top out below 2Mpps. George Neville-Neil and I did a couple papers on this back in 2014/2015. You can read the papers (https://github.com/freebsd-net/netperf/blob/master/Documentation/Papers/ABSDCon2015Paper.pdf) for the results. However, once you export the code from the kernel, things start to improve. There are a few open source code bases that show the potential of kernel-bypass networking for building a software-based router. The first of these is netmap-fwd which is the FreeBSD ip_forward() code hosted on top of netmap, a kernel-bypass technology present in FreeBSD (and available for linux). Full-disclosure, netmap-fwd was done at my company, Netgate. netmap-fwd will l3 forward around 5 Mpps per core. slides (https://github.com/Netgate/netmap-fwd/blob/master/netmap-fwd.pdf) The first of these is netmap-fwd (https://github.com/Netgate/netmap-fwd) which is the FreeBSD ip_forward() code hosted on top of netmap (https://github.com/luigirizzo/netmap), a kernel-bypass technology present in FreeBSD (and available for linux). Full-disclosure, netmap-fwd was done at my company, Netgate. (And by "my company" I mean that I co-own it with my spouse.). netmap-fwd will l3 forward around 5 Mpps per core. slides (https://github.com/Netgate/netmap-fwd/blob/master/netmap-fwd.pdf) Nanako Momiyama of the Keio Univ Tokuda Lab presented on IP Forwarding Fastpath (https://www.bsdcan.org/2017/schedule/events/823.en.html) at BSDCan this past May. She got about 5.6Mpps (roughly 10% faster than netmap-fwd) using a similar approach where the ip_foward() function was rewritten as a module for VALE (the netmap-based in-kernel switch). Slides (https://2016.eurobsdcon.org/PresentationSlides/NanakoMomiyama_TowardsFastIPForwarding.pdf) from her previous talk at EuroBSDCon 2016 are available. (Speed at the time was 2.8Mpps.). Also a paper (https://www.ht.sfc.keio.ac.jp/~nanako/conext17-sw.pdf) from that effort, if you want to read it. Of note: They were showing around 1.6Mpps even after replacing the in-kernel routing lookup algorithm with DXR. (DXR was written by Luigi Rizzo, who is also the primary author of netmap.) Not too long after netmap-fwd was open sourced, Ghandi announced packet-journey, an application based on drivers and libraries and from DPDK. Packet-journey is also an L3 router. The GitHub page for packet-journey lists performance as 21,773.47 mbps (so 21.77Gbps) for 64-byte UDP frames with 50 ACLs and 500,000 routes. Since they're using 64-byte frames, this translates to roughly 32.4Mpps. Finally, there is recent work in FreeBSD (which is part of 11.1-RELEASE) that gets performance up to 2x the level of netmap-fwd or the work by Nanako Momiyama. 10 million PPS: Here (http://blog.cochard.me/2015/09/receipt-for-building-10mpps-freebsd.html) is a decent introduction. But of course, even as FreeBSD gets up to being able to do 10gbps at line-rate, 40 and 100 gigabits are not uncommon now Even with the fastest modern CPUs, this is very little time to do any kind of meaningful packet processing. At 10Gbps, your total budget per packet, to receive (Rx) the packet, process the packet, and transmit (Tx) the packet is 67.2 ns. Complicating the task is the simple fact that main memory (RAM) is 70 ns away. The simple conclusion here is that, even at 10Gbps, if you have to hit RAM, you can't generate the PPS required for line-rate forwarding. There is some detail about design tradeoffs in the Ryzen architecture and how that might impact using those machines as routers Anyway... those are all interesting, but the natural winner here is FD.io's Vector Packet Processing (VPP). Read this (http://blogs.cisco.com/sp/a-bigger-helping-of-internet-please) VPP is an efficient, flexible open source data plane. It consists of a set of forwarding nodes arranged in a directed graph and a supporting framework. The framework has all the basic data structures, timers, drivers (and interfaces to both DPDK and netmap), a scheduler which allocates the CPU time between the graph nodes, performance and debugging tools, like counters and built-in packet trace. The latter allows you to capture the paths taken by the packets within the graph with high timestamp granularity, giving full insight into the processing on a per-packet level. The net result here is that Cisco (again, Cisco) has shown the ability to route packets at 1 Tb/s using VPP on a four socket Purley system There is also much discussion of the future of pfSense, as they transition to using VPP This is a very lengthy write up which deserves a full read, plus there are some comments from other people *** RETGUARD, the OpenBSD next level in exploit mitigation, is about to debut (https://marc.info/?l=openbsd-tech&m=150317547021396&w=2) This year I went to BSDCAN in Ottawa. I spent much of it in the 'hallway track', and had an extended conversation with various people regarding our existing security mitigations and hopes for new ones in the future. I spoke a lot with Todd Mortimer. Apparently I told him that I felt return-address protection was impossible, so a few weeks later he sent a clang diff to address that issue... The first diff is for amd64 and i386 only -- in theory RISC architectures can follow this approach soon. The mechanism is like a userland 'stackghost' in the function prologue and epilogue. The preamble XOR's the return address at top of stack with the stack pointer value itself. This perturbs by introducing bits from ASLR. The function epilogue undoes the transform immediately before the RET instruction. ROP attack methods are impacted because existing gadgets are transformed to consist of " RET". That pivots the return sequence off the ROP chain in a highly unpredictable and inconvenient fashion. The compiler diff handles this for all the C code, but the assembly functions have to be done by hand. I did this work first for amd64, and more recently for i386. I've fixed most of the functions and only a handful of complex ones remain. For those who know about polymorphism and pop/jmp or JOP, we believe once standard-RET is solved those concerns become easier to address seperately in the future. In any case a substantial reduction of gadgets is powerful. For those worried about introducing worse polymorphism with these "xor; ret" epilogues themselves, the nested gadgets for 64bit and 32bit variations are +1 "xor %esp,(%rsp); ret", +2 "and $0x24,%al; ret" and +3 "and $0xc3,%al; int3". Not bad. Over the last two weeks, we have received help and advice to ensure debuggers (gdb, egdb, ddb, lldb) can still handle these transformed callframes. Also in the kernel, we discovered we must use a smaller XOR, because otherwise userland addresses are generated, and cannot rely on SMEP as it is really new feature of the architecture. There were also issues with pthreads and dlsym, which leads to a series of uplifts around _builtinreturn_address and DWARF CFI. Application of this diff doesn't require anything special, a system can simply be built twice. Or shortcut by building & installing gnu/usr.bin/clang first, then a full build. We are at the point where userland and base are fully working without regressions, and the remaining impacts are in a few larger ports which directly access the return address (for a variety of reasons). So work needs to continue with handling the RET-addr swizzle in those ports, and then we can move forward. You can find the full message with the diff here (https://marc.info/?l=openbsd-tech&m=150317547021396&w=2) *** Interview - Ed Maste, Charlie & Siva - @ed_maste (https://twitter.com/ed_maste), @yzgyyang (https://twitter.com/yzgyyang) & @svmhdvn (https://twitter.com/svmhdvn) Co-op Students for the FreeBSD Foundation *** News Roundup Next DFly release will have an initial HAMMER2 implementation (http://lists.dragonflybsd.org/pipermail/users/2017-August/313558.html) The next DragonFly release (probably in September some time) will have an initial HAMMER2 implementation. It WILL be considered experimental and won't be an installer option yet. This initial release will only have single-image support operational plus basic features. It will have live dedup (for cp's), compression, fast recovery, snapshot, and boot support out of the gate. This first H2 release will not have clustering or multi-volume support, so don't expect those features to work. I may be able to get bulk dedup and basic mirroring operational by release time, but it won't be very efficient. Also, right now, sync operations are fairly expensive and will stall modifying operations to some degree during the flush, and there is no reblocking (yet). The allocator has a 16KB granularity (on HAMMER1 it was 2MB), so for testing purposes it will still work fairly well even without reblocking. The design is in a good place. I'm quite happy with how the physical layout turned out. Allocations down to 1KB are supported. The freemap has a 16KB granularity with a linear counter (one counter per 512KB) for packing smaller allocations. INodes are 1KB and can directly embed 512 bytes of file data for files 512 bytes. The freemap is also zoned by type for I/O locality. The blockrefs are 'fat' at 128 bytes but enormously powerful. That will allow us to ultimately support up to a 512-bit crypto hash and blind dedup using said hash. Not on release, but that's the plan. I came up with an excellent solution for directory entries. The 1KB allocation granularity was a bit high but I didn't want to reduce it. However, because blockrefs are now 128 byte entities, and directory entries are hashed just like in H1, I was able to code them such that a directory entry is embedded in the blockref itself and does not require a separate data reference or allocation beyond that. Filenames up to 64 bytes long can be accomodated in the blockref using the check-code area of the blockref. Longer filenames will use an additional data reference hanging off the blockref to accomodate up to 255 char filenames. Of course, a minimum of 1KB will have to be allocated in that case, but filenames are

Britain, 1979. To most people in the 70's, computers were monstrous, bleeping big-brother machines the size of a bus with hundreds of valves and great reels of magnetic tape. They were expensive to run and difficult to understand, and certainly, not something any of us would want at home. Clive Sinclair, a serial inventor, thought differently. He saw that the next step in modern computing was to create a small, affordable machine that could be used alongside our existing televisions and cassette players at home. His idea was to give the general public a tool to learn, organise and play on, that they could programme themselves. So, in 1979, he gave us the ZX80 - a home computer with a 1KB memory, no sound and a monochrome display. It may seem strange to us now, but that temperamental (and sometimes glitchy) little beauty launched the home computer industry that surrounds us today.

　　“失控的电话费，变相的旅游费，膨胀的医药费，高昂的交通费，巨额的会议费，惊人的吃喝费”，有人这样形容眼下机关里的报销制度。　　飞猪在上中学那阵子，老去电脑城晃悠，发现经常有叔叔阿姨，不管是D版光盘还是数码相机，买什么他们都要开票，开多大的票都写“办公用品”。那时候他觉得叔叔阿姨们的纳税意识真强，也兴致勃勃地去开“办公用品”，立刻遭遇了服务员的白眼，从此在幼小的心灵里落下了严重的办公用品阴影。　　时代在变，用“办公用品”充账已经越来越落伍，去首饰店、内衣店开“办公用品”也不太行得通，于是，某村想出了一个新招，并且打算在全国范围内大力推广…… 　　时长: 3'38" / 文件体积: 852.1KB / 主持: 平客