Search
Code Directory
 ASP
 ASP.NET
 C/C++
 CFML
 CGI/PERL
 Delphi
 Development
 Flash
 HTML
 Java
 JavaScript
 Pascal
 PHP
 Python
 SQL
 Tools
 Visual Basic & VB.NET
 XML
New Code
.Net Runtime Library for Delphi 6.0.4.0
Scimbo 1.64
AnyMap JS Maps 8.4.2
GetOrgChart 2.5.3
AnyChart JS Charts and Dashboards 8.4.2
OrgChart JS 3.8.0
dbForge Compare Bundle for MySQL 8.1
dbForge Search for SQL Server 2.3
Database Workbench Pro 5.5.0
Luxand FaceSDK 7.0
SSIS Data Flow Components 1.10
Entity Developer Professional 6.3
dbForge Index Manager for SQL Server 1.9
dbForge Data Generator For MySQL 2.2
Magento Australia Post eParcel Extension 1.0
Top Code
Deals and Discounts Website Script 1.0.2
ADO.NET Provider for ExactTarget 1.0
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Availability Booking Calendar PHP 1.0
PHP GZ Blog Script 1.1
ATN Jobs Software 4.0
ATN Mall 2.0
WeBuilder 2015 13.3
PHP Digital Download Script 1.0.4
Related Code
Brand New Story Mv Making Film
Brand New Story Mv Making Filmrmvb
Sebastian Brand
Brand And Bound
Visa Tell Brand Id
Role Of Brand And Advertising
Brand Buddy Bot
Utilizing Hr As A Corporate Brand Building Tool
Preffered Brand Of Vodka
Brand
All | Freeware

Code 1-11 of 11   






LINEINMASK determines portions of the line in and out of a mask

[inX inY] = LINEINMASK(XS,YS,BW,XV,YV) computes a the segments of the
line specified by verticies XV and YV that are inside the mask BW.
Points XS and YS specify the limits (or pixel values) of the
coordinates of the matrix BW.

[inX inY] = LINEINMASK(BW,XV,YV) assumes XS=1:N and YS=1:M where
[M,N]=SIZE(BW).

[inX inY] =...



Sequence Generator (file ID #24620) has been renamed to CORE - Constraint Randomization Environment. Interface and code structure of v0.91 are explained in this manual.



Current development concentrates on these topics:



This is Brand new so please advise-me if problems occurs.

Here you can find an m-file with three different algorithms for inpolygon test.
Depending on the input data, the one that is extimate to be the best will be chosen.



ViperRep is a reputation management plugin for WordPress. It allows you to track mentions of your brand, your products, or even your own name, around the web. It adds a simple widget to your WordPress Dashboard so you can see the data quickly and...



Before you begin, you must signup HERE in order to receive a Savings.com API Key needed to activate the plugin.

This is the absolute fastest, easiest and most effective way to add coupons to your WordPress site! Brought to you...



Why put your products as free stuff while you can add marketing value when each download happens? With more than 175 million registered users (2011), Twitter is a social media big player. Analytically talking, combining free stuff with social...



Even if totally m-coded, this routine is particularly fast in computing convex hull of 2D points. In many cases seems to be much faster than the matlab library routine. The main reason is that, differently from convhull, this algorithm jumps the...



A collection of plugins that optimize WordPress 3 to use (and brand!) as a CMS. Includes our custom plugins and some extra's. It is intended as an all-in-one package. Using this plugin in combination with the recommended plugins will turn...



Pixelpost is an open-source, standards-compliant, multi-lingual, fully extensible photoblog application for the web. Anyone who has web-space that meets the requirements can download and use Pixelpost for free!

New Features :



ShopCMS is an advanced paypal shopping cart, catalog manager and CMS. It is free and supports full paypal shopping cart integration, customizable templates, runs on the mySQL database, has parent and subcategories with multi-level navigation...



This is Brand new so please advise-me if problems occurs.

Here you can find an m-file with three different algorithms for inpolygon test.
Depending on the input data, the one that is extimate to be the best will be chosen.