FreeBASIC,BASIC语言界的黑马 学习过QuickBASIC的用户就可以上手的BASIC语言, 完全免费开源,能够产生高品质的机械码,跨平台,
FreeBASIC如同他的名字一样,免费而且基於已建立的BASIC语法,
易学易用是他的优点,但是不光是简单而已,功能十分强大。
几乎支援所有QB的原指令,且有许多追加功能
产生快速高品质的机械码,不依靠VM等虚拟机器
完全免费,包含原始码,编译出的程式无授权问题
支援MS-DOS/Win32/Linux多平台,也可以编译GUI程序
拥有众多第三方函式库支援(Allegro/SDL..以及DirectX/Win32API)
Unicode支援,使用中文十分容易
编译EXE/OBJ/LIB/DLL都很容易,以便和其他语言应用
zh.wikipedia.org/wiki/F

热门内容

Link prediction for knowledge graphs is the task of predicting missing relationships between entities. Previous work on link prediction has focused on shallow, fast models which can scale to large knowledge graphs. However, these models learn less expressive features than deep, multi-layer models -- which potentially limits performance. In this work, we introduce ConvE, a multi-layer convolutional network model for link prediction, and report state-of-the-art results for several established datasets. We also show that the model is highly parameter efficient, yielding the same performance as DistMult and R-GCN with 8x and 17x fewer parameters. Analysis of our model suggests that it is particularly effective at modelling nodes with high indegree -- which are common in highly-connected, complex knowledge graphs such as Freebase and YAGO3. In addition, it has been noted that the WN18 and FB15k datasets suffer from test set leakage, due to inverse relations from the training set being present in the test set -- however, the extent of this issue has so far not been quantified. We find this problem to be severe: a simple rule-based model can achieve state-of-the-art results on both WN18 and FB15k. To ensure that models are evaluated on datasets where simply exploiting inverse relations cannot yield competitive results, we investigate and validate several commonly used datasets -- deriving robust variants where necessary. We then perform experiments on these robust datasets for our own and several previously proposed models, and find that ConvE achieves state-of-the-art Mean Reciprocal Rank across all datasets.

0
27
下载
预览

最新论文

We formalize human language understanding as a structured prediction task where the output is a partially ordered set (poset). Current encoder-decoder architectures do not take the poset structure of semantics into account properly, thus suffering from poor compositional generalization ability. In this paper, we propose a novel hierarchical poset decoding paradigm for compositional generalization in language. Intuitively: (1) the proposed paradigm enforces partial permutation invariance in semantics, thus avoiding overfitting to bias ordering information; (2) the hierarchical mechanism allows to capture high-level structures of posets. We evaluate our proposed decoder on Compositional Freebase Questions (CFQ), a large and realistic natural language question answering dataset that is specifically designed to measure compositional generalization. Results show that it outperforms current decoders.

0
0
下载
预览
Top