segunda-feira, 31 de dezembro de 2018

INTOUCHABLES

O filme Intouchables (Intocáveis) é bom, mas sua trilha sonora é SENSACIONAL. Finalmente descobri quem compôs a música (Una Mattina) onde dois rapazes tocam numa estação de trem em Paris, que vi há alguns meses: Ludovido Einaudi. De quebra, ainda conheci o canal Rousseu, cujos vídeos são feitos "em primeira pessoa". Bem interessante a parte visual, pois pode ajudar as pessoas que estão aprendendo a tocar, num estilo "Piano Hero".






domingo, 30 de dezembro de 2018

TÁTICAS E ESTRATÉGIAS DOS CAMPEÕES - TED NOTTINGHAM, AL LAWRENCE & BOB WADE

Táticas são maneiras de se conseguir um ganho imediato durante uma partida, assim como garfos, pregaduras, xeques descobertos e espetos.

Estratégia é o plano que abrange todo o jogo. Enxadristas têm que ter um plano. Os planos podem mudar, mas não faça um movimento sem primeiro ter uma estratégia em mente! Este livro, Best Seller da literatura enxadrística, traz partidas de grandes campeões onde você poderá tirar ensinamentos simples e proveitosos para as suas próprias partidas. 

* * *

Este livro traz um diferencial em matéria enxadrística. Ele não vem apenas instruir o leitor a aprimorar seu jogo ou lecionar para o principiante seus primeiros movimentos, junto com toda a teoria que é de praxe em um bom livro de xadrez, Táticas e Estratégias dos Campeões consegue entreter o leitor com histórias envolventes a cerca deste magnifico jogo, seu surgimento e suas lendas.

As fontes incluem Masters of the Chessboard de Richard Reti (McGraw-HiII, 1932), Grandmasters of Chess (Norton, 1981) do crítico musical do New York Times Harold Schonberg, How to Force Checkmate (David McKay, 1947), "White Knights of Reykjavik" do Praf. George Steiner (New Yorker, 1972) (Faber and Faber, 1973), The Batsford Book of Chess (Batsford, 1975) de Bob Wade, OBE. "O Mercador e o Árabe" é baseada em uma história de M. Jokai de Sakmat.


quarta-feira, 26 de dezembro de 2018

THINK PYTHON - ALLEN B. DOWNEY

Think Python is an introduction to Python programming for beginners. It starts with basic concepts of programming, and is carefully designed to define all terms when they are first used and to develop each new concept in a logical progression. Larger pieces, like recursion and object-oriented programming are divided into a sequence of smaller steps and introduced over the course of several chapters.

Some examples and exercises are based on Swampy, a Python package written by the author to demonstrate aspects of software design, and to give readers a chance to experiment with simple graphics and animation.


VOCÊ SABE O QUE É DESIGN GENERATIVO? ESTE INFOGRÁFICO EXPLICA

Inspiração para o tema de TCC? Quem sabe...

* * *

Pensando em melhorar a relação entre seres humanos e máquinas para otimizar resultados, o design generativo surge como alternativa para expandir as opções de criação. Utilizando algoritmos de inteligência artificial e computação em nuvem, a ideia é que o designer e o engenheiro possam se beneficiar de um ambiente de cocriação.

Apesar de ser um conceito novo, diversas companhias já vêm utilizando o design generativo em suas soluções para a economia de tempo, dinheiro e para o impulsionamento da criatividade e produtividade. Visando mostrar ao público a aplicabilidade do design generativo, a Autodesk preparou um infográfico bastante esclarecedor. Confira.










MATHEMATICIANS SEAL BACK DOOR TO BREAKING RSA ENCRYPTION

Digital security depends on the difficulty of factoring large numbers. A new proof shows why one method for breaking digital encryption won’t work. 

Kevin Hartnett - Senior Writer @ Quanta Magazine

* * *

My recent story for Quanta explained a newly proved phenomenon that might seem surprising from a naive perspective: Virtually all polynomials of a certain type are “prime,” meaning they can’t be factored.

The proof has implications for many areas of pure mathematics. It’s also great news for a pillar of modern life: digital encryption.

The main technique we use to keep digital information secure is RSA encryption. It’s a souped-up version of the encryption scheme a seventh grader might devise to pass messages to a friend: Assign a number to every letter and multiply by some secretly agreed-upon key. To decode a message, just divide by the secret key.

RSA encryption works in a similar fashion. In simplified form, it goes like this: A user starts with a message and performs arithmetic on it that involves multiplication by a very large number (hundreds of digits long). The only way to decode the message is to find the prime factors of the resulting product.1 The security of RSA encryption rests on the fact that there’s no fast way to identify the prime factors of very large numbers. If you’re not the intended recipient of a message — and if you therefore lack the right key to decode it — you could search for a thousand years with the best computers and still not find the right prime factors.

1. The prime factors of a number are the prime numbers you need to multiply together to produce that number. The prime factors of 12 are 2 × 2 × 3. The prime factors of 495 are 3 × 3 × 5 × 11.

But there is a back door, and it has to do with polynomial equations. Every number can be represented as a unique polynomial equation. While it’s hard to find the prime factors of a number, it’s easy to find the factors of a polynomial. And once you know the factors of a polynomial, you can use that information to find the prime factors of the number you started with.

Here’s how it works.

Step One: Pick a number whose prime factors you’d like to know. To take a simple example, let’s use the number 15.

Step Two: Convert 15 into binary notation:

1111.

Step Three: Turn that binary expression into a polynomial by treating the binary digits as coefficients of a polynomial:

x3 + x2 + x + 1.

(Note that this polynomial equals 15 when x = 2, because 2 is the base of binary notation.)

Step Four: Factor the polynomial:

(x2 + 1) × (x + 1).

Step Five: Plug x = 2 into each of those factors:

(22 + 1) = 5

(2 + 1) = 3.

Conclusion: 5 and 3 are the prime factors of 15.

This seems like a complicated way to find the prime factors of a small number like 15, whose factors are easy to spot straightaway. But with very large numbers — numbers with hundreds of digits — this polynomial method gives you a remarkable advantage. There’s no fast algorithm for factoring large numbers. But there are fast algorithms for factoring large polynomials. So once you convert your large number to a large polynomial, you’re very close to finding the number’s prime factors.

Does this mean RSA encryption is in trouble? Actually, no. The reason for this has to do with the new proof about polynomials. The mathematicians Emmanuel Breuillard and Péter Varjú of the University of Cambridge proved that as polynomials with only 0 and 1 as coefficients get longer, they’re less and less likely to be factorable at all. And if a polynomial can’t be factored, it can’t be used to identify the prime factors of the number it’s based on.

Breuillard and Varjú’s proof effectively slams shut the polynomial back door for breaking RSA encryption. The very large numbers used in RSA encryption correspond to very long polynomials. Breuillard and Varjú proved that it’s nearly impossible to find polynomials of that length that can be factored. Mathematicians and cryptographers alike have long suspected this is the case. But when the cybersecurity of the entire world depends on some mathematical hack not working, it’s good to have proof that it doesn’t.


NOVO SITE PESSOAL

Depois de três noites mal dormidas para aprender um pouco de desenvolvimento web, finalmente consegui construir o meu próprio site sob o domínio github.io utilizando Bootstrap 4. Além de servir como portfólio artístico, também serve para mostrar se eu levo jeito para front-end, apesar de ter passado muita raiva com a responsividade.

Enfim, que tiver interesse, dá uma conferida: https://danielbrito.github.io/

sábado, 15 de dezembro de 2018

RABISCOS #49

Caderneta de desenho de volta na ativa...

THE ART OF LEARNING - JOSH WAITZKIN

Conheci o Josh através da excelente engine de xadrez Chessmaster - Grandmaster Edition. A partir daí, decidi saber mais sobre a sua trajetória e me deparei com esse livro incrível. 

Eu não o classificaria como autoajuda, mas sim como uma espécie de biografia de um grande atleta que alcançou o auge nos esportes que dedicou anos de preparação e estudo, neste caso, o xadrez e o tai chi chuan.

* * *

Josh Waitzkin knows what it means to be at the top of his game. A public figure since winning his first National Chess Championship at the age of nine, Waitzkin was catapulted into a media whirlwind as a teenager when his father's book Searching for Bobby Fischer was made into a major motion picture. After dominating the scholastic chess world for ten years, Waitzkin expanded his horizons, taking on the martial art Tai Chi Chuan and ultimately earning the title of World Champion. How was he able to reach the pinnacle of two disciplines that on the surface seem so different? "I've come to realize that what I am best at is not Tai Chi, and it is not chess," he says. "What I am best at is the art of learning."

In his riveting new book, The Art of Learning, Waitzkin tells his remarkable story of personal achievement and shares the principles of learning and performance that have propelled him to the top -- twice.

With a narrative that combines heart-stopping martial arts wars and tense chess face-offs with life lessons that speak to all of us, The Art of Learning takes readers through Waitzkin's unique journey to excellence. He explains in clear detail how a well-thought-out, principled approach to learning is what separates success from failure. Waitzkin believes that achievement, even at the championship level, is a function of a lifestyle that fuels a creative, resilient growth process. Rather than focusing on climactic wins, Waitzkin reveals the inner workings of his everyday method, from systematically triggering intuitive breakthroughs, to honing techniques into states of remarkable potency, to mastering the art of performance psychology.

Through his own example, Waitzkin explains how to embrace defeat and make mistakes work for you. Does your opponent make you angry? Waitzkin describes how to channel emotions into creative fuel. As he explains it, obstacles are not obstacles but challenges to overcome, to spur the growth process by turning weaknesses into strengths. He illustrates the exact routines that he has used in all of his competitions, whether mental or physical, so that you too can achieve your peak performance zone in any competitive or professional circumstance.

In stories ranging from his early years taking on chess hustlers as a seven year old in New York City's Washington Square Park, to dealing with the pressures of having a film made about his life, to International Chess Championships in India, Hungary, and Brazil, to gripping battles against powerhouse fighters in Taiwan in the Push Hands World Championships, The Art of Learning encapsulates an extraordinary competitor's life lessons in a page-turning narrative.


GALERIA MARGINAL #174

Artista: Ernest Ange Duez (1843-1896)




CONCRETAGENS #75

Por Nic Hess

CONCRETAGENS #74

Por Anatol Knotek

CONCRETAGENS #73

Por Fyodor Cherniavsky

CONCRETAGENS #72

Por Hamilton Finlay

CONCRETAGENS #71

Por Aaron Kuehn

PONTO C!

quinta-feira, 13 de dezembro de 2018

ZINE PROTESTIZANDO #29

Como a faculdade está ocupando bastante meu tempo e a escrita de poemas está cada vez menos recorrente, decidi publicar as próximas edições do zine apenas quando conveniente, ou seja, nas férias, finais de semana prolongados ou quando a quantidade de material a ser divulgado for considerável.