Lattice-based key exchange on small integer solution problem

FXdiv 仅标头库，用于通过定点乘以逆除法 在现代CPU和GPU上，整数除法比乘法要慢几倍。 FXdiv实现了一种算法，用乘法和两次移位替换整数除法。 当应用程序执行相同除数的重复除法时，此算法可提高性能。 产品特点 uint32_t ， uint64_t和size_t整数除法 仅标头的库，无需安装或构建 与C99，C ++，OpenCL和CUDA兼容 使用特定于平台的编译器内部函数以获得最佳性能 包含单元测试和微基准测试 例 # include /* Division of array by a constant: reference implementation */ void divide_array_c ( size_t length, uint32_t array[], uint32_t divisor) { for ( size_t i = 0 ; i < length; i++) { array[i] /= divisor; } } /* Division of array by a constant: implementati

这是关于混合整数规划的电子书，高清，最新版本，经典著作，英文版

HugeInteger Class) Create a class HugeInteger that uses a 40-element array of digits to store integers as large as 40 digits each. Provide member functions input, output, add and subtract. For comparing HugeInteger objects, provide functions isEqualTo, isNotEqualTo, isGreaterThan, isLessThan, isGreaterThanOrEqualTo and isLessThanOrEqualTo — each of these is a “predicate” function that simply returns true if the relationship holds between the two HugeIntegers and returns false if the relationship does not hold. Also, provide a predicate function isZero.  If you feel ambitious, provide member functions multiply, divide and modulus

国外人编写的一个分数阶系统的控制工具箱，可以设计分数阶控制器，评价系统性能 — Abroad were prepared by a fractional order systems control toolbox, can be designed fractional order controllers, evaluation of system performance

蚁群算法是一种优化选择进化算法，应用本算法可以解算gps载波相位整周模糊度 ，Ant_clony_of_alogrithm