Povilas Balzaravičius Pawka

(Atnaujinta 2015-10-10)

2014-11-06 buvo svarstyti įstatymo projektai dėl balsavimo internetu [1]_. Esu pakomentavęs [2]_ siūlomus pataisymus ir šiais metais vėl ruošiamas patobulintas įstatymo projektas dėl balsavimo internetu [3]_.

Tai gi mano komentarai naujai siūlomam įstatymo projektui [3]_.

15 straipsnis. Balsavimo internetu auditas

Konspektas balsavimo internetu diskusijai

Informaciją apie diskusiją:

http://balsavimasinternetu.lt/konferencija-balsavimas-internetu-techniniai-issukiai-ir-galimi-sprendimai/

Bash Shortcuts

Moving

command	description
ctrl + a	Goto BEGINNING of command line

Nginx FastCGI response buffer sizes

By default when Nginx starts receiving a response from a FastCGI backend (such as PHP-FPM) it will buffer the response in memory before delivering it to the client. Any response larger than the set buffer size is saved to a temporary file on disk.

This process is outlined at the Nginx ngx_http_fastcgi_module page manual page.

Introduction
Determine actual FastCGI response sizes
Setting the buffer size
Verifying results

Backend Architectures

Twitter

ror, scala, jetty, erlang, thrift, mongrel, comet server, my-sql, memchached, varnish, kestrel(mq), starling, gizzard, cassandra, hadoop, vertica, munin, nagios, awstats

Introduce Gizzard of Twitter - 트위터의 새로운 분산 관리 라이브러리 Gizzard를 소개합니다.
The Architecture Twitter Uses to Deal with 150M Active Users, 300K QPS, a 22 MB/S Firehose, and Send Tweets in Under 5 Seconds
Scaling Twitter: Making Twitter 10000 Percent Faster

Disclaimer: I have no idea if this are indeed the correct answers. I just solved the exercises like this. I think that they are right though.

I have added my own code to this gist. It is ugly as hell, just like you can expect from code created in a contest like this.

Beautiful Strings

Difficulty: easy

It is simple to see that a greedy solution is good enough.

	enum { BMAX = 32, BCUT = BMAX / 2, BHEIGHT = 6 };

	typedef uint8_t BIndex;

	struct BNode {
	BIndex length;
	Key keys[BMAX];
	union {
	BNode *children[BMAX];
	Value values[BMAX];

	enum { BMAX = 32, BMIN = BMAX / 2, BHEIGHT = 6 };

	struct BNode {
	uint32_t length;
	Key keys[BMAX];
	union {
	BNode *children[BMAX];
	Value values[BMAX];
	};
	};

	// points = number of points (minimum 3)
	// outer = radius to outer points
	// inner = radius to inner points
	module Star(points, outer, inner) {

	// polar to cartesian: radius/angle to x/y
	function x(r, a) = r * cos(a);
	function y(r, a) = r * sin(a);

	// angular width of each pie slice of the star

	const int c = 261;
	const int d = 294;
	const int e = 329;
	const int f = 349;
	const int g = 391;
	const int gS = 415;
	const int a = 440;
	const int aS = 455;
	const int b = 466;
	const int cH = 523;