Numerical experiments dichotomy of personal computers Number experimental report...

Coarsening approximations of belief functions

vc++环境的快速傅立叶变换的算法库，含VC++的测试源代码-vc++ environment Fast Fourier Transform algorithm library, containing VC++ the test source code

资源描述使用遗传算法解决TFS问题，10个城市，节点已给出

这是一款IBM大牛开发的用于论文里面实验验证用的人工数据集，可以产生项集，也可以产生序列，里面有readme文件，写着怎么使用呢，在windows下的命令行里运行就可以。

应用背景2011: Peer-to-Peer 38 and 60 GHz in Austin Texas Cellular (rooftop-to-ground) 2012: Cellular 28 GHz in New York City 2013: Cellular and Backhaul 72 GHz in New York City 2013: Capacity Analysis and Channel Models for 5G关键技术Links made at large range of receiver and transmitter angles • Many scatterers near both RX and TX when placed 1.5m above ground • Antenna Beam-steering can help make several NLOS links • Objects, such as brick, reflect 38 GHz better than 60 GHz due to lower diffusive scattering.

位解码器使用 verliog，FPGA，使用 verliog，FPGA，使用 verliog，FPGA，使用 verliog，FPGA，使用 verliog，FPGA，使用 verliog，FPGA，使用 verliog，FPGA，使用 verliog 的8 位解码器上的 led 指示灯的8 位解码器上的 led 指示灯的8 位解码器上的 led...

在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分。 编程任务：对于给定n堆石子,编程计算合并成一堆的最小得分和最大得分。-Playground in a circle around the stones are placed n heap. Stone is to have the order to merge into a pile. Provisions can only choose 2 adjacent stones piled into a heap of new and new pile of stones a few in mind for its combined score. Try to design an algorithm to calculate the n heap into a pile of stones the minimum scores and maximum scores. Programming tasks: for a given n stack stone, into a pile of programming the calculation of the minimum scores and maximum scores.

Prediciendo resultdos de partidos de 足球德尔世界巴西 2014年，con redes y bayesinas 大数据

采用的是回溯法和分支限界的思想求解迷宫问题                                                         

FDTD simulaton of a pulse hitting a lossy material with epsilonr = 5, sigma=0.05