If you deliver video, audio, tapes or CDs you need MMK Secure Stream right now.
MMK Secure Stream provides protection for media and can provide you with secure streaming points for live broadcasts and/or video or audio conferencing.

Click here for some possible business models.

Quicksilver 1.0b49 by Blacktree

Quicksilver is a Mac OS X application that allows you to find what you need quickly and easily, while keeping your hands on the keyboard. For example, if you want to launch an application hidden in the depths of your file system, simply activate Quicksilver with a keystroke, type a few letters of the application's name, then hit Return or Enter to launch it. - posted by sryo

Miranda IM 0.5 Preview Release 1 by Miranda IM Team

Miranda IM is a lightweight instant messanger with plugin support for all major IM network, and many more features. - posted by sryo

Clickonic 1.0.4 by Sergey Gagarin (Inform Seg@)

Clickonic.dll is a LiteStep Desktop module, that provides the ability to view folders on the desktop. Unlike the IconDesk, it is less customizable, but it completely supports drag-and-drop operations, so you can place your icons like YOU want... - posted by sryo

Foobar2000 0.9.3 beta 1 by Peter Pawlowski

Foobar2000 is an advanced audio player for the Windows platform. Some of the basic features include ReplayGain support, low memory footprint and native support for several popular audio formats. - posted by sryo

Related Links:

• blizzle.com/­releases.php
  

0 comments
read more:

When you detach the database using sp_detach_db, SQL Server will know that the database was cleanly shutdown and the log file need not have to be available to attach the database again. When you attach the database again SQL Server will create a new log file for you, which will be of the minimum size.

a) Detach the database using sp_detach_db procedure (before that ensure no processes are using the database files.)
b) Delete the log file.
c) Attach the database again using sp_attach_db procedure.

The main problem of decompilation is the absence of full source information in executable file. For instance, .NET assembly does not contains names of local variables... Dis# makes next logical step in this direction. Dis# project (file extension .dis) contains all necessary data for decompilation, including identifier names. You can edit names and persist changes in project file.

As part of the same preparation I really enjoyed to program a classic:

Which are the 92 solutions to the 8 queen problem?

First, the usage intentions and conditions of satisfaction:

    [TestMethod]    public void validSolutions()    {      List<ChessBoard> boards = ChessBoard.AllQueens();      foreach (ChessBoard b in boards)      {        IList all=b.Pieces;        Assert.IsTrue(all.Count == 8);        for (int k = 0; k < 8; k++)        {          IList l = b.Rank[k];          Assert.IsTrue(l.Count == 1);        }        foreach (char c in 'abcdefgh')        {          IList l = b.File[c];          Assert.IsTrue(l.Count == 1);        }      }    }    [TestMethod]    public void allSolutions()    {      List<ChessBoard> boards = ChessBoard.AllQueens();      Assert.AreEqual(92, boards.Count);    }

    public static List<ChessBoard> AllQueens()    {      ResultKeeper keeper = new ResultKeeper();      ChessBoard board = new ChessBoard();      board.OnNewSolution += new ChessBoard.OnNewSolutionHandler(keeper.OnNewSolution);      board.GetQueens();      return keeper.Results;    }

  class ResultKeeper  {    List<ChessBoard> results;    public ResultKeeper()    {      results = new List<ChessBoard>();    }    public void OnNewSolution(int count, ChessBoard board)    {      results.Add(board);    }    public List<ChessBoard> Results    {      get      {        return results;      }    }  }

  public class ChessBoard  {    private char[,] board;    private int hit_count;    public ChessBoard()    {      board  = new char[8, 8];      reset();    }    private ChessBoard(char[,] b)    {      board = b;    }    public delegate void OnNewSolutionHandler(int count,ChessBoard board);    public event OnNewSolutionHandler OnNewSolution;    public IList Pieces    {      get       {        ArrayList result = new ArrayList();        for (int k = 0; k < 8; ++k)          for(int j=0;j<8;++j)            if (board[k,j] == 'X')              result.Add(board[k,j]);        return result;      }    }    public FileLine File { get { return new FileLine(board); } }    public RankLine Rank { get { return new RankLine(board); } }    public char[,] InternalState    {      get { return board; }    }    public static List<ChessBoard> AllQueens()    {      ResultKeeper keeper = new ResultKeeper();      ChessBoard b = new ChessBoard();      b.OnNewSolution += new ChessBoard.OnNewSolutionHandler(keeper.OnNewSolution);      b.GetQueens();      return keeper.Results;    }    public void GetQueens()    {      find_safe_positions();    }    void reset()    {      for (int k = 0; k < 8; ++k)        for (int j = 0; j < 8; ++j)          board[k, j] = '-';    }    private void find_safe_positions()    {      int rank = 0;      find_safe_position(rank);    }    private bool find_safe_position(int rank)    {      for (int file = 0; file < 8; ++file)      {        if (is_safe(rank, file))        {          board[rank, file] = 'X';          if (rank == 7)          {            NewSolutionFound();            board[rank, file] = '-';            continue;          }          if (find_safe_position(rank + 1))            return true;          else            board[rank, file] = '-';        }      }      return false;    }    bool is_safe(int rank, int file)    {      bool safe = empty_rank(rank) && empty_file(file) && empty_cross(rank, file);      return safe;    }    bool empty_rank(int rank)    {      for (int k = 0; k < 8; ++k)        if (board[rank, k] == 'X')          return false;      return true;    }    bool empty_file(int file)    {      for (int k = 0; k < 8; ++k)        if (board[k, file] == 'X')          return false;      return true;    }    bool empty_cross(int rank, int file)    {      for (int k = rank, j = file; k >= 0 && j >= 0; --k, --j)        if (board[k, j] == 'X')          return false;      for (int k = rank, j = file; k < 8 && j < 8; ++k, ++j)        if (board[k, j] == 'X')          return false;      for (int k = rank, j = file; k < 8 && j >= 0; ++k, --j)        if (board[k, j] == 'X')          return false;      for (int k = rank, j = file; k >= 0 && j < 8; --k, ++j)        if (board[k, j] == 'X')          return false;      return true;    }    void NewSolutionFound()    {      ChessBoard b = new ChessBoard(board.Clone() as char[,]);      ++hit_count;      if (OnNewSolution != null)        OnNewSolution(hit_count, b);    }    public class FileLine    {      private char[,] board;      internal FileLine(char[,] b) { board = b; }      public IList this[char c]      {        get        {          ArrayList result = new ArrayList();          int j = (int)c - 97;          for (int k = 0; k < 8; ++k)            if (board[k, j] == 'X')              result.Add(board[k, j]);          return result;        }      }    }    public class RankLine    {      private char[,] board;      internal RankLine(char[,] b) { board = b; }      public IList this[int n]      {        get        {          ArrayList result = new ArrayList();          for (int k = 0; k < 8; ++k)            if (board[n, k] == 'X')              result.Add(board[n, k]);          return result;        }      }    }  }

Handling CSV Strings, Redux

I've written several times about the Python csv module and its limited API.  I presented an adaptor class for use when you want to parse a CSV string, without being locked into reading sequentially from a file.  Here's another way of doing it, using Python's standard 'I have a string, but I need a file-like object' adapter, the StringIO module.

import StringIO    # Or use cStringIO, it's faster
import csv

# First, create the StringIO object, then the csv reader object
# using the StringIO object.
sf = StringIO.StringIO()
csvReader = csv.reader(sf)

# Now, write a CSV string out to the StringIO object.
csvData = '1,2,three,'four,five',6'
sf.write(csvData)

# We have to seek the StringIO pseudo-file back to its start.
sf.seek(0,0)

# Now read in the same data via the csv reader object.
parsedData = csvReader.next()

When we look at what parsedData contains, we see a list like so:

[ '1', '2', 'three', 'four,five', '6' ]

Using StringIO rather than the adaptor class I presented earlier is a somewhat more heavy-weight way of solving the problem, but might fit your use better.

Convert::yEnc decodes yEncoded files and writes them to disk. Fileparts are saved to a temporary directory; when all parts of a filehave been received, the completed file is moved to its final location.

One of the things that helped me solve the problem was Kris Wehner's excellent weblog post on dealing with badly encoded character data using Java. His first suggestion is to use native2ascii, one of the lesser-known tools in Sun's Java 2 SDK:

native2ascii is the tool that converts from the binary UTF-8 encoding to an ASCII encoding with escapes, so it looks like uXXXX whenever there should be a non-ASCII character.

I had forgotten about this program, which turned 134 megabytes of data with an unknown character encoding into a UTF-8 file with a single command:

native2ascii -encoding 'UTF-8' badOldFile goodNewFile
read more:

• Joe Clark is setting up an ambitious accessibility project. The Open & Closed Project aims to write a set of standards for the four fields of accessible media: captioning, audio description, subtitling, and dubbing.

  The project will develop its set of standards through research and evidence-gathering. The standards will then be tested for a year in the real world, after which it training and certification programmes will be developed for practitioners. Finally the project will continue the work of developing and testing improved fonts for captioning and subtitling, and create a universal file format. Like I said, its an ambitious project.

  Ambitious projects need funding – in this case $7 million. But that’s not where you come in. Joe intends to fund raise that sum himself, however that in itself is a full time job, so Joe is looking for micropatronage to subsidize him for four months while he beavers away at the fundraising. Joe is aiming for the lucky sum of $7,777 and you can help by donating as much or as little as you like.

  The Open & Closed Project is not neccesarily a Web accessibilty project, except to the extent that Web sites use multimedia with one or more of those features, but it should benefit millions of people across the globe, in providing access to media both on and offline. I’d love to see it happen, so I’ll be contributing to Joe’s food money over the next few months. If you don’t feel the same way, you could always run one of his banners, which are well worth a look.

• 

Read or add comments