Search Results for "b-link"

...This repository is a reference and overview of some of the most common ones. Principles and laws to follow such as: If a program is made up of two parts, part A, which must be executed by a single processor, and part B, which can be parallelised, then we see that adding multiple processors to the system executing the program can only have a limited benefit. It can potentially greatly improve the speed of part B - but the speed of part A will remain unchanged. Also, theories like The Broken Windows Theory, which suggests that visible signs of crime (or lack of care of an environment) lead to further and more serious crimes (or further deterioration of the environment). ...

Cooperation project between Goethe-University and Römische-Germanische Kommission. Will bring numismatic data online and tries to link the data with existing ones. ... resulting project code is planed to be open source!

- - - T H I S P R O J E C T M O V E D T O G I T H U B - - - A framework for the implementation of advanced real-time control systems which uses signal/block-based schematics (like Simulink) extended by several features like state machines and online-exchangeable sub-simulations. Besides, this framework properly handles multiple threads, their communication, allows to synchronise control systems to external events (e.g. variable timers or incoming network packages) and provides many other nice features. ...

...It stands upon the shoulders of many free/libre/open-source (FLOSS) libraries developed for processing low-resource languages, especially Persian and RTL languages Publications: Kashefi, O., Nasri, M., & Kanani, K. (2010). Towards Automatic Persian Spell Checking. SCICT. Kashefi, O., Sharifi, M., & Minaie, B. (2013). A novel string distance metric for ranking Persian respelling suggestions. Natural Language Engineering, 19(2), 259-284. Rasooli, M. S., Kahefi, O., & Minaei-Bidgoli, B. (2011). Effect of adaptive spell checking in Persian. In NLP-KE Contributors: Omid Kashefi Azadeh Zamanifar Masoumeh Mashaiekhi Meisam Pourafzal Reza Refaei Mohammad Hedayati Kamiar Kanani Mehrdad Senobari Sina Iravanin Mohammad Sadegh Rasooli Mohsen Hoseinalizadeh Mitra Nasri Alireza Dehlaghi Fatemeh Ahmadi Neda PourMorteza

Chemin optimal allows to draw nodes on a scene and link them with Arcs. You can affect values to each arc (the path's length). By clicking the launch button, chemin optimal show you the optimal path of the graphs using FORD algorithm. All operations are shown step by step. You can export the scene to a XML file. You can also load scene freom existing XML file. Chemin optimal check errors automatically before finding the minimal path.

Webtracks’ objective is to develop an approach and mechanism for constructing and propagating structured information to describe the linkage between distributed research objects in the context of academic activities.

Pamvotis is a Wireless LAN Simulator for all the current physical layer extentions of the IEEE 802.11 (IEEE 802.11 a/b/g) standard and for the IEEE 802.11e Draft for Quality of Service in WLANs.

Implementation of algorithm from paper 'Numerical Approximation of Option Premia in Displaced-Lognormal Heston Models' by A Dickinson. For code: click link under 'Develop' & checkout via svn or click link under Browse Code->SVN & download tarball

aztree library is an implementation of most types of tree data-structure in C language. The library will implement these different type of trees. Binary, Self-balancing binary search, B-trees, Tries, BSP, Non-binary and few used in Computer Graphics

DASS-GUI is a graphical user interface for pattern search in non-sequential data.

A framework for solving large systems of linear equations (Ax=b) in a distributed network using different iterative methods. The solver is written on Java, can be run on Windows or Linux. The solver is compatible with either MPICH2 or mpj-express.