simulated annealing optimization and importance-sampling
Adaptive Simulated Annealing (ASA) is a C-language code that finds the best global fit of a nonlinear cost-function over a D-dimensional space. ASA has over 100 OPTIONS to provide robust tuning over many classes of nonlinear stochastic systems.
Hyacc is an efficient and practical Yacc/Bison-compatible full LR(1)/LALR(1)/LR(0) and partial LR(k) parser generator in ANSI C based on Knuth and Pager's LR(1) algorithms. Generated parser can be used in open-source or commercial software.
Some Useful C-Utilities
Libcutils provides a self-contained set of fundamental routines which are essential to basically any Unix utility or daemon application written in C. The library provides fundamental data structures such as lists, hash-maps, strings and parsing functions for JSON or the typical dot-file based configuration data. The following list summarizes the currently supported functionality: * length delimited instead of NULL terminated strings * memory management based on reference counting * several list processing functions like iterators and map-reduce * support of [Ideal Hash Tries](http://infoscience.epfl.ch/record/64398/files/idealhashtrees.pdf) for highly efficient hash map data structures * parsers for [JSON](http://json.org) data and the text configuration files found in Unix system * doubly linked circular lists for reliable event queues * support for test and debugging of memory management problems such as memory leaks
北邮传感网络 The research of sensory networks in BUPT, Beijing, China!
CppThreadPool is a Thread Pool pattern implementation in c++ for the unix/Linux environment.
CGL(C Generic Library) is a stl-like library written in pure C.It implements iterators, memory management,generic containers such as list,map, generic algorithms such as sort() and search(),and it can manipulate any types of data.
an simple thread pool in linux, based on POSIX thread API. Management thread will retrieve needless idle thread to keep in low resource consumption.
用c实现了常用的容器，如果rbtree,hashtable,list,vector,deque,heap,map,以及定时器，os api，应用开发框架。 实现了一个基于btree索引算法的文件数据库,提供了断电保护,以及事务提交与回滚等接口
An implementation of Dantzig-Wolfe decomposition built upon GLPK
An implementation of Dantzig-Wolfe decomposition built upon the GNU Linear Programming Kit. This is a command line tool for solving properly decomposed linear programs. There are several examples and some documentation to guide the use of this solver. Forked over to GitHub (see link).
Roll model for trading strategy to C++ or FPGA via Matlab tools
To start: Use the PDF No comments or further support will be provided once my workflow goal is complete. See below for these workflow details. Rationale of this project: There will be more wrong than right in this project as it is strictly for learning to reverse engineer a real world research paper from the banking industry. This is not to include items like charting or trading execution. I am not interested in the performance of this strategy either. As a result, I keep critics, haters, and trolls at bay. This is just to keep this process transparent no different than using an open source software project model. I just hope people will contribute to make this project/process better and even correct. If you fork this, please let me know so I can further learn from your work. Why Matlab? As a result, I am trying to 'rapidly' generate an algorithm with Mupad, generate custom M scripts, and implement into a systematic model with Simulink and Stateflow tools.
Toolkit for Automatic Control and Dynamic Optimization
ACADO Toolkit is a software environment and algorithm collection for automatic control and dynamic optimization. It provides a general framework for using a great variety of algorithms for direct optimal control, including model predictive control, state and parameter estimation and robust optimization. ACADO Toolkit is implemented as self-contained C++ code and comes along with user-friendly MATLAB interface. The object-oriented design allows for convenient coupling of existing optimization packages and for extending it with user-written optimization routines.
The solution to all your problems
The Jsolution package is a collection of programs, scripts,libraries and documents that i have written and use in my daily life.
SHOBHIT-Improved String Search is new improved string search algorithm
In Computer Science, SHOBHIT-Improved String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in August, 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first, last, mid1 and mid2 index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/4) and in worst case, time complexity is O(n – (m/4) ). In all the cases best, average and worst its space complexity is O(1). For more information please visit the following link :- http://learandexperiment.blogspot.in
SHOBHIT-Advance String Search is a pattern search Algorithm
In Computer Science, SHOBHIT-Advance String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first and last index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/2) and in worst case, time complexity is O(n – (m/2) ). In all the cases best, average and worst its space complexity is O(1). This algorithm checks two characters at a time. In best case where the substring is at the start of the text, we can check all the character of substring in only m/2 time. In worst case where the substring is at the last of the text, we need to iterate till n – m For more information please visit the following link:- http://learandexperiment.blogspot.in
This is example code that I reference in my blogs on software development.
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.
Multicore SWARM (Software and Algorithms for Running on Multicore Processors) is an open source library for developing efficient and portable implementations that make use of multi-core processors. David A. Bader (Georgia Tech) began SWARM in 1994.
UIMP(Unified Image Manipulation Program) is an OS independent Image Processing system, which provides over 1000 algorithms and supports web online, console and GUI program.
Human-like mouse movements
Library provides a function of 'human-like mouse movements', ie mouse movements as human. The library will be useful for those who are developing all kinds of bots for games or online casino \ poker. Written in C + +, has a small size of 13 kilobytes.
Legacy Film to DVD Project
Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.