Sponsorised links
May 2008
CVXMOD – Convex optimization software in Python
by ogrisel
CVXMOD is a Python-based tool for expressing and solving convex optimization problems. It uses CVXOPT as its solver. It is developed by Jacob Mattingley, as PhD work under Stephen Boyd at Stanford University.
CVXMOD is primarily a modeling layer for CVXOPT. While it is possible to use CVXOPT directly, CVXMOD makes it faster and easier to build and solve problems. Advanced users who want to see or manipulate how their problems are being solved should consider using CVXOPT directly. Additional features are being added to CVXMOD beyond just modeling. These are currently experimental.
CVXMOD has a similar design philosophy to CVX, a convex optimization modeling language for Matlab®, and uses the principles of disciplined convex programming, as developed by Michael Grant, Stephen Boyd and Yinyu Ye.
March 2008
January 2008
Sponsorised links
December 2007
September 2007
July 2007
May 2007
Juras Vetrau. Блог о веб-разработках
by jvetrau
Менеджер проектов и проектировщик пользовательских интерфейсов. Специализация на веб-разработках — веб-приложениях, интернет- и интранет-системах, порталах и, периодически, средней руки сайтах.
April 2007
Modeling Cars with HyperNURBS
by kruty
Though the Chevy tutorial is dated by current Cinema 4D standards, portions of it remain somewhat viable. On the other hand, many plugins available since version 8 was released make much of this tutorial extraneous. Some of the techniques it teaches, I no longer even use myself (and cannot wholly recommend that anyone else learn to model this way!) - especially when the current release of C4D (v9 ) has included many many more modeling features not covered here, which only make this method more cumbersome.
3D Tutorials - Cinema 4D Tutorials : Modeling
by kruty
modeling - animation - Lighting - Materials/Textures - Effects - Rendering
March 2007
February 2007
DBAzine.com: Trees in SQL: Nested Sets and Materialized Path
by ogrisel
& 1 other
(via)
Relational databases are universally conceived of as an advance over their predecessors network and hierarchical models. Superior in every querying respect, they turned out to be surprisingly incomplete when modeling transitive dependencies. Almost every couple of months a question about how to model a tree in the database pops up at the comp.database.theory newsgroup. In this article I'll investigate two out of four well known approaches to accomplishing this and show a connection between them. We'll discover a new method that could be considered as a "mix-in" between materialized path and nested sets.
Making a tree with "millions and millions" of dynamic nodes
by ogrisel
First mail of a thread on the postgresql mailing list dealing of various ways to implement a tree structure with PostgreSQL.
Representing Trees in a relational DB
by ogrisel
& 1 other
(via)
This document describes an approach for handling hierarchical data in a relational database.
Denormalization - Wikipedia, the free encyclopedia
by ogrisel
(via)
Denormalization is the process of attempting to optimize the performance of a database by adding redundant data. It is sometimes necessary because current DBMSs implement the relational model poorly. A true relational DBMS would allow for a fully normalized database at the logical level, while providing physical storage of data that is tuned for high performance.
BENEFITS OF DENORMALIZED RELATIONAL DATABASE TABLES
by ogrisel
(via)
Heuristics for denormalizing relational database tables are examined with an objective of improving processing performance for data insertions, deletions and selection. Client-server applications necessitate consideration of denormalized database schemas as a means of achieving good system performance where the client-server interface is graphical (GUI) and the network capacity is limited by the network channel.
January 2007
December 2006
November 2006
October 2006
