Scheduled Commit

data/retrieval_individual-23cee96f-6768-4f6e-9a62-131dedf90618.jsonl

@@ -148,3 +148,7 @@
 {"tstamp": 1732327306.5893, "task_type": "retrieval", "type": "chat", "model": "sentence-transformers/all-MiniLM-L6-v2", "gen_params": {}, "start": 1732327304.312, "finish": 1732327306.5893, "ip": "", "conv_id": "cdf6fb4d46b544e2a4991eb0b903c3d2", "model_name": "sentence-transformers/all-MiniLM-L6-v2", "prompt": "are all orthogonal matrices symmetric?", "output": [["are all orthogonal matrices symmetric?", "Stackoverflow Stackexchange\n\nQ: What is RFHUTIL used for? What is RFHUTIL. What are the uses of it?\n\nA: From the SupportPac IH03 page:\n\nIt allows test messages to be captured\n  and stored in files, and then used to\n  drive WBI Message Broker Version 7\n  applications. Output messages can also\n  be read and displayed in a variety of\n  formats. The formats include two types\n  of XML as well as matched against a\n  COBOL copybook. The data can be in\n  EBCDIC or ASCII. An RFH2 header can be\n  added to the message before the\n  message is sent.\n\nWebSphere MQ messages can contain a Rules and Formatting Header or RFH for short.  The RFHUtil (and it's client-based companion RFHUtilc) allow for a wide variety of message manipulation with and without these headers.  Because the headers are used extensively by WebSphere Message Broker and for v6 Pub/Sub the utility provides a convenient way to perform ad-hoc testing of message flows, publications and subscriptions.  It also allows the loading and unloading of queues to files or files to queues, for example to perform regression testing against a known workload.\n"]], "corpus": "stackexchange"}
 {"tstamp": 1732365120.6461, "task_type": "retrieval", "type": "chat", "model": "embed-english-v3.0", "gen_params": {}, "start": 1732365118.4456, "finish": 1732365120.6461, "ip": "", "conv_id": "44fc14cf70754333badc91ad7796444f", "model_name": "embed-english-v3.0", "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": 1732365120.6461, "task_type": "retrieval", "type": "chat", "model": "sentence-transformers/all-MiniLM-L6-v2", "gen_params": {}, "start": 1732365118.4456, "finish": 1732365120.6461, "ip": "", "conv_id": "3dc882779f5342d8b7e8e1325e869539", "model_name": "sentence-transformers/all-MiniLM-L6-v2", "prompt": "Which test was devised to determine whether robots can think?", "output": [["Which test was devised to determine whether robots can think?", "History of robots\n\nA similar tale can be found in the near contemporary Indian Buddhist Jataka tales, but here the intricacy of the automation does not match that of Master Yan.Prior to the introduction of Buddhism in the Common Era, Chinese philosophers did not seriously consider the distinction between appearance and reality. The Liezi rebuts Buddhist philosophies and likens human creative powers to that of the Creator. The Indian Lokapannatti, a collection of cycles and lores produced in the 11th or 12th century AD, tells the story of how an army of automated soldiers (bhuta vahana yanta or \"Spirit movement machines\") were crafted to protect the relics of Buddha in a secret stupa. The plans for making such humanoid automatons were stolen from the kingdom of Rome, a generic term for the Greco-Roman-Byzantine culture. According to the Lokapannatti, the Yavanas (\"Greek-speakers\") used the automatons to carry out trade and farming, but also captured and executed criminals. Roman automation makers who left the kingdom were pursued and killed by the automatons. According to the Lokapannatti, the emperor Asoka hears the story of the secret stupa and sets out to find it. "]], "corpus": "wikipedia"}
+{"tstamp": 1732369212.3877, "task_type": "retrieval", "type": "chat", "model": "intfloat/e5-mistral-7b-instruct", "gen_params": {}, "start": 1732369209.9704, "finish": 1732369212.3877, "ip": "", "conv_id": "5969646075224b70a7bd2b920e53e684", "model_name": "intfloat/e5-mistral-7b-instruct", "prompt": "How to reset password", "output": [["How to reset password", "Password\n\nMoving a step further, augmented systems for password-authenticated key agreement (e.g., AMP, B-SPEKE, PAK-Z, SRP-6) avoid both the conflict and limitation of hash-based methods. An augmented system allows a client to prove knowledge of the password to a server, where the server knows only a (not exactly) hashed password, and where the un-hashed password is required to gain access.\nProcedures for changing passwords\nUsually, a system must provide a way to change a password, either because a user believes the current password has been (or might have been) compromised, or as a precautionary measure. If a new password is passed to the system in unencrypted form, security can be lost (e.g., via wiretapping) before the new password can even be installed in the password database and if the new password is given to a compromised employee, little is gained. Some websites include the user-selected password in an unencrypted confirmation e-mail message, with the obvious increased vulnerability.\nIdentity management systems are increasingly used to automate the issuance of replacements for lost passwords, a feature called self-service password reset. The user's identity is verified by asking questions and comparing the answers to ones previously stored (i.e., when the account was opened).\nSome password reset questions ask for personal information that could be found on social media, such as mother's maiden name.  As a result, some security experts recommend either making up one's own questions or giving false answers."]], "corpus": "wikipedia"}
+{"tstamp": 1732369212.3877, "task_type": "retrieval", "type": "chat", "model": "nomic-ai/nomic-embed-text-v1.5", "gen_params": {}, "start": 1732369209.9704, "finish": 1732369212.3877, "ip": "", "conv_id": "bac10c6b92c1403eb7821b969257136d", "model_name": "nomic-ai/nomic-embed-text-v1.5", "prompt": "How to reset password", "output": [["How to reset password", "Password\n\nMoving a step further, augmented systems for password-authenticated key agreement (e.g., AMP, B-SPEKE, PAK-Z, SRP-6) avoid both the conflict and limitation of hash-based methods. An augmented system allows a client to prove knowledge of the password to a server, where the server knows only a (not exactly) hashed password, and where the un-hashed password is required to gain access.\nProcedures for changing passwords\nUsually, a system must provide a way to change a password, either because a user believes the current password has been (or might have been) compromised, or as a precautionary measure. If a new password is passed to the system in unencrypted form, security can be lost (e.g., via wiretapping) before the new password can even be installed in the password database and if the new password is given to a compromised employee, little is gained. Some websites include the user-selected password in an unencrypted confirmation e-mail message, with the obvious increased vulnerability.\nIdentity management systems are increasingly used to automate the issuance of replacements for lost passwords, a feature called self-service password reset. The user's identity is verified by asking questions and comparing the answers to ones previously stored (i.e., when the account was opened).\nSome password reset questions ask for personal information that could be found on social media, such as mother's maiden name.  As a result, some security experts recommend either making up one's own questions or giving false answers."]], "corpus": "wikipedia"}
+{"tstamp": 1732369375.4322, "task_type": "retrieval", "type": "chat", "model": "text-embedding-3-large", "gen_params": {}, "start": 1732369373.3178, "finish": 1732369375.4322, "ip": "", "conv_id": "590375482e25475fa3798737f2f4014c", "model_name": "text-embedding-3-large", "prompt": "How to reset password", "output": [["How to reset password", "Title: Web password recovery --- a necessary evil?\n\nAbstract: Web password recovery, enabling a user who forgets their password to re-establish a shared secret with a website, is very widely implemented. However, use of such a fall-back system brings with it additional vulnerabilities to user authentication. This paper provides a framework within which such systems can be analysed systematically, and uses this to help gain a better understanding of how such systems are best implemented. To this end, a model for web password recovery is given, and existing techniques are documented and analysed within the context of this model. This leads naturally to a set of recommendations governing how such systems should be implemented to maximise security. A range of issues for further research are also highlighted."]], "corpus": "arxiv"}
+{"tstamp": 1732369375.4322, "task_type": "retrieval", "type": "chat", "model": "sentence-transformers/all-MiniLM-L6-v2", "gen_params": {}, "start": 1732369373.3178, "finish": 1732369375.4322, "ip": "", "conv_id": "b64a6a4040074235946d04cc50ce33ec", "model_name": "sentence-transformers/all-MiniLM-L6-v2", "prompt": "How to reset password", "output": [["How to reset password", "Title: Density functional theory study of Na at Al(111) and O at Ru(0001)\n\nAbstract: The success of density functional theory for the description of the adsorption of atoms on surfaces is well established, and based on recent calculations using gradient corrections, it has been shown that it also describes well the dissociative adsorption of molecules at surfaces - admittedly however, the data base for reactions at surfaces is still somewhat small. In the present paper the power of density functional theory calculations is demonstrated by investigations for two different adsorption systems, namely, one with a strongly electropositive adsorbate [Na on Al(111)] and one with a strongly electronegative adsorbate [O on Ru(0001)]. In each case, new hitherto not expected adsorbate phases have been predicted by the theory: For Na on Al(111) the stability of a \"four-layer\" surface alloy was identified while for O on Ru(0001) it was predicted that the formation of a (1 x 1)-O adlayer should be possible which implies that the apparent saturation coverage of 1/2 is due to kinetic hindering."]], "corpus": "arxiv"}