Inicio Foro Noticias Retos Articulos Grupos iHackerss Mapa Creditos Youtube
foros de discusión

Welcome Guest ( Log In | Register )


Lutio
Posted on: May 6 2007, 10:04 PM


Conociendo el foro
**

Group: Hackerss Member
Posts: 13
Joined: 6-January 07
From: COLOMBIA!!!
Member No.: 1,642


uFF... MEN SE FAJO!!!...... tenia unas pero otras no las conocia... muy buena info!!!...en la buena
  Forum: Hacking · Post Preview: #33998 · Replies: 9 · Views: 5,483

Lutio
Posted on: May 6 2007, 02:21 PM


Conociendo el foro
**

Group: Hackerss Member
Posts: 13
Joined: 6-January 07
From: COLOMBIA!!!
Member No.: 1,642


Jejeje... eso es una partesita de un pishing sencillo ahora toy pensando en algo mas grandesito con otros programas q son more usefull...
y pues no solo el ultradit...cualquier editor hexadecimal...el olly... es excelente cool.gif
en la buena cool.gif
  Forum: Hacking · Post Preview: #33977 · Replies: 6 · Views: 670

Lutio
Posted on: May 4 2007, 11:20 AM


Conociendo el foro
**

Group: Hackerss Member
Posts: 13
Joined: 6-January 07
From: COLOMBIA!!!
Member No.: 1,642


konsieso q tendre mi cluster en la U!!!! biggrin.gif .........
Konfieso que voy a liderar el semillero de la U...
Konfieso que estoy subiendo el promedio y las materias q supuestamente estaba mal tongue.gif.........
Konsieso q abra un nuevo live cd tongue.gif...... y q abra un nuevo boom sin comentarios xD.........jejejeje
  Forum: General · Post Preview: #33872 · Replies: 5300 · Views: 191,094

Lutio
Posted on: May 4 2007, 10:44 AM


Conociendo el foro
**

Group: Hackerss Member
Posts: 13
Joined: 6-January 07
From: COLOMBIA!!!
Member No.: 1,642


Ayuda Empirical Mode Descomposition (EMD) Codigo Matlab

Resulta y sucede que estoy haciendo un proyecto, en el cual esta realizado en matlab, ya tengo granparte del algoritmo avanzado, tenia antes un problema de programacion que hacia que el programa se demoraba maso menos 40 minutos en un procesador petium4 con 3Ghz, 1GB ram, pero ahora me demora minutos si no toy mal como unos 10minutos... pues si se puede agilizar mas mucho mejor wink.gif , el problemita que tengo ahora es que necesito hacer la interpolacion en dos dimensiones ya que esta con interp, y deberia estar con interp2... lo machetee metiendole el 2 pero como q no es asi xD....agradesco el que me pueda colaborar....

Codigo:

IEMD_public.m ->Realiza el Proceso.
"EL QUE HAY QUE MODIFICAR"
CODE
function  [ix,resx,medel]=IEMD_public(image,epsilon,numberimfs,conn)
% Decompose an image into its intrinsic modes IMFs and corresponding
% residues.
%  
%
% INPUT:
% image- a matlab 2D vector;
% epsilon- value of stop criterion, between 0 and 1 but you can try other
% and see what happens
% numberimfs- maximum number of IMF
% conn- Type of neighbourhood in extrema point selection
%  '4m'     two-dimensional four-connected neighborhood, use 'imregionalmax' in Images toolbox
%  '8m'     two-dimensional eight-connected neighborhood, use 'imregionalmax' in Images toolbox
%  '4'     two-dimensional four-connected neighborhood, simple implementation
%  '8'     two-dimensional eight-connected neighborhood, simple implementation
% Note all that these give different results
%
% OUTPUT:
% ix - 3D vector with all IMFs
% resx - 3D vector with all residues
%
%
%
%
%
%
%  
%
% NOTE:
% The interpolation use 'tpaps' in the Matlab 6.5 Splines toolbox. This is
% extremely slow and memory consuming; unless you have a very good computer
% do not use this code on larger images than 128x128. Please make a
% better implementation and tell me about it.
%%


%%

ix=zeros(size(image,1),size(image,2),numberimfs);
resx=zeros(size(image,1),size(image,2),numberimfs);
f=0;

[imf,res,medel]=findimf(image,1,epsilon,conn);

for i=1:numberimfs
   resx(:,:,i)=res;
   ix(:,:,i)=imf;
    
   if i==numberimfs
      f=1;
   end
   [max,min]=maxomin(res,conn);
   [a dummy dummy]=find(max);
   if size(a)<1
      f=1;
   end
  
   [a2 dummy dummy]=find(min);
   if size(a2)<1
      f=1;
   end


   if f==1;
      i  
      break
   end
  
  [imf,res,medel]=findimf(res,1,epsilon,conn);
end
  




%%*******************************************************************
%%

function [imf,res,medel]=findimf(xin,p,epsilon,conn)

sis=size(xin,1);
numpix=sis*sis;
hk=xin-1;
medel=hk;
k=0;
xin1=xin;
for i=1:100
    
  if      sum(sum(abs(medel)))/numpix> epsilon
      
      % k=sum(sum(abs(medel)))/numpix;
       xin=hk;
       [hk, medel,f]=interp(xin,p,conn);
      % b=i;

  end

imf=hk;
res=xin1-hk;

end
%figure;imagesc(imf);colormap(gray);axis off;

%%%%********************************************************************
%%
function [c,medel,f]=interp(x,p,conn)

[y,v]=maxomin(x,conn);
      
[Iy,Jy,Vy] = find(y);
[Iv,Jv,Vv] = find(v);
[Iy,Jy,Vy] = find(y);
  xyy=[Iy';Jy'];
  xyv=[Iv';Jv'];



[m1,n1] = size(y);[m2,n2] = size(v);
[m12,n12,v12] = find(Iy);
[m22,n22,v22] = find(Iv);

  
if size(Iy)<200
  for k=1:2:size(y,1)
    y(1,k)=x(1,k);
    y(size(x,1),k)=x(size(x,1),k);
    y(k,size(x,2))=x(k,size(x,2));
       y(k,1)=x(k,1);
  end
end
[Iv,Jv,Vv] = find(v);
if size(Iv)<200
  for k=1:2:size(v,1)
    v(1,k)=x(1,k);
    v(size(x,1),k)=x(size(x,1),k);
    v(k,size(x,2))=x(k,size(x,2));
       v(k,1)=x(k,1);
  end
end
        
        


if max(size(v12,1),size(v12,2))<3
     medel=zeros(size(x));
     f=1;
c=x-medel;
    return
end
if max(size(v22,1),size(v22,2))<3
   medel=zeros(size(x));
c=x-medel;
f=1;
    return
end



sty = tpaps(xyy,Vy',p); %figure(1);fnplt(sty)
valy=fnval(sty,{1:m1,1:n1});
stv = tpaps(xyv,Vv',p); %figure(2);fnplt(stv)
valv=fnval(stv,{1:m2,1:n2});
f=0;
medel=(valy+valv)/2;
%figure(1);imagesc(valy);colormap(gray);axis off;
%figure(2);imagesc(valv);colormap(gray);axis off;
%figure(3);imagesc(medel);colormap(gray);axis off;
c=x-medel;
%figure(4);imagesc(c);colormap(gray);axis off;





%**************************
%%
%*************************************************************************


function [max,min]=maxomin(x,conn)

y=zeros(size(x));

v=zeros(size(x));



switch conn
    case '4'

  
for j=2:size(x,2)-1
for i=2:size(x,1)-1
  
%     if x(i,j)>x(i+1,j)
%         if x(i,j)>x(i-1,j)
%             if x(i,j)>x(i,j-1)
%                 if x(i,j)>x(i,j+1)
%                    y(i,j)=x(i,j);
%                end
%            end
%        end
%    end

                      if x(i,j)>x(i+1,j) &  x(i,j)>x(i-1,j) & x(i,j)>x(i,j-1)& x(i,j)>x(i,j+1)
               y(i,j)=x(i,j);
                      end

%       if x(i,j)<x(i+1,j)
%         if x(i,j)<x(i-1,j)
%             if x(i,j)<x(i,j-1)
%                if x(i,j)<x(i,j+1)
%                   v(i,j)=x(i,j);
%                end
%             end
%         end
%   end

                    if x(i,j)<x(i+1,j) & x(i,j)<x(i-1,j) & x(i,j)<x(i,j-1) & x(i,j)<x(i,j+1)
                    v(i,j)=x(i,j);
                    end
                    
    end  
end  


case '8'
  
for j=2:size(x,2)-1
for i=2:size(x,1)-1
  
%     if x(i,j)>x(i+1,j)
%       if x(i,j)>x(i+1,j+1)
%         if x(i,j)>x(i+1,j-1)
%           if x(i,j)>x(i,j+1)
%             if x(i,j)>x(i,j-1)
%               if x(i,j)>x(i-1,j)
%                 if x(i,j)>x(i-1,j+1)
%                   if x(i,j)>x(i-1,j-1)
%                    y(i,j)=x(i,j);
%                   end
%                 end
%               end
%             end
%           end
%         end
%       end
%     end
%

             if x(i,j)>x(i+1,j) & x(i,j)>x(i+1,j+1)  & x(i,j)>x(i+1,j-1) & x(i,j)>x(i,j+1) & x(i,j)>x(i,j-1) & x(i,j)>x(i-1,j) &  x(i,j)>x(i-1,j+1) &  x(i,j)>x(i-1,j-1)
             y(i,j)=x(i,j);
        end

                            
%     if x(i,j)<x(i+1,j)
%       if x(i,j)<x(i+1,j+1)
%         if x(i,j)<x(i+1,j-1)
%           if x(i,j)<x(i,j+1)
%             if x(i,j)<x(i,j-1)
%               if x(i,j)<x(i-1,j)
%                 if x(i,j)<x(i-1,j+1)
%                   if x(i,j)<x(i-1,j-1)
%                    v(i,j)=x(i,j);
%                   end
%                 end
%               end
%             end
%           end
%         end
%       end
%     end

                 if x(i,j)<x(i+1,j) & x(i,j)<x(i+1,j+1)& x(i,j)<x(i+1,j-1) & x(i,j)<x(i,j+1) & x(i,j)<x(i,j-1) & x(i,j)<x(i-1,j) & x(i,j)<x(i-1,j+1) & x(i,j)<x(i-1,j-1)
                v(i,j)=x(i,j);
            end
     end    
end  
case '4m'
    
    P = imregionalmax(x,4);
    y = double(P) .* double(x);
    P = imregionalmin(x,4);
    v = double(P) .* double(x);
    
    case '8m'
    
    P = imregionalmax(x,8);
    y = double(P) .* double(x);
    P = imregionalmin(x,8);
    v = double(P) .* double(x);
end

max=y;
min=v;


%**************************************************************************
%*****************************


Inicio en donde se dan los valores estipulados para runear el programa:
inicioEMD.m->Intruduccion de datos.
"ESTA PARTE NO SE MUEVE NADA YA QUE SOLO ES EL INICIO DONDE SE INTRODUCEN LOS DATOS"
CODE
clc
clear all


disp('PROCESAMIENTO DIGITAL DE  LA SEÑAL PROYECTO BEMD')
disp('IMAGE COMPRESSION, PRESENTED BY LUTIO')


disp('WELCOME TO BEMD FOR IMAGE COMPRESSION')

disp('USE THE FOLLOWING INPUT PARAMETERS:')

X= input(' introduce and specify the name and format of the image you want to compress = ')

figure (1)
imshow(X)
whos
% colormap(map);
% colorbar;
X = double(X(:,:,1));

epsilon = input('epsilon : value of stop criterion, it is more usefull if you use values between 0 and 1 = ')
numberimfs = input('numberimfs :  maximum number of IMF = ')
conn = input('conn : Type of neighbourhood in extrema point selection use any of the following values 4m,8m,4 and 8 = ')

[ix,resx,medel]=IEMD_public(X,epsilon,numberimfs,conn);
figure (2)
imshow(ix)
figre (3)
imshow(resx), title('REMAINDERS')



Nota:
Los imputs se introducen asi como por defecto:

CODE
X=imread('ludacris.gif'); %/aca la imagen en el mismo directorio.
epsilon=0.7;
numberimfs=2;
conn='4'; %aca puede ser '8' o '4m' o '8m'


Gracias de antemano por la ayuda que me puedan brindar...
mi msn por si algo lutio@colombiaunderground.org
En la buena 8)
  Forum: Aplicaciones de Escritorio · Post Preview: #33869 · Replies: 0 · Views: 359

Lutio
Posted on: May 2 2007, 07:50 PM


Conociendo el foro
**

Group: Hackerss Member
Posts: 13
Joined: 6-January 07
From: COLOMBIA!!!
Member No.: 1,642


muy bueno brother congratulations!!!..... espero este año un amigo de un amigo que quiere conquistar el mundo me ilustre un poco de php porque en realidad me trama el cuento happy.gif
en la buena ninja.gif
  Forum: Programación Web · Post Preview: #33790 · Replies: 7 · Views: 744

Lutio
Posted on: May 2 2007, 11:44 AM


Conociendo el foro
**

Group: Hackerss Member
Posts: 13
Joined: 6-January 07
From: COLOMBIA!!!
Member No.: 1,642


Phising En Winrar
Bueno navegando un rato encontre algo que me llamo la atencion acerca de las formas actuales de pishing para obtener informacion extra segun le convenga a uno.
como el titulo del post dice "Phising En Winrar", les voy a demostrar paso a paso la realizacion de este.

Bueno aca vemos la version del winrar que poseo, lo que tengo entendido es que las versiones del winrar menores que la 3.5 son vulnerables alparecer tengo una de 4.5 y todavia lo es, sin embargo se que esta version fue modificada, entnoks no estoy seguro de su version.

Bueno la version de mi winrar:



Comprobando que por ahora no hay un redireciconamiento raro a otra web que no sea la original del winrar:


Aqui encuentro la ubicacion del la home page del winrar(con un hex. editor):


Aqui la modifico a mi gusto xD y la guardo obviamente:


Aqui abro de nuevo el winrar y me redireccion a la url que le puse xD:


Nota:
*Aclaro que en la direccion podemos hacer un formulario o lo que queramos para obtener informacion extra, ahi uds. ingeniensenlas.
*la web de lutiox esta en reparacion xD...jejejeje xD....

PD: Interesante Hacerlo con programas que utilizen frecuentemente en internet, suena heh?¿...bueno pinitos para algo grande xD.....

en la buena ph34r.gif
  Forum: Hacking · Post Preview: #33740 · Replies: 6 · Views: 670

Lutio
Posted on: May 2 2007, 11:41 AM


Conociendo el foro
**

Group: Hackerss Member
Posts: 13
Joined: 6-January 07
From: COLOMBIA!!!
Member No.: 1,642


Konfieso q aunque no me gusta leer estoy empezando a leer y me esta gustando un poco la lectura...
konfieso q si van a conquistar el mundo no se olviden que yo tambien tengo espiritu de colonizador como simon bolivar!!!....
konfieso q desde aquella vez que vi a esa niña algo me palpito.........
konfieso q ahora soy el vagabundo de la red.........xD.....
  Forum: General · Post Preview: #33739 · Replies: 5300 · Views: 191,094

Lutio
Posted on: May 2 2007, 11:09 AM


Conociendo el foro
**

Group: Hackerss Member
Posts: 13
Joined: 6-January 07
From: COLOMBIA!!!
Member No.: 1,642


jajajaja.... ta excelente...
  Forum: Diseño y Multimedia · Post Preview: #33737 · Replies: 1 · Views: 327

Lutio
Posted on: May 2 2007, 10:34 AM


Conociendo el foro
**

Group: Hackerss Member
Posts: 13
Joined: 6-January 07
From: COLOMBIA!!!
Member No.: 1,642


Transformador 220/125


La de cosas raras que te puedes encontrar de vuelta a casa por madrid...

Plataforma para naves extraterrestres


Carlos V


Carlos V Con chaqueta





Mirando Bn......que hay??....xD....


Miren bn busque a una mujer.............







en la buena ninja.gif
  Forum: Diseño y Multimedia · Post Preview: #33735 · Replies: 13 · Views: 20,863

Lutio
Posted on: Jan 11 2007, 05:14 PM


Conociendo el foro
**

Group: Hackerss Member
Posts: 13
Joined: 6-January 07
From: COLOMBIA!!!
Member No.: 1,642


Diskeeper 2007 Pro Premier!!!!

Fast, thorough, automatic defrag. Includes the revolutionary new InvisiTaskingâ„¢ technology to give you enhanced file system performance with no drain on system resources!

What is InvisiTaskingâ„¢?

InvisiTasking was coined from “invisible� and “multitasking�, and this amazing technological breakthrough promises to change the way the world operates and maintains their computer systems. . InvisiTasking allows computers to do something that has never been done before – to run at maximum peak performance, continuously, without interfering with system performance or resources – even when demand is at its highest!

InvisiTasking allows Diskeeper® 2007 to eliminate fragmentation on the fly, in real time, so that fragmentation never has a chance to interfere with the system. Best of all, InvisiTasking does this automatically, without the need for any input from the user – regardless of the size of the network. Whether its just one PC or thousands just install Diskeeper 2007 and the software will take care of the rest!

Advanced Breakthrough Technology

It’s important to note that InvisiTasking is far more advanced than any previous low priority I/O approaches that do “I/O throttling� in an effort to reduce resource conflict. InvisiTasking, through the use of its advanced technology, goes beyond just I/O in order to address system resource usage using a pro-active approach. InvisiTasking checks to make sure the operation that occurs takes place invisibly, with true transparency while running in the background.

With InvisiTasking, Diskeeper 2007 will set an entirely new standard for computer performance and reliability.

Download: http://rapidshare.com/files/11212231/diske...icense.rar.html
  Forum: General · Post Preview: #25979 · Replies: 0 · Views: 135

Lutio
Posted on: Jan 9 2007, 11:53 PM


Conociendo el foro
**

Group: Hackerss Member
Posts: 13
Joined: 6-January 07
From: COLOMBIA!!!
Member No.: 1,642


eeeeeeee..........i found this........
The Medium Vulnerabilities:
------------------------------------------------------------------------------------------------
Apache Mod_SSL Log Function Format String

Vulnerability description This alert has been generated using only banner information. It may be a false positive.
A format string vulnerability has been found in mod_ssl versions older than 2.8.19. Successful exploitation of this issue will most likely allow an attacker to execute arbitrary code on the affected computer.

Affected mod_ssl versions (up to 2.8.18).
This vulnerability affects mod_ssl. The impact of this vulnerability Denial of service and/or possible arbitrary code execution.
Attack details Current version is mod_ssl/2.0.54 OpenSSL/0.9.7e Unknown

How to fix this vulnerability Upgrade mod_ssl to the latest version.
-----------------------------------------------------------------------------------------------

Apache Mod_SSL SSL_Util_UUEncode_Binary Stack Buffer Overflow Vulnerability

Vulnerability description This alert has been generated using only banner information. It may be a false positive.
A stack-based buffer overflow has been reported in the Apache mod_ssl module. This issue would most likely result in a denial of service if triggered, but could theoretically allow for execution of arbitrary code. The issue is not believed to be exploitable to execute arbitrary code on x86 architectures, though this may not be the case with other architectures.

Affected mod_ssl versions (up to 2.8.17).
This vulnerability affects mod_ssl. The impact of this vulnerability Denial of service and/or possible arbitrary code execution.
Attack details Current version is mod_ssl/2.0.54 OpenSSL/0.9.7e Unknown

How to fix this vulnerability Upgrade mod_ssl to the latest version.
----------------------------------------------------------------------------------------------

Apache Mod_SSL Log Function Format String Vulnerability
Vulnerability description This alert has been generated using only banner information. It may be a false positive.
A format string vulnerability has been found in mod_ssl versions older than 2.8.19. Successful exploitation of this issue will most likely allow an attacker to execute arbitrary code on the affected computer.

Affected mod_ssl versions (up to 2.8.18).
This vulnerability affects mod_ssl. The impact of this vulnerability Denial of service and/or possible arbitrary code execution.
Attack details Current version is mod_ssl/2.0.54 OpenSSL/0.9.7e Unknown

How to fix this vulnerability Upgrade mod_ssl to the latest version.
-----------------------------------------------------------------------------------------------
The Low Vulnerabilities:

Possible sensitive files.
Vulnerability description A possible sensitive file has been found. This check looks for known sensitive files like: password files, configuration files, log files, include files, statistics data, database dumps. Each of those files may help an attacker to learn more about his target. This vulnerability affects /.bashrc. The impact of this vulnerability This file may expose sensitive information that may help an malicious user to prepare more advanced attacks.
---------------------------------------------------------------

TRACE Method Enabled

Vulnerability description HTTP TRACE method is enabled on this web server. In the presence of other cross-domain vulnerabilities in web browsers, sensitive header information could be read from any domains that support the HTTP TRACE method. This vulnerability affects Web Server. The impact of this vulnerability Attackers may abuse HTTP TRACE functionality to gain access to information in HTTP headers such as cookies and authentication data.

----------------------------------------------------------------------------------------------------------------------------

Bueno esto lo hice de carrerita espero sea util......
En La Buena 8)
CUT Member xD

editado por bnk*
evita el desagradable spam!
  Forum: General · Post Preview: #25821 · Replies: 47 · Views: 4,176

Lutio
Posted on: Jan 8 2007, 04:36 PM


Conociendo el foro
**

Group: Hackerss Member
Posts: 13
Joined: 6-January 07
From: COLOMBIA!!!
Member No.: 1,642


old user ninja.gif
  Forum: General · Post Preview: #25646 · Replies: 878 · Views: 8,545

Lutio
Posted on: Jan 6 2007, 01:43 PM


Conociendo el foro
**

Group: Hackerss Member
Posts: 13
Joined: 6-January 07
From: COLOMBIA!!!
Member No.: 1,642


Hola A todos Mi nombre es Lutio closedeyes.gif ........Soy 101% Colombiano, Amigo de C7b3r,Dino, Rpm, y no veo por ahi quien otro si me acuerdo edito el post xD...... eee.... ahora ando en la paguina de CUT http://Www.ColombiaUnderground.Org ......... y pues estoy estudiando ing. de telecomunicaciones y espero ayudarles en algo y pues aprender un poco en cada foro que estoy visitando...saludes y "sele tiene" xD
en la buena cool.gif
  Forum: General · Post Preview: #25491 · Replies: 653 · Views: 68,380


New Posts  New Replies
No New Posts  No New Replies
Hot topic  Hot Topic (New)
No new  Hot Topic (No New)
Poll  Poll (New)
No new votes  Poll (No New)
Closed  Locked Topic
Moved  Moved Topic
 

RSS Lo-Fi Version Time is now: 6th September 2010 - 08:50 AM