Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
Build Securely on AWS with Proven Frameworks
Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.
Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
This is a SDK which can nest/layout the part/geometry/polygon on the material or sheet intelligently, you can get the best utilization of the materials, this SDK also support read/write DXF/DWG files and part-in-part nesting.
New nesting lagorithm is implenmented, more good to support true shape part or material.
Linear Program Solver (Solvexo) is an optimization package intended for solving linear programming problems. The main features of the Solvexo are:
· Solvexo solver is based on the efficient implementation of the simplex method (one or two phases);
· Solvexo provides not only an answer, but a detailed solution process as a sequence of simplex matrices, so you can use it in studying (teaching) linear programming.
· Solvexo provides a solution with the graphic method for problems with...
http://www.filehelpers.net
The FileHelpers are an easy to use .NET library written in C#. Is designed to read/write data from flat files with fixed length or delimited records (CSV). Also has support to import/export data from different data storages (Excel, Access, SqlServer)
Code on GitHub: https://github.com/MarcosMeli/FileHelpers
Transform your applications and workflows into powerful agentic systems at global scale.
Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
Basic routing and spatial functions using OpenStreetMap data
A mapping application for OpenStreetMap that renders OSM or MapQuest tiles and does basic routing from a built-in database.
The main focus of this project is the development of a high-performance routing engine that can handle a variety of routing and vehicle constraints on demand without additional pre-processing of the road network. An additional goal is the development of a class library centered around a built-in, object-oriented database used for processing and storing OSM map data...
Ertha is an open source GIS whose main focus is to guarantee easy extensibility and straightforward integration of custom modules. It provides basic geographic rendering and topologic analysis and exposes the main data structures loaded from shapefiles.
Shears is a C# library for list processing, combinatorial problems, and functional programming. It is intended to be useful for everyday coding, with an emphasis on producing brief, readable code. It's also lots of fun!
ARMR provides a foundation for creating an efficient in-memory database. Its unique list processing structures simplify programming logic and allow the developer to rapidly sort, group, and select data. Give your app a hypercard like capability.
Many people love programming contests. There are tons of contests or online judges like TopCoder, UVA, SPOJ, etc. This project's goal is to store and keep track of what a programmer have done and studied so far.
GEP is an evolutionary algorithm for function finding. This framework is a powerful way of expressing and coding genetic-like structures and quickly finding solutions through evolution by common genetic operators.
MDQuery is a multi-dimensional aggregation class library written in VB.net originally, ported to C#.net with a lightweight query language for rapid prototyping.
A "programming language" that can generate random strings. Useful for creating password, but has many other uses (it can generate IP addresses, fully random but pronounceable words, ..., anything that a string can represent). Written in C#
OW.NET -- 1-Wire API port from Java (and J#) to C#. Use the Dallas 1-Wire and iButton chips with standard C# using a serial adapter (also CF.net) or the TMEX drivers on the Windows platform. No J# distribution installation required.
USPS One Code - Intelligent Mail Barcode (4-State Customer Barcode) - encoder implementation with VS 2008. Source code in C# and VB.NET and binaries for .NET (1.1, 2.0 and 3.5), .NET CF (2.0 and 3.5) and Mono (1.* and 2.0).
A light weight Desktop Search Application built in .net C# and Vb.net implemented using file search recursive algorithm and threads. provides explorer like view of files. It can be implemented in mono(platform independent).currently only runs on Microsoft Platform.
SimMetrics is a Similarity Metric Library, e.g. from edit distance's (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman). Work provided by UK Sheffield University funded by (AKT) an IRC sponsored by EPSRC, grant number GR/N15764/01.
PileWorks provides the organizational structure for coordinating several different projects which approach some aspect of Pile Technology. PileWorks defines a set of interfaces and implements some basic infrastructure for Pile engines and agents.
Provides functional programming abstractions for C# including map, fold, filter functions for .NET collections, the option data type, a lazy type, a functional list type, lazy functional lists, and more. Superseded by http://sf.net/projects/sasa/
Finds bad examples for the local search Path Partitioning algorithm
Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf.
Requirements:
Microsoft Automatic Graph Layout
http://research.microsoft.com/en-us/projects/msagl/
Gurobi Optimizer
http://www.gurobi.com/
Permutations, Combinations, and...