Search Results for "implicit" - Page 4
Sort By:
Showing 121 open source projects for "implicit"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
$300 Free Credits to Build on Google CloudStart your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
-
1
The Panini Language
Better Modularity, Better Concurrency
This project makes the compiler and tools for the Panini language available. A central goal of the Panini language is to make concurrent programming easier and less error-prone. The main new feature in Panini is called a capsule. A capsule is like an actor but better because it largely retains the traditional approach for reasoning about programs as a sequence of operations, abstracts away all details of thread creation and locking, and supports fully-automatic compile-time analysis of... -
2
DuMuX
Porous-Media Simulator
DuMuX, DUNE for multi-{phase, component, scale, physics, ...} flow and transport in porous media, is a free and open-source simulator for flow and transport processes in porous media. It is based on the Distributed and Unified Numerics Environment DUNE, dune-project.org. Its main intention is to provide a sustainable and consistent framework for the implementation and application of model concepts, constitutive relations, discretizations, and solvers. It has been successfully applied to CO2... -
3
MOBIDICK (MOdular But IntegrateD applICation frameworK) is dedicated to gather as less as possible Java frameworks in order to complete full needs of large business application and allow regeneration of code, even when java frameworks change.
-
4
Relation Tags
Source code for be able to use Relation Tags.
...All this dialogs files finish either with "...dlg.cpp" or ",,,dlg.h". Please read "readme" file. It is recommended to use a binary matrix class like BinMatrix in order to have enough speed for calculations of implicit relations in a system of bogus tags with big data. Need to be compiled with C++11 and Qt libraries -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
Automalator
State Dependency deconstructor and mapper for C source code.
Flowcharts not telling you what you want to know about some C source code? Try a State Dependency map! Every C source file is an implemention of a state machine. Implicit in the definition of a state machine is a network of dependencies between the states. The Automalator * deconstructs the C code into the core state machine * collates the transactions into the dependency net * generates a diagram-format file with the states and dependencies as the nodes and edges. Pre-requisites * Perl - tested with versions 5.12.3, 5.14.2 and 5.20.2, Windows, Linux and MAC * Get the Automalator by downloading the zip, or checking out or exporting the SVN trunk * copy the source code of interest into "project.c" * windows - double-click "src2map.bat" * linux & MAC - navigate the command line to the "project" folder, then run "src2map.sh" * open "project.gml" file with diagramming software. -
6
ActiveModelSerializers
Serializer implementation and Rails hooks
...If there is to be a 1.0 release of AMS, it will need to address the general needs of serialization in much the way ActiveJob can be used with different workers. The next major release is in development. We're starting simple and avoiding, at least at the outset, all the complications in AMS version, especially all the implicit behavior from guessing the serializer, to the association's serializer, to the serialization type, etc. The basic idea is that models to serializers are a one to many relationship. Everything will need to be explicit. If you want to serialize a User with a UserSerializer, you'll need to call it directly. The serializer will essentially be for defining a basic JSON:API resource object: id, type, attributes, and relationships. -
7
LDNI-based Solid Modeling
Solid Modeling Framework in GPU
This project provides a set of solid modeling tools which aims to help processing 3D objects with complex topology and geometry that are widely used in many industrial applications (e.g., microstructure design and manufacturing, biomedical products and applications, jewelry products, reverse engineering). The system is completely GPU-based and heavily based on an implicit representation named LDNI. -
8
ForStoch
Fortran Stochastic Simulator for Chemical Kinetics
...Because the SSA simulates every reaction event, the amount of the computational time is huge when models have many reaction channels and species.This drawback motivates many attempts to improve the efficiency with the accuracy.The ForStoch includes orignial Gillespie SSA and other approximation algorithms. You can run very simply the algorithms with several test case systems. The algorithms: 1) Gillespie SSA 2) Explicit tau-leaping 3) Implicit tau-leaping 4) Trapezoidal tau-leaping 5) Fully implicit BE-BE 6) Fully implicit TR-TR 7) Fully implicit BE-TR 8) Implicit second order weak Taylor method with alpha=1.0 and beta=1.0 9) Implicit second order weak Taylor method with alpha=1.0 and beta=0.0 10) Implicit second order weak Taylor method with alpha=0.5 -
9
capstone
Capstone disassembly engine
Multiple-arch, multiple-platform disassembly engine with advanced features -
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
10
WARNING: Project moved to http://github.com/scemama/irpf90 IRPF90 is a Fortran90 preprocessor written in Python for programming using the Implicit Reference to Parameters (IRP) method. It simplifies the development of large fortran codes in the field of scientific high performance computing.
-
11
GENESIS (GEneral NEural SImulation System) is a software platform for the simulation of neural systems ranging from subcellular components and biochemical reactions to complex models of single neurons, large networks, and systems-level processes.
-
12
Fast Matrix for Java
General purpose matrix utilities for Java in Parallel Computing
Fast Matrix for Java (fm4j) is a general-purpose matrix utility library for computing with dense matrices. fm4j encapsulated different underlying implementations and select the optimal one in run-time depending on the size of the input matrix. Moreover, fm4j employs Java (Tm) Concurrency to take advantage of the computation power of multi-cor processors. -
13
An extremely simple Java Rule Engine (Non-JSR 94) that uses rules you create in Java. Simply create your basic rules, implement the single "passes" method for each, then chain them together in an XML file to create more complex rules.
-
14
finiteDiff
Program for solving the Schrödinger equation
This little set of programs compute the solutions to one and three dimensional Schrödinger equations with different potentials. Explicit, implicit and eigenvalue methods are included. The explicit and implicit method are provided in C++ whereas the matrix method is implemented as a MATLAB scipt. All these method use finite differences. -
15
A compact development framework for Adobe ColdFusion applications, implementing an MVC design pattern for web applications. CFRhino has both an event and extension frameworks allowing it to be fully extended.
-
16
DHFS
A dynamic slot allocation technique to improve performance for HFS.
...It is based on the observation that at different period of time there may be idle map (or reduce) slots, as the job proceeds from map phase to reduce phase. We can use the unused map slots for those overloaded reduce tasks to improve the performance of the MapReduce workload, and vice versa, by breaking the implicit assumption that map tasks are run on map slots and reduce tasks are run on reduce slots. For example, at the beginning of MapReduce workload computation, there will be only computing map tasks and no computing reduce tasks, i.e., all the computation workload lies in the map-side. In that case, we can make use of idle reduce slots for running map tasks. ... -
17
JCSI
JCSI is a prototype tool for the analysis of Java Card CAP files.
...Actual values of variables are abstracted into security levels, and bytecode instructions are executed over an abstract domain. The tool can be used for discovering security issues due to explicit or implicit information flows and for checking security properties of Java Card applications downloaded from untrusted sources. -
18
Ofeli (as an acronym for Open, Fast and Efficient Level set Implementation) demonstrates how to operate an image segmentation algorithm of Y. Shi and W. C. Karl |1|, using a discrete approach for the approximation of level-set based curve evolution (implicit active contours). This is a novel (2005) and fast algorithm without the need of solving partial differential equations (PDE) while preserving the advantages of level set methods, such as the automatic handling of topological changes. Considerable speedups (×100) have been demonstrated as compared to PDE-based narrow band level-set implementations.
-
19
JActor
High Performance, Lock Free Java Actors
JActor is a high-performance actor framework designed to make vertical scalability easy. JActor achieves its speed, in part, by almost always executing synchronously--though it is easy enough to force asynchronous processing when needed. JActor is divided into several GitHub projects: JActor - https://github.com/laforge49/JActor JID - https://github.com/laforge49/JID JFile - https://github.com/laforge49/JFile JANetty - https://github.com/kumarshantanu/JANetty -
20
calc3d
3d calculus engine
This program lets you visualize three dimensional mathematical elements , viz Point, vector, line curve and allows to plot and explore 3 Dimensional Graphs of Mathematical Functions. It supports 1. Piecewise 2D cartesian and polar plots 2. Implicit cartesian and polar plots 3. Parametric 3D plot (little bit scripting also there) 4. Implicit 3D plot 5. Lines, Vector, Plane, Polygons plot. 6. Save and open scenes -
21
SOPFVM
Sort Of Purely Functional Virtual Machine
...Currently supports closures, objects, and continuations. Uses in-place modification of singly referenced objects to support tuples, vectors, and hash maps. Eventually aims to include implicit parallelism. Released under the MIT License. -
22
HTTP Anti Flood/DoS Security Module
Detect Flooder IPs, Reduce Attack Surface against HTTP Flood Attacks
...You can test module here: http://www.iosec.org/test.php (demo) Watch the Proof of Concept video: http://goo.gl/dSiAL Hakin9 IT Security Magazine Article about IOSEC http://goo.gl/aQM4Di (different format -> http://goo.gl/JKMUPN) IJNSA Article at http://goo.gl/LLxRdX WP Plugin Page http://goo.gl/nF5nD CHANGES v.1.8.2 - Iptables Auto Ban Bash Script Included - Token Access via Implicit Deny - Reverse Proxy Support - reCAPTCHA Support Do you want more features? Check for third party addons http://sf.net/projects/iosecaddons Gökhan Muharremoğlu -
23
reflective
C++ library providing detailed run-time code reflection
Reflective is a C++ library providing detailed run-time code reflection, supporting: - member-data or member-function based properties with getters and setters - method-based actions, with return type and any number of fully qualified parameters - vectorized construction\destruction\copy\move of objects, to allow efficient implementation of non-template generic collection - reflection of class templates, with fully qualified parameters information - indirection levels of pointers, and constness of each indirection level - safe up\down casts (often programmers forget that even an implicit cast may involve an offset or an indirection) - self reflection: reflecting data is itself reflected - multiple\virtual base classes. Of course, you may not like them, but if they are used somewhere in your code, it's not a problem -
24
easyNRG
A simple MATLAB implementation of Wilsons NRG-method
...The implementation is very slow and rather for educational purposes to get an idea of the NRG-method. For example: it is not considered, that only matrix elements between states, whos occupation number differs by one and S_z differs by 1/2. There is only implicit parallelisation implemented by vectorizing the time consuming parts of the code. This code is licensed under the CC BY-SA 3.0 license (http://creativecommons.org/licenses/by-sa/3.0/, http://creativecommons.org/licenses/by-sa/3.0/legalcode) -
25
Last Java Collection Library
Java library to work with scalar arrays as usual Collections
...Also the library gives such useful methods as contains and indexOf for objects with Iterable interface only. Yeah. There is some stupidness because all implementations differ between each other only types and this code has 100% implicit coupling and duplications. But Java has not left other way.