Kalashnikov.

bitcoin, litecoin

Wireless Network Watcher is a small utility that scans your wireless network and displays the list of all computers and devices that are currently connected to your network. For every computer or device that is connected to your network, the following information is displayed: IP address, MAC address, the company that manufactured the network card, and optionally the computer name. You can also export the connected devices list into html/xml/csv/text file, or copy the list to the clipboard and then paste into Excel or other spreadsheet application. Download: Wireless Network Watcher - Show who is connected to your wireless network

ati picat in keylogger sau ce?

Tipu e mai retardat de cat crede, i-am cerut codul sursa, si el considera vulnerabil (say watafac?) edit: @Corex " daca acel echo e vulnerabil, ma si spovetesc " Kalashnikov nikovalski

Nu a fost o parere, din cate observ omul a gasit inca o vulnerabilitate si a postat-o, daca nu te asteptai la asemenea raspunsuri din partea membrilor unui forum de securitate mai bine nu mai postezi 2-3 luni, pana inveti cum merg lucrurile pe aici. Ce xss challenge ai cand nu e vulnerabil ? p.s: daca faci nu inseamna ca e vulnerabil

Surfing the Internet?? Facebook CEO Mark Zuckerberg is watching your every move on Web, and this time even more closure. It’s not surprising that Facebook collects data of its 1.3 billion users, just like everyone else, which the company has said it only holds onto your data for security and advertisement purposes. But, this would be first time when some company is using people's browsing history to deliver ‘targeted Ads’ on its service. The biggest social networking giant recently announced it has plans to use information from our Web browsing and app history to deliver more targeted advertisements to us. HOW IT WORKS The move will track you with every site you visit, even its a non-Facebook website. EVERY SITE?? No! No! No! The company can’t track your online activity while visiting any website, but only those that have Facebook “LIKE”, “Recommend”, “Share” buttons across the web, and I think almost all have at least one included in it. Yes! Any website with a Facebook buttons, like the one you reading right now, or any website that allows you to login with your Facebook account is somehow connected to Facebook. Based on this fact, any website you visit will store information about your visit in the browser, which can be easily read by Facebook later on, whether you click a “like” button on any website or not. FACEBOOK’S TERMS OF SERVICE Now this is How Facebook describes the feature in its Terms of Service: BRIEF EXPLANATION So, let me give you an easy overview. Let’s suppose you are planning to buy a new mobile phone and searching for its price and review on multiple websites using your desktop or mobile apps. So, keeping your interest in mind, Facebook will show you Interest-based Ads to help you get the best price and brands to consider. Sounds really good! However, this type of tracking can be really dodgy as well. Because along with your online activity, other personal information such as your location, age, medical habits, and many more are collected and added to their databases in an effort to create your profile for marketers. HOW TO STOP FACEBOOK FROM SHARING YOUR WEB BROWSING HISTORY If you don't want any third-party website to send your data to Facebook or any prying eyes, you can opt-out through a special tool available on the Digital Advertising Alliance site and let the companies know that you are not at all interested in sharing your data. Once you are on the Digital Advertising Alliance website, you will serve the above screen. Click the "Companies Customizing Ads for Your Browser" button. It will show you list of all the companies which are sharing your data. But before doing this, you need to turn off your 'ADblock' like browser plug-ins for a minute. Click Facebook and any other sites you want to opt-out of your most private internet activities, and then scroll down and hit 'submit' button. For Mobile Users: If you own an iphone, open settings and go to General->Restrictions->Advertising, and then click "Limit Ad Tracking." If you own an Android Smartphone, go to Google Settings->Ads->Opt Out of Interest-Based Ads and click, you are done. sursa: Facebook To Use Your Web Browsing History for Targeted Ads, Here's How To Opt-Out Now - The Hacker News

Merge bine cdn-ul (mia bagat si mie un site la el), bafta cu el .

Ce este hashmap? Este o lista de obiecte, fiecare continand un identificator(key)+un atribut(ori mai multe), punctand inspre urmatoru obiect. La o prima vedere acest lucru nu ne va facilita cautarea in cazul unor date 'neordonate'. Parcurgerea fiecarui element fiiind o pacoste in a descoperi elementul cautat. Plecand de la ideea de hashmap, putem implementa ceva asemanator, oarecum ordonat(vom vedea in cateva minute de ce), cu timp de acces instant pentru a identifica cheia, si regasirea attributului dorit din obiectul dorit. Vom porni de la ideea de a imparti informatiile in sub categorii ce se aseamana. Clasa vector reprezinta un intermediu usor in aplicarea acestei idei, din pricina faptului ca putem accesa orice element instant. Elementul va fi in cazul de fata un 'tabel' (lista simpla de elemente, hashmap ul in sine). Pentru a va familiariza cu ideea, priviti exemplul de mai jos. #include <vector> #include <string> using namespace std; typedef string TKey; typedef string TAttribut; struct Node { TKey key; TAttribut attr; Node *next; }; struct Table { Node *head; }; typedef vector<Table> HashMap; Pentru a modifica o tabla, avem nevoie de a implementa cateva functii (intr-un fisier header 'abc.h') // initializeaza lista la valoarea nullptr void initTable(Table &t); // verifica daca lista contine macar un nod bool isEmpty(const Table & t); // adauga ori modifica // - adauga daca cheia cautata nu exista in lista // - modifica atributul cheii corespunzatoare in caz ca exista void addModify(const TKey &c, const TAttribut &a, Table &t); // sterge o intrare din lista void rem(const TKey &c, Table &t); // intoarce valoarea atributului bool getAttr(const TKey &c, const Table &t, TAttribut &a); Iar in alt fisier 'abc.cpp' vom implementa aceste functii. Initializarea si verificarea sunt simple. #include "TableList.h" #include <string> using namespace std; void initTable(Table & t) { t.head = nullptr; } bool isEmpty(const Table & t) { return t.head == nullptr; } Pentru a simplifica algoritmele, am implementat separat o functie care creeaza un nod cu parametrii specificati. Node *createNode(const TKey &c, const TAttribut &a, Node *nP) { Node *tmp = new Node; tmp->key = c; tmp->attr = a; tmp->next = nP; return tmp; } Acum ca avem toate uneltele, putem implementa diferite concepte. Primul este adaugarea ori modificarea unui element inexistent ori existent Ce avem de facut, e sa navigam printre noduri si in momentul in care l-am gasit pe cel ce contine cheia cautata ori nu mai exista nici un alt nod de analizat iesim din bucla. In cazul in care it (nod ul curent) nu este nullptr inseamna ca cea de a doua conditie (it->key == c) a fost indeplinita. In acest caz am desi sa modificam atributul. Iar daca (it == nullptr), vom adauga on nod nou la inceputul listei. void addModify(const TKey &c, const TAttribut &a, Table &t) { Node *it = t.head; while(it != nullptr && it->key != c) it = it->next; if(it != nullptr) it->attr = a; else t.head = createNode(c, a, t.head); } Urmatoarea functie implementata este inlaturarea nodurilor dorite. De aceasta data algoritmul este un pic mai complex. Faptul ca lucram cu liste simple, implica existenta unor exceptii ce trebuiesc luate in calcul. In cazul in care nu avem nici un nod in lista (table), atunci nu facem nimic. Daca avem macar un element, verificam daca cheia acestuia este aceea pe care o cautam. Aceasta exceptie este determinata de comportamentul listei, care din natura ei nu poate primi schimbari directe(gen eliberarea memoriei utilizate de acel nod) + reconectarea pointerului precedent cu cel ce urmeaza. Dar pentru ca avem un sens (next) putem sa luam o marja de un nod (inainte de cel dorit) si restructura mai usor lista stiind ca exista macar un next (chiar daca e reprezentat de nullptr), dupa nodul ce ne intereseaza. La o anumita instanta a buclei(nodul 'n') vom descoperi ca nodul n+1 contine cheia cautata. Vom inregistra intr-un nod temporar referinta catre (n+1), vom lega 'n' de 'n+2', si prin instructiunea 'delete' vom elibera memoria de la adresa specificata prin nodul temporar(fostul nod n+1). void rem(const TKey &c, Table &t) { Node *it = t.head; if(it != nullptr) { if(it->key == c) { t.head = t.head->next; delete it; }else { while(it->next != nullptr && it->next->key != c) it = it->next; if(it->next != nullptr) { Node *n = it->next; it->next = it->next->next; delete n; } } } } Ceea ce ramane de facut este citirea informatiilor (atributelor) din acel nod. bool getAttr(const TKey &c, const Table &t, TAttribut &a) { Node *it = t.head; while(it != nullptr && it->key != c) it = it->next; if(it != nullptr) { a = it->attr; return true; } return false; } Revenind la 'abc.h' vom specifica si prototipele functiilor de hashmap // initializarea unui hashmap, cat mai mare cu atat mai bine (nu exagerat, ci relativ volumului de informatii ce dorim sa stocam) void initHashMap(vector<Table> &hm, unsigned sz); // o functie ce va genera un index, specific cheii mentionate in parametru, si cat mai unic(tine de complexitatea algoritmului de triere a cheilor) unsigned getHash(string key, unsigned sz); // verifica daca o cheie detine un nod in hashmap bool keyInHashMap(const TKey &c, const HashMap &hm); // adauga ori modifica la indexul corespunzator cheii void addModify(const TKey &c, const TAttribut &a, HashMap &hm); // sterge la indexul corespunzator cheii void rem(const TKey &c, HashMap &hm); // incarca atrbutul corespunzator hash ului, prin referinta 'a' // intoarce 'true' in caz ca acel nod a fost gasit // daca nu 'false' bool getAttr(const TKey & c, const HashMap &hm, TAttribut & a); Implementam si aceste functii in 'abc.cpp' Cream hashmap de o marime (sa zicem 40000), si initializam fiecare lista. A doua functie este aceea care va genera indexele specifice cheilor ( ceva simplu) void initHashMap(HashMap &hm, unsigned sz) { hm.resize(sz); for(unsigned i=0; i<sz; ++i) initTable(hm[i]); } unsigned getHash(string key, unsigned sz) { if(s.empty()) return sz; unsigned idh = 0; for(unsigned i=0; i<s.size(); ++i) { idh = 27*idh + int(s[i]); if(idh >= sz) idh %= sz; } return idh; } Pentru a cauta o cheie specifica intr-o tabla, mi-am luat libertatea de folosi recursivitatea. bool cDHM_rec(const TKey &c, Node *n) { if(n == nullptr) return false; if(c == n->key) return true; return cDHM_rec(c, n->next); } Functiile ce urmeaza au un lucru in comun, si anume : unsigned id_hash = getHash(c, hm.size()); if(id_hash != hm.size()) Identificam indexul tablei in care acea cheie ar trebui sa se regaseasca, si aplicam o functie specifica tablei. bool keyInHashMap(const TKey &c, const HashMap &hm) { unsigned id_hash = getHash(c, hm.size()); if(id_hash != hm.size()) return cDHM_rec(c, hm[id_hash].head); return false; } void addModify(const TKey &c, const TAttribut &a, HashMap &hm) { unsigned id_hash = getHash(c, hm.size()); if(id_hash != hm.size()) addModify(c, a, hm[id_hash]); } void rem(const TKey &c, HashMap &hm) { unsigned id_hash = getHash(c, hm.size()); if(id_hash != hm.size()) rem(c, hm[id_hash]); } bool getAttr(const TKey & c, const HashMap &hm, TAttribut & a) { unsigned id_hash = getHash(c, hm.size()); if(id_hash != hm.size()) return getAttr(c, hm[id_hash], a); return false } Cateva alternative a listelor simple, pot fi listele dublu inlantuite ori arbori binari de cautare(dar trebuiesc echilibrati mai mereu). autor: noVaLue Sursa: Simple search with hashmap

Ma refer strict la cele ubuntu based, nu am intalnit alte distributi care sa aiba asa ceva.

Iti recomand sa iti instalezi ubuntu si iti pui windows in virtualbox sa lucrezi in photoshop, celelate programe le poti emula sau sunt alternative sau sunt disponibile si pentru linux. Ubuntu e ok pentru incepatori + ai si ubuntu software center, care te ajuta destul de mult pentru un incepator (da, sa nu uitam ca si celelate distributi au asa ceva, doar ca sunt bazate pe ubuntu).

Salut, vreau si eu like-uri pe aceasta pagina https://www.facebook.com/xplugins multumesc anticipat

Am cumparat si eu de la @sensi , sunt de calitate cpanel-urile (sunt sigur ca si celelalte servicii), doar cu PR 1-2 am nimerit, nici nu ai ce cere la pretu ala

off, de fapt puteai sa il descarci cu crocko de acolo ... plm, am facut reupload reupload: GirlShare - Download Ghidul-Administratorilor-Linux.pdf

Cuprins 1. Introducere în reþele; Reþele TCP/IP Alte tipuri de hardware Protocolul Internet Protocolul IP peste liniile seriale Protocolul de Control al Transmisiei (TCP) Protocolul Datagrame Utilizator (UDP) Mai multe despre porturi Biblioteca Socket Codul de Networking Diferite linii de dezvoltare De unde se poate obtine codul Intre?inerea sistemului Securitatea sistemului Privire general? peste capitolele urm?toare 2. Ideile principale pentru reþelele TCPIP Interfeþe de reþea Adrese IP Cãutarea adreselor Rutarea IP Reþele IP Subreþele 3. IP pentru linie seriala Referinta pentru dip Comanda get Comanda print Nume de variabile Comenzile if si goto Comenzile send, wait si sleep Comenzile mode si default Rularea in Modul Server 4. Protocolul Punct la Punct (PPP) Descilcirea P-urilor PPP deschis 5. Sistemul informational al retelei (NIS) Sã facem cunoºtinþã cu NIS NIS versus NIS+ NIS: Partea de Client Rularea unui server NIS Setarea unui client NIS cu NYS Alegerea map-urilor corecte Folosirea map-urilor passwd ºi group Folosirea NIS cu suport pentru Shadow Folosirea codului NIS tradiþional ) Download: -- reupload: http://www.girlshare.ro/33624882.5

In urmatorul tutorial, va voi ghida in a instalata lighttpd cu php5 (php-fpm) si mysql pe centos 6.4 Instalare MySQL 5 yum install mysql mysql-server Setam ca serverul mysql sa porneasca o data cu sistemul de operare chkconfig --levels 235 mysqld on /etc/init.d/mysqld start Setam o parola pentru serverul mysql mysql_secure_installation Va las mai jos, setarile ce le-am facut si eu, daca nu va descurcati Enter current password for root (enter for none): ENTER Set root password? [Y/n] <-- ENTER New password: <-- yourrootsqlpassword Re-enter new password: <-- yourrootsqlpassword Remove anonymous users? [Y/n] <-- ENTER Disallow root login remotely? [Y/n] <-- ENTER Remove test database and access to it? [Y/n] <-- ENTER Reload privilege tables now? [Y/n] <-- ENTER 2. Instalam Lighttpd Lighttpd si php-fpm nu le gasim in repositoarele centos, trebuie sa activam repostoriul remi si epel rpm --import https://fedoraproject.org/static/0608B895.txt wget http://dl.fedoraproject.org/pub/epel/6/x86_64/epel-release-6-8.noarch.rpm rpm -ivh epel-release-6-8.noarch.rpm rpm --import http://rpms.famillecollet.com/RPM-GPG-KEY-remi rpm -ivh http://rpms.famillecollet.com/enterprise/remi-release-6.rpm yum install yum-priorities Editam nano /etc/yum.repos.d/epel.repo nano /etc/yum.repos.d/epel.repo aici adaugam prioritatea 10 in sectiunea epel priority=10 ex: [epel] name=Extra Packages for Enterprise Linux 6 - $basearch #baseurl=http://download.fedoraproject.org/pub/epel/6/$basearch mirrorlist=https://mirrors.fedoraproject.org/metalink?repo=epel-6&arch=$basearch failovermethod=priority enabled=1 priority=10 gpgcheck=1 gpgkey=file:///etc/pki/rpm-gpg/RPM-GPG-KEY-EPEL-6 [...] facem accelasi lucru si in repostiroul remi care se afla in /etc/yum.repos.d/remi.repo nano /etc/yum.repos.d/remi.repo ar trebui sa arate asa: [remi] name=Les RPM de remi pour Enterprise Linux $releasever - $basearch #baseurl=http://rpms.famillecollet.com/enterprise/$releasever/remi/$basearch/ mirrorlist=http://rpms.famillecollet.com/enterprise/$releasever/remi/mirror enabled=1 priority=10 gpgcheck=1 gpgkey=file:///etc/pki/rpm-gpg/RPM-GPG-KEY-remi failovermethod=priority [remi-test] name=Les RPM de remi en test pour Enterprise Linux $releasever - $basearch #baseurl=http://rpms.famillecollet.com/enterprise/$releasever/test/$basearch/ mirrorlist=http://rpms.famillecollet.com/enterprise/$releasever/test/mirror enabled=0 gpgcheck=1 gpgkey=file:///etc/pki/rpm-gpg/RPM-GPG-KEY-remi Am ajuns, in sfarsit, la pasul unde instalam lighttpd yum install lighttpd Setam lighttpd sa porneasca de o data cu sistemul de operare chkconfig --levels 235 lighttpd on /etc/init.d/lighttpd start Instalam PHP5 yum install php-fpm lighttpd-fastcgi PHP-FPM e un proces care ruleaza FASTCGI server pe portul 9000 Deschidem /etc/php-fpm.d/www.conf nano /etc/php-fpm.d/www.conf si setam user si group cu lighttpd ex: [...] ; Unix user/group of processes ; Note: The user is mandatory. If the group is not set, the default user's group ; will be used. ; RPM: apache Choosed to be able to access some dir as httpd user = lighttpd ; RPM: Keep a group allowed to write in log dir. group = lighttpd [...] Setam PHP-FPM sa porneasca de o data cu sistemul de operare chkconfig --levels 235 php-fpm on /etc/init.d/php-fpm start Activam php5 in lighttpd Deschidem /etc/php.ini si scoatem ; din fata de la cgi.fix_pathinfo=1 nano /etc/php.ini ar trebui sa avem asa: [...] ; cgi.fix_pathinfo provides *real* PATH_INFO/PATH_TRANSLATED support for CGI. PHP's ; previous behaviour was to set PATH_TRANSLATED to SCRIPT_FILENAME, and to not grok ; what PATH_INFO is. For more information on PATH_INFO, see the cgi specs. Setting ; this to 1 will cause PHP CGI to fix its paths to conform to the spec. A setting ; of zero causes PHP to behave as before. Default is 1. You should fix your scripts ; to use SCRIPT_FILENAME rather than PATH_TRANSLATED. ; http://www.php.net/manual/en/ini.core.php#ini.cgi.fix-pathinfo cgi.fix_pathinfo=1 [...] Deschidem fisierul /etc/lighttpd/modules.conf si scoatem ## din fata de la conf.d/fastcgi.conf nano /etc/lighttpd/modules.conf [...] ## ## FastCGI (mod_fastcgi) ## include "conf.d/fastcgi.conf" [...]/code] Deschidem [i]/etc/lighttpd/conf.d/fastcgi.conf[/i] Stergem [code]fastcgi.server = ( ".php" => ( "php-local" => ( "socket" => socket_dir + "/php-fastcgi-1.socket", "bin-path" => server_root + "/cgi-bin/php5", "max-procs" => 1, "broken-scriptfilename" => "enable", ) ) si adaugam fastcgi.server += ( ".php" => (( "host" => "127.0.0.1", "port" => "9000", "broken-scriptfilename" => "enable" )) ) dam restart la serverul lighttpd service lighttpd restart Testam daca php-ul se pupa cu lighttpd echo "<?php phpinfo(); ?>" >> /var/www/lighttpd//index.php Acum intram pe http://ip/index.php si verificam daca e totul ok. Pentru suport mysql-php + optimizarea paginilor rulati yum install php-mysql php-gd php-imap php-ldap php-odbc php-pear php-xml php-xmlrpc php-pecl-apc si restartam serviciul php-fpm /etc/init.d/php-fpm reload Atat e tutorialul, pentru intrebari / corectari nu ezitati sa folositi butonul reply.

Ne trebuie: Any Icon Changer A Binder A Brain 1. Creaza-ti virusul, eu o sa il numesc server1.exe , pentru un moment. 2. Ia o poza 3. Bindeaza server1.exe cu pictura, poti folosi orice binder recomand Easy_Binder easy binder, rulati in virtualbox 4. Fii sigur ca ai optiunea "Hide common extensions" debifata din folder options 5. Redenumim numele virusului server1.exe in "%Picturename%.jpeg - %Email/Web Address%.com" * .com functioneaza ca si .exe 6. Ai nevoie de un icon changer, si o schimbi cu poza default de la windows pentru imagini Atat a fost tot, nu multi stiu ca .com e interpretat ca .exe , iar ei vad iconita de la o poza obisnuita nu de la o aplicatie sau ceva

Nu am chiar 200 posturi, am 166... Problema sta in felul urmator, vreau sa imi schimbi username-ul in Kalasnhikov , momentan cel care sia facut cont cu user-ul Kalashnikov nu a mai intrat de 4 ani pe acel cont si mi-ar placea sa il folosesc eu. Nu am chiar 20 de tutoriale, am doar un tutorial ( https://rstforums.com/forum/82496-upload-shell-cu-phpmyadmin.rst ) dar am mai multe posturi la categoria ajutor, cred ca compenseaza cumva ... , promit ca o sa fac si celelalte 19 tutoriale / stiri in cursul luni viitoare . scuze pentru posturi, o sa le fac cu timpul... tutorialele sunt facute de mine iar daca am scris un lucru gresit imi poti da pm sau reply in acel tutorial pentru al remedia renegarde + restul, e strict decizia adminilor daca vor sa imi schimbe nickname-ul, nu va mai bagati ca musca in lapte

De asemenea, fundalul sonor este asigurat de o manea pe care a f?cut-o cunoscut-o cu ceva timp în urm? Gabriel Torje, fostul dinamovist, care a fredonat "Steaua e numai una". )

are dreptate, de aceea nici nu am facut public acea chestie / am pus in numele meu, pentru ca depus o anumita munca acolo si nu ar fii drept sa vin eu, schimb una alta si gata // statea pe site-ul ala, doar sa ma joc cu acea aplicatie srry danyweb si eu tot ca informatie

// le merge cam greu site-ul, sau mi se pare ? Service Unavailable HTTP Error 503. The service is unavailable.

nu, daca acceseaza contul, inainte sa mori ? l.e: scuze de dublupost, nu am observat ca dau post nu edit

setezi cronjob cu sendmail pe e-mailele lor, sau le dai sms (whatever), cu 50% din parola unuia, 50% altuia faci un script in bash care reseteaza cronjob, si il rulezi in fiecare zi la ora (15:00) de ex, cu juma de ora inainte sa le trimita e-mail / etc de ce script de resetare in bash ? sa nu mori in timp ce vrei sa resetezi data cand trebuie sa fie trimise bucatile de parola.

da

Sunt de calitate cumparati cu incredere.