Scheduled Commit

data/retrieval_individual-1b2a6102-80bb-417d-a081-cf780f49c66c.jsonl

@@ -341,3 +341,5 @@
 {"tstamp": 1738737161.6519, "task_type": "retrieval", "type": "chat", "model": "intfloat/multilingual-e5-large-instruct", "gen_params": {}, "start": 1738737159.2858, "finish": 1738737161.6519, "ip": "", "conv_id": "d5df256999494ac28efafcddb0b84c0d", "model_name": "intfloat/multilingual-e5-large-instruct", "prompt": "Which test was devised to determine whether robots can think?", "output": [["Which test was devised to determine whether robots can think?", "Turing test\n\nThe test was introduced by Turing in his 1950 paper \"Computing Machinery and Intelligence\" while working at the University of Manchester. It opens with the words: \"I propose to consider the question, 'Can machines think? Because \"thinking\" is difficult to define, Turing chooses to \"replace the question by another, which is closely related to it and is expressed in relatively unambiguous words.\" Turing describes the new form of the problem in terms of a three-person game called the \"imitation game\", in which an interrogator asks questions of a man and a woman in another room in order to determine the correct sex of the two players. Turing's new question is: \"Are there imaginable digital computers which would do well in the imitation game?\" This question, Turing believed, was one that could actually be answered. In the remainder of the paper, he argued against all the major objections to the proposition that \"machines can think\".\nSince Turing introduced his test, it has been both highly influential and widely criticized, and has become an important concept in the philosophy of artificial intelligence. Philosopher John Searle would comment on the Turing test in his Chinese room argument, a thought experiment that stipulates that a machine cannot have a \"mind\", \"understanding\", or \"consciousness\", regardless of how intelligently or human-like the program may make the computer behave. Searle criticizes Turing's test and claims it is insufficient to detect the presence of consciousness.\nHistory"]], "corpus": "wikipedia"}
 {"tstamp": 1738737161.6519, "task_type": "retrieval", "type": "chat", "model": "voyage-multilingual-2", "gen_params": {}, "start": 1738737159.2858, "finish": 1738737161.6519, "ip": "", "conv_id": "2a95cad9fb7f48c79b60e9b5f83fbd4b", "model_name": "voyage-multilingual-2", "prompt": "Which test was devised to determine whether robots can think?", "output": [["Which test was devised to determine whether robots can think?", "Turing test\n\nThe test was introduced by Turing in his 1950 paper \"Computing Machinery and Intelligence\" while working at the University of Manchester. It opens with the words: \"I propose to consider the question, 'Can machines think? Because \"thinking\" is difficult to define, Turing chooses to \"replace the question by another, which is closely related to it and is expressed in relatively unambiguous words.\" Turing describes the new form of the problem in terms of a three-person game called the \"imitation game\", in which an interrogator asks questions of a man and a woman in another room in order to determine the correct sex of the two players. Turing's new question is: \"Are there imaginable digital computers which would do well in the imitation game?\" This question, Turing believed, was one that could actually be answered. In the remainder of the paper, he argued against all the major objections to the proposition that \"machines can think\".\nSince Turing introduced his test, it has been both highly influential and widely criticized, and has become an important concept in the philosophy of artificial intelligence. Philosopher John Searle would comment on the Turing test in his Chinese room argument, a thought experiment that stipulates that a machine cannot have a \"mind\", \"understanding\", or \"consciousness\", regardless of how intelligently or human-like the program may make the computer behave. Searle criticizes Turing's test and claims it is insufficient to detect the presence of consciousness.\nHistory"]], "corpus": "wikipedia"}
 {"tstamp": 1738741862.7007, "task_type": "retrieval", "type": "chat", "model": "GritLM/GritLM-7B", "gen_params": {}, "start": 1738741862.4359, "finish": 1738741862.7007, "ip": "", "conv_id": "056df1b06b0445b9b3f96a25b73c2e4a", "model_name": "GritLM/GritLM-7B", "prompt": "ПРивет", "output": [["ПРивет", "List of Soviet computer systems\n\nKrista (Криста) Micro-80 (Микро-80) — experimental PC, based on 8080-compatible processor\nMicrosha (Микроша) — modification of Radio-86RK\nMIR, МИР (:uk:ЕОМ \"МИР-1\", :uk:ЕОМ \"МИР-2\")\nNairi (Наири)\nOrion-128 (Орион-128)\nPromin (Проминь)\nPS-2000, PS-3000 — multiprocessor supercomputers in the 1980s\nRazdan (Раздан)\nRadon — real-time computer, designed for anti-aircraft defense\nRadio-86RK — simplified and modified version of Micro-80\nSneg (Снег)\nSpecialist (Специалист)\nSVS\nTsUM-1 (ЦУМ-1)\nTIA-MC-1 An arcade system\nUM (УМ)\nUT-88\nVesna and Sneg — early mainframes\nList of operating systems\nFor Kronos\nKronos\nFor BESM\nD-68 (Д-68, Диспетчер-68, Dispatcher-68)\nDISPAK (“Диспетчер Пакетов,” Dispatcher of the Packets)\nDUBNA (“ДУБНА”)\nFor ES EVM\nDOS/ES (“Disk Operation system for ES EVM”)\nOS/ES (“Disk Operation system for ES EVM”)\nFor SM EVM\nRAFOS (РАФОС), FOBOS (ФОБОС) and FODOS (ФОДОС) — RT-11 clones\nOSRV (ОСРВ) — RSX-11M clone, one of the most popular Soviet multi-user systems\nDEMOS  — BSD-based Unix-like; later was ported to x86 and some other architectures\nINMOS (ИНМОС, Инструментальная мобильная операционная система)\nFor 8-bit microcomputers\nMicroDOS (МикроДОС) — CP/M 2.2 clone\nFor ZX Spectrum clones\niS-DOS, TASiS\nDNA-OS\nFor different platforms\nMISS (Multipurpose Interactive timeSharing System) - ES EVM ES1010, ES EVM ES1045, D3-28M, PC-compatible, etc.\nMOS (operating system) -  a Soviet clone of Unix in the 1980s"]], "corpus": "wikipedia"}
+{"tstamp": 1738742238.5784, "task_type": "retrieval", "type": "chat", "model": "Alibaba-NLP/gte-Qwen2-7B-instruct", "gen_params": {}, "start": 1738742236.3592, "finish": 1738742238.5784, "ip": "", "conv_id": "29d10e7850584fc1904c5c0d15164980", "model_name": "Alibaba-NLP/gte-Qwen2-7B-instruct", "prompt": "ЧТо такое chromeDB?", "output": [["ЧТо такое chromeDB?", "Title: DeepChrome 2.0: Investigating and Improving Architectures, Visualizations, & Experiments\n\nAbstract: Histone modifications play a critical role in gene regulation. Consequently, predicting gene expression from histone modification signals is a highly motivated problem in epigenetics. We build upon the work of DeepChrome by Singh et al. (2016), who trained classifiers that map histone modification signals to gene expression. We present a novel visualization technique for providing insight into combinatorial relationships among histone modifications for gene regulation that uses a generative adversarial network to generate histone modification signals. We also explore and compare various architectural changes, with results suggesting that the 645k-parameter convolutional neural network from DeepChrome has the same predictive power as a 12-parameter linear network. Results from cross-cell prediction experiments, where the model is trained and tested on datasets of varying sizes, cell-types, and correlations, suggest the relationship between histone modification signals and gene expression is independent of cell type. We release our PyTorch re-implementation of DeepChrome on GitHub \\footnote{\\url{github.com/ssss1029/gene_expression_294}}.\\parfillskip=0pt"]], "corpus": "arxiv"}
+{"tstamp": 1738742238.5784, "task_type": "retrieval", "type": "chat", "model": "BAAI/bge-large-en-v1.5", "gen_params": {}, "start": 1738742236.3592, "finish": 1738742238.5784, "ip": "", "conv_id": "ef95110e84c64130bca17a5ed0e69b67", "model_name": "BAAI/bge-large-en-v1.5", "prompt": "ЧТо такое chromeDB?", "output": [["ЧТо такое chromeDB?", "Title: The (Un)Reliability of NVD Vulnerable Versions Data: an Empirical Experiment on Google Chrome Vulnerabilities\n\nAbstract: NVD is one of the most popular databases used by researchers to conduct empirical research on data sets of vulnerabilities. Our recent analysis on Chrome vulnerability data reported by NVD has revealed an abnormally phenomenon in the data where almost vulnerabilities were originated from the first versions. This inspires our experiment to validate the reliability of the NVD vulnerable version data. In this experiment, we verify for each version of Chrome that NVD claims vulnerable is actually vulnerable. The experiment revealed several errors in the vulnerability data of Chrome. Furthermore, we have also analyzed how these errors might impact the conclusions of an empirical study on foundational vulnerability. Our results show that different conclusions could be obtained due to the data errors."]], "corpus": "arxiv"}